Derivation and Analysis of Fast Bilinear Algorithms for Convolution
From MaRDI portal
Publication:5140608
DOI10.1137/19M1301059zbMath1456.65179arXiv1910.13367OpenAlexW3096099561MaRDI QIDQ5140608
Publication date: 16 December 2020
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.13367
Numerical methods for integral transforms (65R10) Numerical linear algebra (65F99) General topics in the theory of algorithms (68W01)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Every matrix is a product of Toeplitz matrices
- Even faster integer multiplication
- Automatic derivation and implementation of fast convolution algorithms
- Fast polynomial multiplication and convolutions related to the discrete cosine transform
- Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
- QR factorization of Toeplitz matrices
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Fast Fourier transform and convolution algorithms
- How to generate unknown orthogonal polynomials out of known orthogonal polynomials
- Comparison of the discrete singular convolution algorithm and the Fourier pseudospectral method for solving partial differential equations
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- How Bad Are Vandermonde Matrices?
- Iterative Toom-Cook methods for very unbalanced long integer multiplication
- New algorithms for digital convolution
- Fast Algorithms for Signal Processing
- Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
- How Can We Speed Up Matrix Multiplication?
- A fast algorithm for solving a Toeplitz system of equations
- On the rate of growth of condition numbers for convolution matrices
- On the communication complexity of generalized 2-D convolution on array processors
- The Discrete Cosine Transform
- Overlapped block digital filtering
- Hardware Efficient Fast Parallel FIR Filter Structures Based on Iterated Short Convolution
- Tensor Decomposition for Signal Processing and Machine Learning
- Accuracy and Stability of Numerical Algorithms
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
- On the Minimum Computation Time of Functions
- Efficient models for correlated data via convolutions of intrinsic processes
- Spectral Properties of Banded Toeplitz Matrices
- Linear integral equations
- A fast, high-order algorithm for the solution of surface scattering problems: Basic implementation, tests, and applications
- On tensor approximation of Green iterations for Kohn-Sham equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Derivation and Analysis of Fast Bilinear Algorithms for Convolution
