D.C. Sorensen, C. YANG  Home/Search
Context Related
| rice.edu/caam/trs/97/TR9729.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: rice.edu/caam/tr97 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We consider the problem of computing a few clustered and/or interior eigenvalues of a symmetric matrix A without using a matrix factorization. This can be done by applying the Lanczos algorithm to p(A), where p() is a polynomial that maps the clustered and/or interior eigenvalues of A to extremal and well separated eigenvalues of p(A). We will demonstrate and compare several techniques of constructing these polynomials. Numerical examples are presented to illustrate the effectiveness of using ... (Update)
Similar documents based on text: More All
0.6: Which Eigenvalues Are Found By The Lanczos Method? - Kuijlaars (2000) (Correct)
0.2: A modified low-rank Smith method for large-scale.. - Gugercin, Sorensen.. (2002) (Correct)
0.1: Analysis of Non-Strict Functional Implementations of the.. - Sur, Böhm (1995) (Correct)
BibTeX entry: (Update)
D. C. Sorensen and C. Yang, Accelerating the Lanczos Algorithm via polynomial spectral transformations, Technical Report TR 97-29, Dept. of Comp. and Appl. Math., Rice University, Houston, 1997. http://citeseer.ist.psu.edu/sorensen97accelerating.html More
@misc{ sorensen97accelerating,
author = "D. Sorensen and C. Yang",
title = "Accelerating the Lanczos Algorithm via polynomial spectral transformations",
text = "D. C. Sorensen and C. Yang, Accelerating the Lanczos Algorithm via polynomial
spectral transformations, Technical Report TR 97-29, Dept. of Comp. and
Appl. Math., Rice University, Houston, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/sorensen97accelerating.html" }
Citations (may not include all citations):441 The Symmetric Eigenvalue Problem (context) - Parlett - 1980
139 Implicit application of polynomial filters in a k-step Arnol.. (context) - Sorensen - 1992
120 An Introduction to Numerical Analysis (context) - Atkinson - 1978
68 Digital Filter Design (context) - Parks, Burrus - 1987
61 American Mathematical Society (context) - Szego - 1959
51 Practical use of polynomial preconditionings for the conjuga.. (context) - Saad - 1985
37 An implicitly restarted Lanczos method for large symmetric e.. - Calvetti, Reichel et al. - 1994
28 ARPACK: An implementation of the Implicitly Re-started Arnol.. (context) - Lehoucq, Sorensen et al. - 1995
25 Absence of diffusion in certain random lattices (context) - Anderson - 1958
18 Polynomial Preconditioning for Conjugate Gradient Methods (context) - Ashby - 1987
17 Some perspectives on the eigenvalue problem (context) - Watkins - 1993
16 Kernel polynomials in linear algebra and their numerical app.. (context) - Stiefel - 1958
15 Polynomial preconditioning for conjugate gradient Polynomial.. (context) - Johnson, Micchelli et al. - 1983
14 A comparison of adaptive Chebyshev and least squares polynom.. (context) - Ashby, Manteuffel et al. - 1992
12 The application of Leja points to Richardson iteration and p.. (context) - Reichel - 1991
[Article contains additional citations not shown here]
Documents on the same site (http://www.caam.rice.edu/caam/tr97.html): More
Numerical Optimization Using Computer Experiments - Trosset, Torczon (1997) (Correct)
Robustness Optimization for Constrained, Nonlinear Programming.. - Das (1997) (Correct)
Computing Distances Between Convex Sets and Subsets of the.. - Trosset (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC