SearcharxivSearch

arXiv subjects

Changqing Ye

Publications and source records attributed to Changqing Ye.

At least 19 recordsLinked to original sources

Matrix-Free FFT-HSS Preconditioning for Periodic Landau-Lifshitz-Gilbert Saddle-Point Systems

In this paper, a matrix-free Hermitian/skew-Hermitian splitting (HSS) preconditioner is proposed for periodic Landau--Lifshitz--Gilbert (LLG) saddle-point systems. The main contributions are threefold. (1) The coupled skew/constraint block has an explicit \(4\times4\) nodal inverse and requires no local factorization. Combining this local inverse with FFT inversion of the shifted exchange block gives \(O(N_g\log N_g)\) work and \(O(N_g)\) temporary storage per application. (2) We establish well-posedness and an even-step GMRES residual bound, with an iteration estimate uniform in the mesh size and time step for a class of coupled refinements. (3) The projected implicit Euler and projection-free Crank--Nicolson-type midpoint discretizations generate saddle-point systems of the same form, so the same matrix-free FFT--HSS preconditioning procedure applies to both. They achieve first- and second-order temporal accuracy, respectively; for quadratic-affine energies, the midpoint scheme also preserves nodal length and satisfies an exact discrete dissipation identity. Two- and three-dimensional experiments confirm the predicted temporal orders and midpoint invariants. On the largest smooth tests, FFT--HSS reduces GMRES iterations by \(35\)--\(39\%\) relative to same-grid Householder preconditioning and yields approximately 15-fold and 3-fold speedups over unpreconditioned GMRES in two and three dimensions, respectively. Broadband tests retain mesh-independent iterations in the covered refinement regime at time steps 13.3 times the linearized explicit exchange limit.

math.NA

An Order-One Lower Bound on the Error of Scalable Generalized Multiscale Finite Element Space Constructions

Several coefficient-adapted methods provide optimal-order approximation for elliptic equations with rough coefficients. Prominent examples include localized orthogonal decomposition, multiscale spectral GFEM, and constraint energy-minimizing GMsFEM. Their proven accuracy, however, is obtained by allowing the localization radius or the local spectral dimension to grow as the coarse scale \(H\) tends to zero. Classical MsFEM has an FEM-like local construction, but its available analysis does not give a coefficient-uniform \(\bigO(H)\) energy estimate over the full bounded-contrast measurable coefficient class. Motivated by this gap, we formalize an FEM-like notion of structural scalability. A chosen spatially local basis has uniformly bounded overlap, hence \(\bigO(1)\) stiffness entries per row, and every anchored local span uses coefficient information from only \(\bigO(1)\) coarse-element layers. We prove that no deterministic construction satisfying fixed bounds on the support radius, coefficient-information radius, and local multiplicity can converge uniformly over the coefficient class. In fact, its worst-case \(L^2\)-to-energy Galerkin error remains bounded below by a positive constant independent of \(H\). The lower bound is established using a fixed finite family of smooth periodic coefficients and smooth right-hand sides. The proof combines coefficients that coincide on local patches, a finite-dimensional approximation lower bound for corrector fields, a positive-density mesh argument, and strong periodic corrector convergence. Thus uniform optimal accuracy requires at least one local construction parameter to grow or requires coefficient information beyond the fixed-visibility model.

math.NA

Multiphysics embedding localized orthogonal decomposition for thermomechanical coupling problems

