On convergence of iterative projection methods for symmetric eigenvalue problems (Q730577)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

On convergence of iterative projection methods for symmetric eigenvalue problems

scientific article; zbMATH DE number 6668821

Language	Label	Description	Also known as
default for all languages	No label defined
English	On convergence of iterative projection methods for symmetric eigenvalue problems	scientific article; zbMATH DE number 6668821

Statements

instance of

scholarly article

0 references

title

On convergence of iterative projection methods for symmetric eigenvalue problems (English)

0 references

author

Kensuke Aishima

0 references

published in

Journal of Computational and Applied Mathematics

0 references

publication date

28 December 2016

0 references

zbMATH Keywords

iterative methods for eigenvalue problems

0 references

global convergence

0 references

Rayleigh-Ritz procedure

0 references

restarting

0 references

preconditioning

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cam.2016.08.035

0 references

cites work

Templates for the Solution of Algebraic Eigenvalue Problems

0 references

Eigenvalue computation in the 20th century

0 references

Q4917542

0 references

Q3868672

0 references

On the Convergence of Rational Ritz Values

0 references

Rational Krylov for eigenvalue computation and model order reduction

0 references

Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method

0 references

Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices

0 references

Changing poles in the rational Lanczos method for the Hermitian eigenvalue problem

0 references

Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils

0 references

IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems

0 references

Convergence of Restarted Krylov Subspaces to Invariant Subspaces

0 references

Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations

0 references

Thick-restart Lanczos method for large symmetric eigenvalue problems

0 references

Adaptive projection subspace dimension for the thick-restart Lanczos method

0 references

The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices

0 references

A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems

0 references

Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices

0 references

On the convergence rate of a preconditioned subspace eigensolver

0 references

Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect

0 references

Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method

0 references

On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem

0 references

A block Arnoldi-type contour integral spectral projection method for solving generalized eigenvalue problems

0 references

FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection

0 references

The Davidson Method

0 references

Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method

0 references

Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems

0 references

Gradient flow approach to geometric convergence analysis of preconditioned eigensolvers

0 references

A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration

0 references

Convergence analysis of gradient iterations for the symmetric eigenvalue problem

0 references

Is Jacobi--Davidson Faster than Davidson?

0 references

Jacobi Correction Equation, Line Search, and Conjugate Gradients in Hermitian Eigenvalue Computation I: Computing an Extreme Eigenvalue

0 references

A note on the Rayleigh quotient iteration for symmetric eigenvalue problems

0 references

Convergence of inexact inverse iteration with application to preconditioned iterative solvers

0 references

On convergence of the inexact Rayleigh quotient iteration with MINRES

0 references

Convergence Analysis of Inexact Rayleigh Quotient Iteration

0 references

Inexact Rayleigh quotient-type methods for eigenvalue computations

0 references

Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method

0 references

Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration

0 references

Preconditioning eigenvalues and some comparison of solvers

0 references

Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue

0 references

Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues

0 references

A geometric theory for preconditioned inverse iteration applied to a subspace

0 references

The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix

0 references

Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems

0 references

Identifiers

zbMATH Open document ID

1382.65096

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.CAM.2016.08.035

0 references

Sitelinks

Mathematics(1 entry)

mardi On convergence of iterative projection methods for symmetric eigenvalue problems