Results 11 to 20 of about 792,456 (288)
The Kernel Polynomial Method [PDF]
Reviews of Modern Physics, 2006 Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics.
Alvermann, Andreas +3 more
core +5 more sources
Sieve Method for Polynomial Linear Equivalence [PDF]
Journal of Applied Mathematics, 2013 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]
Mechanical Systems and Signal Processing, 2021 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]
SIAM Journal on Scientific Computing, 2021 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]
Advances in Bioinformatics, 2010 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
Matrix of Polynomials Model based Polynomial Dictionary Learning Method for Acoustic Impulse Response Modeling [PDF]
, 2017 We study the problem of dictionary learning for signals that can be represented as polynomials or polynomial matrices, such as convolutive signals with time delays or acoustic impulse responses.
Dong, Jing +4 more
core +2 more sources
The Selberg sieve method in the polynomial set
Lietuvos Matematikos Rinkinys, 2001 There is not abstract.
Gintautas Bareikis
doaj +3 more sources
Determining Minimal Polynomial of Proper Element by Using Higher Degree Traces [PDF]
, 2001 Modern communication engineerings, such as elliptic curve cryptographies, often requires algebra on finite extension field defined by modulus arithmetic with an irreducible polynomial. This paper provides a new method to detemine the minimal (irreducible)
Morikawa, Yoshitaka, Nogami, Yasuyuki
core +1 more source
Newton’s method on Bring-Jerrard polynomials [PDF]
Publicacions Matemàtiques, 2014 Agraïments: The first and fourth authors were partially supported by P11B2011-30 In this paper we study the topology of the hyperbolic component of the parameter plane for the Newton's method applied to n-th degree Bring-Jerrard polynomials given by P_n(z) = z^n-cz 1, \ c.
Campos, Beatriz +3 more
openaire +6 more sources
Computing knots by quadratic and cubic polynomial curves
Computational Visual Media, 2020 A new method is presented to determine parameter values (knot) for data points for curve and surface generation. With four adjacent data points, a quadratic polynomial curve can be determined uniquely if the four points form a convex polygon.
Fan Zhang +3 more
doaj +1 more source