English
Related papers

Related papers: Computational Experiments on $a^4+b^4+c^4+d^4=(a+b…

200 papers

This article surveys computational methods for posterior inference with intractable likelihoods, that is where the likelihood function is unavailable in closed form, or where evaluation of the likelihood is infeasible. We review recent…

Computation · Statistics 2020-04-10 Matthew T. Moores , Anthony N. Pettitt , Kerrie Mengersen

Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.

Number Theory · Mathematics 2024-05-08 V. Vinay Kumaraswamy

Using both fractional derivatives, defined in the Riemann-Liouville and Caputo senses, and classical derivatives of the integer order we examine different numerical approaches to ordinary differential equations. Generally we formulate some…

Numerical Analysis · Mathematics 2007-12-04 Jacek S. Leszczynski , Tomasz Blaszczyk

In this paper, we prove a theorem about the integer solutions to the Diophantine equation $x^{4}-q^{4}=py^{r}$, extending previous work of K.Gy\H ory, and F.Luca and A.Togbe, and of the author.

Number Theory · Mathematics 2009-07-07 Diana Savin

In this work, we consider a boundary value problem for nonlinear triharmonic equation. Due to the reduction of nonlinear boundary value problems to operator equation for nonlinear terms we establish the existence, uniqueness and positivity…

Numerical Analysis · Mathematics 2020-04-02 Dang Quang A , Nguyen Quoc Hung , Vu Vinh Quang

Unlike the Hamilton quaternion algebra, the split-quaternions contain nontrivial zero divisors. In general speaking, it is hard to find the solutions of equations in algebras containing zero divisor. In this paper, we manage to derive…

Rings and Algebras · Mathematics 2020-05-12 Wensheng Cao

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

Number Theory · Mathematics 2022-11-17 Konstantinos A. Draziotis

In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…

Computational Complexity · Computer Science 2016-08-02 Amaury Pouly

An original approach to solving rather difficult probabilistic problems arising in studying the readout of random discrete fields and having no exact analytical solutions at the moment is proposed. Several algorithms for direct, iterative,…

Other Computer Science · Computer Science 2014-12-04 Aleksander Reznik , Vitaly Efimov , Aleksander Soloview , Andrey Torgov

This is a survey on the computational complexity of nonlinear mixed-integer optimization. It highlights a selection of important topics, ranging from incomputability results that arise from number theory and logic, to recently obtained…

Optimization and Control · Mathematics 2010-06-28 Matthias Köppe

Differentially-algebraic (D-algebraic) functions are solutions of polynomial equations in the function, its derivatives, and the independent variables. We revisit closure properties of these functions by providing constructive proofs. We…

Algebraic Geometry · Mathematics 2024-08-27 Rida Ait El Manssour , Anna-Laura Sattelberger , Bertrand Teguia Tabuguia

We provide additional methods for the evaluation of the integral \begin{eqnarray} N_{0,4}(a;m) & := & \int_{0}^{\infty} \frac{dx} {\left( x^{4} + 2ax^{2} + 1 \right)^{m+1}} \end{eqnarray} where $m \in {\mathbb{N}}$ and $a \in (-1, \infty)$…

Classical Analysis and ODEs · Mathematics 2010-09-14 Tewodros Amdeberhan , Victor H. Moll , And Christophe Vignat

In the previous work [2] (i.e., arXiv:2105.03385), we considered continuous solutions of an iterative equation involving the multiplication of iterates. In this paper, we continue to investigate this equation for differentiable solutions.…

Dynamical Systems · Mathematics 2021-05-19 Chaitanya Gopalakrishna

We prove that the equation ${ (x - y)^4 + x^4 + (x + y)^4 = z^n }$ has no integer solutions ${ x, y, z}$ with ${ \gcd(x, y) = 1 }$ for all integers ${ n > 1 }$. We mainly use a modular approach with two Frey ${ \mathbb{Q} }$-curves defined…

Number Theory · Mathematics 2021-02-18 Joey M. van Langen

In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…

Computational Complexity · Computer Science 2021-03-22 Richard P. Brent

The hierarchy of integrable equations are considered. The dynamical approach to the theory of nonlinear waves is proposed. The special solutions(nonlinear waves) of considered equations are derived. We use powerful methods of computer…

solv-int · Physics 2007-05-23 N. A. Kostov , Z. T. Kostova

We overview a series of recent works addressing numerical simulations of partial differential equations in the presence of some elements of randomness. The specific equations manipulated are linear elliptic, and arise in the context of…

Numerical Analysis · Mathematics 2016-04-19 Claude Le Bris , Frederic Legoll

Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…

Algebraic Geometry · Mathematics 2020-03-10 Paul Breiding , Orlando Marigliano

We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…

Numerical Analysis · Mathematics 2019-03-22 Michael Hanke , Roswitha März

Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…

Computational Complexity · Computer Science 2023-01-10 Chuyu Xiong