| Paper: | DISPS-P1.2 | ||
| Session: | VLSI Algorithms and Architectures for DSP | ||
| Time: | Friday, May 21, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Design and Implementation of Signal Processing Systems: Fast Algorithms | ||
| Title: | A FAST NEWTON/SMITH ALGORITHM FOR SOLVING ALGEBRAIC RICCATI EQUATIONS AND ITS APPLICATION IN MODEL ORDER REDUCTION | ||
| Authors: | Ngai Wong; University of Hong Kong | ||
| Venkataramanan Balakrishnan; Purdue University | |||
| Cheng-Kok Koh; Purdue University | |||
| Tung-Sang Ng; University of Hong Kong | |||
| Abstract: | A very fast Smith-method-based Newton algorithm is introduced for the solution of large-scale continuous-time algebraic Riccati equations (CAREs). When the CARE contains low-rank matrices, as is common in the modeling of physical systems, the proposed algorithm, called the Newton/Smith CARE or NSCARE algorithm, offers significant computational savings over conventional CARE solvers. Effectiveness of the algorithm is demonstrated in the context of VLSI model order reduction wherein stochastic balanced truncation (SBT) is used to reduce large-scale passive circuits. It is shown that the NSCARE algorithm exhibits guaranteed quadratic convergence under mild assumptions. Moreover, two large-sized matrix factorizations and one large-scale singular value decomposition (SVD) necessary for SBT can be omitted by utilizing the Smith method output in each Newton iteration, thereby significantly speeding up the model reduction process. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops