Search

Conductivity reconstruction in an inverse eddy current problem is considered in the present paper. With the electric field measurement on part of domain boundary, we formulate the reconstruction problem as a constrained optimization problem with total variation regularization. The existence and stability are proved for the solution to the optimization problem. The finite element method is employed to discretize the optimization problem. The gradient Lipschitz property of the objective functional is established for the discrete optimization problem. We propose a novel modification to the traditional alternating direction method of multipliers, and prove the convergence of the modified algorithm. Finally, we show some numerical experiments to illustrate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

Being able to characterise objects at low frequencies, but in situations where the modelling error in the eddy current approximation of the Maxwell system becomes large, is important for improving current metal detection technologies. Importantly, the modelling error becomes large as the frequency increases, but the accuracy of the eddy current model also depends on the object topology and on its materials, with the error being much larger for certain geometries compared to others of the same size and materials. Additionally, the eddy current model breaks down at much smaller frequencies for highly magnetic conducting materials compared to non-permeable objects (with similar conductivities, sizes and shapes) and, hence, characterising small magnetic objects made of permeable materials using the eddy current at typical frequencies of operation for a metal detector is not always possible. To address this, we derive a new asymptotic expansion for permeable highly conducting objects that is valid for small objects and holds not only for frequencies where the eddy current model is valid but also for situations where the eddy current modelling error becomes large and applying the eddy approximation would be invalid. The leading-order term we derive leads to new forms of object characterisations in terms of polarizability tensor object descriptions where the coefficients can be obtained from solving vectorial transmission problems. We expect these new characterisations to be important when considering objects at greater stand-off distance from the coils, which is important for safety critical applications, such as the identification of landmines, unexploded ordnance and concealed weapons. We also expect our results to be important when characterising artefacts of archaeological and forensic significance at greater depths than the eddy current model allows and to have further applications parking sensors and improving the detection of hidden, out-of-sight, metallic objects. [ABSTRACT FROM AUTHOR]

Sound-soft fractal screens can scatter acoustic waves even when they have zero surface measure. To solve such scattering problems we make what appears to be the first application of the boundary element method (BEM) where each BEM basis function is supported in a fractal set, and the integration involved in the formation of the BEM matrix is with respect to a non-integer order Hausdorff measure rather than the usual (Lebesgue) surface measure. Using recent results on function spaces on fractals, we prove convergence of the Galerkin formulation of this "Hausdorff BEM" for acoustic scattering in R n + 1 ( n = 1 , 2 ) when the scatterer, assumed to be a compact subset of R n × { 0 } , is a d-set for some d ∈ (n - 1 , n ] , so that, in particular, the scatterer has Hausdorff dimension d. For a class of fractals that are attractors of iterated function systems, we prove convergence rates for the Hausdorff BEM and superconvergence for smooth antilinear functionals, under certain natural regularity assumptions on the solution of the underlying boundary integral equation. We also propose numerical quadrature routines for the implementation of our Hausdorff BEM, along with a fully discrete convergence analysis, via numerical (Hausdorff measure) integration estimates and inverse estimates on fractals, estimating the discrete condition numbers. Finally, we show numerical experiments that support the sharpness of our theoretical results, and our solution regularity assumptions, including results for scattering in R 2 by Cantor sets, and in R 3 by Cantor dusts. [ABSTRACT FROM AUTHOR]

This work presents the multiharmonic analysis and derivation of functional type a posteriori estimates of a distributed eddy current optimal control problem and its state equation in a time-periodic setting. The existence and uniqueness of the solution of a weak space-time variational formulation for the optimality system and the forward problem are proved by deriving inf-sup and sup-sup conditions. Using the inf-sup and sup-sup conditions, we derive guaranteed, sharp and fully computable bounds of the approximation error for the optimal control problem and the forward problem in the functional type a posteriori estimation framework. We present here the first computational results on the derived estimates. [ABSTRACT FROM AUTHOR]

