The sparse cardinal sine decomposition and its application for fast numerical convolution

DOI10.1007/s11075-014-9953-6zbMath1326.65183OpenAlexW2033112644MaRDI QIDQ747744

François Alouges, Matthieu Aussal

Publication date: 19 October 2015

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-014-9953-6

zbMATH Keywords

complexityalgorithmnumerical exampleunstructured gridsfast multipole methodmatrix-vector productfast convolutionadaptive cross approximationnon-uniform fast Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Boundary element methods for boundary value problems involving PDEs (65N38)

Related Items (10)

High-frequency asymptotic compression of dense BEM matrices for general geometries without ray tracing ⋮ Motion of a solid particle in a bounded viscous flow using the sparse cardinal sine decomposition ⋮ BlackNUFFT: modular customizable black box hybrid parallelization of type 3 NUFFT in 3D ⋮ Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms ⋮ Two-level preconditioning for \(h\)-version boundary element approximation of hypersingular operator with GenEO ⋮ FEM-BEM Coupling for Electromagnetism with the Sparse Cardinal Sine Decomposition, ⋮ Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies ⋮ FEM and BEM simulations with the Gypsilab framework ⋮ Fast model order reduction boundary element method for large-scale acoustic systems involving surface impedance ⋮ MicroROM: An efficient and accurate reduced order method to solve many-query problems in micro-motility

Uses Software

• UNCMND
• pchip

Cites Work

• A new fast multipole formulation for the elastodynamic half-space Green's tensor
• Spectral approximation of the free-space heat kernel
• A quadrature formula for the sphere of the 131st algebraic order of accuracy
• The type 3 nonuniform FFT and its applications
• Fast convolution with radial kernels at nonequispaced knots
• Uniform approximation of \(\text{sgn} (x)\) by polynomials and entire functions
• Numerical Integration on the Sphere
• Hierarchische Matrizen
• Fast Fourier Transforms for Nonequispaced Data
• Accelerating the Nonuniform Fast Fourier Transform
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The sparse cardinal sine decomposition and its application for fast numerical convolution