An enhanced formulation of error bound in subspace iteration method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3868501
- Computable error bounds for the generalized symmetric eigenproblem
- An accelerated subspace iteration method
- Acceleration of the subspace iteration method by selective repeated inverse iteration
- Acceleration of the subspace iteration method by selective repeated inverse iteration
Cites work
- A variant of the subspace iteration algorithm for generalized eigenproblems
- Acceleration of subspace iteration
- An accelerated subspace iteration method
- An accelerated subspace iteration method
- An eigensolution strategy for large systems
- Computable error bounds for the generalized symmetric eigenproblem
- Computing eigenvalue bounds of structures with uncertain‐but‐non‐random parameters by a method based on perturbation theory
- Error bounds on the eigenvalues of a linearized dynamic stiffness matrix
- scientific article; zbMATH DE number 4033243 (Why is no real title available?)
- On the number of reliable finite‐element eigenmodes
- Over-relaxation and subspace iteration
- Subspace and Lanczos sparse eigen-solvers for finite element structural and electromagnetic applications
- Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
Cited in
(4)
This page was built for publication: An enhanced formulation of error bound in subspace iteration method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084141)
