Search

In this paper we consider the distributed optimal control of the Navier—Stokes equations in the presence of pointwise mixed control-state constraints. After deriving a first order necessary condition, the regularity of the mixed constraint multiplier is investigated. Second order sufficient optimality conditions are studied as well. In the last part of the paper, a semismooth Newton method is applied for the numerical solution of the control problem. The convergence of the method is proved and numerical experiments are carried out. [ABSTRACT FROM AUTHOR]

This paper is concerned with the multi-frequency factorization method for imaging the support of a wave-number-dependent source function. It is supposed that the source function is given by the inverse Fourier transform of some time-dependent source with a priori given radiating period. Using the multi-frequency far-field data at a fixed observation direction, we provide a computational criterion for characterizing the smallest strip containing the support and perpendicular to the observation direction. The far-field data from sparse observation directions can be used to recover a Θ-convex polygon of the support. The inversion algorithm is proven valid even with multi-frequency near-field data in three dimensions. The connections to time-dependent inverse source problems are discussed in the near-field case. Numerical tests in both two and three dimensions are implemented to show effectiveness and feasibility of the approach. This paper provides numerical analysis for a frequency-domain approach to recover the support of an admissible class of time-dependent sources. [ABSTRACT FROM AUTHOR]

Surface Stokes and Navier--Stokes equations are used to model fluid flow on surfaces. They have attracted significant recent attention in the numerical analysis literature because approximation of their solutions poses significant challenges not encountered in the Euclidean context. One challenge comes from the need to simultaneously enforce tangentiality and H1 conformity (continuity) of discrete vector fields used to approximate solutions in the velocity-pressure formulation. Existing methods in the literature all enforce one of these two constraints weakly either by penalization or by use of Lagrange multipliers. Missing so far is a robust and systematic construction of surface Stokes finite element spaces which employ nodal degrees of freedom, including MINI, Taylor--Hood, Scott--Vogelius, and other composite elements which can lead to divergence-conforming or pressure-robust discretizations. In this paper we construct surface MINI spaces whose velocity fields are tangential. They are not H1-conforming, but do lie in H(div) and do not require penalization to achieve optimal convergence rates. We prove stability and optimal-order energy-norm convergence of the method and demonstrate optimal-order convergence of the velocity field in L2 via numerical experiments. The core advance in the paper is the construction of nodal degrees of freedom for the velocity field. This technique also may be used to construct surface counterparts to many other standard Euclidean Stokes spaces, and we accordingly present numerical experiments indicating optimal-order convergence of nonconforming tangential surface Taylor--Hood P2 P1 elements. [ABSTRACT FROM AUTHOR]

In this paper, we consider an approach to improve the performance of exponential Runge–Kutta integrators and Lawson schemes in cases where the solution of a related, but usually much simpler, problem can be computed efficiently. While for implicit methods such an approach is common (e.g., by using preconditioners), for exponential integrators this has proven more challenging. Here we propose to extract a constant coefficient differential operator from the semilinear advection-diffusion-reaction equation for which, in many situations, efficient methods are known to compute the required matrix functions. Both a linear stability analysis and extensive numerical experiments show that the resulting schemes can be unconditionally stable. In fact, we find that exponential integrators of Runge–Kutta type and Lawson schemes can have better stability properties than similarly constructed implicit-explicit schemes. We also derive two new Lawson-type integrators that further improve on these stability properties. The overall effectiveness of the approach is highlighted by a number of performance comparisons on examples in two and three space dimensions. [ABSTRACT FROM AUTHOR]

The aim of this paper is to carry out convergence analysis and algorithm implementation of a novel sample-wise backpropagation method for training a class of stochastic neural networks (SNNs). The preliminary discussion on such an SNN framework was first introduced in [Archibald et al., Discrete Contin. Dyn. Syst. Ser. S, 15 (2022), pp. 2807--2835]. The structure of the SNN is formulated as a discretization of a stochastic differential equation (SDE). A stochastic optimal control framework is introduced to model the training procedure, and a sample-wise approximation scheme for the adjoint backward SDE is applied to improve the efficiency of the stochastic optimal control solver, which is equivalent to the backpropagation for training the SNN. The convergence analysis is derived by introducing a novel joint conditional expectation for the gradient process. Under the convexity assumption, our result indicates that the number of SNN training steps should be proportional to the square of the number of layers in the convex optimization case. In the implementation of the sample-based SNN algorithm with the benchmark MNIST dataset, we adopt the convolution neural network (CNN) architecture and demonstrate that our sample-based SNN algorithm is more robust than the conventional CNN. [ABSTRACT FROM AUTHOR]

Partial differential equations (PDEs) with uncertain or random inputs have been considered in many studies of uncertainty quantification. In forward uncertainty quantification, one is interested in analyzing the stochastic response of the PDE subject to input uncertainty, which usually involves solving high-dimensional integrals of the PDE output over a sequence of stochastic variables. In practical computations, one typically needs to discretize the problem in several ways: approximating an infinite-dimensional input random field with a finite-dimensional random field, spatial discretization of the PDE using, e.g., finite elements, and approximating high-dimensional integrals using cubatures such as quasi--Monte Carlo methods. In this paper, we focus on the error resulting from dimension truncation of an input random field. We show how Taylor series can be used to derive theoretical dimension truncation rates for a wide class of problems and we provide a simple checklist of conditions that a parametric mathematical model needs to satisfy in order for our dimension truncation error bound to hold. Some of the novel features of our approach include that our results are applicable to nonaffine parametric operator equations, dimensionally truncated conforming finite element discretized solutions of parametric PDEs, and even compositions of PDE solutions with smooth nonlinear quantities of interest. As a specific application of our method, we derive an improved dimension truncation error bound for elliptic PDEs with lognormally parameterized diffusion coefficients. Numerical examples support our theoretical findings. [ABSTRACT FROM AUTHOR]

