Low-rank improvements of two-level grid preconditioned matrices

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F18%3A00495392" target="_blank" >RIV/68145535:_____/18:00495392 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0377042717304582" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0377042717304582</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cam.2017.09.027" target="_blank" >10.1016/j.cam.2017.09.027</a>

Result language
angličtina
Original language name
Low-rank improvements of two-level grid preconditioned matrices
Original language description
As an alternative to basic two-level and multilevel iteration preconditioners for elliptic partial differential equations, it is shown that low-rank approximations, based on approximate eigenvectors to the largest eigenvalues of the inverse two-level Schur complement matrix, can give arbitrarily accurate preconditioners that hold uniformly with respect to mesh sizes. The methods are particularly efficient for problems with multiple right hand sides.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)