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

DOI10.1108/03321640210416377zbMATH Open0996.78012OpenAlexW2047926336MaRDI QIDQ4537270FDOQ4537270

Authors: Irina Munteanu, Cătălin Ciobotaru, Daniel Ioan 

Publication date: 6 November 2002

Published in: COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03321640210416377

Recommendations

• Nonlinear simulation of electromagnetic fields with domain decomposition methods on MIMD parallel computers
• scientific article; zbMATH DE number 671771
• scientific article; zbMATH DE number 437452
• Fast linear equation solvers in high performance electromagnetic field analysis
• A numerical solution for the nonlinear diffusion equation of the electromagnetic field in ferromagnetic materials

zbMATH Keywords

finite element methodnonlinear magnetic field equations

Mathematics Subject Classification ID

Electro- and magnetostatics (78A30) Finite element, Galerkin and related methods applied to problems in optics and electromagnetic theory (78M10)

Cites Work

• Triangle search method for nonlinear electromagnetic field computation

Cited In (3)

• Speed-up of nonlinear magnetic field analysis using a modified fixed-point method
• Title not available (Why is that?)
• Finite-difference modeling of nonlinear phenomena in time-domain electromagnetics: a review

This page was built for publication: Reducing the complexity order of the algorithms for magnetic field nonlinear problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537270)