Incremental norm estimation for dense and sparse matrices

BIT Numerical Mathematics

Volumn 42, Issue 2, 2002, Pages 300-322

  Duff, Iain S ^a,b   Vömel, Christof ^a,b  

^a RAL   (United Kingdom)

^b CERFACS   (France)

Author keywords

Approximate singular vectors; Condition number; Incremental estimators; Matrix norm; QR factorization; Rank revealing; Sparse triangular matrices

Indexed keywords

EID: 0042880821     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021946924741     Document Type: Article

References (28)

1. F. L. Alvarado and R. Schreiber, Optimal parallel solution of sparse triangular systems, SIAM J. Sci. Comput., 14:2 (1993), pp. 446-460.
2. R. H. Bartels and G. H. Golub, The simplex method of linear programming using LU decompositions, Comm. ACM, 12 (1969), pp. 266-268.
3. M. Benzi and C. D. Meyer, A direct projection method for sparse linear systems, SIAM J. Sci. Comput., 16 (1995), pp. 1159-1176.
4. M. Benzi and M. Tůma, Orderings for factorized sparse approximate inverse preconditioners, SIAM J. Sci. Comput., 21 (2000), pp. 1851-1868.
5. C. H. Bischof, Incremental condition estimation, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 312-322.
6. C. H. Bischof, D. J. Pierce, and J. G. Lewis, Incremental condition estimation for sparse matrices, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 644-659.
7. R. Bridson and W.-P. Tang, Ordering, anisotropy and factored approximate inverses, SIAM J. Sci. Comput., 21 (1999), pp. 867-882.
8. T. F. Chan, On the existence and computation of LU-factorizations with small pivots, Math. Comp., 42 (1984), pp. 535-547.
9. S. Chandrasekaran and I. Ipsen, On rank-revealing QR factorizations, SIAM J. Matrix Anal. Appl., 15:2 (1994), pp. 592-622.
10. A. K. Cline, C. B. Moler, G. W. Stewart, and J. H. Wilkinson, An estimate for the condition number of a matrix, SIAM J. Numer. Anal., 16 (1979), pp. 368-375.
11. G. Cybenko, Fast Toeplitz orthogonalization using inner products, SIAM J. Sci. Stat. Comput., 8 (1987), pp. 734-740.
12. J. J. Du Croz and N. J. Higham, Stability of methods for matrix inversion, IMA J. Numer. Anal., 12 (1992), pp. 1-19.
13. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, London, 1986.
14. I. S. Duff, R. G. Grimes, and J. G. Lewis, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
15. W. R. Ferng and D. Pierce, Incremental Lanczos condition estimation (or the robustification of ICE), Technical Report AMS-TR-184, Boeing Computer Services, 1992.
16. J. J. H. Forrest and J. A. Tomlin, Updating triangular factors of the basis to maintain sparsity in the product form simplex method, Math. Prog., 2:3 (1972), pp. 263-278.
17. J. R. Gilbert, Predicting structure in sparse matrix computations, SIAM J. Matrix Anal. Appl., 15:1 (1994), pp. 62-79.
18. G. H. Golub and C. van Loan, Matrix Computations, 3rd. ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
19. N. J. Higham, A survey of condition number estimation for triangular matrices, SIAM Review, 29 (1987), pp. 575-596.
20. N. J. Higham, The test matrix toolbox for MATLAB (Version 3.0), Numerical Analysis Report No. 276, Manchester Centre for Computational Mathematics, Manchester, England, 1995.
21. N. J. Higham and A. Pothen, Stability of the partitioned inverse method for parallel solution of sparse triangular systems, SIAM J. Sci. Comput., 15:1 (1994), pp. 139-148.
22. A. S. Householder, The Theory of Matrices in Numerical Analysis, Blaisdell, New York, 1964.
23. W. Kahan, Numerical linear algebra, Canad. Math. Bull., 9 (1966), pp. 757-801.
24. C. D. Meyer and D. Pierce, Steps towards an iterative rank-revealing method, Technical Report ISSTECH-95-013, Boeing Information and Support Services, 1995.
25. C.-T. Pan and R. J. Plemmons, Least squares modifications with inverse factorizations: Parallel implementations, J. Comp. Appl. Math., 27 (1989), pp. 109-127.
26. D. J. Pierce and J. G. Lewis, Sparse multifrontal rank revealing QR factorization, SIAM J. Matrix Anal. Appl., 18:1 (1997), pp. 159-180.
27. G. W. Stewart, The efficient generation of random orthogonal matrices with an application to condition estimators, SIAM J. Numer. Anal., 17 (1980), pp. 403-404.
28. G. W. Stewart, Incremental condition calculation and column selection, Technical Report TR-90-87, Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, 1990.