The following pages link to Numerical Linear Algebra (Q5646296):
Displayed 44 items.
- A convergence analysis of SOR iterative methods for linear systems with weak \(H\)-matrices (Q330340) (← links)
- An approach of orthogonalization within the Gram-Schmidt algorithm (Q725754) (← links)
- Aitken's and Steffensen's accelerations in several variables (Q749161) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- The \(D\)-decomposition technique for linear matrix inequalities (Q885770) (← links)
- A matrix lower bound (Q972795) (← links)
- On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
- On condition numbers and the distance to the nearest ill-posed problem (Q1079333) (← links)
- The geometry of ill-conditioning (Q1100848) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices (Q1183184) (← links)
- On plastic dynamics of discrete structural models (Q1244853) (← links)
- Condition numbers and their condition numbers (Q1345512) (← links)
- Methods and algorithms of solving spectral problems for polynomial and rational matrices (Q1389295) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- A tutorial history of least squares with applications to astronomy and geodesy (Q1587394) (← links)
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian (Q1594772) (← links)
- Condition numbers of rectangular systems and bounds for generalized inverses (Q1819892) (← links)
- Strong rank revealing LU factorizations (Q1873693) (← links)
- Weyl's quadtree algorithm for the unsymmetric eigenvalue problem (Q1904521) (← links)
- Checking robust nonsingularity of tridiagonal matrices in linear time (Q1914863) (← links)
- Invariant subspaces, derivative arrays, and the computation of the Drazin inverse (Q2022375) (← links)
- Deviation maximization for rank-revealing QR factorizations (Q2084250) (← links)
- Pass-efficient methods for compression of high-dimensional turbulent flow data (Q2123807) (← links)
- Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting (Q2231598) (← links)
- Efficient recursive least squares solver for rank-deficient matrices (Q2242621) (← links)
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) (← links)
- ALORA: affine low-rank approximations (Q2312001) (← links)
- On level-2 condition number for the weighted Moore-Penrose inverse (Q2426899) (← links)
- Minimization of \(\ell_2\)-norms of the SOR and MSOR operators (Q2491661) (← links)
- Pivot size in Gaussian elimination (Q2532072) (← links)
- Monitoring the numerical stability of Gaussian elimination (Q2538763) (← links)
- A New Selection Operator for the Discrete Empirical Interpolation Method---Improved A Priori Error Bound and Extensions (Q2790080) (← links)
- Gram-Schmidt orthogonalization: 100 years and more (Q2931519) (← links)
- Smallest destabilizing perturbations for linear systems (Q3028821) (← links)
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces (Q3176354) (← links)
- The Probability That a Numerical Analysis Problem is Difficult (Q3805780) (← links)
- Tolerances, robustness and parametrization of matrix properties related to optimization problems (Q4634170) (← links)
- Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
- A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems (Q5270767) (← links)
- Some Results on Sparse Matrices (Q5641963) (← links)
- Householder QR Factorization With Randomization for Column Pivoting (HQRRP) (Q5738147) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)