Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  eigenvalues
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
100%
EN
This paper contains a number of results in the theory of star partitions of graphs. We illustrate a variety of situations which can arise when the Reconstruction Theorem for graphs is used, considering in particular galaxy graphs - these are graphs in which every star set is independent. We discuss a recursive ordering of graphs based on the Reconstruction Theorem, and point out the significance of galaxy graphs in this connection.
2
Content available remote

A Symbolic Test-Function for Describing Electromagnetic Interaction

100%
EN
This paper presents a symbolic test-function defined on a restricted interval for describing the electromagnetic interaction. An exponential function with the exponent represented by the inverse of a differential operator is put in correspondence with a test function defined on a restricted interval. The lateral limits of this function at the edge of this interval are either zero (when the variable is considered in closer proximity inside this interval) or infinity (when the variable is considered in closer proximity outside this interval). By substituting with a differential operator these edges (stable points) can be put in correspondence with the wave function of charged particles. In a similar manner, the maximum of this function (an unstable point) can be put in correspondence with an electromagnetic propagating wave. As a consequence, the electromagnetic interaction can be described by particles with eigenvalues of differential operators confined within a restricted interval (similar to wavelets presenting a non-zero amplitude on limited space-time intervals).
3
Content available remote

Inequality-based approximation of matrix eigenvectors

88%
EN
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.
EN
We study the homogeneous Riemann-Hilbert problem with a vanishing scalar-valued continuous coefficient. We characterize non-existence of nontrivial solutions in the case where the coefficient has its values along several rays starting from the origin. As a consequence, some results on injectivity and existence of eigenvalues of Toeplitz operators in Hardy spaces are obtained.
EN
Assume the eigenvalues and the weights are given for a difference boundary value problem and that the form of the boundary conditions at the endpoints is known. In particular, it is known whether the endpoints are fixed (i.e. Dirichlet or non-Dirichlet boundary conditions) or whether the endpoints are free to move (i.e. boundary conditions with affine dependence on the eigenparameter). This work illustrates how the potential as well as the exact boundary conditions can be uniquely reconstructed. The procedure is inductive on the number of unit intervals. This paper follows along the lines of S. Currie and A. Love, Inverse problems for difference equations with quadratic eigenparameter dependent boundary conditions, \emph{Quaestiones Mathematicae}, 40 (2017), no. 7, 861−877. Since the inverse problem considered in this paper contains more unknowns than the inverse problem considered in the above reference, an additional spectrum is required more often than was the case in the unique reconstruction of the potential alone.
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On composition of signed graphs

88%
EN
A graph whose edges are labeled either as positive or negative is called a signed graph. In this article, we extend the notion of composition of (unsigned) graphs (also called lexicographic product) to signed graphs. We employ Kronecker product of matrices to express the adjacency matrix of this product of two signed graphs and hence find its eigenvalues when the second graph under composition is net-regular. A signed graph is said to be net-regular if every vertex has constant net-degree, namely, the difference of the number of positive and negative edges incident with a vertex. We also characterize balance in signed graph composition and have some results on the Laplacian matrices of this product.
7
75%
EN
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.
8
75%
EN
We study eigenvalue problems with discontinuous terms. In particular we consider two problems: a nonlinear problem and a semilinear problem for elliptic equations. In order to study the existence of solutions we replace these two problems with their multivalued approximations and, for the first problem, we estabilish an existence result while for the second problem we prove the existence of multiple nontrivial solutions. The approach used is variational.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.