Convection-diffusion-reaction equations model the conservation of scalar quantities. From the analytic point of view, solutions of these equations satisfy, under certain conditions, maximum principles, which represent physical bounds of the solution. That the same bounds are respected by numerical approximations of the solution is often of utmost importance in practice. The mathematical formulation of this property, which contributes to the physical consistency of a method, is called the discrete maximum principle (DMP). In many applications, convection dominates diffusion by several orders of magnitude. It is well known that standard discretizations typically do not satisfy the DMP in this convectiondominated regime. In fact, in this case it turns out to be a challenging problem to construct discretizations that, on the one hand, respect the DMP and, on the other hand, compute accurate solutions. This paper presents a survey on finite element methods, with the main focus on the convection-dominated regime, that satisfy a local or a global DMP. The concepts of the underlying numerical analysis are discussed. The survey reveals that for the steady-state problem there are only a few discretizations, all of them nonlinear, that at the same time both satisfy the DMP and compute reasonably accurate solutions, e.g., algebraically stabilized schemes. Moreover, most of these discretizations have been developed in recent years, showing the enormous progress that has been achieved lately. Similarly, methods based on algebraic stabilization, both nonlinear and linear, are currently the only finite element methods that combine the satisfaction of the global DMP and accurate numerical results for the evolutionary equations in the convection-dominated scenario. [ABSTRACT FROM AUTHOR]

The noisy leaky integrate-and-fire (NLIF) model describes the voltage configurations of neuron networks with an interacting many-particles system at a microscopic level. When simulating neuron networks of large sizes, computing a coarse-grained mean-field Fokker--Planck equation solving the voltage densities of the networks at a macroscopic level practically serves as a feasible alternative in its high efficiency and credible accuracy when the interaction within the network remains relatively low. However, the macroscopic model fails to yield valid results of the networks when simulating considerably synchronous networks with active firing events. In this paper, we propose a multiscale solver for the NLIF networks, inheriting the macroscopic solver's low cost and the microscopic solver's high reliability. For each temporal step, the multiscale solver uses the macroscopic solver when the firing rate of the simulated network is low, while it switches to the microscopic solver when the firing rate tends to blow up. Moreover, the macroscopic and microscopic solvers are integrated with a high-precision switching algorithm to ensure the accuracy of the multiscale solver. The validity of the multiscale solver is analyzed from two perspectives: first, we provide practically sufficient conditions that guarantee the mean-field approximation of the macroscopic model and present rigorous numerical analysis on simulation errors when coupling the two solvers; second, the numerical performance of the multiscale solver is validated through simulating several large neuron networks, including networks with either instantaneous or periodic input currents which prompt active firing events over some time. [ABSTRACT FROM AUTHOR]

This paper proposes a sketching strategy with spherical designs to equip the classical spherical basis function (SBF) approach for massive spherical data fitting. We conduct theoretical analysis and numerical verifications to demonstrate the feasibility of the proposed sketching strategy. From the theoretical side, we prove that sketching based on spherical designs can reduce the computational burden of the SBF approach without sacrificing its approximation capability. In particular, we provide upper and lower bounds for the proposed sketching strategy to fit noisy data on spheres. From the experimental side, we numerically illustrate the feasibility of the sketching strategy by showing its comparable fitting performance with the SBF approach. These interesting findings show that the proposed sketching strategy is effective in fitting massive and noisy data on spheres. [ABSTRACT FROM AUTHOR]

Quasiperiodic systems are important space-filling ordered structures, without decay and translational invariance. How to solve quasiperiodic systems accurately and efficiently is a great challenge. A useful approach, the projection method (PM) [J. Comput. Phys., 256 (2014), pp. 428--440], has been proposed to compute quasiperiodic systems. Various studies have demonstrated that the PM is an accurate and efficient method to solve quasiperiodic systems. However, there is a lack of theoretical analysis of the PM. In this paper, we present a rigorous convergence analysis of the PM by establishing a mathematical framework of quasiperiodic functions and their high-dimensional periodic functions. We also give a theoretical analysis of the quasiperiodic spectral method (QSM) based on this framework. Results demonstrate that the PM and QSM both have exponential decay, and the QSM (PM) is a generalization of the periodic Fourier spectral (pseudospectral) method. Then, we analyze the computational complexity of the PM and QSM in calculating quasiperiodic systems. The PM can use a fast Fourier transform, while the QSM cannot. Moreover, we investigate the accuracy and efficiency of the PM, QSM, and periodic approximation method in solving the linear time-dependent quasiperiodic Schr\"odinger equation. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the celebrated Haken--Kelso--Bunz model, describing the dynamics of bimanual coordination, in the presence of delay. We study the linear dynamics, stability, nonlinear behavior, and bifurcations of this model by both theoretical and numerical analysis. We calculate in-phase and antiphase limit cycles as well as quasi-periodic solutions via double Hopf bifurcation analysis and center manifold reduction. Moreover, we uncover further details on the global dynamic behavior by numerical continuation, including the occurrence of limit cycles in phase quadrature and 1-1 locking of quasi-periodic solutions. [ABSTRACT FROM AUTHOR]

In this paper, a coupled electro-calcium model was developed and implemented to computationally explore the effects of neuronal synapse loss, in particular in the context of Alzheimer's disease. Established parameters affected by Alzheimer's disease, such as synapse loss, calcium leaks at deteriorating synaptic contacts, and downregulation of the calcium buffer calbindin, are subject to this study. Reconstructed neurons are used to define the computational domain for a system of PDEs and ODEs, discretized by finite differences and solved with a semi-implicit second-order time integrator. The results show neuronal resilience during synapse loss. When incorporating calcium leaks at affected synapses, neurons lose their ability to produce synapse-tonucleus calcium signals, necessary for learning, plasticity, and neuronal survival. Downregulation of calbindin concentrations partially recovers the signaling pathway to the cell nucleus. These results could define future research pathways toward stabilizing the calcium signaling pathways during Alzheimer's disease. The coupled electro-calcium model was implemented and solved using MATLAB https://github.com/NeuroBox3D/CalcSim. [ABSTRACT FROM AUTHOR]

