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

DOI10.1002/nla.487zbMath1174.65434OpenAlexW2160363650MaRDI QIDQ3412457

YingJun Jiang, Jin-ping 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 algorithmtwo-sided obstacle problempolynomial computational complexity

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item

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