The impact of Artificial Intelligence (AI) is rapidly expanding, revolutionizing both science and society. It is applied to practically all areas of life, science, and technology, including materials science, which continuously requires novel tools for effective materials characterization. One of the widely used techniques is scanning probe microscopy (SPM). SPM has fundamentally changed materials engineering, biology, and chemistry by providing tools for atomic-precision surface mapping. Despite its many advantages, it also has some drawbacks, such as long scanning times or the possibility of damaging soft-surface materials. In this paper, we focus on the potential for supporting SPM-based measurements, with an emphasis on the application of AI-based algorithms, especially Machine Learning-based algorithms, as well as quantum computing (QC). It has been found that AI can be helpful in automating experimental processes in routine operations, algorithmically searching for optimal sample regions, and elucidating structure-property relationships. Thus, it contributes to increasing the efficiency and accuracy of optical nanoscopy scanning probes. Moreover, the combination of AI-based algorithms and QC may have enormous potential to enhance the practical application of SPM. The limitations of the AI-QC-based approach were also discussed. Finally, we outline a research path for improving AI-QC-powered SPM. RESEARCH HIGHLIGHTS: Artificial intelligence and quantum computing as support for scanning probe microscopy. The analysis indicates a research gap in the field of scanning probe microscopy. The research aims to shed light into ai-qc-powered scanning probe microscopy., (© 2024 Wiley Periodicals LLC.)

In this paper, we consider the numerical solution of a large complex linear system with a saddle-point form obtained by the discretization of the time-harmonic eddy-current optimal control problem. A new Schur complement is proposed for this algebraic system, extending it to both the block-triangular preconditioner and the structured preconditioner. A theoretical analysis proves that the eigenvalues of block-triangular and structured preconditioned matrices are located in the interval [1/2, 1]. Numerical simulations show that two new preconditioners coupled with a Krylov subspace acceleration have good feasibility and effectiveness and are superior to some existing efficient algorithms. [ABSTRACT FROM AUTHOR]

We consider uncertainty quantification for the Poisson problem subject to domain uncertainty. For the stochastic parameterization of the random domain, we use the model recently introduced by Kaarnioja et al. (SIAM J. Numer. Anal., 2020) in which a countably infinite number of independent random variables enter the random field as periodic functions. We develop lattice quasi-Monte Carlo (QMC) cubature rules for computing the expected value of the solution to the Poisson problem subject to domain uncertainty. These QMC rules can be shown to exhibit higher order cubature convergence rates permitted by the periodic setting independently of the stochastic dimension of the problem. In addition, we present a complete error analysis for the problem by taking into account the approximation errors incurred by truncating the input random field to a finite number of terms and discretizing the spatial domain using finite elements. The paper concludes with numerical experiments demonstrating the theoretical error estimates. [ABSTRACT FROM AUTHOR]

This review paper addresses the development of numerical modeling of electromagnetic fields in geophysics with a focus on recent finite element simulation. It discusses ways of estimating errors of our solutions for a perfectly matched modeling domain and the problems that arise from its insufficient representation. After a brief outline of early methods and modeling approaches, the paper mainly discusses the capabilities of the finite element method formulated on unstructured grids and the advantages of local h-refinement allowing for both a flexible and largely accurate representation of the geometries of the multi-scale geomaterial and an accurate evaluation of the underlying functions representing the physical fields. In summary, the accuracy of the solution depends on the geometric mapping, the choice of the mathematical model, and the spatial discretization. Although the available error estimators do not necessarily provide reliable error bounds for our complex geomodels, they are still useful to guide grid refinement. Therefore, an overview of the most common a posteriori error estimators is given. It will be shown that the sensitivity is the most important function in both guiding the geometric mapping and the local refinement. [ABSTRACT FROM AUTHOR]

This work deals with the spectral element discretization of the time-dependent Stokes problem in two- and three-dimensional domains. The boundary condition is defined on the normal component of the velocity and the tangential components of the vorticity. The discretization related to the time variable is processed by a Backward Euler method. We prove through a detailed numerical analysis the well-posedness of the full discrete problem. [ABSTRACT FROM AUTHOR]