Multiscale thermomechanical problems in highly heterogeneous media are challenging because the elastic, thermal, and coupling coefficients may vary on unresolved spatial scales. We propose a multiphysics-embedding localized orthogonal decomposition (ME-LOD) method in which displacement and temperature correctors are generated by a coupled static operator. The corrector problems are localized to coarse-grid patches and solved in the kernel of a projective quasi-interpolation operator. We prove uniform inf-sup stability on the global fine-scale kernel and on all zero-extension patch kernels, establish exponential decay of the coupled correctors and the resulting multiscale basis functions, and derive spatial approximation and fully discrete reduction estimates. Numerical experiments demonstrate that, for the tested periodic, random, and high-contrast coefficient fields, ME-LOD attains smaller errors than the comparison method at the same coarse resolution and patch size and can reach a prescribed accuracy with fewer oversampling layers. Although each coupled local corrector is more expensive than a decoupled corrector, the improved localization yields a favorable overall accuracy-to-cost balance in the reported tests.

math.NA

Multiscale modeling for problems with high contrast heterogeneous coefficients by the CEM-GMsFEM

This review paper provides a comprehensive overview of the Constrained Energy Minimizing Generalized Multiscale Finite Element Method (CEM-GMsFEM) for solving elliptic PDEs characterized by highly heterogeneous, high-contrast coefficients. We detail the construction of multiscale basis functions via spectral auxiliary spaces, combined with an oversampling strategy that enables localized computations and guarantees exponential error decay. Rigorous error estimates are outlined for reference to confirm the method's optimal convergence and robustness. Numerical simulations are provided to verify the exponential decay property of the multiscale basis functions. Additionally, we discuss and comment several up-to-date applications of CEM-GMsFEMs.

math.NA

Multiscale Methods for wave propagation in materials with sign-changing coefficients

From a mathematical perspective, the extraordinary properties of metamaterials are often reflected in the coefficients of the governing partial differential equations (PDEs). These coefficients may fall outside the assumptions of classical theory, particularly when the effective dielectric permittivity and/or magnetic permeability are negative. This situation can transform a coercive operator into a non-coercive one, potentially leading to ill-posedness. In this paper, we utilize the Constraint Energy Minimizing Generalized Multiscale Finite Element Method (CEM-GMsFEM), specifically designed for time-harmonic electromagnetic wave problems, where the construction of auxiliary spaces in the original CEM-GMsFEM is tailored to accommodate the sign-changing setting. Based on the framework of \texttt{T}-coercivity theory and resolution conditions, we establish the inf-sup stability and provide an a priori error estimate for the proposed method. The numerical results demonstrate the effectiveness and robustness of our approach in handling such sophisticated coefficient profiles.

math.NA

Multiscale modeling for a class of high-contrast heterogeneous sign-changing problems

The mathematical formulation of sign-changing problems involves a linear second-order partial differential equation in the divergence form, where the coefficient can assume positive and negative values in different subdomains. These problems find their physical background in negative-index metamaterials, either as inclusions embedded into common materials as the matrix or vice versa. In this paper, we propose a numerical method based on the constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM) specifically designed for sign-changing problems. The construction of auxiliary spaces in the original CEM-GMsFEM is tailored to accommodate the sign-changing setting. The numerical results demonstrate the effectiveness of the proposed method in handling sophisticated coefficient profiles and the robustness of coefficient contrast ratios. Under several technical assumptions and by applying the \texttt{T}-coercivity theory, we establish the inf-sup stability and provide an a priori error estimate for the proposed method.

math.NA

Efficient Multiscale Methods for Highly Heterogeneous Spatial Network Models

Modeling complex spatial networks with multiscale heterogeneity poses significant mathematical and computational challenges. Lacking explicit PDE discretizations and facing excessive degrees of freedom, conventional methods often become computationally prohibitive. To address these challenges, we propose an efficient multiscale modeling for highly heterogeneous spatial networks. We construct multiscale basis functions tailored to spatial network models with heterogeneous edge weights and node degrees. A key novelty is that the proposed method doesn't introduce geometric parameters (such as Dirichlet nodes, distances, or mesh sizes), thereby preserving its purely algebraic nature and ensuring broad applicability. By incorporating a subgraph-wise estimate, we define a Poincaré constant $C_{\mathrm{po}}$ that renders the method independent of the underlying graph geometry. Then through an appropriate choice of the number of graph oversampling layers, we establish an $O(C_{\mathrm{po}})$ convergence independent of the local heterogeneity contrast. Notably, our scheme operates entirely within an algebraic framework, eliminating the need for Dirichlet nodes and positive-definiteness on specific matrices arising in the model. This flexibility enables the simulation of a wider range of physical models and accommodates various boundary conditions. Rigorous theoretical analyses are provided under suitable assumptions, and extensive numerical experiments validate the effectiveness of the proposed approach.

