Stability of quadratic projection methods
From MaRDI portal
Abstract: In this paper we discuss the stability of an alternative pollution-free procedure for computing spectra. The main difference with the Galerkin method lies in the fact that it gives rise to a weak approximate problem which is quadratic in the spectral parameter, instead of linear. Previous accounts on this new procedure can be found in Levitin and Shargorodsky (2002) [math.SP/0212087] and Boulton (2006) [math.SP/0503126].
Recommendations
- Stability of projection-iterative methods
- Stability of approximate quadratic mappings
- On the stability of solutions to quadratic programming problems
- A Projection Method for Least Squares Problems with a Quadratic Equality Constraint
- scientific article; zbMATH DE number 4043154
- scientific article; zbMATH DE number 810438
- scientific article; zbMATH DE number 4111913
- scientific article; zbMATH DE number 4193583
- scientific article; zbMATH DE number 4201503
- Stabilization via projection
Cited in
(7)- The Galerkin method for perturbed self-adjoint operators and applications
- Quadratic projection methods for approximating the spectrum of self-adjoint operators
- scientific article; zbMATH DE number 5311982 (Why is no real title available?)
- On the limit behaviour of second order relative spectra of self-adjoint operators
- Pseudo Affine Projection Algorithms Revisited: Robustness and Stability Analysis
- scientific article; zbMATH DE number 4193583 (Why is no real title available?)
- scientific article; zbMATH DE number 6467164 (Why is no real title available?)
This page was built for publication: Stability of quadratic projection methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442458)