.png){kind=icon}
返回
H2-matrix arithmetics in linear complexity
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-005-0146-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. H-2-matrices are a variant of hierarchical matrices which allow us to perform certain operations, like the matrix-vector product, in true linear complexity, but until now it was not clear whether matrix arithmetic operations could also reach this, in some sense optimal, complexity. We present algorithms that compute the best-approximation of the sum and product of two H-2-matrices in a prescribed H-2-matrix format, and we prove that these computations can be accomplished in linear complexity. Numerical experiments demonstrate that the new algorithms are more efficient than the well-known methods for hierarchical matrices.
Keyword:
hierarchical matrices
formatted matrix operations
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
暂无机构信息
引用论文
分享收藏A sparse matrix arithmetic based on H-matrices.: Part I :: Introduction to H-matrices.png)
COMPUTING
COMPUTINGIF2.8
PREAI
分享收藏分享收藏
查看更多内容