Skip to main content
Log in

A stable Richardson iteration method for complex linear systems

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

The Richardson iteration method is conceptually simple, as well as easy to program and parallelize. This makes the method attractive for the solution of large linear systems of algebraic equations with matrices with complex eigenvalues. We change the ordering of the relaxation parameters of a Richardson iteration method proposed by Eiermann, Niethammer and Varga for the solution of such problems. The new method obtained is shown to be stable and to have better convergence properties.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • [AG] Anderssen, R.S., Golub, G.H.: Richardson's non-stationary matrix iterative procedure. Rep. STAN-CS-72-304, Computer Science Dept., Stanford University 1972

  • [Br] Brigham, E.O.: The fast Fourier transform. New York: Prentice-Hall 1974

    Google Scholar 

  • [Bu] Buneman, O.: Conversion of FFT's to fast Hartley transforms. SIAM J. Sci. Stat. Comput.7, 624–638 (1986)

    Article  Google Scholar 

  • [C] Curtiss, J.H.: Riemann sums and the fundamental polynomials of Lagrange interpolation. Duke Math. J.8, 525–532 (1941)

    Article  Google Scholar 

  • [El] Ellacott, S.W.: Computation of Faber series with application to numerical polynomial approximations in the complex plane. Math. Comput.40, 575–587 (1983)

    Google Scholar 

  • [EN] Eiermann, M., Niethammer, W.: On the construction of semiiterative methods. SIAM J. Numer. Anal.20, 1153–1160 (1983)

    Article  Google Scholar 

  • [ENV] Eiermann, M., Niethammer, W., Varga, R.S.: A study of semiiterative methods for nonsymmetric systems of linear equations. Numer. Math.47, 505–533 (1985)

    Article  Google Scholar 

  • [ES] Elman, H.C., Streit, R.L.: Polynomial iteration for nonsymmetric indefinite linear systems. In: Hennart, J.P. (ed.) Numerical analysis, proceedings. Lect. Notes Math. No. 1230, Berlin Heidelberg New York: Springer 1986

    Google Scholar 

  • [EVN] Eiermann, M., Varga, R.S., Niethammer, W.: Iterationsverfahren für nichtsymmetrische Gleichungssysteme und Approximationsmethoden im Komplexen. Jahresber. Dtsch. Math.-Ver.89, 1–32 (1987)

    Google Scholar 

  • [FGHLW] Fischer, D., Golub, G., Hald, O., Leiva, C., Widlund, O.: On Fourier-Toeplitz methods for separable elliptic problems. Math. Comput.28, 349–368 (1974)

    Google Scholar 

  • [Ga] Gaier, D.: Vorlesungen über Approximation im Komplexen. Basel: Birkhäuser 1980

    Google Scholar 

  • [Gu] Gutknecht, M.H.: Numerical conformal mapping methods based on fuction conjugation. J. Comput. Appl. Math.14, 31–77 (1986)

    Google Scholar 

  • [H] Henrici, P.: Applied and computational complex analysis, vol. 3. New York: Wiley 1986

    Google Scholar 

  • [LF] Lebedev, V.I., Finogenov, S.A.: Utilization of ordered Chebyshev parameters in iterative methods. U.S.S.R. Comput. Math. Math. Phys.16, 70–83 (1976)

    Article  Google Scholar 

  • [Man] Manteuffel, T.A.: The Tschebychev iteration for nonsymmetric linear systems. Numer. Math.28, 307–327 (1977)

    Article  Google Scholar 

  • [Mar] Marchuk, G.I.: Methods of numerical mathematics, 2nd Ed. New York: Springer 1982

    Google Scholar 

  • [OS] Opfer, G., Schober, G.: Richardson's iteration for nonsymmetric matrices. Linear Algebra Appl.58, 343–361 (1984)

    Article  Google Scholar 

  • [R] Reichel, L.: A fast method for solving certain integral equations of the first kind with application to conformal mapping. J. Comput. Appl. Math.14, 125–142 (1986)

    Google Scholar 

  • [Sa] Samarskij, A.A.: Theorie der Differenzenverfahren. Leipzig: Akademische Verlagsgesell-schaft Geest & Portig 1984

    Google Scholar 

  • [Sm] Smith, G.D.: Numerical solution of partial differential equations: Finite difference methods: Oxford University Press, New York 1978

    Google Scholar 

  • [Sw] Swarztrauber, P.N.: A direct method for the discrete solution of separable elliptic equations. SIAM J. Numer. Anal.11, 1136–1150 (1974)

    Article  Google Scholar 

  • [T1] Trefethen, L.N. (ed.): Numerical conformal mapping. Special Issue of J. Comput. Appl. Math.14 (1986)

  • [T2] Trefethen, L.N.: SCEXT, program for computing the Schwarz-Christoffel mapping from the upper half plane to the exterior of a polygon. Dept. of Mathematics. M.I.T. 1987

  • [W] Walsh, J.L.: Interpolation and approximation by rational functions in the complex domain, 3rd Ed. Amer. Math. Soc., Providence, RI 1960

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported by the National Science Foundation under Grant DMS-8704196

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fischer, B., Reichel, L. A stable Richardson iteration method for complex linear systems. Numer. Math. 54, 225–242 (1989). https://doi.org/10.1007/BF01396976

Download citation

  • Received:

  • Issue Date:

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

Subject Classifications

Navigation