An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems

DOI10.1007/BF01442196zbMath0575.65119OpenAlexW2033798957MaRDI QIDQ1064037

B. George

Publication date: 1985

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01442196

zbMATH Keywords

comparison of methodsConvergencelinear complementarity problemsacceleration parametersADI algorithmalternating direction implicit algorithmjournal bearing problemPeaceman-Rachfordporous flow through a damSOR algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boundary value problems for second-order elliptic equations (35J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Free boundary problems for PDEs (35R35) Applications to the sciences (65Z05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (34)

Uzawa block relaxation method for free boundary problem with unilateral obstacle ⋮ Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ Numerical approximation of the solutions of delay differential equations on an infinite interval using piecewise constant arguments ⋮ A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ The convergence of parallel iteration algorithms for linear complementarity problems ⋮ The quasi-complementarity problem ⋮ Iterative methods for a class of complementarity problems ⋮ Fixed point approach for complementarity problems ⋮ An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems ⋮ Numerical approximations for a class of differential equations with time- and state-dependent delays ⋮ Algorithms for bound constrained quadratic programming problems ⋮ On the generalized implicit quasivariational inequalities ⋮ Fixed-point technique for implicit complementarity problem in Hilbert lattice ⋮ Difference approximations of boundary value problems for functional differential equations ⋮ A difference equation approach to parameter estimation for differential- delay equations ⋮ A survey of recent advances in the numerical treatment of Volterra integral and integro-differential equations ⋮ Differential automata and their discrete simulators ⋮ Globally solving nonconvex quadratic programming problems via completely positive programming ⋮ Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces ⋮ Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces ⋮ Generalized complementarity problems for fuzzy mappings ⋮ Generalized complementarity problems for fuzzy mappings ⋮ Nonmonotone strategy for minimization of quadratics with simple constraints. ⋮ Numerical methods for nonlinear integro-parabolic equations of Fredholm type ⋮ AN ENCLOSURE METHOD FOR FREE BOUNDARY PROBLEMS BASED ON A LINEAR COMPLEMENTARITY PROBLEM WITH INTERVAL DATA^* ⋮ Tensor complementarity problems. III: Applications ⋮ Some applications of continuous Runge-Kutta methods ⋮ A numerical algorithm for hydrodynamic free boundary problems ⋮ Components identification based method for box constrained variational inequality problems with almost linear functions ⋮ The numerical treatment of Volterra integro-differential equations with unbounded delay ⋮ Optimal control of nonlinear hereditary systems ⋮ A damped semismooth Newton method for the Brugnano-Casulli piecewise linear system ⋮ Basic-set algorithm for a generalized linear complementarity problem

Cites Work

• On the convergence of a basic iterative method for the implicit complementarity problem
• Solution of symmetric linear complementarity problems by iterative methods
• On the solution of large, structured linear complementarity problems: The tridiagonal case
• On the solution of large, structured linear complementarity problems: the block partitioned case
• On a problem of the theory of lubrication governed by a variational inequality
• Minkowski matrices.
• Alternating Direction Implicit Methods
• Relaxation Methods for Convex Problems
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems