Skip to main content
SpringerLink
Log in

Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 673))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature cited

  • Brent, R. P. and Kung, H. T., “Systolic VLSI arrays for linear-time GCD computation,” Proc. VLSI '83, pp. 145–154 (1983).

    Google Scholar 

  • Cantor, D. G. and Kaltofen, E., “On fast multiplication of polynomials over arbitrary algebras,” Acta Inform. 28/7, pp. 693–701 (1991).

    Google Scholar 

  • Coppersmith, D., “Solving linear equations over GF(2) via block Wiedemann algorithm,” Math. Comput., p. to appear (1992).

    Google Scholar 

  • Dornstetter, J. L., “On the equivalence between Berlekamp's and Euclid's algorithms,” IEEE Trans. Inf. Theory IT-33/3, pp. 428–431 (1987).

    Google Scholar 

  • Kailath, T., Kung, S.-Y., and Morf, M., “Displacement ranks of matrices and linear equations,” J. Math. Analysis Applications 68, pp. 395–407 (1979).

    Google Scholar 

  • Kaltofen, E. and Saunders, B. D., “On Wiedemann's method of solving sparse linear systems,” in Proc. AAECC-9, Springer Lect. Notes Comput. Sci. 539; pp. 29–38, 1991.

    Google Scholar 

  • Lenstra, A. K., Lenstra, H. W., Manasse, M. S., and Pollard, J. M., “The number field sieve,” Proc. 22nd Annual ACM Symp. Theory Comp., pp. 564–572 (1990).

    Google Scholar 

  • Massey, J. L., “Shift-register synthesis and BCH decoding,” IEEE Trans. Inf. Theory IT-15, pp. 122–127 (1969).

    Google Scholar 

  • McClellan, M. T., “The exact solution of systems of linear equations with polynomial coefficients,” J. ACM 20, pp. 563–588 (1973).

    Google Scholar 

  • Moenck, R. T. and Carter, J. H., “Approximate algorithms to derive exact solutions to systems of linear equations,” Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci. 72, pp. 65–73 (1979).

    Google Scholar 

  • Schwartz, J. T., “Fast probabilistic algorithms for verification of polynomial identities,” J. ACM 27, pp. 701–717 (1980).

    Google Scholar 

  • Wiedemann, D., “Solving sparse linear equations over finite fields,” IEEE Trans. Inf. Theory IT-32, pp. 54–62 (1986).

    Google Scholar 

  • Zippel, R., “Probabilistic algorithms for sparse polynomials,” Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci. 72, pp. 216–226 (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rensselaer Polytechnic Institute, 12189-3590, Troy, NY, USA

    Erich Kaltofen

Authors
  1. Erich Kaltofen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Teo Mora Oscar Moreno

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaltofen, E. (1993). Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. In: Cohen, G., Mora, T., Moreno, O. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1993. Lecture Notes in Computer Science, vol 673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56686-4_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-56686-4_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56686-1

  • Online ISBN: 978-3-540-47630-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation