An efficient method for computing the inverse of arrowhead matrices
From MaRDI portal
Publication:2349233
DOI10.1016/j.aml.2014.02.010zbMath1314.65041OpenAlexW1963669198MaRDI QIDQ2349233
S. A. Edalatpanah, H. Saberi Najafi, George A. Gravvanis
Publication date: 22 June 2015
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2014.02.010
Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Generalized SOR-like iteration method for solving weakly nonlinear systems, On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices, Inversion and pseudoinversion of block arrowhead matrices, An analytical method as a preconditioning modeling for systems of linear equations, An explicit formula for the inverse of arrowhead and doubly arrow matrices, STREAMLINED SOLUTIONS TO MULTILEVEL SPARSE MATRIX PROBLEMS, A convenient omitted variable bias formula for treatment effect models
Cites Work
- Unnamed Item
- Unnamed Item
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- Computing symmetric nonnegative rank factorizations
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- A hub matrix theory and applications to wireless communications
- High performance inverse preconditioning
- Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
- High performance finite element approximate inverse preconditioning
- Computable eigenvalue bounds for rank-\(k\) perturbations
- Improving Jacobi and Gauss-Seidel iterations
- The use of a refined error bound when updating eigenvalues of tridiagonals
- A graph-theoretic model of symmetric Givens operations and its implications
- On the solution of boundary value problems by using fast generalized approximate inverse banded matrix techniques
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Solving symmetric arrowhead and special tridiagonal linear systems by fast approximate inverse preconditioning
- The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices
- Parallel ABS projection methods for linear and nonlinear systems with block arrowhead structure
- Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
- The eigenvalue problem for ‘‘arrow’’ matrices
- Two inverse eigenproblems for symmetric doubly arrow matrices
- QR-Like Algorithms for Symmetric Arrow Matrices
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Variational bounds on the entries of the inverse of a matrix
- An approximate inverse matrix technique for arrowhead matrices
- A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
- Efficient reduction algorithms for bordered band matrices
- Comparison analysis for improving preconditioned SOR-type iterative method
- Explicit inverses of some tridiagonal matrices
- The feasibility of the interval Gaussian algorithm for arrowhead matrices
- Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
