Sciweavers

Share
MOC
1998

Euclid's algorithm and the Lanczos method over finite fields

8 years 11 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially when working over finite fields. It uses this relationship to account rigorously for the appearance of self-orthogonal vectors arising in the course of the Lanczos algorithm. It presents an improved Lanczos method which overcomes problems with self-orthogonality and compares this improved algorithm with the Euclidean algorithm.
Jeremy Teitelbaum
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where MOC
Authors Jeremy Teitelbaum
Comments (0)
books