Pub Date : 2026-04-01Epub Date: 2026-01-05DOI: 10.1016/j.jcp.2026.114652
Lukas Exl , Sebastian Schaffer
We present an extension of the tensor grid method for stray field computation on rectangular domains that incorporates higher-order basis functions. Both the magnetization and the resulting magnetic field are represented using higher-order B-spline bases, which allow for increased accuracy and smoothness. The method employs a super-potential formulation, which circumvents the need to convolve with a singular kernel. The field is represented with high accuracy as a functional Tucker tensor, leveraging separable expansions on the tensor product domain and trained via a multilinear extension of the extreme learning machine methodology. Unlike conventional grid-based methods, the proposed mesh-free approach allows for continuous field evaluation. Numerical experiments confirm the accuracy and efficiency of the proposed method, demonstrating exponential convergence of the energy and linear computational scaling with respect to the multilinear expansion rank.
{"title":"Higher order stray field computation on tensor product domains","authors":"Lukas Exl , Sebastian Schaffer","doi":"10.1016/j.jcp.2026.114652","DOIUrl":"10.1016/j.jcp.2026.114652","url":null,"abstract":"<div><div>We present an extension of the tensor grid method for stray field computation on rectangular domains that incorporates higher-order basis functions. Both the magnetization and the resulting magnetic field are represented using higher-order B-spline bases, which allow for increased accuracy and smoothness. The method employs a super-potential formulation, which circumvents the need to convolve with a singular kernel. The field is represented with high accuracy as a functional Tucker tensor, leveraging separable expansions on the tensor product domain and trained via a multilinear extension of the extreme learning machine methodology. Unlike conventional grid-based methods, the proposed mesh-free approach allows for continuous field evaluation. Numerical experiments confirm the accuracy and efficiency of the proposed method, demonstrating exponential convergence of the energy and linear computational scaling with respect to the multilinear expansion rank.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114652"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145923624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2025-12-21DOI: 10.1016/j.jcp.2025.114602
Pierre-Henri Cocquet , Martin J. Gander
In this paper, we show how to reduce the dispersion error associated to Yee’s finite difference scheme applied to time-harmonic Maxwell’s equations in one, two and three spatial dimensions. Our method, called asymptotic dispersion correction, is based on the introduction of a shifted angular frequency depending on a free parameter in the Yee stencil. The optimal parameter, called the asymptotically optimal shift, is next explicitly determined by minimizing the dispersion error for small enough meshsize or, equivalently, for large enough number of grid points per wavelength. Numerical experiments are provided and show that the relative error is reduced when using the optimal shifted angular frequency as soon as the number of grid points per wavelength is large enough.
{"title":"Improving Yee’s scheme with asymptotic dispersion correction for time-harmonic Maxwell’s equations","authors":"Pierre-Henri Cocquet , Martin J. Gander","doi":"10.1016/j.jcp.2025.114602","DOIUrl":"10.1016/j.jcp.2025.114602","url":null,"abstract":"<div><div>In this paper, we show how to reduce the dispersion error associated to Yee’s finite difference scheme applied to time-harmonic Maxwell’s equations in one, two and three spatial dimensions. Our method, called asymptotic dispersion correction, is based on the introduction of a shifted angular frequency depending on a free parameter in the Yee stencil. The optimal parameter, called the asymptotically optimal shift, is next explicitly determined by minimizing the dispersion error for small enough meshsize or, equivalently, for large enough number of grid points per wavelength. Numerical experiments are provided and show that the relative error is reduced when using the optimal shifted angular frequency as soon as the number of grid points per wavelength is large enough.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114602"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145903990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-01-02DOI: 10.1016/j.jcp.2025.114643
Yixuan Zhang , Gang Bao
The inverse reflector problem aims to design a freeform reflecting surface that can direct the light from a specified source to produce the desired illumination in the target area, which is significant in the field of geometrical non-imaging optics. Mathematically, it can be formulated as an optimization problem, which is exactly the optimal transportation problem (OT) when the target is in the far field. The gradient of OT is governed by the generalized Monge-Ampère equation that models the far-field reflector system. Based on the gradient, this work presents a Sobolev gradient descent method implemented within a finite element framework to solve the corresponding OT. Local convergence of the method is established and numerical examples are provided to demonstrate the effectiveness of the method.
{"title":"An optimal transport approach to the far-field reflector problem via Sobolev gradient descent","authors":"Yixuan Zhang , Gang Bao","doi":"10.1016/j.jcp.2025.114643","DOIUrl":"10.1016/j.jcp.2025.114643","url":null,"abstract":"<div><div>The inverse reflector problem aims to design a freeform reflecting surface that can direct the light from a specified source to produce the desired illumination in the target area, which is significant in the field of geometrical non-imaging optics. Mathematically, it can be formulated as an optimization problem, which is exactly the optimal transportation problem (OT) when the target is in the far field. The gradient of OT is governed by the generalized Monge-Ampère equation that models the far-field reflector system. Based on the gradient, this work presents a Sobolev gradient descent method implemented within a finite element framework to solve the corresponding OT. Local convergence of the method is established and numerical examples are provided to demonstrate the effectiveness of the method.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114643"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145923633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-01-02DOI: 10.1016/j.jcp.2025.114645
Qiling Gu , Wenlong Zhang , Zhidong Zhang
This paper develops a discrete data-driven approach for solving the inverse source problem of the wave equation with final time measurements. Focusing on the L2-Tikhonov regularization method, we analyze its convergence under two different noise models, using noisy discrete spatial observations. By exploiting the spectral decomposition of the forward operator and introducing a noise separation technique into the variational framework, we establish error bounds for the reconstructed solution u and the source term f without requiring classical source conditions. Moreover, an expected convergence rate for the source error is derived in a weaker topology. We also extend the analysis to the fully discrete case with finite element discretization, showing that the overall error depends only on the noise level, regularization parameter, time step size, and spatial mesh size. These estimates provide a basis for selecting the optimal regularization parameter in a data-driven manner, without a priori information. Numerical experiments validate the theoretical results and demonstrate the efficiency of the proposed algorithm.
{"title":"Solving the inverse source problems for wave equation with final time measurements by a data driven approach","authors":"Qiling Gu , Wenlong Zhang , Zhidong Zhang","doi":"10.1016/j.jcp.2025.114645","DOIUrl":"10.1016/j.jcp.2025.114645","url":null,"abstract":"<div><div>This paper develops a discrete data-driven approach for solving the inverse source problem of the wave equation with final time measurements. Focusing on the <em>L</em><sup>2</sup>-Tikhonov regularization method, we analyze its convergence under two different noise models, using noisy discrete spatial observations. By exploiting the spectral decomposition of the forward operator and introducing a noise separation technique into the variational framework, we establish error bounds for the reconstructed solution <em>u</em> and the source term <em>f</em> without requiring classical source conditions. Moreover, an expected convergence rate for the source error is derived in a weaker topology. We also extend the analysis to the fully discrete case with finite element discretization, showing that the overall error depends only on the noise level, regularization parameter, time step size, and spatial mesh size. These estimates provide a basis for selecting the optimal regularization parameter in a data-driven manner, without a priori information. Numerical experiments validate the theoretical results and demonstrate the efficiency of the proposed algorithm.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114645"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145903989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-01-08DOI: 10.1016/j.jcp.2026.114665
Andrea Lamperti, Laura De Lorenzis
We propose a novel phase-field model for solute precipitation and dissolution in liquid solutions. Unlike in previous studies with similar scope, in our model the two non-linear coupled governing equations of the problem, which deliver the solute ion concentration and the phase-field variable, are derived in a variationally consistent way starting from a free energy functional of Modica-Mortola type. The phase-field variable is assumed to follow the non-conservative Allen-Cahn evolution law, whereas the solute ion concentration obeys the conservative Cahn-Hilliard equation. We also assess the convergence of the new model to the corresponding sharp-interface model via the method of matched asymptotic expansions, and derive a novel expression of the reaction rate of the sharp-interface model. Through a finite element discretization, we present several numerical examples in one, two and three dimensions.
{"title":"A variationally consistent and asymptotically convergent phase-field model for solute precipitation and dissolution","authors":"Andrea Lamperti, Laura De Lorenzis","doi":"10.1016/j.jcp.2026.114665","DOIUrl":"10.1016/j.jcp.2026.114665","url":null,"abstract":"<div><div>We propose a novel phase-field model for solute precipitation and dissolution in liquid solutions. Unlike in previous studies with similar scope, in our model the two non-linear coupled governing equations of the problem, which deliver the solute ion concentration and the phase-field variable, are derived in a variationally consistent way starting from a free energy functional of Modica-Mortola type. The phase-field variable is assumed to follow the non-conservative Allen-Cahn evolution law, whereas the solute ion concentration obeys the conservative Cahn-Hilliard equation. We also assess the convergence of the new model to the corresponding sharp-interface model via the method of matched asymptotic expansions, and derive a novel expression of the reaction rate of the sharp-interface model. Through a finite element discretization, we present several numerical examples in one, two and three dimensions.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114665"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145974387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-01-06DOI: 10.1016/j.jcp.2026.114664
Ngoc Cuong Nguyen
We present novel model reduction methods for rapid solution of parametrized nonlinear partial differential equations (PDEs) in real-time or many-query contexts. Our approach combines reduced basis (RB) space for global approximation of the parametric solution manifold, Galerkin projection of the underlying PDEs onto the RB space for dimensionality reduction, and high-order empirical interpolation for efficient treatment of the nonlinear terms. We propose a class of high-order empirical interpolation methods to derive basis functions and interpolation points by using high-order partial derivatives of the nonlinear terms. We develop error indicator to estimate the interpolation errors and determine parameter points via greedy sampling. Furthermore, we introduce two hyperreduction schemes to construct reduced-order models: one that applies the hyperreduction technique before Newton’s method and another after. The latter scheme significantly reduces hyperreduction errors while maintaining computational efficiency. Numerical results are presented to demonstrate the accuracy and efficiency of our approach.
{"title":"High-order empirical interpolation methods for real-time solution of parametrized nonlinear PDEs","authors":"Ngoc Cuong Nguyen","doi":"10.1016/j.jcp.2026.114664","DOIUrl":"10.1016/j.jcp.2026.114664","url":null,"abstract":"<div><div>We present novel model reduction methods for rapid solution of parametrized nonlinear partial differential equations (PDEs) in real-time or many-query contexts. Our approach combines reduced basis (RB) space for global approximation of the parametric solution manifold, Galerkin projection of the underlying PDEs onto the RB space for dimensionality reduction, and high-order empirical interpolation for efficient treatment of the nonlinear terms. We propose a class of high-order empirical interpolation methods to derive basis functions and interpolation points by using high-order partial derivatives of the nonlinear terms. We develop error indicator to estimate the interpolation errors and determine parameter points via greedy sampling. Furthermore, we introduce two hyperreduction schemes to construct reduced-order models: one that applies the hyperreduction technique before Newton’s method and another after. The latter scheme significantly reduces hyperreduction errors while maintaining computational efficiency. Numerical results are presented to demonstrate the accuracy and efficiency of our approach.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114664"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145923626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-01-05DOI: 10.1016/j.jcp.2025.114639
Namkyeong Cho , Junseung Ryu , Hyung Ju Hwang
The recently released Mamba model leverages structured state space models (SSMs), incorporating hardware-efficient designs and selection mechanisms. The Mamba architecture demonstrates strong potential as a replacement for Transformer-based models across various tasks. In this work, we employ Mamba to train neural operators on infinite-dimensional spaces derived from partial differential equations. Using well-established theory on the Rough Path and Reproducing Kernel Hilbert Space (RKHS), we theoretically demonstrate that the SSM-based models can replace Transformer-based models for approximating operators. Our empirical findings further show that Mamba consistently outperforms Transformer models across various tasks while achieving faster inference, highlighting the potential of the Mamba architecture to outperform Transformer-based models in various operator learning tasks.
{"title":"MBNO: Mamba-based neural operators for solving partial differential equations","authors":"Namkyeong Cho , Junseung Ryu , Hyung Ju Hwang","doi":"10.1016/j.jcp.2025.114639","DOIUrl":"10.1016/j.jcp.2025.114639","url":null,"abstract":"<div><div>The recently released Mamba model leverages structured state space models (SSMs), incorporating hardware-efficient designs and selection mechanisms. The Mamba architecture demonstrates strong potential as a replacement for Transformer-based models across various tasks. In this work, we employ Mamba to train neural operators on infinite-dimensional spaces derived from partial differential equations. Using well-established theory on the Rough Path and Reproducing Kernel Hilbert Space (RKHS), we theoretically demonstrate that the SSM-based models can replace Transformer-based models for approximating operators. Our empirical findings further show that Mamba consistently outperforms Transformer models across various tasks while achieving faster inference, highlighting the potential of the Mamba architecture to outperform Transformer-based models in various operator learning tasks.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114639"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145923630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2025-12-27DOI: 10.1016/j.jcp.2025.114632
Bo-Lin Wei , Jie Zhang , Ming-Jiu Ni
We present a sharp Cartesian grid method for simulating flow past viscous droplets of arbitrary shape and viscosity. The method proposes a height function approach to compute the Weingarten matrix, enabling the accurate estimation of principal curvatures and directions on discretized curved interfaces of the droplet. These geometric quantities are then used to impose space- and time-dependent slip conditions at the interface. The incompressible Navier-Stokes equations are solved separately in the internal and external domains and coupled through the slip conditions using an embedded boundary method coupled with a synchronous iterative approach, ensuring a sharp representation of the interface. A key innovation of this approach is its ability to handle droplets with arbitrary geometries, including complex topologies imported directly from STL files, eliminating the need for analytical interface descriptions. By operating on a Cartesian grid, the method offers enhanced flexibility while preserving sharp interfacial dynamics. Numerical validation demonstrates the method’s accuracy and robustness. The height function approach is shown to reliably compute principal curvatures and directions, while simulations of flow past spheroidal droplets - spanning inviscid bubbles to rigid particles - exhibit excellent agreement with body-fitted benchmark solutions. Further, simulations of popcorn- and blob-shaped droplets highlight the method’s versatility in handling arbitrarily complex interfaces. This solver provides a powerful and flexible tool for investigating interfacial flow phenomena involving droplets with irregular geometries and viscosity variations.
{"title":"A sharp cartesian grid method for simulating flow past viscous droplets of arbitrary shape and viscosity","authors":"Bo-Lin Wei , Jie Zhang , Ming-Jiu Ni","doi":"10.1016/j.jcp.2025.114632","DOIUrl":"10.1016/j.jcp.2025.114632","url":null,"abstract":"<div><div>We present a sharp Cartesian grid method for simulating flow past viscous droplets of arbitrary shape and viscosity. The method proposes a height function approach to compute the Weingarten matrix, enabling the accurate estimation of principal curvatures and directions on discretized curved interfaces of the droplet. These geometric quantities are then used to impose space- and time-dependent slip conditions at the interface. The incompressible Navier-Stokes equations are solved separately in the internal and external domains and coupled through the slip conditions using an embedded boundary method coupled with a synchronous iterative approach, ensuring a sharp representation of the interface. A key innovation of this approach is its ability to handle droplets with arbitrary geometries, including complex topologies imported directly from STL files, eliminating the need for analytical interface descriptions. By operating on a Cartesian grid, the method offers enhanced flexibility while preserving sharp interfacial dynamics. Numerical validation demonstrates the method’s accuracy and robustness. The height function approach is shown to reliably compute principal curvatures and directions, while simulations of flow past spheroidal droplets - spanning inviscid bubbles to rigid particles - exhibit excellent agreement with body-fitted benchmark solutions. Further, simulations of popcorn- and blob-shaped droplets highlight the method’s versatility in handling arbitrarily complex interfaces. This solver provides a powerful and flexible tool for investigating interfacial flow phenomena involving droplets with irregular geometries and viscosity variations.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114632"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145903987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-01-05DOI: 10.1016/j.jcp.2025.114644
Keji Liu , Jiaru Wang
This work addresses the inverse problem of simultaneously reconstructing trajectories and strengths of moving acoustic point sources, with applications in gesture recognition, underwater sonar, and sound simulation. Under practical assumptions including co-located source initiation and a few kinematic profiles, we establish uniqueness results for both source trajectories and strengths. The reconstruction of trajectories is formulated through ordinary differential equations, while the recovery of strengths is determined via a matrix-vector system at each time step using at most four sensors. To mitigate numerical instability from ill-conditioned matrices, we introduce a direct imaging method employing an efficient indicator function based solely on Euclidean norm computations, avoiding matrix inversion or iterative optimization. Numerical experiments demonstrate reliable simultaneous recovery of trajectories and strengths for multiple moving sources, confirming the effectiveness of the proposed method and practical utility for real-world acoustic sensing applications.
{"title":"Simultaneous reconstruction of the trajectories and strengths for moving acoustic point sources","authors":"Keji Liu , Jiaru Wang","doi":"10.1016/j.jcp.2025.114644","DOIUrl":"10.1016/j.jcp.2025.114644","url":null,"abstract":"<div><div>This work addresses the inverse problem of simultaneously reconstructing trajectories and strengths of moving acoustic point sources, with applications in gesture recognition, underwater sonar, and sound simulation. Under practical assumptions including co-located source initiation and a few kinematic profiles, we establish uniqueness results for both source trajectories and strengths. The reconstruction of trajectories is formulated through ordinary differential equations, while the recovery of strengths is determined via a matrix-vector system at each time step using at most four sensors. To mitigate numerical instability from ill-conditioned matrices, we introduce a direct imaging method employing an efficient indicator function based solely on Euclidean norm computations, avoiding matrix inversion or iterative optimization. Numerical experiments demonstrate reliable simultaneous recovery of trajectories and strengths for multiple moving sources, confirming the effectiveness of the proposed method and practical utility for real-world acoustic sensing applications.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114644"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145923628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2025-12-31DOI: 10.1016/j.jcp.2025.114641
Samuel W. Jones , Colin P. McNally , Meritt Reynolds
Motivated by the increased interest in pulsed-power magneto-inertial fusion devices in recent years, we present a method for implementing an arbitrarily shaped embedded boundary on a Cartesian mesh while solving the equations of compressible resistive magnetohydrodynamics. The method is built around a finite volume formulation of the equations in which a Riemann solver is used to compute fluxes on the faces between grid cells, and a face-centered constrained transport formulation of the induction equation. The small time step problem associated with the cut cells is avoided by always computing fluxes on the faces and edges of the Cartesian mesh. We extend the method to model a moving interface between two materials with different properties using a ghost-fluid approach, and show some preliminary results including shock-wave-driven and magnetically-driven dynamical compressions of magnetohydrostatic equilibria. We present a thorough verification of the method and show that it converges at second order in the absence of discontinuities, and at first order with a discontinuity in material properties.
{"title":"A constrained-transport embedded boundary method for compressible resistive magnetohydrodynamics","authors":"Samuel W. Jones , Colin P. McNally , Meritt Reynolds","doi":"10.1016/j.jcp.2025.114641","DOIUrl":"10.1016/j.jcp.2025.114641","url":null,"abstract":"<div><div>Motivated by the increased interest in pulsed-power magneto-inertial fusion devices in recent years, we present a method for implementing an arbitrarily shaped embedded boundary on a Cartesian mesh while solving the equations of compressible resistive magnetohydrodynamics. The method is built around a finite volume formulation of the equations in which a Riemann solver is used to compute fluxes on the faces between grid cells, and a face-centered constrained transport formulation of the induction equation. The small time step problem associated with the cut cells is avoided by always computing fluxes on the faces and edges of the Cartesian mesh. We extend the method to model a moving interface between two materials with different properties using a ghost-fluid approach, and show some preliminary results including shock-wave-driven and magnetically-driven dynamical compressions of magnetohydrostatic equilibria. We present a thorough verification of the method and show that it converges at second order in the absence of discontinuities, and at first order with a discontinuity in material properties.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"550 ","pages":"Article 114641"},"PeriodicalIF":3.8,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145923632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}