Randomized Preprocessing of Homogeneous Linear Systems of Equations

Linear Algebra and Its Applications

Volumn 432, Issue 12, 2010, Pages 3272-3318

  Pan, Victor Y ^a,b   Qian, Guoliang ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Conditioning; Linear systems of equations; Randomized preprocessing

Indexed keywords

CONDITION NUMBERS; CPU TIME; DISPLACEMENT RANKS; FREE SOLUTIONS; HOMOGENEOUS LINEAR SYSTEMS; LINEAR SYSTEMS OF EQUATIONS; MATRIX; MATRIX INVERSIONS; MATRIX PRODUCTS; MOORE-PENROSE; NEWTON'S ITERATION; NONSINGULAR LINEAR SYSTEMS; NUMERICAL STABILITIES; ORTHOGONALIZATION; POLYNOMIAL SYSTEMS; ROOTFINDING; SECULAR EQUATIONS; SHERMAN-MORRISON-WOODBURY FORMULAS; SOLUTION TIME; STRUCTURED MATRIXES; TOEPLITZ;

CONVERGENCE OF NUMERICAL METHODS; LINEAR SYSTEMS; NUMBER THEORY; POLYNOMIAL APPROXIMATION; TIME VARYING CONTROL SYSTEMS;

MATRIX ALGEBRA;

EID: 77950369121     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2010.01.023     Document Type: Article

References (91)

