
Open access
Author
Date
2015-06Type
- Journal Article
Abstract
In the mid-1980s Parsons (SIAM J. Numer. Anal. 24, 188–198, 1987), and the author (Gutknecht, Numer. Math. 56, 179–213, 1989) independently had the idea to generalize linear stationary k-step methods to stationary (k, ℓ)-step methods, which were further generalized to nonstationary and even nonlinear (k, ℓ)-step methods. Later, conjugate-gradient-type methods that are (k, ℓ)-step methods of a similar sort were introduced and investigated in the PhD thesis of Barth (1996) under T. A. Manteuffel. Recently, the family of Induced Dimension Reduction (IDR) methods (Sonneveld and van Gijzen, SIAM J. Sci. Comp. 31, 1035–1062, 2008) aroused some interest for the class of linear nonstationary (k, ℓ)-step methods because IDR(s) fits into it and belongs to a somewhat special subclass; see Gutknecht (ETNA 36, 126–148, 2010). In this paper we first reformulate and review the class of nonlinear nonstationary (k, ℓ)-step methods and a basic theoretical result obtained in the author’s 1989 article. Then we specialize to linear methods and introduce alternative iterations that can be used to implement them and compare them with the iterations suggested and investigated by Barth and Manteuffel. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000095656Publication status
publishedExternal links
Journal / series
Numerical AlgorithmsVolume
Pages / Article No.
Publisher
SpringerSubject
Iterative method; Linear equations; Nonlinear equations; Krylov subspace method; (k, ℓ)–step method; (s, t)–recursion; Semiiterative methodOrganisational unit
03435 - Schwab, Christoph / Schwab, Christoph
Notes
It was possible to publish this article open access thanks to a Swiss National Licence with the publisher.More
Show all metadata