Year: 1995
Type: conference-paper
Abstract: Gaussian-elimination based shooting-Newton methods, a commonly used approach for computing steady-state solutions, grow in computational complexity like N 3 , where N is the number of circuit equations.Just using iterative methods to solve the shooting-Newton equations results in an algorithm which is still order N 2 because of the cost of calculating the dense sensitivity matrix.Below, a matrix-free Krylov-subspace approach is presented, and the method is shown to reduce shooting-Newton computational complexity to that of ordinary transient analysis.Results from several examples are given to demonstrate that the matrix-free approach is more than ten times faster than using iterative methods alone for circuits with as few as 400 equations.2 Shooting Methods Finding the periodic steady-state solution of a circuit involves nding the initial condition for the circuit's associated system of dierential equations such that the solution at the end of the period matches the initial condition.More precisely, nding the steady-state solution means nding a particular solution to the circuit equations, as
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2113236374
