Some Applications of the Rank Revealing QR Factorization

DOI10.1137/0913043zbMath0756.65032OpenAlexW2009193081WikidataQ57397427 ScholiaQ57397427MaRDI QIDQ3992218

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

singular value decomposition subset selection total least squares matrix approximation numerical rank rank revealing QR factorization rank deficient problems

Mathematics Subject Classification ID

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

Related Items (39)

Progress on a general numerical method for nonlinear higher index DAEs. II ⋮ Optimal column subset selection for image classification by genetic algorithms ⋮ Maximizing bilinear forms subject to linear constraints ⋮ A stochastic simulation method for uncertainty quantification in the linearized inverse conductivity problem ⋮ Column subset selection problem is UG-hard ⋮ Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection ⋮ Improved bound for rank revealing LU factorizations ⋮ Perturbation theory for orthogonal projection methods with applications to least squares and total least squares ⋮ Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations ⋮ Randomized QR with Column Pivoting ⋮ A randomized algorithm for the decomposition of matrices ⋮ 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 ⋮ Lower bounds for column matrix approximations ⋮ Unnamed Item ⋮ Exact QR factorizations of rectangular matrices ⋮ Literature survey on low rank approximation of matrices ⋮ A note on sparse least-squares regression ⋮ Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations ⋮ Fast structured LU factorization for nonsymmetric matrices ⋮ Structural instability analyses based on generalised path-following ⋮ Nonlinear analysis based on homogeneous incremental systems ⋮ Column subset selection is NP-complete ⋮ NONEXISTENCE OF d-WAVE-SUPERCONDUCTIVITY IN THE QUANTUM MONTE CARLO SIMULATION OF THE HUBBARD MODEL ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ INFORMATION STORAGE SYSTEM ⋮ A fast randomized algorithm for the approximation of matrices ⋮ A block algorithm for computing rank-revealing QR factorizations ⋮ An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition ⋮ A QR-method for computing the singular values via semiseparable matrices ⋮ A fast algorithm for index of annihilation computations ⋮ An efficient patch-to-patch method for coupling independent finite element subdomains with intersecting interfaces ⋮ 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 ⋮ Allocation Strategies for High Fidelity Models in the Multifidelity Regime ⋮ Theory of functional connections applied to quadratic and nonlinear programming under equality constraints ⋮ Subspace Iteration Randomization and Singular Value Problems ⋮ Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems

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