The Chebyshev polynomials of a matrix

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 2, 1998, Pages 400-419

  Toh, Kim Chuan ^a   Trefethen, Lloyd N ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Chebyshev polynomial of a matrix; Krylov subspace iteration; Matrix polynomial; Semidefinite programming

Indexed keywords

EID: 0032216889     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896303739     Document Type: Article

References (25)

1. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability, and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
2. J. H. CURTISS, Faber polynomials and the Faber series, Amer. Math. Monthly, 78 (1971), pp. 577-596.
3. P. J. DAVIS, Interpolation and Approximation, Dover, New York, 1975.
4. T. A. DRISCOLL, A MATLAB toolbox for Schwarz-Christoffel mapping, ACM Trans. Math. Software, 22 (1996), pp. 168-186.
5. G. FABER, Über Tschebyscheffsche Polynome, J. Reine Angew. Math., 150 (1920), pp. 79-106.
6. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
7. A. GREENBAUM AND L. N. TREFETHEN, GMRES/CR and Arnoldi/Lanczos as matrix approximation problems, SIAM J. Sci. Comput., 15 (1994), pp. 359-368.
8. T. KATO, Perturbation Theory for Linear Operators, Springer-Verlag, Berlin, 1966.
9. C.-J. LIN AND R. SAIGAL, An Infeasible Start Predictor-Corrector Method for Semi-Definite Linear Programming, manuscript, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, 1995.
10. R. D. C. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
11. Y. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Methods in Convex Programming, Stud. Appl. Math. 13, SIAM, Philadelphia, PA, 1994.
12. Y. E. NESTEROV AND M. J. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
13. S. C. REDDY AND L. N. TREFETHEN, Pseudospectra of the convection-diffusion operator, SIAM J. Appl. Math., 54 (1994), pp. 1634-1649.
14. L. REICHEL AND L. N. TREFETHEN, Eigenvalues and pseudo-eigenvalues of Toeplitz matrices, Linear Algebra Appl., 169 (1992), pp. 153-185.
15. P. T. P. TANG, A fast algorithm for linear complex Chebyshev approximations, Math. Comp., 51 (1988), pp. 721-739.
16. M. J. TODD, K.-C. TOH, AND R. H. TÜTÜNCÜ, On the Nesterov-Todd direction in semidefinite programming, SIAM J. Optim., 8 (1998), pp. 769-796.
17. K.-C. TOH, Matrix Approximation Problems and Nonsymmetric Iterative Methods, Ph.D. thesis, Cornell University, Ithaca, NY, 1996.
18. K.-C. TOH AND L. N. TREFETHEN, Calculation of pseudospectra by the Arnoldi iteration, SIAM J. Sci. Comput., 17 (1996), pp. 1-15.
19. K.-C. TOH AND L. N. TREFETHEN, The Kreiss matrix theorem on a general complex domain, SIAM J. Matrix Anal. Appl., to appear.
20. L. N. TREFETHEN, Spectra and Pseudospectra: The Behavior of Non-Normal Matrices and Operators, in preparation.
21. 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.
22. L. N. TREFETHEN AND D. BAU, III, Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
23. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
24. H. WIDOM, Extremal polynomials associated with a system of curves in the complex plane, Adv. Math., 3 (1969), pp. 127-232.
25. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.