Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Y. Chen Articles by V. Balakrishnan Articles by C. Koh Articles by K. Roy

2002 Design, Automation and Test in Europe Conference and Exhibition (DATE'02)

Paris, France

March 04-March 08

ISBN: 0-7695-1471-5

	ASCII Text	x
	Y. Chen, V. Balakrishnan, C. Koh, K. Roy, "Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods," Design, Automation and Test in Europe Conference and Exhibition, pp. 0931, 2002 Design, Automation and Test in Europe Conference and Exhibition (DATE'02), 2002.

	BibTex	x
	@article{ 10.1109/DATE.2002.998411, author = {Y. Chen and V. Balakrishnan and C. Koh and K. Roy}, title = {Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods}, journal ={Design, Automation and Test in Europe Conference and Exhibition}, volume = {0}, year = {2002}, isbn = {0-7695-1471-5}, pages = {0931}, doi = {http://doi.ieeecomputersociety.org/10.1109/DATE.2002.998411}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Design, Automation and Test in Europe Conference and Exhibition TI - Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods SN - 0-7695-1471-5 SP EP A1 - Y. Chen, A1 - V. Balakrishnan, A1 - C. Koh, A1 - K. Roy, PY - 2002 VL - 0 JA - Design, Automation and Test in Europe Conference and Exhibition ER -

Y. Chen

V. Balakrishnan

C. Koh

K. Roy

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DATE.2002.998411

We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of inter-connect networks. We derive expressions for the Laguerre coefficient matrices that minimize a weighted square of the approximation error, and show how these matrices can be computed efficiently using Krylov subspace methods. We discuss the connections between our method and other meth-ods such as PRIMA [4]. Numerical simulations show that our method can better approximate the original model as compared to PRIMA.

Citation:

Y. Chen, V. Balakrishnan, C. Koh, K. Roy, "Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods," date, pp.0931, 2002 Design, Automation and Test in Europe Conference and Exhibition (DATE'02), 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.