The block numerical range of matrix polynomials

Block numerical ranges of matrix polynomials, especially the quadratic numerical range, are considered. The main results concern spectral inclusion, boundedness of the block numerical range, an estimate of the resolvent in terms of the quadratic numerical range, geometrical properties of the quadratic numerical range, and inclusion between block numerical ranges of the matrix polynomials for refined block decompositions. As an application, we connect the quadratic numerical range with the localization of the spectrum of matrix polynomials.     

The numerical range of a nonnegative matrix

We offer an almost self-contained development of Perron–Frobenius type results for the numerical range of an (irreducible) nonnegative matrix, rederiving and completing the previous work of Issos, Nylen and Tam, and Tam and Yang on this topic. We solve the open problem of characterizing nonnegative matrices whose numerical ranges are regular convex polygons with center at the origin. Some related results are obtained and some open problems are also posed.     

Convexity of the upper complex plane part of the numerical range of a quaternionic matrix

The quaternionic numerical range of a matrix with quaternion entries has a convex intersection with the upper half complex plane. The quaternionic analog of the elliptical range theorem is proved.     

The numerical range of a nilpotent operator on a Hilbert space

We prove that the numerical range of an arbitrary nilpotent operator on a complex Hilbert space is a circle (open or closed) with center at and radius not exceeding where is the power of nilpotency of

     

The numerical radius and bounds for zeros of a polynomial

Let be a monic polynomial. We obtain two bounds for zeros of via the Perron root and the numerical radius of the companion matrix of the polynomial.

     

The numerical range of a tridiagonal operator

Let r be a real number and A a tridiagonal operator defined by Aej=ej−1+rjej+1, j=1,2,…, where {e₁,e₂,…} is the standard orthonormal basis for ?²(N). Such tridiagonal operators arise in Rogers-Ramanujan identities. In this paper, we study the numerical ranges of these tridiagonal operators and finite-dimensional tridiagonal matrices. In particular, when r=−1, the numerical range of the finite-dimensional tridiagonal matrix is the convex hull of two explicit ellipses. Applying the result, we obtain that the numerical range of the tridiagonal operator is the square

     

A polynomial algorithm for one problem of guillotine cutting

We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem.     

Lucas' theorem and numerical range

The Lucas' theorem is generalized to the numerical ranges of some 3?×?3 companion matrices. We determine monic polynomials of degree 3 which assert the generalization. Examples are provided to show the generalization is restricted which gives a negative answer to the question raised by Zemanek [J. Zemanek, The derivative and linear algebra, Kolo Mlodych Matematykow, Ogolnopolskie Warsztaty, dla Mlodych Matematykow, Krakow, 2003, pp. 207–212.].     

The higher rank numerical range is convex

In this short note we provide the final step in showing that the higher rank numerical range is convex. The previous steps appear in the paper “Geometry of Higher-Rank Numerical Ranges” by Choi, M.-D., Giesinger, M., Holbrook, J.A. and Kribs, D.W.     

Convex hull properties and algorithms

Convex hull (CH) is widely used in computer graphic, image processing, CAD/CAM, and pattern recognition. We investigate CH properties and derive new properties: (1) CH vertices’ coordinates monotonically increase or decrease, (2) The edge slopes monotonically decrease. Using these properties, we proposed two algorithms, i.e., CH algorithm for planar point set, and CH algorithm for two available CHs. The main ideas of the proposed algorithms are as follows. A planar point set is divided into several subsets by the extreme points, and vertices in these subsets are then separately calculated. During the computation, the CH properties are used to eliminate concave points. This can reduce the computational cost and then improves the speed. Our first algorithm can extract CH with O(nlogn) time, which is the lower bound of planar CH extraction, and the second algorithm can obtain CH with O(m+n) time at the worst case.     

A finite algorithm for the Drazin inverse of a polynomial matrix

Based on Greville's finite algorithm for Drazin inverse of a constant matrix we propose a finite numerical algorithm for the Drazin inverse of polynomial matrices. We also present a new proof for Decell's finite algorithm through Greville's finite algorithm.     

On the intrinsic and the spatial numerical range

For a bounded function f from the unit sphere of a closed subspace X of a Banach space Y, we study when the closed convex hull of its spatial numerical range W(f) is equal to its intrinsic numerical range V(f). We show that for every infinite-dimensional Banach space X there is a superspace Y and a bounded linear operator such that . We also show that, up to renormig, for every non-reflexive Banach space Y, one can find a closed subspace X and a bounded linear operator T∈L(X,Y) such that .Finally, we introduce a sufficient condition for the closed convex hull of the spatial numerical range to be equal to the intrinsic numerical range, which we call the Bishop-Phelps-Bollobás property, and which is weaker than the uniform smoothness and the finite-dimensionality. We characterize strong subdifferentiability and uniform smoothness in terms of this property.     

Numerical range of a nilpotent matrix and related central force

In this paper, we introduce a new class of upper triangular nilpotent matrices, etermine the eigenvalues of the Hermitian part of rotating the type of nilpotent matrices and relate the numerical range of that typical type of matrices to the orbit of a point mass under a central force.     

Mean square polynomial stability of numerical solutions to a class of stochastic differential equations

The exponential stability of numerical methods to stochastic differential equations (SDEs) has been widely studied. In contrast, there are relatively few works on polynomial stability of numerical methods. In this letter, we address the question of reproducing the polynomial decay of a class of SDEs using the Euler–Maruyama method and the backward Euler–Maruyama method. The key technical contribution is based on various estimates involving the gamma function.     

On the numerical range in tropical algebra

ABSTRACT

We introduce the concept of numerical range in tropical linear algebra, explore its properties and show in particular that it contains all the tropical eigenvalues. An explicit formula is obtained for the tropical numerical range and an application in the asymptotic analysis of condition number of symmetric matrices is proposed.     

Pairs of quaternionic selfadjoint operators with numerical range in a halfplane

The property is studied that two selfadjoint operators on a quaternionic Hilbert space have the joint numerical range in a halfplane bounded by a line passing through the origin. This property is expressed in various ways, in particular, in terms of compressions to two dimensional subpaces, and in terms of linear dependence over the reals. The canonical form for two selfadjoint quaternionic operators in finite dimensional spaces is the main technical tool.