z-logo
Premium
Charge iteration: A procedure for the finite element computation of unbounded electrical fields
Author(s) -
Aiello G.,
Alfonzetti S.,
Coco S.
Publication year - 1994
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620372403
Subject(s) - computation , finite element method , context (archaeology) , boundary value problem , convergence (economics) , boundary (topology) , electrical conductor , computer science , rotational symmetry , bounded function , mathematics , field (mathematics) , mathematical optimization , algorithm , mathematical analysis , geometry , engineering , structural engineering , electrical engineering , paleontology , pure mathematics , economics , biology , economic growth
An iterative procedure is presented for the finite element computation of unbounded electrical fields created by voltaged conductors. The procedure is based on successive evaluations of the potential on a fictitious boundary enclosing all the conductors, according to the charge lying on their surface. The convergence of the procedure to the solution of the unbounded field problem is demonstrated. Indications for the optimal placement of the fictitious boundary are provided, also taking into account the accuracy of the solution. The way in which computational efficiency can be reached is also discussed. The main advantage of this procedure lies in its simplicity of implementation in the context of a standard FE code for bounded problems, because a very limited amount of additional software is required; moreover, 2‐D and axisymmetric versions can be implemented with minor changes from a suitable 3‐D one. Examples of application are given in order to illustrate the practical use of the procedure and to validate it by comparisons with available solutions.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here