Iterative solution for dense linear systems arising in computational electromagnetics
Changhong Liang
Abstract
Changhong Liang
Abstract
This paper discusses some preconditions with Krylov methods for the solutoin of large dense complex symmetric nonHermitian systems arising in computational elecetromagnetics. Many tests show that BICGSTAB or GMRES Krylov subspace methods preconditioned with ILUT are quite efficient for this class of application. They can deliver a good rate of convergence but their construction and storage are not expensive.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper discusses some preconditions with Krylov methods for the solutoin of large dense complex symmetric nonHermitian systems arising in computational elecetromagnetics. Many tests show that BICGSTAB or GMRES Krylov subspace methods preconditioned with ILUT are quite efficient for this class of application. They can deliver a good rate of convergence but their construction and storage are not expensive.
Key concepts: Biconjugate gradient stabilized method, Krylov subspace, Generalized minimal residual method, Linear system, Computer science, Applied mathematics, Convergence (economics), Iterative method