Avoiding breakdown in the CGS algorithm | Numerical Algorithms Skip to main content
Springer Nature Link
Log in

Avoiding breakdown in the CGS algorithm

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

The conjugate gradient squared algorithm can suffer of similar breakdowns as Lanczos type methods for the same reason that is the non-existence of some formal orthogonal polynomials. Thus curing such breakdowns is possible by jumping over these non-existing polynomials and using only those of them which exist. The technique used is similar to that employed for avoiding breakdowns in Lanczos type methods. The implementation of these new methods is discussed. Numerical examples are given.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.L. Boley, S. Elhay, G.H. Golub and M.H. Gutknecht, Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights, Numer. Algorithms 1 (1991) 21–43.

    Google Scholar 

  2. C. Brezinski and M. Redivo Zaglia, A new presentation of orthogonal polynomials with applications to their computation, Numer. Algorithms 1 (1991) 207–222.

    Google Scholar 

  3. C. Brezinski, M. Redivo Zaglia and H. Sadok, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math., to appear.

  4. C. Brezinski, M. Redivo Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms Numer. Algorithms, 1 (1991), to appear.

  5. A. Draux,Polynômes Orthogonaux Formels. Applications, LNM 974 (Springer Verlag, Berlin, 1983).

    Google Scholar 

  6. M.H. Gutknecht, The unsymmetric Lanczos algorithms and their relations to Padé approximation, continued fractions, and the qd-algorithm, to appear.

  7. N.M. Nachtigal, S.C. Reddy, L.N. Trefethen, How fast are nonsymmetric matrix iteractions?, SIAM J. Sci. Stat. Comp., to appear.

  8. P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Stat. Comp. 10 (1989) 36–52.

    Google Scholar 

  9. Yu. V. Vorobyev,Method of Moments in Applied Mathematics (Gordon and Breach, New York, 1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Analyse Numérique et d'Optimisation, UFR IEEA-M3, Université des Sciences et Techniques de Lille, Flandres-Artois, 59655, Villeneuve d'Ascq-Cedex, France

    Claude Brezinski & Hassane Sadok

Authors
  1. Claude Brezinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hassane Sadok
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brezinski, C., Sadok, H. Avoiding breakdown in the CGS algorithm. Numer Algor 1, 199–206 (1991). https://doi.org/10.1007/BF02142321

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02142321

Subject classifications

Keywords

Search

Navigation