scientific article
From MaRDI portal
Publication:3966997
zbMath0501.65014MaRDI QIDQ3966997
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
error boundsprojection methodsLanczos algorithmunified approachlarge sparse matricessubspace iterationGalerkin type methods
Related Items (13)
Sharp a priori error estimates of the Rayleigh-Ritz method without assumptions of fixed sign or compactness ⋮ The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems ⋮ Cluster robust error estimates for the Rayleigh-Ritz approximation. I: Estimates for invariant subspaces ⋮ Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems ⋮ A block incomplete orthogonalization method for large nonsymmetric eigenproblems ⋮ A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems ⋮ Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver ⋮ Krylov-subspace methods for the Sylvester equation ⋮ A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems ⋮ Numerical aspects of Gram-Schmidt orthogonalization of vectors ⋮ The superlinear convergence behaviour of GMRES ⋮ Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment ⋮ A priori error bounds on invariant subspace approximations by block Krylov subspaces
This page was built for publication:
