Accelerating the CBFM-enhanced jacobi method
© 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 cas...
| Main Authors: | , , , |
|---|---|
| Format: | Conference Paper |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/72056 |
| _version_ | 1848762647639490560 |
|---|---|
| author | Ludick, D. Botha, M. Maaskant, R. Davidson, David |
| author_facet | Ludick, D. Botha, M. Maaskant, R. Davidson, David |
| author_sort | Ludick, D. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | © 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. |
| first_indexed | 2025-11-14T10:50:54Z |
| format | Conference Paper |
| id | curtin-20.500.11937-72056 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:50:54Z |
| publishDate | 2017 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-720562018-12-13T09:34:51Z Accelerating the CBFM-enhanced jacobi method Ludick, D. Botha, M. Maaskant, R. Davidson, David © 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. 2017 Conference Paper http://hdl.handle.net/20.500.11937/72056 10.1109/ICEAA.2017.8065247 restricted |
| spellingShingle | Ludick, D. Botha, M. Maaskant, R. Davidson, David Accelerating the CBFM-enhanced jacobi method |
| title | Accelerating the CBFM-enhanced jacobi method |
| title_full | Accelerating the CBFM-enhanced jacobi method |
| title_fullStr | Accelerating the CBFM-enhanced jacobi method |
| title_full_unstemmed | Accelerating the CBFM-enhanced jacobi method |
| title_short | Accelerating the CBFM-enhanced jacobi method |
| title_sort | accelerating the cbfm-enhanced jacobi method |
| url | http://hdl.handle.net/20.500.11937/72056 |