Incremental unknowns and graph techniques with in-depth refinement

DSpace/Manakin Repository

Incremental unknowns and graph techniques with in-depth refinement

Show full item record


Ficha descriptiva:


Title: Incremental unknowns and graph techniques with in-depth refinement
Handle URI: https://hdl.handle.net/10925/734
Abstract: With in-depth refinement, the condition number of the incremental unknowns matrix associated to the Laplace operator is p(d)O(1/ H2)O( logd<sup/>h 3) for the first order incremental unknowns, and q(d)O(1/H2) O((logdh)2) for the second order incremental unknowns, where d is the depth of the refinement, H is the mesh size of the coarsest grid, h is the mesh size of the finest grid, p(d) = d - 1/2 and q(d) = d - 1/2 1/12d(d2 - 1). Furthermore, if block diagonal (scaling) preconditioning is used, the condition number of the preconditioned incremental unknowns matrix associated to the Laplace operator is p(d)O((logdh)2) for the first order incremental unknowns, and q(d)O( logd h ) for the second order incremental unknowns. For comparison, the condition number of the nodal unknowns matrix associated to the Laplace operator is O(1/h2). Therefore, the incremental unknowns preconditioner is efficient with in-depth refinement, but its efficiency deteriorates at some rate as the depth of the refinement grows.
Palabras Claves: Matemáticas
Datos de publicación: International Journal of Numerical Analysis and Modeling, Vol.4, Nº2, 149-177, 2007
Facultad: Facultad de Ingeniería
Carrera: Plan Común Ingeniería

Files in this item

Archivos Size Format View Description
incremental_garcia.pdf 208.0Kb PDF Thumbnail Artículo

This item appears in the following Collection(s)

Show full item record

Browse

My Account