𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Higher-rank numerical ranges and compression problems

✍ Scribed by Man-Duen Choi; David W. Kribs; Karol Życzkowski

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
219 KB
Volume
418
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiplicative maps preserving the highe
Multiplicative maps preserving the higher rank numerical ranges and radii
✍ Sean Clark; Chi-Kwong Li; Nung-Sing Sze 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Let M n be the semigroup of n × n complex matrices under the usual multiplication, and let S be different subgroups or semigroups in M n including the (special) unitary group, (special) general linear group, the semigroups of matrices with bounded ranks. Suppose Λ k (A) is the rank-k numerical range

Equality of higher numerical ranges of m
Equality of higher numerical ranges of matrices and a conjecture of Kippenhahn on Hermitian pencils
✍ Chi-Kwong Li; Ilya Spitkovsky; Sudheer Shukla 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 997 KB

Let M n be the algebra of all n × n complex matrices. For 1 ~< k ~< n, the kth numerical range of A 6 M, is defined by Wk(A) = {(i/k)E~=,x\*~Axj: {x t ..... x k} is an orthonormal set in C"}. It is known that {tr A/n} = W,(A) ~ W n\_ 1(A) c\_ ... c\_ WI(A). We study the condition on A under which W~

Optimized higher order time discretizati
Optimized higher order time discretization of second order hyperbolic problems: Construction and numerical study
✍ P. Joly; J. Rodríguez 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 578 KB

We investigate explicit higher order time discretizations of linear second order hyperbolic problems. We study the even order (2m) schemes obtained by the modified equation method. We show that the corresponding CFL upper bound for the time step remains bounded when the order of the scheme increases