Relaxation techniques for the simulation of VLSI circuits
Relaxation techniques for the simulation of VLSI circuits
A flexible inner-outer preconditioned GMRES algorithm
SIAM Journal on Scientific Computing
Stable and efficient reduction of substrate model networks using congruence transforms
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
An Alternative Implementation of Variable Step-Size Multistep Formulas for Stiff ODEs
ACM Transactions on Mathematical Software (TOMS)
Efficient large-scale power grid analysis based on preconditioned krylov-subspace iterative methods
Proceedings of the 38th annual Design Automation Conference
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Simulation approaches for strongly coupled interconnect systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Jacobian-free Newton-Krylov methods: a survey of approaches and applications
Journal of Computational Physics
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
PRIMA: passive reduced-order interconnect macromodeling algorithm
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
TETA: transistor-level waveform evaluation for timing analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
In this paper, the Newton-Krylov method is explored for robust and efficient time-domain VLSI circuit simulation. Different from the LU-factorization based direct method, the Newton-Krylov method uses a preconditioned Krylov-subspace iterative method for linear system solving. Our key contribution is to introduce an effective quasi-Newton preconditioning scheme for Krylov-subspace methods to reduce the number and cost of LU factorizations during time-domain circuit simulation. Experimental results on a collection of digital, analog and RF circuits have shown that the quasi-Newton preconditioned Krylov-subspace method is as robust and accurate as SPICE3. The proposed Newton-Krylov method is especially attractive for simulating circuits with a large amount of parasitic RLC elements for post-layout verification.