A tensor-train accelerated solver for integral equations in complex geometries
From MaRDI portal
(Redirected from Publication:1685248)
Abstract: We present a framework using the Quantized Tensor Train (QTT) decomposition to accurately and efficiently solve volume and boundary integral equations in three dimensions. We describe how the QTT decomposition can be used as a hierarchical compression and inversion scheme for matrices arising from the discretization of integral equations. For a broad range of problems, computational and storage costs of the inversion scheme are extremely modest and once the inverse is computed, it can be applied in . We analyze the QTT ranks for hierarchically low rank matrices and discuss its relationship to commonly used hierarchical compression techniques such as FMM and HSS. We prove that the QTT ranks are bounded for translation-invariant systems and argue that this behavior extends to non-translation invariant volume and boundary integrals. For volume integrals, the QTT decomposition provides an efficient direct solver requiring significantly less memory compared to other fast direct solvers. We present results demonstrating the remarkable performance of the QTT-based solver when applied to both translation and non-translation invariant volume integrals in 3D. For boundary integral equations, we demonstrate that using a QTT decomposition to construct preconditioners for a Krylov subspace method leads to an efficient and robust solver with a small memory footprint. We test the QTT preconditioners in the iterative solution of an exterior elliptic boundary value problem (Laplace) formulated as a boundary integral equation in complex, multiply connected geometries.
Recommendations
- An \(O(N)\) direct solver for integral equations on the plane
- Overlapping domain decomposition preconditioner for integral equations
- A fast direct solver for structured linear systems by recursive skeletonization
- Hierarchical interpolative factorization for elliptic operators: integral equations
- Fast quadrature techniques for retarded potentials based on TT/QTT tensor approximation
Cites work
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- scientific article; zbMATH DE number 2206697 (Why is no real title available?)
- A Class of Spectral Two-Level Preconditioners
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A Fast Solver for HSS Representations via Sparse Matrices
- A direct adaptive Poisson solver of arbitrary order accuracy
- A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
- A fast 3D dual boundary element method based on hierarchical matrices
- A fast algorithm for particle simulations
- A fast direct solver for boundary integral equations in two dimensions
- A fast direct solver for structured linear systems by recursive skeletonization
- A literature survey of low-rank tensor approximation techniques
- A short survey on preconditioning techniques for large-scale dense complex linear systems in electromagnetics
- Algebraic wavelet transform via quantics tensor train decomposition
- Approximate iterations for structured matrices
- Approximation of \(2^d\times2^d\) matrices using tensor decomposition
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Boundary integral method for the flow of vesicles with viscosity contrast in three dimensions
- Combining Fast Multipole Techniques and an Approximate Inverse Preconditioner for Large Electromagnetism Calculations
- Corrected trapezoidal rules for a class of singular functions
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Fast algorithms for hierarchically semiseparable matrices
- Fast quadrature techniques for retarded potentials based on TT/QTT tensor approximation
- Fully discrete spectral boundary integral methods for Helmholtz problems on smooth closed surfaces in \(\mathbb R^3\)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Grid-based lattice summation of electrostatic potentials by assembled rank-structured tensor approximation
- Hierarchical Kronecker tensor-product approximations
- Hierarchical LU decomposition-based preconditioners for BEM
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
- High-order corrected trapezoidal quadrature rules for the Coulomb potential in three dimensions
- High-order quadratures for the solution of scattering problems in two dimensions
- How Fast are Nonsymmetric Matrix Iterations?
- Incomplete cross approximation in the mosaic-skeleton method
- Incremental spectral preconditioners for sequences of linear systems
- Iterative near-field preconditioner for the multilevel fast multipole algorithm
- Linear integral equations
- Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
- On interpolation and integration in finite-dimensional spaces of bounded functions
- On the Compression of Low Rank Matrices
- On the fast matrix multiplication in the boundary element method by panel clustering
- On the numerical solution of two‐point boundary value problems II
- Parallel Hierarchical Solvers and Preconditioners for Boundary Element Methods
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- Preconditioning
- Preconditioning for Boundary Integral Equations
- Preconditioning techniques for large linear systems: A survey
- Rapid solution of integral equations of classical potential theory
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Superfast Fourier transform using QTT approximation
- Superfast inversion of two-level Toeplitz matrices using Newton iteration and tensor-displacement structure
- TT-cross approximation for multidimensional arrays
- Tensor Decompositions and Applications
- Tensor numerical methods for multidimensional PDEs: theoretical analysis and initial applications
- Tensor properties of multilevel Toeplitz and related matrices
- Tensor ranks for the inversion of tensor-product binomials
- Tensor-train ranks for matrices and their inverses
- Tensorisation of vectors and their efficient convolution
- Wavelet sparse approximate inverse preconditioners
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
Cited in
(8)- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- Tensor train construction from tensor actions, with application to compression of large high order derivative tensors
- Overlapping domain decomposition preconditioner for integral equations
- Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation
- Ubiquitous evaluation of layer potentials using quadrature by kernel-independent expansion
- A two-step accelerated Levenberg-Marquardt method for solving multilinear systems in tensor-train format
- Fast stray field computation on tensor grids
- State estimation in nonlinear parametric time dependent systems using tensor train
This page was built for publication: A tensor-train accelerated solver for integral equations in complex geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685248)
