Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition
- Convergence rates for pivoted QR and LU
- RTSMS: randomized Tucker with single-mode sketching
- Effective elastic properties of three-dimensional multiple crack problems with the isogeometric boundary element parallel fast direct solver
- On the Nyström discretization of integral equations on planar curves with corners
- A two-level simultaneous orthogonal matching pursuit algorithm for simultaneous sparse approximation problems
- Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction
- Close to optimal column approximation using a single SVD
- Accurate solution of polynomial equations using Macaulay resultant matrices
- Greedy minimization of weakly supermodular set functions
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Robust blockwise random pivoting: fast and accurate adaptive interpolative decomposition
- Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver
- Low-rank approximation of parameter-dependent matrices via CUR decomposition
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- Limited memory gradient methods for unconstrained optimization
- Multi-layer hierarchical structures
- Exponential inapproximability of selecting a maximum volume sub-matrix
- A fast direct solver for boundary integral equations in two dimensions
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Adaptively compressed polarizability operator for accelerating large scale ab initio phonon calculations
- Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations
- Effectively subsampled quadratures for least squares polynomial approximations
- A Newton method for rigid body frictional impact with multiple simultaneous impact points
- Rank revealing Gaussian elimination by the maximum volume concept
- Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows
- Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging
- librla: Randomized Linear Algebra Library
- Householder QR factorization with randomization for column pivoting (HQRRP)
- CholeskyQR with randomization and pivoting for tall matrices (CQRRPT)
- Local Lagrangian reduced-order modeling for the Rayleigh-Taylor instability by solution manifold decomposition
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- SCDM-k: localized orbitals for solids via selected columns of the density matrix
- Randomized algorithms for the low-rank approximation of matrices
- Sparse polynomial chaos expansions: literature survey and benchmark
- Strong rank revealing LU factorizations
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Reduction of multivariate mixtures and its applications
- Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach
- An equi-directional generalization of adaptive cross approximation for higher-order tensors
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Randomized QLP decomposition
- Efficient algorithms for computing rank‐revealing factorizations on a GPU
- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Far-field compression for fast kernel summation methods in high dimensions
- FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions
- A fast solver for Poisson problems on infinite regular lattices
- An algorithm for the rapid evaluation of special function transforms
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- A randomized algorithm for the decomposition of matrices
- Regression-aware decompositions
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Column subset selection problem is UG-hard
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Lower bounds for column matrix approximations
- Structure-aware analyses and algorithms for interpolative decompositions
- Efficient methods for grouping vectors into low-rank clusters
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- Construction of hierarchically semiseparable matrix representation using adaptive Johnson-Lindenstrauss sketching
- Diffusion wavelets
- Randomized numerical linear algebra: Foundations and algorithms
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized LU decomposition using sparse projections
- A DEIM induced CUR factorization
- ALORA: affine low-rank approximations
- A fast randomized algorithm for the approximation of matrices
- Fast algorithms for spherical harmonic expansions. III
- Allocation Strategies for High Fidelity Models in the Multifidelity Regime
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Multipreconditioned GMRES for shifted systems
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Estimation of atmospheric PSF parameters for hyperspectral imaging.
- A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Linear-time CUR approximation of BEM matrices
- Efficient discretization of Laplace boundary integral equations on polygonal domains
- Low rank approximation of binary matrices: column subset selection and generalizations
- Efficient uncertainty propagation for network multiphysics systems
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Summarization and search over geometric spaces
- SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction
- Accuracy and stability of CUR decompositions with oversampling
- Gram-Schmidt orthogonalization: 100 years and more
- An L-DEIM induced high order tensor interpolatory decomposition
- A recursive skeletonization factorization based on strong admissibility
- Interpolative decomposition via proxy points for kernel matrices
- Feature selection for linear SVM with provable guarantees
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
- Hierarchical interpolative factorization for elliptic operators: integral equations
- On the optimality of Voronoi-based column selection
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)
