Logo del repository
  1. Home
 
Opzioni

Optimal cohomology generators for 2d eddy-current problems in linear time

SPECOGNA, Ruben
2013
  • journal article

Periodico
IEEE TRANSACTIONS ON MAGNETICS
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.
DOI
10.1109/TMAG.2012.2222905
WOS
WOS:000316805400003
Archivio
http://hdl.handle.net/11390/869107
info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-84875633970
http://dx.doi.org/10.1109/TMAG.2012.2222905
Diritti
closed access
Soggetti
  • Finite Element Method...

  • cohomology generator

  • complementarity

  • eddy-current

  • source field

  • thick cuts

Scopus© citazioni
4
Data di acquisizione
Jun 7, 2022
Vedi dettagli
Web of Science© citazioni
4
Data di acquisizione
Mar 11, 2024
Visualizzazioni
3
Data di acquisizione
Apr 19, 2024
Vedi dettagli
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback