메뉴 건너뛰기
Mathematics of Computation
Volumn 77, Issue 261, 2008, Pages 227-241
The completion of locally refined simplicial partitions created by bisection
Author keywords

Adaptive finite element methods; Bisection; Conforming partitions; n simplices
Indexed keywords

EID: 38849110048     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-07-01959-X     Document Type: Article
Times cited : (368)
References (10)
  • 1
    • 0035075413 scopus 로고    scopus 로고
    • Locally adapted tetrahedral meshes using bisection
    • MR1780608 2002h:65204
    • D. N. Arnold, A. Mukherjee, and L. Pouly. Locally adapted tetrahedral meshes using bisection. SIAM J. Sci. Comput., 22(2):431-448, 2000. MR1780608 (2002h:65204)
    • (2000) SIAM J. Sci. Comput , vol.22 , Issue.2 , pp. 431-448
    • Arnold, D.N.1    Mukherjee, A.2    Pouly, L.3
  • 2
    • 34250882899 scopus 로고
    • Local mesh refinement in 2 and 3 dimensions
    • MR1141298 92h:65150
    • E. Bänsch. Local mesh refinement in 2 and 3 dimensions. Impact Comput. Sci. Engrg., 3(3):181-191, 1991. MR1141298 (92h:65150)
    • (1991) Impact Comput. Sci. Engrg , vol.3 , Issue.3 , pp. 181-191
    • Bänsch, E.1
  • 3
    • 2442452617 scopus 로고    scopus 로고
    • Adaptive finite element methods with convergence rates
    • MR2050077 2005d:65222
    • P. Binev, W. Dahmen, and R. DeVore. Adaptive finite element methods with convergence rates. Numer. Math., 97(2):219 - 268, 2004. MR2050077 (2005d:65222)
    • (2004) Numer. Math , vol.97 , Issue.2 , pp. 219-268
    • Binev, P.1    Dahmen, W.2    DeVore, R.3
  • 4
    • 0039030905 scopus 로고    scopus 로고
    • Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
    • MR1751367 2001f:65132
    • J. Bey. Simplicial grid refinement: on Freudenthal's algorithm and the optimal number of congruence classes. Numer. Math., 85(1):1-29, 2000. MR1751367 (2001f:65132)
    • (2000) Numer. Math , vol.85 , Issue.1 , pp. 1-29
    • Bey, J.1
  • 5
    • 0000947789 scopus 로고
    • A recursive approach to local mesh refinement in two and three dimensions
    • MR1329875 95m:65207
    • I. Kossaczký. A recursive approach to local mesh refinement in two and three dimensions. J. Comput. Appl. Math., 55(3):275-288, 1994. MR1329875 (95m:65207)
    • (1994) J. Comput. Appl. Math , vol.55 , Issue.3 , pp. 275-288
    • Kossaczký, I.1
  • 6
    • 0000430187 scopus 로고
    • Local bisection refinement for n-simplicial grids generated by reflection
    • MR1311687 95i:65128
    • J. Maubach. Local bisection refinement for n-simplicial grids generated by reflection. SIAM J. Sci. Comput., 16(1):210-227, 1995. MR1311687 (95i:65128)
    • (1995) SIAM J. Sci. Comput , vol.16 , Issue.1 , pp. 210-227
    • Maubach, J.1
  • 7
    • 0034447334 scopus 로고    scopus 로고
    • Data oscillation and convergence of adaptive FEM
    • MR1770058 2001g:65157
    • P. Morin, R. Nochetto, and K. Siebert. Data oscillation and convergence of adaptive FEM. SIAM J. Numer. Anal., 38(2):466-488, 2000. MR1770058 (2001g:65157)
    • (2000) SIAM J. Numer. Anal , vol.38 , Issue.2 , pp. 466-488
    • Morin, P.1    Nochetto, R.2    Siebert, K.3
  • 9
    • 34250183086 scopus 로고    scopus 로고
    • Optimality of a standard adaptive finite element method
    • R.P. Stevenson. Optimality of a standard adaptive finite element method. Found. Comput Math., 7(2):245-269, 2007.
    • (2007) Found. Comput Math , vol.7 , Issue.2 , pp. 245-269
    • Stevenson, R.P.1
  • 10
    • 0031374455 scopus 로고    scopus 로고
    • An algorithm for adaptive mesh refinement in n dimensions
    • MR1475530 98d:65152
    • C. T. Traxler. An algorithm for adaptive mesh refinement in n dimensions. Computing, 59(2):115-137, 1997. MR1475530 (98d:65152)
    • (1997) Computing , vol.59 , Issue.2 , pp. 115-137
    • Traxler, C.T.1

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