Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "aproksymacja" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    Neuro-fuzzy TSK network for approximation of static and dynamic functions
    Autorzy:
    Linh, T.
    Osowski, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/205951.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    algorytm uczenia się
    aproksymacja
    sieć neuronowo-rozmyta
    approximation
    learning algorithms
    neuro-fuzzy networks
    Opis:
    The paper presents the neuro-fuzzy network in application to the approximation of the static and dynamic functions. The network implements the Takagi-Sugeno inference rules. The learning algorithm is based on the hybrid approach, splitting the learning phase into two stages : the adaptation of the linear output weights using the SVD algorithm and the conventional steepest descent backpropagation rule in application to the adaptation of the nonlinear parameters of the membership functions. The new approach to the generation of the inference rules, based on the fuzzy self-organization is proposed and the algorithm of automatic determination of the number of these rules has been also implemented. The method has been applied for the off-line modelling of static nonlinear relations and on-line simulation of the dynamic systems.
    Źródło:
    Control and Cybernetics; 2002, 31, 2; 309-326
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Error analysis of discrete approximations to bang-bang optimal control problems: the linear case
    Autorzy:
    Veliov, V. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/970563.pdf
    Data publikacji:
    2005
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    liniowy system sterowania
    aproksymacja dyskretna
    szacowanie błędów
    linear control systems
    discrete approximations
    error estimates
    Opis:
    The paper presents an error estimate for Runge-Kutta direct discretizations of terminal optimal control problems for linear systems. The optimal control for such problems is typically discontinuous, and Lipschitz stability of the solution with respect to perturbations does not necessarily hold. The estimate (in terms of the optimal controls) is of first order if certain recently obtained sufficient conditions for structural stability hold, and of fractional order, otherwise. The main tool in the proof is the established relation between the local convexity index of the reachable set and the multiplicity of zeros of appropriate switching functions associated with the problem.
    Źródło:
    Control and Cybernetics; 2005, 34, 3; 967-982
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On uniformly approximate convex and strongly alpha(.)-paraconvex functions
    Autorzy:
    Rolewicz, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/205953.pdf
    Data publikacji:
    2001
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    aproksymacja funkcji wypukłych i parawypukłych
    różniczkowalność Frecheta
    approximate convex and paraconvex functions
    Frechet differentiability
    Opis:
    In the paper the equivalence of the notions of uniformly approximate convex functions and strongly alpha(.)-paraconvex functions will be presented. As a consequence we obtain that uniformly approximate convex functions are Frechet differentiable on residual sets.
    Źródło:
    Control and Cybernetics; 2001, 30, 3; 323-330
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Error estimates for the finite-element approximation of an elliptic control problem with pointwise state and control constraints
    Autorzy:
    Meyer, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/971011.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    równanie eliptyczne
    aproksymacja numeryczna
    linear quadratic optimal control problems
    elliptic equations
    state constraints
    numerical approximation
    Opis:
    We consider a linear-quadratic elliptic optimal control problem with pointwise state constraints. The problem is fully discretized using linear ansatz functions for state and control. Based on a Slater-type argument, we investigate the approximation behavior for mesh size tending to zero. The obtained convergence order for the L²-error of the control and for H 1-error of the state is 1 - ε in the two-dimensional case and 1/2 - ε in three dimensions, provided that the domain satisfies certain regularity assumptions. In a second step, a state-constrained problem with additional control constraints is considered. Here, the control is discretized by constant ansatz functions. It is shown that the convergence theory can be adapted to this case yielding the same order of convergence. The theoretical findings are confirmed by numerical examples.
    Źródło:
    Control and Cybernetics; 2008, 37, 1; 51-83
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Similarity-based methods : a general framework for classification, approximation and association
    Autorzy:
    Duch, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/206007.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    aproksymacja
    klasyfikacja
    optymalizacja
    pamięć asocjacyjna
    approximation
    associative memory
    classification
    feature selection
    kNN
    optimization
    similarity-based methods
    Opis:
    Similarity-based methods (SBM) are a generalization of the minimal distance (MD) methods which form a basis of several machine learning and pattern recognition methods. Investigation of similarity leads to a fruitful framework in which many classification, approximation and association methods are accommodated. Probability p(C|X; M) of assigning class C to a vector X, given a classification model M, depends on adaptive parameters and procedures used in construction of the model. Systematic overview of choices available for model building is presented and numerous improvements suggested. Similarity-Based Methods have natural neural-network type realizations. Such neural network models as the Radial Basis Functions (RBF) and the Multilayer Perceptrons (MLPs) are included in this framework as special cases. SBM may also include several different submodels and a procedure to combine their results. Many new versions of similarity-based methods are derived from this framework. A search in the space of all methods belonging to the SBM framework finds a particular combination of parameterizations and procedures that is most appropriate for a given data. No single classification method can beat this approach. Preliminary implementation of SBM elements tested on a real-world datasets gave very good results.
    Źródło:
    Control and Cybernetics; 2000, 29, 4; 937-967
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Random approximations in multiobjective programming - with an application to portfolio optimization with shortfall constraints
    Autorzy:
    Vogel, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/205947.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    aproksymacja stochastyczna
    optymalizacja
    prawdopodobieństwo
    programowanie matematyczne
    stabilność
    estimated quantities
    Markowitz model
    multiobjective progranming
    portfolio
    probabilistic constraints
    stability
    Opis:
    Decision makers often heave to deal with a programming problem vhere some of the quantities are unknown. They will usually estimate these quantities and solve the problem as it then appears - the "approximate problem". Thus, there is a need to establish conditions which will ensure that the solutions to the approximate problem will come close to the solutions to the true problem in a suitable manner. The paper summarizes such results for multiobjective programming problems. The results ase illustrated by means of the Markowitz model of portfolio optimization. In order to show how probabilistic constraints may be dealt with using this framework, a shortfall constraint is taken into account.
    Źródło:
    Control and Cybernetics; 1999, 28, 4; 703-724
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Finite element error analysis for state-constrained optimal control of the Stokes equations
    Autorzy:
    Los Reyes, J. C. de
    Meyer, C.
    Vexler, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/969607.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    równanie Stokesa
    aproksymacja numeryczna
    element skończony
    linear quadratic optimal control problems
    Stokes equations
    state constraints
    numerical approximation
    finite elements
    Opis:
    An optimal control problem for 2d and 3d Stokes equations is investigated with pointwise inequality constraints on the state and the control. The paper is concerned with the full discretization of the control problem allowing for different types of discretization of both the control and the state. For instance, piecewise linear and continuous approximations of the control are included in the present theory. Under certain assumptions on the L∞-error of the finite element discretization of the state, error estimates for the control are derived which can be seen to be optimal since their order of convergence coincides with the one of the interpolation error. The assumptions of the L∞-finite-eleinent-error can be verified for different numerical settings. Finally the results of two numerical experiments are presented.
    Źródło:
    Control and Cybernetics; 2008, 37, 2; 251-284
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Error estimates for the finite-element approximation of a semilinear elliptic control problem
    Autorzy:
    Casas, E.
    Troeltzsch, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/206743.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    aproksymacja numeryczna
    metoda elementu skończonego
    równanie eliptyczne półliniowe
    sterowanie rozproszone
    distributed control
    error estimates
    finite element method
    numerical approximation
    semilinear elliptic equation
    Opis:
    We consider the finite-element approximation of a distributed optimal control problem governed by a semilinear elliptic partial differential equation, where pointwise constraints on the control are given. We prove the existence of local approximate solutions converging to a given local reference solution. Moreover, we derive error estimates for local solutions in the maximum norm.
    Źródło:
    Control and Cybernetics; 2002, 31, 3; 695-712
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimal control of semilinear evolution inclusions via discrete approximations
    Autorzy:
    Mordukhovich, B. S.
    Wang, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/1839178.pdf
    Data publikacji:
    2005
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    sterowanie optymalne
    analiza wariacyjna
    różniczkowanie uogólnione
    aproksymacja dyskretna
    warunek konieczny optymalności
    optimal control
    variational analysis
    generalized differentiation
    semilinear evolution inclusions
    discrete approximations
    necessary optimality conditions
    Opis:
    This paper studies a Mayer type optimal control problem with general endpoint constraints for semilinear unbounded evolution inclusions in reflexive and separable Banach spaces. First, we construct a sequence of discrete approximations to the original optimal control problem for evolution inclusions and prove that optimal solutions to discrete approximation problems uniformly converge to a given optimal solution for the original continuous-time problem. Then, based on advanced tools of generalized differentiation, we derive necessary optimality conditions for discrete-time problems under fairly general assumptions. Combining these results with recent achievements of variational analysis in infinite-dimensional spaces, we establish new necessary optimality conditions for constrained continuous-time evolution inclusions by passing to the limit from discrete approximations.
    Źródło:
    Control and Cybernetics; 2005, 34, 3; 849-870
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimal control of constrained delay-differential inclusions with multivalued initial conditions
    Autorzy:
    Mordukhovich, B. S.
    Wang, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/970519.pdf
    Data publikacji:
    2003
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    aproksymacja dyskretna
    warunek konieczny optymalności
    analiza wariacyjna
    stabilność
    optymalizacja niegładka
    różniczkowanie uogólnione
    delay-differential inclusions
    discrete approximations
    necessary optimality conditions
    variational analysis
    stability
    nonsmooth optimization
    generalized differentiation
    Opis:
    This paper studies a general optimal control problem for nonconvex delay-differential inclusions with endpoint constraints. In contrast to previous publications on this topic, we incorporate time-dependent set constraints on the initial interval, which are specific for systems with delays and provide an additional source for optimization. Our variational analysis is based on well-posed discrete approximations of constrained delay-differential inclusions by a family of time-delayed systems with discrete dynamics and perturbed constraints. Using convergence results for discrete approximations and advanced tools of nonsmooth variational analysis, we derive necessary optimality conditions for constrained delay-differential inclusions in both Euler-Lagrange and Hamiltonian forms involving nonconvex generalized differential constructions for nonsmooth functions, sets, and set-valued mappings.
    Źródło:
    Control and Cybernetics; 2003, 32, 3; 585-609
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      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