## Reduced-order modeling of large linear subcircuits via a block Lanczos algorithm (1995)

Venue: | In Proc. 32nd ACM/IEEE Design Automation Conf |

Citations: | 71 - 21 self |

### BibTeX

@INPROCEEDINGS{Feldmann95reduced-ordermodeling,

author = {P. Feldmann and R. W. Freund},

title = {Reduced-order modeling of large linear subcircuits via a block Lanczos algorithm},

booktitle = {In Proc. 32nd ACM/IEEE Design Automation Conf},

year = {1995},

pages = {474--479}

}

### Years of Citing Articles

### OpenURL

### Abstract

A method for the e�cient computation of accu� rate reduced�order models of large linear circuits is de� scribed. The method � called MPVL � employs a novel block Lanczos algorithm to compute matrix Pad�e ap� proximations of matrix�valued network transfer func� tions. The reduced�order models � computed to the re� quired level of accuracy � are used tospeed up the anal� ysis of circuits containing large linear blocks. The lin� ear blocks are replaced by their reduced�order models� and the resulting smaller circuit can be analyzed with general�purpose simulators � with signi�cant savings in simulation time and � practically � no loss of accuracy. 1

### Citations

412 |
Asymptotic waveform evaluation for timing analysis
- Pillage, Rohrer
- 1990
(Show Context)
Citation Context ...l savings and can tackle problems of sizes that are out of the reach of conventional simulators. Such a method was implemented in AWESpice [1] where the Asymptotic Waveform Evaluation (AWE) algorithm =-=[2, 3]-=- was used to analyze and approximate the linear subcircuit. In AWESpice, all the moments of the linear subcircuit are first generated through an efficient recursive procedure. Then, moment matching is... |

391 | An iteration method for the solution of the eigenvalue problem of linear differential and integral
- LANCZOS
- 1950
(Show Context)
Citation Context ...function simultaneously. This method is based on a novel block Lanczos algorithm. 3 A Block Lanczos Algorithm The block Lanczos algorithm we use is a generalization of the classical Lanczos algorithm =-=[7]-=-. We only state the block Lanczos algorithm in its simplest form; a more sophisticated version that incorporates deflation and look-ahead techniques is described in detail in [8]. The algorithm genera... |

233 | Efficient linear circuit analysis by Padé approximation via the Lanczos process
- Feldmann, RW
- 1993
(Show Context)
Citation Context ...ttance matrix is used in a modified SPICE simulator to represent the large linear subnetwork. The moment-matching phase of the AWE algorithm, however, has inherent numerical limitations, discussed in =-=[4]-=-, which restrict its applicability to linear subcircuits that can be modeled accurately using only a relatively small number of poles. In this paper, we introduce a new algorithm called MPVL (Matrix P... |

120 |
K.Singhal, Computer Methods for Circuit Analysis and Design
- Vlach
- 1983
(Show Context)
Citation Context ...ircuits with MPVL 3 L N x x L N y u Figure 1: Circuit partitioning 2 Macromodels Generated from PVL Using any circuit-equation formulation method such as modified nodal analysis, sparse tableau, etc. =-=[6]-=-, a circuit can be described by the following system of first-order differential equations: d dtsq(z; t) +sf (z; t) = 0: (1) Here, z = z(t) is the vector of circuit variables at time t, the term f(z; ... |

19 |
A Lanczos-type algorithm for multiple starting vectors,” revised version, Numerical Analysis Manuscript No. 98–3–05
- Aliaga, Boley, et al.
- 1998
(Show Context)
Citation Context ...cal Lanczos algorithm [7]. We only state the block Lanczos algorithm in its simplest form; a more sophisticated version that incorporates deflation and look-ahead techniques is described in detail in =-=[8]-=-. The algorithm generates two sequences of vectors v 1 ; v 2 ; : : : ; v k and w 1 ; w 2 ; : : : ; w k (27) that, for each k = 1; 2; : : :, build bases for the spaces spanned by the first k vectors of... |

18 |
AWESpice: A General Tool for the Accurate and Efficient Simulation of Interconnect
- Raghavan, Bracken, et al.
- 1992
(Show Context)
Citation Context ...aller. The overall approach results in important computational savings and can tackle problems of sizes that are out of the reach of conventional simulators. Such a method was implemented in AWESpice =-=[1]-=- where the Asymptotic Waveform Evaluation (AWE) algorithm [2, 3] was used to analyze and approximate the linear subcircuit. In AWESpice, all the moments of the linear subcircuit are first generated th... |

17 | Ecient small-signal circuit analysis and sensitivity computations with the PVL algorithm
- Freund, Feldmann
- 1994
(Show Context)
Citation Context ...to contain all frequencies of interest. The Pad'e approximation embodied by matrix T k was used in [4] to compute the dominant poles, zeros, and residues of a linear system, and was differentiated in =-=[5]-=- in order to compute various sensitivities. We show that the same matrix T k matrix contains the necessary information to compute the reduced-order model of the one-port. By applying the substitutions... |

12 | Ecient Linear Circuit Analysis by Pade Approximation via the Lanczos Process - Feldmann, Freund - 1993 |

7 |
Alaybeyi, "AWE-inspired
- Raghavan, Rohrer, et al.
- 1993
(Show Context)
Citation Context ...l savings and can tackle problems of sizes that are out of the reach of conventional simulators. Such a method was implemented in AWESpice [1] where the Asymptotic Waveform Evaluation (AWE) algorithm =-=[2, 3]-=- was used to analyze and approximate the linear subcircuit. In AWESpice, all the moments of the linear subcircuit are first generated through an efficient recursive procedure. Then, moment matching is... |

3 | An iteration method for the solution of the eigenvalue problem of linear differential and integral operators - unknown authors - 1950 |

1 | E�cient small� signal circuit analysis and sensitivity computations with the PVL algorithm - Feldmann� - 1994 |