An efficient method for computing the inverse of arrowhead matrices
From MaRDI portal
Publication:2349233
Recommendations
- Inversion and pseudoinversion of block arrowhead matrices
- An explicit formula for the inverse of arrowhead and doubly arrow matrices
- An approximate inverse matrix technique for arrowhead matrices
- Computational Science and Its Applications – ICCSA 2004
- Two inverse problems of symmetric arrow-head matrices
Cites work
- A graph-theoretic model of symmetric Givens operations and its implications
- A hub matrix theory and applications to wireless communications
- A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- An approximate inverse matrix technique for arrowhead matrices
- Comparison analysis for improving preconditioned SOR-type iterative method
- Computable eigenvalue bounds for rank-\(k\) perturbations
- Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
- Computing symmetric nonnegative rank factorizations
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- Efficient reduction algorithms for bordered band matrices
- Explicit inverses of some tridiagonal matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
- High performance finite element approximate inverse preconditioning
- High performance inverse preconditioning
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Improving Jacobi and Gauss-Seidel iterations
- Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
- On the solution of boundary value problems by using fast generalized approximate inverse banded matrix techniques
- Parallel ABS projection methods for linear and nonlinear systems with block arrowhead structure
- QR-Like Algorithms for Symmetric Arrow Matrices
- Solving symmetric arrowhead and special tridiagonal linear systems by fast approximate inverse preconditioning
- The eigenvalue problem for ‘‘arrow’’ matrices
- The feasibility of the interval Gaussian algorithm for arrowhead matrices
- The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices
- The use of a refined error bound when updating eigenvalues of tridiagonals
- Two inverse eigenproblems for symmetric doubly arrow matrices
- Variational bounds on the entries of the inverse of a matrix
Cited in
(11)- An efficient computation of generalized inverse of a matrix
- An explicit formula for the inverse of arrowhead and doubly arrow matrices
- Inversion and pseudoinversion of block arrowhead matrices
- A convenient omitted variable bias formula for treatment effect models
- Arrowhead operators on a Hilbert space
- An approximate inverse matrix technique for arrowhead matrices
- A Space Efficient Flexible Pivot Selection Approach to Evaluate Determinant and Inverse of a Matrix
- Streamlined solutions to multilevel sparse matrix problems
- Generalized SOR-like iteration method for solving weakly nonlinear systems
- On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices
- An analytical method as a preconditioning modeling for systems of linear equations
This page was built for publication: An efficient method for computing the inverse of arrowhead matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349233)
