Pages that link to "Item:Q1064012"
From MaRDI portal
The following pages link to Upper eigenvalue bounds for pencils of matrices (Q1064012):
Displaying 19 items.
- Analyses on the finite difference method by gibou et al. for Poisson equation (Q349707) (← links)
- Pencils of complex and real symmetric and skew matrices (Q802695) (← links)
- On Axelsson's perturbations (Q1080620) (← links)
- Lower eigenvalue bounds for pencils of matrices (Q1088752) (← links)
- A general incomplete block-matrix factorization method (Q1091076) (← links)
- Conditioning analysis of positive definite matrices by approximate factorizations (Q1124278) (← links)
- Conditioning analysis of modified block incomplete factorizations (Q1176529) (← links)
- Conditioning analysis of sparse block approximate factorizations (Q1181519) (← links)
- Lower eigenvalue bounds for singular pencils of matrices (Q1196836) (← links)
- Analytical bounds for block approximate factorization methods (Q1208299) (← links)
- Approximate factorizations with S/P consistently ordered M-factors (Q1263235) (← links)
- Incomplete factorizations of singular linear systems (Q1263236) (← links)
- A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices (Q1360170) (← links)
- Comparison of eigenvalue ratios in artificial boundary perturbation and Jacobi preconditioning for solving Poisson equation (Q1695329) (← links)
- Iterative solution methods (Q1765491) (← links)
- Lower and upper bounds for the number of distinct eigenvalues of a perturbed regular matrix pencil (Q2040546) (← links)
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C (Q3389578) (← links)
- On the robustness of modified incomplete factorization methods (Q4021060) (← links)
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem (Q5317830) (← links)