Just when modern computers (digital, electronic, and programmable) were being invented, John von Neumann and Herman Goldstine wrote a paper to illustrate the mathematical analyses that they believed would be needed to use the new machines effectively and to guide the development of still faster computers. Their foresight and the congruence of historical events made their work the first modern paper in numerical analysis. Von Neumann once remarked that to found a mathematical theory one had to prove the first theorem, which he and Goldstine did for the accuracy of mechanized Gaussian elimination--but their paper was about more than that. Von Neumann and Goldstine described what they surmised would be the significant questions once computers became available for computational science, and they suggested enduring ways to answer them. [ABSTRACT FROM AUTHOR]

Stochastic algebraic Riccati equations, also known as rational algebraic Riccati equations, arising in linear-quadratic optimal control for stochastic linear time-invariant systems, were considered to be not easy to solve. The state-of-the-art numerical methods mostly rely on differentiability or continuity, such as the Newton-type method, the LMI method, or the homotopy method. In this paper, we will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equation. This structure guarantees that to solve them is almost as easy as to solve deterministic/classical ones, which will shed light on the theoretical analysis and numerical algorithm design for this topic. [ABSTRACT FROM AUTHOR]

This paper proposes and examines a finite element method (FEM) for a Maxwell obstacle problem in electric shielding. The model is given by a coupled system comprising the Faraday equation and an evolutionary variational inequality (VI) of Ampère-Maxwell-type. Based on the leapfrog (Yee) time-stepping and the Nédélec edge elements, we set up a fully discrete FEM where the obstacle is discretized in such a way that no additional nonlinear solver is required for the computation of the discrete VI. While the L²-stability is achieved for the discrete solutions and the associated difference quotients, the scheme only guarantees the L¹-stability for the discrete magnetic curl field in the obstacle region. The lack of the global L²-stability for the magnetic curl field is justified by the low regularity issue in Maxwell obstacle problems and turns to be the main challenge in the convergence analysis. Our convergence proof consists of two main stages. First, exploiting the L¹-stability in the obstacle region, we derive a convergence result towards a weaker system involving smooth feasible test functions. In the second step, we recover the original system by enlarging the feasible test function set through a specific constraint preserving mollification process in the spirit of Ern and Guermond [Comput. Methods Appl. Math., 16 (2016), pp. 51-75]. This paper is closed by three-dimensional numerical results of the proposed FEM confirming the theoretical convergence result and, in particular, the Faraday shielding effect. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the energy minimization model arising in the ensemble Kohn--Sham density functional theory for metallic systems, in which a pseudo-eigenvalue matrix and a general smearing approach are involved. We study the invariance of the energy functional and the existence of the minimizer of the ensemble Kohn--Sham model. We propose an adaptive twoparameter step size strategy and the corresponding preconditioned conjugate gradient methods to solve the energy minimization model. Under some mild but reasonable assumptions, we prove the global convergence for the gradients of the energy functional produced by our algorithms. Numerical experiments show that our algorithms are efficient, especially for large scale metallic systems. In particular, our algorithms produce convergent numerical approximations for some metallic systems, for which the traditional self-consistent field iterations fail to converge. [ABSTRACT FROM AUTHOR]

Zeros of rational transfer function matrices R(λ) are the eigenvalues of associated polynomial system matrices P(λ) under minimality conditions. In this paper, we define a structured condition number for a simple eigenvalue λ0 of a (locally) minimal polynomial system matrix P(λ), which in turn is a simple zero λ0 of its transfer function matrix R(λ). Since any rational matrix can be written as the transfer function of a polynomial system matrix, our analysis yields a structured perturbation theory for simple zeros of rational matrices R(λ). To capture all the zeros of R(λ), regardless of whether they are poles, we consider the notion of root vectors. As corollaries of the main results, we pay particular attention to the special case of λ 0 being not a pole of R(λ) since in this case the results get simpler and can be useful in practice. We also compare our structured condition number with Tisseur's unstructured condition number for eigenvalues of matrix polynomials and show that the latter can be unboundedly larger. Finally, we corroborate our analysis by numerical experiments. [ABSTRACT FROM AUTHOR]

Over the last 10 years, results from [J. M. Melenk and S. Sauter, Math. Comp., 79 (2010), pp. 1871--1914], [J. M. Melenk and S. Sauter, SIAM J. Numer. Anal., 49 (2011), pp. 1210--1243], [S. Esterhazy and J. M. Melenk, Numerical Analysis of Multiscale Problems, Springer, New York, 2012, pp. 285--324] and [J. M. Melenk, A. Parsania, and S. Sauter, J. Sci. Comput., 57 (2013), pp. 536--581] decomposing high-frequency Helmholtz solutions into "low-" and "high-" frequency components have had a large impact in the numerical analysis of the Helmholtz equation. These results have been proved for the constant-coefficient Helmholtz equation in either the exterior of a Dirichlet obstacle or an interior domain with an impedance boundary condition. Using the Helffer--Sjöstrand functional calculus [B. Helffer and J. Sjöstrand, Schrödinger Operators, Springer, Berlin, 1989, pp. 118--197] this paper proves analogous decompositions for scattering problems fitting into the black-box scattering framework of Sjöstrand and Zworski [J. Amer. Math. Soc., 4 (1991), pp. 729--769] thus covering Helmholtz problems with variable coefficients, impenetrable obstacles, and penetrable obstacles all at once. These results allow us to prove new frequency-explicit convergence results for (i) the hp-finite-element method (hp-FEM) applied to the variable-coefficient Helmholtz equation in the exterior of an analytic Dirichlet obstacle, where the coefficients are analytic in a neighborhood of the obstacle, and (ii) the h-FEM applied to the Helmholtz penetrable-obstacle transmission problem. In particular, the result in (i) shows that the hp-FEM applied to this problem does not suffer from the pollution effect. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of initial data identification for weak-entropy solutions of the one-dimensional Burgers equation. This problem consists in identifying the set of initial data evolving to a given target at a final time. Due to the time-irreversibility of the Burgers equation, some target functions are unattainable from solutions of this equation, making the identification problem under consideration ill-posed. To get around this issue, we introduce a nonsmooth optimization problem, which consists in minimizing the difference between the predictions of the Burgers equation and the observations of the system at a final time in L² (ℝ) norm. Here, we characterize the set of minimizers of the aforementioned nonsmooth optimization problem. One of the minimizers is the backward entropy solution, constructed using a backward-forward method. Some simulations are given using a wave-front tracking algorithm. [ABSTRACT FROM AUTHOR]

