Sven Hammarling
Skip Abstract Section
Abstract
To Gene Golub who has done so much to encourage and advance the use of stable numerical techniques in multivariate statistics.
- Banfield, C. F. (1978). Singular value decomposition in multivariate analysis. In "Numerical Software - Needs and Availability". Ed. Jacobs, D. A. H., Academic Press, London.Google Scholar
- Björck, A. and Golub, G. H. (1973). Numerical methods and computing angles between linear subspaces. Maths. of Computation, 27, 579--594.Google ScholarCross Ref
- BMPD (1977). Biomedical Computer Programs. University of California Press, London.Google Scholar
- Chambers, J. M. (1977). Computational Methods for Data Analysis. Wiley, New York.Google Scholar
- Chan, T. F. (1982). Algorithm 581: An improved algorithm for computing the singular value decomposition. ACM Trans. Math. Softw. 8, 84--88. Google ScholarDigital Library
- Chan, T. F., Golub, G. H. and Leveque, R. J. (1982). Updating formulae and a pairwise algorithm for computing sample variances. In "COMPSTAT '82, Part I: Proceedings in Computational Statistics". Eds. Caussinus, H., Ettinger, P. and Tomassone, R. Physica-Verlag, Vienna.Google Scholar
- Chan, T. F. and Lewis, J. G. (1979). Computing standard deviations: Accuracy. Comm. ACM, 22, 526--531. Google ScholarDigital Library
- Cox, M. G. (1981). The least squares solution of overdetermined linear equation shaving band or augmented band structure. IMA J. Num. Anal., 1, 3--22.Google ScholarCross Ref
- Dongarra, J. J., Moler, C. B., Bunch, J. R. and Stewart, G. W. (1979). Linpack Users' Guide. SIAM, Philadelphia.Google Scholar
- Forsythe, G. E. and Moler, C. B. (1967). Computer Solution of Linear Algebraic Equations. Prentice-Hall, New Jersey.Google Scholar
- Gentleman, W. M. (1974a). Basic procedures for large, sparse or weighted linear least squares problems. Appl. Statist., 23, 448--454.Google ScholarCross Ref
- Gentleman, W. M. (1974b). Regression problems and the QU decomposition. Bulletin IMA, 10, 195--197.Google Scholar
- Gill, P. E. and Murray, W. (1977). Modification of matrix factorizations after a rank one change. In "The State of the Art of Numerical Analysis". Ed. Jacobs, D.A.H. Academic Press, London.Google Scholar
- Golub, G. H. (1965). Numerical methods for solving linear least squares problems. Num. Math., 7, 206--216.Google ScholarDigital Library
- Golub, G. H. (1969). Matrix decompositions and statistical calculations. In "Statistical Computation". Eds. Milton, R. C. and Nelder, J. A., Academic Press, London.Google Scholar
- Golub, G. H. and Kahan, W. (1965). Calculating the singular values and pseudoinverse of a matrix. SIAM J. Num. Anal., 2, 202--224.Google Scholar
- Golub, G. H., Klema, V. C. and Stewart, G. W. (1976). Rank degeneracy and least squares problems. Technical Report STAN-CS-76-559, Stanford University, Stanford, CA 94305, USA. Google ScholarDigital Library
- Golub, G. H. and Reinsch, C. (1970). Singular value decomposition and least squares solutions. Num. Math., 14, 403--420.Google ScholarDigital Library
- Golub, G. H. and Van Loan, C. F. (1980). An analysis of the total least squares problem. SIAM J. Num. Anal., 17, 883--893.Google ScholarCross Ref
- Golub, G. H. and Van Loan, C. F. (1983). Matrix Computations. North Oxford Academic, Oxford.Google Scholar
- Golub, G. H. and Wilkinson, J. H. (1966). Note on iterative refinement of least squares solutions. Num. Math., 9, 139--148.Google ScholarDigital Library
- Hammarling, S. J., Long, E. M. R. and Martin, D. W. (1983). A generalized linear least squares algorithm for correlated observations, with special reference to degenerate data. NPL Report DITC 33/83. National Physical Laboratory, Teddington, Middlesex, TW11 OLW, UK.Google Scholar
- IMSL, International Mathematical and Statistical Libraries, 7500 Bellaire Blvd., Houston, TX 77036-5085, USA.Google Scholar
- Klema, V. C. and Laub, A. J. (1980). The singular value decomposition: its computation and some applications. IEEE Trans. Automat. Control, AC-25, 164--176.Google ScholarCross Ref
- Kourouklis, S. and Paige, C. C. (1981). A constrained least squares approach to the general Gauss-Markov linear model. J. American Statistical Assoc., 76, 620--625.Google ScholarCross Ref
- Lawson, C. L. and Hanson, R. J. (1974). Solving Least Squares Problems. Prentice-Hall, New Jersey.Google Scholar
- NAG, Numerical Algorithms Group, NAG Central Office, 256 Banbury Road, Oxford, OX2 7DE, UK.Google Scholar
- Paige, C. C. (1978). Numerically stable computations for general univariate linear models. Commun. Statist.-Simula. Computa., B7(5), 437--453.Google Scholar
- Paige, C. C. (1979). Fast numerically stable computations for generalized linear least squares problems. SIAM J. Num. Anal., 16, 165--171.Google ScholarCross Ref
- Paige, C. C. (1984a). The general linear model and the generalized singular value decomposition. School of Computer Science, McGill University, Montreal, Quebec, Canada, H3A 2K6. (Submitted to Linear Algebra Applic., Special Issue on Statistics.)Google Scholar
- Paige, C. C. (1984b). Computing the generalized singular value decomposition. School of Computer Science, McGill University, Montreal, Quebec, Canada, H3A 2K6. (Submitted to SIAM J. Sci. Stat. Comput.)Google Scholar
- Paige, C. C. and Saunders, M. A. (1981). Towards a generalized singular value decomposition. SIAM J. Num. Anal., 18, 398--405.Google ScholarCross Ref
- Peters, G. and Wilkinson, J. H. (1970). The least squares problem and pseudo-inverses. Computer J., 309--316.Google Scholar
- Stewart, G. W. (1974). Introduction to Matrix Computations. Academic Press, New York.Google Scholar
- Stewart, G. W. (1977). On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM Rev., 4, 634--662.Google ScholarCross Ref
- Stewart, G. W. (1979). Assessing the effects of variable error in linear regression. Technical Report 818, University of Maryland, College Park, Maryland 20742, USA.Google Scholar
- Stewart, G. W. (1983). A method for computing the generalized singular value decomposition. In "Matrix Pencils". Eds. Kagstrom, B. and Ruhe, A., Springer-Verlag, Berlin.Google Scholar
- Stewart, G. W. (1984). Rank degeneracy. SIAM J. Sci. Stat. Comput., 5, 403--413.Google ScholarCross Ref
- Van Huffel, S., Vandewalle, J. and Staar, J. (1984). The total linear least squares problem: Formulation, algorithm and applications. Katholieke Universiteit Leuven, ESAT Laboratory, 3030 Heverlee, Belgium.Google Scholar
- Van Loan, C. F. (1976). Generalizing the singular value decomposition. SIAM J. Num. Anal., 13, 76--83.Google ScholarCross Ref
- West, D. H. D. (1979). Updating mean and variance estimates: An improved method. Comm. ACM, 22, 532--535. Google ScholarDigital Library
- Wilkinson, J. H. (1963). Rounding Errors in Algebraic Processes. Notes on Applied Science No. 32, HMSO, London and Prentice-Hall, New Jersey. Google ScholarDigital Library
- Wilkinson, J. H. (1965). The Algebraic Eigenvalue Problem. Oxford University Press, London. Google ScholarDigital Library
- Wilkinson, J. H. (1974). The classical error analyses for the solution of linear systems. Bulletin IMA, 10, 175--180.Google Scholar
- Wilkinson, J. H. (1977). Some recent advances in numerical linear algebra. In "The State of the Art in Numerical Analysis". Ed. Jacobs, D.A.H. Academic Press, London.Google Scholar
- Wilkinson, J. H. (1978). Singular-value decomposition - Basic aspects. In "Numerical Software - Needs and Availability". Ed. Jacobs, D.A.H. Academic Press, London.Google Scholar
Index Terms
- The singular value decomposition in multivariate statistics
Index terms have been assigned to the content through auto-classification.
Recommendations
Downdating the Singular Value Decomposition
Let $A$ be a matrix with known singular values and left and/or right singular vectors, and let $A'$ be the matrix obtained by deleting a row from $A$. We present efficient and stable algorithms for computing the singular values and left and/or right ...
Updating the singular value decomposition
The spectral decomposition of a symmetric matrix A with small off-diagonal and distinct diagonal elements can be approximated using a direct scheme of R. Davies and Modi (Linear Algebra Appl. 77 (1986) 61). In this paper a generalization of this method ...
Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
Solutions to rank deficient least squares problems are conveniently expressed in terms of the singular value decomposition (SVD) of the coefficient matrix. When the matrix is nearly rank deficient, a common procedure is to neglect its smallest singular ...
Comments