Pages that link to "Item:Q1873693"
From MaRDI portal
The following pages link to Strong rank revealing LU factorizations (Q1873693):
Displaying 26 items.
- About noneigenvector source localization methods (Q939003) (← links)
- Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging (Q1663467) (← links)
- Randomized LU decomposition (Q1690696) (← links)
- Randomized LU decomposition using sparse projections (Q2012724) (← links)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
- Numerical approximation of multiple isolated roots of analytical systems (Q2211505) (← links)
- Single-pass randomized algorithms for LU decomposition (Q2306297) (← links)
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) (← links)
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation (Q2441120) (← links)
- A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations (Q2797105) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
- Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices (Q4644411) (← links)
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning (Q5006445) (← links)
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations (Q5113365) (← links)
- Analytical Low-Rank Compression via Proxy Point Selection (Q5146610) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation (Q6073724) (← links)
- Polynomial time \(\rho\)-locally maximum volume search (Q6073869) (← links)
- An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation (Q6101124) (← links)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
- Sparse hierarchical solvers with guaranteed convergence (Q6554519) (← links)