Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

MOC
1998

favoriteEmaildiscussreport

97views more MOC 1998»

Euclid's algorithm and the Lanczos method over finite fields

13 years 4 months ago

Euclid's algorithm and the Lanczos method over finite fields

Download www.ams.org

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 ﬁnite ﬁelds. 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

Real-time Traffic

Euclidean Algorithm | Lanczos | MOC 1998 | Sparse Linear Systems |

claim paper

Related Content

» Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three

» Velocity Field Modelling for Pollutant Plume Using 3D Adaptive Finite Element Method

» Voronois algorithm in purely cubic congruence function fields of unit rank 1

» The 2Adic CM Method for Genus 2 Curves with Application to Cryptography

» LowComplexity BitParallel Square Root Computation over GF2m for All Trinomials

» Discriminative Language Modeling with Conditional Random Fields and the Perceptron Algorit...

» On parallel block algorithms for exact triangularizations

» An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves

» Computing Hilbert Class Polynomials

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	MOC
Authors	Jeremy Teitelbaum

Comments (0)