A rank-revealing method with updating, downdating, and applications

SIAM Journal on Matrix Analysis and Applications

Volumn 26, Issue 4, 2005, Pages 918-946

  Li, T Y ^a   Zeng, Zhonggang ^b  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b NORTHEASTERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Downdating; GCD; Matrix; Nonisolated solution; Null space; Polynomial system; Rank; Rank revealing; Singular value; Updating

Indexed keywords

DOWNDATING; GCD; MATRIX; NONISOLATED SOLUTION; NULL SPACE; POLYNOMIAL SYSTEMS; RANK; SINGULAR VALUE; UPDATING;

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL TECHNIQUES; POLYNOMIALS;

MATRIX ALGEBRA;

EID: 27144448140     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/S0895479803435282     Document Type: Review

References (20)

1. M. W. BERRY, Large scale sparse singular value computation, Internat. J. Supercomput. Appl., 6 (1992), pp. 13-49.
2. C. H. BISCHOF AND G. QUINTANA-ORTI, Algorithm 782: Codes for rank-revealing QR factorizations of dense matrices, ACM Trans. Math. Software, 24 (1998), pp. 254-257.
3. Å. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
4. T. R. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
5. F. DEPRETTERE, SVD and Signal Processing, Algorithms, Applications, and Architectures, North-Holland, Amsterdam, 1988.
6. R. D. FIERRO, P. C. HANSEN, AND P. S. K. HANSEN, UTV tools: MATLAB templates for rank-revealing UTV decompositions, Numer. Algorithms, 20 (1999), pp. 165-194.
7. G. H. GOLUB, V. KLEMA, AND G. W. STEWART, Rank Degeneracy and Least Squares Problems, Tech. rep. TR 456, University of Maryland, Baltimore, MD, 1976.
8. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
9. Y. C. KUO AND T. Y. LI, Determining Whether a Zero of a Polynomial System is Isolated, preprint, 2003.
10. T. Y. Li, Numerical solution of multivariate polynomial systems by homotopy continuation methods, in Acta Numerica, Acta Numer. 6, Cambridge University Press, Cambridge, UK, 199, pp. 399-436.
11. R. MATHIAS AND G. W. STEWART, A block QR algorithm and the singular value decomposition, Linear Algebra Appl., 182 (1993), pp. 91-100.
12. L. MIRSKY, Symmetric gauge functions and unitarily invariant norms, Quart. J. Math. Oxford Ser. (2), 11 (1960), pp. 50-59.
13. M. MOONEN AND B. DE MOOR, SVD and Signal Processing, III, Algorithms, Applications, and Architectures, Elsevier, Amsterdam, 1995.
14. D. RUPPRECHT, An algorithm for computing certified approximate GCD of n univariate polynomials, J. Pure Appl. Algebra, 139 (1999), pp. 255-284.
15. A. J. SOMMESE, J. VERSCHELDE, AND C. W. WAMPLER, Numerical decomposition of the solution sets of polynomial systems into irreducible components, SIAM J. Numer. Anal., 38 (2001), pp. 2022-2046.
16. G. W. STEWART, UTV decompositions, in Numerical Analysis 1993, D. F. Griffith and G. A. Watson, eds., Pitman Res. Notes Math. Ser. 303, Longman, Harlow, UK 1994, pp. 225-236.
17. G. W. STEWART, Matrix Algorithms: Basic Decompositions, SIAM, Philadelphia, 1998.
18. R. VACCARO, SVD and Signal Processing, II, Algorithms, Applications, and Architectures, Elsevier, Amsterdam, 1991.
19. Z. ZENG, Computing multiple roots of inexact polynomials, Math. Comp., 74 (2005), pp. 869-903.
20. Z. ZENG, Algorithm 835: MultRoot - a MATLAB package for computing polynomial roots and multiplicities, ACM Trans. Math. Software, 30 (2004), pp. 218-236.