Additive preconditioning for matrix computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5010 LNCS, Issue , 2008, Pages 372-383

  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

LINEAR EQUATIONS; LINEAR SYSTEMS; SINGULAR VALUE DECOMPOSITION;

ADDITIVE PRECONDITIONING; MATRIX COMPUTATIONS; MULTIPLICATIVE PRECONDITIONERS; WEAK RANDOMIZATION;

COMPUTATIONAL METHODS;

EID: 44649102752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79709-8_37     Document Type: Conference Paper

References (17)

1. Greenbaum, A.: Iterative Methods for Solving Linear Systems. SIAM, Philadelphia (1997)
2. Benzi, M.: Preconditioning Techniques for Large Linear Systems: a Survey. J. of Computational Physics 182, 418-477 (2002)
3. Chen, K.: Matrix Preconditioning Techniques and Applications. Cambridge University Press, Cambridge (2005)
4. Pan, V.Y., Ivolgin, D., Murphy, B., Rosholt, R.E., Tang, Y., Yan, X.: Additive Preconditioning for Matrix Computations, Technical Report TR 2007003, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York (2007), http://www.cs.gc.cuny.edu/tr/files/TR-2007003.pdf
5. Pan, V.Y., Ivolgin, D., Murphy, B., Rosholt, R.E., Tang, Y., Yan, X.: Additive Preconditioning and Aggregation in Matrix Computations. Computers and Math. with Applications 55(8), 1870-1886 (2008)
6. Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore, Maryland (1996)
7. Stewart, G.W.: Matrix Algorithms, Vol I: Basic Decompositions; Vol II: Eigensystems. SIAM, Philadelphia (1998)
8. Demillo, R.A., Lipton, R.J.: A Probabilistic Remark on Algebraic Program Testing. Information Processing Letters 7(4), 193-195 (1978)
9. Zippel, R.E.: Probabilistic Algorithms for Sparse Polynomials. In: EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 216-226. Springer, Berlin (1979)
10. Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of ACM 27(4), 701-717 (1980)
11. Wang, X.: Affect of Small Rank Modification on the Condition Number of a Matrix. Computer and Math (with Applications) 54, 819-825 (2007)
12. Pan, V.Y.: Null Aggregation and Extensions, Technical Report TR2007009, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York (2007), [http://www.cs.gc.cuny.edu/tr.files/TR-2007009.pdf
13. Tao, T., Van Wu,: The Condition Number of a Randomly Perturbed Matrix. In: Proc. Annual Symposium on Theory of Computing (STOC 2007). ACM Press, New York (2007)
14. Pan, V.Y.: Structured Matrices and Polynomials: Unified Superfast Algorithms. Birkhäuser, Boston, and Springer, New York (2001)
15. Dongarra, J.J., Duff, I.S., Sorensen, D.C., van Der Vorst, H.A.: Numerical Linear Algebra, for High-Performance Computers. SIAM, Philadelphia (1998)
16. Vandebril, R., Van Barel, M., Golub, G., Mastronardi, N.: A Bibliography on Semiseparable Matrices. Calcolo 42(3-4), 249-270 (2005)
17. Pan, V.Y.: Matrix Computations with Randomized Expansion and Aggregation (preprint, 2008)