Tree relaxation: a new iterative solution method for linear equations
C. Shi, K. Zhang · 2003
In the tree relaxation (TR) method, a network is first partitioned into a tree and links. The portions of the equations associated with links are relaxed, and the portions associated with the tree can be solved efficiently with an incremental linear algorithm. It has been shown that the proposed relaxation method has better convergence property than Gauss-Jacobi and Gauss-Seidel methods for the tree-structure dominant network. TR encounters no special problems with floating elements, which provides a way to deal with the floating-capacitance problem in conventional relaxation-based circuit simulation.>