相关论文: Newton's Method as a Formal Recurrence

We study a variant of Newton's algorithm applied to under-determined systems of non-smooth equations. The notion of regularity employed in our work is based on Newton differentiability, which generalizes semi-smoothness. The classic notion…

We consider equations arising from rational Lax representations. A general method to construct recursion operators for such equations is given. Several examples are given, including a degenerate bi-Hamiltonian system with a recursion…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…

In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…

The Newton-Girard Formula allows one to write any elementary symmetric polynomial as a sum of products of power sum symmetric polynomials and elementary symmetric polynomials of lesser degree. It has numerous applications. We have…

The classical multidimensional resultant can be defined as the, suitably normalized, generator of a projective elimination ideal in the ring of universal coefficients. This is the approach via the so-called inertia forms or…

Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…

A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal. An alternative proof is presented.

The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…

Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…

A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

We discuss algebraic and combinatorial aspects of the Hamiltonian normal form theory. The main objective is to describe the normal form near a singular point purely in terms of the original Hamiltonian, avoiding the normalization procedure.…

The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…

Using the notion of the composita, we obtain a method of solving iterative functional equations of the form $A^{2^n}(x)=F(x)$, where $F(x)=\sum_{n>0} f(n)x^n$, $f(1)\neq 0$. We prove that if $F(x)=\sum_{n>0} f(n)x^n$ has integer…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

A new variant of Newton's method for empirical risk minimization is studied, where at each iteration of the optimization algorithm, the gradient and Hessian of the objective function are replaced by robust estimators taken from existing…

We propose a notion of iterating functions $f:X^{k}\rightarrow X$ in a way that represents recurrence relations of the form $a_{n+k}=f(a_{n},a_{n+1},...,a_{n+k-1})$. We define a function as $n$-involutory when its $n$th iterate is the…

The method of exhaustion is generalized to a simple formula that can be used to integrate functions under very general conditions, provided that the integral exists. Both a geometric proof (following the usual procedure for the method of…