The lifting of polynomial traces revisited
نویسندگان
چکیده
We construct a lifting operator of polynomial traces on an interval that is stable in appropriate Sobolev norms. Next we extend this result to the case of traces vanishing at the endpoints of the interval. This has two applications, the interpolation of polynomial spaces and the evaluation by discrete formulas of fractional order Sobolev norms on polynomials. Résumé Nous construisons un opérateur de relèvement de traces polynômiales sur un intervalle qui est stable par rapport à des normes de Sobolev appropriées. Puis nous étendons ce résultat au cas de traces nulles aux extrémités de l’intervalle. Ceci a deux applications: l’interpolation d’espaces de polynômes, l’évaluation par des formules discrètes de normes de Sobolev d’ordre non entier appliquées à des polynômes.
منابع مشابه
Trace Semantics for Coalgebras
Traditionally, traces are the sequences of labels associated with paths in transition systems X → P(A×X). Here we describe traces more generally, for coalgebras of the form X → P(F (X)), where F is a polynomial functor. The main result states that F ’s final coalgebra Z ∼= −→ F (Z) gives rise to a weakly final coalgebra with state space P(Z), in a suitable category of coalgebras. Weak finality ...
متن کاملDetermining Changes in Electromyography Indices when Measuring Maximum Acceptable Weight of Lift in Iranian Male Students
Background: In spite of the increasing degree of automation in industry, manual material handling (MMH) is still performed in many occupational settings. The aim of the current study was to determine the maximum acceptable weight of lift using psychophysical and electromyography indices.Methods: This experimental study was conducted among 15 male students recruited from Tehran University of Med...
متن کاملDeciding LTL over Mazurkiewicz Traces
Linear time temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to und...
متن کاملLifting/Descending Processes for Polynomial Zeros
The recently proposed Chebyshev-like lifting map for the zeros of a uni-variate polynomial was motivated by its applications to splitting a univariate polynomial p(x) numerically into factors, which is a major step of some most eeective algorithms for approximating polynomial zeros. We complement the Chebyshev-like lifting process by a descending process, decrease the estimated computational co...
متن کاملA General Categorical Connection between Local Event Structures and Local Traces
Local event structures and local traces are generalizations of the classical prime event structures and Mazurkiewicz’ traces in which independence is no longer a global binary property. We consider the problem of lifting the categorical connection between prime event structures and Mazurkiewicz’ traces to this more general setting. Using a generic approach it is shown how certain subcategories ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 79 شماره
صفحات -
تاریخ انتشار 2010