Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices

DOI10.1002/nme.1620100418zbMath0325.65017OpenAlexW2060077080MaRDI QIDQ4089718

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

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems ⋮ An accelerated subspace iteration method ⋮ Approximate solutions of a sum-type fractional integro-differential equation by using Chebyshev and Legendre polynomials ⋮ Experimental investigation and FEM analysis of resonance frequency behavior of three-dimensional, thin-walled spur gears with a power-circulating test rig ⋮ An enhanced formulation of error bound in subspace iteration method ⋮ Tchebychev acceleration technique for large scale nonsymmetric matrices ⋮ A symmetric Craig‐Bampton method of coupled fluid‐structure systems