**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**840

# Search results for: Characteristic Polynomial

##### 840 Method of Finding Aerodynamic Characteristic Equations of Missile for Trajectory Simulation

**Authors:**
Attapon Charoenpon,
Ekkarach Pankeaw

**Abstract:**

This paper present a new way to find the aerodynamic characteristic equation of missile for the numerical trajectories prediction more accurate. The goal is to obtain the polynomial equation based on two missile characteristic parameters, angle of attack (α ) and flight speed (╬¢ ). First, the understudied missile is modeled and used for flow computational model to compute aerodynamic force and moment. Assume that performance range of understudied missile where range -10< α <10 and 0< ╬¢ <200. After completely obtained results of all cases, the data are fit by polynomial interpolation to create equation of each case and then combine all equations to form aerodynamic characteristic equation, which will be used for trajectories simulation.

**Keywords:**
Aerodynamic,
Characteristic Equation,
Angle ofAttack,
Polynomial interpolation,
Trajectories

##### 839 Comparison of the Existing Methods in Determination of the Characteristic Polynomial

**Authors:**
Mohammad Saleh Tavazoei,
Mohammad Haeri

**Abstract:**

**Keywords:**
Characteristic Polynomial,
Transient Response,
Filters,
Stability.

##### 838 The Adsorption of SDS on Ferro-Precipitates

**Authors:**
R.Marsalek

**Abstract:**

**Keywords:**
ferro-precipitate,
adsorption,
SDS,
zeta potential

##### 837 Transformations between Bivariate Polynomial Bases

**Authors:**
Dimitris Varsamis,
Nicholas Karampetakis

**Abstract:**

It is well known, that any interpolating polynomial p (x, y) on the vector space Pn,m of two-variable polynomials with degree less than n in terms of x and less than m in terms of y, has various representations that depends on the basis of Pn,m that we select i.e. monomial, Newton and Lagrange basis e.t.c.. The aim of this short note is twofold : a) to present transformations between the coordinates of the polynomial p (x, y) in the aforementioned basis and b) to present transformations between these bases.

**Keywords:**
Bivariate interpolation polynomial,
Polynomial basis,
Transformations.

##### 836 A Novel Deinterlacing Algorithm Based on Adaptive Polynomial Interpolation

**Authors:**
Seung-Won Jung,
Hye-Soo Kim,
Le Thanh Ha,
Seung-Jin Baek,
Sung-Jea Ko

**Abstract:**

**Keywords:**
Deinterlacing,
polynomial interpolation.

##### 835 Factoring a Polynomial with Multiple-Roots

**Authors:**
Feng Cheng Chang

**Abstract:**

**Keywords:**
Polynomial roots,
greatest common divisor,
Longhand polynomial division,
Euclidean GCD Algorithm.

##### 834 Designing FIR Filters with Polynomial Approach

**Authors:**
Sunil Bhooshan,
Vinay Kumar

**Abstract:**

**Keywords:**
FIR filter,
Polynomial.

##### 833 Blow up in Polynomial Differential Equations

**Authors:**
Rudolf Csikja,
Janos Toth

**Abstract:**

Methods to detect and localize time singularities of polynomial and quasi-polynomial ordinary differential equations are systematically presented and developed. They are applied to examples taken form different fields of applications and they are also compared to better known methods such as those based on the existence of linear first integrals or Lyapunov functions.

**Keywords:**
blow up,
finite escape time,
polynomial ODE,
singularity,
Lotka–Volterra equation,
Painleve analysis,
Ψ-series,
global existence

##### 832 On Generalized New Class of Matrix Polynomial Set

**Authors:**
Ghazi S. Kahmmash

**Abstract:**

New generalization of the new class matrix polynomial set have been obtained. An explicit representation and an expansion of the matrix exponential in a series of these matrix are given for these matrix polynomials.

**Keywords:**
Generating functions,
Recurrences relation and Generalization of the new class matrix polynomial set.

##### 831 PID Controller Design for Following Control of Hard Disk Drive by Characteristic Ratio Assignment Method

**Authors:**
Chaoraingern J.,
Trisuwannawat T.,
Numsomran A.

**Abstract:**

**Keywords:**
Following Control,
Hard Disk Drive,
PID,
CRA

##### 830 Evolutionary Design of Polynomial Controller

**Authors:**
R. Matousek,
S. Lang,
P. Minar,
P. Pivonka

**Abstract:**

**Keywords:**
Evolutionary design,
Genetic algorithms,
PID controller,
Pole placement,
Polynomial controller

##### 829 Discrete Polynomial Moments and Savitzky-Golay Smoothing

**Authors:**
Paul O'Leary,
Matthew Harker

**Abstract:**

**Keywords:**
Gram polynomials,
Savitzky-Golay Smoothing,
Discrete Polynomial Moments

##### 828 Segmentation of Piecewise Polynomial Regression Model by Using Reversible Jump MCMC Algorithm

**Authors:**
Suparman

**Abstract:**

Piecewise polynomial regression model is very flexible model for modeling the data. If the piecewise polynomial regression model is matched against the data, its parameters are not generally known. This paper studies the parameter estimation problem of piecewise polynomial regression model. The method which is used to estimate the parameters of the piecewise polynomial regression model is Bayesian method. Unfortunately, the Bayes estimator cannot be found analytically. Reversible jump MCMC algorithm is proposed to solve this problem. Reversible jump MCMC algorithm generates the Markov chain that converges to the limit distribution of the posterior distribution of piecewise polynomial regression model parameter. The resulting Markov chain is used to calculate the Bayes estimator for the parameters of piecewise polynomial regression model.

**Keywords:**
Piecewise,
Bayesian,
reversible jump MCMC,
segmentation.

##### 827 Fuzzy Fingerprint Vault using Multiple Polynomials

**Authors:**
Daesung Moon,
Woo-Yong Choi,
Kiyoung Moon

**Abstract:**

Fuzzy fingerprint vault is a recently developed cryptographic construct based on the polynomial reconstruction problem to secure critical data with the fingerprint data. However, the previous researches are not applicable to the fingerprint having a few minutiae since they use a fixed degree of the polynomial without considering the number of fingerprint minutiae. To solve this problem, we use an adaptive degree of the polynomial considering the number of minutiae extracted from each user. Also, we apply multiple polynomials to avoid the possible degradation of the security of a simple solution(i.e., using a low-degree polynomial). Based on the experimental results, our method can make the possible attack difficult 2192 times more than using a low-degree polynomial as well as verify the users having a few minutiae.

**Keywords:**
Fuzzy vault,
fingerprint recognition multiple polynomials.

##### 826 Synthesis of the Robust Regulators on the Basis of the Criterion of the Maximum Stability Degree

**Authors:**
S. A. Gayvoronsky,
T. A. Ezangina

**Abstract:**

The robust control system objects with interval- undermined parameters is considers in this paper. Initial information about the system is its characteristic polynomial with interval coefficients. On the basis of coefficient estimations of quality indices and criterion of the maximum stability degree, the methods of synthesis of a robust regulator parametric is developed. The example of the robust stabilization system synthesis of the rope tension is given in this article.

**Keywords:**
An interval polynomial,
controller synthesis,
analysis of quality factors,
maximum degree of stability,
robust degree of stability,
robust oscillation,
system accuracy.

##### 825 Computable Function Representations Using Effective Chebyshev Polynomial

**Authors:**
Mohammed A. Abutheraa,
David Lester

**Abstract:**

We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions.

**Keywords:**
Approximation Theory,
Chebyshev Polynomial,
Computable Functions,
Computable Real Arithmetic,
Integration,
Numerical Analysis.

##### 824 Implementation and Analysis of Elliptic Curve Cryptosystems over Polynomial basis and ONB

**Authors:**
Yong-Je Choi,
Moo-Seop Kim,
Hang-Rok Lee,
Ho-Won Kim

**Abstract:**

**Keywords:**
Elliptic Curve Cryptosystem,
Crypto Algorithm,
Polynomial Basis,
Optimal Normal Basis,
Security.

