Matrices, moments and quadrature with applications

Matrices, Moments and Quadrature with Applications

Volumn , Issue , 2009, Pages

  Golub, Gene H ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84883929251     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (355)

1. H-M. ADORF, Hubble Space Telescope image restoration in its fourth year, Inverse Problems, v 11 (1995), pp 639-653.
2. M. AFANASJEW, M. EIERMANN, O.G. ERNST AND S. GÜTTEL, On the steepest descent method for matrix functions, Elec. Trans. Numer. Anal., v 28 (2007-2008), pp 206-222.
3. M. AFANASJEW, M. EIERMANN, O.G. ERNST AND S. GÜTTEL, Implementation of a restarted Krylov subspace method for the evaluation of matrix functions, Linear Alg. Appl., v 429 n 10 (2008), pp 2293-2314.
4. N.I. AKHIEZER, The classical moment problem, Oliver and Boyd, London (1965). Russian edition 1961.
5. D.M. ALLEN, The relationship between variable selection and data augmentation and a method for prediction, Technometrics, v 16 (1974), pp 125-127.
6. G.S. AMMAR, D. CALVETTI AND L. REICHEL, Computation of Gauss- Kronrod quadrature rules with non-positive weights, Elec. Trans. Numer. Anal., v 9 (1999), pp 26-38.
7. A.I. APTEKAREV AND E.M. NIKISHIN, The scattering problem for a discrete Sturm-Liouville operator, Mat. Sb., v 121 n 163 (1983), pp 327-358;
8. Math. USSR Sb., v 49 (1984), pp 325-355.
9. P. ARBENZ AND G.H. GOLUB, On the spectral decomposition of Hermitian matrices modified by low rank perturbations with applications, SIAM J. Matrix Anal. Appl., v 9 (1988), pp 40-58.
10. M. ARIOLI, Stopping criterion for the conjugate gradient algorithm in a finite element method framework, Numer. Math., v 97 (2004), pp 1-24.
11. M. ARIOLI, D. LOGHIN AND A. WATHEN, Stopping criteria for iterations in finite element methods, Numer. Math., v 99 (2005), pp 381-410.
12. W.E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quarterly of Appl. Math., v 9 (1951), pp 17-29.
13. K.S. ARUN, A unitarily constrained total least squares problem in signal processing, SIAM J. Matrix Anal. Appl., v 13 n 3 (1992), pp 729-745.
14. F.V. ATKINSON, Discrete and continuous boundary problems, Academic Press, New York (1964).
15. G. AUCHMUTY, A posteriori error estimates for linear equations, Numer. Math., v 61 n 1 (1992), pp 1-6.
16. Z. BAI AND G.H. GOLUB, Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices, Annals Numer. Math., v 4 (1997), pp 29-38.
17. Z. BAI AND G.H. GOLUB, Some unusual matrix eigenvalue problems, in Proceedings of Vecpar'98 - Third International Conference for Vector and Parallel Processing, J. Palma, J. Dongarra and V. Hernandez Eds., Springer, Berlin (1999), pp 4-19.
18. Z. BAI, M. FAHEY AND G.H. GOLUB, Some large scale matrix computation problems, J. Comput. Appl. Math., v 74 (1996), pp 71-89.
19. Z. BAI, M. FAHEY, G.H. GOLUB, M. MENON AND E. RICHTER, Computing partial eigenvalue sum in electronic structure calculation, Report SCCM 98-03, Stanford University (1998).
20. M.M. BAART, The use of auto-correlation for pseudo-rank determination in noisy ill-conditioned least-squares problems, IMA J. Numer. Anal., v 2 (1982), pp 241-247.
21. J. BARANGER AND M. DUC-JACQUET, Matrices tridiagonales symétriques et matrices factorisables, RIRO, v 3 (1971), pp 61-66.
22. J. BARDSLEY, S. JEFFERIES, J. NAGY, AND R. PLEMMONS, Blind iterative restoration of images with spatially-varying blur, Optics Express, v 14 (2006), pp 1767-1782.
23. S. BASU AND N.K. BOSE, Matrix Stieltjes series and network models, SIAM J. Math. Anal., v 14 n 2 (1983), pp 209-222.
24. B. BECKERMANN, The stable computation of formal orthogonal polynomials, Numer. Algo., v 11 (1996), pp 1-23.
25. B. BECKERMANN, The condition number of real Vandermonde, Krylov and positive definite Hankel matrices, Numer. Math., v 85 (2000), pp 553-577.
26. B. BECKERMANN AND B. BOURREAU, How to choose modified moments?, J. Comput. Appl. Math., v 98 (1998), pp 81-98.
27. M. BELGE, M.E. KILMER AND E.L. MILLER, Efficient determination of multiple regularization parameters in a generalized L-curve framework, Inverse Problems, v 18 (2002), pp 1161-1183.
28. M. BENZI AND G.H. GOLUB. Bounds for the entries of matrix functions with applications to preconditioning, BIT Numer. Math., v 39 n 3 (1999), pp 417-438.
29. M. BENZI AND N. RAZOUK, Decay bounds and O(N) algorithms for approximating functions of sparse matrices, Elec. Trans. Numer. Anal., v 28 (2007), pp 16-39.
30. M. BERMAN, Automated smoothing of image and other regularly spaced data, IEEE Trans. Pattern Anal. Machine Intell., v 16 (1994), pp 460-468.
31. A. BJÖRCK, Numerical methods for least squares problems, SIAM, Philadelphia (1996).
32. D. BOLEY AND G.H. GOLUB, A survey of matrix inverse eigenvalue problems, Inverse Problems, v 3 (1987), pp 595-622.
33. G. BOUTRY, Contributionsà l'approximation età l'algèbre linéaire numérique, Thèse, Université des Sciences et Technologies de Lille, (2003).
34. G. BOUTRY, Construction of orthogonal polynomial wavelets as inverse eigenvalue problem and a new construction of Gauss-Kronrod matrices, submitted (2007).
35. C. BREZINSKI, Padé-type approximation and general orthogonal polynomials, ISNM v 50, Birkhäuser-Verlag, Basel (1980).
36. C. BREZINSKI, A direct proof of the Christoffel-Darboux identity and its equivalence to the recurrence relationship, J. Comput. Appl. Math., v 32 (1990), pp 17-25.
37. C. BREZINSKI, Biorthogonality and its applications to numerical analysis, Marcel Dekker, New York (1992).
38. C. BREZINSKI, Error estimates in the solution of linear systems, SIAM J. Sci. Comput., v 21 n 2 (1999), pp 764-781.
39. C. BREZINSKI, M. REDIVO-ZAGLIA AND H. SADOK, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algo., v 1 (1991), pp 261-284.
40. C. BREZINSKI, G. RODRIGUEZ AND S. SEATZU, Error estimates for linear systems with applications to regularization, Numer. Algo., v 49 (2008), pp 85-104.
41. C. BREZINSKI, G. RODRIGUEZ AND S. SEATZU, Error estimates for the regularization of least squares problems, Numer. Algo., v 51 n 1 (2009), pp 61-76.
42. C. BREZINSKI, M. REDIVO-ZAGLIA, G. RODRIGUEZ AND S. SEATZU, Multi-parameter regularization techniques for ill-conditioned linear systems, Numer. Math., v 94, (2003) pp 203-228.
43. M.I. BUENO AND F.M. DOPICO, A more accurate algorithm for computing the Christoffel transformation, J. Comput. Appl. Math., v 205 n 1 (2007), pp 567-582.
44. M.I. BUENO AND F. MARCELLÁN, Darboux transformation and perturbation of linear functionals, Linear Alg. Appl., v 384 (2004), pp 215-242.
45. J.R. BUNCH AND C.P. NIELSEN, Updating the singular value decomposition, Numer. Math., v 31 (1978), pp 11-129.
46. J.R. BUNCH, C.P. NIELSEN AND D.C. SORENSEN, Rank-one modification of the symmetric eigenproblem, Numer. Math., v 31 (1978), pp 31-48.
47. K. BURRAGE, A. WILLIAMS, J. EHREL AND B. POHL, The implementation of a generalized cross-validation algorithm using deflation techniques for linear systems, J. Appl. Numer. Math., v 19 (1996), pp 17-31.
48. D. CALVETTI AND L. REICHEL, Gauss quadrature applied to trust region computations, Numer. Algo., v 34 (2003), pp 85-102.
49. D. CALVETTI AND L. REICHEL, Tikhonov regularization of large linear problems, BIT Numer. Math., v 43 n 2, (2003) pp 263-283.
50. D. CALVETTI AND L. REICHEL, Symmetric Gauss-Lobatto and modified anti-Gauss rules, BIT Numer. Math., v 43 (2003), pp 541-554.
51. D. CALVETTI AND L. REICHEL, Tikhonov regularization with a solution constraint, SIAM J. Sci. Comput., v 26 n 1 (2004), pp 224-239.
52. D. CALVETTI, G.H. GOLUB AND L. REICHEL, Estimation of the L-curve via Lanczos bidiagonalization, BIT, v 39 n 4 (1999), pp 603-619.
53. D. CALVETTI, G.H. GOLUB AND L. REICHEL, A computable error bound for matrix functionals, J. Comput. Appl. Math., v 103 n 2 (1999), pp 301-306.
54. D. CALVETTI, P.C. HANSEN AND L. REICHEL, L-curve curvature bounds via Lanczos bidiagonalization, Elec. Trans. Numer. Anal., v 14 (2002), pp 20-35.
55. D. CALVETTI, L. REICHEL AND F. SGALLARI, Application of anti-Gauss rules in linear algebra, in Applications and computation of orthogonal polynomials, W. Gautschi, G.H. Golub and G. Opfer Eds., Birkhauser, Boston (1999), pp 41-56.
56. D. CALVETTI, L. REICHEL AND F. SGALLARI, Tikhonov regularization with nonnegativity constraint, Elec. Trans. Numer. Anal., v 18 (2004), pp 153-173.
57. D. CALVETTI, L. REICHEL AND A. SHUIBI, Tikhonov regularization of large symmetric problems, Numer. Lin. Alg. Appl., v 12 n 2-3 (2004), pp 127-139.
58. D. CALVETTI, L. REICHEL AND A. SHUIBI, L-curve and curvature bounds for Tikhonov regularization, Numer. Algo., v 35 n 2-4 (2004), pp 301-314.
59. D. CALVETTI, SUN-MI KIM AND L. REICHEL, Quadrature rules based on the Arnoldi process, SIAM J. Matrix Anal. Appl., v 26 n 3 (2005), pp 765-781.
60. D. CALVETTI, G.H. GOLUB, W.B. GRAGG AND L. REICHEL, Computation of Gauss-Kronrod quadrature rules, Math. Comput., v 69 n 231 (2000), pp 1035-1052.
61. D. CALVETTI, S. MORIGI, L. REICHEL AND F. SGALLARI, Computable error bounds and estimates for the conjugate gradient method, Numer. Algo., v 25 (2000), pp 79-88.
62. R.H. CHAN, C. GREIF AND D.P. O'LEARY EDS., Milestones in matrix computation: the selected works of Gene H. Golub with commentaries, Oxford University Press, Oxford (2007).
63. X.W. CHANG, G.H. GOLUB AND C.C. PAIGE, Towards a backward perturbation analysis for data least squares problems, SIAM J. Matrix Anal. Appl., v 30 n 4 (2008), pp 1281-1301.
64. P.L. CHEBYSHEV, Sur l'interpolation par la méthode des moindres carrés, Mém. Acad. Impér. Sci. St. Pétersbourg, v 7 n 15 (1859), pp 1-24. Also in Oeuvres I, pp 473-498.
65. T.S. CHIHARA, An introduction to orhogonal polynomials, Gordon and Breach, New York (1978).
66. T.S. CHIHARA, 45 years of orthogonal polynomials: a view from the wings, J. Comput. Appl. Math., v 133 (2001), pp 13-21.
67. J. CHUNG, J.G. NAGY AND D.P. O'LEARY, A weighted-GCV method for Lanczos-hybrid regularization, Elec. Trans. Numer. Anal., v 28 (2008), pp 149-167.
68. C.W. CLENSHAW AND A.R. CURTIS, A method for numerical integration on an automatic computer, Numer. Math., v 2 (1960), pp 197-205.
69. 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.
70. P. CONCUS, D. CASSAT, G. JAEHNIG AND E. MELBY, Tables for the evaluation of f(x)dx by Gauss-Laguerre quadrature, Math. Comput., v 17 (1963), pp 245-256.
71. P. CRAVEN AND G. WAHBA, Smoothing noisy data with spline functions, Numer. Math., v 31 (1979), pp 377-403.
72. J.J.M. CUPPEN, A divide and conquer method for the symmetric tridiagonal eigenvalue problem, Numer. Math., v 36 (1981), pp 177-195.
73. A. CUYT, Floating-point versus symbolic computations in the QD-algorithm, J. Symbolic Comput., v 24 (1997), pp 695-703.
74. G. DAHLQUIST AND A. BJÖRCK, Numerical methods, Prentice-Hall, Englewood Cliffs, NJ (1974).
75. G. DAHLQUIST AND A. BJÖRCK, Numerical methods in scientific computing, volume I, SIAM, Philadelphia (2008).
76. 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., v 37 (1972), pp 151-166.
77. G. DAHLQUIST, G.H. GOLUB AND S.G. NASH, Bounds for the error in linear systems, in Proceedings of the workshop on semi-infinite programming, R. Hettich Ed., Springer, Berlin (1978), pp 154-172.
78. P.J. DAVIS, The thread: A mathematical yarn, Harcourt Brace Jovanovich, Boston (1989).
79. P.J. DAVIS AND P. RABINOWITZ, Methods of numerical integration, Second Edition, Academic Press, New York (1984).
80. C. DE BOOR AND G.H. GOLUB, The numerically stable reconstruction of a Jacobi matrix from spectral data, Linear Alg. Appl., v 21 (1978), pp 245-260.
81. H. DETTE AND W.J. STUDDEN, Matrix measures, moment spaces and Favard's theorem for the interval [0, 1] and [0,∞), Linear Alg. Appl., v 345 (2002), pp 169-193.
82. H. DETTE AND W.J. STUDDEN, A note on the matrix q-d algorithm and matrix orthogonal polynomials on [0, 1] and [0,∞), J. Comput. Appl. Math., v 148 (2002), pp 349-361.
83. H. DETTE AND W.J. STUDDEN, Quadrature formulas for matrix measure - a geometric approach, Linear Alg. Appl., v 364 (2003), pp 33-64.
84. I.S. DHILLON, A newO(n2) algorithm for the symmetric tridiagonal eigenvalue problem, Ph.D. thesis, University of California, Berkeley (1997).
85. I.S. DHILLON AND B.N. PARLETT, Relatively robust representations of symmetric tridiagonals, Linear Alg. Appl., v 309 (2000), pp 121-151.
86. I.S. DHILLON AND B.N. PARLETT, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Linear Alg. Appl., v 387 (2004), pp 1-28.
87. I.S. DHILLON, B.N. PARLETT AND C. VÖMEL, The design and implementation of the MRRR algorithm, LAPACK Working Note 162, Tech. Report UCB/CSD-04-1346, UC Berkeley (2004).
88. I.S. DHILLON, B.N. PARLETT AND C. VÖMEL, Glued matrices and the MRRR algorithm, SIAM J. Sci. Comput., v 27 n 2 (2005), pp 496-510.
89. S. DONG AND K. LIU, Stochastic estimation with z2 noise, Phys. Lett. B, v 328 (1994), pp 130-136.
90. J.J. DONGARRA AND D.C. SORENSEN, A fully parallel algorithm for the symmetric eigenvalue problem, SIAMJ. Sci. Statist.Comput., v 2 n 2 (1987), pp 139-154.
91. A. DRAUX, Polyn̂omes orthogonaux formels. Applications, LNM 974, Springer-Verlag, Berlin (1983).
92. V. DRUSKIN AND L. KNIZHNERMAN, Two polynomial methods of calculating functions of symmetric matrices, USSR Comput. Maths. Math. Phys., v 29 n 6 (1989), pp 112-121.
93. V. DRUSKIN AND L. KNIZHNERMAN, Error bounds in the simple Lanczos procedure for computing functions of symmetric matrices and eigenvalues, Comput. Maths. Math. Phys., v 31 n 7 (1991), pp 20-30.
94. V. DRUSKIN AND L. KNIZHNERMAN, Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic, Numer. Linear Alg. Appl., v 2 n 3 (1995), pp 205-217.
95. V. DRUSKIN AND L. KNIZHNERMAN, Extended Krylov subspaces: approximation of the matrix square root and related functions, SIAM J. Matrix Anal. Appl., v 19 n 3 (1998), pp 755-771.
96. V. DRUSKIN, A. GREENBAUM AND L. KNIZHNERMAN, Using nonorthogonal Lanczos vectors in the computation of matrix functions, SIAM J. Sci. Comput., v 19 n 1 (1998), pp 38-54.
97. S. EHRICH, On stratified extensions of Gauss-Laguerre and Gauss-Hermite quadrature formulas, J. Comput. Appl. Math., v 140 (2002), pp 291-299.
98. M. EIERMANN AND O.G. ERNST, A restarted Krylov subspace method for the evaluation of matrix functions, SIAM J. Numer. Anal., v 44 (2006), pp 2481-2504.
99. S. ELHAY AND J. KAUTSKY, Generalized Kronrod Patterson type embedded quadratures, Aplikace Matematiky, v 37 (1992), pp 81-103.
100. S. ELHAY AND J. KAUTSKY, Jacobi matrices for measures modified by a rational factor, Numer. Algo., v 6 (1994), pp 205-227.
101. S. ELHAY, G.H. GOLUB AND J. KAUTSKY, Updating and downdating of orthogonal polynomials with data fitting applications, SIAM J. Matrix. Anal. Appl., v 12 n 2 (1991), pp 327-353.
102. S. ELHAY, G.H. GOLUB AND J. KAUTSKY, Jacobi matrices for sums of weight functions, BIT, v 32 (1992), pp 143-166.
103. H.W. ENGL, Regularization methods for the stable solution of inverse problems, Surveys Math. Industry, v 3 (1993), pp 71-143.
104. D. FASINO, Spectral properties of Hankel matrices and numerical solutions of finite moment problems, J. Comput. Appl. Math., v 65 (1995), pp 145-155.
105. J. FAVARD, Sur les polyn̂omes de Tchebicheff, C.R. Acad. Sci. Paris, v 200 (1935), pp 2052-2053.
106. K.V. FERNANDO, On computing an eigenvector of a tridiagonal matrix. Part I: basic results, SIAM J. Matrix Anal., v 18 n 4 (1997), pp 1013-1034.
107. K.V. FERNANDO AND B.N. PARLETT, Accurate singular values and differential qd algorithms, Numer. Math., v 67 (1994), pp 191-229.
108. K.V. FERNANDO, B.N. PARLETT AND I.S. DHILLON, A way to find the most redundant equation in a tridiagonal system, Report PAM-635, Center for Pure and Applied Mathematics, University of California, Berkeley (1995).
109. R.D. FIERRO, G.H. GOLUB, P.C. HANSEN AND D.P. O'LEARY, Regularization by truncated total least squares, SIAM J. Sci. Comput., v 18 n 4 (1997), pp 1223-1241.
110. B. FISCHER, Polynomial based iteration methods for symmetric linear systems, Wiley-Tubner, Leipzig (1996).
111. B. FISCHER AND G.H. GOLUB, On generating polynomials which are orthogonal over several intervals, Math. Comput., v 56 n 194 (1991), pp 711-730.
112. B. FISCHER AND G.H. GOLUB, On the error computation for polynomial based iteration methods, in Recent advances in iterative methods, A. Greenbaum and M. Luskin Eds., Springer, Berlin (1993).
113. R. FLETCHER, Conjugate gradient methods for indefinite systems, in Proceedings of the Dundee conference on numerical analysis, G.A.Watson Ed., Springer (1975), pp 73-89.
114. G.E. FORSYTHE, Generation and use of orthogonal polynomials for data fitting with a digital computer, J. Soc. Indust. Appl. Math., v 5 (1957), pp 74-88.
115. 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 applications, M.S. Moonen, G.H. Golub and B. De Moor Eds., Kluwer, Dordrecht (1993), pp 377-380.
116. R.W. FREUND, M.H. GUTKNECHT AND N.M. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non Hermitian matrices, SIAM J. Sci. Comput., v 14 (1993), pp 137-158.
117. A. FROMMER AND P. MAAS, Fast CG-based methods for Tikhonov-Phillips regularization, SIAM J. Sci. Comput., v 20 (1999), pp 1831-1850.
118. A. FROMMER AND V. SIMONCINI, Matrix functions, in Model order reduction: theory, research aspects and applications, Mathematics in industry, WH. Schilders and H.A. van der Vorst Eds., Springer, Berlin (2006), pp 1-24.
119. D. GALANT, An implementation of Christoffel's theorem in the theory of orthogonal polynomials, Math. Comput., v 25 (1971), pp 111-113.
120. D. GALANT, Algebraic methods for modified orthogonal polynomials, Math. Comput., v 59 n 200 (1992), pp 541-546.
121. W. GANDER, Least squares with a quadratic constraint, Numer. Math., v 36 (1981), pp 291-307.
122. W. GANDER, G.H. GOLUB AND U. VON MATT, A constrained eigenvalue problem, Linear Alg. Appl., v 114/115 (1989), pp 815-839.
123. F.R. GANTMACHER, The theory of matrices, vol. 1, Chelsea, New York (1959).
124. K. GATES AND W.B. GRAGG, Notes on TQR algorithms, J. Comput. Appl. Math., v 86 (1997), pp 195-203.
125. C.F. GAUSS, Methodus nova integralium valores per approximationem inveniendi, (1814), in Werke, v 3 , K. Gesellschaft Wissenschaft. Göttingen (1886), pp 163-196.
126. W. GAUTSCHI, Construction of Gauss-Christoffel quadrature formulas, Math. Comput., v 22 (1968), pp 251-270.
127. W. GAUTSCHI, On the construction of Gaussian quadrature rules from modified moments, Math. Comput., v 24 (1970), pp 245-260.
128. W. GAUTSCHI, On generating orthogonal polynomials, SIAM J. Sci. Comput., v 3 n 3 (1982), pp 289-317.
129. W. GAUTSCHI, Orthogonal polynomials- constructive theory and applications, J. Comput. Appl. Math., v 12-13 (1985), pp 61-76.
130. W. GAUTSCHI, Moments in quadrature problems, Comput. Math. Appl., v 33 n 1/2 (1997), pp 105-118.
131. W. GAUTSCHI, Orthogonal polynomials and quadrature, Elec. Trans. Numer. Anal., v 9 (1999), pp 65-76.
132. W. GAUTSCHI, Orthogonal polynomials: computation and approximation, Oxford University Press, Oxford (2004).
133. W. GAUTSCHI, Orthogonal polynomials (in Matlab), J. Comput. Appl. Math., v 178 n 1-2 (2005), pp 215-234.
134. W. GAUTSCHI, A historical note on Gauss-Kronrod quadrature, Numer. Math., v 100 (2005), pp 483-484.
135. W. GAUTSCHI AND R.S. VARGA, Error bounds for Gaussian quadrature of analytic functions, SIAM J. Numer. Anal., v 20 n 6 (1983), pp 1170-1186.
136. J.S. GERONIMO, Scattering theory and matrix orthogonal polynomials on the real line, Circuits Systems Signal Process., v 1 (1982), pp 471-495.
137. H. GFRERER, An a posteriori parameter choice for ordinary and iterated Tikhonov regularization of ill-posed problems leading to optimal convergence rates, Math. Comput., v 49 (1987), pp 507-522.
138. G. GOERTZEL, H.V. WALDINGER AND J. AGRESTA, The method of spherical harmonics as applied to the one-velocity Boltzmann equation in infinite cylinders, in ACM'59: Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery, (1959), pp 1-5.
139. G.H. GOLUB, Bounds for eigenvalues of tridiagonal symmetric matrices computed by the LR method, Math. Comput., v 16 (1962), pp 438-445.
140. G.H. GOLUB, Some modified matrix eigenvalue problems, SIAMRev., v 15 n 2 (1973), pp 318-334.
141. G.H. GOLUB, Bounds for matrix moments, Rocky Mnt. J. Math., v 4 n 2 (1974), pp 207-211.
142. G.H. GOLUB, Matrix computation and the theory of moments, in Proceedings of the international congress of mathematicians, Zürich, Switzerland 1994, Birkhäuser, Basel (1995), pp 1440-1448.
143. G. H. GOLUB AND B. FISCHER, How to generate unknown orthogonal polynomials out of known orthogonal polynomials, J. Comput. Appl. Math., v 43 (1992), pp 99-115.
144. G. H. GOLUB AND M.H. GUTKNECHT, Modified moments for indefinite weight functions, Numer. Math., v 57 (1990), pp 607-624.
145. G. H. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal., v 2 (1965), pp 205-224.
146. G.H. GOLUB AND J. KAUTSKY, Calculation of Gauss quadratures with multiple free and fixed knots, Numer. Math., v 41 (1983), pp 147-163.
147. G.H. GOLUB AND M.D. KENT, Estimates of eigenvalues for iterative methods, Math. Comput., v 53 n 188 (1989), pp 619-626.
148. G.H. GOLUB AND H. MELBØ, A stochastic approach to error estimates for iterative linear solvers, part 1, BIT, v 41 n 5 (2001), pp 977-985.
149. G.H. GOLUB AND H. MELBØ, A stochastic approach to error estimates for iterative linear solvers, part 2, Report SCCM-01-05, Stanford University, Computer Science Department (2001).
150. G.H. GOLUB AND G. MEURANT, Matrices, moments and quadrature, in Numerical analysis 1993, D.F. Griffiths and G.A. Watson Eds., Pitman Research Notes in Mathematics, v 303 (1994), pp 105-156. Reprinted in [61].
151. G.H. GOLUB AND G. MEURANT, Matrices, moments and quadrature II or how to compute the norm of the error in iterative methods, BIT, v 37 n 3 (1997), pp 687-705.
152. G.H. GOLUB AND Z. STRAKOS, Estimates in quadratic formulas, Numer. Algo., v 8 n II-IV, (1994).
153. G.H. GOLUB AND R. UNDERWOOD, The block Lanczos method for computing eigenvalues, in Mathematical software III, J. Rice Ed., Academic Press, New York (1977), pp 361-377.
154. G.H. GOLUB AND C. VAN LOAN, An analysis of the total least squares problem, SIAM J. Numer. Anal., v 17 n 6 (1980), pp 883-893.
155. G.H. GOLUB AND C. VAN LOAN, Matrix Computations, Third Edition, Johns Hopkins University Press, Baltimore (1996).
156. G.H. GOLUB AND R.S. VARGA, Chebyshev semi-iterative methods, successive overrelaxation iterative methods and second order Richardson iterative methods, Part I, Numer. Math., v 3 (1961), pp 147-156.
157. G.H. GOLUB AND R.S. VARGA, Chebyshev semi-iterative methods, successive overrelaxation iterative methods and second order Richardson iterative methods, Part II, Numer. Math., v 3 (1961), pp 157-168.
158. G.H. GOLUB AND U. VON MATT, Quadratically constrained least squares and quadratic problems, Numer. Math., v 59 (1991), pp 561-580.
159. G.H. GOLUB AND U. VON MATT, Tikhonov regularization for large scale problems, in Scientific computing, G.H. Golub, S.H. Lui, F. Luk and R. Plemmons Eds., Springer, Berlin (1997), pp 3-26.
160. G.H. GOLUB AND U. VON MATT, Generalized cross-validation for large scale problems, in Recent advances in total least squares techniques and errors-in-variable modelling, S. van Huffel Ed., SIAM, Philadelphia (1997), pp 139-148.
161. G.H. GOLUB AND J.H. WELSCH, Calculation of Gauss quadrature rules, Math. Comput., v 23 (1969), pp 221-230. Reprinted in [61].
162. G.H. GOLUB, P.C. HANSEN AND D.P. O'LEARY, Tikhonov regularization and total least squares, SIAM J. Matrix Anal. Appl., v 21 n 1 (1999), pp 185-194.
163. G.H. GOLUB, M. HEATH AND G. WAHBA, Generalized cross-validation as a method to choosing a good ridge parameter, Technometrics, v 21 n 2 (1979), pp 215-223.
164. G.H. GOLUB, M. STOLL AND A. WATHEN, Approximation of the scattering amplitude, Elec. Trans. Numer. Anal., v 31 (2008), pp 178-203.
165. W.B. GRAGG AND W.J. HARROD, The numerically stable reconstruction of Jacobi matrices from spectral data, Numer. Math., v 44 (1984), pp 317-335.
166. J. GRCAR, Optimal sensitivity analysis of linear least squares problems, Report LBNL-52434, Lawrence Berkeley National Laboratory (2003).
167. C. GU, D.M. BATRES, Z. CHEN AND G. WAHBA, The computation of generalized cross-validation functions through Householder tridiagonalization with applications to the fitting of interaction spline models, SIAM J. Matrix Anal., v 10 (1989), pp 457-480.
168. M. GU AND S.C. EISENSTAT, A divide-and-conquer algorithm for the symmetric tridiagonal eigenvalue problem, SIAM J. Matrix Anal., v 16 (1995), pp 172-191.
169. J. HADAMARD, Essai sur l'étude des fonctions données par leur développement de Taylor, J. Math. Pures et Appl., v 4 (1892), pp 101-186.
170. M. HANKE, Limitations of the L-curve method in ill-posed problems, BIT, v 36 (1996), pp 287-301.
171. M. HANKE, Iterative regularization techniques in image restoration, in Surveys on solution methods for inverse problems, D. Colton et al. Eds., Springer-Verlag, Berlin (2000), pp 35-52.
172. M. HANKE, On Lanczos based methods for the regularization of discrete ill-posed problems, BIT, v 41 (2001), pp 1008-1018.
173. M. HANKE, A note on Tikhonov regularization of large linear problems, BIT, v 43 (2003), pp 449-451.
174. M. HANKE AND P.C. HANSEN, Regularization methods for large scale problems, Surveys Math. Industry, v 3 (1993), pp 253-315.
175. M. HANKE AND J.G. NAGY, Restoration of atmospherically blurred images by symmetric indefinite conjugate gradient techniques, Inverse Problems, v 12 (1996), pp 157-173.
176. M. HANKE AND T. RAUS, A general heuristic for choosing the regularization parameter in ill-posed problems, SIAM J. Sci. Comput., v 17 (1996), pp 956-972.
177. P.C. HANSEN, Analysis of discrete ill-posed problems by means of the Lcurve, SIAM Rev., v 34 (1992), pp 561-580.
178. P.C. HANSEN, Regularization tools: a Matlab package for analysis and solution of discrete ill-posed problems, Numer. Algo., v 6 (1994), pp 1-35.
179. P.C. HANSEN, Rank-deficient and discrete ill-posed problems. Numerical aspects of linear inversion, SIAM, Philadelphia (1997).
180. P.C. HANSEN, Regularization Tools version 4.0 for Matlab 7.3, Numer. Algo., v 46 (2007), pp 189-194.
181. P.C. HANSEN AND D.P. O'LEARY, The use of the L-curve in the regularization of discrete ill-posed problems, SIAM J. Sci. Comput., v 14 (1993), pp 1487-1503.
182. P.C. HANSEN, T.K. JENSEN AND G. RODRIGUEZ, An adaptive pruning algorithm for the discrete L-curve criterion, J. Comput. Appl. Math., v 198 n 2 (2007), pp 483-492.
183. R. HAYDOCK, Comparison of quadrature and termination for estimating the density of states within the recursion method, J. Phys. C: Solid State Phys., v 17 (1984), pp 4783-4789.
184. R. HAYDOCK, Accuracy of the recursion method and basis non- orthogonality, Comput. Phys. Commun., v 53 (1989), pp 133-139.
185. R. HAYDOCK AND R.L. TE, Accuracy of the recursion method, Phys. Rev. B: Condensed Matter, v 49 (1994), pp 10845-10850.
186. P. HENRICI, The quotient-difference algorithm, NBS Appl. Math. Series, v 49 (1958), pp 23-46.
187. P. HENRICI, Quotient-difference algorithms, in Mathematical methods for digital computers, A. Ralston and H.S.Wilf Eds., J.Wiley, New York (1967), pp 37-62.
188. M.R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Nat. Bur. Standards, v 49 n 6 (1952), pp 409-436.
189. N. HIGHAM, Accuracy and stability of numerical algorithms, second edition, SIAM, Philadelphia (2002).
190. N. HIGHAM, Functions of matrices: theory and computation, SIAM, Philadelphia (2008).
191. I. HNĚTYNKOVÀ AND Z. STRAKOŠ, Lanczos tridiagonalization and core problems, Linear Alg. Appl., v 421 (2007), pp 243-251.
192. M. HOCHBRUCK AND M. HOCHSTENBACH, Subspace extraction for matrix functions, Report Heinrich-Heine-Universität Düsseldorf (2006).
193. M. HOCHBRUCK AND C. LUBICH, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., v 34 n 5 (1997), pp 1911-1925.
194. A.S. HOUSEHOLDER, The theory of matrices in numerical analysis, Blaisdell, New York (1964). Reprinted by Dover, New York (1975).
195. M. HUTCHINSON, Algorithm 642: a fast procedure for calculating minimum cross-validation cubic smoothing spline, ACM Trans. Math. Soft., v 12 (1986), pp 150-153.
196. M. HUTCHINSON, A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines, Comm. Statist. Simul., v 18 (1989), pp 1059-1076.
197. M. HUTCHINSON AND F.R. DE HOOG, Smoothing noisy data with spline functions, Numer. Math., v 47 (1985), pp 99-106.
198. I.C.F. IPSEN AND D.J. LEE, Determinant approximation, submitted to Numer. Lin. Alg. Appl. (2005).
199. J. KAUTSKY, Matrices related to interpolatory quadrature, Numer. Math., v 36 (1981), pp 309-318.
200. J. KAUTSKY, Gauss quadratures: An inverse problem, SIAM J. Matrix Anal. Appl., v 13 n 1 (1992), pp 402-417.
201. J. KAUTSKY AND S. ELHAY, Calculation of the weights of interpolatory quadratures, Numer. Math., v 40 (1982), pp 407-422.
202. J. KAUTSKY AND S. ELHAY, Gauss quadratures and Jacobi matrices for weight functions not of one sign, Math. Comput., v 43 (1984), pp 543-550.
203. J. KAUTSKY AND G.H. GOLUB, On the calculation of Jacobi matrices, Linear Alg. Appl., v 52/53 (1983), pp 439-455.
204. M. KILMER AND D.P. O'LEARY, Choosing regularization parameter in iterative methods for ill-posed problems, SIAM J. Matrix Anal. Appl., v 22 (2001), pp 1204-1221.
205. M. KILMER AND G.W. STEWART, Iterative regularization and MINRES, SIAM J. Matrix Anal. Appl., v 21 (1999), pp 613-628.
206. L. KNIZHNERMAN, Calculation of functions of unsymmetric matrices using Arnoldi's method, Comput. Maths. Math. Phys., v 31 (1991), pp 1-9.
207. L. KNIZHNERMAN, The simple Lanczos procedure: estimates of the error of the Gauss quadrature formula and their applications, Comput. Maths. Math. Phys., v 36 n 11 (1996), pp 1481-1492.
208. -1φ, φ. and rational Padé-type approximation for Markov-type functions, Sb. Math., v 199 (2008), pp 185-206.
209. M.G. KREIN, Fundamental aspects of the representation theory of Hermitian operators with deficiency index (m, m), Ukrain. Mat. Z., v 1 (1949), pp 3-66
210. Amer. Math. Soc. Transl., v 2 n 97 (1970), pp 75-143.
211. A.S. KRONROD, Integration with control of accuracy, Dokl. Akad. Nauk SSSR, v 154 (1964), pp 283-286.
212. A.S. KRONROD, Nodes and weights of quadrature formulas: sixteen-place tables, Consultants Bureau, New York (1965).
213. J.V. LAMBERS, Krylov subspace spectral methods for variable-coefficient initial-boundary value problems, Elec. Trans. Numer. Anal., v 20 (2005), pp 212-234.
214. J.V. LAMBERS, Practical implementation of Krylov subspace spectral methods, J. Sci. Comput., v 32 (2007), pp 449-476.
215. J.V. LAMBERS, Derivation of high-order spectral methods for timedependent PDE using modified moments, Elec. Trans. Numer. Anal., v 28 (2008), pp 114-135.
216. J.V. LAMBERS, Implicitly defined high-order operator splittings for parabolic and hyperbolic variable-coefficient PDE using modified moments, Int. J. Comput. Science, v 2 (2008), pp 376-401.
217. J.V. LAMBERS, Enhancement of Krylov subspace spectral methods by block Lanczos iteration, Elec. Trans. Numer. Anal., v 31 (2008), pp 86-109.
218. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Standards, v 45 (1950), pp 255-282.
219. C. LANCZOS, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bur. Standards, v 49 (1952), pp 33-53.
220. D.P. LAURIE, Anti-Gaussian quadrature formulas, Math. Comput., v 65 n 214 (1996), pp 739-747.
221. D.P. LAURIE, Calculation of Gauss-Kronrod quadrature rules, Math.Comput., v 66 (1997), pp 1133-1145.
222. D.P. LAURIE, Accurate recovery of recursion coefficients from Gaussian quadrature formulas, J. Comput. Appl. Math., v 112 (1999), pp 165-180.
223. D.P. LAURIE, Questions related to Gaussian quadrature formulas and twoterm recursions, in Applications and computation of orthogonal polynomials, W. Gautschi, G.H. Golub and G. Opfer Eds., Birkhauser, Basel (1999), pp 133-144.
224. D.P. LAURIE, Computation of Gauss-type quadrature formulas, J. Comput. Appl. Math., v 127 (2001), pp 201-217.
225. C.L. LAWSON AND R.J. HANSON, Solving least squares problems, SIAM, Philadelphia (1995).
226. A.S. LEONOV, On the choice of regularization parameters by means of the quasi-optimality and ratio criteria, Soviet Math. Dokl., v 19 (1978), pp 537-540.
227. K.C. LI, From Stein's unbiased risk estimates to the method of generalized cross-validation, Annals Statist., v 13 (1985), pp 1352-1377.
228. REN-CANG LI, Solving secular equations stably and efficiently, Report UCB CSD-94-851, University of California, Berkeley (1994).
229. K-F. LIU, A noisy Monte Carlo algorithm with fermion determinant, Chinese J. Phys., v 38 (2000), pp 605-614.
230. R. LOBATTO, Lessen over de differentiaal- en integraal-rekening, De Gebroeders Van Cleef, 's Gravenhage and Amsterdam, (1851).
231. H. LU AND F.H. MATHIS, Surface approximation by spline smoothing and generalized cross-validation, Math. Comput. Simul., v 34 (1992), pp 541-549.
232. F. MARCELLÁN AND R. ALVAREZ-NODARSE, On the "Favard theorem" and its extensions, J. Comput. Appl. Math., v 17 (2001), pp 231-254.
233. F. MARCELLÁN AND H.O. YAKHLEF, Recent trends on analytic properties of matrix orthonormal polynomials, Elec. Trans. Numer. Anal., v 14 (2002), pp 127-141.
234. A. MELMAN, A unifying convergence analysis of second-order methods for secular equation, Math. Comput., v 66 n 217 (1997), pp 333-344.
235. A. MELMAN, A numerical comparison of methods for solving secular equations, J. Comput. Appl. Math., v 86 (1997), pp 237-249.
236. G. MEURANT, A review of the inverse of tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl., v 13 n 3 (1992), pp 707-728.
237. G. MEURANT, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algo., v 16 (1997), pp 77-87.
238. G. MEURANT, Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm, Numer. Algo., v 22 (1999), pp 353-365.
239. G. MEURANT, Computer solution of large linear systems, North-Holland, Amsterdam (1999).
240. G. MEURANT, Estimates of the l2 norm of the error in the conjugate gradient algorithm, Numer. Algo., v 40 n 2 (2005), pp 157-169.
241. G. MEURANT, The Lanczos and conjugate gradient algorithms, from theory to finite precision computations, SIAM, Philadelphia (2006).
242. G. MEURANT, Gene H. Golub 1932-2007, Numer. Algo., v 51 n 1 (2009), pp 1-4.
243. G. MEURANT, Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm, Numer. Algo., v 51 n 3 (2009), pp 309-318.
244. G. MEURANT AND Z. STRAKOŠ, The Lanczos and conjugate gradient algorithms in finite precision arithmetic, Acta Numerica, v 15 (2006), pp 471-542.
245. G. MONEGATO, An overview of the computational aspects of Kronrod quadrature rules, Numer. Algo., v 26 (2001), pp 173-196.
246. V.A. MOROZOV, Methods for solving incorrectly posed problems, Springer, Berlin (1984).
247. M. MÜHLICH AND R. MESTER, The role of total least squares in motion analysis, in Proceedings of the european conference on computer vision, H. Burkhardt Ed., Springer, Berlin (1998), pp 305-321.
248. J.G. NAGY, K. PALMER AND L. PERRONE, Iterative methods for image deblurring: A Matlab object oriented approach, Numer. Algo., v 36 (2004), pp 73-93.
249. C.M. NEX, Estimation of integrals with respect to a density of states, J. Phys. A, v 11 n 4 (1978), pp 653-663.
250. C.M. NEX, The block Lanczos algorithm and the calculation of matrix resolvents, Comput. Phys. Commun., v 53 (1989), pp 141-146.
251. D.P. O'LEARY, The block conjugate gradient algorithm and related methods, Linear Alg. Appl., v 29 (1980), pp 293-322.
252. D.P. O'LEARY, Near-optimal parameters for Tikhonov and other regularization methods, SIAM J. Sci. Comput., v 23 n 4 (2001), pp 1161-1171.
253. D.P. O'LEARY AND J.A. SIMMONS, A bidiagonalization-regularization procedure for large scale discretizations of ill-posed problems, SIAM J. Sci. Stat. Comput., v 2 (1981), pp 474-489.
254. D.P. O'LEARY, Z. STRAKOŠ AND P. TICHÝ, On sensitivity of Gauss- Christoffel quadrature, Numer. Math., v 107 n 1 (2007), pp 147-174.
255. B. ORTNER, On the selection of measurement directions in second-rank tensor (e.g. elastic strain) determination of single crystals, J. Appl. Cryst., v 22 (1989), pp 216-221.
256. B. ORTNER AND A.R. KRÄUTER, Lower bounds for the determinant and the trace of a class of Hermitian matrix, Linear Alg. Appl., v 236 (1996), pp 147-180.
257. C.C. PAIGE, The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. thesis, University of London (1971).
258. C.C. PAIGE AND M.A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Soft., v 8 (1982), pp 43-71.
259. C.C. PAIGE AND M.A. SAUNDERS, Algorithm 583, LSQR: Sparse linear equations and least squares problems, ACM Trans. Math. Soft., v 8 (1982), pp 195-209.
260. C.C. PAIGE AND Z. STRAKOŠ, Bounds for the least squares residual using scaled total least squares, in Proceedings of the third international workshop on TLS and error-in-variables modelling, S. Van Huffel and P. Lemmerling Eds., Kluwer, Dordrecht (2001), pp 25-34.
261. C.C. PAIGE AND Z. STRAKOŠ, Unifying least squares, total least squares and data least squares, in Proceedings of the third international workshop on TLS and error-in-variables modelling, S. Van Huffel and P. Lemmerling Eds., Kluwer, Dordrecht (2001), pp 35-44.
262. C.C. PAIGE AND Z. STRAKOŠ, Bounds for the least squares distance using scaled total least squares problems, Numer. Math., v 91 (2002), pp 93-115.
263. C.C. PAIGE AND Z. STRAKOŠ, Scaled total least squares fundamentals, Numer. Math., v 91 (2002), pp 117-146.
264. C.C. PAIGE AND Z. STRAKOŠ, Core problems in linear algebraic systems, SIAM J. Matrix Anal. Appl., v 27 n 3 (2006), pp 861-874.
265. C.C. PAIGE, B.N. PARLETT AND H. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Alg. Appl., v 2 (1995), pp 115-133.
266. B.N. PARLETT, The development and use of methods of LR type, SIAM Rev., v 6 n 3 (1964), pp 275-295.
267. B.N. PARLETT, The new qd algorithms, Acta Numerica, v 15 (1995), pp 459-491.
268. B.N. PARLETT, The symmetric eigenvalue problem, Prentice-Hall, Englewood Cliffs (1980), second edition SIAM, Philadelphia (1998).
269. B.N. PARLETT, For tridiagonals T replace T with LDLT, J. Comput. Appl. Math., v 123 (2000), pp 117-130.
270. B.N. PARLETT AND I.S. DHILLON, Fernando's solution to Wilkinson's problem: an application of double factorization, Linear Alg. Appl., v 267 (1997), pp 247-279.
271. B.N. PARLETT AND O.A. MARQUES, An implementation of the dqds algorithm (positive case), Linear Alg. Appl., v 309 (2000), pp 217-259.
272. B.N. PARLETT AND D.S. SCOTT, The Lanczos algorithm with selective orthogonalization, Math. Comput., v 33 n 145 (1979), pp 217-238.
273. S. PASZKOWSKI, Sur des transformations d'une fonction de poids, in Polyn̂omes orthogonaux et applications, C. Brezinski, A. Draux, A.P. Magnus, P. Maroni and A. Ronveaux Eds., LNM v 1171, Springer-Verlag, Berlin (1985), pp 239-246.
274. T.N.L. PATTERSON, The optimal addition of points to quadrature formulae, Math. Comput., v 22 (1968), pp 847-856.
275. T.N.L. PATTERSON, Modified optimal quadrature extensions, Numer. Math., v 64 (1993), pp 511-520.
276. T.N.L. PATTERSON, Stratified nested and related quadrature rules, J. Comput. Appl. Math., v 112 (1999), pp 243-251.
277. R. PINTELON, P. GUILLAUME, G. VANDERSTEEN AND Y. ROLAIN, Analyses, development, and applications of TLS algorithms in frequency domain system identification, SIAM J. Matrix Anal. Appl., v 19 n 4 (1998), pp 983-1004.
278. R. RADAU, Etude sur les formules d'approximation qui serventà calculer la valeur numérique d'une intégrale définie, J. Math. Pures Appl., v 6 (1880), pp 283-336
279. T. REGIŃKA, A regularization parameter in discrete ill-posed problems, SIAM J. Sci. Comput., v 17 (1996), pp 740-749.
280. L. REICHEL, Fast QR decomposition of Vandermonde-like matrices and polynomial least squares approximation, SIAM J. Matrix Anal. Appl., v 12 n 3 (1991), pp 552-564.
281. L. REICHEL, Construction of polynomials that are orthogonal with respect to a discrete bilinear form, Adv. Comput. Math., v 1 (1993), pp 241-258.
282. L. REICHEL, G. RODRIGUEZ AND S. SEATZU, Error estimates for largescale ill-posed problems, Numer. Algo., v 51 n 3 (2009), pp 341-361.
283. C. REINSCH, Smoothing with spline functions, Numer. Math., v 10 (1967), pp 177-183.
284. C. REINSCH, Smoothing with spline functions II, Numer. Math., v 16 (1971), pp 451-455.
285. F. RIESZ AND B. SZ-NAGY Functional analysis, Dover, New York (1990). The original edition was published in 1952.
286. J.L. RIGAL AND J. GACHES, On the compatibility of a given solution with the data of a linear system, J. ACM, v 14 (1967), pp 543-548.
287. P.D. ROBINSON AND A. WATHEN, Variational bounds on the entries of the inverse of a matrix, IMA J. Numer. Anal., v 12 (1992), pp 463-486.
288. H. RUTISHAUSER, Der Quotienten-Differenzen-Algorithmus, Zeitschrift für Angewandte Mathematik und Physik (ZAMP), v 5 n 3 (1954), pp 233-251.
289. H. RUTISHAUSER, Solution of eigenvalue problems with the LRtransformation , Nat. Bur. Standards Appl. Math. Ser., v 49 (1958), pp 47-81.
290. H. RUTISHAUSER, On Jacobi rotation patterns, in Proceedings of symposia in applied mathematics, v 15, Experimental arithmetic, high speed computing and mathematics, American Mathematical Society, Providence RI (1963), pp 219-239.
291. R.A. SACK AND A. DONOVAN, An algorithm for Gaussian quadrature given modified moments, Numer. Math., v 18 n 5 (1972), pp 465-478.
292. H.E. SALZER, A recurrence scheme for converting from one orthogonal expansion into another, Commun. ACM, v 16 n 11 (1973), pp 705-707.
293. B. SAPOVAL, T. GOBRON AND A. MARGOLINA, Vibrations of fractal drums, Phys. Rev. Lett., v 67 (1991), pp 2974-2977.
294. M.A. SAUNDERS, H.D. SIMON AND E.L. YIP, Two conjugate-gradienttype methods for unsymmetric linear equations, SIAM J. Numer. Anal., v 25 no 4 (1988), pp 927-940.
295. P.E. SAYLOR AND D.C. SMOLARSKI, Why Gaussian quadrature in the complex plane?, Numer. Algo., v 26 (2001), pp 251-280.
296. P.E. SAYLOR AND D.C. SMOLARSKI, Addendum to: Why Gaussian quadrature in the complex plane?, Numer. Algo., v 27 (2001), pp 215-217.
297. L.L. SCHUMAKER AND F.I. UTRERAS, On generalized cross-validation for tensor smoothing splines, SIAM J. Sci. Stat. Comput., v 11 (1990), pp 713-731.
298. J.C. SEXTON AND D.H. WEINGARTEN, Systematic expansion for full QCD based on the valence approximation, Report IBM T.J.Watson Research Center (1994).
299. B. SHAHRARAY AND D.J. ANDERSON, Optimal estimation of contour properties by cross-validated regularization, IEEE Trans. Pattern Anal. Machine Intell., v 11 (1989), pp 600-610.
300. J. SHOHAT, The relation of classical orthogonal polynomials to the polynomials of Appell, Amer. J. Math., v 58 (1936), pp 453-464.
301. J.A. SHOHAT AND J.D. TAMARKIN, The problem of moments, Mathematical surveys, v 1, American Mathematical Society, Providence RI (1943).
302. R.B. SIDJE, K. BURRAGE AND B. PHILIPPE, An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix, in Computational science - ICCS 2003 Lecture notes in computer science, Springer, Berlin (2003), pp 693-704.
303. D.M. SIMA AND S. VAN HUFFEL, Using core formulations for ill-posed linear systems, in Proceedings of the 76th GAMM Annual Meeting, Luxembourg, special issue of PAMM, v 5 n 1 (2005), pp 795-796.
304. D.M. SIMA, S. VAN HUFFEL AND G.H. GOLUB, Regularized total least squares based on quadratic eigenvalue problem solvers, BIT Numer. Math., v 44 (2004), pp 793-812.
305. H.D. SIMON, The Lanczos algorithm with partial reorthogonalization, Math. Comput., v 42 n 165 (1984), pp 115-142.
306. A. SINAP, Gaussian quadrature for matrix valued functions on the real line, J. Comput. Appl. Math., v 65 (1995), pp 369-385.
307. A. SINAP AND W. VAN ASSCHE, Polynomial interpolation and Gaussian quadrature for matrix-valued functions, Linear Alg. Appl., v 207 (1994), pp 71-114.
308. A. SINAP AND W. VAN ASSCHE, Orthogonal matrix polynomials and applications, J. Comput. Appl. Math., v 66 (1996), pp 27-52.
309. M.R. SKRZIPEK, Orthogonal polynomials for modified weight functions, J. Comput. Appl. Math., v 41 (1992), pp 331-346.
310. R. SKUTSCH, Ueber formelpaare der mechanischen quadratur, Arch. Math. Phys., v 13 n 2 (1894), pp 78-83.
311. M.M. SPALEVIĆ, On generalized averaged Gaussian formulas, Math.Comput., v 76 n 259 (2007), pp 1483-1492.
312. G.W. STEWART, Matrix algorithms, volume I: basic decompositions, SIAM, Philadelphia (1998).
313. E. STIEFEL, Kernel polynomials in linear algebra and their numerical applications, Nat. Bur. Standards Appl. Math. Ser., v 49 (1958), pp 1-22.
314. T.J. STIELTJES, Quelques recherches sur la théorie des quadratures dites mécaniques, Ann. Sci. Ecole Norm. Sup. Paris, Sér. 3 tome 1 (1884), pp 409-426. Also in Oeuvres complètes, v 1, Noordhoff, Groningen (1914), pp 377-396.
315. T.J. STIELTJES, Recherches sur les fractions continues, Ann. Fac. Sci. Toulouse, v 8, (1894), J1-122, v 9 (1895), A1-10. Also in Oeuvres complètes, v 2, Noordhoff, Groningen (1918), pp 402-566.
316. J. STOER AND R. BULIRSCH, Introduction to numerical analysis, second edition, Springer-Verlag, Berlin (1983).
317. Z. STRAKOŠ, On the real convergence rate of the conjugate gradient method, Linear Alg. Appl., v 154-156 (1991), pp 535-549.
318. Z. STRAKOŠ, Model reduction using the Vorobyev moment problem, Numer. Algo., v 51 n 3 (2008), pp 363-379.
319. Z. STRAKOŠ AND P. TICHÝ, On error estimates in the conjugate gradient method and why it works in finite precision computations, Elec. Trans. Numer. Anal., v 13 (2002), pp 56-80.
320. Z. STRAKOŠ AND P. TICHÝ, Error estimation in preconditioned conjugate gradients, BIT Numer. Math., v 45 (2005), pp 789-817.
321. Z. STRAKOŠ AND P. TICHÝ, Estimation of c*A-1b via matching moments, submitted to SIAM J. Sci. Comput., (2008).
322. A.H. STROUD AND D. SECREST, Gaussian quadrature formulas, Prentice- Hall, Englewoods Cliffs, NJ (1966).
323. G.W. STRUBLE, Orthogonal polynomials: variable-signed weight functions, Numer. Math., v 5 (1963), pp 88-94.
324. ZHENG SU, Computational methods for least squares problems and clinical trials, Ph.D. thesis, Stanford University (2005).
325. G. SZEGÖ, Orthogonal polynomials, Third Edition, American Mathematical Society, Providence, RI (1974).
326. A.N. TIKHONOV ED., Ill-posed problems in natural sciences, Proceedings of the international conference Moscow 1991, TVP Science publishers, Moscow (1992).
327. A.N. TIKHONOV AND V.Y. ARSENIN, Solutions of ill-posed problems, Wiley, New York (1977).
328. A.M. THOMPSON, J.C. BROWN, J.W. KAY AND D.M. TITTERINGTON, A study of methods of choosing the smoothing parameter in image restoration by regularization, IEEE Trans. Pattern Anal. Machine Intell., v 13 (1991), pp 326-339.
329. L.N. TREFETHEN, Is Gauss quadrature better than Clenshaw-Curtis?, SIAM Rev., v 50 n 1, (2008).
330. E. TYRTYSHNIKOV, How bad are Hankel matrices?, Numer. Math., v 67 (1994), pp 261-269.
331. F.I. UTRERAS, Sur le choix du paramètre d'ajustement dans le lissage par fonctions spline, Numer. Math., v 34 (1980), pp 15-28.
332. F.I. UTRERAS, Optimal smoothing of noisy data using spline functions, SIAM J. Sci. Stat. Comput., v 2 (1981), pp 349-362.
333. V.B. UVAROV, Relation between polynomials orthogonal with different weights, Dokl. Akad. Nauk SSSR, v 126 (1959), pp 33-36. (in Russian)
334. V.B. UVAROV, The connection between systems of polynomials that are orthogonal with respect to different distribution functions, USSR Comput. Math. Phys., v 9 (1969), pp 25-36.
335. S. VAN HUFFEL AND J. VANDEWALLE, The total least squares problem: computational aspects and analysis, SIAM, Philadelphia (1991).
336. J.M. VARAH, Pitfalls in the numerical solution of linear ill-posed problems, SIAM J. Sci. Stat. Comput., v 4 n 2 (1983), pp 164-176.
337. R. VIO, J. NAGY, L. TENORIO AND W. WAMSTEKER, Multiple image deblurring with spatially variant PSFs, Astron. Astrophys., v 434 (2005), pp 795-800.
338. C.R. VOGEL, Non-convergence of the L-curve regularization parameter selection method, Inverse Problems, v 12 (1996), pp 535-547.
339. U. VON MATT, The orthogonal qd-algorithm, SIAM J. Sci. Comput., v 18, n 4 (1997), pp 1163-1186.
340. YU.V. VOROBYEV, Methods of moments in applied mathematics, Gordon and Breach Science Publishers, New York (1965).
341. G. WAHBA, Spline bases, regularization and generalized cross-validation for solving approximation problems with large quantities of noisy data, in Approximation theory III, E.W. Cheney Ed., Academic Press, New York (1980), pp 905-912.
342. G. WAHBA, Spline models for observational data, CBMS-NSF regional conference series in applied mathematics, v 59, SIAM, Philadelphia (1990).
343. G. WAHBA AND S. WOLD, A completely automatic french curve, Commun. Statist., v 4 (1975), pp 1-17.
344. G. WAHBA, D.R. JOHNSON, F. GAO AND J. GONG, Adaptive tuning of numerical weather prediction models; randomized GCV in three and fourdimensional data assimilation, Monthly Weather Review, v 123 (1995), pp 3358-3369.
345. B. WALDÉN, R. KARLSON AND J.G. SUN, Optimal backward perturbation bounds for the linear least squares problem, Numer. Lin. Alg. Appl., v 2 n 3 (1995), pp 271-286.
346. K.F. WARNICK, Continued fraction error bound for conjugate gradient method, ECEN Department report TR-L100-98.3, Brigham Young University (1997).
347. K.F. WARNICK, Gaussian quadrature and scattering amplitude, Report Department of electrical and computer engineering, University of Illinois (2000).
348. K.F. WARNICK, Nonincreasing error bound for the biconjugate gradient method, Report Department of electrical and computer engineering, University of Illinois (2000).
349. J.A.C. WEIDEMAN AND L.N. TREFETHEN, The kink phenomenon in Fejér and Clenshaw-Curtis quadrature, Numer. Math., v 107 (2007), pp 707-727.
350. J.C. WHEELER, Modified moments and Gaussian quadrature, in Proceedings of the international conference on Padé approximants, continued fractions and related topics, Boulder, CO, Rocky Mtn. J. Math., v 4 n 2 (1974), pp 287-296.
351. H.S. WILF, Mathematics for the physical sciences,Wiley, New York (1962).
352. A. WILLIAMS AND K. BURRAGE, Surface fitting using GCV smoothing splines on supercomputers, in Conference on high performance networking and computing, Proceedings of the 1995 ACM/IEEE conference on supercomputing, ACM, New York (1995).
353. S.Y. WU, J.A. COCKS AND C.S. JAYANTHI, An accelerated inversion algorithm using the resolvent matrix method, Comput. Phys. Commun., v 71 (1992), pp 15-133.
354. M. XIA, E. SABER, G. SHARMA AND A. MURAT TEKALP, End-to-end color printer calibration by total least squares regression, IEEE Trans. Image Process., v 8 n 5 (1999), pp 700-716.
355. SHU-FANG XU, On the Jacobi matrix inverse eigenvalue problem with mixed given data, SIAM J. Matrix Anal. Appl., v 17 n 3 (1996), pp 632-639.