메뉴 건너뛰기




Volumn , Issue , 2004, Pages 300-309

Spacetime meshing with adaptive refinement and coarsening

Author keywords

Adaptivity; Advancing front; Mesh generation; Spacetime discontinuous Galerkin; Tetrahedral meshes; Unstructured meshes

Indexed keywords

ADAPTIVITY; ADVANCING FRONT; MESH GENERATION; SPACETIME DISCONTINUOUS GALERKIN; TETRAHEDRAL MESHES; UNSTRUCTURED MESHES;

EID: 4544270077     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (60)

References (36)
  • 1
    • 84966254196 scopus 로고
    • On the bisection method for triangles
    • A. Adler. On the bisection method for triangles. Math. Comp. 40(162):571-574, 1983.
    • (1983) Math. Comp. , vol.40 , Issue.162 , pp. 571-574
    • Adler, A.1
  • 2
    • 0035075413 scopus 로고    scopus 로고
    • Locally adaptive tetrahedral meshes using bisection
    • D. N. Arnold, A. Mukherjee, and L. Pouly. Locally adaptive tetrahedral meshes using bisection. SIAM J. Sci. Comput. 22(2):431-448, 2001.
    • (2001) SIAM J. Sci. Comput. , vol.22 , Issue.2 , pp. 431-448
    • Arnold, D.N.1    Mukherjee, A.2    Pouly, L.3
  • 4
    • 0000679678 scopus 로고    scopus 로고
    • Mesh generation
    • Elsevier Science Publishers B.V. North-Holland
    • M. Bern and P. Plassmann. Mesh generation. Handbook of Computational Geometry, 291-332, 2000. Elsevier Science Publishers B.V. North-Holland.
    • (2000) Handbook of Computational Geometry , pp. 291-332
    • Bern, M.1    Plassmann, P.2
  • 5
    • 0029487171 scopus 로고
    • Tetrahedral grid refinement
    • J. Bey. Tetrahedral grid refinement. Computing 55(4):355-378, 1995.
    • (1995) Computing , vol.55 , Issue.4 , pp. 355-378
    • Bey, J.1
  • 6
    • 0002154319 scopus 로고    scopus 로고
    • Error estimates for finite element methods for hyperbolic conservation laws
    • B. Cockburn and P. A. Gremaud. Error estimates for finite element methods for hyperbolic conservation laws. SIAM J. Num. Anal. 33:522-554, 1996.
    • (1996) SIAM J. Num. Anal. , vol.33 , pp. 522-554
    • Cockburn, B.1    Gremaud, P.A.2
  • 10
    • 84862424283 scopus 로고    scopus 로고
    • Parallel Programming Laboratory, Computer Science Department. University of Illinois
    • L. V. Kalé et al. Parallel Programming Laboratory, Computer Science Department. University of Illinois, 〈http:// charm.cs.uiuc.edu/〉.
    • Kalé, L.V.1
  • 11
    • 0002479236 scopus 로고    scopus 로고
    • Charm++: Parallel programming with message-driven objects
    • MIT Press
    • L. V. Kalé and S. Krishnan. Charm++: Parallel programming with message-driven objects. Parallel Programming using C++, 175-213, 1996. MIT Press.
    • (1996) Parallel Programming Using C++ , pp. 175-213
    • Kalé, L.V.1    Krishnan, S.2
  • 12
  • 13
    • 84968466551 scopus 로고
    • On the shape of tetrahedra from bisection
    • A. Liu and B. Joe. On the shape of tetrahedra from bisection. Math. Comp. 63(207):141-154, 1994.
    • (1994) Math. Comp. , vol.63 , Issue.207 , pp. 141-154
    • Liu, A.1    Joe, B.2
  • 14
    • 0000311308 scopus 로고
    • Quality local refinement of tetrahedral meshes based on bisection
    • A. Liu and B. Joe. Quality local refinement of tetrahedral meshes based on bisection. SIAM J. Sci. Comput. 16:1269-1291, 1995.
    • (1995) SIAM J. Sci. Comput. , vol.16 , pp. 1269-1291
    • Liu, A.1    Joe, B.2
  • 15
    • 0012196248 scopus 로고    scopus 로고
    • Space-time methods for hyperbolic conservation laws
    • ICASE/LaRC Interdisciplinary Series in Science and Engineering 6, Kluwer
    • R. B. Lowrie, P. L. Roe, and B. van Leer. Space-time methods for hyperbolic conservation laws. Barriers and Challenges in Computational Fluid Dynamics, 79-98, 1998. ICASE/LaRC Interdisciplinary Series in Science and Engineering 6, Kluwer.
    • (1998) Barriers and Challenges in Computational Fluid Dynamics , pp. 79-98
    • Lowrie, R.B.1    Roe, P.L.2    Van Leer, B.3
  • 16
    • 0000430187 scopus 로고
    • Local bisection refinement for n-simplicial grids generated by reflection
    • J. M. Maubach. Local bisection refinement for n-simplicial grids generated by reflection. SIAM J. Sci. Comput. 16:210-227, 1995.
    • (1995) SIAM J. Sci. Comput. , vol.16 , pp. 210-227
    • Maubach, J.M.1
  • 19
    • 0024883616 scopus 로고
    • A comparison of adaptive refinement techniques for elliptic problems
    • W. F. Mitchell. A comparison of adaptive refinement techniques for elliptic problems. ACM Trans. Math. Soft 15:326-347, 1989.
    • (1989) ACM Trans. Math. Soft , vol.15 , pp. 326-347
    • Mitchell, W.F.1
  • 20
    • 0001940223 scopus 로고
    • Adaptive refinement for arbitrary finite-element spaces with hierarchical bases
    • W. F. Mitchell. Adaptive refinement for arbitrary finite-element spaces with hierarchical bases. J. Comp. Appl. Math. 36:65-78, 1991.
    • (1991) J. Comp. Appl. Math. , vol.36 , pp. 65-78
    • Mitchell, W.F.1
  • 22
    • 0040417542 scopus 로고
    • An explicit finite element method for the wave equation
    • G. R. Richter. An explicit finite element method for the wave equation. Applied Numerical Mathematics 16:65-80, 1994.
    • (1994) Applied Numerical Mathematics , vol.16 , pp. 65-80
    • Richter, G.R.1
  • 23
    • 0021405398 scopus 로고
    • Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
    • M. C. Rivara. Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. Internat. J. Numer. Methods Eng. 20:745-756, 1984.
    • (1984) Internat. J. Numer. Methods Eng. , vol.20 , pp. 745-756
    • Rivara, M.C.1
  • 24
    • 0023382344 scopus 로고
    • A grid generator based on 4-triangles conforming mesh-refinement algorithms
    • M. C. Rivara. A grid generator based on 4-triangles conforming mesh-refinement algorithms. Internat. J. Numer. Methods Eng. 24(7):1343-1354, 1987.
    • (1987) Internat. J. Numer. Methods Eng. , vol.24 , Issue.7 , pp. 1343-1354
    • Rivara, M.C.1
  • 25
    • 0002753776 scopus 로고
    • Local modification of meshes for adaptive and/or multigrid finite element methods
    • M. C. Rivara. Local modification of meshes for adaptive and/or multigrid finite element methods. J. Comp. Appl. Math. 36:79-89, 1991.
    • (1991) J. Comp. Appl. Math. , vol.36 , pp. 79-89
    • Rivara, M.C.1
  • 26
    • 84966230118 scopus 로고
    • A lower bound on the angles of triangles constructed by bisecting the longest side
    • I. G. Rosenberg and F. Stenger. A lower bound on the angles of triangles constructed by bisecting the longest side. Math. Comput. 29:390-395, 1975.
    • (1975) Math. Comput. , vol.29 , pp. 390-395
    • Rosenberg, I.G.1    Stenger, F.2
  • 29
    • 84966206638 scopus 로고
    • On faster convergence of the bisection method for all triangles
    • M. Stynes. On faster convergence of the bisection method for all triangles. Math. Comp. 35(152):1195-1201, 1980.
    • (1980) Math. Comp. , vol.35 , Issue.152 , pp. 1195-1201
    • Stynes, M.1
  • 30
    • 4544296228 scopus 로고    scopus 로고
    • Propagation path properties in iterative longest-edge refinement
    • J. P. Suárez, A. Plaza, and G. F. Carey. Propagation path properties in iterative longest-edge refinement. Proc. 12th Internat. Meshing Roundtable, 79-90, 2003. 〈http://www. andrew.cmu.edu/user/sowen/abstracts/Su983.html〉.
    • (2003) Proc. 12th Internat. Meshing Roundtable , pp. 79-90
    • Suárez, J.P.1    Plaza, A.2    Carey, G.F.3
  • 33
    • 4544258208 scopus 로고    scopus 로고
    • Pitching tents in space-time: Mesh generation for discontinuous Galerkin method
    • A. Üngör and A. Sheffer. Pitching tents in space-time: Mesh generation for discontinuous Galerkin method. Int. J. Foundations of Computer Science 13(2):201-221, 2002.
    • (2002) Int. J. Foundations of Computer Science , vol.13 , Issue.2 , pp. 201-221
    • Üngör, A.1    Sheffer, A.2
  • 34


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.