Related papers: Exact calculation of degrees for lattice equations…
We describe a first-principles method to apply lattice QCD to compute the order $\alpha_{\mathrm{EM}}$ corrections to $K\to\pi\ell\nu_\ell$ decay. This method formulates the calculation in infinite volume with the conventional…
We propose to extend the d'Humi\'eres version of the lattice Boltzmann scheme to triangular meshes. We use Bravais lattices or more general lattices with the property that the degree of each internal vertex is supposed to be constant. On…
Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number…
We study the computational complexity certification of inexact gradient augmented Lagrangian methods for solving convex optimization problems with complicated constraints. We solve the augmented Lagrangian dual problem that arises from the…
Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…
A concise theoretical framework, the $\textit{partial}$ Gauss-Hermite quadrature (pGHQ), is established for constructing on-node lattices of the lattice Boltzmann (LB) method under a Cartesian coordinate system. Comparing with existing…
Lattice Boltzmann schemes rely on the enlargement of the size of the target problem in order to solve PDEs in a highly parallelizable and efficient kinetic-like fashion, split into a collision and a stream phase. This structure, despite the…
The complex software systems developed nowadays require assessing their quality and proneness to errors. Reducing code complexity is a never-ending problem, especially in today's fast pace of software systems development. Therefore, the…
Consider the diffusive Hamilton-Jacobi equation $$u_t-\Delta u=|\nabla u|^p+h(x)\ \ \text{ in } \Omega\times(0,T)$$ with Dirichlet conditions, which arises in stochastic control problems as well as in KPZ type models. We study the question…
In this paper, we present how high-order accurate solutions to elliptic partial differential equations can be achieved in arbitrary spatial domains using radial basis function-generated finite differences (RBF-FD) on unfitted node sets…
In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. The algorithm uses a variable stepsize which is updated at each iteration and based on some previous…
In this article we investigate on the convergence of the natural iteration method, a numerical procedure widely employed in the statistical mechanics of lattice systems to minimize Kikuchi's cluster variational free energies. We discuss a…
Boltzmann's entropy is an important feature of any dynamic system. Calculating Boltzmann's entropy directly as the logarithm of the total number of microstates for a current macrostate is difficult for large systems. In the case of studying…
Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…
Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…
The single exponential (SE) and double exponential (DE) formulas are widely recognized as efficient quadrature formulas for evaluating integrals with endpoint singularity. For integrals exhibiting algebraic singularity, explicit error…
Latitude on the choice of initialisation is a shared feature between one-step extended state-space and multi-step methods. The paper focuses on lattice Boltzmann schemes, which can be interpreted as examples of both previous categories of…
We present convergence theory for corrected quadrature rules on uniform Cartesian grids for functions with a point singularity. We begin by deriving an error estimate for the punctured trapezoidal rule, and then derive error expansions. We…
We approximately compute the correspondence degree (as defined by Lazarsfeld and Martin) between two unbalanced complete intersections. This is accomplished by showing that the procedure of taking a subvariety of a product $Y \times Y'$ and…
The paper proposes a novel hybrid method for solving equilibrium problems and fixed point problems. By constructing specially cutting-halfspaces, in this algorithm, only an optimization program is solved at each iteration without the…