Pages that link to "Item:Q1587285"
From MaRDI portal
The following pages link to On the existence and computation of rank-revealing LU factorizations (Q1587285):
Displaying 44 items.
- New studies of randomized augmentation and additive preprocessing (Q332656) (← links)
- Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
- Cholesky decomposition of a positive semidefinite matrix with known kernel (Q632820) (← links)
- Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula (Q668524) (← links)
- About noneigenvector source localization methods (Q939003) (← links)
- On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
- Mechanism free domain decomposition (Q1400683) (← links)
- Randomized LU decomposition (Q1690696) (← links)
- Fast multipole preconditioners for sparse matrices arising from elliptic equations (Q1790219) (← links)
- Strong rank revealing LU factorizations (Q1873693) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- Rank revealing Gaussian elimination by the maximum volume concept (Q1987003) (← links)
- Randomized LU decomposition using sparse projections (Q2012724) (← links)
- Optimal sensors placement in dynamic damage detection of beams using a statistical approach (Q2025707) (← links)
- On the accuracy of cross and column low-rank maxvol approximations in average (Q2038491) (← links)
- Properties of the CMP inverse and its computation (Q2140760) (← links)
- Numerical approximation of multiple isolated roots of analytical systems (Q2211505) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← 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)
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation (Q2350005) (← links)
- Numerically safe Gaussian elimination with no pivoting (Q2359570) (← links)
- A fast and stable algorithm for downdating the singular value decomposition (Q2363845) (← links)
- Time and space efficient generators for quasiseparable matrices (Q2409018) (← 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)
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals (Q2698750) (← links)
- A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations (Q2797105) (← links)
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure (Q2894826) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem (Q2955975) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← 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)
- (Q5005143) (← links)
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning (Q5006445) (← links)
- Sublinear Cost Low Rank Approximation via Subspace Sampling (Q5014667) (← links)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← 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)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
- Exact expressions for the Drazin inverse of anti-triangular matrices (Q6169772) (← links)
- Maximal volume matrix cross approximation for image compression and least squares solution (Q6624470) (← links)
