Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
From MaRDI portal
Publication:4089718
Cited in
(8)- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
- A symmetric Craig‐Bampton method of coupled fluid‐structure systems
- Tchebychev acceleration technique for large scale nonsymmetric matrices
- An accelerated subspace iteration method
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
- Approximate solutions of a sum-type fractional integro-differential equation by using Chebyshev and Legendre polynomials
- An enhanced formulation of error bound in subspace iteration method
- Experimental investigation and FEM analysis of resonance frequency behavior of three-dimensional, thin-walled spur gears with a power-circulating test rig
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)