math.NA

Multiscale modeling for contact problem with high-contrast heterogeneous coefficients with primary-dual formulation

In this paper, we propose a novel iterative multiscale framework for solving high-contrast contact problems of Signorini type. The method integrates the constrained energy minimizing generalized multiscale finite element method (CEM-GMsFEM) with a primal-dual active set strategy derived from semismooth Newton methods. First, local spectral problems are employed to construct an auxiliary multiscale space, from which energy minimizing multiscale basis functions are derived on oversampled domains, yielding a contrast-robust reduced-order approximation of the underlying partial differential equation. The multiscale bases are updated iteratively, but only at contact boundary, during the active set evolution process. Rigorous analysis is provided to establish error estimates and finite step convergence of the iterative scheme. Numerical experiments on heterogeneous media with high-contrast coefficients demonstrate that the proposed approach is both robust and efficient in capturing fine-scale features near contact boundaries.

math.NA

A locking free multiscale method for linear elasticity in stress-displacement formulation with high contrast coefficients

Achieving strongly symmetric stress approximations for linear elasticity problems in high-contrast media poses a significant computational challenge. Conventional methods often struggle with prohibitively high computational costs due to excessive degrees of freedom, limiting their practical applicability. To overcome this challenge, we introduce an efficient multiscale model reduction method and a computationally inexpensive coarse-grid simulation technique for linear elasticity equations in highly heterogeneous, high-contrast media. We first utilize a stable stress-displacement mixed finite element method to discretize the linear elasticity problem and then present the construction of multiscale basis functions for the displacement and the stress. The mixed formulation offers several advantages such as direct stress computation without post-processing, local momentum conservation (ensuring physical consistency), and robustness against locking effects, even for nearly incompressible materials. Theoretical analysis confirms that our method is inf-sup stable and locking-free, with first-order convergence relative to the coarse mesh size. Notably, the convergence remains independent of contrast ratios as enlarging oversampling regions. Numerical experiments validate the method's effectiveness, demonstrating its superior performance even under extreme contrast conditions.

math.NA

Homogenization rates of beam lattices to micropolar continua

As the size of a mechanical lattice with beam-modeled edges approaches zero, it undergoes homogenization into a continuum model, which exhibits unusual mechanical properties that deviate from classical Cauchy elasticity, named micropolar elasticity. Typically, the homogenization process is qualitative in the engineering community, lacking quantitative homogenization error estimates. In this paper, we rigorously analyze the homogenization process of a beam lattice to a continuum. Our approach is initiated from an engineered mechanical problem defined on a triangular lattice with periodic boundary conditions. By applying Fourier transformations, we reduce the problem to a series of equations in the frequency domain. As the lattice size approaches zero, this yields a homogenized model in the form of a partial differential equation with periodic boundary conditions. This process can be easily justified if the external conditions in the frequency domain are nonzero only at low-frequency modes. However, through numerical experiments, we discover that beyond the low-frequency regime, the homogenization of the beam lattice differs from classical periodic homogenization theory due to the additional rotational degrees of freedom in the beams. A crucial technique in our analysis is the decoupling of displacement and rotation fields, achieved through a linear algebraic manipulation known as the Schur complement. Through dedicated analysis, we establish the coercivity of the Schur complements in both lattice and continuum models, which enables us to derive convergence rate estimates for homogenization errors. Numerical experiments validate the optimality of the homogenization rate estimates.

math.NA