The scattering of linear waves by periodic structures is a crucial phenomena in many branches of applied physics and engineering. In this paper we establish rigorous analytic results necessary for the proper numerical analysis of a class of high-order perturbation of surfaces/asymptotic waveform evaluation (HOPS/AWE) methods for numerically simulating scattering returns from periodic diffraction gratings. More specifically, we prove a theorem on existence and uniqueness of solutions to a system of partial differential equations which model the interaction of linear waves with a periodic two-layer structure. Furthermore, we establish joint analyticity of these solutions with respect to both geometry and frequency perturbations. This result provides hypotheses under which a rigorous numerical analysis could be conducted on our recently developed HOPS/AWE algorithm. [ABSTRACT FROM AUTHOR]

This paper introduces a novel nonlocal partial difference equation (G-PDE) for labeling metric data on graphs. The G-PDE is derived as a nonlocal reparametrization of the assignment flow approach that was introduced in [J. Math. Imaging Vision, 58 (2017), pp. 211-238]. Due to this parameterization, solving the G-PDE numerically is shown to be equivalent to computing the Riemannian gradient flow with respect to a nonconvex potential. We devise an entropy-regularized difference of convex (DC) functions decomposition of this potential and show that the basic geometric Euler scheme for integrating the assignment flow is equivalent to solving the G-PDE by an established DC programming scheme. Moreover, the viewpoint of geometric integration reveals a basic way to exploit higher-order information of the vector field that drives the assignment flow, in order to devise a novel accelerated DC programming scheme. A detailed convergence analysis of both numerical schemes is provided and illustrated by numerical experiments. [ABSTRACT FROM AUTHOR]

This paper establishes a posteriori error analysis for the Stokes equations discretized by an interior penalty type method using H(div) finite elements. The a posteriori error estimator is then employed for designing two grid refinement strategies; one is locally based and the other is globally based. The locally based refinement technique is believed to be able to capture local singularities in the numerical solution. The numerical formulations for the Stokes problem make use of H(div) conforming elements of Raviart-Thomas type. Therefore, the finite element solution features a full satisfaction of the continuity equation (mass conservation). The result of this paper provides a rigorous analysis for the method's reliability and efficiency. In particular, an H¹ norm a posteriori error estimator is obtained, together with upper and lower bound estimates. Numerical results are presented to verify the new theory of a posteriori error estimators. [ABSTRACT FROM AUTHOR]

In recent years, a nonoverlapping Robin-type domain decomposition method (DDM) for the finite element discretization systems of the second order elliptic equations, which is based on using Robin-type boundary conditions as information transmission conditions on the subdomain interfaces, has been developed and analyzed since it was first proposed by P. L. Lions in [On the Schwarz alternating method III: A variant for nonoverlapping subdomains, in Proceedings of the 3rd International Symposium on Domain Decomposition Methods for Partial Differential Equations, SIAM, Philadelphia, PA, 1990, pp. 202-223]. However, the convergence rate of this DDM with many subdomains remains open when the lower term of equations vanishes. This open problem will be considered in this paper. The convergence rate is almost 1 — O(h¹/²H-1/²) in certain cases—for example, the case of a small number of subdomains, where h is the mesh size and H is the size of subdomain. In order to get the desirous convergence results, two mathematics skills are introduced in this paper; one is complexification of real linear space and the other is the spectral radius formula. [ABSTRACT FROM AUTHOR]

Saddle dynamics is a time continuous dynamics to efficiently compute the any-index saddle points and construct the solution landscape. In practice, the saddle dynamics needs to be discretized for numerical computations, while the corresponding numerical analyses are rarely studied in the literature, especially for the high-index cases. In this paper we propose the convergence analysis of discrete high-index saddle dynamics. To be specific, we prove the local linear convergence rates of numerical schemes of high-index saddle dynamics, which indicates that the local curvature in the neighborhood of the saddle point and the accuracy of computing the eigenfunctions are main factors that affect the convergence of discrete saddle dynamics. The proved results serve as compensations for the convergence analysis of high-index saddle dynamics and are substantiated by numerical experiments. [ABSTRACT FROM AUTHOR]

This paper is concerned with resolvent estimates on the real axis for the Helmholtz equation posed in the exterior of a bounded obstacle with Dirichlet boundary conditions when the obstacle is trapping. There are two resolvent estimates for this situation currently in the literature: (i) in the case of elliptic trapping the general "worst case" bound of exponential growth applies, and examples show that this growth can be realized through some sequence of wavenumbers; (ii) in the prototypical case of hyperbolic trapping where the Helmholtz equation is posed in the exterior of two strictly convex obstacles (or several obstacles with additional constraints) the nontrapping resolvent estimate holds with a logarithmic loss. This paper proves the first resolvent estimate for parabolic trapping by obstacles, studying a class of obstacles the prototypical example of which is the exterior of two squares (in two dimensions) or two cubes (in three dimensions), whose sides are parallel. We show, via developments of the vector-field/multiplier argument of Morawetz and the first application of this methodology to trapping configurations, that a resolvent estimate holds with a polynomial loss over the nontrapping estimate. We use this bound, along with the other trapping resolvent estimates, to prove results about integral equation formulations of the boundary value problem in the case of trapping. Feeding these bounds into existing frameworks for analyzing finite and boundary element methods, we obtain the first wavenumber-explicit proofs of convergence for numerical methods for solving the Helmholtz equation in the exterior of a trapping obstacle. [ABSTRACT FROM AUTHOR]