1. Björck Å. Stability analysis of the method of seminormal equations. Linear Algebra Appl. 88/89 (1987) 31-48
2. Björck Å. Numerics of Gram-Schmidt orthogonalization. Linear Algebra Appl. 197/198 (1994) 297-316
3. Björck Å. Numerical Methods for Least Squares Problems (1996), SIAM, Philadelphia
4. Bitmead R.R., and Anderson B.D.O. Asymptotically fast solution of Toeplitz and related systems of linear equations. Linear Algebra Appl. 34 (1980) 103-116
5. T. Bella, Y. Eidelman, I. Gohberg, V. Olshevsky, Computations with quasiseparable polynomials and matrices, in: D.A. Bini, V.Y. Pan, J. Verschelde (Eds.), Theoretical Computer Science, Special Issue on Symbolic-Numerical Algorithms, vol. 409 (2), 2008, pp. 158-179.
6. Bini D.A., and Fiorentino G. Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numer. Algorithms 23 (2000) 127-173
7. Bini D.A., Gemignani L., and Pan V.Y. Inverse power and Durand/Kerner iteration for univariate polynomial root-finding. Comput. Math. (with Appl.) 47 2/3 (2004) 447-459. http://www.cs.gc.cuny.edu/tr/techreport.php?id=352 Also Technical Report TR 2002 020, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York, 2002.
8. Bini D.A., Gemignani L., and Pan V.Y. Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equation. Numer. Math. 3 (2005) 373-408 (Also Technical Report 1470, Department of Math., University of Pisa, Pisa, Italy, July 2003)
9. Bini D.A., and Meini B. Approximate displacement rank and applications. In: Olshevsky V. (Ed). AMS Conference Structured Matrices in Operator Theory, Control, Signal and Image Processing, Boulder 1999 (2001), American Math. Society, Providence, RI 215-232
10. Chandrasekaran S., Gu M., Sun X., Xia J., and Zhu J. A superfast algorithm for Toeplitz systems of linear equations. SIAM. J. Matrix Anal. Appl. 29 4 (2007) 1247-1266
11. Cline R.E., Plemmons R.J., and Worm G. Generalized inverses of certain Toeplitz matrices. Linear Algebra Appl. 8 (1974) 25-33
12. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9 3 (1990) 251-280
13. Dixon J.D. Estimating extremal eigenvalues and condition numbers of matrices. SIAM J. Numer. Anal. 20 4 (1983) 812-814
14. Demmel J. The probability that a numerical analysis problem is difficult. Math. Comp. 50 (1988) 449-480
15. Dongarra J.J., Duff I.S., Sorensen D.C., and van Der Vorst H.A. Numerical Linear Algebra for High-Performance Computers (1998), SIAM, Philadelphia
16. Duff I.S., Erisman A.M., and Reid J.K. Direct Methods for Sparse Matrices (1986), Clarendon Press, Oxford, England
17. Demmel J., and Hida Y. Accurate and efficient floating point summation. SIAM J. Sci. Comput. 25 (2003) 1214-1248
18. Demillo R.A., and Lipton R.J. A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7 4 (1978) 193-195
19. Davidson K.R., and Szarek S.J. Local operator theory, random matrices, and Banach spaces. In: Johnson W.B., and Lindenstrauss J. (Eds). Handbook on the Geometry of Banach Spaces (2001), North Holland, Amsterdam 317-368
20. Edelman A. Eigenvalues and condition numbers of random matrices. SIAM J. Matrix Anal. Appl. 9 4 (1988) 543-560 (Ph.D. Thesis (106 pp.), Math Dept., MIT, 1989)
21. Y. Eidelman, I. Gohberg, On a new class of structured matrices, Integral Equations and Operator Theory, Birkhäuser, Basel, 1999.
22. Emiris I.Z., and Pan V.Y. Symbolic and numerical methods for exploiting structure in constructing resultant matrices. J. Symbolic Comput. 33 (2002) 393-413
23. Golub G.H. Some modified matrix eigenvalue problems. SIAM Rev. 15 (1973) 318-334
24. Gu M. Stable and efficient algorithms for structured systems of linear equations. SIAM J. Matrix Anal. Appl. 19 (1998) 279-306
25. Gautschi W., and Inglese G. Lower bounds for the condition number of Vandermonde matrices. Numer. Math. 52 (1988) 241-250
26. Gohberg I., Kailath T., and Olshevsky V. Fast Gaussian elimination with partial pivoting for matrices with displacement structure. Math. Comp. 64 (1995) 1557-1576
27. Golub G.H., and Van Loan C.F. Matrix Computations. third ed. (1996), The Johns Hopkins University Press, Baltimore, Maryland
28. Heinig G. Inversion of generalized Cauchy matrices and other classes of structured matrices. Linear Algebra for Signal Processing, IMA Vol. Math. Appl. vol. 69 (1995), Springer, New York pp. 63-81
29. Higham N.J. Accuracy and Stability in Numerical Analysis. second ed. (2002), SIAM, Philadelphia
30. Kaporin I. The aggregation and cancellation techniques as a practical tool for faster matrix multiplication. Theoret. Comput. Sci. 315 2-3 (2004) 469-510
31. Kravanja P., and Van Barel M. Algorithms for solving rational interpolation problems related to fast and superfast solvers for Toeplitz systems (1999), SPIE pp. 359-370
32. ∼xiaoye/XBLAS/>
33. Lawson C.L., and Hanson R.J. Solving Least Squares Problems (1974), Prentice-Hall, Englewood Cliffs, New Jersey Reissued with a survey of recent developments by SIAM, Philadelphia, 1995
34. Laderman J., Pan V.Y., and Sha H.X. On practical algorithms for accelerated matrix multiplication. Linear Algebra Appl. 162-164 (1992) 557-588
35. Lipton R.J., Rose D., and Tarjan R.E. Generalized nested dissection. SIAM J. Numer. Anal. 16 2 (1979) 346-358
36. Morf M. Doubling algorithms for Toeplitz and related equations. Proceedings of IEEE International Conference on ASSP (1980), IEEE Press, Piscataway, New Jersey 954-959
37. Melman A. A unifying convergence analysis of second-order methods for secular equations. Math. Comp. 66 (1997) 333-344
38. Miranker W.L., and Pan V.Y. Methods of aggregations. Linear Algebra Appl. 29 (1980) 231-257
39. Mourrain B., and Pan V.Y. Multivariate polynomials, duality and structured matrices. J. Complexity 16 1 (2000) 110-180 Proceedings Version in STOC'98
40. Olver F.W.J. Error analysis of complex arithmetic. In: Reidel D. (Ed). Computational Aspect of Complex Analysis. NATO Advanced Study Institute Series C vol. 102 (1983), Dordrecht, Holland 279-292
41. Ogita T., Rump S.M., and Oishi S. Accurate sum and dot product. SIAM J. Sci. Comput. 26 6 (2005) 1955-1988
42. Olshevsky V., Oseledets I.V., and Tyrtyshnikov E.E. Tensor properties of multilevel Toeplitz and related matrices. Linear Algebra Appl. 412 (2006) 1-21
43. Olshevsky V., Oseledets I.V., and Tyrtyshnikov E.E. Superfast inversion of two-level Toeplitz matrices using Newton iteration and tensor-displacement structure. Oper. Theory Adv. Appl. 179 (2008) 229-240
44. Oceledetz I.V., and Tyrtyshnikov E.E. Approximate inversion of matrices in the process of solving a hypersingular integral equation. Comput. Math. Math. Phys. 45 2 (2005) 302-313 Translated from JVM i MF 45 (2) (2005) 315-326
45. I. Oseledets, E.E. Tyrtyshnikov, Breaking the curse of dimensionality, or how to use SVD in many dimensions, SIAM J. Sci. Comput., submitted by publication. Also ICM HKBU Research Report 09-03, February 2009. .
46. Pan V.Y. On schemes for the evaluation of products and inverses of matrices. Uspekhi Mat. Nauk 27 5 (167) (1972) 249-250 (in Russian)
47. Pan V.Y. How can we speed up matrix multiplication?. SIAM Rev. 26 3 (1984) 393-415
48. Pan V.Y. On computations with dense structured matrices. Math. Comput. 55 191 (1990) 179-190
49. Pan V.Y. Parallel solution of Toeplitz-like linear systems. J. Complexity 8 (1992) 1-21
50. Pan V.Y. Concurrent iterative algorithm for Toeplitz-like linear systems. IEEE Trans. Parallel Distributed Syst. 4 5 (1993) 592-600
51. Pan V.Y. Decreasing the displacement rank of a matrix. SIAM J. Matrix Anal. Appl. 14 1 (1993) 118-121
52. Pan V.Y. Structured Matrices and Polynomials: Unified Superfast Algorithms (2001), Birkhäuser/Springer, Boston/New York
53. Pan V.Y. Newton's iteration for matrix inversion, advances and extensions. In: Olshevsky V., and Tyrtyshnikov E. (Eds). Matrix Methods: Theory, Algorithms and Applications (2008), World Scientific Publishing 364-381 ISBN: (978-981-283-601-4)-(981-283-601-2), Dedicated to the Memory of Gene Golub
54. F. Poloni, A note on the O (n)-storage implementation of the GKO algorithm, subjects: numerical analysis (math.NA), 2009. Available from: .
55. Pan V.Y., Branham S., Rosholt R., and Zheng A. In: Kailath T., and Sayed A.H. (Eds). Newton's Iteration for Structured Matrices and Linear Systems of Equations. SIAM Volume on Fast Reliable Algorithms for Matrices with Structure (1999), SIAM Publications, Philadelphia 189-210
56. Pan V.Y., Grady D., Murphy B., Qian G., Rosholt R.E., and Ruslanov A. Schur aggregation for linear systems and determinants. In: Bini D.A., Pan V.Y., and Verschelde J. (Eds). Theoret. Comput. Sci. 409 2 (2008) 255-268 Special Issue on Symbolic-Numerical Algorithms
57. Pan V.Y., Ivolgin D., Murphy B., Rosholt R.E., Tang Y., Wang X., and Yan X. Root-finding with eigen-solving. In: Wang D., and Zhi L.-H. (Eds). Symbolic-Numeric Computation (2007), Birkhäuser, Basel/Boston 219-245
58. Pan V.Y., Ivolgin D., Murphy B., Rosholt R.E., Tang Y., and Yan X. Additive preconditioning for matrix computations. Linear Algebra Appl. 432 (2010) 1070-1089
59. V.Y. Pan, D. Ivolgin, B. Murphy, R.E. Rosholt, Y. Tang, X. Yan, Additive preconditioning for matrix computations, in: Proc. of the Third International Computer Science Symposium in Russia (CSR 2008), Lecture Notes in Computer Science (LNCS), vol. 5010, 2008, pp. 372-383.
60. Pan V.Y., Murphy B., Qian G., and Rosholt R.E. Error-free computations via floating-point operations. Comput. Math. (with Appl.) 57 (2009) 560-564. http://www.cs.gc.cuny.edu/tr/techreport.php?id=352 Also Tech. Report (with computer codes) TR 2007010, Ph.D. Program in Computer Science, Graduate Center, the City University of New York, 2007.
61. V.Y. Pan, G. Qian, On solving linear system with randomized augmentation, Tech. Report TR 2009009, Ph.D. Program in Computer Science, Graduate Center, the City University of New York, 2009. .
62. V.Y. Pan, G. Qian, A. Zheng, Randomized preprocessing versus pivoting, Tech. Report TR 2009010, Ph.D. Program in Computer Science, Graduate Center, the City University of New York, 2009. .
63. V.Y. Pan, G. Qian, A. Zheng, Z. Chen, Matrix computations and root-finding with randomized preprocessing, preprint, 2009.
64. Pan V.Y., and Reif J. Fast and efficient parallel solution of sparse linear systems. SIAM J. Comput. 22 6 (1993) 1227-1250
65. Pan V.Y., and Rami Y. Newton's iteration for the inversion of structured matrices. In: Bini D., Tyrtyshnikov E., and Yalamov P. (Eds). Structured Matrices: Recent Developments in Theory and Computation (2001), Nova Science Publishers, USA 79-90
66. Pan V.Y., Rami Y., and Wang X. Structured matrices and Newton's iteration: unified approach. Linear Algebra Appl. 343-344 (2002) 233-265
67. Pan V.Y., and Schreiber R. An improved Newton iteration for the generalized inverse of a matrix, with applications. SIAM J. Sci. Stat. Comput. 12 5 (1991) 1109-1131
68. Pan V.Y., Van Barel M., Wang X., and Codevico G. Iterative inversion of structured matrices. Theoret. Comput. Sci. 315 2-3 (2004) 581-592 Special Issue on Algebraic and Numerical Computing
69. Pan V.Y., and Wang X. Degeneration of integer matrices modulo an integer. Linear Algebra Appl. 429 (2008) 2113-2130
70. Pan V.Y., and Yan X. Additive preconditioning, eigenspaces, and the inverse iteration. Linear Algebra Appl. 430 (2009) 186-203
71. V.Y. Pan, A. Zheng, Root-finding with eigen-solving and preprocessing, preprint.
72. Rodriguez G. Fast solution of Toeplitz- and Cauchy-like least squares problems. SIAM J. Matrix Anal. Appl. 28 3 (2006) 724-748
73. Rump S.M., Ogita T., and Oishi S. Accurate floating-point summation, Part I: faithful rounding. SIAM J. Sci. Comput. 31 1 (2008) 169-224
74. Rump S.M., Ogita T., and Oishi S. Accurate floating-point summation, Part II: sign, K-fold faithful and rounding to nearest. SIAM J. Sci. Comput. 31 2 (2008) 1269-1302
75. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27 4 (1980) 701-717
76. Stewart G.W. Matrix Algorithms. Basic Decompositions vol. I (1998), SIAM, Philadelphia
77. Stewart G.W. Matrix Algorithms. Eigensystems vol. II (1998), SIAM, Philadelphia
78. Sankar A., Spielman D., and Teng S.-H. Smoothed analysis of the condition numbers and growth factors of matrices. SIAM J. Matrix Anal. 28 2 (2006) 446-476
79. Spielman D., and Teng S.-H. Smoothed analysis of algorithms. Proc. of the International Congress of Mathematicians (Beijing 2002) vol. I (2002), Higher ED Press, Beijing 597-606
80. Tyrtyshnikov E.E. How bad are Hankel matrices?. Numer. Math. 67 2 (1994) 261-269
81. ∼marc/software/index.html>.
82. Van Barel M., Heinig G., and Kravanja P. A stabilized superfast solver for nonsymmetric Toeplitz systems. SIAM J. Matrix Anal. Appl. 23 2 (2001) 494-510
83. Van Barel M., and Kravanja P. A stabilized superfast solver for indefinite Hankel systems. Linear Algebra Appl. 284 1-3 (1998) 335-355
84. R. Vandebril, Semiseparable matrices and the symmetric eigenvalue problem, Ph.D. Thesis, Computer Science Dept., Katholieke Universiteit Leuven, Leuven, Belgium, 2004.
85. Vandebril R., Van Barel M., Golub G., and Mastronardi N. A bibliography on semiseparable matrices. Calcolo 42 3-4 (2005) 249-270
86. Vandebril R., Van Barel M., and Mastronardi N. Matrix Computations and Semiseparable Matrices: Linear Systems vol. 1 (2007), The Johns Hopkins University Press, Baltimore, Maryland
87. Vandebril R., Van Barel M., and Mastronardi N. Matrix Computations and Semiseparable Matrices: Eigenvalue and Singular Value Methods vol. 2 (2008), The Johns Hopkins University Press, Baltimore, Maryland
88. Wilkinson J.H. The Algebraic Eigenvalue Problem (1965), Clarendon Press, Oxford, England
89. Wschebor M. Smoothed analysis of κ (a). J. Complexity 20 (2004) 97-107
90. Wang X. Affect of small rank modification on the condition number of a matrix. Comput. Math. (with Appl.) 54 (2007) 819-825
91. Zippel R.E. Probabilistic algorithms for sparse polynomials. Proceedings of EUROSAM'79. Lecture Notes in Computer Science vol. 72 (1979), Springer, Berlin 216-226