Quadrature rules based on the Arnoldi process

SIAM Journal on Matrix Analysis and Applications

Volumn 26, Issue 3, 2005, Pages 765-781

  Calvetti, Daniela ^a   Kim, Sun M I ^b   Reichel, Lothar ^b  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Bilinear form; Error estimate; Large scale problem; Quadrature method

Indexed keywords

BILINEAR FORM; ERROR ESTIMATE; LARGE-SCALE PROBLEM; QUADRATURE METHOD;

ERROR ANALYSIS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; SET THEORY; THEOREM PROVING; VECTORS;

QUADRATIC PROGRAMMING;

EID: 22944489601     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479803423822     Document Type: Article

References (19)

1. D. CALVETTI, G. H. GOLUB, AND L. REICHEL, A computable error bound for matrix functional, J. Comput. Appl. Math., 103 (1999), pp. 301-306.
2. D. CALVETTI, G. H. GOLUB, AND L. REICHEL, Estimation of the L-curve via Lanczos bidiagonalization, BIT, 39 (1999), pp. 603-619.
3. D. CALVETTI, P. C. HANSEN, AND L. REICHEL, L-curve curvature bounds via Lanczos bidiagonalization, Electron. Trans. Numer. Anal., 14 (2002), pp. 20-35.
4. D. CALVETTI, S. MORIGI, L. REICHEL, AND F. SGALLARI, Tikhonov regularization and the L-curve for large discrete ill-posed problems, J. Comput. Appl. Math., 123 (2000), pp. 423-446.
5. D. CALVETTI, S. MORIGI, L. REICHEL, AND F. SGALLARI, Computable error bounds and estimates for the conjugate gradient method, Numer. Algorithms, 25 (2000), pp. 75-88.
6. D. CALVETTI, L. REICHEL, AND F. SGALLARI, Application of anti-Gauss quadrature rules in linear algebra, in Applications and Computation of Orthogonal Polynomials, W. Gautschi, G. H. Golub, and G. Opfer, eds., Birkhäuser-Verlag, Basel, Switzerland, 1999, pp. 41-56.
7. R. W. FREUND AND M. HOCHBRUCK, Gauss quadratures associated with the Arnoldi process and the Lanczos algorithm, in Linear Algebra for Large Scale and Real-Time Application, M. S. Moonen, G. H. Golub, and B. L. R. De Moor, eds., Kluwer, Dordrecht, The Netherlands, 1993, pp. 377-380.
8. F. R. GANTMACHER, The Theory of Matrices, Vol. 1, Chelsea, New York, 1990.
9. G. H. GOLUB AND G. MEURANT, Matrices, moments and quadrature, in Numerical Analysis 1993, D. F. Griffiths and G. A. Watson, eds., Longman Scientific and Technical, Harlow, UK, 1994, pp. 105-156.
10. G. H. GOLUB AND G. MEURANT, Matrices, moments and quadrature II: How to compute the norm of the error in iterative methods, BIT, 37 (1997), pp. 687-705.
11. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
12. M. HOCHBRUCK AND C. LUBICH, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 34 (1997), pp. 1911-1925.
13. L. KNIZHNERMAN, Calculation of functions of unsymmetric matrices using Arnoldi's method, Comput. Math. Math. Phys., 31 (1991), pp. 1-9.
14. D. P. LAURIE, Anti-Gaussian quadrature formulas, Math. Comp., 65 (1996), pp. 739-747.
15. G. MEURANT, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algorithms, 16 (1997), pp. 77-87.
16. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS, Boston, 1996.
17. P. E. SAYLOR AND D. C. SMOLARSKI, Why Gaussian quadrature in the complex plane?, Numer. Algorithms, 26 (2001), pp. 251-280.
18. P. E. SAYLOR AND D. C. SMOLARSKI, Addendum to: "Why Gaussian quadrature in the complex plane?," Numer. Algorithms, 27 (2001), pp. 215-217.
19. E. D. SONTAG, Mathematical Control Theory: Deterministic Finite Dimensional Systems, Springer-Verlag, New York, 1990.