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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Algebraic approach to domain decomposition
    Autorzy:
    Práger, Milan
    Powiązania:
    https://bibliotekanauki.pl/articles/1361065.pdf
    Data publikacji:
    1994
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    block matrix
    domain decomposition
    iterative methods
    Opis:
    An iterative procedure containing two parameters for solving linear algebraic systems originating from the domain decomposition technique is proposed. The optimization of the parameters is investigated. A numerical example is given as an illustration.
    Źródło:
    Banach Center Publications; 1994, 29, 1; 207-214
    0137-6934
    Pojawia się w:
    Banach Center Publications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Spectrum of J-frame operators
    Autorzy:
    Giribet, J.
    Langer, M.
    Leben, L.
    Maestripieri, A.
    Peria, F. M.
    Trunk, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/254979.pdf
    Data publikacji:
    2018
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    frame
    Krein space
    block operator matrix
    spectrum
    Opis:
    A J-frame is a frame F for a Krein space (H, [•,•] ) which is compatible with the indefinite inner product [•,•] in the sense that it induces an indefinite reconstruction formula that resembles those produced by orthonormal bases in H. With every J-frame the so-called J-frame operator is associated, which is a self-adjoint operator in the Krein space H. The J-frame operator plays an essential role in the indefinite reconstruction formula. In this paper we characterize the class of J-frame operators in a Krein space by a 2 x 2 block operator representation. The J-frame bounds of F are then recovered as the suprema and infima of the numerical ranges of some uniformly positive operators which are build from the entries of the 2x2 block representation. Moreover, this 2x2 block representation is utilized to obtain enclosures for the spectrum of J-frame operators, which finally leads to the construction of a square root. This square root allows a complete description of all J-frames associated with a given J-frame operator.
    Źródło:
    Opuscula Mathematica; 2018, 38, 5; 623-649
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Asymptotic behaviour and approximation of eigenvalues for unbounded block Jacobi matrices
    Autorzy:
    Malejki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/255505.pdf
    Data publikacji:
    2010
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    symmetric unbounded Jacobi matrix
    block Jacobi matrix
    tridiagonal matrix
    point spectrum
    eigenvalue
    asymptotics
    Opis:
    The research included in the paper concerns a class of symmetric block Jacobi matrices. The problem of the approximation of eigenvalues for a class of a self-adjoint unbounded operators is considered. We estimate the joint error of approximation for the eigenvalues, numbered from 1 to N, for a Jacobi matrix J by the eigenvalues of the finite submatrix J(n) of order pn x pn, where N = max{k ∈ N : k ≤ rpn} and r ∈ (0, 1) is suitably chosen. We apply this result to obtain the asymptotics of the eigenvalues of J in the case p = 3.
    Źródło:
    Opuscula Mathematica; 2010, 30, 3; 311-330
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Moving cast shadow detection using block nonnegative matrix factorization
    Autorzy:
    Yang, X.
    Liu, D.
    Zhou, D.
    Yang, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/200448.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    moving cast shadow detection
    video surveillance
    nonnegative matrix factorization
    block nonnegative matrix factorization
    nadzór wideo
    nieujemna faktoryzacja macierzy
    Opis:
    In recent years, moving cast shadow detection has become a critical challenge in improving the accuracy of moving object detection in video surveillance. In this paper, we propose two novel moving cast shadow detection methods based on nonnegative matrix factorization (NMF) and block nonnegative matrix factorization (BNMF). First, the algorithm of moving cast shadow detection using NMF is given and the key points such as the determination of moving shadow areas and the choice of discriminant function are specified. Then BNMF are introduced so that the new training samples and new classes can be added constantly with lower computational complexity. Finally, the improved shadow detection method is detailed described according to BNMF. The effectiveness of proposed methods is evaluated in various scenes. Experimental results demonstrate that the method achieves high detection rate and outperforms several state-of-the-art methods.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 2; 229-234
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Non symmetric random walk on infinite graph
    Autorzy:
    Zygmunt, M. J.
    Powiązania:
    https://bibliotekanauki.pl/articles/254997.pdf
    Data publikacji:
    2011
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    random walk on an infinite graph
    block tridiagonal transition matrix
    spectral measure matrix orthogonal polynomials
    Opis:
    We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
    Źródło:
    Opuscula Mathematica; 2011, 31, 4; 669-674
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Macierzowy model ewolucji składu ziarnowego materiału w dowolnym układzie mieląco-klasyfikującym
    Matrix model for transformation of particle size distribution of material in arbitrary milling-classify system
    Autorzy:
    Zbroński, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/216582.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Gospodarki Surowcami Mineralnymi i Energią PAN
    Tematy:
    modelowanie
    macierz blokowa
    macierz przejścia
    macierz klasyfikacji
    skład ziarnowy
    młyn
    klasyfikator
    obieg złożony
    układ mieląco-klasyfikujący
    modeling
    block matrix
    transition matrix
    classification matrix
    particIe size distribution
    mill
    classifier
    complex circuit
    milling-classify system
    Opis:
    W pracy szczegółowo omówiono sposób tworzenia macierzowego modelu ewolucji składu ziarnowego materiału w dowolnym układzie mieląco-klasyfikującym. Proponowany model oparty na równaniu bilansu masowego populacji ziaren składa się z trzech macierzy blokowych: macierzy całego układu M, macierzy wejść (nadawy bądź produktu) stopni układu F i macierzy nadawy całego układu F0. Poszczególne elementy macierzy blokowej M opisują ewolucję składu ziarnowego w całym układzie. W macierzy tej zawsze występuje macierz jednostkowa I i macierz zerowa 0, a w zależności od złożoności schematu układu pojawiają się w niej także macierz przejścia P i macierz klasyfikacji C, której elementy można wyznaczyć eksperymentalnie. Występujące w modelu elementy macierzy blokowej F opisują wszystkie gęstości składu ziarnowego wchodzące do danego stopnia układu mieląco-klasyfikującego, zaś elementy macierzy blokowej F0 ujmują gęstość składu ziarnowego nadawy ze źródeł zewnętrznych podawanej do wszystkich stopni układu. W pracy przedstawiono algorytm i trzy przykłady tworzenia macierzy blokowych dla wybranych schematów układu. Zaproponowany model może być wykorzystany w prognozowaniu uziarnienia produktu opuszczającego wybrany stopień układu oraz w modelowaniu procesów przeróbczych.
    Complex circuit of milling-classify systems are used in different branches of industry, because the required particle size distribution of product can seldom be reached in a single-stage grinding on the same device. The multistage processes of comminution and classification make possible suitable selection of parameters process for variables graining of fed material, mainly through sectioning of devices or change of their size and the types. Grinding material usually contains size fractions, which meet the requirements relating finished product. Then profitable is preliminary distributing material on a few size fractions, so to deal out with them demanded fraction of product, whereas remaining to direct alone or together with fed material to the same or different device. If the number of mills and classifiers in a circuit is large enough, building the model of particle size distribution transformation becomes rather complicated even for the circuit of a given structure. The situation becomes much more complicated, if we want to compare characteristics of all possible circuits, that can be constructed from these mills and classifiers, because the number of possible circuits increases greatly with the increase of number of devices being in the milling-classify system. The method creating matrix model for transformation of particle size distribution in a circuit of arbitrary structure of milling-classify system is presented in the article. The proposed model contains the mass population balance of particle equation, in which are block matrices: the matrix of circuit M, the matrix of inputs F and the matrix of feed F0. The matrix M contains blocks with the transition matrix P, the classification matrix C, the identity matrix I and the zero matrix 0 or elements describing the transformation of particle size distribution in the circuit. The matrix F is the block column matrix, which elements describing all particle size distributions at inputs to the circuit elements. The matrix F0 is the block column matrix, which elements describing particle size distributions in all feeds to the circuit. In paper was discussed this model in details, showed algorithm and three examples formatrix construction for the closed circuit ofmilling-classify systems. In conclusion was affirmed, that presented model makes possible to forecasting particle size distribution of grinding product, which leaving chosen the unit of system. The matrix model can be applied to improving modeling of mineral processing in the different grinding devices.
    Źródło:
    Gospodarka Surowcami Mineralnymi; 2011, 27, 3; 69-80
    0860-0953
    Pojawia się w:
    Gospodarka Surowcami Mineralnymi
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the eigenvalues of a 2 x 2 block operator matrix
    Autorzy:
    Muminov, M. I.
    Rasulov, T. H.
    Powiązania:
    https://bibliotekanauki.pl/articles/254735.pdf
    Data publikacji:
    2015
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    block operator matrix
    Fock space
    discrete and essential spectra
    Birman-Schwinger principle
    Efimov effect
    discrete spectrum asymptotics
    embedded eigenvalues
    Opis:
    A 2 x 2 block operator matrix H acting in the direct sum of one- and two-particle subspaces of a Fock space is considered. The existence of infinitely many negative eigenvalues of H22 (the second diagonal entry of H) is proved for the case where both of the associated Friedrichs models have a zero energy resonance. For the number N(z) of eigenvalues of H22 lying below z < 0, the following asymptotics is found [formula]. Under some natural conditions the infiniteness of the number of eigenvalues located respectively inside, in the gap, and below the bottom of the essential spectrum of H is proved.
    Źródło:
    Opuscula Mathematica; 2015, 35, 3; 371-395
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Matrix polynomials orthogonal with respect to a non-symmetric matrix of measures
    Autorzy:
    Zygmunt, M. J.
    Powiązania:
    https://bibliotekanauki.pl/articles/255142.pdf
    Data publikacji:
    2016
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    matrix orthogonal polynomials
    recurrence formula
    matrix of measures
    block Jacobi matrices
    Opis:
    The paper focuses on matrix-valued polynomials satisfying a three-term recurrence relation with constant matrix coefficients. It is shown that they form an orthogonal system with respect to a matrix of measures, not necessarily symmetric. Moreover, it is stated the condition on the coefficients of the recurrence formula for which the matrix measure is symmetric.
    Źródło:
    Opuscula Mathematica; 2016, 36, 3; 409-423
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the block decomposition and spectral factors of λ-matrices
    Autorzy:
    Bekhiti, Belkacem
    Nail, Bachir
    Dahimene, Abdelhakim
    Hariche, Kamel
    Fragulis, George F.
    Powiązania:
    https://bibliotekanauki.pl/articles/2049949.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    block roots
    solvents
    spectral factors
    block-Q.D. algorithm
    block-Horner’s algorithm
    matrix polynomials
    Opis:
    In this paper we have factorized matrix polynomials into a complete set of spectral factors using a new design algorithm, and with some systematic procedures a complete set of block roots (solvents) have been obtained. The newly developed procedure is just an extension of the (scalar) Horner method to its block form for use in the computation of the block roots of matrix polynomial, the block-Horner method bringing a local iterative nature, faster convergence, nested programmable scheme, needless of any prior knowledge of the matrix polynomial, with the only one inconvenience, which is the strong dependence on the initial guess. In order to avoid this trap, we proposed a combination of two computational procedures, for which the complete program starts with the right block-Q.D. algorithm. It is then followed by a refinement of the right factor by block-Horner’s algorithm. This results in the global nature of the program, which is faster in execution, has well defined initial conditions, and good convergence in much less time.
    Źródło:
    Control and Cybernetics; 2020, 49, 1; 41-76
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Inter-frame Prediction with Fast Weighted Low-rank Matrix Approximation
    Autorzy:
    Huang, Z. L.
    Hsiao, H. F.
    Powiązania:
    https://bibliotekanauki.pl/articles/227337.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    inter-frame prediction
    template matching
    block matching
    low-rank matrix approximation
    weighted low rank
    matrix approximation
    Opis:
    In the field of video coding, inter-frame prediction plays an important role in improving compression efficiency. The improved efficiency is achieved by finding predictors for video blocks such that the residual data can be close to zero as much as possible. For recent video coding standards, motion vectors are required for a decoder to locate the predictors during video reconstruction. Block matching algorithms are usually utilized in the stage of motion estimation to find such motion vectors. For decoder-side motion derivation, proper templates are defined and template matching algorithms are used to produce a predictor for each block such that the overhead of embedding coded motion vectors in bit-stream can be avoided. However, the conventional criteria of either block matching or template matching algorithms may lead to the generation of worse predictors. To enhance coding efficiency, a fast weighted low-rank matrix approximation approach to deriving decoder-side motion vectors for inter frame video coding is proposed in this paper. The proposed method first finds the dominating block candidates and their corresponding importance factors. Then, finding a predictor for each block is treated as a weighted low-rank matrix approximation problem, which is solved by the proposed column-repetition approach. Together with mode decision, the coder can switch to a better mode between the motion compensation by using either block matching or the proposed template matching scheme.
    Źródło:
    International Journal of Electronics and Telecommunications; 2013, 59, 1; 9-16
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On Regular Signed Graphs with Three Eigenvalues
    Autorzy:
    Anđelić, Milica
    Koledin, Tamara
    Stanić, Zoran
    Powiązania:
    https://bibliotekanauki.pl/articles/31534886.pdf
    Data publikacji:
    2020-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    adjacency matrix
    eigenvalue
    regular signed graph
    signed line graph
    block design
    Opis:
    In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular. We also give some constructions and determine all the signed graphs with 3 eigenvalues, under the constraint that they are either signed line graphs or have vertex degree 3. We also report our result of computer search on those with at most 10 vertices.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 2; 405-416
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Certain new M-matrices and their properties with applications
    Autorzy:
    Mohan, Ratnakaram
    Kageyama, Sanpei
    Lee, Moon
    Yang, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/729710.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    M-matrices
    non-orthogonality
    orthogonal number
    Hadamard matrix
    partially balanced incomplete block (PBIB) design
    regular graph
    Opis:
    The Mₙ-matrix was defined by Mohan [21] who has shown a method of constructing (1,-1)-matrices and studied some of their properties. The (1,-1)-matrices were constructed and studied by Cohn [6], Ehrlich [9], Ehrlich and Zeller [10], and Wang [34]. But in this paper, while giving some resemblances of this matrix with a Hadamard matrix, and by naming it as an M-matrix, we show how to construct partially balanced incomplete block designs and some regular graphs by it. Two types of these M-matrices have been considered. Also we will make a mention of certain applications of these M-matrices in signal and communication processing, and network systems and end with some open problems.
    Źródło:
    Discussiones Mathematicae Probability and Statistics; 2008, 28, 2; 183-207
    1509-9423
    Pojawia się w:
    Discussiones Mathematicae Probability and Statistics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      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