Skip to main content

On MrR (Mister R) Method for Solving Linear Equations with Symmetric Matrices

  • Conference paper
  • First Online:
Modeling, Design and Simulation of Systems (AsiaSim 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 752))

Included in the following conference series:

Abstract

Krylov subspace methods, such as the Conjugate Gradient (CG) and Conjugate Residual (CR) methods, are treated for efficiently solving a linear system of equations with symmetric matrices. AZMJ variant of Orthomin(2) (abbreviated as AZMJ) [1] has recently been proposed for solving the linear equations. In this paper, an alternative AZMJ variant is redesigned, i.e., an alternative minimum residual method for symmetric matrices is proposed by using the coupled two-term recurrences formulated by Rutishauser. The recurrence coefficients are determined by imposing the A-orthogonality on the residuals as well as CR. Our proposed variant is referred to as MrR. It is mathematically equivalent to CR and AZMJ, but the implementations are different; the recurrence formulae contain alternative expressions for the auxiliary vectors and the recurrence coefficients. Through numerical experiments on the linear equations with real symmetric matrices, it is demonstrated that the residual norms of MrR converge faster than those of CG and AZMJ.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abe, K., Zhang, S.L., Mitsui, T., Jin, C.H.: A variant of the Orthomin(2) method for singular linear systems. Numer. Algorithms 36, 189–202 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arnoldi, W.E.: The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9, 17–29 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  3. Eisenstat, S.C., Elman, H.C., Schultz, M.H.: Variational iterative methods for nonsymmetric systems of linear equations. SIAM J. Numer. Anal. 20, 345–357 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gutknecht, M.H.: Variants of BiCGStab for matrices with complex spectrum. SIAM J. Sci. Comput. 14, 1020–1033 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hestenes, M.R., Stiefel, E.L.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409–435 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lanczos, C.: Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Stand. 49, 33–53 (1952)

    Article  MathSciNet  Google Scholar 

  7. Rutishauser, H.: Theory of gradient method. In: Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Value Problems, pp. 24–49. Mitt. Inst. angew. Math. ETH Zürich, Birkhäuser, Basel (1959)

    Google Scholar 

  8. Saad, Y., Schultz, M.H.: GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7, 856–869 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Sleijpen, G.L.G., Sonneveld, P., van Gijzen, M.B.: Bi-CGSTAB as induced dimension reduction method. Appl. Numer. Math. 60, 1100–1114 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Stiefel, E.L.: Relaxationsmethoden bester strategie zur losung linearer gleichungssysteme. Commentarii Mathematici Helvetici 29, 157–179 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  11. Stiefel, E.L.: Kernel polynomial in linear algebra and their numerical applications, In: Further contributions to the determination of eigenvalues. NBS Appl. Math. Ser. 49, 1–22 (1958)

    Google Scholar 

  12. Vinsom, P.K.W.: Orthomin, an iterative method for solving sparse sets of simultaneous linear equations. In: Proceedings of the Fourth Symposium on Reservoir Simulation, pp. 149–159. Society of Petroleum Engineers of AIME (1976)

    Google Scholar 

  13. Young, D.M., Jea, K.C.: Generalized conjugate gradient acceleration of nonsymmetrizable iterative methods. Linear Algebra Appl. 34, 159–194 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  14. Zhang, S.L.: GPBi-CG: Generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems. SIAM J. Sci. Comput. 18, 537–551 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

We appreciate Mr. K. Iwasato of Kyushu University for executing numerical experiments. We would like to appreciate Professor G.L.G. Sleijpen and the reviewers for their insightful and helpful suggestions. This research was partly supported by JSPS KAKENHI Grant Number 26390136, 2016.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kuniyoshi Abe .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Abe, K., Fujino, S. (2017). On MrR (Mister R) Method for Solving Linear Equations with Symmetric Matrices. In: Mohamed Ali, M., Wahid, H., Mohd Subha, N., Sahlan, S., Md. Yunus, M., Wahap, A. (eds) Modeling, Design and Simulation of Systems. AsiaSim 2017. Communications in Computer and Information Science, vol 752. Springer, Singapore. https://doi.org/10.1007/978-981-10-6502-6_45

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6502-6_45

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6501-9

  • Online ISBN: 978-981-10-6502-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics