Rang revealing QR factorizations

DOI10.1016/0024-3795(87)90103-0zbMath0624.65025OpenAlexW2008205484WikidataQ57397459 ScholiaQ57397459MaRDI QIDQ578845

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90103-0

zbMATH Keywords

least-squares inverse iteration QR factorization singular value Numerical examples column permutation near-rank deficiency numerical rank

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

A Framework for a Generalization Analysis of Machine-Learned Interatomic Potentials, Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions, An efficient randomized QLP algorithm for approximating the singular value decomposition, Parallel Algorithms for Computing the Tensor-Train Decomposition, QM/MM Methods for Crystalline Defects. Part 3: Machine-Learned MM Models, A fast randomized algorithm for computing an approximate null space, Exact QR factorizations of rectangular matrices, Compressing Rank-Structured Matrices via Randomized Sampling, On rank and null space computation of the generalized Sylvester matrix, Efficient algorithms for CUR and interpolative matrix decompositions, Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery, Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization, Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids, Maximizing bilinear forms subject to linear constraints, Computation of structural invariants of generalized state-space systems, Randomized algorithms for the approximations of Tucker and the tensor train decompositions, Tracking poles, representing Hankel operators, and the Nehari problem, A modified matrix sign function method for projected Lyapunov equations, Column subset selection problem is UG-hard, Pole-zero representation of descriptor systems, Spectral division methods for block generalized Schur decompositions, Infinite- and finite-buffer Markov fluid queues: a unified analysis, Improved bound for rank revealing LU factorizations, A numerical approximation for the simple bifurcation problems, The 2-norm of random matrices, Iterative algorithms for Gram-Schmidt orthogonalization, Gram-Schmidt orthogonalization: 100 years and more, Jacobian reuse in explicit integrators for higher index DAEs, The behavior of the QR-factorization algorithm with column pivoting, A new method for computing the stable invariant subspace of a real Hamiltonian matrix, Computation of coprime factorizations of rational matrices, Componentwise analysis of direct factorization of real symmetric and Hermitian matrices, Randomized QLP decomposition, Time and space efficient generators for quasiseparable matrices, A training set subsampling strategy for the reduced basis method, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Subspaces Analysis for Random Projection UTV Framework, Randomized QR with Column Pivoting, Randomized LU decomposition, Exponential inapproximability of selecting a maximum volume sub-matrix, The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection, An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations, Unnamed Item, Literature survey on low rank approximation of matrices, Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm, Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices, On the error estimate for the projection of a point onto a linear manifold, Rounding errors in solving block Hessenberg systems, Regularized greedy column subset selection, Fast Estimation of Approximate Matrix Ranks Using Spectral Densities, Perturbation of the least squares problem, PARALLEL SPECTRAL DIVISION USING THE MATRIX SIGN FUNCTION FOR THE GENERALIZED EIGENPROBLEM, On the numerical solution of large-scale sparse discrete-time Riccati equations, 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, Randomized algorithms for the low multilinear rank approximations of tensors, Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection, Generalized QR factorization and its applications, About noneigenvector source localization methods, Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors, Fast linear algebra is stable, Dynamic block GMRES: An iterative method for block linear systems, Solving large dense systems of linear equations on systems with virtual memory and with cache, On stabilization methods of descriptor systems, INFORMATION STORAGE SYSTEM, Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function, RankRev: a Matlab package for computing the numerical rank and updating/downdating, An efficient algorithm for rank and subspace tracking, A block algorithm for computing rank-revealing QR factorizations, Rank revealing $LU$ factorizations, Information preserving regression-based tools for statistical disclosure control, A contour-integral based method for counting the eigenvalues inside a region, An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition, Fast orthogonal decomposition of rank deficient Toeplitz matrices, Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation, Estimation of atmospheric PSF parameters for hyperspectral imaging, An algebraic multifrontal preconditioner that exploits the low‐rank property, An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths, Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance, A note on properties and computations of matrix pseudospectra, Unnamed Item, Solving stable Sylvester equations via rational iterative schemes, On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm, Zero cancellation for general rational matrix functions, On the computation of the rank of block bidiagonal Toeplitz matrices, A fast algorithm for index of annihilation computations, Perturbation theory for the Eckart-Young-Mirsky theorem and the constrained total least squares problem, A TT-Based Hierarchical Framework for Decomposing High-Order Tensors, An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling, Column subset selection via sparse approximation of SVD, On selecting a maximum volume sub-matrix of a matrix and related problems, Theory of functional connections applied to quadratic and nonlinear programming under equality constraints, Hierarchical algorithms on hierarchical architectures, Deviation maximization for rank-revealing QR factorizations, A contour-integral based method with Schur-Rayleigh-Ritz procedure for generalized eigenvalue problems, Subspace Iteration Randomization and Singular Value Problems, Numerical methods in control, Some new properties of the equality constrained and weighted least squares problem, Efficient Krylov Subspace Techniques for Model Order Reduction of Automotive Structures in Vibroacoustic Applications, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, One-sided reduction to bidiagonal form, Integer matrix factorization for mesh defect detection, Implicit QR factorization of a product of three matrices, A Krylov multisplitting algorithm for solving linear systems of equations, A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization, A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems, Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems, $J$ factorizations of a general discrete-time system

Cites Work