The aim of this paper is to discuss the mathematical modeling of Brownian active particle systems, a recently popular paradigmatic system for self-propelled particles. We present four microscopic models with different types of repulsive interactions between particles and their associated macroscopic models, which are formally obtained using different coarse-graining methods. The macroscopic limits are integro-differential equations for the density in phase space (positions and orientations) of the particles and may include nonlinearities in both the diffusive and advective components. In contrast to passive particles, systems of active particles can undergo phase separation without any attractive interactions, a mechanism known as motility-induced phase separation (MIPS). We explore the onset of such a transition for each model in the parameter space of occupied volume fraction and P'eclet number via a linear stability analysis and numerical simulations at both the microscopic and macroscopic levels. We establish that one of the models, namely, the mean-field model which assumes long-range repulsive interactions, cannot explain the emergence of MIPS. In contrast, MIPS is observed for the remaining three models that assume short-range interactions that localize the interaction terms in space. [ABSTRACT FROM AUTHOR]

The goal of this paper is to relate the capacitance matrix formalism to the tightbinding approximation. By doing so, we open the way to the use of mathematical techniques and tools from condensed matter theory in the mathematical and numerical analysis of metamaterials, in particular for the understanding of their topological properties. We first study how the capacitance matrix formalism, both when the material parameters are static and modulated, can be posed in a Hamiltonian form. Then, we use this result to compare this formalism to the tight-binding approximation. We prove that the correspondence between the capacitance formulation and the tight-binding approximation holds only in the case of dilute resonators. On the other hand, the tight-binding model is often coupled with a nearest-neighbor approximation, whereby long-range interactions are neglected. Even in the dilute case, we show that long-range interactions between subwavelength resonators are relatively strong and nearest-neighbor approximations are not generally appropriate. [ABSTRACT FROM AUTHOR]

In this paper, we study the propagation speeds of reaction-diffusion-advection fronts in time-periodic cellular and chaotic flows with Kolmogorov-Petrovsky-Piskunov (KPP) nonlinearity. We first apply the variational principle to reduce the computation of KPP front speeds to a principal eigenvalue problem of a linear advection-diffusion operator with space-time periodic coefficient on a periodic domain. To this end, we develop efficient Lagrangian particle methods to compute the principal eigenvalue through the Feynman-Kac formula. By estimating the convergence rate of Feynman-Kac semigroups and the operator splitting method for approximating the linear advection-diffusion solution operators, we obtain convergence analysis for the proposed numerical method. Finally, we present numerical results to demonstrate the accuracy and efficiency of the proposed method in computing KPP front speeds in time-periodic cellular and chaotic flows, especially the time-dependent Arnold-Beltrami-Childress flow and time-dependent Kolmogorov flow in three-dimensional space. [ABSTRACT FROM AUTHOR]

In this paper we are concerned with solvers for the systems arising from the plane wave discretizations of three dimensional Helmholtz equations with large wave numbers. For simplicity, we consider only the plane wave weighted least squares (PWLS) method for Helmholtz equations. The main goal of this paper is to construct efficient multilevel preconditioners for solving the resulting Helmholtz systems. To this end, we first build a multilevel space decomposition for the plane wave discretization space based on overlapping domain decompositions. Then, corresponding to the space decomposition, we construct two additive multilevel preconditioners with smoothers for the underlying Helmholtz systems. In these preconditioners, each subproblem to be solved has a very small number of degrees of freedom, which just equals the number of the plane wave basis functions on one element. Moreover, the preconditioners possess the optimal computational complexity per iteration. We apply the proposed multilevel preconditioners with a constant coarse mesh size to solve the systems generated by the PWLS discretization for three dimensional Helmholtz equations, and we find that the new preconditioners possess nearly stable convergence, i.e., the iteration counts of the preconditioned CG methods with the preconditioners increase very slowly when the wave number increases (and the fine mesh size decreases). [ABSTRACT FROM AUTHOR]

Motivated by a wide range of real-world problems whose solutions exhibit boundary and interior layers, the numerical analysis of discretizations of singularly perturbed differential equations is an established subdiscipline within the study of the numerical approximation of solutions to differential equations. Consequently, much is known about how to accurately and stably discretize such equations on a priori adapted meshes in order to properly resolve the layer structure present in their continuum solutions. However, despite being a key step in the numerical simulation process, much less is known about the efficient and accurate solution of the linear systems of equations corresponding to these discretizations. In this paper, we discuss problems associated with the application of direct solvers to these discretizations, and we propose a preconditioning strategy that is tuned to the matrix structure induced by using layer-adapted meshes for convection-diffusion equations, proving a strong condition-number bound on the preconditioned system in one spatial dimension and a weaker bound in two spatial dimensions. Numerical results confirm the efficiency of the resulting preconditioners in one and two dimensions, with time-to-solution of less than one second for representative problems on 1024 x 1024 meshes and up to 40 x speedup over standard sparse direct solvers. [ABSTRACT FROM AUTHOR]

This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow the general structure of constructing an approximate LDLI factorization by eliminating the unknowns layer by layer starting from an absorbing layer or boundary condition. The central idea of this paper is to approximate the Schur complement matrices of the factorization using moving perfectly matched layers (PMLs) introduced in the interior of the domain. Applying each Schur complement matrix is equivalent to solving a quasi-1D problem with a banded LU factorization in the 2D case and to solving a quasi-2D problem with B multifrontal method in the 3D case. The resulting preconditioner has linear application cost, and the preconditioned iterative solver converges in a number of iterations that is essentially independent of the number of unknowns or the frequency. Numerical results are presented in both two and three dimensions to demonstrate the efficiency of this new preconditioner. [ABSTRACT FROM AUTHOR]

This paper concerns numerical methods for computing complex geometrical optics (CGO) solutions to the conductivity equation ∇ ⋅ σ∇u (⋅, k) = 0 in ℝ² for piecewise smooth conductivities σ, where k is a complex parameter. The key is to solve an R-linear singular integral equation defined in the unit disk. Recently, Astala et al. [Appl. Comput. Harmon. Anat., 29 (2010), pp. 2-17] proposed a complicated method for numerical computation of CGO solutions by solving a periodic version of the ℝ-linear integral equation in a rectangle containing the unit disk. In this paper, based on the fast algorithms in [P. Daripa and D. Mashat, Numer. Algorithms, 18 (1998), pp. 133-157] for singular integral transforms, we propose a simpler numerical method which solves the ℝ-linear integral equation in the unit disk directly. For the resulting ℝ-linear operator equation, a minimal residual iterative method is proposed. Numerical examples illustrate the accuracy and efficiency of the new method. [ABSTRACT FROM AUTHOR]

We consider a class of stochastic path-dependent volatility models where the stochastic volatility, whose square follows the Cox-Ingersoll-Ross model, is multiplied by a (leverage) function of the spot process, its running maximum, and time. We propose a Monte Carlo simulation scheme which combines a log-Euler scheme for the spot process with the full truncation Euler scheme or the backward Euler-Maruyama scheme for the squared stochastic volatility component. Under some mild regularity assumptions and a condition on the Feller ratio, we establish the strong convergence with order 1/2 (up to a logarithmic factor) of the approximation process up to a critical time. The model studied in this paper contains as special cases Heston-type stochastic-local volatility models, the state of the art in derivative pricing, and a relatively new class of path-dependent volatility models. The present paper is the rst to prove the convergence of the popular Euler schemes with a positive rate, which is moreover consistent with that for Lipschitz coeffcients and hence optimal. [ABSTRACT FROM AUTHOR]

In this paper we study the level set formulations of certain geometric evolution equations from a numerical point of view. Specifically, we consider the flow by powers greater than one of the mean curvature (PMCF) and the inverse mean curvature flow (IMCF). Since the corresponding equations in level set form are quasi-linear, degenerate, and especially possibly singular a regularization method is used in the literature to approximate these equations to overcome the singularities of the equations. The regularized equations depend both on an regularization parameter and in case of the ICMF additionally on further parameters. Motivated by Feng, Neilan, and Prohl [Numer. Math., 108 (2007), pp. 93-119], who study the finite element approximation of IMCF, we prove error estimates for the finite element approximation of the regularized equations for PMCF. We validate the rates with numerical examples. Additionally, the regularization error in the rotationally symmetric case for both flows is numerically analyzed in a two-dimensional setting. Therefore, in the case of IMCF we fix the additional parameters. Furthermore, having the goal to estimate the regularization error we derive barriers for the regularized level set IMCF respecting all parameters and specify them further in a rotationally symmetric simplified case. At the end of the paper we present simulations in the three-dimensional case. [ABSTRACT FROM AUTHOR]

The present paper, consisting of two parts, is sequential to [A. A. Borovkov and A. A. Mogulskii, Theory Probab. AppI., 51(2007), pp. 227-255 and pp. 567-594}, (A. A. Borovkov and K. A. Borovkov, Theory Probab. AppI., 46 (2002), pp. 193-213 and 49 (2005), pp. 189-206], and [A. A. Borovkov and K. A. Borovkov, Asymptotic Analysis of Random Walks. I. Slowly Decreasing Distributions, of Jumps, Nauka, Moscow (in Russian), to be published] and is devoted to studying the asymptotics of the probability that the sum of the independent random vectors is in a small cube with the vertex at point x in the large deviations zone. The papers [A. A. Borovkov and A. A. Mogulskii, Theory Probab. AppI., 51(2007), pp. 227-255 and pp. 567-594) are mostly devoted to the "regular deviations" problem (the problem (A] using the terminology of [A. A. Borovkov and A. A. Mogulskii, Theory Probab. Appl., 51 (2007), pp. 227-255 and pp. 567-594]), when the relative ("normalized") deviations x/n (n is the number of terms in the sum) are in the analyticity domain of the large deviations rate function for the summands (the so-called Cramer deviations zone) and at the same time ∣x∣/n → ∞ (superlarge deviations). In the present paper we study the "alternative" problem of "irregular deviations" when s/n either approaches the boundary of the Cramer deviations zone or moves away from this zone (the problem [B) using the terminology of [A. A. Borovkov and A. A. Mogulskii, Theory Probab. AppL, 51(2007), pp. 227-255 and pp. 567-594]). In this case the large deviations problems in many aspects remained unknown. The desired asymptotics for deviations close to the boundary of the Cramér zone is obtained in section I of this paper under quite weak conditions in the general multivariate case. Furthermore, in the univariate case we also study the deviations which are bounded away from the Cramer zone. In this case we require some additional regularity properties for the distributions of the summands. [ABSTRACT FROM AUTHOR]

The present paper uses results from algebraic geometry to study the classical model describing the equilibrium frequencies of the four gametic types in the two-locus, two-allele genetic model under the assumption that the fitnesses are constant and that the cis- and trans- fitnesses are equal. It shows that there is a finite process for determining an upper bound on the maximum number of equilibrium frequencies for almost all choices of recombination and fitness parameters, and that this number is finite. It also shows that the solutions are locally continuous for almost all choices of parameters. The paper studies the equilibrium frequencies as functions of the recombination parameter, with attention to the cases when the recombination becomes infinite and when one of the equilibrium frequencies becomes infinite. [ABSTRACT FROM AUTHOR]

