Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On selecting a maximum volume sub-matrix of a matrix and related problems
- A block algorithm for computing rank-revealing QR factorizations
- Rank revealing \(LU\) factorizations
- Improved bound for rank revealing LU factorizations
- On the existence and computation of rank-revealing LU factorizations
- Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging
- Pseudo-skeleton approximations with better accuracy estimates
- SCDM-k: localized orbitals for solids via selected columns of the density matrix
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems
- Randomized LU decomposition
- A fast direct solver for boundary value problems on locally perturbed geometries
- Regression-aware decompositions
- Strong rank revealing Cholesky factorization
- A fast direct solver for boundary integral equations in two dimensions
- Minimum Sobolev norm interpolation of scattered derivative data
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- Strong rank revealing LU factorizations
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Rank revealing Gaussian elimination by the maximum volume concept
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Randomized LU decomposition using sparse projections
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- On the accuracy of cross and column low-rank maxvol approximations in average
- Split representation of adaptively compressed polarizability operator
- Reduced order models for Lagrangian hydrodynamics
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
- Deviation maximization for rank-revealing QR factorizations
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- Local Lagrangian reduced-order modeling for the Rayleigh-Taylor instability by solution manifold decomposition
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- An accelerated, high-order accurate direct solver for the Lippmann-Schwinger equation for acoustic scattering in the plane
- Error analysis of an accelerated interpolative decomposition for 3D Laplace problems
- Randomized QLP decomposition
- Reduction of multivariate mixtures and its applications
- Regularized greedy column subset selection
- Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- A fast solver for Poisson problems on infinite regular lattices
- Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations
- Power-law solutions of anisotropic multi-material elasticity problems
- Convergence to diagonal form of block Jacobi-type methods
- An algorithm for the rapid evaluation of special function transforms
- Efficient discretization of Laplace boundary integral equations on polygonal domains
- Linear-time CUR approximation of BEM matrices
- ALORA: affine low-rank approximations
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- A high-order accurate accelerated direct solver for acoustic scattering from surfaces
- Efficient algorithms for CUR and interpolative matrix decompositions
- Effective matrix-free preconditioning for the augmented immersed interface method
- A fast block low-rank dense solver with applications to finite-element matrices
- Far-field compression for fast kernel summation methods in high dimensions
- Algorithms and error bounds for noisy phase retrieval with low-redundancy frames
- Feature selection for linear SVM with provable guarantees
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- A note on sparse least-squares regression
- An equi-directional generalization of adaptive cross approximation for higher-order tensors
- Fast linear algebra is stable
- Diffusion wavelets
- Column subset selection problem is UG-hard
- A fast direct solver for two dimensional quasi-periodic multilayered media scattering problems
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- Summarization and search over geometric spaces
- A DEIM induced CUR factorization
- Hierarchical interpolative factorization for elliptic operators: integral equations
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- A fast algorithm for simulating multiphase flows through periodic geometries of arbitrary shape
- On the stability of some hierarchical rank structured matrix algorithms
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Gram-Schmidt orthogonalization: 100 years and more
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- Efficient uncertainty propagation for network multiphysics systems
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Randomized algorithms for the low-rank approximation of matrices
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- New studies of randomized augmentation and additive preprocessing
- A fast direct solver for quasi-periodic scattering problems
- On growth factors of the modified Gram-Schmidt algorithm
- Fast direct solvers for integral equations in complex three-dimensional domains
- Structure-Preserving and Rank-Revealing QR-Factorizations
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Some Applications of the Rank Revealing QR Factorization
- A fast direct solver for the integral equations of scattering theory on planar curves with corners
- Computing rank-revealing QR factorizations of dense matrices
- Algorithm 782
- On Rank-Revealing Factorisations
- Low‐rank revealing QR factorizations
- Constructing nested bases approximations from the entries of non-local operators
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Literature survey on low rank approximation of matrices
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
This page was built for publication: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891737)
