To read the full version of this content please select one of the options below:

PARALLEL COMPUTATION OF MAGNETIC FIELDS

P. LEE (Schlumberger Laboratory for Computer Science, 8311 North 620 RR, Austin, TX 78720, U.S.A., Department of Applied Science, Brookhaven National Laboratory, Upton, NY 11973, U.S.A.)
J.E. PASCIAK (Schlumberger Laboratory for Computer Science, 8311 North 620 RR, Austin, TX 78720, U.S.A., Department of Applied Science, Brookhaven National Laboratory, Upton, NY 11973, U.S.A.)
S. PISSANETZKY (Schlumberger Laboratory for Computer Science, 8311 North 620 RR, Austin, TX 78720, U.S.A., Texas Accelerator Center, Building 2, The Woodlands, TX 77381, U.S.A.)

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

Publisher

:

MCB UP Ltd

Copyright © 1991, MCB UP Limited