On global and local mesh refinements by a generalized conforming bisection algorithm
暂无分享,去创建一个
[1] Michael J. Todd. Optimal Dissection of Simplices , 1978 .
[2] Martin Stynes. On Faster Convergence of the Bisection Method for all Triangles , 2010 .
[3] G. Carey,et al. Local refinement of simplicial grids based on the skeleton , 2000 .
[4] Miloš Zlámal,et al. On the finite element method , 1968 .
[5] A. Liu,et al. On the shape of tetrahedra from bisection , 1994 .
[6] María Cecilia Rivara,et al. The 4-triangles longest-side partition of triangles and linear refinement algorithms , 1996, Math. Comput..
[7] Barry Joe,et al. Quality Local Refinement of Tetrahedral Meshes Based on Bisection , 1995, SIAM J. Sci. Comput..
[8] Baker Kearfott. A proof of convergence and an error bound for the method of bisection in ⁿ , 1978 .
[9] Kenneth Eriksson,et al. AN ADAPTIVE FINITE ELEMENT METHOD WITH EFFICIENT MAXIMUM NORM ERROR CONTROL FOR ELLIPTIC PROBLEMS , 1994 .
[10] K. Sikorski. A three-dimensional analogue to the method of bisections for solving nonlinear equations , 1979 .
[11] Sergey Korotov,et al. On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions , 2008, Comput. Math. Appl..
[12] F. Stenger,et al. A lower bound on the angles of triangles constructed by bisecting the longest side , 1975 .
[13] M. Rivara. Selective refinement/derefinement algorithms for sequences of nested triangulations , 1989 .
[14] M. Rivara. Lepp-bisection algorithms, applications and mathematical properties , 2009 .
[15] Eberhard Bänsch,et al. Local mesh refinement in 2 and 3 dimensions , 1991, IMPACT Comput. Sci. Eng..
[16] S. Korotov,et al. Strong regularity of a family of face-to-face partitions generated by the longest-edge bisection algorithm , 2008 .
[17] Martin Stynes. An N-Dimensional bisection method for solving systems of n equations in N unknowns , 1979 .
[18] ROB STEVENSON,et al. The completion of locally refined simplicial partitions created by bisection , 2008, Math. Comput..
[19] M. Rivara. Algorithms for refining triangular grids suitable for adaptive and multigrid techniques , 1984 .
[20] M. Rivara,et al. A 3-D refinement algorithm suitable for adaptive and multi-grid techniques , 1992 .
[21] Andrew Adler,et al. On the bisection method for triangles , 1983 .
[22] Kris Sikorski,et al. A bisection method for systems of nonlinear equations , 1984, TOMS.
[23] Reiner Horst,et al. On generalized bisection of n-simplices , 1997, Math. Comput..
[24] Douglas N. Arnold,et al. Locally Adapted Tetrahedral Meshes Using Bisection , 2000, SIAM Journal on Scientific Computing.
[25] Joseph M. Maubach,et al. Local bisection refinement for $n$-simplicial grids generated by reflection , 2017 .
[26] M. Stynes. On faster convergence of the bisection method for certain triangles , 1979 .
[27] T. Apel. Anisotropic Finite Elements: Local Estimates and Applications , 1999 .