This paper is mainly concerned with a two-species competition model in open advective environments, where individuals cannot pass through the upstream boundary and do not return to the habitat after leaving the downstream boundary. By the theory of principal eigenvalue, we first obtain two critical curves (Γ1 and Γ2) in the plane of bifurcation parameters that sharply determine the local stability of the two semitrivial steady states. Then under various conditions on given parameters, we discuss the global dynamics via different techniques, including the comparison principle for eigenvalues and perturbation and compactness arguments, and show that both competitive exclusion and coexistence are possible. For general values of parameters, we take both analytic and numerical approaches to further understand the potential behaviors of Γ1 and Γ2, and we numerically observe that in addition to the competitive exclusion and coexistence, the bistable phenomenon is also possible, which is different from the known results of competitive ODE and reaction-diffusion systems (where bistability is impossible). The implication of our numerical results on future work is also discussed. [ABSTRACT FROM AUTHOR]

An earlier paper proved the convergence of a variable stepsize Bregman operator splitting algorithm (BOSVS) for minimizing ø(Bu) + H(u), where H and ø are convex functions, and ø is possibly nonsmooth. The algorithm was shown to be relatively efficient when applied to partially parallel magnetic resonance image reconstruction problems. In this paper, the convergence rate of BOSVS is analyzed. When H(u) = ‖Au - f ‖2, where A is a matrix, it is shown that for an ergodic approximation uk obtained by averaging k BOSVS iterates, the error in the objective value ø(Buk)+H(uk) is O(1/k). When the optimization problem has a unique solution u*, we obtain the estimate ‖uk-u*‖ = O(1/ √ k). The theoretical analysis is compared to observed convergence rates for partially parallel magnetic resonance image reconstruction problems where A is a large dense ill-conditioned matrix. [ABSTRACT FROM AUTHOR]

Observational errors can be categorized into two groups: random noise, which is altered every time when measurement is repeated, and a systematic temporally invariant error. In this paper, we propose a method to estimate the covariance structure for systematic error and random noise using a small number of repeated measurements of the signal. We model the systematic and random components as stationary Gaussian random fields and use the Bayesian approach to estimate the spatial covariance functions of these components simultaneously. The study is motivated by an application related to the diagnosis of joint diseases using contrast enhanced computer tomography (CT) measurements. The noise in the measured contrast agent concentration profiles within cartilage tissue is strongly spatially correlated and includes a systematic component. Since the estimates are significantly sensitive to all errors in modeling, the systematic error and random noise components should be characterized for reliable estimation. The method proposed in this paper can be used to construct approximative covariance matrices for the observational noise using a small number of CT measurements. The capabilities of the proposed method are demonstrated using numerical simulations and also real CT data corresponding to measurements of contrast agent diffusion profile in cartilage. [ABSTRACT FROM AUTHOR]

We consider the numerical solution of boundary value problems for general neutral functional differential equations by the collocation method. The collocation method can be applied in two versions: the finite element method and the spectral element method. We give convergence results for the collocation method deduced by the convergence theory developed in [S. Maset, Numer. Math., (2015), pp. 1-31] for a general discretization of an abstract reformulation of the problems. Such convergence results are then applied in Part II [S. Maset, SIAM J. Numer. Anal., 53 (2015), pp. 2794-2821] of this paper to boundary values problems for a particular type of neutral functional differential equations, namely, differential equations with deviating arguments. [ABSTRACT FROM AUTHOR]

Nonlinear multiscale problems are ubiquitous in materials science and biology. Complicated interactions between nonlinearities and (nonseparable) multiple scales pose a major challenge for analysis and simulation. In this paper, we study the numerical homogenization for multiscale elliptic PDEs with monotone nonlinearity, in particular the Leray--Lions problem (a prototypical example is the p-Laplacian equation), where the nonlinearity cannot be parameterized with low dimensional parameters, and the linearization error is nonnegligible. We develop the iterated numerical homogenization scheme by combining numerical homogenization methods for linear equations and the so-called quasi-norm based iterative approach for monotone nonlinear equation. We propose a residual regularized nonlinear iterative method and, in addition, develop the sparse updating method for the efficient update of coarse spaces. A number of numerical results are presented to complement the analysis and validate the numerical method. [ABSTRACT FROM AUTHOR]

In this paper, we consider the generalized eigenvalue problem (GEP) for bidiagonalproduct (BP) pairs with sign regularity (SR), which include structured pairs associated with illconditioned matrices, such as Cauchy and Vandermonde matrices, that arise in many applications. A sufficient and necessary condition is provided for an SR-BP pair to be regular. For regular SR-BP pairs having both matrices singular, we establish sharp relative perturbation bounds to show that all the generalized eigenvalues including infinite and zero ones can be accurately determined by their BP representations. By operating on the BP representations, a new method is developed to accurately compute generalized eigenvalues of such a regular SR-BP pair. Our method first transforms the pair into an equivalent pair with a certain sign regularity. Then a technique is proposed to implicitly deflate all the infinite eigenvalues. After deflating infinite eigenvalues, finite eigenvalues are computed by reducing the deflated GEP into a standard eigenvalue problem. An attractive property of our method is that all the generalized eigenvalues are returned to high relative accuracy especially, all the infinite and zero eigenvalues are computed exactly. Error analysis and numerical experiments are performed to confirm the claimed high relative accuracy. [ABSTRACT FROM AUTHOR]

This paper proposes a simple and rigorous Fourier-matching method to study transverse-magnetic-polarized electro-magnetic resonances by a perfectly conducting slab with a finite number of subwavelength slits of width h\ll 1. Since variable separation is applicable in the region outside the slits, by Fourier transforming its governing equation, a magnetic field can be represented in terms of its derivative on the aperture. Next, inside each slit where variable separation is still available, the field can be represented as a Fourier series in terms of a countable set of basis functions with unknown Fourier coefficients. Finally, by matching the two subdomain representations on the aperture, we establish a linear system of an infinite number of equations governing the countable Fourier coefficients; the unknowns are further rescaled to be in the standard l² space. By the asymptotic expansion of each entry of the coefficient matrix, we rigorously show that its certain principal submatrix is invertible so that the infinite-dimensional linear system can be reduced to a finite-dimensional linear system. Resonance frequencies are exactly those frequencies making the linear system rank-deficient. This in turn leads to an asymptotic formula of accuracy O (h³ log h) for computing the resonance frequencies. We emphasize that the new formula is more accurate than all existing results and is the first formula for slits of number more than two to the best of our knowledge. Numerical experiments are carried out finally to validate the proposed formula and demonstrate its accuracy. [ABSTRACT FROM AUTHOR]

