250 likes | 373 Vues
This paper introduces the Solenoidal Basis Method for efficient inductance extraction, addressing the challenges of inductance computation between current-carrying filaments. By employing a linear system that satisfies Kirchhoff’s law, the methodology invokes preconditioned Krylov subspace methods. Key developments include robust preconditioners and hierarchical approximations, leading to rapid convergence rates. The approach is benchmarked against established methods like FASTHENRY, demonstrating significant improvements in time and memory efficiency across diverse frequency ranges (1 GHz - 1 THz) and geometries such as ground planes and spiral inductors.
E N D
A Solenoidal Basis Method For Efficient Inductance ExtractionHemant MahawarVivek SarinWeiping ShiTexas A&M UniversityCollege Station, TX
Background • Inductance between current carrying filaments • Kirchoff’s law enforced at each node
Background … • Current density at a point • Linear system for current and potential • Inductance matrix • Kirchoff’s Law
Linear System of Equations • Characteristics • Extremely large; R, B: sparse; L: dense • Matrix-vector products with L use hierarchical approximations • Solution methodology • Solved by preconditioned Krylov subspace methods • Robust and effective preconditioners are critical • Developing good preconditioners is a challenge because system is never computed explicitly!
First Key Idea • Current Components • Fixed current satisfying external condition Id (left) • Linear combination of cell currents (right)
Solenoidal Basis Method • Linear system • Solenoidal basis • Basis for current that satisfies Kirchoff’s law • Solenoidal basis matrix P: • Current obeying Kirchoff’s law: • Reduced system • Solve via preconditioned Krylov subspace method
Local Solenoidal Basis • Cell current k consists of unit current assigned to the four filaments of the kth cell • There are four nonzeros in the kth column of P: 1, 1, -1, -1
Second Key Idea • Observe: where • Approximate reduced system • Approximate by
Preconditioning • Preconditioning involves multiplication with
Hierarchical Approximations • Components of system matrix and preconditioner are dense and large • Hierarchical approximations used to compute matrix-vector products with both L and • Used for fast decaying Greens functions, such as 1/r (r : distance from origin) • Reduced accuracy at lower cost • Examples • Fast Multipole Method: O(n) • Barnes-Hut: O(nlogn)
FASTHENRY • Uses mesh currents to generate a reduced system • Approximation to reduced system computed by sparsification of inductance matrix • Preconditioner derived from • Sparsification strategies • DIAG: self inductance of filaments only • CUBE: filaments in the same oct-tree cube of FMM hierarchy • SHELL: filaments within specified radius (expensive)
Experiments • Benchmark problems • Ground plane • Wire over plane • Spiral inductor • Operating frequencies: 1GHz-1THz • Strategy • Uniform two-dimensional mesh • Solenoidal function method • Preconditioned GMRES for reduced system • Comparison • FASTHENRY with CUBE & DIAG preconditioners
Comparison with FastHenry Preconditioned GMRES Iterations (10GHz)
Comparison … Time and Memory (10GHz)
Preconditioner Effectiveness Preconditioned GMRES iterations
Comparison with FastHenry Preconditioned GMRES Iterations (10GHz)
Comparison … Time and Memory (10GHz)
Preconditioner Effectiveness Preconditioned GMRES iterations
Preconditioner Effectiveness Preconditioned GMRES iterations
Concluding Remarks • Preconditioned solenoidal method is very effective for linear systems in inductance extraction • Near-optimal preconditioning assures fast convergence rates that are nearly independent of frequency and mesh width • Significant improvement over FASTHENRY w.r.t. time and memory Acknowledgements: National Science Foundation