MatExPre: A matrix exponential preconditioner for the high-frequency Helmholtz equation

In this article, we present a new preconditioner, MatExPre, for the high-frequency Helmholtz equation by leveraging the properties of matrix exponentials. Our approach begins by reformulating the Helmholtz equation into a Schrödinger-like equation and constructing a time-domain solver based on a fixed-point iteration. We then establish a rigorous connection between the time-domain solver and matrix exponential integrators, which enables us to derive algebraic preconditioners that rely solely on sparse matrix-vector products. Spectral analysis and a detailed numerical implementation strategy, including performance improvements achieved through complex shifting, are discussed. Finally, numerical experiments on 2D and large-scale 3D homogeneous and inhomogeneous models, including benchmark seismic examples, substantiate the effectiveness and scalability of the proposed methods.

math.NA

Learning a generalized multiscale prolongation operator

In this research, we address Darcy flow problems with random permeability using iterative solvers, enhanced by a two-grid preconditioner based on a generalized multiscale prolongation operator, which has been demonstrated to be stable for high contrast profiles. To circumvent the need for repeatedly solving spectral problems with varying coefficients, we harness deep learning techniques to expedite the construction of the generalized multiscale prolongation operator. Considering linear transformations on multiscale basis have no impact on the performance of the preconditioner, we devise a loss function by the coefficient-based distance between subspaces instead of the plain $l^2$-norm of the difference of the corresponding multiscale bases. We discover that leveraging the inherent symmetry in the local spectral problem can effectively accelerate the neural network training process. In scenarios where training data are limited, we utilize the Karhunen-Loève expansion to augment the dataset. Extensive numerical experiments with various types of random coefficient models are exhibited, showing that the proposed method can significantly reduce the time required to generate the prolongation operator while maintaining the original efficiency of the two-grid preconditioner. Notably, the neural network demonstrates strong generalization capabilities, as evidenced by its satisfactory performance on unseen random permeability fields.

math.NA

A robust solver for large-scale heat transfer topology optimization

This paper presents a large-scale parallel solver, specifically designed to tackle the challenges of solving high-dimensional and high-contrast linear systems in heat transfer topology optimization. The solver incorporates an interpolation technique to accelerate convergence in high-resolution domains, along with a multiscale multigrid preconditioner to handle complex coefficient fields with significant contrast. All modules of the optimization solver are implemented on a high performance computing cluster by the PETSc numerical library. Through a series of numerical investigations, we demonstrate the effectiveness of our approach in enhancing convergence and robustness during the optimization process, particularly in high-contrast scenarios with resolutions up to $1024^3$. Our performance results indicate that the proposed preconditioner achieves over $2\times$ speedup against the default algebraic multigrid in PETSc for high-contrast cases.

math.NA

SCEP: a Cosmic Magnetic Monopole Search Experiment

Magnetic monopole is a well-motivated class of beyond-Standard-Model particles that could provide insights into the long-standing puzzle of the quantization of electric charge. These hypothetical particles are likely to be super heavy ($\sim$10$^{15}$ GeV) and be produced in the very early stages of the Universe's evolution. We propose a novel detection scenario for the search of such cosmic magnetic monopoles, utilizing a hybrid approach that combines radio-frequency atomic magnetometers and plastic scintillators. Such setup allows for the collection of both the induction and scintillation signals generated by the passage of a magnetic monopole, which provides acceptance to the magnetic monopoles with their velocities larger than about 10$^{-6}$ light speed (assuming a signal-to-noise ratio of $\sim$4) and their masses larger than approximately 10$^7$ GeV (at $β\sim10^{-3}$). The proposed detector design has the potential to scale up to large area, enabling the exploration of the parameter space of the cosmic magnetic monopole beyond the current experimental and astrophysical constraints. It is estimated that such detector can reach current most stringent limits of the flux set by previous searches, with a signal-to-noise ratio of the induction signal larger than about 4.5, assuming an effective exposure being 20000 year$\cdot$m$^2$ and coil layer of 3.

