Fixed-polynomial approximate spectral transformations for preconditioning the eigenvalue problem
Arnoldi's method is often used to compute a few eigenvalues and eigenvectors of large, sparse matrices. When the eigenvalues of interest are not dominant or well-separated, this method may suffer from slow convergence. Spectral transformations are a common acceleration technique that address th...
Main Author: | Thornquist, Heidi Krista |
---|---|
Other Authors: | Sorensen, Danny C. |
Format: | Others |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/1911/17630 |
Similar Items
-
Fixed-polynomial approximate spectral transformations for preconditioning the eigenvalue problem
by: Thornquist, Heidi K.
Published: (2009) -
Approximation by multivariate polynomials of fixed length /
by: Mariasoosai, William
Published: (1991) -
Approximation for numbers and the eigenvalue asymptotics for non-isotopic problems
by: Yanagkia, M.
Published: (1981) -
The improvement of approximate solutions of the integral equation eigenvalue problem
by: Chu, K. W.
Published: (1980) -
Polynomial optimization problems: approximation algorithms and applications.
Published: (2011)