Related papers: Solving the octic by iteration in six dimensions
We study the autonomous systems of quadratic differential equations of the form $\dot{x}_i(t)=\mathbf{x}(t)^T \mathbf{A}_i \mathbf{x}(t) + \mathbf{v}_i^T \mathbf{x}(t)$ with $\mathbf{x}(t) = (x_1(t),x_2(t),\dots,x_i(t),\dots)$ which, in…
In a previous work, we developed the idea to solve Kepler's equation with a CORDIC-like algorithm, which does not require any division, but still multiplications in each iteration. Here we overcome this major shortcoming and solve Kepler's…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…
In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].
Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.
We present an exposition of the icosahedral solution of the quintic equation first described in Klein's classic work "Lectures on the icosahedron and the solution of equations of the fifth degree". Although we are heavily influenced by…
We present an algorithm which allows to solve analytically linear systems of differential equations which factorize to first order. The solution is given in terms of iterated integrals over an alphabet where its structure is implied by the…
We provide infinitely many solutions of a Dirichlet problem on balls.
In this paper Quintic Spline is defined for the numerical solutions of the fourth order linear special case Boundary Value Problems. End conditions are also derived to complete the definition of spline.The algorithm developed approximates…
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
In this paper, we propose a new adaptation of the D-iteration algorithm to numerically solve the differential equations. This problem can be reinterpreted in 2D or 3D (or higher dimensions) as a limit of a diffusion process where the…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
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…
The prime objective of this paper is to design a new family of eighth-order iterative methods by accelerating the order of convergence and efficiency index of well existing seventh-order iterative method of \cite{Soleymani1} without using…
We perform a classification of third order integrable systems of evolution equations with respect to higher symmetries. Applying it, we consider polynomial systems that are 0-homogeneous under a suitable weighting of variables with main…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
Differential equations with constant and variable coefficients over octonions are investigated. It is found that different types of differential equations over octonions can be resolved. For this purpose non-commutative line integration is…
Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause…
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion…
A general quantum algorithm for solving a problem is discussed. The number of steps required to solve a problem using this method is independent of the number of cases that has to be considered classically. Hence, it is more efficient than…