With the aim to continue developing a hybridizable discontinuous Galerkin (HDG) method for problems arisen from photovoltaic cells modeling, in this manuscript we consider the time harmonic Maxwell’s equations in an inhomogeneous bounded bi-periodic domain with quasi-periodic conditions on part of the boundary. We propose an HDG scheme where quasi-periodic boundary conditions are imposed on the numerical trace space. Under regularity assumptions and a proper choice of the stabilization parameter, we prove that the approximations of the electric and magnetic fields converge, in the L 2 -norm, to the exact solution with order h k + 1 and h k + 1 / 2 , resp., where h is the meshsize and k the polynomial degree of the discrete spaces. Although, numerical evidence suggests optimal order of convergence for both variables. An a posteriori error estimator for an energy norm is also proposed. We show that it is reliable and locally efficient under certain conditions. Numerical examples are provided to illustrate the performance of the quasi-periodic HDG method and the adaptive scheme based on the proposed error indicator. [ABSTRACT FROM AUTHOR]

We propose a new residual-based a posteriori error estimator for discontinuous Galerkin discretizations of time-harmonic Maxwell's equations in first-order form. We establish that the estimator is reliable and efficient, and the dependency of the reliability and efficiency constants on the frequency is analyzed and discussed. The proposed estimates generalize similar results previously obtained for the Helmholtz equation and conforming finite element discretizations of Maxwell's equations. In addition, for the discontinuous Galerkin scheme considered here, we also show that the proposed estimator is asymptotically constant-free for smooth solutions. [ABSTRACT FROM AUTHOR]

This paper presents efficient data structures for the implementation of matrix-free finite element methods on block-structured, hybrid tetrahedral grids. It provides a complete categorization of all geometric sub-objects that emerge from the regular refinement of the unstructured, tetrahedral coarse grid and describes efficient iteration patterns and analytical linearization functions for the mapping of coefficients to memory addresses. This foundation enables the implementation of fast, extreme-scalable, matrix-free, iterative solvers, and in particular geometric multigrid methods by design. Their application to the variable-coefficient Stokes system subject to an enriched Galerkin discretization and to the curl-curl problem discretized with Nédélec edge elements showcases the flexibility of the implementation. Finally, the solution of a curl-curl problem with $ 1.6\cdot 10^{11} $ 1.6 ⋅ 10 11 (more than one hundred billion) unknowns on more than 32,000 processes with a matrix-free full multigrid solver demonstrates its extreme-scalability. [ABSTRACT FROM AUTHOR]

An hp-version interior penalty discontinuous Galerkin method under nonconforming meshes is proposed to solve the quad-curl eigenvalue problem. We prove well-posedness of the numerical scheme for the quad-curl equation and then derive an error estimate in a mesh-dependent norm, which is optimal with respect to h but has different p-version error bounds under conforming and nonconforming tetrahedron meshes. The hp-version discrete compactness of the DG space is established for the convergence proof. The performance of the method is demonstrated by numerical experiments using conforming/nonconforming meshes and h-version/p-version refinement. The optimal h-version convergence rate and the exponential p-version convergence rate are observed. [ABSTRACT FROM AUTHOR]

In this paper, we propose and analyze a new structure-preserving finite element method for the stationary magnetohydrodynamic equations with magnetic-current formulation on Lipschitz domains. Using a mixed finite element approach, we discretize the hydrodynamic unknowns by inf-sup stable velocity-pressure finite element pairs, and the current density, the induced electric field and the magnetic field by using the edge-edge-face elements from a discrete de-Rham complex pair. To deal with the divergence-free condition of the magnetic field, we introduce an augmented term to the discrete scheme rather than a Lagrange multiplier in the existing schemes. Thanks to discrete differential forms and finite element exterior calculus, the proposed scheme preserves the divergence-free property exactly for the magnetic induction on the discrete level. The well-posedness of the discrete problem is further proved under the small data condition. Under weak regularity assumptions, we rigorously establish the error estimates of the finite element schemes. Numerical results are provided to illustrate the theoretical results and demonstrate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

This paper deals with a high-order H (curl) -conforming Bernstein–Bézier finite element method (BBFEM) to accurately solve time-harmonic Maxwell short wave problems on unstructured triangular mesh grids. We suggest enhanced basis functions, defined on the reference triangle and tetrahedron, aiming to reduce the condition number of the resulting global matrix. Moreover, element-level static condensation of the interior degrees of freedom is performed in order to reduce memory requirements. The performance of BBFEM is assessed using several benchmark tests. A preliminary analysis is first conducted to highlight the advantage of the suggested basis functions in improving the conditioning. Numerical results dealing with the electromagnetic scattering from a perfect electric conductor demonstrate the effectiveness of BBFEM in mitigating the pollution effect and its efficiency in capturing high-order evanescent wave modes. Electromagnetic wave scattering by a circular dielectric, with high wave speed contrast, is also investigated. The interior curved interface between layers is accurately described based on a linear blending map to avoid numerical errors due to geometry description. The achieved results support our expectations for highly accurate and efficient BBFEM for time harmonic wave problems. [ABSTRACT FROM AUTHOR]

SUMMARY The plane wave DG (PWDG) method for the Helmholtz equation was introduced and analyzed in [ GITTELSON, C., HIPTMAIR, R., AND PERUGIA, I. Plane wave discontinuous Galerkin methods: analysis of the h-version. Math. Model. Numer. Anal. 43 (2009), 297-331] as a generalization of the so-called ultra-weak variational formulation, see [ O. CESSENAT AND B. DESPRéS, Application of an ultra weak variational formulation of elliptic PDEs to the two-dimensional Helmholtz equation, SIAM J. Numer. Anal., 35 (1998), pp. 255-299]. The method relies on Trefftz-type local trial spaces spanned by plane waves of different directions, and links cells of the mesh through numerical fluxes in the spirit of DG methods. We conduct a partly empirical dispersion analysis of the method in a discrete translation-invariant setting by studying the mismatch of wave numbers of discrete and continuous plane waves traveling in the same direction. We find agreement of the wave numbers for directions represented in the local trial spaces. For other directions, the PWDG methods turn out to incur both phase and amplitude errors. This manifests itself as a pollution effect haunting the h-version of the method. Our dispersion analysis allows a quantitative prediction of the strength of this effect and its dependence on the wave number and number of plane waves. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In two and three dimensions, we design and analyze a posteriori error estimators for the mixed Stokes eigenvalue problem. The unknowns on this mixed formulation are the pseudotress, velocity and pressure. With a lowest order mixed finite element scheme, together with a postprocressing technique, we prove that the proposed estimator is reliable and efficient. We illustrate the results with several numerical tests in two and three dimensions in order to assess the performance of the estimator. [ABSTRACT FROM AUTHOR]

In this article, we propose the weak Galerkin (WG) finite element schemes for H(div;Ω)${\bf H}(\mbox{div}; {\Omega })$‐elliptic problems with and without stabilizers. Optimal orders of convergence are established for the WG approximations in both discrete energy norm and L2 norm. Removing stabilizers from WG finite element methods will simplify the formulations, reduce programming complexity, and may also speed up the computation time. More precisely, for sufficiently smooth solutions, we have proved the supercloseness of order two for the stabilizer free weak Galerkin finite element solution. Several numerical tests are presented to demonstrate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

We derive bounds on the eigenvalues of a generic form of double saddle-point matrices. The bounds are expressed in terms of extremal eigenvalues and singular values of the associated block matrices. Inertia and algebraic multiplicity of eigenvalues are considered as well. The analysis includes bounds for preconditioned matrices based on block diagonal preconditioners using Schur complements, and it is shown that in this case the eigenvalues are clustered within a few intervals bounded away from zero. Analysis for approximations of Schur complements is included. Some numerical experiments validate our analytical findings. [ABSTRACT FROM AUTHOR]

