**-Matrix Arithmetics in Linear Complexity

Authors:
S. Börm
Affiliations:
Max-Planck-Institut für Mathematik in den Naturwissenschaften, Inselstrasse 22–26, 04103, Leipzig, Germany
Venue:
Computing
Year:
2006

Citing 12
Cited 4

A fast algorithm for particle simulations

Journal of Computational Physics
A sparse matrix arithmetic based on H-matrices. Part I: introduction to H-matrices

Computing
A sparse H -matrix arithmetic. Part II: application to multi-dimensional problems

Computing
Variable order panel clustering

Computing
Data-sparse approximation by adaptive H2-matrices

Computing
H2-matrix approximation of integral operators by interpolation

Applied Numerical Mathematics
Multiscale Bases for the Sparse Representation of Boundary Integral Operators on Complex Geometry

SIAM Journal on Scientific Computing
Construction and arithmetics of H-matrices

Computing
Approximation of Integral Operators by Variable-Order Interpolation

Numerische Mathematik
Adaptive Recompression of **-Matrices for BEM

Computing
Approximation of Integral Operators by **-Matrices with Adaptive Bases

Computing
Hybrid cross approximation of integral operators

Numerische Mathematik

A Fast Direct Solver for a Class of Elliptic Partial Differential Equations

Journal of Scientific Computing
Direct matrix solution of linear complexity for surface integral-equation based impedance extraction of high bandwidth interconnects

Proceedings of the 48th Design Automation Conference
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices

SIAM Journal on Matrix Analysis and Applications
A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.**-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 **-matrices in a prescribed **-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.