hep-ex

Constraint Energy Minimizing Generalized Multiscale Finite Element Method for Convection Diffusion Equations with Inhomogeneous Boundary Conditions

In this paper, we develop the constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM) for convection-diffusion equations with inhomogeneous Dirichlet, Neumann and Robin boundary conditions, along with high-contrast coefficients. For time independent problems, boundary correctors $\mathcal{D}^m$ and $\mathcal{N}^{m}$ for Dirichlet, Neumann, and Robin conditions are designed. For time dependent problems, a scheme to update the boundary correctors is formulated. Error analysis in both cases is given to show the first-order convergence in energy norm with respect to the coarse mesh size $H$ and second-order convergence in $L^2-$norm, as verified by numerical examples, with which different finite difference schemes are compared for temporal discretization. Nonlinear problems are also demonstrated in combination with Strang splitting.

math.NA

Robust Multiscale Methods for Helmholtz equations in high contrast heterogeneous media

In this paper, we provide the constraint energy minimization generalized multiscale finite element method (CEM-GMsFEM) to solve Helmholtz equations in heterogeneous medium. This novel multiscale method is specifically designed to overcome problems related to pollution effect, high-contrast coefficients, and the loss of hermiticity of operators. We establish the inf-sup stability and give an a priori error estimate for this method under a number of established assumptions and resolution conditions. The theoretical results are validated by a set of numerical tests, which further show that the multiscale technique can effectively capture pertinent physical phenomena.

math.NA

An iterative constraint energy minimizing generalized multiscale finite element method for contact problem

This work presents an Iterative Constraint Energy Minimizing Generalized Multiscale Finite Element Method (ICEM-GMsFEM) for solving the contact problem with high contrast coefficients. The model problem can be characterized by a variational inequality, where we add a penalty term to convert this problem into a non-smooth and non-linear unconstrained minimizing problem. The characterization of the minimizer satisfies the variational form of a mixed Dirilect-Neumann-Robin boundary value problem. So we apply CEM-GMsFEM iteratively and introduce special boundary correctors along with multiscale spaces to achieve an optimal convergence rate. Numerical results are conducted for different highly heterogeneous permeability fields, validating the fast convergence of the CEM-GMsFEM iteration in handling the contact boundary and illustrating the stability of the proposed method with different sets of parameters. We also prove the fast convergence of the proposed iterative CEM-GMsFEM method and provide an error estimate of the multiscale solution under a mild assumption.

math.NA

A fast cosine transformation accelerated method for predicting effective thermal conductivity

Predicting effective thermal conductivity by solving a Partial Differential Equation (PDE) defined on a high-resolution Representative Volume Element (RVE) is a computationally intensive task. In this paper, we tackle the task by proposing an efficient and implementation-friendly computational method that can fully leverage the computing power offered by hardware accelerators, namely, graphical processing units (GPUs). We first employ the Two-Point Flux-Approximation scheme to discretize the PDE and then utilize the preconditioned conjugate gradient method to solve the resulting algebraic linear system. The construction of the preconditioner originates from FFT-based homogenization methods, and an engineered linear programming technique is utilized to determine the homogeneous reference parameters. The fundamental observation presented in this paper is that the preconditioner system can be effectively solved using multiple Fast Cosine Transformations (FCT) and parallel tridiagonal matrix solvers. Regarding the fact that default multiple FCTs are unavailable on the CUDA platform, we detail how to derive FCTs from FFTs with nearly optimal memory usage. Numerical experiments including the stability comparison with standard preconditioners are conducted for 3D RVEs. Our performance reports indicate that the proposed method can achieve a $5$-fold acceleration on the GPU platform over the pure CPU platform and solve the problems with $512^3$ degrees of freedom and reasonable contrast ratios in less than $30$ seconds.

math.NA