Upper eigenvalue bounds for pencils of matrices
From MaRDI portal
Publication:1064012
DOI10.1016/0024-3795(84)90088-0zbMath0575.65029OpenAlexW1990591435MaRDI QIDQ1064012
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90088-0
asymptotic convergence rateseigenvalue boundspositive definitepencils of matricesStieltjes matrixAxelsson's perturbationsfactorization iterative methods
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Inequalities involving eigenvalues and eigenvectors (15A42) Iterative numerical methods for linear systems (65F10)
Related Items
On Axelsson's perturbations ⋮ Lower eigenvalue bounds for pencils of matrices ⋮ A general incomplete block-matrix factorization method ⋮ A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices ⋮ Analyses on the finite difference method by gibou et al. for Poisson equation ⋮ Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem ⋮ Conditioning analysis of positive definite matrices by approximate factorizations ⋮ On the robustness of modified incomplete factorization methods ⋮ A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C ⋮ Comparison of eigenvalue ratios in artificial boundary perturbation and Jacobi preconditioning for solving Poisson equation ⋮ Conditioning analysis of modified block incomplete factorizations ⋮ Conditioning analysis of sparse block approximate factorizations ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Analytical bounds for block approximate factorization methods ⋮ Iterative solution methods ⋮ Approximate factorizations with S/P consistently ordered M-factors ⋮ Incomplete factorizations of singular linear systems ⋮ Pencils of complex and real symmetric and skew matrices
Cites Work
