Krylov subspace based moment matching algorithms, such as PVL (Padé approximation Via the Lanczos process), have emerged as popular tools for efficient analyses of the impulse response in a large linear circuit. In this work, a new derivation of the PVL algorithm is presented from the matrix point of view. This approach simplifies the mathematical theory and derivation of the algorithm. Moreover, an explicit formulation of the approximation error of the PVL algorithm is given. With this error expression, one may implement the PVL algorithm that adaptively determines the number of Lanczos steps required to satisfy a prescribed error tolerance. A number of implementation issues of the PVL algorithm and its error estimation are also addressed in this paper. A generalization to a multiple-input-multiple-output circuit system via a block Lanczos process is also given.

Document Type


Publication Date


Notes/Citation Information

Published in Electronic Transactions on Numerical Analysis, v. 7, p. 1-17.

Copyright © 1998, Kent State University.

The copyright holder has granted the permission for posting the article here.

Funding Information

This work was supported in part by NSF grant ASC-9313958 and by a research grant from NSERC of Canada.

Included in

Mathematics Commons