Time-domain steady-state analysis of nonlinear electrical systems

Time-domain steady-state analysis is based on an algebraic objective function obtained by numerical integration of a system of ordinary differential equations and a method for computing the zero or the fixed point of the objective function. This paper reviews the most important aspects of time-domain steady-state analysis. First, the formulation of network equations is discussed and properties of importance for steady-state analysis-smoothness and stability of the solution of the differential equations-are reviewed. A selection of objective functions is presented, and the properties of these functions are derived from the results on network equations. The objective functions are computed chiefly by numerical integration of the network equations, and since this is the computationally most expensive part of a steady-state analysis, the next section is devoted to the discussion of efficient integration methods specially suited for steady-state problems. The section concentrates on both classical backward-differentiation formulas and variants with improved stability and accuracy properties. The methods for solving the algebraic objective equations are traditionally termed quick steady-state methods. This paper considers Newton iteration, quasi-Newton optimization, and extrapolation. Because of the framework established in the previous sections, these methods can be dealt with in a fairly uniform manner, thus emphasizing the methods as algorithms for computing zeros or fixed points of algebraic objective functions. Finally, the methods are compared for rate of convergence, computational efficiency, and storage requirements.

[1]  T. Trick,et al.  Computation of capacitor voltage and inductor current sensitivities with respect to initial conditions for the steady-state analysis of nonlinear periodic circuits , 1975 .

[2]  S. Skelboe.  Implementation of chebyshevian linear multistep formulas , 1980 .

[3]  Albert E. Ruehli,et al.  The modified nodal approach to network analysis , 1975 .

[4]  W. Gautschi.  Numerical integration of ordinary differential equations based on trigonometric polynomials , 1961 .

[5]  Ibrahim N. Hajj,et al.  Steady-state analysis of piecewise-linear dynamic systems , 1981 .

[6]  Werner Liniger,et al.  Contractive methods for stiff differential equations Part II , 1978 .

[7]  T. Aprille,et al.  A computer algorithm to determine the steady-state response of nonlinear oscillators , 1972 .

[8]  Jiri Vlach,et al.  A piecewise harmonic balance technique for determination of periodic response of nonlinear systems , 1976 .

[9]  Stig Skelboe,et al.  Backward differentiation formulas with extended regions of absolute stability , 1981 .

[10]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[11]  E. S. Kuh,et al.  Piecewise-Linear Theory of Nonlinear Networks , 1972 .

[12]  G. Mühlbach.  Newton- und Hermite-Interpolation mit Čebyšev-Systemen , 1974 .

[13]  Stig Skelboe,et al.  The control of order and steplength for backward differentiation methods , 1977 .

[14]  J. M. Varah.  Stiffly Stable Linear Multistep Methods of Extended Order , 1978 .

[15]  W. Liniger,et al.  Multistep and one-leg methods for implicit mixed differential algebraic systems , 1979 .

[16]  T. Aprille,et al.  Steady-state analysis of nonlinear circuits with periodic inputs , 1972 .

[17]  Stig Skelboe,et al.  Computation of the periodic steady-state response of nonlinear networks by extrapolation methods , 1980 .

[18]  Ibrahim N. Hajj,et al.  Time-domain analysis of nonlinear systems with finite number of continuous derivatives , 1979 .

[19]  K. Burrage,et al.  Stability Criteria for Implicit Runge–Kutta Methods , 1979 .

[20]  D. C. Joyce.  Survey of Extrapolation Processes in Numerical Analysis , 1971 .

[21]  D. Zein,et al.  On the Periodic Steady-State Problem by the Newton Method , 1980 .

[22]  Rolf Jeltsch,et al.  Stiff Stability and Its Relation to $A_0 $- and $A(0)$-Stability , 1976 .

[23]  C. W. Gear,et al.  Simultaneous Numerical Solution of Differential-Algebraic Equations , 1971 .

[24]  R. Fletcher,et al.  A New Approach to Variable Metric Algorithms , 1970, Comput. J..

[25]  Germund Dahlquist,et al.  G-stability is equivalent toA-stability , 1978 .

[26]  Robert K. Brayton,et al.  The Sparse Tableau Approach to Network Analysis and Design , 1971 .

[27]  F. H. Branin,et al.  Determining the periodic response of nonlinear systems by a gradient method , 1977 .

[28]  H. Robertson,et al.  Some Properties of Algorithms for Stiff Differential Equations , 1975 .

[29]  T.B.M. Neill,et al.  Self-regulating Picard-type iteration for computing the periodic response of a nearly linear circuit to a periodic input , 1975 .

[30]  G. Dahlquist.  A special stability problem for linear multistep methods , 1963 .

[31]  N. Rumin,et al.  Computational technique for the periodic steady-state analysis of large nonlinear circuits , 1980 .

[32]  J. J. Bussgang,et al.  Analysis of nonlinear systems with multiple inputs , 1974 .

[33]  S. Cabay,et al.  A Polynomial Extrapolation Method for Finding Limits and Antilimits of Vector Sequences , 1976 .

[34]  Tom Lyche,et al.  Chebyshevian multistep methods for ordinary differential equations , 1972 .

[35]  P. Wynn,et al.  Acceleration techniques for iterated vector and matrix problems : (mathematics of computation, _1_6(1962), nr 79, p 301-322) , 1962 .

[36]  P. Wynn,et al.  On a Device for Computing the e m (S n ) Transformation , 1956 .

[37]  Alan C. Hindmarsh,et al.  A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations , 1975, TOMS.

[38]  S. Skelboe,et al.  Conditions for quadratic convergence of quick periodic steady-state methods , 1982 .