Reducing the complexity order of the algorithms for magnetic field nonlinear problems

Abstract

The numerical solution of electromagnetic field nonlinear problems requires successive building and solving of linear systems of equations. This is the most time–consuming part, especially for large problems. Both fast linear solvers and efficient nonlinear iterative algorithms, are critical for the overall efficiency of the nonlinear electromagnetic field solver. This paper presents an analysis of a variety of techniques that can be efficiently used to reduce the solution time of nonlinear magnetic field equations in large finite element method (FEM) problems.

Citation

Munteanu, I., Ciobotaru, C. and Ioan, D. (2002), "Reducing the complexity order of the algorithms for magnetic field nonlinear problems", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 21 No. 2, pp. 286-295. https://doi.org/10.1108/03321640210416377