Backward errors of the linear complementarity problem
From MaRDI portal
Publication:2299222
DOI10.1007/s11075-019-00723-9OpenAlexW2946458654WikidataQ127874354 ScholiaQ127874354MaRDI QIDQ2299222
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-00723-9
Related Items
A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps ⋮ Acceptable solutions and backward errors for tensor complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- B-Nekrasov matrices and error bounds for linear complementarity problems
- Error bounds for linear complementarity problems of \(MB\)-matrices
- Error bounds for the linear complementarity problem with a P-matrix
- A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of \(H\)-matrices
- Error bounds for the linear complementarity problem with a \(\Sigma \)-SDD matrix
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
- Error bounds for linear complementarity problems of \(QN\)-matrices
- Computation of error bounds for P-matrix linear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- On the Explicit Expression of Chordal Metric between Generalized Singular Values of Grassmann Matrix Pairs with Applications
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- A preconditioned modulus-based iteration method for solving linear complementarity problems ofH-matrices
- A note on backward error analysis for generalized linear complementarity problems