##### 823 A New Approach to Polynomial Neural Networks based on Genetic Algorithm

**Authors:**
S. Farzi

**Abstract:**

**Keywords:**
GMDH,
GPNN,
GA,
PNN.

##### 822 A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes

**Authors:**
Zohreh O. Akbari

**Abstract:**

**Keywords:**
Clique problem,
Deterministic Polynomial-time
Algorithm,
Equality of P and NP Complexity Classes.

##### 821 Robust Control Synthesis for an Unmanned Underwater Vehicle

**Authors:**
A. Budiyono

**Abstract:**

The control design for unmanned underwater vehicles (UUVs) is challenging due to the uncertainties in the complex dynamic modeling of the vehicle as well as its unstructured operational environment. To cope with these difficulties, a practical robust control is therefore desirable. The paper deals with the application of coefficient diagram method (CDM) for a robust control design of an autonomous underwater vehicle. The CDM is an algebraic approach in which the characteristic polynomial and the controller are synthesized simultaneously. Particularly, a coefficient diagram (comparable to Bode diagram) is used effectively to convey pertinent design information and as a measure of trade-off between stability, response speed and robustness. In the polynomial ring, Kharitonov polynomials are employed to analyze the robustness of the controller due to parametric uncertainties.

**Keywords:**
coefficient diagram method,
robust control,
Kharitonov polynomials,
unmanned underwater vehicles.

##### 820 Numerical Inverse Laplace Transform Using Chebyshev Polynomial

**Authors:**
Vinod Mishra,
Dimple Rani

**Abstract:**

In this paper, numerical approximate Laplace transform inversion algorithm based on Chebyshev polynomial of second kind is developed using odd cosine series. The technique has been tested for three different functions to work efficiently. The illustrations show that the new developed numerical inverse Laplace transform is very much close to the classical analytic inverse Laplace transform.

**Keywords:**
Chebyshev polynomial,
Numerical inverse Laplace transform,
Odd cosine series.

##### 819 Holistic Face Recognition using Multivariate Approximation, Genetic Algorithms and AdaBoost Classifier: Preliminary Results

**Authors:**
C. Villegas-Quezada,
J. Climent

**Abstract:**

Several works regarding facial recognition have dealt with methods which identify isolated characteristics of the face or with templates which encompass several regions of it. In this paper a new technique which approaches the problem holistically dispensing with the need to identify geometrical characteristics or regions of the face is introduced. The characterization of a face is achieved by randomly sampling selected attributes of the pixels of its image. From this information we construct a set of data, which correspond to the values of low frequencies, gradient, entropy and another several characteristics of pixel of the image. Generating a set of “p" variables. The multivariate data set with different polynomials minimizing the data fitness error in the minimax sense (L∞ - Norm) is approximated. With the use of a Genetic Algorithm (GA) it is able to circumvent the problem of dimensionality inherent to higher degree polynomial approximations. The GA yields the degree and values of a set of coefficients of the polynomials approximating of the image of a face. By finding a family of characteristic polynomials from several variables (pixel characteristics) for each face (say Fi ) in the data base through a resampling process the system in use, is trained. A face (say F ) is recognized by finding its characteristic polynomials and using an AdaBoost Classifier from F -s polynomials to each of the Fi -s polynomials. The winner is the polynomial family closer to F -s corresponding to target face in data base.

**Keywords:**
AdaBoost Classifier,
Holistic Face Recognition,
Minimax Multivariate Approximation,
Genetic Algorithm.

##### 818 Stress Solitary Waves Generated by a Second-Order Polynomial Constitutive Equation

**Authors:**
Tsun-Hui Huang,
Shyue-Cheng Yang,
Chiou-Fen Shieh

**Abstract:**

In this paper, a nonlinear constitutive law and a curve fitting, two relationships between the stress-strain and the shear stress-strain for sandstone material were used to obtain a second-order polynomial constitutive equation. Based on the established polynomial constitutive equations and Newton’s second law, a mathematical model of the non-homogeneous nonlinear wave equation under an external pressure was derived. The external pressure can be assumed as an impulse function to simulate a real earthquake source. A displacement response under nonlinear two-dimensional wave equation was determined by a numerical method and computer-aided software. The results show that a suit pressure in the sandstone generates the phenomenon of stress solitary waves.

