Matthys Michiel Botha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Matthys Michiel Botha has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- David Bruce Davidson
International Centre for Radio Astronomy Research, Curtin University, Perth, WA, Australia
14 shared publications Jian-Ming Jin
Dept. of Electr. & Comput. Eng., Univ. of Illinois, Urbana, IL, USA
6 shared publications- Thomas Rylander
Department of Electrical Engineering Chalmers University of Technology Göteborg Sweden
4 shared publications - André S. Conradie
Department of Electrical and Electronic Engineering, Stellenbosch University, Stellenbosch, South Africa
3 shared publications D. P. Xiang
Department of Electrical and Electronic Engineering, Stellenbosch University, Stellenbosch, South Africa
3 shared publicationsDao P. Xiang
Department of Electrical and Electronic Engineering, Stellenbosch University, Stellenbosch, South Africa
3 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electromagnetic Compatibility
- Vol. 68 (5) , 1-13
Stabilized Macro Basis Function MoM for Wideband Analysis of Wire Coupling
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electromagnetic Compatibility
- Vol. 68 (5) , 1-13
Stabilized Macro Basis Function MoM for Wideband Analysis of Wire Coupling
- 2 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (11) , 8621-8634
Macro Basis Function Methods With Multilevel DCA Acceleration for Antenna Array Analysis
The efficient method of moments (MoM) analysis of very large antenna arrays of disjoint elements, using macro basis function (MBF) schemes, is considered. Directional cross approximation (DCA), which is a nested, multilevel, algebraic, low-rank factorization scheme suitable for electrically large structures, is used for fast reduced MBF matrix setup and matrix-vector products (MVPs). A DCA far-field sampling strategy suitable for planar arrays is employed. Optimal log-linear DCA memory scaling is demonstrated. The performance of static MBF formulations is investigated, namely, the characteristic basis function method (CBFM) and windowed MBF (WMBF) schemes, which establish MBFs once as a preprocessing step. Static MBF approximation errors are difficult to control. Dynamic MBFs are iteratively refined to obtain a solution within user-specified error tolerance. Residual-driven (RD) CBFM, RD WMBFs, RD Krylov subspace MBFs, and block-Jacobi MBFs (both original and RD) are considered. Effective solution accuracy control is demonstrated. Runtime of all schemes is studied. Given optimal DCA acceleration, the results give a realistic view of relative efficiencies. Static MBFs are much less efficient than dynamic ones. Among dynamic schemes, RD static MBFs are less efficient. Krylov MBFs can perform better than the original block-Jacobi scheme, but the latter requires no parameter choice. RD block-Jacobi and a hybrid Krylov-Jacobi (K-J) scheme sometimes outperform all others.
- 2 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (11) , 8621-8634
Macro Basis Function Methods With Multilevel DCA Acceleration for Antenna Array Analysis
The efficient method of moments (MoM) analysis of very large antenna arrays of disjoint elements, using macro basis function (MBF) schemes, is considered. Directional cross approximation (DCA), which is a nested, multilevel, algebraic, low-rank factorization scheme suitable for electrically large structures, is used for fast reduced MBF matrix setup and matrix-vector products (MVPs). A DCA far-field sampling strategy suitable for planar arrays is employed. Optimal log-linear DCA memory scaling is demonstrated. The performance of static MBF formulations is investigated, namely, the characteristic basis function method (CBFM) and windowed MBF (WMBF) schemes, which establish MBFs once as a preprocessing step. Static MBF approximation errors are difficult to control. Dynamic MBFs are iteratively refined to obtain a solution within user-specified error tolerance. Residual-driven (RD) CBFM, RD WMBFs, RD Krylov subspace MBFs, and block-Jacobi MBFs (both original and RD) are considered. Effective solution accuracy control is demonstrated. Runtime of all schemes is studied. Given optimal DCA acceleration, the results give a realistic view of relative efficiencies. Static MBFs are much less efficient than dynamic ones. Among dynamic schemes, RD static MBFs are less efficient. Krylov MBFs can perform better than the original block-Jacobi scheme, but the latter requires no parameter choice. RD block-Jacobi and a hybrid Krylov-Jacobi (K-J) scheme sometimes outperform all others.
- 12 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (8) , 6584-6598
Preconditioned Localized-Solution Iterative Solver With Nested Cross Approximation for Large Arrays
A localized solution-based iterative solver for method of moments (MoM) analysis of large antenna arrays with disjoint, non-identical elements is presented. The formulation introduces computational cost reducing extensions for the direct coupling technique (DCT), which is a domain decomposition method (DDM) whereby element-associated overlapping local problems are iteratively solved. A residual-driven formulation improves convergence and enables matrix sparsification. Macro basis functions are incorporated, with convergence to user-specified error tolerance maintained. Through near-interaction preconditioning, local domain extensions are rendered implicit, removing the need for overlapping local solutions. A single-level, hybrid nested cross approximation (NCA) acceleration scheme is employed. Rapid, controllable convergence is demonstrated for very large arrays. Faster runtimes than with the multilevel fast multipole method (MLFMM) in the commercial FEKO software suite, are demonstrated. Convergence rate is practically independent of excitation, including scattering analysis. The capability of preconditioner and local matrices being independent of excitation and iteration, enables efficient solution of multiple right-hand sides, e.g. for embedded element pattern (EEP) computations. The solver is well suited to parallelization.
- 12 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (8) , 6584-6598
Preconditioned Localized-Solution Iterative Solver With Nested Cross Approximation for Large Arrays
A localized solution-based iterative solver for method of moments (MoM) analysis of large antenna arrays with disjoint, non-identical elements is presented. The formulation introduces computational cost reducing extensions for the direct coupling technique (DCT), which is a domain decomposition method (DDM) whereby element-associated overlapping local problems are iteratively solved. A residual-driven formulation improves convergence and enables matrix sparsification. Macro basis functions are incorporated, with convergence to user-specified error tolerance maintained. Through near-interaction preconditioning, local domain extensions are rendered implicit, removing the need for overlapping local solutions. A single-level, hybrid nested cross approximation (NCA) acceleration scheme is employed. Rapid, controllable convergence is demonstrated for very large arrays. Faster runtimes than with the multilevel fast multipole method (MLFMM) in the commercial FEKO software suite, are demonstrated. Convergence rate is practically independent of excitation, including scattering analysis. The capability of preconditioner and local matrices being independent of excitation and iteration, enables efficient solution of multiple right-hand sides, e.g. for embedded element pattern (EEP) computations. The solver is well suited to parallelization.
- 17 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (7) , 5865-5876
Macro Basis Functions for Efficient Analysis of Thick Wires in the MoM
This article presents a macro basis function (MBF) formulation for efficient method of moments (MoM) modelling of conducting wires with appreciable thickness. General surface formulations are prohibitively inefficient for electrically thin wires, while the typical exact-kernel, rooftop-basis, thin-wire MoM becomes wholly inaccurate for electrically thick cylinders. The MBF formulation bridges the gap between thin-wire MoM, and general conducting surface MoM formulations, by introducing circumferential variations and components beyond the standard rooftop basis functions. The MBFs are constructed upon a full-order, divergence-conforming, triangle element MoM discretization. Comprehensive junction and end-cap treatment, and tapered wire support, are natural features of the formulation. As with thin-wire MoM, degrees of freedom (DoFs) are purely proportional to the electrical length of the wire. Results demonstrate that the intermediate range of “thick wires” is analyzed with practically the same accuracy as general surface MoM, with significantly reduced DoFs.
- 17 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (7) , 5865-5876
Macro Basis Functions for Efficient Analysis of Thick Wires in the MoM
This article presents a macro basis function (MBF) formulation for efficient method of moments (MoM) modelling of conducting wires with appreciable thickness. General surface formulations are prohibitively inefficient for electrically thin wires, while the typical exact-kernel, rooftop-basis, thin-wire MoM becomes wholly inaccurate for electrically thick cylinders. The MBF formulation bridges the gap between thin-wire MoM, and general conducting surface MoM formulations, by introducing circumferential variations and components beyond the standard rooftop basis functions. The MBFs are constructed upon a full-order, divergence-conforming, triangle element MoM discretization. Comprehensive junction and end-cap treatment, and tapered wire support, are natural features of the formulation. As with thin-wire MoM, degrees of freedom (DoFs) are purely proportional to the electrical length of the wire. Results demonstrate that the intermediate range of “thick wires” is analyzed with practically the same accuracy as general surface MoM, with significantly reduced DoFs.
- 25 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 71 (6) , 5199-5211
Antenna Array Analysis by Iterative DGFM-Based Local Solutions
The method of moments (MoM) is well suited to the electromagnetic analysis of antenna arrays, but solution cost grows rapidly with array size. This paper concerns efficient MoM analysis of large antenna arrays with identical disjoint elements in arbitrary layouts. The domain Green’s function method (DGFM) is a domain decomposition method for such arrays. Its unique benefit is that only local problems are solved to obtain an approximate global solution. Its main drawback is uncontrolled, problem-dependent solution errors. An improved scheme denoted iterative radius-based DGFM (IRB-DGFM) is formulated, in standard and residual-driven (RD) versions. Accuracy is improved by introducing local MoM domains and solution error control is achieved via an iterative scheme, to obtain the true MoM solution to user-specified tolerance. Various computational cost reduction methods are proposed for the new formulations. Results show that the RD-IRB-DGFM is superior, yielding rapid convergence for diverse arrays. The methods are ideally suited to parallelization.
- 25 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 71 (6) , 5199-5211
Antenna Array Analysis by Iterative DGFM-Based Local Solutions
The method of moments (MoM) is well suited to the electromagnetic analysis of antenna arrays, but solution cost grows rapidly with array size. This paper concerns efficient MoM analysis of large antenna arrays with identical disjoint elements in arbitrary layouts. The domain Green’s function method (DGFM) is a domain decomposition method for such arrays. Its unique benefit is that only local problems are solved to obtain an approximate global solution. Its main drawback is uncontrolled, problem-dependent solution errors. An improved scheme denoted iterative radius-based DGFM (IRB-DGFM) is formulated, in standard and residual-driven (RD) versions. Accuracy is improved by introducing local MoM domains and solution error control is achieved via an iterative scheme, to obtain the true MoM solution to user-specified tolerance. Various computational cost reduction methods are proposed for the new formulations. Results show that the RD-IRB-DGFM is superior, yielding rapid convergence for diverse arrays. The methods are ideally suited to parallelization.
- Open Access
- 18 April 2023
- Published by Wiley in Microwave and Optical Technology Letters
- Vol. 65 (8) , 2359-2365
Physics‐based iterative scheme for computing antenna array embedded element patterns
Rigorously accounting for mutual coupling effects in antenna array synthesis, generally requires that embedded element patterns (EEPs) be determined. The method of moments (MoM) is typically used. Multiple linear system solutions are required, corresponding to every excitation vector associated with an EEP. This paper presents the direct coupling technique (DCT) to obtain the MoM solution for arrays with disjoint elements, by iteratively solving a series of localized subproblems, one associated with each array element. It utilizes a physics‐based, direct‐coupling approximation to incorporate global coupling into the local problems. Local matrices do not change between iterations or with excitation vectors, hence they can be inverted as a preprocessing step, allowing for efficient solution of multiple excitation configurations. Numerical results demonstrate rapid convergence. The convergence rate can be controlled via local problem domain sizing. Since the DCT is ideally suited to parallelization, it is applicable to very large arrays.
- 18 April 2023
- Published by Wiley in Microwave and Optical Technology Letters
- Vol. 65 (8) , 2359-2365
Open AccessPhysics‐based iterative scheme for computing antenna array embedded element patterns
Rigorously accounting for mutual coupling effects in antenna array synthesis, generally requires that embedded element patterns (EEPs) be determined. The method of moments (MoM) is typically used. Multiple linear system solutions are required, corresponding to every excitation vector associated with an EEP. This paper presents the direct coupling technique (DCT) to obtain the MoM solution for arrays with disjoint elements, by iteratively solving a series of localized subproblems, one associated with each array element. It utilizes a physics‐based, direct‐coupling approximation to incorporate global coupling into the local problems. Local matrices do not change between iterations or with excitation vectors, hence they can be inverted as a preprocessing step, allowing for efficient solution of multiple excitation configurations. Numerical results demonstrate rapid convergence. The convergence rate can be controlled via local problem domain sizing. Since the DCT is ideally suited to parallelization, it is applicable to very large arrays.
- 26 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 70 (11) , 10787-10799
Efficient and Robust Shadowing Determination for Mesh-Based Physical Optics Analysis
Visibility status determination for every mesh element/edge with respect to an illuminating source, is routinely required in mesh-based physical optics (PO) methods, where the scatterer is represented by sub-wavelength sized elements. This paper presents an optimally efficient shadowing determination algorithm for both plane wave and point source (Hertzian dipole) illumination of large-scale triangle meshes. It is based on a recursive multi-level field-of-view (image space) subdivision buffer approach, whereby a point’s status is determined by only checking against a small subset of elements. It is error-free and formulated to maintain efficiency for inhomogeneous meshes and grazing incidence, which result in concentration of projected elements in small areas of the buffer plane. A key step is to separate the grazing and non-grazing parts of the mesh. Very challenging test cases affirm the algorithm’s expected optimal and robust linear computational cost scaling of O ( N ), where N denotes the number of mesh elements. For fixed N , almost constant runtimes under extreme illumination and mesh variations, further demonstrate robustness.
- 26 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 70 (11) , 10787-10799
Efficient and Robust Shadowing Determination for Mesh-Based Physical Optics Analysis
Visibility status determination for every mesh element/edge with respect to an illuminating source, is routinely required in mesh-based physical optics (PO) methods, where the scatterer is represented by sub-wavelength sized elements. This paper presents an optimally efficient shadowing determination algorithm for both plane wave and point source (Hertzian dipole) illumination of large-scale triangle meshes. It is based on a recursive multi-level field-of-view (image space) subdivision buffer approach, whereby a point’s status is determined by only checking against a small subset of elements. It is error-free and formulated to maintain efficiency for inhomogeneous meshes and grazing incidence, which result in concentration of projected elements in small areas of the buffer plane. A key step is to separate the grazing and non-grazing parts of the mesh. Very challenging test cases affirm the algorithm’s expected optimal and robust linear computational cost scaling of O ( N ), where N denotes the number of mesh elements. For fixed N , almost constant runtimes under extreme illumination and mesh variations, further demonstrate robustness.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 123-125
Computing Surface Integral Equation Matrices with Shared Memory Parallelization
An efficient shared memory parallelization strategy is presented for computing matrices resulting from surface integral equation based methods in time-harmonic electromagnetics (EM). In the numerical solution of EM problems with methods such as the method of moments (MoM) a significant portion of the solution time is dedicated to filling dense interaction matrices. Developing efficient parallelization strategies to take advantage of all of the available computational resources of multi-core central processing units (CPU) is thus critical in the fast solution of computationally demanding EM problems. The proposed scheme is applied to the electric field integral equation (EFIE)-based MoM and shown to demonstrate good parallel efficiency.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 123-125
Computing Surface Integral Equation Matrices with Shared Memory Parallelization
An efficient shared memory parallelization strategy is presented for computing matrices resulting from surface integral equation based methods in time-harmonic electromagnetics (EM). In the numerical solution of EM problems with methods such as the method of moments (MoM) a significant portion of the solution time is dedicated to filling dense interaction matrices. Developing efficient parallelization strategies to take advantage of all of the available computational resources of multi-core central processing units (CPU) is thus critical in the fast solution of computationally demanding EM problems. The proposed scheme is applied to the electric field integral equation (EFIE)-based MoM and shown to demonstrate good parallel efficiency.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 329-331
Array Antenna Solver Based on Macro Basis Functions, with Improved Accuracy
In this work a macro basis function (MBF) scheme for method of moments (MoM) based array antenna analysis is discussed which allows for more flexibility in current variation. This is achieved by letting element-to-element far couplings be represented by MBF-to-MBF interactions, while letting antenna near-interactions be represented by the low-level basis functions. This is referred to as the semi-reduced formulation. It is shown that the semi-reduced approach is superior to a standard MBF reduced-system solution, when both are based on the same set of MBFs.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 329-331
Array Antenna Solver Based on Macro Basis Functions, with Improved Accuracy
In this work a macro basis function (MBF) scheme for method of moments (MoM) based array antenna analysis is discussed which allows for more flexibility in current variation. This is achieved by letting element-to-element far couplings be represented by MBF-to-MBF interactions, while letting antenna near-interactions be represented by the low-level basis functions. This is referred to as the semi-reduced formulation. It is shown that the semi-reduced approach is superior to a standard MBF reduced-system solution, when both are based on the same set of MBFs.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 340-342
Scattering Analysis of Thick Wires with the MoM using Macro Basis Functions
This work is concerned with the analysis of scattering by conducting wires connected to conducting structures, using the method of moments (MoM). Based on thin-wire assumptions, low numbers of degrees of freedom (DoFs) are required by typical exact-kernel thin-wire MoM solvers, for accurate analysis. However, the thin-wire assumptions break down when the wire diameter becomes appreciably large in terms of the wavelength. An approach based on macro basis functions (MBFs) for wire current representation is outlined, aimed at extending the wire thickness range of accurate analysis, while maintaining a low number of DoFs similar to that of thin-wire formulations. Preliminary results demonstrate the effectiveness of the MBF approach.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 340-342
Scattering Analysis of Thick Wires with the MoM using Macro Basis Functions
This work is concerned with the analysis of scattering by conducting wires connected to conducting structures, using the method of moments (MoM). Based on thin-wire assumptions, low numbers of degrees of freedom (DoFs) are required by typical exact-kernel thin-wire MoM solvers, for accurate analysis. However, the thin-wire assumptions break down when the wire diameter becomes appreciably large in terms of the wavelength. An approach based on macro basis functions (MBFs) for wire current representation is outlined, aimed at extending the wire thickness range of accurate analysis, while maintaining a low number of DoFs similar to that of thin-wire formulations. Preliminary results demonstrate the effectiveness of the MBF approach.