Construction and arithmetics of H-matrices

被引：288

作者：

Grasedyck, L ^{[1
]}

Hackbusch, W ^{[1
]}

机构：

[1] Max Planck Inst Math Sci, D-04103 Leipzig, Germany

来源：

COMPUTING | 2003年 / 70卷 / 04期

关键词：

hierarchical matrices; data-sparse approximations; formatted matrix operations; fast solvers;

D O I：

10.1007/s00607-003-0019-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In previous papers hierarchical matrices were introduced which are data-sparse and allow all approximate matrix arithmetic of nearly optimal complexity. In this paper we analyse the complexity (storage, addition, multiplication and inversion) of the hierarchical matrix arithmetics. Two criteria, the sparsity and idempotency, are sufficient to give the desired bounds. For standard finite element and boundary element applications we present a construction of the hierarchical matrix format for which we can give explicit bounds for the sparsity and idempotency.

引用

页码：295 / 334

页数：40

共 12 条

[1]

[Anonymous], 2000, LECT APPL MATH

[2]

BEBENDORF M, 2002, IN PRESS NUMER MATH

[3] Introduction to hierarchical matrices with applications [J].

Börm, S ;

Grasedyck, L ;

Hackbusch, W .

ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS, 2003, 27 (05) :405-422

[4]

BORM S, 2002, LOW RANK APPROXIMATI

[5]

BORM S, 2002, 82 M PLANCK I MATH N

[6]

Golub G.H., 2013, MATRIX COMPUTATIONS

[7]

GRAHAM IG, 2002, 102 M PLANCK I MATH

[8]

GRASEDYCK L, 2001, THESIS U KIEL GERMAN

[9]

Hackbusch W, 1999, COMPUTING, V62, P89, DOI 10.1007/s006070050015

[10]

Hackbusch W, 2000, COMPUTING, V64, P21

← 1 2 →