Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.20350

Solver Performance of Accelerated MoM for Connected Arrays

Harald Hultin·Lucas Åkerstedt·B. L. G. Jonsson
View original source ↗Read source document ↗Export metadata ↓

Abstract

Simulating and developing large rectangularly shaped arrays with equidistant interspacing is challenging as the computational complexity grows quickly with array size. However, the geometrical shape of the array, appropriately meshed, leads to a multilevel Toeplitz structure in the RWG-based Method of Moment impedance matrix representation that can be used to mitigate the increased complexity. This paper develops, presents and compares two different accelerated solvers that both utilize the matrix structure to determine antenna properties. Both methods use a novel mesh-partitioning algorithm and its associated data representation, reducing storage and computational costs. The first solver is an iterative method based on multilevel fast Fourier transform to accelerate matrix multiplications. The second solver approach is based on an extension of a fast direct Toeplitz solver, adapted to a block-matrix structure. This fast direct solver is demonstrated to have close to machine epsilon accuracy. Both accelerated methods are evaluated on two different array element types, for arrays with up to 900 elements. The results are compared with conventional direct and iterative matrix solvers. Improvements are seen in both the time and required storage to solve the problem. The choice of the most efficient method depends on the residual thresholds in the iterative method, geometry of the element and frequency. Two different preconditioners for the iterative method are investigated to evaluate their performance. The two accelerated methods vastly outperform regular matrix inversion methods.

Explore related subjects

math.NAcs.NAphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harald Hultin, Lucas Åkerstedt, B. L. G. Jonsson. 2025-06-25. Solver Performance of Accelerated MoM for Connected Arrays. https://arxiv.org/abs/2506.20350

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Discrete normalized gradient flow for two-component Bose-Einstein condensates: Energy dissipation, global convergence and sharp local convergence behavior

The gradient flow with semi-implicit discretization (GFSI) is the most widely used algorithm for computing the ground state of Gross-Pitaevskii energy functional. We apply GFSI to the two-component scenario with Josephson junction and rotating term, which is one of the most important and topical models in multi-component Bose-Einstein condensates (MBECs), and rigorously establish the following fundamental results for the first time. By introducing a Lagrange multiplier to reformulate GFSI into an equivalent form, we prove its energy dissipation property and global convergence to stationary states. More significantly, we uncover an intrinsic connection between this classical numerical PDE discretization rooted in imaginary-time evolution and Riemannian optimization, a state-of-the-art mathematical framework for manifold-constrained optimization. This connection enables us to fully characterize the local convergence behavior of GFSI within the Riemannian optimization framework. Together with the aforementioned global convergence result, this yields a complete global--local convergence theory for GFSI. Finally, numerical experiments comprehensively validate the theoretically predicted energy dissipation and convergence properties.

math.NA↗
arXiv2026

Discretization, Uniform-in-Time Estimations and Approximation of Invariant Measures for Nonlinear Stochastic Differential Equations with Non-Uniform Dissipativity

The approximation of invariant measures for nonlinear ergodic stochastic differential equations (SDEs) is a central problem in scientific computing, with important applications in stochastic sampling, physics, and ecology. We first propose an easily applicable explicit Truncated Euler-Maruyama (TEM) scheme and prove its numerical ergodicity in the $L^p$-Wasserstein distance ($p\geqslant 1$). Furthermore, by combining truncation techniques with the coupling method, we establish a uniform-in-time $1/2$-order convergence rate in moments for the TEM scheme. Additionally, leveraging the exponential ergodicity of both the numerical and exact solutions, we derive a $1/2$-order convergence rate for the invariant measures of the TEM scheme and the exact solution in the $L^1$-Wasserstein distance. Finally, two numerical experiments are conducted to validate our theoretical results.

math.NA↗
arXiv2026

Barotropic-Baroclinic Splitting for Multilayer Shallow Water Models with Exchanges

This work presents the numerical analysis of a barotropic-baroclinic splitting in a nonlinear multilayer framework with exchanges between the layers in terrain-following coordinates. The splitting is formulated as an exact operator splitting. The barotropic step handles free surface evolution and depth-averaged velocity via a well-balanced one-layer model, while the baroclinic step manages vertical exchanges between layers and adjusts velocities to their mean values. We show that the barotropic-baroclinic splitting preserves total energy conservation and meets both a discrete maximum principle and a discrete entropy inequality. Several numerical experiments are presented showing the gain in computational cost, particularly in low Froude simulations, with no loss of accuracy. The benefits of using a well-balancing strategy in the barotropic step to preserve the geostrophic equilibrium are inherited in the overall scheme.

math.NA↗