An approximate inverse matrix technique for arrowhead matrices
From MaRDI portal
Recommendations
- Parallel inverse arrowhead matrix algorithms on symmetric multiprocessor systems
- scientific article; zbMATH DE number 2069576
- Solving symmetric arrowhead and special tridiagonal linear systems by fast approximate inverse preconditioning
- Explicit isomorphic iterative methods for solving arrow-type linear systems
- An efficient method for computing the inverse of arrowhead matrices
Cites work
- A class of explicit preconditioned conjugate gradient methods for solving large finite element systems
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A three-dimensional explicit preconditioned solver
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- Explicit preconditioned methods for solving 3d boundary-value problems by approximate inverse finite element matrix techniques
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 851599 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- QR-Like Algorithms for Symmetric Arrow Matrices
- Some Modified Matrix Eigenvalue Problems
- The numerically stable reconstruction of Jacobi matrices from spectral data
- The rate of convergence of explicit approximate inverse preconditioning
- The use of a refined error bound when updating eigenvalues of tridiagonals
Cited in
(20)- Explicit approximate inverse preconditioning techniques
- Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems.
- An explicit formula for the inverse of arrowhead and doubly arrow matrices
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- Solving symmetric arrowhead and special tridiagonal linear systems by fast approximate inverse preconditioning
- Inversion and pseudoinversion of block arrowhead matrices
- An efficient method for computing the inverse of arrowhead matrices
- Java multithreading‐based parallel approximate arrow‐type inverses
- Parallel inverse arrowhead matrix algorithms on symmetric multiprocessor systems
- Parallel Exact and Approximate Arrow-Type Inverses on Symmetric Multiprocessor Systems
- scientific article; zbMATH DE number 11411 (Why is no real title available?)
- scientific article; zbMATH DE number 1210952 (Why is no real title available?)
- scientific article; zbMATH DE number 2069576 (Why is no real title available?)
- Explicit preconditioned conjugate gradient schemes for solving biharmonic equations
- Explicit isomorphic iterative methods for solving arrow-type linear systems
- Linear systems of differential equations in arrowhead form
- The feasibility of the interval Gaussian algorithm for arrowhead matrices
- Factored approximate inverse preconditioners with dynamic sparsity patterns
- High performance inverse preconditioning
- A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
This page was built for publication: An approximate inverse matrix technique for arrowhead matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256047)
