On Wiedemann’s method of solving sparse linear systems

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

Volumn 539 LNCS, Issue , 1991, Pages 29-38

  Kaltofen, Erich ^a   Saunders, B David ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968495217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54522-0_93     Document Type: Conference Paper

References (16)

1. Abdali, S. K. and Wise, D. S., “Experiments with quadtree representation of matrices,” Proc. ISSAC '88, Springer Lect. Notes Comput. Sci. 358, pp. 467–474 (1988).
2. Beneš, V. E., “Optimal rearrangeable multistage connecting networks,” Bell System Tech. J. 43, pp. 1641–1656 (1964)
3. Canny, J., Kaltofen, E., and Lakshman, Yagati, “Solving systems of non-linear polynomial equations faster,” Proc. ACM-SIGSAM 1989 Internat. Symp. Symbolic Algebraic Comput., pp. 121–128 (1989).
4. Cantor, D. G. and Kaltofen, E., “Fast multiplication of polynomials over arbitrary rings,” Tech. Report 87-35, Dept. Comput. Sci., Rensselaer Polytechnic Institute, December 1987. Revised version to appear in Acta Informatica.
5. Golub, G. H. and van Loan, C. F., Matrix Computations; Johns Hopkins University Press, Baltimore, Maryland, 1987.
6. Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers; Oxford Univ. Press, Oxford, 1979.
7. Kaltofen, E. and Pan, V., “Processor efficient parallel solution of linear systems over an abstract field,” in Proc. 3rd Ann. ACM Symp. Parallel Algor. Architecture; ACM Press, p. to appear, 1991.
8. Kaltofen, E. and Rolletschek, H., “Computing greatest common divisors and factorizations in quadratic number fields,” Math. Comp. 53/188, pp. 697–720 (1989).
9. Kaminski, M., Kirkpatrick, D. G., and Bshouty, N. H., “Addition requirements for matrix and transposed matrix products,” J. Algorithms 9, pp. 354–364 (1988).
10. LaMacchia, B. A. and Odlyzko, A. M., “Solving large sparse linear systems over finite fields,” in Advances in Cryptology: Crypto 90, Lect. Notes Comput. Sci., edited by S. Vanstone; Springer Verlag, p. to appear, 1991.
11. Lipton, R., Rose, D., and Tarjan, R. E., “Generalized nested dissection,” SIAM J. Numer. Anal. 16, pp. 346–358 (1979).
12. Massey, J. L., “Shift-register synthesis and BCH decoding,” IEEE Trans. Inf. Theory IT-15, pp. 122–127 (1969).
13. Schwartz, J. T., “Fast probabilistic algorithms for verification of polynomial identities,” J. ACM 27, pp. 701–717 (1980).
14. Wiedemann, D., “Solving sparse linear equations over finite fields,” IEEE Trans. Inf. Theory IT-32, pp. 54–62 (1986).
15. Wise, D. S. and Franco, J., “Costs of quadtree representation of non-dense matrices,” J. Parallel Distributed Comput. 9, pp. 282–296 (1990).
16. Zippel, R. E., “Probabilistic algorithms for sparse polynomials,” Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci. 72, pp. 216–226 (1979).