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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Inequality-Based Approximation of Matrix Eigenvectors
    Autorzy:
    Kocsor, A.
    Dombi, J.
    Balint, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/908503.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    matematyka
    eigenvectors
    eigenvalues
    inequalities
    error bounds
    iterative methods
    Opis:
    A novel procedure is given here for constructing non-negative functions with zero-valued global minima coinciding with eigenvectors of a general real matrix A. Some of these functions are distinct because all their local minima are also global, offering a new way of determining eigenpairs by local optimization. Apart from describing the framework of the method, the error bounds given separately for the approximation of eigenvectors and eigenvalues provide a deeper insight into the fundamentally different nature of their approximations.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2002, 12, 4; 533-538
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Construction of constrained experimental designs on finite spaces for a modified Ek-optimality criterion
    Autorzy:
    Uciński, Dariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/1838172.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    constrained optimum experimental design
    minimal sum of largest eigenvalues
    generalized simplicial decomposition
    optimal measurement selection
    Opis:
    A simple computational algorithm is proposed for minimizing sums of largest eigenvalues of the matrix inverse over the set of all convex combinations of a finite number of nonnegative definite matrices subject to additional box constraints on the weights of those combinations. Such problems arise when experimental designs aiming at minimizing sums of largest asymptotic variances of the least-squares estimators are sought and the design region consists of finitely many support points, subject to the additional constraints that the corresponding design weights are to remain within certain limits. The underlying idea is to apply the method of outer approximations for solving the associated convex semi-infinite programming problem, which reduces to solving a sequence of finite min-max problems. A key novelty here is that solutions to the latter are found using generalized simplicial decomposition, which is a recent extension of the classical simplicial decomposition to nondifferentiable optimization. Thereby, the dimensionality of the design problem is drastically reduced. The use of the algorithm is illustrated by an example involving optimal sensor node activation in a large sensor network collecting measurements for parameter estimation of a spatiotemporal process.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2020, 30, 4; 659-677
    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ł:
    Axisymmetric free vibration of layered cylindrical shell filled with fluid
    Autorzy:
    Izyan, M. D. Nurul
    Sabri, Nur Ain Ayunni
    Hafizah, A. K. Nor
    Sankar, D. S.
    Viswanathan, K. K.
    Powiązania:
    https://bibliotekanauki.pl/articles/2106463.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    drgania swobodne
    powłoka cylindryczna
    efekt Love'a
    axisymmetric
    free vibration
    cylindrical shell
    Love’s first approximation theory
    inviscid fluid
    spline approximation
    eigenvalues
    Opis:
    The aim of the study is to analyse the axisymmetric free vibration of layered cylindrical shells filled with a quiescent fluid. The fluid is assumed to be incompressible and inviscid. The equations of axisymmetric vibrations of layered cylindrical shell filled with fluid, on the longitudinal and transverse displacement components are obtained using Love’s first approximation theory. The solutions of displacement functions are assumed in a separable form to obtain a system of coupled differential equations in terms of displacement functions. The displacement functions are approximated by Bickley-type splines. A generalized eigenvalue problem is obtained and solved numerically for a frequency parameter and an associated eigenvector of spline coefficients. Two layered shells with three different types of materials under clamped-clamped boundary conditions are considered. Parametric studies are made on the variation of the frequency parameter with respect to length-to-radius ratio and length-to-thickness ratio.
    Źródło:
    International Journal of Applied Mechanics and Engineering; 2021, 26, 4; 63--76
    1734-4492
    2353-9003
    Pojawia się w:
    International Journal of Applied Mechanics and Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Latent semantic indexing using eigenvalue analysis for efficient information retrieval
    Autorzy:
    Aswani Kumar, Ch.
    Srinivas, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/908375.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    wyszukiwanie informacji
    indeksowanie semantyczne
    wartość własna
    wektor przestrzenny
    information retrieval
    latent semantic indexing
    eigenvalues
    rank reduction
    singular value decomdecomposition
    vector space method
    Opis:
    Text retrieval using Latent Semantic Indexing (LSI) with truncated Singular Value Decomposition (SVD) has been intensively studied in recent years. However, the expensive complexity involved in computing truncated SVD constitutes a major drawback of the LSI method. In this paper, we demonstrate how matrix rank approximation can influence the effectiveness of information retrieval systems. Besides, we present an implementation of the LSI method based on an eigenvalue analysis for rank approximation without computing truncated SVD, along with its computational details. Significant improvements in computational time while maintaining retrieval accuracy are observed over the tested document collections.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2006, 16, 4; 551-558
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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