Error bounds for linear complementarity problems of \(S\)-QN matrices
From MaRDI portal
Publication:2299209
DOI10.1007/s11075-019-00710-0OpenAlexW2943054483WikidataQ127936783 ScholiaQ127936783MaRDI QIDQ2299209
Publication date: 20 February 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-019-00710-0
Related Items
New error bounds for linear complementarity problems of \(\Sigma \)-SDD matrices and \(SB\)-matrices ⋮ On \(\{P_1,P_2\}\)-Nekrasov matrices ⋮ \textit{QN}-tensor and tensor complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on error bounds for linear complementarity problems for \(B\)-matrices
- The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
- Error bounds for linear complementarity problems of Nekrasov matrices
- New error bounds for linear complementarity problems of Nekrasov matrices and \(B\)-Nekrasov matrices
- New error bounds for the linear complementarity problem of \(QN\)-matrices
- Convergence of SSOR methods for linear complementarity problems
- Bounds for the inverses of generalized Nekrasov matrices
- A comparison of error bounds for linear complementarity problems of \(H\)-matrices
- A new subclass of \(H\)-matrices
- A lower bound for the smallest singular value of a matrix
- Scaling technique for partition-Nekrasov matrices
- A new Geršgorin-type eigenvalue inclusion set
- Generalized AOR methods for linear complementarity problem
- Error bounds for linear complementarity problems of \(QN\)-matrices
- Computation of error bounds for P-matrix linear complementarity problems
- On the solution of complementarity problems arising in American options pricing
- A Linear Complementarity Problem with a P-Matrix
This page was built for publication: Error bounds for linear complementarity problems of \(S\)-QN matrices