We present a framework for the structure-preserving approximation of partial differential equations on mapped multipatch domains, extending the classical theory of finite element exterior calculus (FEEC) to discrete de Rham sequences which are broken, i.e., fully discontinuous across the patch interfaces. Following the Conforming/Nonconforming Galerkin (CONGA) schemes developed in Campos Pinto and Sonnendrücker (Math Comput 85:2651–2685, 2016) and Campos Pinto and Güçlü (Broken-FEEC discretizations and Hodge Laplace problems. , 2022), our approach is based on: (i) the identification of a conforming discrete de Rham sequence with stable commuting projection operators, (ii) the relaxation of the continuity constraints between patches, and (iii) the construction of conforming projections mapping back to the conforming subspaces, allowing to define discrete differentials on the broken sequence. This framework combines the advantages of conforming FEEC discretizations (e.g. commuting projections, discrete duality and Hodge–Helmholtz decompositions) with the data locality and implementation simplicity of interior penalty methods for discontinuous Galerkin discretizations. We apply it to several initial- and boundary-value problems, as well as eigenvalue problems arising in electromagnetics. In each case our formulations are shown to be well posed thanks to an appropriate stabilization of the jumps across the interfaces, and the solutions are extremely robust with respect to the stabilization parameter. Finally we describe a construction using tensor-product splines on mapped cartesian patches, and we detail the associated matrix operators. Our numerical experiments confirm the accuracy and stability of this discrete framework, and they allow us to verify that expected structure-preserving properties such as divergence or harmonic constraints are respected to floating-point accuracy. [ABSTRACT FROM AUTHOR]

We introduce two a posteriori error estimators for Nédélec finite element discretizations of the curl-curl problem. These estimators pertain to a new Prager–Synge identity and an associated equilibration procedure. They are reliable and efficient, and the error estimates are polynomial-degree-robust. In addition, when the domain is convex, the reliability constants are fully computable. The proposed error estimators are also cheap and easy to implement, as they are computed by solving divergence-constrained minimization problems over edge patches. Numerical examples highlight our key findings, and show that both estimators are suited to drive adaptive refinement algorithms. Besides, these examples seem to indicate that guaranteed upper bounds can be achieved even in non-convex domains. [ABSTRACT FROM AUTHOR]

Geomagnetic depth sounding (GDS) is a geophysical electromagnetic (EM) method that studies the deep structure and composition of the Earth by using long-period EM signals from geomagnetic observatories and satellites. In this paper, a 3-D anisotropic GDS modelling algorithm is developed. The curl–curl equation is discretized using the edge-based finite-element method on unstructured tetrahedral grids. In order to solve the computationally demanding problem of EM modelling on a global scale, the complex linear system is first separated into the equivalent real linear systems and then the real system is iteratively solved by the flexible generalized minimum residual method with a block diagonal pre-conditioner. This will greatly reduce the condition number of the linear system and thus speed up the solution process. We verify the accuracy of the proposed algorithm by comparing our results with the existing methods. After that, we design a subduction zone model to simulate the EM responses under isotropic and anisotropic environments, respectively. The numerical results show the high efficiency of the proposed algorithm and the response differences between isotropic and anisotropic models. This research can provide theoretical and technical support for the high-accuracy and efficient inversion of GDS data for the geo-dynamic study. [ABSTRACT FROM AUTHOR]

Purpose: The ability to characterise highly conducting objects, that may also be highly magnetic, by the complex symmetric rank–2 magnetic polarizability tensor (MPT) is important for metal detection applications including discriminating between threat and non-threat objects in security screening, identifying unexploded anti-personnel landmines and ordnance and identifying metals of high commercial value in scrap sorting. Many everyday non-threat items have both a large electrical conductivity and a magnetic behaviour, which, for sufficiently weak fields and the frequencies of interest, can be modelled by a high relative magnetic permeability. This paper aims to discuss the aforementioned idea. Design/methodology/approach: The numerical simulation of the MPT for everyday non-threat highly conducting magnetic objects over a broad range of frequencies is challenging due to the resulting thin skin depths. The authors address this by employing higher order edge finite element discretisations based on unstructured meshes of tetrahedral elements with the addition of thin layers of prismatic elements. Furthermore, computer aided design (CAD) geometrical models of the non-threat and threat object are often not available and, instead, the authors extract the geometrical features of an object from an imaging procedure. Findings: The authors obtain accurate numerical MPT characterisations that are in close agreement with experimental measurements for realistic physical objects. The assessment of uncertainty shows the impact of geometrical and material parameter uncertainties on the computational results. Originality/value: The authors present novel computations and measurements of MPT characterisations of realistic objects made of magnetic materials. A novel assessment of uncertainty in the numerical predictions of MPT characterisations for uncertain geometry and material parameters is included. [ABSTRACT FROM AUTHOR]

