Results 11 to 20 of about 33,431,346 (225)
Sieve Method for Polynomial Linear Equivalence [PDF]
We consider the polynomial linear equivalence (PLE) problem arising from the multivariate public key cryptography, which is defined as to find an invertible linear transformation ℒ satisfying 𝒫=𝒮∘ℒ for given nonlinear polynomial maps 𝒫 and 𝒮 over a ...
Baocang Wang, Yupu Hu
doaj +3 more sources
Applying polynomial decoupling methods to the polynomial NARX model [PDF]
System identification uses measurements of a dynamic system's input and output to reconstruct a mathematical model for that system. These can be mechanical, electrical, physiological, among others. Since most of the systems around us exhibit some form of nonlinear behavior, nonlinear system identification techniques are the tools that will help us gain
Karami, Kiana +2 more
openaire +3 more sources
Exponential Polynomial Block Methods [PDF]
In this paper we extend the polynomial time integration framework to include exponential integration for both partitioned and unpartitioned initial value problems. We then demonstrate the utility of the exponential polynomial framework by constructing a new class of parallel exponential polynomial block methods (EPBMs) based on the Legendre points ...
openaire +2 more sources
Polynomial Supertree Methods Revisited [PDF]
Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper,
Brinkmeyer, Malte +2 more
openaire +3 more sources
Probing band-center anomaly with the Kernel polynomial method [PDF]
We investigate the anomalous behavior of localization length of a non-interacting one-dimensional Anderson model at zero temperature. We report numerical calculations of the Thouless expression of localization length, based on the Kernel polynomial ...
N. A. Khan, Syed Tahir Amin
semanticscholar +1 more source
Distinct partial sums in cyclic groups: polynomial method and constructive approaches [PDF]
Let ( G , + ) be an abelian group and consider a subset A ⊆ G with ∣ A ∣ = k . Given an ordering ( a 1 , … , a k ) of the elements of A , define its partial sums by s 0 = 0 and s j = ∑ i = 1 j a i for 1 ≤ j ≤ k .
Jacob Hicks +2 more
semanticscholar +1 more source
An arbitrary univariate polynomial of nth degree has n sequences. The sequences are systematized into classes. All the values of the first class sequence are obtained by Newton’s polynomial of nth degree. Furthermore, the values of all sequences for each
Ilija Tanackov +2 more
doaj +1 more source
A Polynomial Fitting Problem: The Orthogonal Distances Method
The classical curve-fitting problem to relate two variables, x and y, deals with polynomials. Generally, this problem is solved by the least squares method (LS), where the minimization function considers the vertical errors from the data points to the ...
Luis Alberto Cantera-Cantera +4 more
doaj +1 more source
The polynomial method strikes back: tight quantum query bounds via dual polynomials [PDF]
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. The approximate degree of f is known to be a lower bound on the quantum query complexity of f (Beals et al., FOCS ...
Mark Bun, Robin Kothari, J. Thaler
semanticscholar +1 more source
Method of orthotransformation of space images in conditions of lack of cue
The paper introduces a method of prompt orthotransformation of space images, based on the integration of the orbital and polynomial methods of photogrammetric image processing. The concept of the method consists in fragmentary formation of an orthoimage.
A. V. Spirin +3 more
doaj +1 more source

