Sciweavers

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

12

ISSAC
1997
Springer

favoriteEmaildiscussreport

105views Mathematics» more ISSAC 1997»

On Randomized Lanczos Algorithms

13 years 8 months ago

On Randomized Lanczos Algorithms

Download www4.ncsu.edu

Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algorithm that has been used for integer factorization, and to the (provably reliable) algorithm of Wiedemann. The analysis suggests that our Lanczos algorithms are preferable to several versions of Wiedemann’s method for computations over large ﬁelds, especially for certain symmetric matrix computations.

Wayne Eberly, Erich Kaltofen

Real-time Traffic

ISSAC 1997 | Lanczos Algorithms | Lanczos’s Method | Mathematics | Similar Randomized Lanczos |

claim paper

Related Content

» Euclids algorithm and the Lanczos method over finite fields

» Parallelization of the Lanczos Algorithm on Multicore Platforms

» Atomic wavefunction initialization in ab initio

» A High Throughput FPGABased Implementation of the Lanczos Method for the Symmetric Extrema...

» Rational Krylov for Large Nonlinear Eigenproblems

» A Multilevel Algorithm for Spectral Partitioning with Extended EigenModels

» A Graph Based Method for Generating the Fiedler Vector of Irregular Problems

» On the computation of structured singular values and pseudospectra

» Efficient Multilevel Eigensolvers with Applications to Data Analysis Tasks

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	ISSAC
Authors	Wayne Eberly, Erich Kaltofen

Comments (0)