Title
Random Sampling of Moment Graph: A Stochastic Krylov-Reduction Algorithm
Abstract
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of the multi-parameter moment matching approach, leading to a computational technique based on random sampling of moment graph (RSMG). Using this technique, we have developed a new algorithm that combines the best aspects of recently proposed parameterized moment-matching and approximate TBR procedures. RSMG attempts to avoid both exponential growth of computational complexity and multiple matrix factorizations, the primary drawbacks of existing methods, and illustrates good ability to tailor algorithms to apply computational effort where needed. Industry examples are used to verify our new algorithms
Year
DOI
Venue
2007
10.1109/DATE.2007.364513
DATE
Keywords
Field
DocType
computational technique,stochastic processes,integrated circuit modelling,approximate tbr procedure,graph interpretation,moment graph,stochastic krylov-reduction algorithm,rsmg,exponential growth,random sampling of moment graph,multiple matrix factorizations,computational complexity,random sampling,model order reduction,method of moments,new algorithm,good ability,computational effort,multi parameter moment matching,best aspect,matrix factorization,parametric statistics,memory footprint,capacitance,energy optimization,reliability engineering,frequency,sampling methods,process variation,symmetric cipher
Mathematical optimization,Parameterized complexity,Computer science,Model order reduction,Matrix (mathematics),Algorithm,Stochastic process,Parametric statistics,Sampling (statistics),Energy minimization,Computational complexity theory
Conference
ISSN
ISBN
Citations 
1530-1591
978-3-9810801-2-4
11
PageRank 
References 
Authors
0.62
12
2
Name
Order
Citations
PageRank
Zhenhai Zhu115913.07
Joel Phillips2474.47