Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Euclid’s algorithm and the Lanczos method over finite fields
HTML articles powered by AMS MathViewer

by Jeremy Teitelbaum PDF
Math. Comp. 67 (1998), 1665-1678 Request permission


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.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (1991): 11Y16, 65F10, 15A33
  • Retrieve articles in all journals with MSC (1991): 11Y16, 65F10, 15A33
Additional Information
  • Jeremy Teitelbaum
  • Affiliation: Jeremy Teitelbaum, Department of Mathematics, Statistics, and Computer Science (M/C 249), University of Illinois at Chicago, 851 S. Morgan St., Chicago, IL 60607, USA
  • Email:
  • Received by editor(s): February 8, 1996
  • Additional Notes: The author is supported by the National Science Foundation.
  • © Copyright 1998 American Mathematical Society
  • Journal: Math. Comp. 67 (1998), 1665-1678
  • MSC (1991): Primary 11Y16, 65F10, 15A33
  • DOI:
  • MathSciNet review: 1474657