This paper is concerned with numerical analysis of a finite element method for the time-dependent Ginzburg–Landau equations under the Coulomb gauge. The main challenge is that the magnetic potential A is divergence-free and satisfies a Stokes-like structure under the Coulomb gauge. The proposed method uses linear Lagrange element P 1 to solve for the order parameter ψ , the lowest order Nédélec edge element N D 1 and linear Lagrange element P 1 to approximate the magnetic potential A and the electric potential ϕ , respectively. In particular, the proposed method preserves a weakly divergence-free property for A in the discrete level. The main aim of this work is to establish the second order spatial convergence of the most important variable ψ , though the numerical solutions of A are only O(h) in space. Our analysis is based on a nonstandard quasi-projection for ψ and the corresponding H - 1 -norm estimates for Maxwell projection. With the quasi-projection, we prove that the lower-order approximation to A does not pollute the accuracy of ψ h . An effective one step recovery is also proposed to obtain second order numerical solution for A . Our numerical experiments confirm the optimal second order convergence of ψ h and the efficiency of the recovery step. [ABSTRACT FROM AUTHOR]

For the incompressible MHD equations, we present a fully discrete second-order-in-time scheme based on a blended BDF and extrapolation treatments for nonlinear terms. The proposed scheme is more accurate than the two-step BDF with additional nominal computational time and is still A-stable. Then, unconditional stability, long-time stability, and optimal convergence rate of the scheme are presented. At last, the numerical findings are verified by comparison with the two-step BDF scheme in several 2D and 3D numerical experiments. [ABSTRACT FROM AUTHOR]

In Trefftz discontinuous Galerkin methods a partial differential equation is discretized using discontinuous shape functions that are chosen to be elementwise in the kernel of the corresponding differential operator. We propose a new variant, the embedded Trefftz discontinuous Galerkin method, which is the Galerkin projection of an underlying discontinuous Galerkin method onto a subspace of Trefftz‐type. The subspace can be described in a very general way and to obtain it no Trefftz functions have to be calculated explicitly, instead the corresponding embedding operator is constructed. In the simplest cases the method recovers established Trefftz discontinuous Galerkin methods. But the approach allows to conveniently extend to general cases, including inhomogeneous sources and non‐constant coefficient differential operators. We introduce the method, discuss implementational aspects and explore its potential on a set of standard PDE problems. Compared to standard discontinuous Galerkin methods we observe a severe reduction of the globally coupled unknowns in all considered cases, reducing the corresponding computing time significantly. Moreover, for the Helmholtz problem we even observe an improved accuracy similar to Trefftz discontinuous Galerkin methods based on plane waves. [ABSTRACT FROM AUTHOR]

