Matrix-free Krylov iteration for implicit convolution of numerically low-rank data

DOI10.1016/J.CAM.2016.05.005MaRDI QIDQ738959zbMATH OpenOpenAlexFDO

Authors Alex Breuer, Andrew Lumsdaine

Publication date 16 August 2016

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2016.05.005

zbMATH Keywords

convolutionlow-rank approximationprincipal component analysis (PCA)singular value decomposition (SVD)

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical linear algebra (65F99)

Recommendations

• Fast computation of convolution operations via low-rank approximation
• Krylov methods for low-rank regularization
• Matrix-free conjugate gradient implementation of implicit schemes
• Iterative Concave Rank Approximation for Recovering Low-Rank Matrices
• An implicit filter for rational Krylov using core transformations
• An accelerated randomized Kaczmarz method via low-rank approximation
• On the convergence of Krylov methods with low-rank truncations
• scientific article; zbMATH DE number 1070443
• Low-rank tensor Krylov subspace methods for parametrized linear systems
• Structured low-rank approximation for nonlinear matrices

Cites work

• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 804575 (Why is no real title available?)
• scientific article; zbMATH DE number 3240629 (Why is no real title available?)
• A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
• A Krylov Subspace Method for Information Retrieval
• An adaptive block Lanczos algorithm
• Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
• Angles between subspaces and their tangents
• Bilinear Lanczos components for fast dimensionality reduction and feature extraction
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
• Lanczos Algorithms for Large Symmetric Eigenvalue Computations
• Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
• Matrix theory. Basic results and techniques
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• Principal component analysis in ECG signal processing
• Principal component analysis.
• Proper orthogonal decomposition and its applications-part. I: Theory
• Templates for the Solution of Algebraic Eigenvalue Problems
• The Lanczos Algorithm With Partial Reorthogonalization
• The Lanczos Algorithm with Selective Orthogonalization
• The block conjugate gradient algorithm and related methods
• Understanding complex datasets. Data mining with matrix decompositions

Cited in

(3)

• An implicit filter for rational Krylov using core transformations
• Fast computation of convolution operations via low-rank approximation
• Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

Describes a project that uses

Uses Software

• JDQR
• NumPy
• JDQZ
• FFTPACK
• AUGEM

This page was built for publication: Matrix-free Krylov iteration for implicit convolution of numerically low-rank data

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