Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.27837

A Novel Two-Level Domain Decomposition Method with Physically Motivated Coarse Space for Surface Acoustic Wave Device Simulations

Likun Qiu·Jianguo Huang·Xuejun Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

The surface acoustic wave (SAW) equations are fundamental in describing the operating principle of SAW devices, which are characterized by high operating frequency, multiphysics coupling, and defined on an unbounded domain. Finite element (FE) simulation is one of the most accurate numerical methods for such devices. However, the method usually leads to ill-conditioned linear systems with a large number of degrees of freedom (DOFs), limiting its application. To address this issue, based on the finite element tearing and interconnecting (FETI) algorithm, this paper proposes a domain decomposition method with iteration numbers stable with respect to number of subdomains, frequency and mesh size, named FETI-SAW. The main novelty is that the Dirichlet preconditioner combined with a Rayleigh-wave-based coarse space is constructed to produce a preconditioned iterative algorithm for the Lagrange multiplier linear system. In some sense, this method reflects the physical essence of the SAW equations. In numerical experiments, we take interdigital transducers (IDT) and SAW resonators as examples to demonstrate the efficiency of the FETI-SAW algorithm. Additionally, the MATLAB and C++ source codes accompanying this paper are provided.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Likun Qiu, Jianguo Huang, Xuejun Xu. 2026-10-20. A Novel Two-Level Domain Decomposition Method with Physically Motivated Coarse Space for Surface Acoustic Wave Device Simulations. https://arxiv.org/abs/2610.27837

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

KEEP EXPLORING

Related papers

arXiv2026

Perturbed saddle-point problems in $\mathrm{L}^p$ with non-regular loads

In this work, we develop the continuous and discrete solvability analysis for perturbed saddle-point problems in Banach spaces with forcing terms regularised by means of a projector constructed using the adjoint of a weighted Clément quasi-interpolation. We take as driving example the linearised Poisson--Boltzmann equation (an advection-diffusion-reaction problem) in mixed form. We use perturbation arguments on the continuous and discrete levels and then derive a priori estimates that remain valid when the load that appears on the right-hand side of the "second" equation is in $\mathrm{H}^{-1}$. Further, we show a supercloseness result and {analyse convergence} of an adequate adaptation of Stenberg postprocessing for mixed advection equations with non-regular data. We provide numerical results that illustrate the convergence of the proposed scheme.

math.NA↗
arXiv2026

Born-Preconditioned Learning for Iterative Neural PDE Solvers

Simulating high-frequency waves in spatially varying media remains challenging for both classical iterative methods and neural PDE solvers. We propose Neural Preconditioned Born Series (NPBS), a framework for learning iterative neural PDE solvers. Our guiding idea is to use a simple reference preconditioner to help learn a more effective neural preconditioner. Building on the Convergent Born Series (CBS), NPBS feeds a preconditioned residual to a neural network that predicts a solution update. We train the network to reduce the preconditioned residual after each update. The same reference preconditioner is used for the network input and the loss, giving a metric-matched training objective. Experiments on heterogeneous Helmholtz problems show reduced iteration counts across neural architectures and larger gains at higher wavenumbers. Within a Krylov solver, NPBS achieves the lowest wall-clock time in the evaluated solver comparison. The framework also extends naturally to three-dimensional problems. The same metric-matched formulation also improves convergence on convection-diffusion-reaction systems and Newton linear systems for nonlinear PDEs, indicating that NPBS provides a general framework for learning neural preconditioners.

math.NA↗
arXiv2026

Flexible GMRES converges in two phases

We derive a sharp upper bound on the residuals produced by the flexible GMRES (FGMRES) method. The bound shows that FGMRES exhibits two phases of convergence depending on the residual tolerance of the inner preconditioner. For small tolerances, the convergence of FGMRES is practically geometric with a constant rate throughout, while for looser tolerances the two-phase behavior becomes more pronounced. We also show that the derived bound cannot be improved and construct an example for which it becomes an equality.

math.NA↗