PARALLEL COMPUTATION OF MAGNETIC FIELDS

Abstract

In this paper, a parallel preconditioning technique based on the additive variant of overlapping domain decomposition is described and implemented to solve magnetostatic field problems. This technique involves covering the domain with a number of overlapping subdomains. The pre‐conditioner results from adding together approximate inversions on the subdomains, Theoretical estimates for the rate of convergence for the resulting algorithm are available and are based on the properties of underlying differential equations. Numerical experiments are given to demonstrate the effectiveness of this algorithm.

Citation

LEE, P., PASCIAK, J.E. and PISSANETZKY, S. (1991), "PARALLEL COMPUTATION OF MAGNETIC FIELDS", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 10 No. 1, pp. 45-55. https://doi.org/10.1108/eb010329