Schur aggregation for linear systems and determinants

Theoretical Computer Science

Volumn 409, Issue 2, 2008, Pages 255-268

  Pan, V Y ^a   Grady, D ^c   Murphy, B ^a   Qian, G ^b   Rosholt, R E ^a   Ruslanov, A D ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c STATE UNIVERSITY OF NEW YORK AT FREDONIA   (United States)

Author keywords

Additive preconditioning; Determinants; Iterative refinement; Linear systems of equations; Sherman Morrison Woodbury formula

Indexed keywords

AGGLOMERATION; LINEAR SYSTEMS; TWO PHASE FLOW;

DETERMINANTS; EXPERIMENTAL STUDIES; HIGH ACCURACIES; ITERATIVE REFINEMENT; ITERATIVE REFINEMENTS; LINEAR SYSTEMS OF EQUATIONS; PRECONDITIONING TECHNIQUES; SHERMAN-MORRISON-WOODBURY FORMULA; SYSTEMS OF EQUATIONS;

LINEAR EQUATIONS;

EID: 55749102088     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.09.005     Document Type: Article

References (52)

1. Axelsson O. Iterative Solution Methods (1994), Cambridge University Press, Cambridge, England
2. 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
3. Benzi M. Preconditioning techniques for large linear systems: A survey. Journal of Computational Physics 182 (2002) 418-477
4. Brönnimann H., Emiris I.Z., Pan V.Y., and Pion S. Sign Determination in Residue Number Systems. Theoretical Computer Science 210 1 (1999) 173-197
5. Bini D., and Pan V.Y. Polynomial and Matrix Computations, Volume 1: Fundamental Algorithms (1994), Birkhäuser, Boston
6. Chen K. Matrix Preconditioning Techniques and Applications (2005), Cambridge University Press, Cambridge, England
7. Dekker T.J. A floating-point technique for extending the available precision. Numerische Mathematik 18 (1971) 224-242
8. Dixon J.D. Exact solution of linear equations using p-adic expansions. Numerische Mathematik 40 (1982) 137-141
9. Demmel J.W. Applied Numerical Linear Algebra (1997), SIAM, Philadelphia
10. Demmel J., and Hida Y. Accurate and efficient floating point summation. SIAM Journal on Scientific Computing 25 (2003) 1214-1248
11. Demmel J., and Hida Y. Fast and accurate floating point summation with application to computational geometry. Numerical Algorithms 37 (2004) 101-112
12. Demillo R.A., and Lipton R.J. A probabilistic remark on algebraic program testing. Information Processing Letters 7 4 (1978) 193-195
13. Eberly W., Giesbrecht M., and Villard G. On computing the determinant and Smith form of an integer matrix. Proc. 41st Annual Symp. on Foundations of Computer Science. FOCS'2000 (2000), IEEE Computer Society Press, Los Alamitos, CA 675-685
14. Emiris I.Z., and Pan V.Y. Symbolic and numerical methods for exploiting structure in constructing resultant matrices. Journal of Symbolic Computation 33 (2002) 393-413
15. Emiris I.Z., and Pan V.Y. Improved algorithms for computing determinants and resultants. Journal of Complexity 21 1 (2005) 43-71
16. Golub G.H. Some modified matrix eigenvalue problems. SIAM Review 15 (1973) 318-334
17. Greenbaum A. Iterative Methods for Solving Linear Systems (1997), SIAM, Philadelphia
18. Golub G.H., and Van Loan C.F. Matrix Computations. 3rd ed. (1996), The Johns Hopkins University Press, Baltimore, MD
19. Higham N.J. Accuracy and Stability in Numerical Analysis. second ed. (2002), SIAM, Philadelphia
20. Householder A.S. The Theory of Matrices in Numerical Analysis (1964), Dover, New York
21. Li X., Demmel J., Bailey D., Henry G., Hida Y., Iskandar J., Kahan W., Kang S., Kapur A., Martin M., Thompson B., Tung T., and Yoo D. Design, implementation and testing of extended and mixed precision BLAS. ACM Transactions on Mathematics Software 28 (2002) 152-205
22. Moenck R.T., and Carter J.H. Approximate algorithms to derive exact solutions to systems of linear equations. Proceedings of EUROSAM. Lecture Notes in Computer Science vol. 72 (1979), Springer, Berlin 63-73
23. Miranker W.L., and Pan V.Y. Methods of aggregations. Linear Algebra and Its Applications 29 (1980) 231-257
24. Mourrain B., and Pan V.Y. Multivariate polynomials, duality and structured matrices. Journal of Complexity 16 1 (2000) 110-180
25. Ogita T., Rump S.M., and Oishi S. Accurate sum and dot product. SIAM Journal on Scientific Computing 26 6 (2005) 1955-1988
26. Pan V.Y. How can we speed up matrix multiplication?. SIAM Review 26 3 (1984) 393-415
27. Pan V.Y. On computations with dense structured matrices. Mathematics of Computation 55 191 (1990) 179-190
28. Pan V.Y. Complexity of computations with matrices and polynomials. SIAM Review 34 2 (1992) 225-262
29. Pan V.Y. Solving a polynomial equation: Some history and recent progress. SIAM Review 39 2 (1997) 187-220
30. Pan V.Y. Structured Matrices and Polynomials: Unified Superfast Algorithms (2001), Birkhäuser/Springer, Boston/New York
31. Pan V.Y. Univariate polynomials: Nearly optimal algorithms for factorization and rootfinding. Journal of Symbolic Computations 33 5 (2002) 701-733
32. Pan V.Y. On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix. Zapiski Nauchnykh Seminarov POMI 316 (2004) 163-187. http://comet.lehman.cuny.edu/vpan/ (in English) St. Petersburg, Russia. Also available at: http://comet.lehman.cuny.edu/vpan/
33. 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. Computers and Mathematics (with Applications) 55 8 (2008) 1870-1886
34. 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. (Eds). Symbolic-Numerical Computation (2007), Birkhäuser, Basel, Boston 219-245
35. V.Y. Pan, D. Ivolgin, B. Murphy, R.E. Rosholt, Y. Tang, X. Yan, Additive preconditioning for matrix computations, Tech. Report TR 2008004, Ph.D. Program in Computer Science, Graduate Center, the City University of New York, 2008. Available at: http://www.cs.gc.cuny.edu/tr/techreport.php?id=352
36. Pan V.Y., Ivolgin D., Murphy B., Rosholt R.E., Tang Y., and Yan X. Additive preconditioning for matrix computations. Proc. of the Third International Computer Science Symposium in Russia. CSR 2008. Lecture Notes in Computer Science (LNCS) vol. 5010 (2008) 372-383
37. Pan V.Y., Kunin M., Rosholt R., and Kodal H. Homotopic residual correction processes. Mathematics of Computation 75 (2006) 345-368
38. V.Y. Pan, B. Murphy, G. Qian, R.E. Rosholt, Error-free computations via floating-point operations, Computers and Mathematics (with Applications) (in press) and Technical Report TR 2007010, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York, 2007. Available at: http://www.cs.gc.cuny.edu/tr/techreport.php?id=352
39. Pan V.Y., Murphy B., Rosholt R.E., and Tabanjeh M. The Schur aggregation for solving linear systems of equations. In: Verschelde J., and Watt S. (Eds). Proceedings of the Third International Workshop on Symbolic-Numeric Computation. SNC 2007, July 2007, London, Ontario, Canada (2007), ACM Press, New York 142-151
40. V.Y. Pan, G. Qian, Solving homogeneous linear systems with weakly random additive preprocessing, Technical Report TR 2008009, CUNY Ph.D. Program in Computer Science, Graduate Center, The City University of New York, 2008. Available at: http://www.cs.gc.cuny.edu/tr/techreport.php?id=352
41. Pan V.Y., and Schreiber R. An improved newton iteration for the generalized inverse of a matrix, with applications. SIAM Journal on Scientific and Statistical Computing 12 5 (1991) 1109-1131
42. V.Y. Pan, X. Yan, Additive preconditioning, eigenspaces, and the inverse iteration, Linear Algebra and its Applications (in press). Also Technical Report TR 2008006, CUNY Ph.D. Program in Computer Science, Graduate Center, The City University of New York, 2008. Available at: http://www.cs.gc.cuny.edu/tr/techreport.php?id=352
43. Pan V.Y., and Yan X. Null space and eigenspace computations with additive preprocessing. In: Verschelde J., and Watt S. (Eds). Proceedings of the Third International Workshop on Symbolic-Numeric Computation. SNC 2007, July 2007, London, Ontario, Canada (2007), ACM Press, New York 152-160
44. Pan V.Y., and Yu Y. Certification of numerical computation of the sign of the determinant of a matrix. Algorithmica 30 (2001) 708-724
45. S.M. Rump, T. Ogita, S. Oishi, Accurate floating-point summation, Tech. Report 05.12, Faculty for Information and Communication Sciences, Hamburg University of Technology (41 pages), 2005, SIAM Journal on Scientific Computing (in print)
46. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. Journal of ACM 27 4 (1980) 701-717
47. Shevchuk J. Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete and Computational Geometry 18 (1997) 305-363. http://www.cs.cmu.edu/~quake/robust.html Available at: www.cs.cmu.edu/~quake/robust.html
48. Stewart G.W. Matrix Algorithms, Vol I: Basic Decompositions (1998), SIAM, Philadelphia
49. Stewart G.W. Matrix Algorithms, Vol II: Eigensystems. first ed. (1998), SIAM, Philadelphia second ed., 2001
50. Storjohann A. The shifted number system for fast linear algebra on integer matrices. Journal of Complexity 21 4 (2005) 609-650
51. Wang X. Affect of small rank modification on the condition number of a matrix. Computer and Mathematics (with Applications) 54 (2007) 819-825
52. Zippel R.E. Probabilistic algorithms for sparse polynomials. Proceedings of EUROSAM'79. Lecture Notes in Computer Science vol. 72 (1979), Springer, Berlin 216-226