Efficient matrix preconditioners for black box linear algebra

Linear Algebra and Its Applications

Volumn 343, Issue , 2002, Pages 119-146

  Chen, Li ^a   Eberly, Wayne ^b   Kaltofen, Erich ^c   David Saunders, B ^a   Turner, William J ^c   Villard, Gilles ^d  

^a Institute University of Delaware Newark   (United States)

^b UNIVERSITY OF CALGARY   (Canada)

^c NORTH CAROLINA STATE UNIVERSITY   (United States)

^d UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; LINEAR ALGEBRA; NUMBER THEORY; PROBLEM SOLVING;

BLACK BOXES; CONDITION NUMBERS; DISPLACEMENT RANKS; FINITE FIELDS; LINEAR ALGEBRA PROBLEMS; MATRIX PROBLEM; PRECONDITIONERS; TOEPLITZ;

MATRIX ALGEBRA;

EID: 31244437321     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(01)00472-4     Document Type: Article

References (26)

1. J. Blömer, R. Karp, and E. Welzl The rank of sparse random matrices over finite fields Random Struct. Algorithms 10 1997 407 419
2. D. Coppersmith Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm Math. Comp. 62 205 1994 333 350
3. R.A. DeMillo, and R.J. Lipton A probabilistic remark on algebraic program testing Inform. Process. Lett. 7 4 1978 193 195
4. W. Eberly Processor-efficient parallel matrix inversion over abstract fields: two extensions M. Hitz, E. Kaltofen, Proc. Second International Symposium on Parallel Symbolic Computation PASCO '97, New York 1997 ACM Press New York 38 45
5. W. Eberly, Avoidance of look-ahead in Lanczos by random projections, 2000 (in preparation)
6. W. Eberly, and E. Kaltofen On randomized Lanczos algorithms W Küchline, ISSAC 97 Proc. 1997, International Symposium on Symbolic and Algebraic Computation, New York 1997 ACM Press New York 176 183
7. M. Giesbrecht Fast computation of the Smith normal form of a sparse integer matrix in: Algorithms in Number Theory Symposium, Lecture Notes in Computer Science, vol. 1122 1996 173 186
8. M. Giesbrecht Efficient parallel solution of sparse systems of linear diophantine equations in: Second International Symposium on Parallel Symbolic Computation (PASCO'97), Maui, HI, USA July 1997 1 10
9. M. Giesbrecht, A. Lobo, and B.D. Saunders Certifying inconsistency of sparse linear systems O. Gloor, ISSAC 98 Proc. 1998, International Symposium on Symbolic and Algebraic Computation, New York 1998 ACM Press New York 113 119
10. E. Kaltofen Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems Math. Comp. 64 210 1995 777 806
11. E. Kaltofen Challenges of symbolic computation my favorite open problems J. Symbolic Comput. 29 6 2000 891 919 with an additional open problem by R.M. Corless and D.J. Jeffrey
12. E. Kaltofen, and A. Lobo On rank properties of Toeplitz matrices over finite fields Y.N. Lakshman, ISSAC 96 Proc. 1996, International Symposium on Symbolic and Algebraic Computation, New York 1996 ACM Press New York 241 249
13. E. Kaltofen, and V. Pan Processor-efficient parallel solution of linear systems II: the positive characteristic and singular cases in: Proc. 33rd Annual Symposium on Foundations of Computer Science, Los Alamitos, CA 1992 IEEE Computer Society Press Silver Spring, MD 714 723
14. E. Kaltofen, B.D. Saunders, On Wiedemann's method of solving sparse linear systems, in: H.F. Mattson, T. Mora, T.R.N. Rao (Eds.), Proc. AAECC-9, Heidelberg, Germany, 1991, Lecture Notes in Computer Science, vol. 539, Springer, Berlin, pp. 29-38
15. E. Kaltofen, and B. Trager Computing with polynomials given by black boxes for their evaluations: greatest common divisors factorization separation of numerators and denominators J. Symbolic Comput. 9 3 1990 301 320
16. W. Küchlin ISSAC 97 Proc. 1997, International Symposium on Symbolic and Algebraic Computation, New York 1997 ACM Press New York
17. A. Lobo, Matrix-free linear system solving and applications to symbolic computation, PhD. Thesis, Rensselaer Polytechnic Institute, Troy, New York, December, 1995
18. T. Mulders, and A. Strorjohann Diophantine linear system solving in: International Symposium on Symbolic and Algebraic Computation, Vancover, BC, Candada July 1999 181 188
19. V. Pan On computations with dense structured matrices Math. Comp. 55 1990 179 190
20. D.S. Parker, Random butterfly transformations with applications in computational linear algebra, Technical Report CSD-950023, Computer Science Department, UCLA, 1995, Available from http://www.cs.ucla.edu/ stott/ge
21. B.D. Saunders, A. Storjohann, G. Villard, Rank certificates for sparse matrices, June 1998. Reported to the LinBox group (to be published)
22. J. Schwartz Fast probabilistic algorithms for verification of polynomical identities J. ACM 27 1980 701 717
23. G. Villard Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems W. Küchlin, ISSAC 97 Proc. 1997, International Symposium on Symbolic and Algebraic Computation, New York 1997 32 39
24. G. Villard Block solution of sparse linear systems over GF(q): the singular case SIGSAM Bull. 32 4 1998 10 12
25. D. Wiedemann Solving sparse linear equations over finite fields IEEE Trans. Inform. Theory IT-32 1986 54 62
26. R. Zippel Probabilistic algorithms for sparse polynomials in: Proc. EUROSAM '79, Heidelberg, Germany, Lecture Notes in Computer Science, vol. 72 1979 Springer Berlin 216 226