Fast computation of convolution operations via low-rank approximation

DOI10.1016/J.APNUM.2013.06.002zbMATH Open1302.65056OpenAlexW1972180421MaRDI QIDQ2448383FDOQ2448383

Authors: Tristan A. Hearn, Lothar Reichel 

Publication date: 30 April 2014

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2013.06.002

Recommendations

• Fast multidimensional convolution in low-rank tensor formats via cross approximation
• Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
• Fast low rank approximations of matrices and tensors
• Publication:4721527
• Application of the fast Fourier transform to calculating pruned convolution

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Restarted block Lanczos bidiagonalization methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• The use of generalized functions and distributions in general relativity
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• Deblurring Images
• Kronecker product and SVD approximations in image restoration
• A new approach to edge detection
• Almost automorphy of the convolution operator and applications to differential and functional differential equations
• New algorithms for digital convolution
• A comparison of the spectral and the discrete singular convolution schemes for the KdV-type equations
• Blind MIMO channel identification from second order statistics using rank deficient channel convolution matrix
• The application of the fast Fourier transform algorithm to the estimation of spectra and cross-spectra

Cited In (8)

• On-line computation of convolutions
• An efficient method for performing discrete convolution using Kronecker products
• Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
• Derivation and analysis of fast bilinear algorithms for convolution
• Accurate pairwise convolutions of non-negative vectors via FFT
• Fast multidimensional convolution in low-rank tensor formats via cross approximation
• Computing rank-convolutions with a mask
• Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

Uses Software

• na26

This page was built for publication: Fast computation of convolution operations via low-rank approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448383)