The sparse cardinal sine decomposition and its application for fast numerical convolution
type: Item
instance of: scholarly article
title: The sparse cardinal sine decomposition and its application for fast numerical convolution
zbMATH Open document ID: 1326.65183
author: François Alouges
author: Matthieu Aussal
published in: Numerical Algorithms
publication date: 2015-10-19T00:00:00Z
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 65N38
zbMATH DE Number: 6495739
zbMATH Keywords: fast convolution
zbMATH Keywords: fast multipole method
zbMATH Keywords: numerical example
zbMATH Keywords: algorithm
zbMATH Keywords: unstructured grids
zbMATH Keywords: adaptive cross approximation
zbMATH Keywords: complexity
zbMATH Keywords: matrix-vector product
zbMATH Keywords: non-uniform fast Fourier transform
describes a project that uses: UNCMND
describes a project that uses: pchip
MaRDI profile type: Publication
full work available at URL: s11075-014-9953-6
OpenAlex ID: W2033112644
cites work: Q3997324
cites work: The type 3 nonuniform FFT and its applications
cites work: A new fast multipole formulation for the elastodynamic half-space Green's tensor
cites work: Fast convolution with radial kernels at nonequispaced knots
cites work: Fast Fourier Transforms for Nonequispaced Data
cites work: Q4240351
cites work: Uniform approximation of \(\text{sgn} (x)\) by polynomials and entire functions
cites work: Spectral approximation of the free-space heat kernel
cites work: Q3996584
cites work: Numerical Integration on the Sphere
cites work: Hierarchische Matrizen
cites work: Q4520888
cites work: Q3997712
cites work: A quadrature formula for the sphere of the 131st algebraic order of accuracy
cites work: Accelerating the Nonuniform Fast Fourier Transform
DOI: 10.1007/S11075-014-9953-6
description: scientific article; zbMATH DE number 6495739