From potential theory to matrix iterations in six steps

SIAM Review

Volumn 40, Issue 3, 1998, Pages 547-578

  Driscoll, Tobin A ^a   Toh, Kim Chuan ^b   Trefethen, Lloyd N ^c  

^a UNIVERSITY OF COLORADO   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Conformal mapping; Krylov subspaces; Matrix iterations; Polynomial approximation; Potential theory; Semidefinite programming

Indexed keywords

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; CONFORMAL MAPPING; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

KRYLOV SUBSPACE ITERATION; POTENTIAL THEORY; SEMIDEFINITE PROGRAMMING;

ITERATIVE METHODS;

EID: 0032163793     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144596305582     Document Type: Article

References (83)

1. O. AXELSSON, Iterative Solution Methods. Cambridge University Press, Cambridge, 1994.
2. N. S. BAKHVALOV, Numerical Methods, Mir Publishers, Moscow, 1977.
3. R. BARRETT, ET AL., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, 1994.
4. P. CONCUS, G. H. GOLUB, AND D. P. O'LEARY, A generalized Conjugate Gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, eds., Academic Press, New York, 1976, pp. 309-332.
5. J. CULLUM AND A. GREENBAUM, Relations between Galerkin and norm-minimizing iterative methods for solving linear systems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 223-247.
6. J. K. CULLUM AND R. A. WILLOUGHBY, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1, Birkhäuser, Boston, 1985.
7. J. H. CURTISS, Faber polynomials and the Faber series, Amer. Math. Monthly, 78 (1971), pp. 577-596.
8. J. W. DANIEL, The Approximate Minimization of Functionals, Prentice-Hall, Englewood Cliffs, NJ, 1971.
9. T. A. DRISCOLL, A MATLAB toolbox for Schwarz-Christoffel mapping, ACM Trans. Math. Softw., 22 (1996), pp. 168-186. See also http://amath.colorado.edu/appm/faculty/tad/ SC-toolbox.
10. V. DRUSKIN, A. GREENBAUM, AND L. KNIZHNERMAN, Using nonorthogonal Lanczos vectors in the computation of matrix functions, SIAM J. Sci. Comp., 19 (1998), pp. 38-54.
11. W. S. EDWARDS, L. S. TUCKERMAN, R. A. FRIESNER, AND D. C. SORENSEN, Krylov methods for the incompressible Navier-Stokes equations, J. Comp. Phys., 110 (1994), pp. 82-102.
12. M. EIERMANN, On semiiterative methods generated by Faber polynomials, Numer. Math., 56 (1989), pp. 139-156.
13. M. EIERMANN, X. LI, AND R. S. VARGA, On hybrid semi-iterative methods, SIAM J. Numer. Anal., 26 (1989), pp. 152-168.
14. M. EIERMANN AND W. NIETHAMMER, On the construction of semiiterative methods, SIAM J. Numer. Anal., 20 (1983), pp. 1153-1160.
15. M. EIERMANN, W. NIETHAMMER, AND R. S. VARGA, A study of semiiterative methods for nonsymmetric systems of linear equations, Numer. Math., 47 (1985), pp. 505-533.
16. H. ELMAN AND R. STREIT, Polynomial iteration for nonsymmetric indefinite linear systems, in Numerical Analysis, Lecture Notes in Math. 1230, J. P. Hennert, ed., Springer-Verlag, 1986, pp. 103-117.
17. G. FABER, Über Tschebyscheffsche Polynome, J. Reine Angew. Math., 150 (1920), pp. 79-106.
18. V. FABER, W. JOUBERT, E. KNILL, AND T. MANTEUFFEL, Minimal residual method stronger than polynomial preconditioning, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 707-729.
19. V. FABER AND T. MANTEUFFEL, Necessary and sufficient conditions for the existence of a conjugate gradient method, SIAM J. Numer. Anal., 21 (1984), pp. 352-362.
20. D. K. FADDEEV AND V. N. FADDEEVA, Computational Methods of Linear Algebra, Freeman, San Francisco, 1963.
21. B. FISCHER AND R. W. FREUND, On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices, SIAM J. Sci. Comp., 15 (1994), pp. 408-426.
22. B. FISCHER AND L. REICHEL, A stable Richardson iteration method for complex linear systems, Numer. Math., 54 (1988), pp. 225-242.
23. R. FLETCHER, Conjugate gradient methods for indefinite systems, in Proceedings of the Dundee Biennial Conference on Numerical Analysis, G. A. Watson, ed., Springer-Verlag, New York, 1975, pp. 73-89.
24. R. W. FREUND, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput., 14 (1993), pp. 470-482.
25. R. W. FREUND, G. H. GOLUB, AND N. M. NACHTIGAL, Iterative solution of linear systems, Acta Numerica, 1 (1992), pp. 57-100.
26. R. W. FREUND AND N. M. NACHTIGAL, QMR: A quasi-minimal residual method for non- \ Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
27. D. GAIER, Lectures on Complex Approximation, Birkhäuser, Boston, 1987.
28. S. K. GODUNOV AND V. S. RYABENKII, Theory of Difference Schemes, North-Holland, Amsterdam, 1964.
29. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore. 1996.
30. A. GREENBAUM, Comparison of splittings used with the conjugate gradient algorithm, Numer. Math., 33 (1979), pp. 181-194.
31. A. GREENBAUM, Behavior of slightly perturbed Lanczos and conjugate gradient recurrences, Linear Algebra Appl., 113 (1989), pp. 7-63.
32. A. GREENBAUM, Krylov subspace approximations to the solution of a linear system, in Linear and Nonlinear Conjugate Gradient-Related Methods, L. Adams and J. L. Nazareth, eds., SIAM, Philadelphia, 1996.
33. A. GREENBAUM, Estimating the attainable accuracy of recursively computed residual methods, SIAM J. Matrix Anal. Appl., 18 (1997). pp. 535-552.
34. A. GREENBAUM, Iterative Methods for Solving Linear Systems, SIAM, Philadelphia, 1997.
35. A. GREENBAUM AND L. GURVITS, Max-Min properties of matrix factor norms, SIAM J. Sci. Comp., 15 (1994), pp. 348-358.
36. A. GREENBAUM, V. PTAK, AND Z. STRAKOŠ, Any nonincreasing convergence curve is possible for GMRES, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 465-469.
37. A. GREENBAUM AND Z. STRAKOŠ, Predicting the behavior of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 121-137.
38. A. GREENBAUM AND L. N. TREFETHEN, GMRES/CR and Arnoldi/Lanczos as matrix approximation problems, SIAM J. Sci. Comp., 15 (1994), pp. 359-368.
39. M. H. GUTKNECHT, An iterative method for solving linear equations based on minimum norm Pick-Nevanlinna interpolation, in Approximation Theory V, Academic Press, C. K. Chui, et al., eds., 1986, pp. 371-374.
40. L. A. HAGEMAN AND D. M. YOUNG, Applied Iterative Methods, Academic Press, New York, 1981.
41. R. M. HAYES, Iterative methods of solving linear problems on Hubert space, Nat. Bur. Stand. Appl. Math. Ser., 39 (1954), pp. 71-103.
42. P. HENRICI, Applied and Computational Complex Analysis, Vol. 3, Wiley, New York, 1986.
43. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand., 49 (1952), pp. 409-436.
44. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
45. E. HILLE, Analytic Function Theory, Vol. 2, Chelsea, New York, 1962.
46. W. A. JOUBERT, A robust GMRES-based adaptive polynomial preconditioning algorithm for nonsymmetric linear systems, SIAM J. Sci. Comp., 15 (1994), pp. 427-439.
47. C. T. KELLEY, Iterative Methods for Linear and Nonlinear Equations, SIAM, Philadelphia, 1995.
48. C. LANCZOS, Solution of systems of linear equations by minimized iteration, J. Res. Nat. Bur. Stand., 49 (1952), pp. 33-53.
49. H. J. LANDAU, On Szego's eigenvalue distribution theorem and non-Hermitian kernels, J. d'Analyse Math., 28 (1975), pp. 335-357.
50. S. H. Lui, Computation of pseudospectra by continuation, SIAM J. Sci. Comput., 18 (1997), pp. 565-573.
51. T. A. MANTEUFFEL, Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration, Numer. Math., 31 (1978), pp. 183-208.
52. T. A. MANTEUFFEL AND G. STARKE, On hybrid iterative methods for nonsymmetric systems of linear equations, Numer. Math., 73 (1996), pp. 489-506.
53. N. M. NACHTIGAL, S. C. REDDY, AND L. N. TREFETHEN, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 778-795.
54. N. M. NACHTIGAL, L. REICHEL, AND L. N. TREFETHEN, A hybrid GMRES algorithm for nonsymmetric linear systems, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 796-825.
55. O. NEVANLINNA, Convergence of Iterations for Linear Equations, Birkhäuser, Basel, 1993.
56. G. OPFER AND G. SCHOBER, Richardson's iteration for nonsymmetric matrices, Linear Algebra Appl., 58 (1984), pp. 343-361.
57. C. PAIGE, Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem, Lin. Alg. Appl., 34 (1980), pp. 235-258.
58. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975). pp. 617-624.
59. L. REICHEL, Polynomials by conformal mapping for the Richardson iteration method for complex linear systems, SIAM J. Numer. Anal., 25 (1988), pp. 1359-1368.
60. L. REICHEL AND L. N. TREFETHEN, Eigenvalues and pseudo-eigenvalues of Toeplitz matrices, Linear Algebra Appl.. 162-164 (1992), pp. 153-185.
61. R. D. RICHTMYER AND K. W. MORTON, Difference Methods for Initial Value Problems, 2nd ed., Wiley. New York, 1967.
62. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Halsted Press, New York, 1992.
63. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing Co., Boston, 1996.
64. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comp., 7 (1986). pp. 856-869.
65. E. B. SAFF, Polynomial and rational approximation in the complex domain, Proc. Symp. Appl. Math., 36 (1986), pp. 21-49.
66. E. B. SAFF, Orthogonal polynomials from a complex perspective, in Orthogonal Polynomials, P. Nevai, ed., Kluwer, Norwell, MA, 1990, pp. 363-393.
67. P. E. SAYLOR AND D. C. SMOLARSKI, Implementation of an adaptive algorithm for Richardson's method, Linear Algebra Appl., 154-156 (1991), pp. 615-646.
68. P. SONNEVELD, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Stat. Comp., 10 (1989), pp. 36-52.
69. H. STAHL AND V. TOTIK, General Orthogonal Polynomials, Cambridge University Press, Cambridge, 1992.
70. G. STARKE AND R. S. VARGA, A hybrid Arnoldi-Faber method for nonsymmetric systems of linear equations, Numer. Math., 64 (1993), pp. 213-240.
71. K. C. TOH, Matrix Approximation Problems and Nonsymmetric Iterative Methods, Ph.D. thesis, Cornell University, Ithaca, NY, 1996.
72. K.-C. TOH, GMRES vs. ideal GMRES, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 30-36.
73. K.-C. TOH AND L. N. TREFETHEN, Calculation of pseudospectra by the Arnoldi iteration, SIAM J. Sci. Comp., 17 (1996), pp. 1-15.
74. K.-C. TOH AND L. N. TREFETHEN, The Chebyshev polynomials of a matrix, SIAM J. Matrix Anal. Appl., to appear.
75. L. N. TREFETHEN, Approximation theory and numerical linear algebra, in Algorithms for Approximation II, J. C. Mason and M. G. Cox, eds., Chapman and Hall, London, 1990, pp. 336-360.
76. L. N. TREFETHEN, Pseudospectra of matrices, in Numerical Analysis 1991, D. F. Griffiths and G. A. Watson, eds., Longman Scientific and Technical, Harlow, UK, 1992, pp. 234-266.
77. L. N. TREFETHEN AND DAVID BAU, III, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
78. M. TSUJI, Potential Theory in Modern Function Theory, Dover, New York, 1959.
79. A. VAN DER SLUIS AND H. A. VAN DER VORST, The rate of convergence of conjugate gradients, Numer. Math., 48 (1986), pp. 543-560.
80. H. A. VAN DER VORST, Bi-CGSTAB: A fast and smoothly convergent variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comp., 13 (1992), pp. 631-644.
81. J. L. WALSH, Interpolation and Approximation by Rational Functions in the Complex Domain, 5th ed., Amer. Math. Soc., Providence, RI, 1969.
82. H. WIDOM, Extrernal polynomials associated with a system of curves in the complex plane, Adv. Math., 3 (1969), pp. 127-232.
83. R. WINTHER, Some superlinear convergence results for the conjugate gradient methods, SIAM J. Numer. Anal., 17 (1980), pp. 14-17.