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ę "weak convergence" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    On unrestricted products of (W) contractions
    Autorzy:
    Bartoszek, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/965827.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    weak convergence
    unrestricted products
    linear contraction
    Opis:
    Given a family of (W) contractions $T_1, ..., T_N$ on a reflexive Banach space X we discuss unrestricted sequences $T_{r_n}∘...∘T_{r_1}(x)$. We show that they converge weakly to a common fixed point, which depends only on x and not on the order of the operators $T_{r_n}$ if and only if the weak operator closed semigroups generated by $T_1, ..., T_N$ are right amenable.
    Źródło:
    Colloquium Mathematicum; 2000, 86, 2; 163-170
    0010-1354
    Pojawia się w:
    Colloquium Mathematicum
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Convergence Analysis of An Improved Extreme Learning Machine Based on Gradient Descent Method
    Autorzy:
    Yusong, L.
    Zhixun, S.
    Bingjie, Y.
    Xiaoling, G.
    Zhaoyang, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/972914.pdf
    Data publikacji:
    2016
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    neural networks
    monotonicity
    weak convergence
    strong convergence
    USUA
    MNIST
    Opis:
    Extreme learning machine (ELM) is an efficient algorithm, but it requires more hidden nodes than the BP algorithms to reach the matched performance. Recently, an efficient learning algorithm, the upper-layer-solution-unaware algorithm (USUA), is proposed for the single-hidden layer feed-forward neural network. It needs less number of hidden nodes and testing time than ELM. In this paper, we mainly give the theoretical analysis for USUA. Theoretical results show that the error function monotonously decreases in the training procedure, the gradient of the error function with respect to weights tends to zero (the weak convergence), and the weight sequence goes to a fixed point (the strong convergence) when the iterations approach positive infinity. An illustrated simulation has been implemented on the MNIST database of handwritten digits which effectively verifies the theoretical results.
    Źródło:
    Journal of Applied Computer Science Methods; 2016, 8 No. 1; 5-15
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Weak convergence in L1 of the sequences of monotonic functions
    Autorzy:
    Puchała, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/122379.pdf
    Data publikacji:
    2014
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    mathematics
    weak convergence
    quasi-Young measures
    matematyka
    zbieżność słaba
    Opis:
    We use (quasi-) Young measures associated with strictly monotonic functions with a differentiable inverse to prove an L1 ([0,1],ℝ) weak convergence of the monotonic sequence of such functions. The result is well known, but the method seems to be new.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 3; 195-199
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Weak solutions of stochastic differential inclusions and their compactness
    Autorzy:
    Michta, Mariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/729384.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    semimartingale
    stochastic differential inclusions
    weak solutions
    martingale problem
    weak convergence of probability measures
    Opis:
    In this paper, we consider weak solutions to stochastic inclusions driven by a semimartingale and a martingale problem formulated for such inclusions. Using this we analyze compactness of the set of solutions. The paper extends some earlier results known for stochastic differential inclusions driven by a diffusion process.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2009, 29, 1; 91-106
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A generalization of the Opials theorem
    Autorzy:
    Cegielski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/970267.pdf
    Data publikacji:
    2007
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    punkt stały
    słaba zbieżność
    nonexpansive operators
    asymptotically regular operators
    fixed points
    weak convergence
    Opis:
    Opial presented in 1967 a theorem, which can be applied in order to prove the weak convergence of sequences (xk) in a Hilbert space, generated by iterative schemes of the form xk+1= Uxk for a nonexpansive and asymptotically regular operator U with nonempty Fix U. Several iterative schemes have, however, the form xk+i1 = UkXk, where (Uk) is a sequence of operators with a common fixed point. We show that under some conditions on the sequence (Uk) the sequence (xk) converges weakly to a common fixed point of operators Uk- We show also that the Opial's theorem and the Krasnoselskii-Mann theorem are the corollaries descending from the obtained results. Finally, we present some applications of the results to the convex feasibility problems.
    Źródło:
    Control and Cybernetics; 2007, 36, 3; 601-610
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Local convergence of inexact Newton methods under affine invariant conditions and hypotheses on the second Fréchet derivative
    Autorzy:
    Argyros, Ioannis
    Powiązania:
    https://bibliotekanauki.pl/articles/1338691.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    superlinear
    Fréchet derivative
    weak convergence
    inexact Newton method
    strong
    forcing sequence
    Banach space
    Opis:
    We use inexact Newton iterates to approximate a solution of a nonlinear equation in a Banach space. Solving a nonlinear equation using Newton iterates at each stage is very expensive in general. That is why we consider inexact Newton methods, where the Newton equations are solved only approximately, and in some unspecified manner. In earlier works [2], [3], natural assumptions under which the forcing sequences are uniformly less than one were given based on the second Fréchet derivative of the operator involved. This approach showed that the upper error bounds on the distances involved are smaller compared with the corresponding ones using hypotheses on the first Fréchet derivative. However, the conditions on the forcing sequences were not given in affine invariant form. The advantages of using conditions given in affine invariant form were explained in [3], [10]. Here we reproduce all the results obtained in [3] but using affine invariant conditions.
    Źródło:
    Applicationes Mathematicae; 1999, 26, 4; 457-465
    1233-7234
    Pojawia się w:
    Applicationes Mathematicae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Convergence theorems for strictly asymptotically pseudocontractive mappings in Hilbert spaces
    Autorzy:
    Saluja, G. S.
    Powiązania:
    https://bibliotekanauki.pl/articles/255600.pdf
    Data publikacji:
    2010
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    strictly asymptotically pseudo-contractive mapping
    implicit iteration scheme
    common fixed point
    strong convergence
    weak convergence
    Hilbert space
    Opis:
    In this paper, we establish the weak and strong convergence theorems for a k-strictly asymptotically pseudo-contractive mapping in the framework of Hilbert spaces. Our result improve and extend the corresponding result of Acedo and Xu, Liu, Marino and Xu, Osilike and Akuchu, and some others.
    Źródło:
    Opuscula Mathematica; 2010, 30, 4; 485-494
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Strong and weak stability of some Markov operators
    Autorzy:
    Rudnicki, Ryszard
    Powiązania:
    https://bibliotekanauki.pl/articles/965771.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    biomathematics
    weak and strong convergence of measures
    Markov operators
    Opis:
    An integral Markov operator $P$ appearing in biomathematics is investigated. This operator acts on the space of probabilistic Borel measures. Let $μ$ and $ν$ be probabilistic Borel measures. Sufficient conditions for weak and strong convergence of the sequence $(P^{n}μ-P^{n}ν)$ to $0$ are given.
    Źródło:
    Colloquium Mathematicum; 2000, 84/85, 1; 255-263
    0010-1354
    Pojawia się w:
    Colloquium Mathematicum
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On a nonlocal metric regularity of nonlinear operators
    Autorzy:
    Dmitruk, A. V.
    Powiązania:
    https://bibliotekanauki.pl/articles/970552.pdf
    Data publikacji:
    2005
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    odwzorowanie nieliniowe
    pokrycie jednostajne
    sterowanie ślizgowe
    słaba zbieżność
    non-linear mapping
    covering and metric regularity
    Lyusternik iteration process
    uniform covering
    combined operator
    sliding mode controls
    weak-* convergence
    Opis:
    We consider some versions and generalizations of the classical Lyusternik theorem on the covering property (metric regularity) of nonlinear mappings, study some related properties, and propose nonlocal theorems of the given type, which then are used in the proof of a relaxation theorem for a nonlinear control system with sliding modes and terminal equality constraints.
    Źródło:
    Control and Cybernetics; 2005, 34, 3; 723-746
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Bounds on the rate of convergence for one class of inhomogeneous Markovian queueing models with possible batch arrivals and services
    Autorzy:
    Zeifman, A.
    Razumchik, R.
    Satin, Y.
    Kiseleva, K.
    Korotysheva, A.
    Korolev, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/330534.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    inhomogeneous birth process
    inhomogeneous death process
    weak ergodicity
    rate of convergence
    sharp bounds
    logarithmic norm
    forward Kolmogorov system
    proces narodzin
    proces śmierci
    stopień konwergencji
    norma logarytmiczna
    system Kołmogorowa
    Opis:
    In this paper we present a method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically, we consider an inhomogeneous M/M/S queueing system with possible state-dependent arrival and service intensities, and additionally possible batch arrivals and batch service. A unified approach based on a logarithmic norm of linear operators for obtaining sharp upper and lower bounds on the rate of convergence and corresponding sharp perturbation bounds is described. As a side effect, we show, by virtue of numerical examples, that the approach based on a logarithmic norm can also be used to approximate limiting characteristics (the idle probability and the mean number of customers in the system) of the systems considered with a given approximation error.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 141-154
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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