Temat: minimal polynomial - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Skocz do pozycji: 2.

Tytuł:: Exact Expectation and Variance of Minimal Basis of Random Matroids
Autorzy:: Kordecki, Wojciech
Łyczkowska-Hanćkowiak, Anna
Powiązania:: https://bibliotekanauki.pl/articles/30146643.pdf
Data publikacji:: 2013-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: minimal basis
q-analog
finite projective geometry
Tutte polynomial
Opis:: We formulate and prove a formula to compute the expected value of the minimal random basis of an arbitrary finite matroid whose elements are assigned weights which are independent and uniformly distributed on the interval [0, 1]. This method yields an exact formula in terms of the Tutte polynomial. We give a simple formula to find the minimal random basis of the projective geometry PG(r − 1, q).
Źródło:: Discussiones Mathematicae Graph Theory; 2013, 33, 2; 277-288
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Digraph-building method for finding a set of minimal realizations of 2-D dynamic systems
Autorzy:: Markowski, K. A.
Hryniów, K.
Powiązania:: https://bibliotekanauki.pl/articles/200035.pdf
Data publikacji:: 2018
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: 2-D system
characteristic polynomial
digraph
minimal realization
MATLAB
system 2D
wielomian
graf dwudzielny
Opis:: This paper presents a digraph-building method designed to find the determination of realization of two-dimensional dynamic system. The main differences between the method proposed and other state-of-the-art solutions used include finding a set of realizations (belonging to a defined class) instead of only one realization, and the fact that obtained realizations have minimal size of state matrices. In the article, the proposed method is described, compared to state-of-the-art methods and illustrated with numerical examples. To the best of authors’ knowledge, the method shown in the paper is superior to all other state-of-the-art solutions both in terms of number of solutions and their matrix size. Additionally, MATLAB function for determination of realization based on the set of state matrices is included.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 5; 589-597
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja