English
Related papers

Related papers: Point Decomposition Problem in Binary Elliptic Cur…

200 papers

Inspired by rational canonical forms, we introduce and analyze two decompositions of dynamic programming (DP) problems for systems with linear dynamics. Specifically, we consider both finite and infinite horizon DP problems in which the…

Optimization and Control · Mathematics 2015-10-15 Manolis C. Tsakiris , Danielle C. Tarraf

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

Numerical Analysis · Mathematics 2018-07-03 Long Chen , Xuehai Huang

We derive sharp decay estimates and prove holomorphic extensions for the solutions of a class of semilinear nonlocal elliptic equations with linear part given by a sum of Fourier multipliers with finitely smooth symbols at the origin.…

Analysis of PDEs · Mathematics 2018-03-23 Marco Cappiello , Fabio Nicola

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

Number Theory · Mathematics 2020-12-15 Puyun Gao

We study the critical points of the solution of second elliptic equations in divergence and diagonal form with a bounded and positive definite coefficient, under the assumption that the statement of the Hopf lemma holds (sign assumptions on…

Analysis of PDEs · Mathematics 2026-01-13 Rolando Magnanini , Serge Nicaise , Madeline Chauvier

A new decomposition optimization algorithm, called \textit{path-following gradient-based decomposition}, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this…

Optimization and Control · Mathematics 2012-09-21 Quoc Tran Dinh , Ion Necoara , Moritz Diehl

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

Number Theory · Mathematics 2016-01-15 David Kohel

In this paper we present an algebraic dimension-oblivious two-level domain decomposition solver for discretizations of elliptic partial differential equations. The proposed parallel solver is based on a space-filling curve partitioning…

Numerical Analysis · Mathematics 2026-05-01 Michael Griebel , Marc Alexander Schweitzer , Lukas Troska

Let $\E$ be an ordinary elliptic curve over a finite field $\F_{q}$ of $q$ elements and $x(Q)$ denote the $x$-coordinate of a point $Q = (x(Q),y(Q))$ on $\E$. Given an $\F_q$-rational point $P$ of order $T$, we show that for any subsets…

Number Theory · Mathematics 2008-06-05 Omran Ahmadi , Igor Shparlinski

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

Optimization and Control · Mathematics 2011-12-08 Jesus A. De Loera , Peter N. Malkin , Pablo A. Parrilo

The deformation problem for pseudoholomorphic curves and related geometrical properties of the total moduli space of pseudoholomorphic curves are studied. A sufficient condition for the saddle point property of the total moduli space is…

Symplectic Geometry · Mathematics 2007-05-23 Vsevolod Shevchishin

We study a superlinear elliptic boundary value problem involving the $p$-laplacian operator, with changing sign weights. The problem has positive solutions bifurcating from the trivial solution set at the two principal eigenvalues of the…

Analysis of PDEs · Mathematics 2024-05-10 Mabel Cuesta , Rosa Pardo

In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special focus is on constrained problems especially when the…

Optimization and Control · Mathematics 2013-03-22 Cordian Riener , Thorsten Theobald , Lina Jansson Andrén , Jean B. Lasserre

The elliptic 2-Hessian equation is a fully nonlinear partial differential equation (PDE) that is related to intrinsic curvature for three dimensional manifolds. We introduce two numerical methods for this PDE: the first is provably…

Numerical Analysis · Mathematics 2016-02-11 Brittany D. Froese , Adam M. Oberman , Tiago Salvador

We introduce suitable coordinate systems for pipes and their variants that allow us to transform partial differential equations (PDEs) on the pipe surfaces or in the solid pipes into computational domains with fixed limits/ranges. Such a…

Numerical Analysis · Mathematics 2025-09-09 Shuaifei Hu , Yujian Jiao , Desong Kong , Li-Lian Wang

We investigate the duality relation between linear programs over grids (Grid-LPs) and generalized linear complementarity problems (GLCPs) with hidden K-matrices. The two problems, moreover, share their combinatorial structure with…

Computational Complexity · Computer Science 2015-01-27 Lorenz Klaus

We give explicit formulas for the number of points on reductions of elliptic curves with complex multiplication by any imaginary quadratic field. We also find models for CM $\mathbf{Q}$-curves in certain cases. This generalizes earlier…

Number Theory · Mathematics 2009-08-06 K. Rubin , A. Silverberg

In this paper we study the problem of how to determine all elliptic curves defined over an arbitrary number field $K$ with good reduction outside a given finite set of primes $S$ of $K$ by solving $S$-unit equations. We give examples of…

Number Theory · Mathematics 2015-11-17 Angelos Koutsianas

This paper deals with a class of singularly perturbed nonlinear elliptic problems $(P_\e)$ with subcritical nonlinearity. The coefficient of the linear part is assumed to concentrate in a point of the domain, as $\e\to 0$, and the domain is…

Analysis of PDEs · Mathematics 2013-10-29 Riccardo Molle

Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…

Symbolic Computation · Computer Science 2020-03-23 Matthew England , Russell Bradford , James H. Davenport
‹ Prev 1 3 4 5 6 7 10 Next ›