Results 21 to 30 of about 625,582 (261)

A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem

Abstract and Applied Analysis, 2013
Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant .
Yi-Chou Chen, Hang-Chin Lai
doaj   +1 more source

Exponential Polynomials and Nonlinear Differential-Difference Equations

Journal of Function Spaces, 2020
In this paper, we study finite-order entire solutions of nonlinear differential-difference equations and solve a conjecture proposed by Chen, Gao, and Zhang when the solution is an exponential polynomial.
Junfeng Xu, Jianxun Rong
doaj   +1 more source

Modeling Infectious Disease Trend using Sobolev Polynomials

Communication in Biomathematical Sciences, 2023
Trend analysis plays an important role in infectious disease control. An analysis of the underlying trend in the number of cases or the mortality of a particular disease allows one to characterize its growth.
Rolly Czar Joseph Castillo, Victoria May Mendoza, Jose Ernie Lope, Renier Mendoza   +3 more
doaj   +1 more source

Application of Lagrange Interpolation Method to Solve First-Order Differential Equation Using Newton Interpolation Approach

Eurasian Journal of Science and Engineering, 2023
One of the important problems in mathematics is finding the analytic solution and numerical solution of the differential equation using various methods and techniques.
Salisu Ibrahim
doaj   +1 more source

Criterion for polynomial solutions to a class of linear differential equation of second order [PDF]

, 2006
We consider the differential equations y''=\lambda_0(x)y'+s_0(x)y, where \lambda_0(x), s_0(x) are C^{\infty}-functions. We prove (i) if the differential equation, has a polynomial solution of degree n >0, then \delta_n=\lambda_n s_{n-1}-\lambda_{n-1}s_n ...
Al-Salam W A, Barakat T, Barakat T, Bayrak O, Chihara T S, Ciftci H, Ciftci H, Erdélyi A, Fernández M F, Grünbaum F A, Hakan Ciftci, Littlejohn L L, Nasser Saad, Richard L Hall, Saad N, Turbiner A   +15 more
core   +1 more source

Polynomial decay rate for a new class of viscoelastic Kirchhoff equation related with Balakrishnan-Taylor dissipation and logarithmic source terms

Alexandria Engineering Journal, 2020
In this paper, a polynomial decay rate of Kirchhoff’s nonlinear viscoelastic viscoelastic equation solution related with Balakrishnan-Taylor dissipation solution and logarithmic source terms is obtained, where we obtain the result of energy decay of ...
Salah Boulaaras
doaj   +1 more source

Approximation Solution of Fuzzy Singular Volterra Integral Equation by Non-Polynomial Spline

Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023
A non-polynomial spline (NPS) is an approximation method that relies on the triangular and polynomial parts, so the method has infinite derivatives of the triangular part of the NPS to compensate for the loss of smoothness inherited by the polynomial. In
Zahraa A. Ibrahim, Nabaa N. Hasan
doaj   +1 more source

Polynomial solutions of differential–difference equations

Journal of Approximation Theory, 2011
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1 respectively. We address the question of when the zeros are real and simple and whether the zeros of polynomials of adjacent ...
Dominici, Diego, Driver, Kathy (Cathryn Helena Stanford), Jordaan, Kerstin Heidrun   +2 more
openaire   +4 more sources

2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties

, 2009
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program.
E. Kalai, E. Kalai, E. Tardos, F.P. Kelly, J. Neumann von, J.F. Nash, J.F. Nash, M. Grotschel, M. Osborne, V.V. Vazirani, W. Thomson   +10 more
core   +3 more sources

Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations

, 2004
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem'' when applied to fermions - causing an exponential increase of the computing time with the number of particles.
E. Farhi, Matthias Troyer, S. Cook, Uwe-Jens Wiese   +3 more
core   +1 more source