# Hierarchical adaptive low-rank format with applications to discretized PDEs

@article{Massei2021HierarchicalAL, title={Hierarchical adaptive low-rank format with applications to discretized PDEs}, author={Stefano Massei and Leonardo Robol and Daniel Kressner}, journal={ArXiv}, year={2021}, volume={abs/2104.11456} }

A novel compressed matrix format is proposed that combines an adaptive hierarchical partitioning of the matrix with low-rank approximation. One typical application is the approximation of discretized functions on rectangular domains; the flexibility of the format makes it possible to deal with functions that feature singularities in small, localized regions. To deal with time evolution and relocation of singularities, the partitioning can be dynamically adjusted based on features of the…

## Figures and Tables from this paper

## One Citation

### Accelerating the charge inversion algorithm with hierarchical matrices for gas insulated systems

- PhysicsJournal of Physics: Conference Series
- 2021

Surface charges accumulating on dielectrics during long-time operation of Gas Insulated High Voltage Direct Current (HVDC-GIS) equipments may affect the stable operation and could possibly trigger…

## References

SHOWING 1-10 OF 39 REFERENCES

### Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations

- Computer ScienceSIAM J. Sci. Comput.
- 2019

A new algorithm, based on tensorized Krylov subspaces, is presented and analyzed for quickly updating the solution of such a matrix equation when its coefficients undergo low-rank changes, and it is demonstrated how this algorithm can be utilized to accelerate the Newton method for solving continuous-time algebraic Riccati equations.

### Fast algorithms for hierarchically semiseparable matrices

- Computer Science, MathematicsNumer. Linear Algebra Appl.
- 2010

This paper generalizes the hierarchically semiseparable (HSS) matrix representations and proposes some fast algorithms for HSS matrices that are useful in developing fast‐structured numerical methods for large discretized PDEs, integral equations, eigenvalue problems, etc.

### Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems

- Computer ScienceSIAM J. Matrix Anal. Appl.
- 2011

It is shown that a much lower computational effort can be achieved for sufficiently smooth parameter dependencies, and computational methods are developed that benefit from the fact that x can be well approximated by a tensor of low rank.

### Solving Rank-Structured Sylvester and Lyapunov Equations

- Computer Science, MathematicsSIAM J. Matrix Anal. Appl.
- 2018

We consider the problem of efficiently solving Sylvester and Lyapunov equations of medium and large scale, in case of rank-structured data, i.e., when the coefficient matrices and the right-hand side…

### The automatic solution of partial differential equations using a global spectral method

- MathematicsJ. Comput. Phys.
- 2015

### Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications

- Computer ScienceSIAM J. Sci. Comput.
- 2000

It is demonstrated that a so-called one-sided reorthogonalization process can be used to maintain an adequate level of orthogonality among the Lanczos vectors and produce accurate low-rank approximations.

### Hierarchical Matrices: Algorithms and Analysis

- Computer Science, Mathematics
- 2015

This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g.,…

### Hierarchical Matrices Based on a Weak Admissibility Criterion

- MathematicsComputing
- 2004

A weaker admissibility condition is described which leads to a coarser partitioning of the hierarchical -matrix format which preserves the approximation power which is known in the case of the standardAdmissibility criterion.

### Quantized tensor-structured finite elements for second-order elliptic PDEs in two dimensions

- Computer Science, MathematicsNumerische Mathematik
- 2018

Numerically it is shown that the entire process of solving the tensor-structured Galerkin first-order FE discretization can achieve accuracy varepsilon in the energy norm, and it is proved that the resulting FE approximations converge exponentially in terms of the effective number N of degrees of freedom.