The following pages link to Rang revealing QR factorizations (Q578845):
Displaying 50 items.
- Information preserving regression-based tools for statistical disclosure control (Q59302) (← links)
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization (Q281967) (← links)
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices (Q438724) (← links)
- On the numerical solution of large-scale sparse discrete-time Riccati equations (Q652581) (← links)
- On stabilization methods of descriptor systems (Q673861) (← links)
- RankRev: a Matlab package for computing the numerical rank and updating/downdating (Q684191) (← links)
- Zero cancellation for general rational matrix functions (Q734912) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- Implicit QR factorization of a product of three matrices (Q805148) (← links)
- Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids (Q830501) (← links)
- On the error estimate for the projection of a point onto a linear manifold (Q917221) (← links)
- Perturbation of the least squares problem (Q922606) (← links)
- About noneigenvector source localization methods (Q939003) (← links)
- On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm (Q991114) (← links)
- On the computation of the rank of block bidiagonal Toeplitz matrices (Q1012505) (← links)
- On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
- The 2-norm of random matrices (Q1109850) (← links)
- Iterative algorithms for Gram-Schmidt orthogonalization (Q1117669) (← links)
- Generalized QR factorization and its applications (Q1183190) (← links)
- Solving large dense systems of linear equations on systems with virtual memory and with cache (Q1188314) (← links)
- A block algorithm for computing rank-revealing QR factorizations (Q1200543) (← links)
- Rank revealing \(LU\) factorizations (Q1200555) (← links)
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition (Q1208058) (← links)
- Fast orthogonal decomposition of rank deficient Toeplitz matrices (Q1208061) (← links)
- A Krylov multisplitting algorithm for solving linear systems of equations (Q1318212) (← links)
- Maximizing bilinear forms subject to linear constraints (Q1338503) (← links)
- Computation of structural invariants of generalized state-space systems (Q1344369) (← links)
- Improved bound for rank revealing LU factorizations (Q1362659) (← links)
- Jacobian reuse in explicit integrators for higher index DAEs (Q1375435) (← links)
- The behavior of the QR-factorization algorithm with column pivoting (Q1375836) (← links)
- A new method for computing the stable invariant subspace of a real Hamiltonian matrix (Q1378991) (← links)
- Computation of coprime factorizations of rational matrices (Q1379084) (← links)
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices (Q1379115) (← links)
- Methods and algorithms of solving spectral problems for polynomial and rational matrices (Q1389295) (← links)
- Numerical methods in control (Q1591194) (← links)
- Some new properties of the equality constrained and weighted least squares problem (Q1593664) (← links)
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian (Q1594772) (← links)
- Integer matrix factorization for mesh defect detection (Q1600224) (← links)
- Randomized LU decomposition (Q1690696) (← links)
- A fast algorithm for index of annihilation computations (Q1807796) (← links)
- Perturbation theory for the Eckart-Young-Mirsky theorem and the constrained total least squares problem (Q1808940) (← links)
- One-sided reduction to bidiagonal form (Q1855440) (← links)
- Tracking poles, representing Hankel operators, and the Nehari problem (Q1894518) (← links)
- Pole-zero representation of descriptor systems (Q1898500) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- Structural instability analyses based on generalised path-following (Q1971464) (← links)
- A contour-integral based method for counting the eigenvalues inside a region (Q1999893) (← links)
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths (Q2007234) (← links)
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints (Q2074867) (← links)
