Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
From MaRDI portal
Publication:4089718
DOI10.1002/NME.1620100418zbMATH Open0325.65017OpenAlexW2060077080MaRDI QIDQ4089718FDOQ4089718
Hideomi Ohtsubo, Yoshiyuki Yamamoto
Publication date: 1976
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.1620100418
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (8)
- An enhanced formulation of error bound in subspace iteration method
- An accelerated subspace iteration method
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
- Tchebychev acceleration technique for large scale nonsymmetric matrices
- Experimental investigation and FEM analysis of resonance frequency behavior of three-dimensional, thin-walled spur gears with a power-circulating test rig
- A symmetric Craig‐Bampton method of coupled fluid‐structure systems
- Approximate solutions of a sum-type fractional integro-differential equation by using Chebyshev and Legendre polynomials
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
This page was built for publication: Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4089718)