Partial tensor decomposition for decoupling isogeometric Galerkin discretizations
DOI10.1016/j.cma.2018.03.026zbMath1440.65231OpenAlexW2791306541MaRDI QIDQ1985521
Bert Jüttler, Felix Scholz, Angelos Mantzaflaris
Publication date: 7 April 2020
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02271800/file/Partialtensordecomp3d.pdf
numerical integrationsingular value decompositiontensor decompositionlow-rank approximationisogeometric analysismatrix assembly
Numerical computation using splines (65D07) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Related Items (14)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple algorithm for obtaining nearly optimal quadrature rules for NURBS-based isogeometric analysis
- The cost of continuity: a study of the performance of isogeometric finite elements using direct solvers
- Efficient quadrature for NURBS-based isogeometric analysis
- Isogeometric analysis and applications 2014. Selected papers based on the presentations at the IGAA 2014, Annweiler am Trifels, Germany, April 7--10, 2014
- Integration by interpolation and look-up for Galerkin-based isogeometric analysis
- Variationally consistent domain integration for isogeometric analysis
- Selective and reduced numerical integrations for NURBS-based isogeometric analysis
- Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines
- Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization
- The variational collocation method
- Fast formation of isogeometric Galerkin matrices by weighted quadrature
- Optimal and reduced quadrature rules for tensor product and hierarchically refined splines in isogeometric analysis
- Low rank tensor methods in Galerkin-based isogeometric analysis
- Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis
- Isogeometric collocation: cost comparison with Galerkin methods and extension to adaptive hierarchical NURBS discretizations
- Approximation in the finite element method
- Adaptive Low-Rank Methods: Problems on Sobolev Spaces
- Discretized Dynamical Low-Rank Approximation in the Presence of Small Singular Values
- Isogeometric Preconditioners Based on Fast Solvers for the Sylvester Equation
- Matrix Generation in Isogeometric Analysis by Low Rank Tensor Approximation
- ISOGEOMETRIC COLLOCATION METHODS
- Tensor Spaces and Numerical Tensor Calculus
- Isogeometric Analysis
- Time Integration of Tensor Trains
- Approximation of bi-variate functions: singular value decomposition versus sparse grids
- Exploring Matrix Generation Strategies in Isogeometric Analysis
This page was built for publication: Partial tensor decomposition for decoupling isogeometric Galerkin discretizations