Rang revealing QR factorizations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3331873 (Why is no real title available?)
- A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
- An Interval Analysis Approach to Rank Determination in Linear Least Squares Problems
- Deflated Decomposition of Solutions of Nearly Singular Systems
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- On computing bounds for the least singular value of a triangular matrix
- On the Existence and Computation of LU-Factorizations with Small Pivots
- On the Implicit Deflation of Nearly Singular Systems of Linear Equations
- Rank Degeneracy
- Rank and null space calculations using matrix decomposition without column interchanges
Cited in
(only showing first 100 items - show all)- A training set subsampling strategy for the reduced basis method
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- A stochastic perturbation analysis of the QR decomposition and its applications
- Parallel spectral division using the matrix sign function for the generalized eigenproblem
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Parallel Algorithms for Computing the Tensor-Train Decomposition
- Sparse hierarchical solvers with guaranteed convergence
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Projection continuation for minimal coordinate set formulation and singularity detection of redundantly constrained system dynamics
- Fast structured LU factorization for nonsymmetric matrices
- Low rank approximation of binary matrices: column subset selection and generalizations
- Improved bound for rank revealing LU factorizations
- Deviation maximization for rank-revealing QR factorizations
- Randomized LU decomposition
- Exact QR factorizations of rectangular matrices
- Randomized QLP decomposition
- A TT-based hierarchical framework for decomposing high-order tensors
- Randomized algorithms for the low multilinear rank approximations of tensors
- An efficient algorithm for rank and subspace tracking
- QM/MM Methods for Crystalline Defects. Part 3: Machine-Learned MM Models
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Estimation of atmospheric PSF parameters for hyperspectral imaging.
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- Tracking poles, representing Hankel operators, and the Nehari problem
- Block discrete empirical interpolation methods
- Randomized QR with column pivoting
- One-sided reduction to bidiagonal form
- Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
- \(J\) factorizations of a general discrete-time system
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Integer matrix factorization for mesh defect detection
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- An efficient randomized QLP algorithm for approximating the singular value decomposition
- INFORMATION STORAGE SYSTEM
- Regularized greedy column subset selection
- A fast randomized algorithm for computing an approximate null space
- A contour-integral based method with Schur-Rayleigh-Ritz procedure for generalized eigenvalue problems
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- A contour-integral based method for counting the eigenvalues inside a region
- Subspaces analysis for random projection UTV framework
- Time and space efficient generators for quasiseparable matrices
- Efficient Krylov subspace techniques for model order reduction of automotive structures in vibroacoustic applications
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
- Pole-zero representation of descriptor systems
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- Information preserving regression-based tools for statistical disclosure control
- Spectral division methods for block generalized Schur decompositions
- Indefinite QR factorization
- Rounding errors in solving block Hessenberg systems
- The 2-norm of random matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Solving stable Sylvester equations via rational iterative schemes
- Fast orthogonal decomposition of rank deficient Toeplitz matrices
- Column subset selection problem is UG-hard
- Dynamic block GMRES: An iterative method for block linear systems
- Infinite- and finite-buffer Markov fluid queues: a unified analysis
- Solving large dense systems of linear equations on systems with virtual memory and with cache
- Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- A numerical approximation for the simple bifurcation problems
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- A note on properties and computations of matrix pseudospectra
- Column subset selection via sparse approximation of SVD
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- Compressing Rank-Structured Matrices via Randomized Sampling
- On stabilization methods of descriptor systems
- Maximizing bilinear forms subject to linear constraints
- A modified matrix sign function method for projected Lyapunov equations
- The Probability of Large Diagonal Elements in the $QR$ Factorization
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Computation of coprime factorizations of rational matrices
- Zero cancellation for general rational matrix functions
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Gram-Schmidt orthogonalization: 100 years and more
- Efficient algorithms for CUR and interpolative matrix decompositions
- A block algorithm for computing rank-revealing QR factorizations
- Subspace Iteration Randomization and Singular Value Problems
- Implicit QR factorization of a product of three matrices
- A Framework for a Generalization Analysis of Machine-Learned Interatomic Potentials
- Some new properties of the equality constrained and weighted least squares problem
- Fast linear algebra is stable
- Exponential inapproximability of selecting a maximum volume sub-matrix
- On rank and null space computation of the generalized Sylvester matrix
- Jacobian reuse in explicit integrators for higher index DAEs
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
- A Krylov multisplitting algorithm for solving linear systems of equations
- Literature survey on low rank approximation of matrices
- Structural instability analyses based on generalised path-following
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Row Ordering for a Sparse QR Decomposition
- A new method for computing the stable invariant subspace of a real Hamiltonian matrix
- RankRev: a Matlab package for computing the numerical rank and updating/downdating
- On the computation of the rank of block bidiagonal Toeplitz matrices
- Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function
- Generalized QR factorization and its applications
This page was built for publication: Rang revealing QR factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q578845)
