On Rank-Revealing Factorisations
From MaRDI portal
Publication:4292687
DOI10.1137/S0895479891223781zbMath0796.65030OpenAlexW2105111377MaRDI QIDQ4292687
Ilse C. F. Ipsen, Shivkumar Chandrasekaran
Publication date: 10 October 1994
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479891223781
Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Strong rank revealing LU factorizations, SVD update methods for large matrices and applications, The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces, Column subset selection problem is UG-hard, New studies of randomized augmentation and additive preprocessing, Improved bound for rank revealing LU factorizations, A Generalized CUR Decomposition for Matrix Pairs, An efficient algorithm for computing the approximate t-URV and its applications, Gram-Schmidt orthogonalization: 100 years and more, Time and space efficient generators for quasiseparable matrices, SCDM-k: localized orbitals for solids via selected columns of the density matrix, On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces, Exponential inapproximability of selecting a maximum volume sub-matrix, Pass-efficient truncated UTV for low-rank approximations, The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection, Unnamed Item, 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, Reduction of multivariate mixtures and its applications, Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting, Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection, Effectively Subsampled Quadratures for Least Squares Polynomial Approximations, Fast linear algebra is stable, Estimation of atmospheric PSF parameters for hyperspectral imaging, An algebraic multifrontal preconditioner that exploits the low‐rank property, Convergence to diagonal form of block Jacobi-type methods, A QR-method for computing the singular values via semiseparable matrices, A New Selection Operator for the Discrete Empirical Interpolation Method---Improved A Priori Error Bound and Extensions, A Newton method for rigid body frictional impact with multiple simultaneous impact points, Disentanglement via Entanglement: A Unified Method for Wannier Localization, A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations, Column subset selection via sparse approximation of SVD, On selecting a maximum volume sub-matrix of a matrix and related problems, Deviation maximization for rank-revealing QR factorizations, Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds, On the existence and computation of rank-revealing LU factorizations, Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning, Estimating Leverage Scores via Rank Revealing Methods and Randomization, Subspace Iteration Randomization and Singular Value Problems, Symbiosis between linear algebra and optimization, Parallel codes for computing the numerical rank, CUR LRA at Sublinear Cost Based on Volume Maximization, A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems
