Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Vision and Pattern Recognition,General Engineering,Modeling and Simulation,Software,Theoretical Computer Science
Reference17 articles.
1. Bank R.E., Welfert B.D. and Yserentant H. (1990). A class of iterative methods for solving saddle point problems.. Numer. Math. 56: 645–666
2. Bebendorf, M., Hackbusch, W.: Existence of $$\mathcal{H}$$ -matrix approximants to the inverse FE-matrix of elliptic operators with L ∞-coefficients. Numer. Math. 95:1–28 (2003)
3. Bebendorf, M.: Why approximate LU decompositions of finite element discretizations of elliptic operators can be computed with almost linear complexity. Technical Report 8. Max-Planck-Institute for Mathematics in the Sciences, Leipzig (2005)
4. Benzi M., Golub G.H. and Liesen J. (2005). Numerical solution of saddle point problems. Acta Numerica 14: 1–137
5. Börm, S., Grasedyck, L., Hackbusch, W.: Hierarchical Matrices. Lecture Notes No. 21. Max-Planck-Institute for Mathematics in the Sciences, Leipzig (2003)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献