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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    On bound for the solution of the unified algebraic Riccati equation
    Autorzy:
    Czornik, Adam
    Powiązania:
    https://bibliotekanauki.pl/articles/747525.pdf
    Data publikacji:
    1997
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Algebraic methods
    Matrix equations and identities
    Single equations
    Opis:
    .
    In recent, years, several bounds of eigenvalues, norms and determinants for solutions of the continuous and discrete Riccati equations have been separately investigated. In this paper, an upper bound for the solution of the unified algebraic Riccati equations is presented. In the limit case, the result is reduced to a new upper bound for t he solution of discrete and continuous Riccati equation.
    Źródło:
    Mathematica Applicanda; 1997, 26, 40
    1730-2668
    2299-4009
    Pojawia się w:
    Mathematica Applicanda
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The form of the n-th iteration of the operator q=fd/dx
    Autorzy:
    Szymkat, Maciej
    Powiązania:
    https://bibliotekanauki.pl/articles/747433.pdf
    Data publikacji:
    1983
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Combinatorial identities, bijective combinatorics
    Partitions
    Ordinary differential operators
    Opis:
    Artykuł nie zawiera streszczenia
    Motivated by applications in linear dynamical systems, the author studies q^n(f), where q is the operator f●(d/dx) and qn is its n-th iteration. q^n(f) is a polynomial F(f(0),f(1),...,f(n)) in the derivatives f(0)=f,...,f(n) of f with integer coefficients. Special attention is paid to determining the coefficients of F. The author presents algorithms for computing the coefficients and also shows that the sum of all coefficients of F equals n!. The paper ends with some remarks on the number of coefficients of F, which is related to the number-theoretic unrestricted partition function.
    Źródło:
    Mathematica Applicanda; 1983, 11, 22
    1730-2668
    2299-4009
    Pojawia się w:
    Mathematica Applicanda
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A relation between the concepts of transposition, similarity, and symmetry, as well as matrix equations
    Autorzy:
    Kaczorek, Tadeusz
    Powiązania:
    https://bibliotekanauki.pl/articles/747820.pdf
    Data publikacji:
    2005
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Matrix equations and identities, Eigenvalues, singular values, and eigenvectors
    Opis:
    The author studies relationships among the notions of transpose, similarity, and symmetrization of matrices. It is shown that a square matrix is similar to its transpose, and that there exists a matrix that, simultaneously, carries this similarity transformation and symmetrizes the matrix. Furthermore, some equalities involving adjoint matrices are established as well. The proofs of the results are formulated for complex matrices, but they are valid also for other algebraically closed fields.
    Źródło:
    Mathematica Applicanda; 2005, 33, 47/06
    1730-2668
    2299-4009
    Pojawia się w:
    Mathematica Applicanda
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The theorems of Koenig and Birkhoff and their connection with the minimization of the duration time of the measurements of automatic telecommunication channels
    Autorzy:
    Perz, Szczepan
    Zaremba, Leszek
    Powiązania:
    https://bibliotekanauki.pl/articles/748569.pdf
    Data publikacji:
    1982
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Channel models (including quantum), Discrete-time control systems, Hypergraphs, Matrix equations and identities, Matrices of integers, Stochastic matrices
    Opis:
    .
    A problem (P) of minimization of the duration time of the measurements of automatic telecommunication channels is considered. P is a discrete optimization problem solved by graph theory methods. It is defined by (i)-(v), where: (i) for each i, 1≤i≤p, and j, 1≤1≤p, there are given k ij channels to be measured between node ”i” and node ”j”; (ii) measurement of one channel lasts one unit; (iii) there are exactly two devices, say A, B, in each node (the case where there is an arbitrary number of devices A, B in each node may be easily reduced to this case); (iv) the channel between node ”i” and node ”j” may be measured only by use of device A being present in node ”i” and device B in node ”j”; (v) in each time both devices A or B may measure only one channel. To solve P, some knowledge of hypergraphs as well as functional analysis (the Krein-Milman theorem) and linear algebra (the Koenig theorem) is necessary. The Koenig theorem is proved in a simple manner similarly as the dual Koenig theorem (which is a new result). As corollaries the Birkhoff theorem about bistochastic matrices and the dual Birkhoff theorem are deduced.
    Źródło:
    Mathematica Applicanda; 1982, 10, 19
    1730-2668
    2299-4009
    Pojawia się w:
    Mathematica Applicanda
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      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