New Estimates for the Rate of Convergence of the Method of Subspace Corrections

New Estimates for the Rate of Convergence of the Method of Subspace Corrections

Year:    2008

Numerical Mathematics: Theory, Methods and Applications, Vol. 1 (2008), Iss. 1 : pp. 44–56

Abstract

We discuss estimates for the rate of convergence of the method of successive subspace corrections in terms of condition number estimate for the method of parallel subspace corrections. We provide upper bounds and in a special case, a lower bound for preconditioners defined via the method of successive subspace corrections.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2008-NMTMA-6041

Numerical Mathematics: Theory, Methods and Applications, Vol. 1 (2008), Iss. 1 : pp. 44–56

Published online:    2008-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    13

Keywords:    Method of subspace corrections preconditioning convergence rate of linear iterative method.