Some Applications of the Rank Revealing QR Factorization

DOI10.1137/0913043MaRDI QIDQ3992218zbMATH OpenOpenAlexWikidataFDO

Authors Tony F. Chan, Per Christian Hansen

Publication date 13 August 1992

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0913043

zbMATH Keywords

matrix approximationnumerical rankrank deficient problemsrank revealing QR factorizationsingular value decompositionsubset selectiontotal least squares

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Structure-Preserving and Rank-Revealing QR-Factorizations
• On Rank-Revealing Factorisations
• Algorithm 782
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization

Cited in

(50)

• A block algorithm for computing rank-revealing QR factorizations
• An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Progress on a general numerical method for nonlinear higher index DAEs. II
• Maximizing bilinear forms subject to linear constraints
• Improved bound for rank revealing LU factorizations
• Optimal column subset selection for image classification by genetic algorithms
• A fast algorithm for index of annihilation computations
• Perturbation theory for orthogonal projection methods with applications to least squares and total least squares
• Structural instability analyses based on generalised path-following
• Nonlinear analysis based on homogeneous incremental systems
• An efficient patch-to-patch method for coupling independent finite element subdomains with intersecting interfaces
• Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
• Column subset selection is NP-complete
• A robust patch coupling method for NURBS-based isogeometric analysis of non-conforming multipatch surfaces
• Dual and approximate dual basis functions for B-splines and NURBS -- comparison and application for an efficient coupling of patches with the isogeometric mortar method
• A flexible approach for coupling NURBS patches in rotationless isogeometric analysis of Kirchhoff-Love shells
• Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
• A note on sparse least-squares regression
• Fast structured LU factorization for nonsymmetric matrices
• Column subset selection problem is UG-hard
• A stochastic simulation method for uncertainty quantification in the linearized inverse conductivity problem
• Calculation of eigenpair derivatives for asymmetric damped systems with distinct and repeated eigenvalues
• New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
• INFORMATION STORAGE SYSTEM
• Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Low‐rank revealing QR factorizations
• Literature survey on low rank approximation of matrices
• Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
• scientific article; zbMATH DE number 2090652 (Why is no real title available?)
• Greedy minimization of weakly supermodular set functions
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
• Allocation Strategies for High Fidelity Models in the Multifidelity Regime
• Subspace Iteration Randomization and Singular Value Problems
• Randomized QR with column pivoting
• A variation of RRQR decomposition based on Gershgorin disk theorem
• NONEXISTENCE OF d-WAVE-SUPERCONDUCTIVITY IN THE QUANTUM MONTE CARLO SIMULATION OF THE HUBBARD MODEL
• Lower bounds for column matrix approximations
• A randomized algorithm for the decomposition of matrices
• Exact QR factorizations of rectangular matrices
• A stochastic perturbation analysis of the QR decomposition and its applications
• Estimating a matrix's singular values with interpolative decompositions
• Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
• A two-level simultaneous orthogonal matching pursuit algorithm for simultaneous sparse approximation problems
• A QR-method for computing the singular values via semiseparable matrices
• librla: Randomized Linear Algebra Library
• Interlacing polynomial method for matrix approximation via generalized column and row selection
• Krylov iterative methods for linear least squares problems with linear equality constraints
• A fast randomized algorithm for the approximation of matrices

This page was built for publication: Some Applications of the Rank Revealing QR Factorization

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