A low-rank isogeometric solver based on Tucker tensors
From MaRDI portal
Publication:6187680
DOI10.1016/J.CMA.2023.116472arXiv2306.00632OpenAlexW4387311093MaRDI QIDQ6187680FDOQ6187680
Authors: M. Montardini, Giancarlo Sangalli, Mattia Tani 
Publication date: 15 January 2024
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Abstract: We propose an isogeometric solver for Poisson problems that combines i) low-rank tensor techniques to approximate the unknown solution and the system matrix, as a sum of a few terms having Kronecker product structure, ii) a Truncated Preconditioned Conjugate Gradient solver to keep the rank of the iterates low, and iii) a novel low-rank preconditioner, based on the Fast Diagonalization method where the eigenvector multiplication is approximated by the Fast Fourier Transform. Although the proposed strategy is written in arbitrary dimension, we focus on the three-dimensional case and adopt the Tucker format for low-rank tensor representation, which is well suited in low dimension. We show in numerical tests that this choice guarantees significant memory saving compared to the full tensor representation. We also extend and test the proposed strategy to linear elasticity problems.
Full work available at URL: https://arxiv.org/abs/2306.00632
preconditioningisogeometric analysislow-rank decompositiontruncated preconditioned conjugate gradient methodTucker representation
Game theory, economics, finance, and other social and behavioral sciences (91-XX) Numerical analysis (65-XX)
Cites Work
- A practical guide to splines.
- Tensor Decompositions and Applications
- Title not available (Why is that?)
- A Multilinear Singular Value Decomposition
- Approximation of 1/x by exponential sums in [1, ∞)
- Isogeometric analysis. Toward integration of CAD and FEA
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- Title not available (Why is that?)
- A literature survey of low-rank tensor approximation techniques
- Krylov subspace methods for linear systems with tensor product structure
- Solving stochastic systems with low-rank tensor compression
- Studies of refinement and continuity in isogeometric structural analysis
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Robust and optimal multi-iterative techniques for Iga Galerkin linear systems
- Tensor approximation methods for stochastic problems
- Direct solution of partial difference equations by tensor product methods
- Linear algebra for tensor problems
- Mathematical analysis of variational isogeometric methods
- A new design for the implementation of isogeometric analysis in Octave and Matlab: GeoPDEs 3.0
- Isogeometric preconditioners based on fast solvers for the Sylvester equation
- Robust Multigrid for Isogeometric Analysis Based on Stable Splittings of Spline Spaces
- Isogeometric analysis: mathematical and implementational aspects, with applications
- On the convergence of Krylov methods with low-rank truncations
- A new truncation strategy for the higher-order singular value decomposition
- A Low-Rank Tensor Method for PDE-Constrained Optimization with Isogeometric Analysis
- Recompression of Hadamard Products of Tensors in Tucker Format
- Explicit error estimates for spline approximation of arbitrary smoothness in isogeometric analysis
- Are the eigenvalues of the B-spline isogeometric analysis approximation of \(-\Delta u=\lambda u\) known in almost closed form?
- Refined isogeometric analysis for a preconditioned conjugate gradient solver
- Low rank tensor methods in Galerkin-based isogeometric analysis
- Adaptive selection of primal constraints for isogeometric BDDC deluxe preconditioners
- Low rank interpolation of boundary spline curves
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
- \(p\)-multigrid methods and their comparison to \(h\)-multigrid methods within isogeometric analysis
- A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis
- Computation of best \(L^{\infty }\) exponential sums for \(1 / x\) by Remez' algorithm
- A domain decomposition method for isogeometric multi-patch problems with inexact local solvers
- Removal of spurious outlier frequencies and modes from isogeometric discretizations of second- and fourth-order problems in one, two, and three dimensions
- Application of optimal spline subspaces for the removal of spurious outliers in isogeometric discretizations
- A boundary penalization technique to remove outliers from isogeometric analysis on tensor-product meshes
- Functional Tucker approximation using Chebyshev interpolation
- Easy and efficient preconditioning of the isogeometric mass matrix
This page was built for publication: A low-rank isogeometric solver based on Tucker tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187680)
