Relaxation techniques for the simulation of VLSI circuits
Relaxation techniques for the simulation of VLSI circuits
Numerical Initial Value Problems in Ordinary Differential Equations
Numerical Initial Value Problems in Ordinary Differential Equations
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Hi-index | 0.98 |
Relaxation-based techniques for the transient analysis of large-scale integrated circuits are promising candidates for a new generation of circuit simulators. The present note investigates the convergence of the discretized waveform relaxation. It is demonstrated that a SOR technique has the potential of beeing significantly faster than the conventional waveform relaxation Gauss-Seidel method. The determination of the optimal relaxation parameter is decisive and is discussed for the case of a general linear model problem.