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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-11 z 11
    Tytuł:
    Interative method of calculation of originally circular-symmetric structures
    Iteracyjna metoda obliczania modyfikowanych konstrukcji pierwotnie kołowo-symetrycznych
    Autorzy:
    Pruputniewicz, S.
    Pruputniewicz, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/396386.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    mechanika konstrukcji
    konstrukcje modyfikowane
    circular-symmetric structures
    modification
    cyclic matrices
    Opis:
    The paper proposes an iterative method of calculation of modified, originally circular-symmetric structures. The method applies a cyclical (or quasi-cyclical) stiffness matrix of the original structure in each iteration step. A lot of modified systems which differ considerably from circular-symmetric ones (lack of some elements, strengthening, additional supports) have been calculated. The obtained results indicate that although the algorithm is not unconditionally convergent, exact solutions are often received even for considerable changes in the original structure. Operations on considerably smaller matrices than the full ones describing a system completely, compensate for the necessity of performing a greater number of iterations than when applying other methods of modification.
    W pracy zaproponowano iteracyjny sposób obliczania modyfikowanych konstrukcji pierwotnie kołowo-symetrycznych, w którym na każdym kroku iteracji korzysta sięz cyklicznej (lub quasicyklicznej) macierzy sztywności konstrukcji pierwotnej. Wykonano obliczenia wielu modyfikowanych układów znacznie różniących się od kołowo-symetrycznych (brak niektórych elementów, wzmocnienia, dodatkowe podpory). Uzyskane wyniki wskazują na to, że chociaż algorytm nie jest bezwarunkowo zbieżny to nawet przy znacznych zmianach w konstrukcji pierwotnej uzyskuje się często dokładne rozwiązania. Działanie na macierzach znacznie mniejszych od pełnych macierzy opisujących układ znacząco rekompensuje koniecznośś wykonania wiekszej liczby iteracji niż przy korzystaniu z innych metod.
    Źródło:
    Civil and Environmental Engineering Reports; 2005, 1; 243-259
    2080-5187
    2450-8594
    Pojawia się w:
    Civil and Environmental Engineering Reports
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Computing Generalized Inverse Systems Using Matrix Pencil Methods
    Autorzy:
    Varga, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/908054.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    macierz
    metody numeryczne
    system inversion
    rational matrices
    descriptor systems
    numerical methods
    Opis:
    We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state-space representation. We put particular emphasis on two classes of inverses: the weak generalized inverse and the Moore-Penrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computational ingredient to determine generalized inverses is the orthogonal reduction of the system matrix pencil to appropriate Kronecker-like forms.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2001, 11, 5; 1055-1068
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Some properties of the spectral radius of a set of matrices
    Autorzy:
    Czornik, A.
    Jurgaś, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/908427.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    promień spektralny
    podpromień spektralny
    macierz symetryczna
    spectral radius
    spectral subradius
    symmetric matrices
    Opis:
    In this paper we show new formulas for the spectral radius and the spectral subradius of a set of matrices. The advantage of our results is that we express the spectral radius of any set of matrices by the spectral radius of a set of symmetric positive definite matrices. In particular, in one of our formulas the spectral radius is expressed by singular eigenvalues of matrices, whereas in the existing results it is expressed by eigenvalues.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 183-188
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A parallel block Lanczos algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric matrices on multicomputers
    Autorzy:
    Guarracino, M. R.
    Perla, F.
    Zanetti, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/908413.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    cluster architecture
    symmetric block Lanczos algorithm
    sparse matrices
    parallel eigensolver
    algorytm Lanczosa
    macierze rzadkie
    architektura klastrowa
    Opis:
    In the present work we describe HPEC (High Performance Eigenvalues Computation), a parallel software package for the evaluation of some eigenvalues of a large sparse symmetric matrix. It implements an efficient and portable Block Lanczos algorithm for distributed memory multicomputers. HPEC is based on basic linear algebra operations for sparse and dense matrices, some of which have been derived by ScaLAPACK library modules. Numerical experiments have been carried out to evaluate HPEC performance on a cluster of workstations with test matrices from Matrix Market and Higham’s collections. A comparison with a PARPACKroutine is also detailed. Finally, parallel performance is evaluated on random matrices, using standard parameters.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 241-249
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the realization theory of polynomial matrices and the algebraic structure of pure generalized state space systems
    Autorzy:
    Vardulakis, A. I. G.
    Karampetakis, N. P.
    Antoniou, E. N.
    Tictopoulou, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/907853.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    macierz wielomianowa
    nierozkładalność
    przestrzeń stanu
    polynomial matrices
    realization theory
    minimality
    irreducibility
    generalized state space
    infinite decoupling zeros
    Opis:
    We review the realization theory of polynomial (transfer function) matrices via 'pure' generalized state space system models. The concept of an irreducible-at-infinity generalized state space realization of a polynomial matrix is defined and the mechanism of the 'cancellations' of 'decoupling zeros at infinity' is closely examined. The difference between the concepts of irreducibility and minimality of generalized state space realizations of polynomial (transfer function) matrices is pointed out and the associated concepts of dynamic and non-dynamic variables appearing in generalized state space realizations are also examined.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2009, 19, 1; 77-88
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of the partitioning method to specific Toeplitz matrices
    Autorzy:
    Stanimirović, P.
    Miladinović, M.
    Stojanović, I.
    Miljković, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/330588.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    Moore-Penrose inverse
    partitioning method
    Toeplitz matrices
    MATLAB
    image restoration
    odwrotność Moore-Penrose
    metoda partycjonowania
    macierze Teoplitza
    odtworzenie obrazu
    Opis:
    We propose an adaptation of the partitioning method for determination of the Moore–Penrose inverse of a matrix augmented by a block-column matrix. A simplified implementation of the partitioning method on specific Toeplitz matrices is obtained. The idea for observing this type of Toeplitz matrices lies in the fact that they appear in the linear motion blur models in which blurring matrices (representing the convolution kernels) are known in advance. The advantage of the introduced method is a significant reduction in the computational time required to calculate the Moore–Penrose inverse of specific Toeplitz matrices of an arbitrary size. The method is implemented in MATLAB, and illustrative examples are presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 809-821
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A study on new right/left inverses of nonsquare polynomial matrices
    Autorzy:
    Hunek, W. P.
    Latawiec, K. J.
    Powiązania:
    https://bibliotekanauki.pl/articles/907786.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    układ wielowymiarowy
    macierz wielomianowa
    sterowanie minimalnowariancyjne
    multivariable systems
    right/left inverses of polynomial matrices
    Smith factorization
    minimum variance control
    Opis:
    This paper presents several new results on the inversion of full normal rank nonsquare polynomial matrices. New analytical right/left inverses of polynomial matrices are introduced, including the so-called [...]-inverses, [...]-inverses and, in particular, S-inverses, the latter providing the most general tool for the design of various polynomial matrix inverses. The application-oriented problem of selecting stable inverses is also solved. Applications in inverse-model control, in particular robust minimum variance control, are exploited, and possible applications in signal transmission/recovery in various types of MIMO channels are indicated.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 331-348
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A linear programming based analysis of the CP-rank of completely positive matrices
    Autorzy:
    Li, Y.
    Kummert, A.
    Frommer, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907323.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    macierz pozytywna
    programowanie liniowe
    algorytm Simplex
    completely positive matrices
    cp-rank
    linear programming
    simplex algorithm
    basic feasible solution
    pivot process
    Opis:
    A real matrix A is said to be completely positive (CP) if it can be decomposed as A= B BT, where the real matrix B has exclusively non-negative entries. Let k be the rank of A and Phik the least possible number of columns of the matrix B, the so-called completely positive rank (cp-rank) of A. The present work is devoted to a study of a general upper bound for the cp-rank of an arbitrary completely positive matrix A and its dependence on the ordinary rank k. This general upper bound of the cp-rank has been proved to be at most k(k + 1)/2. In a recent pioneering work of Barioli and Berman it was slightly reduced by one, which means that Phik \leq k(k + 1)/2-1 holds for k \geq 2. An alternative constructive proof of the same result is given in the present paper based on the properties of the simplex algorithm known from linear programming. Our proof illuminates complete positivity from a different point of view. Discussions concerning dual cones are not needed here. In addition to that, the proof is of constructive nature, i.e. starting from an arbitrary decomposition A= B1 B1T (B1\geq 0) a new decomposition A= B2 B2T (B2\geq 0) can be generated in a constructive manner, where the number of column vectors of B2 does not exceed k(k + 1)/2-1. This algorithm is based mainly on the well-known techniques stemming from linear programming, where the pivot step of the simplex algorithm plays a key role.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 25-31
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Stability analysis and H∞ control of discrete T–S fuzzy hyperbolic systems
    Autorzy:
    Duan, R.
    Li, J.
    Zhang, Y.
    Yang, Y.
    Chen, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/331173.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    discrete T–S fuzzy hyperbolic model
    parallel distributed compensation
    positive diagonally dominant matrices
    robust stability
    model Takagi-Sugeno
    kompensacja rozproszona
    sterowanie odporne
    Opis:
    This paper focuses on the problem of constraint control for a class of discrete-time nonlinear systems. Firstly, a new discrete T–S fuzzy hyperbolic model is proposed to represent a class of discrete-time nonlinear systems. By means of the parallel distributed compensation (PDC) method, a novel asymptotic stabilizing control law with the “soft” constraint property is designed. The main advantage is that the proposed control method may achieve a small control amplitude. Secondly, for an uncertain discrete T–S fuzzy hyperbolic system with external disturbances, by the proposed control method, the robust stability and H∞ performance are developed by using a Lyapunov function, and some sufficient conditions are established through seeking feasible solutions of some linear matrix inequalities (LMIs) to obtain several positive diagonally dominant (PDD) matrices. Finally, the validity and feasibility of the proposed schemes are demonstrated by a numerical example and a Van de Vusse one, and some comparisons of the discrete T–S fuzzy hyperbolic model with the discrete T–S fuzzy linear one are also given to illustrate the advantage of our approach.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 133-145
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An operational Haar wavelet method for solving fractional Volterra integral equations
    Autorzy:
    Saeedi, H.
    Mollahasani, N.
    Mohseni Moghadam, M.
    Chuev, G. N.
    Powiązania:
    https://bibliotekanauki.pl/articles/907499.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    równanie całkowe
    równanie całkowe Abela
    rachunek ułamkowy
    macierz operacyjna
    fractional Volterra integral equation
    Abel integral equation
    fractional calculus
    Haar wavelet method
    operational matrices
    Opis:
    A Haar wavelet operational matrix is applied to fractional integration, which has not been undertaken before. The Haar wavelet approximating method is used to reduce the fractional Volterra and Abel integral equations to a system of algebraic equations. A global error bound is estimated and some numerical examples with smooth, nonsmooth, and singular solutions are considered to demonstrate the validity and applicability of the developed method.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 535-547
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Proper feedback compensators for a strictly proper plant by polynomial equations
    Autorzy:
    Callier, F. M.
    Kraffer, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/908450.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    liniowy układ stacjonarny
    sprzężenie zwrotne
    macierz wielomianowa
    równanie wielomianowe
    linear time-invariant feedback control systems
    polynomial matrix systems
    row-column-reduced polynomial matrices
    feedback compensator design
    flexible belt device
    Opis:
    We review the polynomial matrix compensator equation XlDr + YlNr = Dk (COMP), e.g. (Callier and Desoer, 1982, Kučera, 1979; 1991), where (a) the right-coprime polynomial matrix pair (Nr,Dr) is given by the strictly proper rational plant right matrix-fraction P = NrD-1 r , (b) Dk is a given nonsingular stable closed-loop characteristic polynomial matrix, and (c) (Xl, Yl) is a polynomial matrix solution pair resulting possibly in a (stabilizing) rational compensator given by the left fraction C = X-1 l Yl. We recall first the class of all polynomial matrix pairs (Xl, Yl) solving (COMP) and then single out those pairs which result in a proper rational compensator. An important role is hereby played by the assumptions that (a) the plant denominator Dr is column-reduced, and (b) the closed-loop characteristic matrix Dk is row-column-reduced, e.g., monically diagonally degree-dominant. This allows us to get all solution pairs (Xl, Yl) giving a proper compensator with a row-reduced denominator Xl having (sufficiently large) row degrees prescribed a priori. Two examples enhance the tutorial value of the paper, revealing also a novel computational method.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 4; 493-507
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-11 z 11

      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