We present a convergence theory for Optimized Schwarz Methods that rely on a nonlocal exchange operator and covers the case of coercive possibly nonselfadjoint impedance operators. This analysis also naturally deals with the presence of cross-points in subdomain partitions of arbitrary shape. In the particular case of hermitian positive definite impedance, we recover the theory proposed in Claeys & Parolin (2021). [ABSTRACT FROM AUTHOR]

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H (curl) and H (div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated. [ABSTRACT FROM AUTHOR]

We propose and study a method for finding quasi-resonances for a linear acoustic transmission problem in frequency domain. Starting from an equivalent boundary-integral equation we perform Galerkin boundary element discretization and look for the minima of the smallest singular value of the resulting matrix as a function of the wave number k. We develop error estimates for the impact of Galerkin discretization on singular values and devise a heuristic adaptive algorithm for finding the minima in prescribed k-intervals. Our method exclusively relies on the solution of eigenvalue problems for real k, in contrast to alternative approaches that rely on extension to the complex plane. [ABSTRACT FROM AUTHOR]

Abnormal formation of girth weld is a major threat to the safe operation of pipelines, which may lead to serious accidents. Therefore, regular inspection and maintenance of girth weld are essential for accident prevention and energy security. This paper presents a novel method for inspecting abnormal girth weld formation in oil and gas pipelines using alternating excitation detection technology. The method is based on the analysis of the microscopic magnetic variations in the welded area under alternating magnetic fields. An internal inspection probe and electronic system for detecting abnormal girth weld formation were designed and developed. The system's capability to identify misalignment, undercutting, root concavity, and abnormal formation height of girth weld was tested by numerical simulation and experimental study. The results show that the detection system can effectively identify a minimum misalignment of 0.5 mm at a lift-off height of 15 mm. The proposed method offers several advantages, such as rapid response, low cost, non-contact operation, and high sensitivity to surface flaws in ferromagnetic pipelines. [ABSTRACT FROM AUTHOR]

In this work, a stable node-based smoothed finite element method with TBC (SNS-FEM-TBC) is proposed to solve the scattering of elastic plane waves by a two-dimensional (2D) homogeneous isotropic elastic medium. First, using Helmholtz decomposition, two scalar potential functions are introduced to divide the Navier equation into Helmholtz equations with the coupled boundary conditions for the elastic scattering problem. Second, based on the analytical solutions of Helmholtz equations, TBC operators are deduced. Then, the gradient Taylor expansion is used to construct the stability term to deal with the instability of the original NS-FEM, the gradient of the solution is expressed into a linear formulation through approximating the node-based smoothing domain as a circle. Finally, based on smoothed Galerkin weak formula, the SNS-FEM-TBC formula of linear algebraic system with linear smoothing gradient is derived. Numerical examples show that SNS-FEM can obtain more stable and accurate solutions than standard FEM. Moreover, the convergence rates of L 2 and H 1 semi-norm errors of SNS-FEM are faster. [ABSTRACT FROM AUTHOR]

Finite element methods developed for unfitted meshes have been widely applied to various interface problems. However, many of them resort to non-conforming spaces for approximation, which is a critical obstacle for the extension to $\textbf{H}(\text{curl})$ equations. This essential issue stems from the underlying Sobolev space $\textbf{H}^s(\text{curl};\,\Omega)$ , and even the widely used penalty methodology may not yield the optimal convergence rate. One promising approach to circumvent this issue is to use a conforming test function space, which motivates us to develop a Petrov–Galerkin immersed finite element (PG-IFE) method for $\textbf{H}(\text{curl})$ -elliptic interface problems. We establish the Nédélec-type IFE spaces and develop some important properties including their edge degrees of freedom, an exact sequence relating to the $H^1$ IFE space and optimal approximation capabilities. We analyse the inf-sup condition under certain assumptions and show the optimal convergence rate, which is also validated by numerical experiments. [ABSTRACT FROM AUTHOR]

Non-overlapping Schwarz methods with generalized Robin transmission conditions were originally introduced by B. Després for time-harmonic wave propagation problems and have largely developed over the past thirty years. The aim of the paper is to provide both a review of the available formulations and methods as well as a consistent theory applicable to more general cases than studied until to date. An abstract variational framework is provided reformulating the original problem by the well-known form involving a scattering operator and an interface exchange operator, and the equivalence between the formulations is discussed thoroughly. The framework applies to a series of wave propagation problems throughout the de Rham complex, such as the scalar Helmholtz equation, Maxwell’s equations, a dual formulation of the Helmholtz equation in H(div), as well as any conforming finite element discretization thereof, and it applies also to coercive problems. Three convergence results are shown. The first one (using compactness) and the second one (based on absorption) generalize Després’ early findings and apply as well to the FETI-2LM formulation (a discrete method introduced by de La Bourdonnaye, Farhat, Macedo, Magoulés, and Roux). The third result, oriented on the work by Collino, Ghanemi, and Joly, establishes a convergence rate and covers cases with cross points, while not requiring any regularity of the solution. The key ingredient is a global interface exchange operator, proposed originally by X. Claeys and further developed by Claeys and Parolin, here worked out in full generality. The third type of convergence theory is applicable at the discrete level as well, where the exchange operator is allowed to be even local. The resulting scheme can be viewed as a generalization of the 2-Lagrange-multiplier method introduced by S. Loisel, and connections are drawn to another technique proposed by Gander and Santugini. [ABSTRACT FROM AUTHOR]

Two nonconforming finite element Stokes complexes starting from the conforming Lagrange element and ending with the nonconforming P1-P0 element for the Stokes equation in three dimensions are studied. Commutative diagrams are also shown by combining nonconforming finite element Stokes complexes and interpolation operators. The lower order H(gradcurl)-nonconforming finite element only has 14 degrees of freedom, whose basis functions are explicitly given in terms of the barycentric coordinates. The H(gradcurl)-nonconforming elements are applied to solve the quad-curl problem, and the optimal convergence is derived. By the nonconforming finite element Stokes complexes, the mixed finite element methods of the quad-curl problem are decoupled into two mixed methods of the Maxwell equation and the nonconforming P1-P0 element method for the Stokes equation, based on which a fast solver is discussed. Numerical results are provided to verify the theoretical convergence rates. [ABSTRACT FROM AUTHOR]

Compatible finite‐element discretisations for the atmospheric equations of motion have recently attracted considerable interest. Semi‐implicit timestepping methods require the repeated solution of a large saddle‐point system of linear equations. Preconditioning this system is challenging, since the velocity mass matrix is nondiagonal, leading to a dense Schur complement. Hybridisable discretisations overcome this issue: weakly enforcing continuity of the velocity field with Lagrange multipliers leads to a sparse system of equations, which has a similar structure to the pressure Schur complement in traditional approaches. We describe how the hybridised sparse system can be preconditioned with a non‐nested two‐level preconditioner. To solve the coarse system, we use the multigrid pressure solver that is employed in the approximate Schur complement method previously proposed by the some of the authors. Our approach significantly reduces the number of solver iterations. The method shows excellent performance and scales to large numbers of cores in the Met Office next‐generation climate and weather prediction model LFRic. [ABSTRACT FROM AUTHOR]

We consider a discontinuous coefficient reconstruction problem associated with a variable-order time-fractional subdiffusion equation. Both interface identification and reconstruction of piecewise constant coefficient values are considered. We show existence of a minimizer of the regularized inverse problem. Shape sensitivity analysis is performed to propose a shape gradient optimization algorithm allowing deformations. Moreover, an algorithm allowing shape and topological changes is proposed by a phase-field method with sensitivity analysis. Numerical examples are presented to demonstrate effectiveness of the two algorithms for recovering both subdiffusion interface and the two subdiffusion constants. [ABSTRACT FROM AUTHOR]

In this paper, we focus on a finite element projection method for inductionless magnetohydrodynamics equations. A fully discrete projection method based on Euler semi-implicit scheme is proposed in which continuous elements are used to approximate the Navier–Stokes equations and the divergence-conforming element is used to approximate the current density. The key of the projection method is that it must be compatible with two different spaces for calculating velocity, which leads to solve the pressure by solving a Poisson equation. The results show that the proposed projection scheme meets a discrete energy stability and the discrete current density keeps charge conservation property. In addition, this paper provides a rigorous optimal error analysis of velocity, pressure and current density. Finally, several numerical examples are performed to demonstrate both accuracy and efficiency of our proposed scheme. [ABSTRACT FROM AUTHOR]

A new level set method is developed for multi-material structural topology optimization. The method features in using the discontinuous Galerkin finite-element method for discretization of the level set transport equation and the distributed shape gradient. Moreover, the topological derivative is incorporated into the present algorithm as a possible way to escape from local minima through creating holes during optimization. Numerical examples are provided to verify effectiveness of the numerical algorithm. [ABSTRACT FROM AUTHOR]