Solving the Linear Complementarity Problem in Circuit Simulation

DOI10.1137/0324062zbMath0613.90093OpenAlexW2108304854MaRDI QIDQ4721879

Jos T. J. van Eijndhoven

Publication date: 1986

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0324062

zbMATH Keywords

sparse matrix techniquespivoting algorithmssequence of linear complementarity problemsefficient labelling algorithmmodulus algorithmpiecewise linear system description

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Large-scale problems in mathematical programming (90C06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

A note on a quadratic formulation for linear complementarity problems ⋮ A dual exact penalty formulation for the linear complementarity problem ⋮ Sign-solvable linear complementarity problems ⋮ Tensor complementarity problems. III: Applications ⋮ The linear complementarity problem as a separable bilinear program

This page was built for publication: Solving the Linear Complementarity Problem in Circuit Simulation