English
Related papers

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

200 papers

The beautiful quartic Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been studied by some mathematicians for many years. Although Choudhry, Gerardin and Piezas presented solutions of this…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Mehdi Baghalagdam

Several conjectural continued fractions found with the help of various algorithms are published in this paper.

Number Theory · Mathematics 2017-04-14 Thomas Baruchel

This is a complement to my previous article "Advanced Determinant Calculus" (S\'eminaire Lotharingien Combin. 42 (1999), Article B42q, 67 pp.). In the present article, I share with the reader my experience of applying the methods described…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…

Combinatorics · Mathematics 2025-01-30 Meng Zhang

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

Number Theory · Mathematics 2015-05-13 Mihai Cipu , Maurice Mignotte

Extends previous work on a quintic-solving algorithm to equations of the eighth-degree.

Dynamical Systems · Mathematics 2020-03-04 Scott Crass

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…

Numerical Analysis · Mathematics 2020-04-09 Ankush Aggarwal , Sanjay Pant

The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new…

Logic in Computer Science · Computer Science 2024-11-05 Giorgi Japaridze

This paper develops an adaptive generic proximal bundle method, shows its complexity, and presents numerical experiments comparing this method with two bundle methods on a set of optimization problems.

Optimization and Control · Mathematics 2026-05-21 Vincent Guigues , Renato Monteiro , Benoit Tran

The numerical simulation of the 3D incompressible Euler equation is analyzed with respect to different integration methods. The numerical schemes we considered include spectral methods with different strategies for dealiasing and two…

Fluid Dynamics · Physics 2009-11-13 Tobias Grafke , Holger Homann , Juergen Dreher , Rainer Grauer

In this paper, amiable mixed schemes are presented for two variants of fourth order curl equations. Specifically, mixed formulations for the problems are constructed, which are well-posed in Babuska-Brezzi's sense and admit stable…

Numerical Analysis · Mathematics 2016-07-19 Shuo Zhang

We examine what integers are representable as sums of three cubes. We also provide formulas for the number of representations of $x^3+y^3+z^3=n$ under the condition $x+y+z=t$. Also we show how the problem of three cubes is related to…

General Mathematics · Mathematics 2020-09-28 Nikos Bagis

Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.

Logic in Computer Science · Computer Science 2018-04-16 Małgorzata Moczurad , Piotr Zgliczyński

In this note we find all the solutions of the Diophantine equation $x^4\pm y^4=iz^2$ using elliptic curves over $\mathbb Q(i)$. Also, using the same method we give a new proof of Hilbert's result that the equation $x^4\pm y^4=z^2$ has only…

Number Theory · Mathematics 2011-11-24 Filip Najman

This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…

Numerical Analysis · Mathematics 2019-08-02 Prosper Torsu

Feedforward neural networks offer a promising approach for solving differential equations. However, the reliability and accuracy of the approximation still represent delicate issues that are not fully resolved in the current literature.…

Neural and Evolutionary Computing · Computer Science 2021-12-01 Toni Schneidereit , Michael Breuß

We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.

Theoretical Economics · Economics 2024-03-25 Alfio Giarlotta , Angelo Petralia , Stephen Watson

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

General Mathematics · Mathematics 2007-11-28 Florentin Smarandache

An existing solvability result for relaxed one-sided Lipschitz algebraic inclusions is substantially improved. This enhanced solvability result allows the design of a very robust numerical method for the approximation of a solution of the…

Optimization and Control · Mathematics 2013-08-19 Wolf-Jürgen Beyn , Janosch Rieger

Two main aims of this paper are to develop a numerical method to solve an inverse source problem for parabolic equations and apply it to solve a nonlinear coefficient inverse problem. The inverse source problem in this paper is the problem…

Analysis of PDEs · Mathematics 2019-06-06 Phuong Mai Nguyen , Loc Hoang Nguyen
‹ Prev 1 8 9 10 Next ›