|
Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10204/3599
|
| Title: | On grouping individual wire segments into equivalent wires or chains, and introduction of multiple domain basis functions |
| Authors: | Lysko, AA |
| Keywords: | Wire segments Equivalent wires Multiple Domain Basis Functions MDBF Meander monopole Splitting algorithms Computations Wires Chains Radio science |
| Issue Date: | Jun-2009 |
| Publisher: | IEEE |
| Citation: | Lysko, AA. 2009. On grouping individual wire segments into equivalent wires or chains, and introduction of multiple domain basis functions. IEEE International Symposium on Antennas & Propagation and USNC/URSI National Radio Science Meeting, North Charleston, South Carolina, USA, 1-5 June, 2009. pp 1-4 |
| Abstract: | The paper introduces a method to cover several wire segments with a single basis function, describes related practical algorithms, and gives some results. The process involves three steps: identifying chains of wire segments, splitting the chains into shorter sub-chains, and assigning basis functions to the resulting geometrical structures. The method may improve efficiency of computations when modeling complex curved and quasi-static structures. In addition, the approach extends the boundaries of applicability for a thin wire kernel. An example is considered comparing three different splitting algorithms. |
| Description: | This paper was presented at IEEE International Symposium on Antennas & Propagation and USNC/URSI National Radio Science Meeting, North Charleston, South Carolina, USA, 1-5 June 2009 |
| URI: | http://hdl.handle.net/10204/3599 |
| ISBN: | 978424436477 |
| Appears in Collections: | High performance computing Wireless technologies Advanced mathematical modelling and simulation General science, engineering & technology
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|