**Keywords:**
Polynomial constitutive equation,
solitary.

##### 817 The BGMRES Method for Generalized Sylvester Matrix Equation AXB − X = C and Preconditioning

**Authors:**
Azita Tajaddini,
Ramleh Shamsi

**Abstract:**

**Keywords:**
Linear matrix equation,
Block GMRES,
matrix Krylov
subspace,
polynomial preconditioner.

##### 816 On CR-Structure and F-Structure Satisfying Polynomial Equation

**Authors:**
Manisha Kankarej

**Abstract:**

**Keywords:**
CR-submainfolds,
CR-structure,
Integrability condition & Nijenhuis tensor.

##### 815 New Laguerre-s Type Method for Solving of a Polynomial Equations Systems

**Authors:**
Oleksandr Poliakov,
Yevgen Pashkov,
Marina Kolesova,
Olena Chepenyuk,
Mykhaylo Kalinin,
Vadym Kramar

**Abstract:**

**Keywords:**
Iterative method,
Laguerre's method,
Newton's
method,
polynomial equation,
system of equations

##### 814 Particle Filter Applied to Noisy Synchronization in Polynomial Chaotic Maps

**Authors:**
Moussa Yahia,
Pascal Acco,
Malek Benslama

**Abstract:**

Polynomial maps offer analytical properties used to obtain better performances in the scope of chaos synchronization under noisy channels. This paper presents a new method to simplify equations of the Exact Polynomial Kalman Filter (ExPKF) given in [1]. This faster algorithm is compared to other estimators showing that performances of all considered observers vanish rapidly with the channel noise making application of chaos synchronization intractable. Simulation of ExPKF shows that saturation drawn on the emitter to keep it stable impacts badly performances for low channel noise. Then we propose a particle filter that outperforms all other Kalman structured observers in the case of noisy channels.

**Keywords:**
Chaos synchronization,
Saturation,
Fast ExPKF,
Particlefilter,
Polynomial maps.

##### 813 An Interval Type-2 Dual Fuzzy Polynomial Equations and Ranking Method of Fuzzy Numbers

**Authors:**
Nurhakimah Ab. Rahman,
Lazim Abdullah

**Abstract:**

According to fuzzy arithmetic, dual fuzzy polynomials cannot be replaced by fuzzy polynomials. Hence, the concept of ranking method is used to find real roots of dual fuzzy polynomial equations. Therefore, in this study we want to propose an interval type-2 dual fuzzy polynomial equation (IT2 DFPE). Then, the concept of ranking method also is used to find real roots of IT2 DFPE (if exists). We transform IT2 DFPE to system of crisp IT2 DFPE. This transformation performed with ranking method of fuzzy numbers based on three parameters namely value, ambiguity and fuzziness. At the end, we illustrate our approach by two numerical examples.

**Keywords:**
Dual fuzzy polynomial equations,
Interval type-2,
Ranking method,
Value.

##### 812 On the Construction of m-Sequences via Primitive Polynomials with a Fast Identification Method

**Authors:**
Abhijit Mitra

**Abstract:**

**Keywords:**
Finite field,
irreducible polynomial,
primitive polynomial,
maximal length sequence,
additive shift register,
multiplicative
shift register.

##### 811 Explicit Chain Homotopic Function to Compute Hochschild Homology of the Polynomial Algebra

**Authors:**
Z. Altawallbeh

**Abstract:**

In this paper, an explicit homotopic function is constructed to compute the Hochschild homology of a finite dimensional free k-module V. Because the polynomial algebra is of course fundamental in the computation of the Hochschild homology HH and the cyclic homology CH of commutative algebras, we concentrate our work to compute HH of the polynomial algebra, by providing certain homotopic function.

**Keywords:**
Exterior algebra,
free resolution,
free and projective
modules,
Hochschild homology,
homotopic function,
symmetric
algebra.