Skip to main content
Top
Published in: BIT Numerical Mathematics 3/2019

02-04-2019

Variants of residual smoothing with a small residual gap

Authors: Kensuke Aihara, Ryosuke Komeyama, Emiko Ishiwata

Published in: BIT Numerical Mathematics | Issue 3/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Short-recurrence Krylov subspace methods, such as conjugate gradient squared-type methods, often exhibit large oscillations in the residual norms, leading to a large residual gap and a loss of attainable accuracy for the approximate solutions. Residual smoothing is useful for obtaining smooth convergence for the residual norms, but it has been shown that this does not improve the maximum attainable accuracy in most cases. In the present study, we reformulate the smoothing scheme from a novel perspective. The smoothed sequences do not usually affect the primary sequences in conventional smoothing schemes. In contrast, we design a variant of residual smoothing in which the primary and smoothed sequences influence each other. This approach enables us to avoid the propagation of large rounding errors, and results in a smaller residual gap, and thus a higher attainable accuracy. We present a rounding error analysis and numerical experiments to demonstrate the effectiveness of our proposed smoothing scheme.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Aihara, K.: Variants of the groupwise update strategy for short-recurrence Krylov subspace methods. Numer. Algorithms 75, 397–412 (2017)MathSciNetCrossRefMATH Aihara, K.: Variants of the groupwise update strategy for short-recurrence Krylov subspace methods. Numer. Algorithms 75, 397–412 (2017)MathSciNetCrossRefMATH
2.
go back to reference Chan, T.F., Gallopoulos, E., Simoncini, V., Szeto, T., Tong, C.H.: A quasi-minimal residual variant of the Bi-CGStab algorithm for nonsymmetric systems. SIAM J. Sci. Comput. 15, 338–347 (1994)MathSciNetCrossRefMATH Chan, T.F., Gallopoulos, E., Simoncini, V., Szeto, T., Tong, C.H.: A quasi-minimal residual variant of the Bi-CGStab algorithm for nonsymmetric systems. SIAM J. Sci. Comput. 15, 338–347 (1994)MathSciNetCrossRefMATH
3.
go back to reference Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1–25 (2011)MathSciNetMATH Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1–25 (2011)MathSciNetMATH
4.
go back to reference Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson, G.A. (ed.) Numerical Analysis. Lecture Notes in Math., vol. 506, pp. 73–89. Springer, Berlin (1976) Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson, G.A. (ed.) Numerical Analysis. Lecture Notes in Math., vol. 506, pp. 73–89. Springer, Berlin (1976)
5.
go back to reference Fokkema, D.R., Sleijpen, G.L.G., van der Vorst, H.A.: Generalized conjugate gradient squared. J. Comput. Appl. Math. 71, 125–146 (1996)MathSciNetCrossRefMATH Fokkema, D.R., Sleijpen, G.L.G., van der Vorst, H.A.: Generalized conjugate gradient squared. J. Comput. Appl. Math. 71, 125–146 (1996)MathSciNetCrossRefMATH
6.
go back to reference Freund, R.W.: A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput. 14, 470–482 (1993)MathSciNetCrossRefMATH Freund, R.W.: A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput. 14, 470–482 (1993)MathSciNetCrossRefMATH
7.
go back to reference Freund, R.W., Nachtigal, N.M.: QMR: a quasi minimal residual method for non-Hermitian linear systems. Numer. Math. 60, 315–339 (1991)MathSciNetCrossRefMATH Freund, R.W., Nachtigal, N.M.: QMR: a quasi minimal residual method for non-Hermitian linear systems. Numer. Math. 60, 315–339 (1991)MathSciNetCrossRefMATH
8.
go back to reference Greenbaum, A.: Estimating the attainable accuracy of recursively computed residual methods. SIAM J. Matrix Anal. Appl. 18, 535–551 (1997)MathSciNetCrossRefMATH Greenbaum, A.: Estimating the attainable accuracy of recursively computed residual methods. SIAM J. Matrix Anal. Appl. 18, 535–551 (1997)MathSciNetCrossRefMATH
9.
go back to reference Gutknecht, M.H., Rozložník, M.: By how much can residual minimization accelerate the convergence of orthogonal residual methods? Numer. Algorithms 27, 189–213 (2001)MathSciNetCrossRefMATH Gutknecht, M.H., Rozložník, M.: By how much can residual minimization accelerate the convergence of orthogonal residual methods? Numer. Algorithms 27, 189–213 (2001)MathSciNetCrossRefMATH
10.
go back to reference Gutknecht, M.H., Rozložník, M.: Residual smoothing techniques: Do they improve the limiting accuracy of iterative solvers? BIT 41, 86–114 (2001)MathSciNetCrossRefMATH Gutknecht, M.H., Rozložník, M.: Residual smoothing techniques: Do they improve the limiting accuracy of iterative solvers? BIT 41, 86–114 (2001)MathSciNetCrossRefMATH
11.
12.
13.
go back to reference Schönauer, W.: Scientific Computing on Vector Computers. Elsevier, Amsterdam (1987) Schönauer, W.: Scientific Computing on Vector Computers. Elsevier, Amsterdam (1987)
14.
15.
16.
go back to reference van den Eshof, J., Sleijpen, G.L.G.: Inexact Krylov subspace methods for linear systems. SIAM J. Matrix Anal. Appl. 26, 125–153 (2004)MathSciNetCrossRefMATH van den Eshof, J., Sleijpen, G.L.G.: Inexact Krylov subspace methods for linear systems. SIAM J. Matrix Anal. Appl. 26, 125–153 (2004)MathSciNetCrossRefMATH
17.
go back to reference van der Vorst, H.A.: Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13, 631–644 (1992)MathSciNetCrossRefMATH van der Vorst, H.A.: Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13, 631–644 (1992)MathSciNetCrossRefMATH
18.
go back to reference van der Vorst, H.A., Ye, Q.: Residual replacement strategies for Krylov subspace iterative methods for the convergence of true residuals. SIAM J. Sci. Comput. 22, 835–852 (2000)MathSciNetCrossRefMATH van der Vorst, H.A., Ye, Q.: Residual replacement strategies for Krylov subspace iterative methods for the convergence of true residuals. SIAM J. Sci. Comput. 22, 835–852 (2000)MathSciNetCrossRefMATH
19.
go back to reference Weiss, R.: Parameter-Free Iterative Linear Solvers. Mathematical Research, vol. 97. Akademie Verlag, Berlin (1996)MATH Weiss, R.: Parameter-Free Iterative Linear Solvers. Mathematical Research, vol. 97. Akademie Verlag, Berlin (1996)MATH
Metadata
Title
Variants of residual smoothing with a small residual gap
Authors
Kensuke Aihara
Ryosuke Komeyama
Emiko Ishiwata
Publication date
02-04-2019
Publisher
Springer Netherlands
Published in
BIT Numerical Mathematics / Issue 3/2019
Print ISSN: 0006-3835
Electronic ISSN: 1572-9125
DOI
https://doi.org/10.1007/s10543-019-00751-w

Other articles of this Issue 3/2019

BIT Numerical Mathematics 3/2019 Go to the issue

Premium Partner