Fulltext

Revisiting ( k , ℓ )-step methods

Gutknecht, Martin

In: Numerical Algorithms, 2015, vol. 69, no. 2, p. 455-469

Ajouter à la liste personnelle
    Titre
    • Revisiting ( k , ℓ )-step methods
    Auteur
    • Gutknecht, Martin. Seminar for Applied Mathematics, ETH Zurich, CH-8092, Zurich, Switzerland
    Type de document
    • Postprint
    Langue
    • Anglais
    Publié dans
    • Numerical Algorithms, 2015, vol. 69, no. 2, p. 455-469. Springer US; http://www.springer-ny.com
    Autre version électronique
    Identifiant OAI-PMH
    • oai:doc.rero.ch:331168
    Summary
    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.