Additive preconditioning for matrix computations

Linear Algebra and Its Applications

Volumn 432, Issue 4, 2010, Pages 1070-1089

  Pan, Victor Y ^a   Ivolgin, Dmitriy ^b   Murphy, Brian ^a   Rosholt, Rhys Eric ^a   Tang, Yuqing ^b   Yan, Xiaodong ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Additive preconditioning; Matrix computations; Weak randomization

Indexed keywords

CONDITION NUMBERS; INPUT MATRICES; LARGE CLASS; MATRIX; MATRIX COMPUTATION; MATRIX COMPUTATIONS; PRECONDITIONERS; RANDOM PARAMETERS; SOLUTION OF LINEAR SYSTEMS;

LINEAR SYSTEMS; NUMBER THEORY;

MATRIX ALGEBRA;

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

References (28)

1. Axelsson O. Iterative Solution Methiods (1994), Cambridge University Press, Cambridge, England
2. Greenbaum A. Iterative Methods for Solving Linear Systems (1997), SIAM, Philadelphia
3. Benzi M. Preconditioning Techniques for Large Linear Systems: a Survey. J. Comput. Phys. 182 (2002) 418-477
4. Chen K. Matrix Preconditioning Techniques and Applications (2005), Cambridge University Press, Cambridge, England
5. Demmel J. The probability that a numerical analysis problem is difficult. Math. Comput. 50 (1988) 449-480
6. A. Edelman, Eigenvalues and condition numbers of random matrices, Ph.D. Thesis, Math Dept., MIT, 1989 (106 pages) and SIAM J. Matrix Anal. Appl. 9 (4) (1988) 543-560.
7. 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
8. V.Y. Pan, G. Qian, A. Zheng, On randomized preprocessing versus pivoting, Tech. Report TR 2009010, Ph.D. Program in Computer Science, Graduate Center, The City University of New York, 2009. Available from: .
9. Pan V.Y., Ivolgin D., Murphy B., Rosholt R.E., Taj-Eddin I., Tang Y., and Yan X. Additive preconditioning and aggregation in matrix computations. Comput. Math. Appl. 55 8 (2008) 1870-1886
10. V.Y. Pan, D. Grady, B. Murphy, G. Qian, R.E. Rosholt, A. Ruslanov, Schur aggregation for linear systems and determinants, in: D.A. Bini, V.Y. Pan, J. Verschelde (Eds.), Theoretical Computer Science, Special Issue on Symbolic-Numerical Algorithms, 409 (2008) 255-268.
11. Pan V.Y., and Yan X. Additive preconditioning, eigenspaces, and the inverse iteration. Linear Algebra Appl. 430 (2009) 186-203
12. V.Y. Pan, G. Qian, Randomized preprocessing of homogeneous linear systems, Linear Algebra Appl., submitted for publication.
13. 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. Available from: .
14. V.Y. Pan, G. Qian, A. Zheng, Root-finding with eigen-solving and preprocessing, preprint.
15. 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.
16. Wang X. Affect of small rank modification on the condition number of a matrix. Comput. Math. (with Applications) 54 (2007) 819-825
17. Golub G.H., and Van Loan C.F. Matrix Computations. third ed. (1996), The Johns Hopkins University Press, Baltimore, Maryland
18. Stewart G.W. Matrix Algorithms, Vol. I: Basic Decompositions (1998), SIAM, Philadelphia
19. Stewart G.W. Matrix Algorithms, Vol. II: Eigensystems (1998), SIAM, Philadelphia
20. Higham N.J. Accuracy and Stability in Numerical Analysis. second ed. (2002), SIAM, Philadelphia
21. Demmel J.W. Applied Numerical Linear Algebra (1997), SIAM, Philadelphia
22. Barrett R., Berry M.W., Chan T.F., Demmel J., Donato J., Dongarra J., Eijkhout V., Pozo R., Romine C., and van Der Vorst H. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods (1993), SIAM, Philadelphia
23. In: Bai Z., Demmel J., Dongarra J., Ruhe A., and van der Vorst H. (Eds). Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide (2000), SIAM, Philadelphia
24. Demillo R.A., and Lipton R.J. A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7 4 (1978) 193-195
25. R.E. Zippel, Probabilistic algorithms for sparse polynomials, in: Proceedings of EUROSAM'79, Lecture Notes in Computer Science, vol. 72, Springer, Berlin, 1979, pp. 216-226.
26. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27 4 (1980) 701-717
27. Dixon J.D. Estimating extremal eigenvalues and condition numbers of matrices. SIAM J. Numer. Anal. 20 4 (1983) 812-814
28. Pan V.Y. Structured Matrices and Polynomials: Unified Superfast Algorithms (2001), Birkhäuser/Springer, Boston/New York