Search results for "Polynomial"
showing 10 items of 566 documents
Non-stationarity tests and nonlinear trends
1992
This paper stresses the importance of the hypothesis of linearity of the deterministic component imposed by unit root testing procedures most frequently used in empirical literature. We suggest an empirical testing strategy which reduces the risk of reaching false conclusions due to the misspecification of that component and we apply it to the analysis of the nonstationarity exhibited by real GNP in France. We show that it is possible to find someflexible specifications which enable us to reject the unit root null hypothesis otherwise strongly supported in empirical literature. These specifications might be considered as approximations of the true process generating real GNP and might be us…
Construction of a fundamental set of solutions of an arbitrary homogeneous linear difference equation
2002
Abstract The detailed construction of a prefixed fundamental set of solutions of a linear homogeneous difference equation of any order with arbitrarily variable coefficients is reported. The usefulness of the resulting resolutive formula is illustrated by simple applications to the Hermite polynomials and to the Fibonacci sequence.
Identification of linear parameter varying models
2002
We consider identification of a certain class of discrete-time nonlinear systems known as linear parameter varying system. We assume that inputs, outputs and the scheduling parameters are directly measured, and a form of the functional dependence of the system coefficients on the parameters is known. We show how this identification problem can be reduced to a linear regression, and provide compact formulae for the corresponding least mean square and recursive least-squares algorithms. We derive conditions on persistency of excitation in terms of the inputs and scheduling parameter trajectories when the functional dependence is of polynomial type. These conditions have a natural polynomial i…
Geometric quality and appearance of surfaces : local and global approaches
2012
Accounting for customers' perception of manufactured goods has become a major challenge for the industry. This process is to be established from early design to retail. Customers are nowadays more aware and detail oriented about perceived quality of products. This allows one to set not only an estimated price but also the expected quality of the product. Surface appearance analysis has therefore become a key industrial issue. Two approaches are proposed here to formalize the detection methodology and provide objective criteria for experts to evaluate surface anomalies. The first proposed approach is based on surface metrology. It consists in analyzing the measured topologies in order to bin…
Adaptive estimation of Laguerre models with time-varying delay
2000
Abstract An Orthonormal Basis Functions (OBF) approach is effectively used in adaptive parameter estimation of linear(ized) open-loop stable, possibly nonminimum phase plants with time-varying delay. In particular, discrete Laguerre models are considered in detail. A special attention is paid to the numerical conditioning issue in case of ’poor’ excitation of a plant under control, where OBF models are of particular value. Closed-loop predictive control simulations confirm the usefulness of adaptive OBF modelling, especially for systems with time-varying delays.
Protein knot server: detection of knots in protein structures
2007
KNOTS (http://knots.mit.edu) is a web server that detects knots in protein structures. Several protein structures have been reported to contain intricate knots. The physiological role of knots and their effect on folding and evolution is an area of active research. The user submits a PDB id or uploads a 3D protein structure in PDB or mmCIF format. The current implementation of the server uses the Alexander polynomial to detect knots. The results of the analysis that are presented to the user are the location of the knot in the structure, the type of the knot and an interactive visualization of the knot. The results can also be downloaded and viewed offline. The server also maintains a regul…
Redundant Picard–Fuchs System for Abelian Integrals
2001
We derive an explicit system of Picard-Fuchs differential equations satisfied by Abelian integrals of monomial forms and majorize its coefficients. A peculiar feature of this construction is that the system admitting such explicit majorants, appears only in dimension approximately two times greater than the standard Picard-Fuchs system. The result is used to obtain a partial solution to the tangential Hilbert 16th problem. We establish upper bounds for the number of zeros of arbitrary Abelian integrals on a positive distance from the critical locus. Under the additional assumption that the critical values of the Hamiltonian are distant from each other (after a proper normalization), we were…
On the regularity and defect sequence of monomial and binomial ideals
2018
When S is a polynomial ring or more generally a standard graded algebra over a field K, with homogeneous maximal ideal m, it is known that for an ideal I of S, the regularity of powers of I becomes eventually a linear function, i.e., reg(Im) = dm + e for m ≫ 0 and some integers d, e. This motivates writing reg(Im) = dm + em for every m ⩾ 0. The sequence em, called the defect sequence of the ideal I, is the subject of much research and its nature is still widely unexplored. We know that em is eventually constant. In this article, after proving various results about the regularity of monomial ideals and their powers, we give several bounds and restrictions on em and its first differences when…
Tower sets and other configurations with the Cohen-Macaulay property
2014
Abstract Some well-known arithmetically Cohen–Macaulay configurations of linear varieties in P r as k-configurations, partial intersections and star configurations are generalized by introducing tower schemes. Tower schemes are reduced schemes that are a finite union of linear varieties whose support set is a suitable finite subset of Z + c called tower set. We prove that the tower schemes are arithmetically Cohen–Macaulay and we compute their Hilbert function in terms of their support. Afterwards, since even in codimension 2 not every arithmetically Cohen–Macaulay squarefree monomial ideal is the ideal of a tower scheme, we slightly extend this notion by defining generalized tower schemes …
Response determination of linear dynamical systems with singular matrices: A polynomial matrix theory approach
2017
Abstract An approach is developed based on polynomial matrix theory for formulating the equations of motion and for determining the response of multi-degree-of-freedom (MDOF) linear dynamical systems with singular matrices and subject to linear constraints. This system modeling may appear for reasons such as utilizing redundant DOFs, and can be advantageous from a computational cost perspective, especially for complex (multi-body) systems. The herein developed approach can be construed as an alternative to the recently proposed methodology by Udwadia and coworkers, and has the significant advantage that it circumvents the use of pseudoinverses in determining the system response. In fact, ba…