Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Taylor approximation" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
An Approximation To The Optimal Subsample Allocation For Small Areas
Autorzy:
Molefe, W. B.
Shangodoyin, D. K.
Clark, R. G.
Powiązania:
https://bibliotekanauki.pl/articles/973548.pdf
Data publikacji:
2015
Wydawca:
Główny Urząd Statystyczny
Tematy:
composite estimation
mean squared error
sample design
small area estimation
sample size allocation
Taylor approximation
Opis:
This paper develops allocation methods for stratified sample surveys in which small area estimation is a priority. We assume stratified sampling with small areas as the strata. Similar to Longford (2006), we seek efficient allocation that minimizes a linear combination of the mean squared errors of composite small area estimators and of an estimator of the overall mean. Unlike Longford, we define mean-squared error in a model-assisted framework, allowing a more natural interpretation of results using an intra-class correlation parameter. This allocation has an analytical form for a special case, and has the unappealing property that some strata may be allocated no sample. We derive a Taylor approximation to the stratum sample sizes for small area estimation using composite estimation giving priority to both small area and national estimation.
Źródło:
Statistics in Transition new series; 2015, 16, 2; 163-182
1234-7655
Pojawia się w:
Statistics in Transition new series
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Finite horizon nonlinear predictive control by the Taylor approximation: Application to robot tracking trajectory
Autorzy:
Hedjar, R.
Toumi, R.
Boucher, P.
Dumur, D.
Powiązania:
https://bibliotekanauki.pl/articles/908454.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
układ nieliniowy
układ ciągły
sterowanie predykcyjne
aproksymacja Taylora
śledzenie trajektorii
nonlinear continuous time predictive control
Taylor approximation
tracking trajectory and robot
Opis:
In industrial control systems, practical interest is driven by the fact that today’s processes need to be operated under tighter performance specifications. Often these demands can only be met when process nonlinearities are explicitly considered in the controller. Nonlinear predictive control, the extension of well-established linear predictive control to nonlinear systems, appears to be a well-suited approach for this kind of problems. In this paper, an optimal nonlinear predictive control structure, which provides asymptotic tracking of smooth reference trajectories, is presented. The controller is based on a finite–horizon continuous time minimization of nonlinear predicted tracking errors. A key feature of the control law is that its implementation does not need to perform on-line optimization, and asymptotic tracking of smooth reference signal is guaranteed. An integral action is used to increase the robustness of the closed-loop system with respect to uncertainties and parameters variations. The proposed control scheme is first applied to planning motions problem of a mobile robot and, afterwards, to the trajectory tracking problem of a rigid link manipulator. Simulation results are performed to validate the tracking performance of the proposed controller.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 4; 527-540
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
Autorzy:
Arora, R.
Gupta, K.
Powiązania:
https://bibliotekanauki.pl/articles/1403683.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
bilevel programming
indefinite quadratic programming
multi-objective programming
pay-off matrix
Taylor series approximation
LINGO 17.0
Opis:
Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem. In this paper, a multi-objective indefinite quadratic bilevel programming problem (MOIQBP) is presented. The defined problem (MOIQBP) has multi-objective functions at both the levels. The followers are independent at the lower level. A fuzzy goal programming methodology is employed which minimizes the sum of the negative deviational variables of both the levels to obtain highest membership value of each of the fuzzy goal. The membership function for the objective functions at each level is defined. As these membership functions are quadratic they are linearized by Taylor series approximation. The membership function for the decision variables at both levels is also determined. The individual optimal solution of objective functions at each level is used for formulating an integrated pay-off matrix. The aspiration levels for the decision makers are ascertained from this matrix. An algorithm is developed to obtain a compromise optimal solution for (MOIQBP). A numerical example is exhibited to evince the algorithm. The computing software LINGO 17.0 has been used for solving this problem.
Źródło:
Archives of Control Sciences; 2020, 30, 4; 683-699
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise inequalities for Sobolev functions and some applications
Autorzy:
Bojarski, Bogdan
Hajłasz, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/1292626.pdf
Data publikacji:
1993
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Sobolev function
Taylor polynomial
approximation
integral representation
Bessel capacity
Opis:
We get a class of pointwise inequalities for Sobolev functions. As a corollary we obtain a short proof of Michael-Ziemer's theorem which states that Sobolev functions can be approximated by $C^m$ functions both in norm and capacity.
Źródło:
Studia Mathematica; 1993, 106, 1; 77-92
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies