The aim of this paper is to present an automatic and efficient algorithm to find cohomology generators suitable for 2d eddycurrent problems formulated by means of complementary formulations. The algorithm is general, straightforward to implement, exhibits a linear worst-case computational complexity and produces optimal representatives of generators. By optimal we mean the representatives that minimize in practical cases the fill-in of the system of equations matrix and guarantee that the current flowing in each conductor is in one-to-one correspondence with a generator. As a numerical example, the complementary formulations are used to compute the frequency-dependent per-unit-length impedance in integrated circuits.
Optimal cohomology generators for 2d eddy-current problems in linear time
SPECOGNA, Ruben
2013-01-01
Abstract
The aim of this paper is to present an automatic and efficient algorithm to find cohomology generators suitable for 2d eddycurrent problems formulated by means of complementary formulations. The algorithm is general, straightforward to implement, exhibits a linear worst-case computational complexity and produces optimal representatives of generators. By optimal we mean the representatives that minimize in practical cases the fill-in of the system of equations matrix and guarantee that the current flowing in each conductor is in one-to-one correspondence with a generator. As a numerical example, the complementary formulations are used to compute the frequency-dependent per-unit-length impedance in integrated circuits.| File | Dimensione | Formato | |
|---|---|---|---|
|
ieee_tmag_2d_cohomology.pdf
non disponibili
Tipologia:
Altro materiale allegato
Licenza:
Non pubblico
Dimensione
1.28 MB
Formato
Adobe PDF
|
1.28 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
