Related papers: Exact calculation of degrees for lattice equations…
The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that…
The article proposes formulating and codifying a set of applied numerical methods, coined as Deep Learning Discrete Calculus (DLDC), that uses the knowledge from discrete numerical methods to interpret the deep learning algorithms through…
We present an algorithm which computes the Hilbert depth of a graded module based on a theorem of Uliczka. Connected to a Herzog's question we see that the Hilbert depth of a direct sum of modules can be strictly bigger than the Hilbert…
A self-learning algebraic multigrid method for dominant and minimal singular triplets and eigenpairs is described. The method consists of two multilevel phases. In the first, multiplicative phase (setup phase), tentative singular triplets…
This paper presents high-order numerical methods for solving boundary value problems associated with the Lane-Emden equation, which frequently arises in astrophysics and various nonlinear models. A major challenge in studying this equation…
We adapt the Gradient Discretisation Method (GDM), originally designed for elliptic and parabolic partial differential equations, to the case of a linear scalar hyperbolic equations. This enables the simultaneous design and convergence…
We discuss umbral calculus as a method of systematically discretizing linear differential equations while preserving their point symmetries as well as generalized symmetries. The method is then applied to the Schr\"{o}dinger equation in…
We introduce a generalized finite difference method for solving a large range of fully nonlinear elliptic partial differential equations in three dimensions. Methods are based on Cartesian grids, augmented by additional points carefully…
Efficient computation of lattice defect geometries such as point defects, dislocations, disconnections, grain boundaries, interfaces and free surfaces requires accurate coupling of displacements near the defect to the long-range elastic…
In this work we explore the fidelity of numerical approximations to the analytic spectra of hyperbolic partial differential equation systems with variable coefficients. We are particularly interested in the ability of discrete methods to…
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
This paper is concerned with investigating the asymptotic behavior of the gradients of solutions to a class of elliptic systems with general boundary data, especially covering the Lam\'{e} systems, in a narrow region. The novelty of this…
We develop a hybrid spatial discretization for the wave equation in second order form, based on high-order accurate finite difference methods and discontinuous Galerkin methods. The hybridization combines computational efficiency of finite…
This paper analyzes the numerical approximation of the Lindblad master equation on infinite-dimensional Hilbert spaces. We employ a classical Galerkin approach for spatial discretization and investigate the convergence of the discretized…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
We consider the solution of initial value problems within the context of hybrid systems and emphasise the use of high precision approximations (in software for exact real arithmetic). We propose a novel algorithm for the computation of…
The dynamical degree $\lambda(f)$ of a birational transformation $f$ measures the exponential growth rate of the degree of the formulae that define the $n$-th iterate of $f$. We study the set of all dynamical degrees of all birational…
We introduce an exactly solvable lattice model that reveals a universal finite-size scaling law for configurational entropy driven purely by geometry. Using exact enumeration via Burnside's lemma, we compute the entropy for diverse 1D, 2D,…
A new lattice Boltzmann scheme associated with flexible specific heat ratio is proposed. The new free degree is introduced via the internal energy associated with the internal structure. The evolution equation of the distribution function…