Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl

Ograniczanie wyników

Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

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

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

On the spectral Nevanlinna-Pick problem

100%
EN
We give several characterizations of the symmetrized n-disc Gₙ which generalize to the case n ≥ 3 the characterizations of the symmetrized bidisc that were used in order to solve the two-point spectral Nevanlinna-Pick problem in ℳ ₂(ℂ). Using these characterizations of the symmetrized n-disc, which give necessary and sufficient conditions for an element to belong to Gₙ, we obtain necessary conditions of interpolation for the general spectral Nevanlinna-Pick problem. They also allow us to give a method to construct analytic functions from the open unit disc of ℂ into Gₙ and to obtain some of the complex geodesics on Gₙ.
2
Content available remote

Nonlinear mappings preserving at least one eigenvalue

63%
EN
We prove that if F is a Lipschitz map from the set of all complex n × n matrices into itself with F(0) = 0 such that given any x and y we know that F(x) - F(y) and x-y have at least one common eigenvalue, then either $F(x) = uxu^{-1}$ or $F(x) = ux^{t}u^{-1}$ for all x, for some invertible n × n matrix u. We arrive at the same conclusion by supposing F to be of class 𝓒¹ on a domain in ℳₙ containing the null matrix, instead of Lipschitz. We also prove that if F is of class 𝓒¹ on a domain containing the null matrix satisfying F(0) = 0 and ρ(F(x) - F(y)) = ρ(x-y) for all x and y, where ρ(·) denotes the spectral radius, then there exists γ ∈ ℂ of modulus one such that either $γ^{-1}F$ or $γ^{-1}F̅$ is of the above form, where F̅ is the (complex) conjugate of F.
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ć.