Lepp-bisection algorithms, applications and mathematical properties
type: Item
instance of: scholarly article
title: Lepp-bisection algorithms, applications and mathematical properties
zbMATH Open document ID: 1167.65343
author: Maria-Cecilia Rivara
published in: Applied Numerical Mathematics
publication date: 2009-07-02T00:00:00Z
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 65N55
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 5574602
zbMATH Keywords: bisection method
zbMATH Keywords: longest edge bisection
zbMATH Keywords: triangulation
zbMATH Keywords: refinement algorithm
zbMATH Keywords: finite element method
zbMATH Keywords: right-triangle bintree triangulation
zbMATH Keywords: numerical examples
zbMATH Keywords: parallel computation
zbMATH Keywords: multigrid methods
zbMATH Keywords: multiresolution algorithms
zbMATH Keywords: terrain modeling
zbMATH Keywords: visualization
describes a project that uses: PLTMG
MaRDI profile type: Publication
full work available at URL: j.apnum.2008.12.011
OpenAlex ID: W2039953181
cites work: On the Bisection Method for Triangles
cites work: Q3813123
cites work: PLTMG: A Software Package for Solving Elliptic Partial Differential Equations
cites work: Right-triangulated irregular networks
cites work: Geometry and topology for mesh generation
cites work: Complexity of the bisection method
cites work: Automatic construction of non-obtuse boundary and/or interface Delaunay triangulations for control volume methods
cites work: Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms
cites work: Adaptive refinement of unstructured finite-element meshes
cites work: A Proof of Convergence and an Error Bound for the Method of Bisection in R n
cites work: Quality Local Refinement of Tetrahedral Meshes Based on Bisection
cites work: Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
cites work: An algorithm for adaptive refinement of triangular element meshes
cites work: COMPUTATIONAL GEOMETRY COLUMN 23
cites work: A geometric diagram and hybrid scheme for triangle subdivision
cites work: Design and data structure of fully adaptive, multigrid, finite-element software
cites work: Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
cites work: Q3742666
cites work: Selective refinement/derefinement algorithms for sequences of nested triangulations
cites work: New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
cites work: A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
cites work: A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
cites work: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
cites work: On Faster Convergence of the Bisection Method for all Triangles
cites work: Q3999760
DOI: 10.1016/J.APNUM.2008.12.011
Recommended article: Approximation of satisfactory bisection problems
Recommended article: Leverrier’s Algorithm: A New Proof and Extensions
Recommended article: Multithread parallelization of LEPP-bisection algorithms
Recommended article: Linear Convergence and the Bisection Algorithm
Recommended article: On Regularity Lemmas and their Algorithmic Applications
Recommended article: A new extension of Leverrier's algorithm
Recommended article: The Algorithmic Aspects of the Regularity Lemma
Recommended article: Q4708558
Recommended article: An algorithmic separating hyperplane theorem and its applications
Recommended article: Asymptotic near optimality of the bisection method
description: scientific article; zbMATH DE number 5574602