Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract)

@inproceedings{Villard1997FurtherAO,
  title={Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract)},
  author={Gilles Villard},
  booktitle={ISSAC},
  year={1997}
}
We analyse the probability of success of the block algorithm proposed by Coppersmith for solving large sparse systems Aw = O of linear equations over a field K. Itis based on a modification of a scheme proposed by Wiedemann. An open question was to prove that the block algorithm may produce a solution for small finite fields e.g. for K =GF(2). Our investigations allow us to answer this question nearly completely. We prove that the input parameters of the algorithm may be tuned such that, for… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 39 CITATIONS, ESTIMATED 37% COVERAGE

105 Citations

051015'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 105 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

A uniform approach for the fast computation of matrix-type Pad4 approximants

  • B. BECKERMANN, G. LABAHN
  • SIAM J. Matriz Anal. Appl. 15,
  • 1996
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…