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


Wyświetlanie 1-5 z 5
Tytuł:
Extracting second-order structures from single-input state-space models: application to model order reduction
Autorzy:
Guillet, J.
Mourllion, B.
Birouche, A.
Basset, M.
Powiązania:
https://bibliotekanauki.pl/articles/907584.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
model drugiego rzędu
obcinanie zrównoważone
obcinanie modalne
second order form model
preservation of the structural conditions
balanced truncation
modal truncation
Opis:
This paper focuses on the model order reduction problem of second-order form models. The aim is to provide a reduction procedure which guarantees the preservation of the physical structural conditions of second-order form models. To solve this problem, a new approach has been developed to transform a second-order form model from a state-space realization which ensures the preservation of the structural conditions. This new approach is designed for controllable single-input state-space realizations with real matrices and has been applied to reduce a single-input second-order form model by balanced truncation and modal truncation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 509-519
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient Numerical Algorithms for Balanced Stochastic Truncation
Autorzy:
Benner, P.
Quintana-Orti, E. S.
Quintana-Orti, G.
Powiązania:
https://bibliotekanauki.pl/articles/908055.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytmy
metoda Newtona
model reduction
stochastic realization
balanced truncation
sign function method
Newton's method
Opis:
We propose an efficient numerical algorithm for relative error model reduction based on balanced stochastic truncation. The method uses full-rank factors of the Gramians to be balanced versus each other and exploits the fact that for large-scale systems these Gramians are often of low numerical rank. We use the easy-to-parallelize sign function method as the major computational tool in determining these full-rank factors and demonstrate the numerical performance of the suggested implementation of balanced stochastic truncation model reduction.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 5; 1123-1150
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Discretization of singular systems and error estimation
Autorzy:
Karampetakis, N. P.
Karamichalis, R.
Powiązania:
https://bibliotekanauki.pl/articles/330393.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
descriptor system
discretization
truncation error
first order hold
zero order hold
układ deskrypcyjny
dyskretyzacja
błąd obcięcia
szacowanie błędu
Opis:
This paper proposes a discretization technique for a descriptor differential system. The methodology used is both triangular first order hold discretization and zero order hold for the input function. Upper bounds for the error between the continuous and the discrete time solution are produced for both discretization methods and are shown to be better than any other existing method in the literature.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 1; 65-73
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Semi-Markov-based approach for the analysis of open tandem networks with blocking and truncation
Autorzy:
Oniszczuk, W.
Powiązania:
https://bibliotekanauki.pl/articles/907864.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć komputerowa
blokowanie
obcinanie
model semi-Markova
two-node network
blocking
truncation
semi-Markov model
Markov exact algorithm
Opis:
This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate [...], and the service times at the first and the second node are nonexponentially distributed with means sA and sB, respectively. Both nodes have buffers with finite capacities. In this type of network, if the second buffer is full, the accumulation of new tasks by the second node is temporarily suspended (a blocking factor) and tasks must wait on the first node until the transmission process is resumed. All new tasks that find the first buffer full are turned away and are lost (a truncation factor). First, a Markov model of the tandem is investigated. Here, a twodimensional state graph is constructed and a set of steady-state equations is created. These equations allow calculating state probabilities for each graph state. A special algorithm for transforming the Markov model into a semi-Markov process is presented. This approach allows calculating steady-state probabilities in the semi-Markov model. Next, the algorithms for calculating the main measures of effectiveness in the semi-Markov model are presented. In the numerical part of this paper, the author investigates examples of several semi-Markov models. Finally, the results of calculating both the main measures of effectiveness and quality of service (QoS) parameters are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 1; 151-163
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On truncations for weakly ergodic inhomogeneous birth and death processes
Autorzy:
Zeifman, A.
Satin, Y.
Korolev, V.
Shorgin, S.
Powiązania:
https://bibliotekanauki.pl/articles/330983.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
birth process
death process
weak ergodicity
truncation
forward Kolmogorov system
nonstationary Markovian queueing model
proces narodzin
proces śmierci
obcinanie
system Kołmogorowa
model Markowa
Opis:
We investigate a class of exponentially weakly ergodic inhomogeneous birth and death processes. We consider special transformations of the reduced intensity matrix of the process and obtain uniform (in time) error bounds of truncations. Our approach also guarantees that we can find limiting characteristics approximately with an arbitrarily fixed error. As an example, we obtain the respective bounds of the truncation error for an Mt/Mt/S queue for any number of servers S. Arbitrary intensity functions instead of periodic ones can be considered in the same manner.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 503-518
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    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