Direct algorithms to solve the two-sided obstacle problem for anM-matrix

DOI10.1002/NLA.487MaRDI QIDQ3412457zbMATH OpenOpenAlexFDO

Authors Ying-Jun Jiang, Jinping Zeng

Publication date 6 December 2006

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.487

zbMATH Keywords

\(M\)-matrixdirect algorithmpolynomial computational complexitytwo-sided obstacle problem

Mathematics Subject Classification ID

Existence theories for optimal control problems involving ordinary differential equations (49J15) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20)

Cited in

(4)

• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
• Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems
• Direct algorithm for the solution of two-sided obstacle problems with M-matrix.
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix

This page was built for publication: Direct algorithms to solve the two-sided obstacle problem for anM-matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412457)