Results 51 to 60 of about 33,431,346 (225)
Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory [PDF]
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication.
T. Tao
semanticscholar +1 more source
Impact of decreasing polynomial degree in time needed to factor a 100 digits integer by General Number field sieve algorithm [PDF]
Factoring is very important in the field of cryptography, specifically in the Rivest, Shamir, Adleman(RSA) public-key cryptosystem, one of the most prevalent methods for transmitting and receiving secret data which its security relies on the fact that ...
Jamal A. Othman
doaj +1 more source
Cubic splines solutions of the higher order boundary value problems arise in sandwich panel theory
An inventive strategy is bestowed here to acquire the numeral roots of nonlinear boundary value problems(BVPs) of 14th-order utilizing cubic splines. Two cubic splines; Polynomial and non-polynomial, are exploited to find out the solutions of nonlinear ...
Aasma Khalid +5 more
doaj +1 more source
Recognizing Graph Theoretic Properties with Polynomial Ideals [PDF]
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial
De Loera, J. A. +3 more
core +5 more sources
The exponential stability of numerical methods to stochastic differential equations (SDEs) has been widely studied. In contrast, there are relatively few works on polynomial stability of numerical methods.
Foondun, Mohammud +2 more
core +1 more source
Roots multiplicity without companion matrices
We show a method for constructing a polynomial interpolating roots' multiplicities of another polynomial, that does not use companion matrices. This leads to a modification to Guersenzvaig--Szechtman square-free decomposition algorithm that is more ...
Koprowski, Przemysław
core +1 more source
New numerical method for ordinary differential equations: Newton polynomial
The Adams–Bashforth have been recognized to be a very efficient numerical method to solve linear and nonlinear differential equations, including those with non-integer orders.
A. Atangana +2 more
semanticscholar +1 more source
Newton method for symmetric quartic polynomial [PDF]
We investigate the parameter plane of the Newton’s method applied to the family of quartic polynomials pa,b(z)=z4+az3+bz2+az+1,pa,b(z)=z4+az3+bz2+az+1, where a and b are real parameters. We divide the parameter plane (a,b)∈R2(a,b)∈R2 into twelve open and connected regions where p, p′ and p′′ have simple roots. In each of these regions we focus on the
Beatriz Campos +3 more
openaire +6 more sources
Indirect Method for Optimal Control Problem Using Boubaker Polynomial
In this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial.
Baghdad Science Journal
doaj +1 more source
The evaluation of objective functions and component reliability in the optimisation of structural-acoustic systems with random and interval variables is computationally expensive, especially when strong nonlinearity exhibits between the response and ...
Shengwen Yin +3 more
doaj +1 more source

