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...

Descripción completa

Detalles Bibliográficos
Autores principales: Pearson, John W., Pestana, Jennifer, Silvester, David J.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Berlin Heidelberg 2017
Materias:
Article
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

Internet

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