New error bounds for linear complementarity problems for \(B^S\)-matrices
From MaRDI portal
Publication:6172866
DOI10.1007/s40314-023-02306-wzbMath1524.90316OpenAlexW4381739963MaRDI QIDQ6172866
No author found.
Publication date: 20 July 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-023-02306-w
Sums of independent random variables; random walks (60G50) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error bounds for linear complementarity problems involving \(B^S\)-matrices
- Weakly chained diagonally dominant \(B\)-matrices and error bounds for linear complementarity problems
- An alternative error bound for linear complementarity problems involving \(B^{S}\)-matrices
- A Gershgorin-type lower bound for the smallest singular value
- Error bounds for linear complementarity problems for \(B\)-matrices
- Lower bounds for the minimum eigenvalue of Hadamard product of an \(M\)-matrix and its inverse
- Estimation of \(\| A ^{-1} \|_\infty \) and the smallest singular value
- Minimal sets alternative to minimal Geršgorin sets
- An upper bound for \(\| A^{-1}\|_{\infty}\) of strictly diagonally dominant \(M\)-matrices
- An upper bound for \(\| A^{-1} \|_\infty \) of strictly diagonally dominant \(M\)-matrices
- A lower bound for the smallest singular value of a matrix
- Further lower bounds for the smallest singular value
- Schur complement-based infinity norm bounds for the inverse of SDD matrices
- Computation of error bounds for P-matrix linear complementarity problems
- A Class of P-Matrices with Applications to the Localization of the Eigenvalues of a Real Matrix
- Loewner matrix ordering in estimation of the smallest singular value
- Matrix Analysis
- On Two-Sided Bounds Related to Weakly Diagonally Dominant M-Matrices with Application to Digital Circuit Dynamics
- A lower bound for the smallest singular value
- A Sufficient Condition for Nonvanishing of Determinants
