Comparison of quasi minimal residual and bi‐conjugate gradient iterative methods to solve complex symmetric systems arising from time‐harmonic magnetic simulations

DOI10.1108/03321649910274874zbMath0946.78507OpenAlexW2092281667MaRDI QIDQ4700668

Kay Hameyer, Herbert De Gersem, Stefan Vandewalle, Domenico Lahaye

Publication date: 25 October 2000

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/03321649910274874

zbMATH Keywords

finite element methoditerative methodsKrylov subspace methodsmagnetostaticsbi-conjugate gradient methodquasi minimal residual method

Mathematics Subject Classification ID

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

Related Items (1)

Eddy currents in a transverse MRI gradient coil

Cites Work

• Unnamed Item
• New look-ahead Lanczos-type algorithms for linear systems
• Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices

This page was built for publication: Comparison of quasi minimal residual and bi‐conjugate gradient iterative methods to solve complex symmetric systems arising from time‐harmonic magnetic simulations