Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be useful in computational electromagnetics. The aim of this paper is to give a rigorous description of the GSTT in terms of homology and cohomology theories, together with an analysis of its termination. In particular, the authors aim to show, by concrete counterexamples, that various problems related with both STT and GSTT algorithms exist. The counterexamples clearly demonstrate that the failure of STT and GSTT is not an exceptional event, but something that routinely occurs in practical applications.
Critical analysis of the spanning tree techniques
SPECOGNA, Ruben
2010-01-01
Abstract
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be useful in computational electromagnetics. The aim of this paper is to give a rigorous description of the GSTT in terms of homology and cohomology theories, together with an analysis of its termination. In particular, the authors aim to show, by concrete counterexamples, that various problems related with both STT and GSTT algorithms exist. The counterexamples clearly demonstrate that the failure of STT and GSTT is not an exceptional event, but something that routinely occurs in practical applications.File | Dimensione | Formato | |
---|---|---|---|
090766334.pdf
non disponibili
Tipologia:
Altro materiale allegato
Licenza:
Non pubblico
Dimensione
680.32 kB
Formato
Adobe PDF
|
680.32 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.