In this paper, we prove the global existence and uniqueness of a mild solution to the relativistic Boltzmann equation both in the whole space and in torus for a class of initial data with bounded velocity-weighted L∞-norm and some smallness on Lx¹Lp∞ -norm as well as on defect mass, energy, and entropy. Moreover, the asymptotic stability of the solutions is also investigated in the case of torus. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to investigate mathematically the fundamental mechanism of gas discharge. Townsend discovered that α- and γ-mechanisms are essential for a gas ionization process. Morrow, Degond, and Lucquin-Desreux derived a mathematical model taking these two mechanisms into account. This model consists of nonlinear hyperbolic, parabolic, and elliptic partial differential equations. In this paper, we establish a framework for analyzing this model rigorously, because no mathematical result has been announced. More precisely, we show the unique existence of a time-local solution to an initial-boundary value problem over an unbounded domain. The main difficulty of this problem lies in the fact that the direction of boundary characteristics of a hyperbolic equation degenerates at infinite distance. Generally speaking, the regularity of solutions to linearized hyperbolic equations with degenerate boundary characteristics may be lost near the boundary. This implies the possibility that loss on the derivatives arises at each step of the inductive scheme to solve the nonlinear problem. We first use the weighted Sobolev spaces in the construction of solutions to make clear the direction of characteristics. Furthermore, we reduce the initial-boundary value problem for the hyperbolic equation to an initial value problem by applying several extension operators. This reduction enables us to avoid the loss on the derivatives. [ABSTRACT FROM AUTHOR]

This paper is concerned with efficient representations and approximations of the solution to the scattering problem by a system of strongly coupled plasmonic particles. Three schemes are developed: the first is the resonant expansion which uses the resonant modes of the system of particles computed by a conformal transformation, the second is the hybridized resonant expansion which uses linear combinations of the resonant modes for each of the particles in the system as a basis to represent the solution, and the last one is the multipole expansion with respect to the origin. By considering a system formed by two plasmonic particles of circular shape, we demonstrate the relations between these expansion schemes and their advantages and disadvantages both analytically and numerically. In particular, we emphasize the efficiency of the resonant expansion scheme in approximating the near field of the system of particles. The difference between these plasmonic particle systems and the nonresonant dielectric particle system is also highlighted. The paper provides a guidance on the challenges for numerical simulations of strongly coupled plasmonic systems. [ABSTRACT FROM AUTHOR]

We consider a vector-Laplace problem posed on a two-dimensional surface embedded in a three-dimensional domain, which results from the modeling of surface fluids based on exterior Cartesian differential operators. The main topic of this paper is the development and analysis of a finite element method for the discretization of this surface partial differential equation. We apply the trace finite element technique, in which finite element spaces on a background shape-regular tetrahedral mesh that is surface independent are used for discretization. In order to satisfy the constraint that the solution vector field is tangential to the surface we introduce a Lagrange multiplier. We show well-posedness of the resulting saddle point formulation. A discrete variant of this formulation is introduced which contains suitable stabilization terms and is based on trace finite element spaces. For this method we derive optimal discretization error bounds. Furthermore algebraic properties of the resulting discrete saddle point problem are studied. In particular an optimal Schur complement preconditioner is proposed. Results of a numerical experiment are included. [ABSTRACT FROM AUTHOR]

The paper studies the convergence properties of (continuous-time) best-response dynamics from game theory. Despite their fundamental role in game theory, best-response dynamics are poorly understood in many games of interest due to the discontinuous, set-valued nature of the best-response map. The paper focuses on elucidating several important properties of best-response dynamics in the class of multiagent games known as potential games--a class of games with fundamental importance in multiagent systems and distributed control. It is shown that in almost every potential game and for almost every initial condition, the best-response dynamics (i) have a unique solution, (ii) converge to pure-strategy Nash equilibria, and (iii) converge at an exponential rate. [ABSTRACT FROM AUTHOR]

The improved Boussinesq equation is studied in this paper. Control properties for this equation posed on a bounded interval are first considered. When the control acts through the Dirichlet boundary condition the linearized system is proved to be approximately but not spectrally controllable. In a second part, the equation is posed on the one-dimensional torus and distributed moving controls are considered. Under some condition on the velocity at which the control moves, exact controllability results for both linear and nonlinear improved Boussinesq equations are obtained applying the moment method and a fixed point argument. [ABSTRACT FROM AUTHOR]

In this paper, we will introduce a high order numerical method to solve the scattering problems with nonperiodic incident fields and (locally perturbed) periodic surfaces. For the problems we are considering, the classical methods to treat quasi-periodic scattering problems no longer work, while a Bloch transform based numerical method was proposed in [A. Lechleiter and R. Zhang, SIAM J. Sci. Comput., 39 (2017), pp. B819{B839]. This numerical method, on one hand, is able to solve this kind of problem convergently; on the other hand, it takes up a lot of time and memory during the computation. The motivation of this paper is to improve this numerical method from the regularity results of the Bloch transform of the total field, which have been studied in [R. Zhang, arXiv:1708.0756, 2017]. As the set of the singularities of the total field is discrete in R and finite in one periodic cell, we are able to improve the numerical method by designing a proper integration contour with special conditions at the singularities. With a good choice of the transformation, we can prove that the new numerical method could possess a super algebraic convergence rate. This new method improves the efficiency significantly. At the end of this paper, several numerical results will be provided to show the fast convergence of the new method. The method also provides a possibility to solve more complicated problems efficiently, e.g., three-dimensional problems or electromagnetic scattering problems. [ABSTRACT FROM AUTHOR]