ACM Home Page
Please provide us with feedback. Feedback
Model reduction of time-varying linear systems using approximate multipoint Krylov-subspace projectors
Full text PdfPdf (786 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 96 - 102  
Year of Publication: 1998
ISBN:1-58113-008-2
Author
Joel R. Phillips  Cadence Design Systems, San Jose, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
IEEE-EDS : Electronic Devices Society
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 33,   Citation Count: 9
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/288548.288583
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
George A. Baker Jr. and Peter Graves-Morris. Pad~ Approximants Part I: Basic Theory. Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company, Reading, MA, First edition, 198 I.
 
2
Eli Chiprout and Michel S. Nakhla. Analysis of interconnect networks using complex frequency hopping (CFH). IEEE Trans. CAD, 14:186--200, February 1995.
 
3
Henry D'Angelo. Linear Time-Varying Systems. Allyn and Bacon, Boston, 1970.
 
4
C. de Villemagne and R. E. Skelton. Model reduction using a projection formulation. Int. J. Control 46:2141-2169,1987.
 
5
 
6
 
7
Peter Feldmann and Roland W. Freund. Efficient linear circuit analysis by Pad6 approximation via the Lanczos process.lEEE Trans. CAD, 14:639-649,May 1995.
 
8
D. Feng. unpublished.
 
9
K. Gallivan, E. Grimme, and P. Van Dooren. Multi-point pad6 approximants of large-scale systems via a two-sided rational krylov algorithm. In 33 IEEE Conference on Decision and Control, Lake Buena Vista, FL, December 1994.
 
10
William B. Gragg. Matrix interpretations and applications of the continued fraction algorithm. Rock'), Mountain Journal of Mathematics, 4(2):213-225, 1974.
 
11
Eric J. Grimme. Krylov projection methods for model re&wtion. PhD thesis, University of Illinois at Urbana-Champaign, 1997.
 
12
Chung-Wcn Ho, Albert E. Ruehli, and Pierce A. Brennan. The modified nodal approach to network analysis. IEEE Transactions on Circuits and Systems, 22(6):504-509, June 1975.
 
13
T. Kato. Perturbation Theor3'for Linear Operators. Springer- Verlag, New York, 1995.
 
14
 
15
H. Tanimoto M. Okumura, T. Itakura, and T. Sugawara. Numerical noise analysis for nonlinear circuits with a periodic large signal excitation including cyclostationary noise sources. IEEE Trans. Circuits and Systems - L 40:581-590, 1993.
 
16
 
17
 
18
Lawrence T. Pillage and Ronald A. Rohrer. Asymptotic Waveform Evaluation for Timing Analysis. IEEE Transactions on Computer-Aided Design, 9(4):352-366, April 1990.
19
 
20
J. Roychowdhury. Mpde methods for efficient analysis of wireless systems. In Proceedings of the 1998 Custom Integrated Circuits Conference, pages 451-454, Santa Clam, CA, Mayy 1998.
 
21
J. Roychowdhury, D. Long, and P. Feldmann. Cyclostationary noise analysis of large RF circuits with multitone excitations. IEEE Journal Solid-State Circuits, 33:324-336, March 1998.
 
22
A. Ruhe. The rational Krylov algorithm for nonsymmetric eigenvalueproblems Iii: complex shifts for real matrices. B/T, 34:165-176, 1994.
 
23
24
 
25
26
27
 
28
R. Telichevesky, J. White, and K. Kundert. Receiver characterization using periodic small-signal analysis. In International Custom Integrated Circuits Conference, May 1996.
 
29
 
30
E. I. Verriest and T. Kailath. On generalized balanced realizations. IEEE Transactions on Automatic Control, 28:833-844, 1983.
 
31
L. Zadeh. Frequency analysis of variable networks. Proc. I.R.E., pages 291-299, March 1950.

CITED BY  9