On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices

@article{Bebendorf2011OnTP,
  title={On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices},
  author={Mario Bebendorf and T. Fischer},
  journal={Numerical Lin. Alg. with Applic.},
  year={2011},
  volume={18},
  pages={105-122}
}
The approximation of the inverse and the factors of the LU decomposition of general sparse matrices by hierarchical matrices is investigated. In this first approach, we present and motivate a new matrix partitioning algorithm which is based on the matrix graph by proving logarithmic-linear complexity of the approximant in the case of bounded condition numbers. In contrast to the usual partitioning, the new algorithm allows to treat general grids if the origin of the sparse matrix is the finite… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

Similar Papers

Loading similar papers…