Efficient linear circuit analysis by Pade approximation via the Lanczos process
P. Feldmann, R.W. Freund · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1995
In this paper, we introduce PVL, an algorithm for computing the Pade approximation of Laplace-domain transfer functions of large linear networks via a Lanczos process. The PVL algorithm has significantly superior numerical stability, while retaining the same efficiency as algorithms that compute the Pade approximation directly through moment matching, such as AWE and its derivatives. As a consequence, it produces more accurate and higher-order approximations, and it renders unnecessary many of the heuristics that AWE and its derivatives had to employ. The algorithm also computes an error bound that permits to identify the true poles and zeros of the original network. We present results of numerical experiments with the PVL algorithm for several large examples.>
Cited by 1,347 works. doi:10.1109/43.384428
Authors
References
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
- Asymptotic waveform evaluation for timing analysis
- Equivalent Circuit Models for Three-Dimensional Multiconductor Systems
- Computer Methods for Circuit Analysis and Design
- A 27MHz Mixed Analog/digital Magnetic Recording Channel DSP Using Partial Response Signalling With Maximum Likelihood Detection
- Reduced-order modeling of large linear subcircuits via a block Lanczos algorithm
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- AWESpice: a general tool for the accurate and efficient simulation of interconnect problems
- AWESpice: a general tool for the accurate and efficient simulation of interconnect problems
- Matrix interpretations and applications of the continued fraction algorithm