cient Linear Circuit Analysis by Pad e Approximation via the Lanczos Process
نویسندگان
چکیده
This paper describes a highly e cient algorithm for the iterative computation of dominant poles and zeros of large linear networks. The algorithm is based on a new implementation of the Pad e approximation via the Lanczos process. This implementation has superior numerical properties, maintains the same computational e ciency as its predecessors, and provides a bound on the approximation error.
منابع مشابه
Stable and Passive Reduced-order Models Based on Partial Pad E Approximation via the Lanczos Process
This paper describes the use of partial Pad e approximation to generate stable and passive reduced-order models of linear circuits. For similarly-sized models, partial Pad e-based reduced-oreder modeling has superior moment-matching capabilities than competing techniques based on the Arnoldi process. The paper introduces PVL, an algorithm for computing partial Pad e-based reduced-order models v...
متن کاملcient Small - Signal Circuit Analysis and Sensitivity Computations with the PVL Algorithm
We describe the application of the PVL algorithm to the small-signal analysis of circuits, including sensitivity computations. The PVL algorithm is based on the e cient computation of the Pad e approximation of the network transfer function via the Lanczos process. The numerical stability of the algorithm permits the accurate computation of the Pad e approximation over any given frequency range...
متن کاملA Coordinate-transformed Arnoldi Algorithm for Generating Guaranteed Stable Reduced-order Models of Arbitrary Rlc Circuits
Since the rst papers on asymptotic waveform evaluation (AWE), Pad e-based reduced order models have become standard for improving coupled circuit-interconnect simulation eeciency. Such models can be accurately computed using bi-orthogonalization algorithms like Pad e via Lanczos (PVL), but the resulting Pad e approximates can still be unstable even when generated from stable RLC circuits. For c...
متن کاملSmall-Signal Circuit Analysis and Sensitivity Computations with the PVL Algorithm
We describe the application of the PVL algorithm to the small-signal analysis of circuits, including sensitivity computations. The PVL algorithm is based on the eecient computation of the Pad e approximation of the network transfer function via the Lanczos process. The numerical stability of the algorithm permits the computation of the Pad e approximation to any accuracy over a certain frequenc...
متن کاملTranspose-free Matrix Pad e Via Lanczos Method
A transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting vectors on both the left and right. The method is applied to the computation of the matrix Pad e approximation to a linear dynamical system. The result is a method which can be labeled Transpose-Free Matrix Pad e Via Lanczos. The method is mathematically equivalent to the two-sided methods, but avoids the ...
متن کامل