Direct algorithm for the solution of two-sided obstacle problems with M-matrix.

DOI10.1002/NLA.726MaRDI QIDQ2889377zbMATH OpenOpenAlexFDO

Authors Ying-Jun Jiang, Jinping Zeng

Publication date 7 June 2012

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

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

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)

Recommendations

• Direct algorithms to solve the two-sided obstacle problem for anM-matrix
• Monotonic iterative algorithms for an implicit two-sided obstacle problem.
• scientific article; zbMATH DE number 1131693
• A duality algorithm for the obstacle problem
• Two-side obstacle problem and its equivalent linear complementarity problem
• An algorithm for solving the double obstacle problems
• A two-grids/projection algorithm for obstacle problems
• A duality-type method for the obstacle problem
• An efficient primal-dual method for the obstacle problem
• A new numerical method for solving a bilateral obstacle problem

Cites work

• A generalization of the linear complementarity problem
• Direct algorithms to solve the two-sided obstacle problem for anM-matrix
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Gaussian pivoting method for solving linear complementarity problem
• scientific article; zbMATH DE number 3760340 (Why is no real title available?)
• scientific article; zbMATH DE number 1131989 (Why is no real title available?)
• Minkowski matrices.
• Optimal quadratic programming algorithms. With applications to variational inequalities
• Two-side obstacle problem and its equivalent linear complementarity problem

Cited in

(6)

• Two-side obstacle problem and its equivalent linear complementarity problem
• Monotonic iterative algorithms for an implicit two-sided obstacle problem.
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
• Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems
• scientific article; zbMATH DE number 766238 (Why is no real title available?)
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix

This page was built for publication: Direct algorithm for the solution of two-sided obstacle problems with \(M\)-matrix.

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