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 note on properties and computations of matrix pseudospectra
- Pole-zero representation of descriptor systems
- Computation of coprime factorizations of rational matrices
- A statistical view of column subset selection
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Structural instability analyses based on generalised path-following
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
- INFORMATION STORAGE SYSTEM
- Time and space efficient generators for quasiseparable matrices
- M-QR decomposition and hyperpower iterative methods for computing outer inverses of tensors
- Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
- Fast orthogonal decomposition of rank deficient Toeplitz matrices
- Compressing Rank-Structured Matrices via Randomized Sampling
- Interior point methods are not worse than simplex
- A nonlinear QR algorithm for banded nonlinear eigenvalue problems
- Efficient Krylov subspace techniques for model order reduction of automotive structures in vibroacoustic applications
- Spectral division methods for block generalized Schur decompositions
- About noneigenvector source localization methods
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- Rank revealing \(LU\) factorizations
- Improved bound for rank revealing LU factorizations
- Randomized QR with column pivoting
- Implicit QR factorization of a product of three matrices
- Row Ordering for a Sparse QR Decomposition
- Deviation maximization for rank-revealing QR factorizations
- An efficient randomized QLP algorithm for approximating the singular value decomposition
- A two-level simultaneous orthogonal matching pursuit algorithm for simultaneous sparse approximation problems
- On rank and null space computation of the generalized Sylvester matrix
- Block generalized minimal residual method
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Exponential inapproximability of selecting a maximum volume sub-matrix
- A TT-based hierarchical framework for decomposing high-order tensors
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Sparse hierarchical solvers with guaranteed convergence
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Randomized QLP decomposition
- A modified matrix sign function method for projected Lyapunov equations
- Approximate Generalized Inverses with Iterative Refinement for \epsilon-Accurate Preconditioning of Singular Systems
- Integer matrix factorization for mesh defect detection
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
- Sparse linear least-squares problems
- Global optimality conditions for sensor placement, with extensions to binary low-rank A-optimal designs
- A Krylov multisplitting algorithm for solving linear systems of equations
- A contour-integral based method with Schur-Rayleigh-Ritz procedure for generalized eigenvalue problems
- A contour-integral based method for counting the eigenvalues inside a region
- Column subset selection problem is UG-hard
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Estimation of atmospheric PSF parameters for hyperspectral imaging.
- Jacobian reuse in explicit integrators for higher index DAEs
- Low rank approximation of binary matrices: column subset selection and generalizations
- Accuracy and stability of CUR decompositions with oversampling
- Infinite- and finite-buffer Markov fluid queues: a unified analysis
- The Probability of Large Diagonal Elements in the QR Factorization
- Gram-Schmidt orthogonalization: 100 years and more
- On the numerical solution of large-scale sparse discrete-time Riccati equations
- On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery
- Tracking poles, representing Hankel operators, and the Nehari problem
- Truncated QR factorization with pivoting in mixed precision
- Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function
- Parallel spectral division using the matrix sign function for the generalized eigenproblem
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- Block discrete empirical interpolation methods
- Efficient algorithms for CUR and interpolative matrix decompositions
- A fast randomized algorithm for computing an approximate null space
- Rounding errors in solving block Hessenberg systems
- An efficient algorithm for rank and subspace tracking
- On the error estimate for the projection of a point onto a linear manifold
- Fast linear algebra is stable
- \(J\) factorizations of a general discrete-time system
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- A block algorithm for computing rank-revealing QR factorizations
- Generalized QR factorization and its applications
- Numerical methods in control
- Zero cancellation for general rational matrix functions
- A Framework for a Generalization Analysis of Machine-Learned Interatomic Potentials
- Fast structured LU factorization for nonsymmetric matrices
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
- On the computation of the rank of block bidiagonal Toeplitz matrices
- Iterative algorithms for Gram-Schmidt orthogonalization
- Projection continuation for minimal coordinate set formulation and singularity detection of redundantly constrained system dynamics
- Subspace Iteration Randomization and Singular Value Problems
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- A numerical approximation for the simple bifurcation problems
- One-sided reduction to bidiagonal form
- On selecting a maximum volume sub-matrix of a matrix and related problems
- QM/MM Methods for Crystalline Defects. Part 3: Machine-Learned MM Models
- Some new properties of the equality constrained and weighted least squares problem
- Perturbation of the least squares problem
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Generalized pseudospectral shattering and inverse-free matrix pencil diagonalization
- Leverage score-based quaternion CUR decomposition: gap error analysis and 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)
