The following pages link to Rang revealing QR factorizations (Q578845):
Displaying 15 items.
- An algebraic multifrontal preconditioner that exploits the low‐rank property (Q5739752) (← links)
- Compressing Rank-Structured Matrices via Randomized Sampling (Q5739955) (← links)
- On rank and null space computation of the generalized Sylvester matrix (Q5962121) (← links)
- A Framework for a Generalization Analysis of Machine-Learned Interatomic Potentials (Q6051541) (← links)
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
- An efficient randomized QLP algorithm for approximating the singular value decomposition (Q6052614) (← links)
- Parallel Algorithms for Computing the Tensor-Train Decomposition (Q6097870) (← links)
- QM/MM Methods for Crystalline Defects. Part 3: Machine-Learned MM Models (Q6109117) (← links)
- A fast randomized algorithm for computing an approximate null space (Q6161581) (← links)
- Exact QR factorizations of rectangular matrices (Q6204198) (← links)
- Sparse hierarchical solvers with guaranteed convergence (Q6554519) (← links)
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems (Q6555374) (← links)
- Block discrete empirical interpolation methods (Q6593337) (← links)
- Projection continuation for minimal coordinate set formulation and singularity detection of redundantly constrained system dynamics (Q6610221) (← links)
- A stochastic perturbation analysis of the QR decomposition and its applications (Q6624472) (← links)
