Related papers: Numerical Solution of Altarelli-Parisi Equations
In this paper, we present a new numerical method to solve fractional differential equations. Given a fractional derivative of arbitrary real order, we present an approximation formula for the fractional operator that involves integer-order…
We review properties of confluent functions and the closely related Laguerre polynomials, and determine their bilinear integrals. As is well-known, these integrals are convergent only for a limited range of parameters. However, when one…
The Volterra series can be used to model a large subset of nonlinear, dynamic systems. A major drawback is the number of coefficients required model such systems. In order to reduce the number of required coefficients, Laguerre polynomials…
We present a practical numerical method for evaluating the Lagrange multipliers necessary for maintaining a constrained linear geometry of particles in dynamical simulations. The method involves no iterations, and is limited in accuracy…
We consider the problem of efficiently solving a system of $n$ non-linear equations in ${\mathbb R}^d$. Addressing Smale's 17th problem stated in 1998, we consider a setting whereby the $n$ equations are random homogeneous polynomials of…
The distribution function for the first eigenvalue spacing in the Laguerre unitary ensemble of finite size may be expressed in terms of a solution of the fifth Painleve transcendent. The generating function of a certain discontinuous linear…
In this paper, we consider the problem of accelerating the numerical simulation of time dependent problems by time domain decomposition. The available algorithms enabling such decompositions present severe efficiency limitations and are an…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
In this paper, we propose and study neural network based methods for solutions of high-dimensional quadratic porous medium equation (QPME). Three variational formulations of this nonlinear PDE are presented: a strong formulation and two…
In this article, we discuss the numerical solution of Boolean polynomial programs by algorithms borrowing from numerical methods for differential equations, namely the Houbolt scheme, the Lie scheme, and a Runge-Kutta scheme. We first…
In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded by the dimension. Combining Orlin's primal-based modification…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
According to the Abel-Ruffini theorem, equations of degree equal to or greater than 5 cannot, in most cases, be solved by radicals. Due of this theorem we will present a formula that solves specific cases of sixth degree equations using…
A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a…
We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the unit interval and its application in the generation of Gauss-Legendre quadrature rules. Our focus is on making the evaluation practical for a…
We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…
We study the following ultraparabolic equation \[ \frac{\partial}{\partial t}u\left(t,s\right)+\frac{\partial}{\partial…