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: 6

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
Content available remote

Eigenvalue results for pseudomonotone perturbations of maximal monotone operators

100%
EN
Let X be an infinite-dimensional real reflexive Banach space such that X and its dual X* are locally uniformly convex. Suppose that T: X⊃D(T) → 2X* is a maximal monotone multi-valued operator and C: X⊃D(C) → X* is a generalized pseudomonotone quasibounded operator with L ⊂ D(C), where L is a dense subspace of X. Applying a recent degree theory of Kartsatos and Skrypnik, we establish the existence of an eigensolution to the nonlinear inclusion 0 ∈ T x + λ C x, with a regularization method by means of the duality operator. Moreover, possible branches of eigensolutions to the above inclusion are discussed. Furthermore, we give a surjectivity result about the operator λT + C when λ is not an eigenvalue for the pair (T, C), T being single-valued and densely defined.
Open Mathematics
|
2013
|
tom 11
|
nr 1
85-93
EN
The paper studies the existence of fixed points for some nonlinear (ws)-compact, weakly condensing and strictly quasibounded operators defined on an unbounded closed convex subset of a Banach space. Applications of the newly developed fixed point theorems are also discussed for proving the existence of positive eigenvalues and surjectivity of quasibounded operators in similar situations. The main condition in our results is formulated in terms of axiomatic measures of weak noncompactness.
3
Content available remote

A note on certain ergodicity coeflcients

88%
EN
We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem Ax = x as a particular M-matrix linear system, whose coefficient matrix can be defined in terms of the entries of A. Such property turns out to generalize the two known equivalent formulations of the Pagerank centrality of a graph.
EN
Let \(p\in(1,\infty)\) and \(I=(0,1)\); suppose that \(T\colon L_{p}(I)\rightarrow L_{p}(I)\) is a~compact linear map with trivial kernel and range dense in \(L_{p}(I)\). It is shown that if the Gelfand numbers of \(T\) decay sufficiently quickly, then the action of \(T\) is given by a series with calculable coefficients. The special properties of \(L_{p}(I)\) enable this to be established under weaker conditions on the Gelfand numbers than in earlier work set in the context of more general spaces.
5
Content available remote

A Brauer’s theorem and related results

88%
EN
Given a square matrix A, a Brauer’s theorem [Brauer A., Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices, Duke Math. J., 1952, 19(1), 75–91] shows how to modify one single eigenvalue of A via a rank-one perturbation without changing any of the remaining eigenvalues. Older and newer results can be considered in the framework of the above theorem. In this paper, we present its application to stabilization of control systems, including the case when the system is noncontrollable. Other applications presented are related to the Jordan form of A and Wielandt’s and Hotelling’s deflations. An extension of the aforementioned Brauer’s result, Rado’s theorem, shows how to modify r eigenvalues of A at the same time via a rank-r perturbation without changing any of the remaining eigenvalues. The same results considered by blocks can be put into the block version framework of the above theorem.
EN
We take as given a real symmetric matrix A, whose graph is a tree T, and the eigenvalues of A, with their multiplicities. Each edge of T may then be classified in one of four categories, based upon the change in multiplicity of a particular eigenvalue, when the edge is removed (i.e. the corresponding entry of A is replaced by 0).We show a necessary and suficient condition for each possible classification of an edge. A special relationship is observed among 2-Parter edges, Parter edges and singly Parter vertices. Then, we investigate the change in multiplicity of an eigenvalue based upon a change in an edge value. We show how the multiplicity of the eigenvalue changes depending upon the status of the edge and the edge value. This work explains why, in some cases, edge values have no effect on multiplicities. We also characterize, more precisely, how multiplicity changes with the removal of two adjacent vertices.
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ć.