Factorized Sparse Approximate Inverses for Preconditioning

@article{Huckle2003FactorizedSA,
  title={Factorized Sparse Approximate Inverses for Preconditioning},
  author={Thomas Huckle},
  journal={The Journal of Supercomputing},
  year={2003},
  volume={25},
  pages={109-117}
}
In recent papers the use of sparse approximate inverses for the preconditioning of linear equations Ax=b is examined. The minimization of ||AM−I|| in the Frobenius norm generates good preconditioners without any a priori knowledge on the pattern of M. For symmetric positive definite A and a given a priori pattern there exist methods for computing factorized sparse approximate inverses L with LL T ≈A −1. Here, we want to modify these algorithms that they are able to capture automatically a… CONTINUE READING
18 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Factorized sparse approximate inverse preconditioning I: Theory

  • L. Yu. Kolotilina, A. Yu. Yeremin
  • SIAM J. Matrix Anal. Appl.,
  • 1993
Highly Influential
7 Excerpts

Factorized sparse approximate inverses for preconditioning and smoothing

  • T. Huckle
  • Selcuk Journal of Applied Mathematics,
  • 2000
2 Excerpts

Modification of the minimum degree algorithm for multiple elimination

  • J.W.H. Liu
  • ACM Trans. Math. Soft.,
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…