Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization
From MaRDI portal
Publication:5857851
DOI10.1137/20M1357238zbMath1467.65035WikidataQ114074167 ScholiaQ114074167MaRDI QIDQ5857851
Massimiliano Fasi, Nicholas J. Higham
Publication date: 8 April 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
LU factorizationtest matrix\(\infty\)-norm condition numberHPL-AI mixed-precision benchmarklow-precision arithmetic
Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Related Items
Mixed precision algorithms in numerical linear algebra, Anymatrix: an extensible MATLAB matrix collection
Uses Software
Cites Work
- On condition numbers and the distance to the nearest ill-posed problem
- Componentwise perturbation bounds for some matrix decompositions
- A lower bound for the smallest singular value of a matrix
- Condition numbers and their condition numbers
- On the perturbation of LU and Cholesky factors
- The university of Florida sparse matrix collection
- Sparse matrix test problems
- Error Analysis of Direct Methods of Matrix Inversion
- Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
- Algorithm 694
- Handbook of Floating-Point Arithmetic
- Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
- Accuracy and Stability of Numerical Algorithms
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- A New Approach to Probabilistic Rounding Error Analysis
- Convergence Properties of the Spline Fit
- An algorithm with guaranteed convergence for finding a zero of a function
- On the spectrum of a one-parametric family of matrices.
- Generating Extreme-Scale Matrices With Specified Singular Values or Condition Number
