Cargando…
Refined saddle-point preconditioners for discretized Stokes problems
This paper is concerned with the implementation of efficient solution algorithms for elliptic problems with constraints. We establish theory which shows that including a simple scaling within well-established block diagonal preconditioners for Stokes problems can result in significantly faster conve...
Autores principales: | Pearson, John W., Pestana, Jennifer, Silvester, David J. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5775988/ https://www.ncbi.nlm.nih.gov/pubmed/29391651 http://dx.doi.org/10.1007/s00211-017-0908-4 |
Ejemplares similares
-
Preconditioners for the geometry optimisation and saddle point search of molecular systems
por: Mones, Letif, et al.
Publicado: (2018) -
Incomplete Augmented Lagrangian Preconditioner for Steady Incompressible Navier-Stokes Equations
por: Tan, Ning-Bo, et al.
Publicado: (2013) -
Saddle-point problems and their iterative solution
por: Rozložník, Miroslav
Publicado: (2018) -
On approximate-inverse preconditioners
por: Gould, N I M, et al.
Publicado: (1995) -
Quantum computing and preconditioners for hydrological linear systems
por: Golden, John, et al.
Publicado: (2022)