[inline-graphic not available: see fulltext]-Matrix Arithmetics in Linear Complexity

被引:0
|
作者
S. Börm
机构
[1] Max-Planck-Institut für Mathematik in den Naturwissenschaften,
关键词
65F30; Hierarchical matrices; formatted matrix operations;
D O I
10.1007/s00607-005-0146-y
中图分类号
学科分类号
摘要
For hierarchical matrices, approximations of the matrix-matrix sum and product can be computed in almost linear complexity, and using these matrix operations it is possible to construct the matrix inverse, efficient preconditioners based on approximate factorizations or solutions of certain matrix equations.
引用
收藏
页码:1 / 28
页数:27
相关论文
共 50 条