View Item 

Accelerating the CBFM-enhanced jacobi method

Access Status
Fulltext not available
Authors
Ludick, D.
Botha, M.
Maaskant, R.
Davidson, David
Date
2017
Type
Conference Paper

Metadata
Show full item record
Citation
Ludick, D. and Botha, M. and Maaskant, R. and Davidson, D. 2017. Accelerating the CBFM-enhanced jacobi method, pp. 346-349.
Source Title
Proceedings of the 2017 19th International Conference on Electromagnetics in Advanced Applications, ICEAA 2017
DOI
ISBN
School
Curtin Institute of Radio Astronomy (Engineering)
URI
Collection
Abstract

© 2017 IEEE. The Characteristic Basis Function Method (CBFM)-enhanced Jacobi method has been introduced as an improvement to the standard iterative Jacobi method for finite array analysis. This technique is a domain decomposition approach based on the Method of Moments (MoM) formulation. In some cases, e.g. array environments with a low degree of mutual coupling, the runtime benefit of the CBFM-enhanced Jacobi method is not as significant when compared to that of the Jacobi technique. The reason for this is that additional computational overhead is introduced during each iteration, i.e. setting up and solving the CBFM reduced matrix equation. In this work the adaptive cross approximation (ACA) algorithm is used to accelerate this step in the CBFM-enhanced Jacobi method.