Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition

DOI10.1553/etna_vol51s469zbMath1433.65083arXiv1803.01982OpenAlexW3099583063WikidataQ126585298 ScholiaQ126585298MaRDI QIDQ5218403

No author found.

Publication date: 3 March 2020

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.01982

zbMATH Keywords

randomized algorithmQR factorizationlow-rank approximationnuclear norm minimizationhigher-order SVDapproximate SVD

Mathematics Subject Classification ID

Factorization of matrices (15A23) Eigenvalues, singular values, and eigenvectors (15A18) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (2)

Randomized numerical linear algebra: Foundations and algorithms ⋮ Pass-efficient truncated UTV for low-rank approximations

Uses Software

• LAPACK
• Matlab
• PROPACK
• ARPACK
• SparseMatrix
• Eigentaste
• Tensorlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Tensor Decompositions and Applications
• Fixed point and Bregman iterative methods for matrix rank minimization
• Handwritten digit classification using higher order singular value decomposition
• On the convergence of Stewart's QLP algorithm for approximating the SVD
• Principal component analysis.
• Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
• The geometry of graphs and some of its algorithmic applications
• Nuclear norm system identification with missing inputs and outputs
• Numerical methods for solving linear least squares problems
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Exact matrix completion via convex optimization
• Orthogonal Tensor Decompositions
• Rank-One Approximation to High Order Tensors
• A DEIM Induced CUR Factorization
• HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• A New Truncation Strategy for the Higher-Order Singular Value Decomposition
• The university of Florida sparse matrix collection
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Authoritative sources in a hyperlinked environment
• Extensions of Lipschitz mappings into a Hilbert space
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• A Randomized Algorithm for Principal Component Analysis
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Stewart's pivoted QLP decomposition for low‐rank matrices
• The WY Representation for Products of Householder Matrices
• A Storage-Efficient $WY$ Representation for Products of Householder Transformations
• LAPACK Users' Guide
• The QLP Approximation to the Singular Value Decomposition
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• ARPACK Users' Guide
• A BLAS-3 Version of the QR Factorization with Column Pivoting
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Structure-Preserving Sparse Decomposition for Facial Expression Analysis
• Singular Value Decomposition, Eigenfaces, and 3D Reconstructions
• Using Linear Algebra for Intelligent Information Retrieval
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Subspace Iteration Randomization and Singular Value Problems
• Randomized QR with Column Pivoting
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

This page was built for publication: Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition