Date Added: Dec 2011
It is increasingly challenging to analyze present day large-scale Power Delivery Networks (PDNs) due to the drastically growing complexity in power grid design. To achieve greater runtime and memory efficiencies, a variety of preconditioned iterative algorithms has been investigated in the past few decades with promising performance, while incremental power grid analysis also becomes popular to facilitate fast re-simulations of corrected designs. Although existing preconditioned solvers, such as incomplete matrix factor-based pre-conditioners, usually exhibit high efficiency in memory usage, their convergence behaviors are not always satisfactory. In this paper, the authors present a novel hierarchical support-graph preconditioned iterative algorithm that constructs pre-conditioners by generating spanning trees in power supply networks for fast power grid analysis.