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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 69
Tytuł:
Inversion of Square Matrices in Processors With Limited Calculation Abillities
Autorzy:
Janiszowski, K. B.
Powiązania:
https://bibliotekanauki.pl/articles/908215.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
robotyka
exponential matrix series
matrix inversion
neuro-processors
Opis:
An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, like different neuro-computers and accelerator cards. The quality of inversion can be traced and tested. The algorithm can be used in the case of singular matrices, and then it automatically produces a result that contains the inverse of this part of the processed matrix which can be inverted. An example of the inversion of a six-order square matrix is presented and discussed.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 2; 199-204
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stabilization of an epidemic model via an N-periodic approach
Autorzy:
Cantó, B.
Coll, C.
Sánchez, E.
Powiązania:
https://bibliotekanauki.pl/articles/330825.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
nonnegative matrix
reducible matrix
seasonality
epidemic process
macierz nieujemna
macierz redukowalna
proces epidemiczny
Opis:
We analyze the evolution of an infectious disease by combining different groups of a population when the route of transmission is via encounters with free-living virulent organisms that can survive for a long time outside the individual. This study involves matrix analysis of lower triangular block matrices and some of their spectral properties. We propose an N-periodic control strategy in order to stabilize the disease around the disease-free equilibrium point.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 185-195
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Clustering based on eigenvectors of the adjacency matrix
Autorzy:
Lucińska, M.
Wierzchoń, S. T.
Powiązania:
https://bibliotekanauki.pl/articles/331178.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
spectral clustering
adjacency matrix eigenvalues
adjacency matrix eigenvectors
graph perturbation theory
eigengap heuristics
klastrowanie widmowe
macierz sąsiedztwa
teoria grafów
Opis:
The paper presents a novel spectral algorithm EVSA (eigenvector structure analysis), which uses eigenvalues and eigenvectors of the adjacency matrix in order to discover clusters. Based on matrix perturbation theory and properties of graph spectra we show that the adjacency matrix can be more suitable for partitioning than other Laplacian matrices. The main problem concerning the use of the adjacency matrix is the selection of the appropriate eigenvectors. We thus propose an approach based on analysis of the adjacency matrix spectrum and eigenvector pairwise correlations. Formulated rules and heuristics allow choosing the right eigenvectors representing clusters, i.e., automatically establishing the number of groups. The algorithm requires only one parameter—the number of nearest neighbors. Unlike many other spectral methods, our solution does not need an additional clustering algorithm for final partitioning. We evaluate the proposed approach using real-world datasets of different sizes. Its performance is competitive to other both standard and new solutions, which require the number of clusters to be given as an input parameter.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 771-786
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the computation of the minimal polynomial of a polynomial matrix
Autorzy:
Karampetakis, P.
Tzekis, P.
Powiązania:
https://bibliotekanauki.pl/articles/908531.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
wielomian minimalny
dyskretna transformacja Fouriera
macierz wielomianowa
macierzowe równanie liniowe
minimal polynomial
discrete Fourier transform
polynomial matrix
linear matrix equations
Opis:
The main contribution of this work is to provide two algorithms for the computation of the minimal polynomial of univariate polynomial matrices. The first algorithm is based on the solution of linear matrix equations while the second one employs DFT techniques. The whole theory is illustrated with examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 3; 339-349
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
2-D lossless FIR filter design using synthesis of the paraunitary transfer function matrix
Autorzy:
Wawryn, Krzysztof
Poczekajło, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/24988510.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
lossless system
paraunitary transfer function matrix
FIR filter
embedding method
Opis:
A synthesis method for designing two-dimensional lossless finite impulse response (FIR) filters for various digital signal processing tasks is proposed. The synthesis method is based on using a 2-D embedding approach to obtain the paraunitary transfer function matrix of the lossless FIR filter. The elements of the paraunitary transfer function matrix are the transfer function of a given lossy FIR structure and the transfer functions for its complementary structures. The embedding method is used to design complementary FIR filter structures for several known lossy FIR filters. The lossless FIR filter matrix obtained in this article has a size of 3 × 1 and satisfies the paraunitary conditions. The conditions are described by a set of nonlinear equations. A modified Newton method is used to solve this set of equations. The proposed design method is used to determine the lossless structures of two-dimensional FIR filters for various digital processing tasks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 4; 673--686
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reproducing Kernels and Riccati Equations
Autorzy:
Dym, H.
Powiązania:
https://bibliotekanauki.pl/articles/908318.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
równanie różniczkowe Riccatiego
jądro reprodukujące
J-inner matrix valued functions
J-unitary matrix valued functions
Riccati equations
Lyapunov equations
reproducing kernel spaces
de Branges spaces
Opis:
The purpose of this paper is to exhibit a connection between the Hermitian solutions of matrix Riccati equations and a class of finite dimensional reproducing kernel Krein spaces. This connection is then exploited to obtain minimal factorizations of rational matrix valued functions that are J-unitary on the imaginary axis in a natural way.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 1; 35-53
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Relationship Between the Infinite Eigenvalue Assignment for Singular Systems and the Solvability of Polynomial Matrix Equations
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/908199.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
robotyka
assignment
infinite eigenvalue
singular
polynomial matrix equation
system
reliationship
Opis:
Two related problems, namely the problem of the infinite eigenvalue assignment and that of the solvability of polynomial matrix equations are considered. Necessary and sufficient conditions for the existence of solutions to both the problems are established. The relationships between the problems are discussed and some applications from the field of the perfect observer design for singular linear systems are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 2; 161-167
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Existence and Computation of the Set of Positive Solutions to Polynomial Matrix Equations
Autorzy:
Kaczorek, T.
Łopatka, R.
Powiązania:
https://bibliotekanauki.pl/articles/911183.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
obliczanie
równanie macierzowe
computation
set of positive solutions
polynomial matrix equation
Opis:
Necessary and sufficient conditions are established for the existence of positive solutions to polynomial diophatine equations. A method of computing of the set of positive solutions to a polynomial diophatine equation based on extreme points and extreme directions is proposed. The effectiveness of the method is demonstrated on a numerical example.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 309-320
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Existence and determination of the set of Metzler matrices for given stable polynomials
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/331407.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
oznaczanie
istnienie
macierz Metzlera
wielomian
stabilność
determination
existence
Metzler matrix
polynomial
stability
Opis:
The problem of the existence and determination of the set of Metzler matrices for given stable polynomials is formulated and solved. Necessary and sufficient conditions are established for the existence of the set of Metzler matrices for given stable polynomials. A procedure for finding the set of Metzler matrices for given stable polynomials is proposed and illustrated with numerical examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 389-399
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized reasoning about faults based on the diagnostic matrix
Autorzy:
Bartyś, M.
Powiązania:
https://bibliotekanauki.pl/articles/330190.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fault isolation
binary diagnostic matrix
fault information system
alternative fault signature
dominant fault signature
matrix of alternative fault signatures
fuzzy diagnosis
lokalizacja uszkodzeń
binarna macierz diagnostyczna
sygnatura alternatywna
Opis:
This paper introduces a set of comprehensive general reasoning rules about single faults based on a diagnostic matrix. The reasoning scheme unifies inference about faults based on a conventional binary diagnostic matrix, a two- and three-valued fault isolation system as well as on their fuzzy counterparts. There are introduced and defined notions of alternative and dominant fault signatures, fuzzy fault signatures as well as a matrix of alternative signatures. This matrix is supposed to be used instead of the classic diagnostic one. It is also shown that dominant fault signatures are transformable into alternative ones. Finally, three variants of concise general reasoning rules of faults are given. Three examples illustrate key point issues of the paper. The first example refers to a medical diagnostic case. It shows an instance of dominant fault signatures and, in fact, proposes a rational approach for planning diagnostic tests. The other examples describe the fuzzy reasoning approach employing a matrix of fuzzy alternative signatures applicable for use with multi-valued fuzzy diagnostic signals. Future works are outlined in the summary section.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 2; 407-417
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Delay-Dependent Stability for Neutral Delay-Differential Systems
Autorzy:
Han, Q. L.
Powiązania:
https://bibliotekanauki.pl/articles/908069.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
opóźnienie czasowe
opóźnienie zależne
stability
time delay
neutral system
linear matrix inequality (LMI)
Opis:
This paper deals with the stability problem for a class of linear neutral delay-differential systems. The time delay is assumed constant and known. Delay-dependent criteria are derived. The criteria are given in the form of linear matrix inequalities which are easy to use when checking the stability of the systems considered. Numerical examples indicate significant improvements over some existing results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 4; 965-976
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
System Identification from Multiple-Trial Data Corrupted by Non-Repeating Periodic Disturbances
Autorzy:
Phan, M. Q.
Longman, R. W.
Lee, S. C.
Lee, J. W.
Powiązania:
https://bibliotekanauki.pl/articles/908209.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
robotyka
system identification
disturbance identification
iterative learning control
repetitive control
interaction matrix
Opis:
Iterative learning and repetitive control aim to eliminate the effect of unwanted disturbances over repeated trials or cycles. The disturbance-free system model, if known, can be used in a model-based iterative learning or repetitive control system to eliminate the unwanted disturbances. In the case of periodic disturbances, although the unknown disturbance frequencies may be the same from trial to trial, the disturbance amplitudes, phases, and biases do not necessarily repeat. Furthermore, the system may not return to the same initial state at the end of each trial before starting the next trial. In spite of these constraints, this paper shows how to identify the system disturbance-free dynamics from disturbance-corrupted input-output data collected over multiple trials without having to measure the disturbances directly. The system disturbance-free model can then be used to identify the disturbances as well, for use in learning or repetitive control. This paper represents the first extension of the interaction matrix approach to the multiple-trial environment of iterative learning control.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 2; 185-192
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Variable structure observer design for a class of uncertain systems with a time-varying delay
Autorzy:
Liu W., J.
Powiązania:
https://bibliotekanauki.pl/articles/330119.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
obserwator
niezmienniczość
uogólniona odwrotność macierzy
variable structure observer
invariance property
generalized matrix inverse approach
Opis:
Design of a state observer is an important issue in control systems and signal processing. It is well known that it is difficult to obtain the desired properties of state feedback control if some or all of the system states cannot be directly measured. Moreover, the existence of a lumped perturbation and/or a time delay usually reduces the system performance or even produces an instability in the closed-loop system. Therefore, in this paper, a new Variable Structure Observer (VSO) is proposed for a class of uncertain systems subjected to a time varying delay and a lumped perturbation. Based on the strictly positive real concept, the stability of the equivalent error system is verified. Based on the generalized matrix inverse approach, the global reaching condition of the sliding mode of the error system is guaranteed. Also, the proposed variable structure observer will be shown to possess the invariance property in relation to the lumped perturbation, as the traditional variable structure controller does. Furthermore, two illustrative examples with a series of computer simulation studies are given to demonstrate the effectiveness of the proposed design method.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 575-583
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Criteria for Stability of Uncertain Linear Systems With Time-Varying Delay
Autorzy:
Han, Q. L.
Gu, K.
Powiązania:
https://bibliotekanauki.pl/articles/911198.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
stabilność
niepewność
funkcja Lapunowa
stability
time-varying delay
uncertainty
linear matrix inequalities
Lyapunov functional
Opis:
This paper focuses on the stability problem for uncertain linear systems with time-varying delays. Based on a discretized Lyapunov functional approach, delay-dependent criteria that are formulated in terms of linear matrix inequalities are proposed to guarantee asymptotic stability for such systems. Numerical examples are also included to show the effectiveness of the method.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 205-225
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A dynamic model of classifier competence based on the local fuzzy confusion matrix and the random reference classifier
Autorzy:
Trajdos, P.
Kurzynski, M.
Powiązania:
https://bibliotekanauki.pl/articles/331025.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
multiclassifier system
cross competence measure
confusion matrix
feedback information
pomiar kompetencji
matryca błędu
informacja zwrotna
Opis:
Nowadays, multiclassifier systems (MCSs) are being widely applied in various machine learning problems and in many different domains. Over the last two decades, a variety of ensemble systems have been developed, but there is still room for improvement. This paper focuses on developing competence and interclass cross-competence measures which can be applied as a method for classifiers combination. The cross-competence measure allows an ensemble to harness pieces of information obtained from incompetent classifiers instead of removing them from the ensemble. The cross-competence measure originally determined on the basis of a validation set (static mode) can be further easily updated using additional feedback information on correct/incorrect classification during the recognition process (dynamic mode). The analysis of computational and storage complexity of the proposed method is presented. The performance of the MCS with the proposed cross-competence function was experimentally compared against five reference MCSs and one reference MCS for static and dynamic modes, respectively. Results for the static mode show that the proposed technique is comparable with the reference methods in terms of classification accuracy. For the dynamic mode, the system developed achieves the highest classification accuracy, demonstrating the potential of the MCS for practical applications when feedback information is available.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 175-189
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 69

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