The interplay between classical analysis and (numerical) linear algebra - A tribute to Gene H. Golub

Electronic Transactions on Numerical Analysis

Volumn 13, Issue , 2002, Pages 119-147

  Gautschi, Walter ^a  

^a Purdue University   (United States)

Author keywords

Bounds for matrix functionals; Eigenvalue vector characterizations; Gauss type quadratures; Iterative methods; Lanczos algorithm; Least squares problem; Modification algorithms; Orthogonal polynomials; Polynomials orthogonal on several intervals

Indexed keywords

EID: 2942620338     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (48)

1. Z. BAI AND G. H. GOLUB, Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices, in The Heritage of P. L. Chebyshev: A Festschrift in Honor of the 70th Birthday of T. J. Rivlin, C. A. Micchelli, ed., Annals Numer. Math., 4 (1997), pp. 29-38.
2. Z. BAI, M. FAHEY, AND G. GOLUB, Some large-scale matrix computation problems, J. Comput. Appl. Math., 74 (1996), pp. 71-89.
3. M. BENZI AND G. H. GOLUB, Bounds for the entries of matrix functions with applications to preconditioning, BIT, 39 (1999), pp. 417-438.
4. M. BERRY AND G. GOLUB, Estimating the largest singular values of large sparse matrices via modified moments, Numer. Algorithms, 1 (1991), pp. 353-374.
5. D. CALVETTI, G. H. GOLUB, AND L. REICHEL, An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments, Numer. Math., 67 (1994), pp. 21-40.
6. D. CALVETTI, G. H. GOLUB, AND L. REICHEL, A computable error bound for matrix functionals, J. Comput. Appl. Math., 103 (1999), pp. 301-306.
7. D. CALVETTI, G. H. GOLUB, AND L. REICHEL, Estimation of the L-curve via Lanczos bidiagonalization, BIT, 39 (1999), pp. 603-619.
8. D. CALVETTI, G. H. GOLUB, W. B. GRAGG, AND L. REICHEL, Computation of Gauss-Kronrod quadrature rules, Math. Comp., 69 (2000), 1035-1052.
9. D. CALVETTI, S. MORIGI, L. REICHEL, AND F. SGALLARI, An iterative method with error estimators, in Numerical Analysis 2000, Vol. 5, Quadrature and Orthogonal Polynomials, W. Gautschi, F. Marcellán, and L. Reichel, eds., J. Comput. Appl. Math., 127 (2001), pp. 93-119.
10. G. DAHLQUIST, S. C. EISENSTAT AND G. H. GOLUB, Bounds for the error of linear systems of equations using the theory of moments, J. Math. Anal. Appl., 37 (1972), pp. 151-166.
11. G. DAHLQUIST, G. H. GOLUB, AND S. G. NASH, Bounds for the error in linear systems, in Semi-Infinite Programming (Proc. Workshop, Bad Honnef, 1978), R. Hettich, ed., Lecture Notes in Control and Information Sci., Vol. 15, Springer-Verlag, Berlin, 1979, pp. 154-172.
12. S. ELHAY, G. H. GOLUB, AND J. KAUTSKY, Updating and downdating of orthogonal polynomials with data fitting applications, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 327-353.
13. S. ELHAY, G. H. GOLUB, AND J. KAUTSKY, Jacobi matrices for sums of weight functions, BIT, 32 (1992), pp. 143-166.
14. B. FISCHER AND G. H. GOLUB, On generating polynomials which are orthogonal over several intervals, Math. Comp., 56 (1991), pp. 711-730.
15. B. FISCHER AND G. H. GOLUB, How to generate unknown orthogonal polynomials out of known orthogonal polynomials, J. Comput. Appl. Math., 43 (1992), pp. 99-115.
16. D. GALANT, An implementation of Christoffel's theorem in the theory of orthogonal polynomials, Math. Comp., 25 (1971), pp. 111-113.
17. W. GANDER AND W. GAUTSCHI, Adaptive quadrature -revisited, BIT, 40 (2000), pp. 84-101.
18. F. R. GANTMACHER, The theory of matrices, Vol. 1, AMS Chelsea Publishing, Providence, RI, 1998. [Translated from the Russian by K. A. Hirsch. Reprint of the 1959 translation.]
19. W. GAUTSCHI, A survey of Gauss-Christoffel quadrature formulae, in E. B. Christoffel (Aachen/Monschau, 1979), P L. Butzer and F. Fehér, eds., Birkhäuser, Basel, 1981, pp. 72-147.
20. W. GAUTSCHI, An algorithmic implementation of the generalized Christoffel theorem, in Numerical Integration, G. Hämmerlin, ed., Internat. Ser. Numer. Math., Vol. 57, 1982, Birkhäuser, Basel, pp. 89-106.
21. W. GAUTSCHI, Ongenerating orthogonal polynomials, SIAM J. Sci. Statist. Comput., 3 (1982), pp. 289-317.
22. W. GAUTSCHI AND G. V. MILOVANOVIĆ, s-orthogonality and construction of Gauss-Túran-type quadrature formulae, J. Comput. Appl. Math., 86 (1997), pp. 205-218.
23. G. H. GOLUB, Some modified matrix eigenvalue problems, SIAM Rev., 15 (1973), pp. 318-334.
24. G. H. GOLUB, Bounds for matrix moments, Rocky Mountain J. Math., 4 (1974), pp. 207-211.
25. G. H. GOLUB, Matrix computation and the theory of moments, in Proceedings of the International Congress of Mathematicians (Zürich, 1994), S. D. Chatterji, ed., Vol. 2, Birkhäuser, Basel, 1995, pp. 1440-1448.
26. [See also Bull. Belg. Math. Soc. Simon Stevin 1996, suppl.,1-9.]
27. G. H. GOLUB AND M. H. GUTKNECHT, Modified moments for indefinite weight functions, Numer. Math., 57 (1990), pp. 607-624.
28. G. H. GOLUB AND J. KAUTSKY, Calculation of Gauss quadratures with multiple free and fixed knots, Numer. Math., 41 (1983), pp. 147-163.
29. G. H. GOLUB AND M. D. KENT, Estimates of eigenvalues for iterative methods, Math. Comp., 53 (1989), pp. 619-626.
30. G. H. GOLUB AND U. VON MATT, Quadratically constrained least squares and quadratic problems, Numer. Math., 59 (1991), pp. 561-580.
31. G. H. GOLUB AND G. MEURANT, Matrices, moments and quadrature, in Numerical Analysis 1993 (Dundee, 1993), Pitman Res. Notes Math. Ser., Vol. 303, Longman Sci. Tech., Harlow, 1994.
32. G. H. GOLUB AND G. MEURANT, Matrices, moments and quadrature. II. How to compute the norm of the error in iterative methods, BIT, 37 (1994), pp. 687-705.
33. G. H. GOLUB AND Z. STRAKOŠ, Estimates in quadratic formulas, Numer. Algorithms, 8 (1994), pp. 241-268.
34. G. H. GOLUB AND J. H. WELSCH, Calculation of Gauss quadrature rules, Math. Comp., 23 (1969), pp. 221-230.
35. [Addendum: loose microfiche suppl. A1-A10.]
36. R. G. GORDON, Error bounds in equilibrium statistical mechanics, J. Mathematical Phys., 9 (1968), pp. 655-663.
37. W. B. GRAGG AND W. J. HARROD, The numerically stable reconstruction of Jacobi matrices from spectral data, Numer. Math., 44 (1994), pp. 317-335.
38. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Research Nat. Bur. Standards, 49 (1952), pp. 409-436.
39. J. KAUTSKY AND S. ELHAY, Calculation of the weights of interpolatory quadratures, Numer. Math., 40 (1982), pp. 407-422.
40. J. KAUTSKY AND G. H. GOLUB, On the calculation of Jacobi matrices, Linear Algebra Appl., 52/53 (1983), pp. 439-455.
41. A. S. KRONROD, Nodes and Weights of Quadrature Formulas. Sixteen-Place Tables, Consultants Bureau, New York, 1965. [Authorized translation from the Russian.]
42. D. P. LAURIE, Calculation of Gauss-Kronrod quadrature rules, Math. Comp., 66 (1997), pp. 1133-1145.
43. A. F. NIKIFOROV, S. K. SUSLOV, AND V. B. UVAROV, Classical Orthogonal Polynomials of a Discrete Variable, Springer Series in Computational Physics, Springer-Verlag, Berlin, 1991. [Translated from the Russian.]
44. B. N. PARLETT, The Symmetric Eigenvalue Problem, Classics in Applied Mathematics, Vol. 20, SIAM, Philadelphia, PA, 1998. [Corrected reprint of the 1980 original.]
45. R. PIESSENS, E. DE DONCKER-KAPENGA, C. W. ÜBERBUBER, AND D. K. KAHANER, QUADPACK. A Subroutine Package for Automatic Integration, Springer Series in Computational Mathematics, Vol. 1, Springer-Verlag, Berlin, 1983.
46. E. L. STIEFEL, Kernel polynomials in linear algebra and their numerical applications, in Further Contributions to the Solution of Simultaneous Linear Equations and the Determination of Eigenvalues, Nat. Bur. Standards Appl. Math. Ser., Vol. 49, U.S. Government Printing Office, Washington, DC, 1958, pp. 1-22.
47. H. S. WILF, Mathematics for the Physical Sciences, John Wiley, New York, 1962. [Reprinted in 1978 by Dover Publications, New York.]
48. H. S. WILF, Personal communication, 1980.