Search results for "Polynomial"
showing 10 items of 566 documents
A Rayleigh-Ritz approach for postbuckling analysis of variable angle tow composite stiffened panels
2018
Abstract A Rayleigh-Ritz solution approach for generally restrained multilayered variable angle tow stiffened plates in postbuckling regime is presented. The plate model is based on the first order shear deformation theory and accounts for geometrical nonlinearity through the von Karman’s assumptions. Stiffened plates are modelled as assembly of plate-like elements and penalty techniques are used to join the elements in the assembled structure and to apply the kinematical boundary conditions. General symmetric and unsymmetric stacking sequences are considered and Legendre orthogonal polynomials are employed to build the trial functions. A computer code was developed to implement the propose…
Polynomial numerical indices of 𝐶(𝐾) and 𝐿₁(𝜇)
2013
We estimate the polynomial numerical indices of the spaces C ( K ) C(K) and L 1 ( μ ) L_1(\mu ) .
A New Method of Velocity Estimation Based on Variable Temporal Basis Using Incremental Encoder
1997
Abstract This paper deals with analysis and synthesis of algorithms for digital conditioning of signals generated by incremental encoders to estimate velocity of rotating devices for control purposes. Main objectives are to obtain high accuracy at low and high velocity and low tracking delays during accelerations. A digital conditioning method is described, Which uses a polynomial of order n whose coefficients are updated so as to fit the n+1 most recent velocity data acquired on a variable temporal basis. Digital sinlulations and experimental findings are shown with the ainl to validate the proposed estimation method and compare it with other methods.
Computer networks stability independence of the queuing delays
2015
Communication in intelligent computer networks is an indispensible attribute of the dataflow quality in Web traffic. We propose a model that investigates intelligent computer networks stability while specifying its limits. Packet queuing delay affects the performance of the network, and especially its stability. If the network is presented as a dynamic system in block diagram form, we compute a transfer function and determine the quasi-polynomial system. The characteristic polynomial distribution of zeros of complex variable quasi-plane determines the boundaries of the network stability. The approach relies on estimation of the network system's transfer functions and its quasi-polynomial. C…
Simulation of parallel mechanisms for motion cueing generation in vehicle simulators using AM-FM bi-modulated signals
2018
Abstract The use of robotic motion platforms in vehicle simulators is relatively common. However, the process of testing and tuning the so-called washout algorithms, used for motion cueing generation in motion-based vehicle simulators, is complex. This process can be reduced in cost, simplified, improved, shortened and performed safer if virtual motion platforms are used instead of real devices. This paper deals with identifying a method to perform a fast but reliable simulation of parallel mechanisms to be used for motion cueing generation. The method relies on the use of Laplacian polynomial transfer function models by means of using AM-FM bi-modulated signals as reference inputs to achie…
Generalized wavelets design using Kernel methods. Application to signal processing
2013
Abstract Multiresolution representations of data are powerful tools in signal processing. In Harten’s framework, multiresolution transforms are defined by predicting finer resolution levels of information from coarser ones using an operator, called the prediction operator, and defining details (or wavelet coefficients) that are the difference between the exact values and the predicted values. In this paper we present a multiresolution scheme using local polynomial regression theory in order to design a more accurate prediction operator. The stability of the scheme is proved and the order of the method is calculated. Finally, some results are presented comparing our method with the classical…
Algebras with intermediate growth of the codimensions
2006
AbstractLet F be a field of characteristic zero and let A be an F-algebra. The polynomial identities satisfied by A can be measured through the asymptotic behavior of the sequence of codimensions and the sequence of colengths of A. For finite dimensional algebras we show that the colength sequence of A is polynomially bounded and the codimension sequence cannot have intermediate growth. We then prove that for general nonassociative algebras intermediate growth of the codimensions is allowed. In fact, for any real number 0<β<1, we construct an algebra A whose sequence of codimensions grows like nnβ.
Varieties of Algebras with Superinvolution of Almost Polynomial Growth
2015
Let A be an associative algebra with superinvolution ∗ over a field of characteristic zero and let $c_{n}^{\ast }(A)$ be its sequence of corresponding ∗-codimensions. In case A is finite dimensional, we prove that such sequence is polynomially bounded if and only if the variety generated by A does not contain three explicitly described algebras with superinvolution. As a consequence we find out that no intermediate growth of the ∗-codimensions between polynomial and exponential is allowed.
Asymptotics for Capelli polynomials with involution
2021
Let F be the free associative algebra with involution ∗ over a field F of characteristic zero. We study the asymptotic behavior of the sequence of ∗- codimensions of the T-∗-ideal Γ∗ M+1,L+1 of F generated by the ∗-Capelli polynomials Cap∗ M+1[Y, X] and Cap∗ L+1[Z, X] alternanting on M + 1 symmetric variables and L + 1 skew variables, respectively. It is well known that, if F is an algebraic closed field of characteristic zero, every finite dimensional ∗-simple algebra is isomorphic to one of the following algebras: · (Mk(F ), t) the algebra of k × k matrices with the transpose involution; · (M2m(F ), s) the algebra of 2m × 2m matrices with the symplectic involution; · (Mh(F ) ⊕ Mh(F )op, e…
Morphological exponential entropy driven-HUM.
2006
This paper presents an improvement to the Ex- ponential Entropy Driven - Homomorphic Unsharp Masking (E 2 D − HUM ) algorithm devoted to illumination artifact sup- pression on Magnetic Resonance Images. E 2 D−HUM requires a segmentation step to remove dark regions in the foreground whose intensity is comparable with background, because strong edges produce streak artifacts on the tissues. This new version of the algorithm keeps the same good properties of E 2 D − HUM without a segmentation phase, whose parameters should be chosen in relation to the image. I. INTRODUCTION Most of the studies on illumination correction found in literature are oriented to brain (18) magnetic resonance images (…