相关论文: Geometric study of Gardner equation

We consider difference schemes for nonlinear time fractional Klein-Gordon type equations in this paper. A linearized scheme is proposed to solve the problem. As a result, iterative method need not be employed. One of the main difficulties…

Starting with an exact and simple geodesic, we generate approximate geodesics by summing up higher-order geodesic deviations within a General Relativistic setting, without using Newtonian and post-Newtonian approximations. We apply this…

Inspired by the formulation of the Batalin-Vilkovisky method of quantization in terms of ``odd time'', we show that for a class of gauge theories which are first order in the derivatives, the kinetic term is bilinear in the fields, and the…

In this paper the metric theory of Diophantine approximation associated with the small linear forms is investigated. Khintchine-Groshev theorems are established along with Hausdorff measure generalization without the monotonic assumption on…

In this work we obtain the general form of polynomial mappings that commute with a linear action of a relative symmetry group. The aim is to give results for relative equivariant polynomials that correspond to the results for relative…

We present a new fast solver to calculate fixed-boundary plasma equilibria in toroidally axisymmetric geometries. By combining conformal mapping with Fourier and integral equation methods on the unit disk, we show that high-order accuracy…

The embedded discontinuous Galerkin (EDG) method by Cockburn et al. [SIAM J. Numer. Anal., 2009, 47(4), 2686-2707] is obtained from the hybridizable discontinuous Galerkin method by changing the space of the Lagrangian multiplier from…

We obtain estimates of the multiplicative constants appearing in local convergence results of the Riemannian Gauss-Newton method for least squares problems on manifolds and relate them to the geometric condition number of [P. B\"urgisser…

This paper presents a detailed theoretical analysis of the three stochastic approximation proximal gradient algorithms proposed in our companion paper [49] to set regularization parameters by marginal maximum likelihood estimation. We prove…

We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…

In this paper we study the numerical method for approximating the random periodic solution of semiliear stochastic evolution equations. The main challenge lies in proving a convergence over an infinite time horizon while simulating…

We propose a new adaptive algorithm for the approximation of the Landau-Lifshitz-Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically,…

GMRES is a popular Krylov subspace method for solving linear systems of equations involving a general non-Hermitian coefficient matrix. The conventional bounds on GMRES convergence involve polynomial approximation problems in the complex…

Using a scaling symmetry, it is shown how to compute polynomial conservation laws, generalized symmetries, recursion operators, Lax pairs, and bilinear forms of polynomial nonlinear partial differential equations thereby establishing their…

We develop a variational scheme called "Gutzwiller renormalization group" (GRG), which enables us to calculate the ground state of Anderson impurity models (AIM) with arbitrary numerical precision. Our method can exploit the…

We study the best uniform approximation by polynomials of fixed degree of the function sgn(x) on the union of two intervals symmetric with respect to the origin. We obtain precise asymptotics, with explicit constants, for the error of the…

Given a finitely presented Graded Commutative Differential Algebra (GCDA), we present a method to compute its minimal model, together with a map that is a quasi-isomorphism up to a given degree. The method works by adding generators one by…

In this paper we present a first-order method that admits near-optimal convergence rates for convex/concave min-max problems while requiring a simple and intuitive analysis. Similarly to the seminal work of Nemirovski and the recent…

We study two techniques for correcting the geometrical error associated with domain approximation by a polygon. The first was introduced some time ago \cite{bramble1972projection} and leads to a nonsymmetric formulation for Poisson's…

The aim of this paper is to establish a theory of Galerkin approximations to the space of convex and compact subsets of $\R^d$ with favorable properties, both from a theoretical and from a computational perspective. These Galerkin spaces…