On the public citation graph
Solving the Linear Complementarity Problem in Circuit Simulation
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-6321-0openalex-snapshot
A Comprehensive Textbook of Classical Mathematics: A Contemporary Interpretation
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01581652openalex-snapshot
A variable dimension algorithm for the linear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1016/0377-2217(81)90190-9openalex-snapshot
Simplicial fixed point algorithms
inferredcites →https://doi.org/10.1109/tct.1972.1083550openalex-snapshot
A sparse matrix method for analysis of piecewise-linear resistive networks
inferredcites →https://doi.org/10.1111/j.1467-9574.1981.tb00713.xopenalex-snapshot
Variable dimension fixed point algorithms and triangulations
inferredcites →https://doi.org/10.1137/0309028openalex-snapshot
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
inferredcites →https://doi.org/10.1287/mnsc.11.7.681openalex-snapshot
Bimatrix Equilibrium Points and Mathematical Programming
inferredcites →https://doi.org/10.1287/mnsc.17.9.612openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/moor.8.4.557openalex-snapshot
A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
inferredcites →https://doi.org/10.6100/ir118197openalex-snapshot
Piecewise-linear modelling and analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.5281/zenodo.1088173openalex-extracted
Bi-Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1002/cta.660openalex-snapshot
A unified set‐theoretic approach to the analysis of PWL resistive circuits and composite N‐ports
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_3openalex-snapshot
Complementarity Problems as Mathematical Models
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_30openalex-snapshot
Sign-Solvable Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf00939336openalex-snapshot
A note on a quadratic formulation for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf00939395openalex-snapshot
A dual exact penalty formulation for the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01096765openalex-snapshot
The linear complementarity problem as a separable bilinear program
inferred← citeshttps://doi.org/10.1007/s00034-018-0924-3openalex-snapshot
Least-Element Time-Stepping Methods for Simulation of Linear Networks with Ideal Switches
inferred← citeshttps://doi.org/10.1007/s10957-019-01573-0openalex-snapshot
Tensor Complementarity Problems—Part III: Applications
inferred← citeshttps://doi.org/10.1016/j.laa.2008.03.022openalex-snapshot
Sign-solvable linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.neucom.2015.05.003openalex-snapshot
An efficient projection neural network for solving bilinear programming problems
inferred← citeshttps://doi.org/10.1049/ip-cds:19970900openalex-snapshot
Finding all DC solutions of nonlinear resistive circuits by exploring both polyhedral and rectangular circuits
inferred← citeshttps://doi.org/10.1109/31.41295openalex-snapshot
The generalized linear complementarity problem applied to the complete analysis of resistive piecewise-linear circuits
inferred← citeshttps://doi.org/10.1109/43.898824openalex-snapshot
Designing electronic engines with electronic engines: 40 years of bootstrapping of a technology upon itself
inferred← citeshttps://doi.org/10.1109/81.219826openalex-snapshot
Polyhedral elements: a new algorithm for capturing all the equilibrium points of piecewise-linear circuits
inferred← citeshttps://doi.org/10.1109/81.989165openalex-snapshot
On the dynamic analysis of piecewise-linear networks
inferred← citeshttps://doi.org/10.1109/81.989170openalex-snapshot
Consistency of a time-stepping method for a class of piecewise-linear networks
inferred← citeshttps://doi.org/10.1109/icmlc.2010.5580705openalex-snapshot
Solving the linear complementarity problem for Stieltjes matrix with interval data
inferred← citeshttps://doi.org/10.1109/iscas.1994.409540openalex-snapshot
New algorithms in piecewise linear resistive simulation
inferred← citeshttps://doi.org/10.1137/s0036144502420083openalex-snapshot
A Linear Complementarity Problem with a P-Matrix
inferred← citeshttps://doi.org/10.1145/3158191.3158195openalex-snapshot
Equation-based modelling and simulation of hybrid systems
inferred← citeshttps://doi.org/10.1155/2014/938598openalex-snapshot
Modified Hyperspheres Algorithm to Trace Homotopy Curves of Nonlinear Circuits Composed by Piecewise Linear Modelled Devices
inferred← citeshttps://doi.org/10.1186/s40064-016-2534-5openalex-snapshot
Speed-up hyperspheres homotopic path tracking algorithm for PWL circuits simulations
inferred← citeshttps://doi.org/10.4018/978-1-4666-9644-0.ch021openalex-snapshot
Verification of Iterative Methods for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.6100/ir527574openalex-snapshot
Linear complementarity systems : a study in hybrid dynamics
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.