Next Article in Journal
Fixed/Predefined-Time Synchronization for Delayed Memristive Reaction-Diffusion Neural Networks Subject to Stochastic Disturbances
Previous Article in Journal
A Unified Rotation-Minimizing Darboux Framework for Curves and Relativistic Ruled Surfaces in Minkowski Three-Space
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Relationship Between the Pseudospectrum and the Quadratic Numerical Range for Upper Triangular Bounded Operator Matrices

School of Mathematical Sciences, Inner Mongolia University, Hohhot 010040, China
*
Author to whom correspondence should be addressed.
Axioms 2026, 15(3), 208; https://doi.org/10.3390/axioms15030208
Submission received: 1 January 2026 / Revised: 24 February 2026 / Accepted: 6 March 2026 / Published: 12 March 2026

Abstract

This paper studies the pseudospectral inclusion property of upper triangular bounded operator matrices in Hilbert spaces. It is proven that the pseudospectra of upper triangular bounded operator matrices are contained within the closure of the quadratic numerical range. Our result extends the inclusion relationship between the spectra of block operator matrices and the quadratic numerical range, as well as the inclusion relationship between the pseudospectra and the numerical range, to the pseudospectral case. Under appropriate conditions, we characterize the distribution range of the pseudospectra of upper triangular bounded operator matrices, and provide an example to illustrate the validity of the conclusions.

1. Introduction

Operator matrices, viewed as block matrices with linear operators as elements, play a fundamental role in various areas such as elasticity theory and quantum mechanics [1,2]. In particular, the analysis of their spectral structure is of central importance, since spectral characteristics not only determine the evolution of the underlying physical systems but are also directly related to their stability properties [3,4]. In practical problems, the spectral theory of non-self-adjoint operators is especially significant; however, in contrast to the self-adjoint case, the corresponding spectral analysis to the non-self-adjoint case is considerably more intricate. Describing the behavior of non-self-adjoint dynamical systems solely in terms of spectral information is often inadequate and may even lead to incorrect conclusions. Moreover, the spectrum of a linear operator can be highly sensitive to small perturbations, which makes it difficult to compute reliably in numerical practice. These issues highlight the inherent limitations of classical spectral analysis in many applications.
To overcome the above difficulties, the notion of pseudospectrum has been introduced. As an extension of the classical spectrum, the pseudospectrum provides a more effective tool for characterizing the stability of non-normal systems [5,6,7]. In recent years, the theory of pseudospectrum has attracted considerable attention and has become an active area of research in operator theory [8,9]. For instance, in [10], effective estimates for the pseudospectrum of upper triangular block matrices were obtained in terms of the pseudospectrum of their diagonal blocks. While ref. [10] works in finite-dimensional space and derives outer and inner approximations of the pseudospectra of block triangular matrices in terms of the pseudospectra of the diagonal blocks, the present work focuses on upper triangular bounded operator matrices on Hilbert spaces and relates their pseudospectra to the quadratic numerical range. In particular, our main results can be viewed as operator-theoretic counterparts of the pseudospectral enclosure bounds in [10], with the quadratic numerical range serving as a refined localization set better suited to block operator matrices.
For a linear operator A on a Hilbert space, it is well known that the spectrum σ ( A ) is always contained in the closure of its numerical range W ( A ) ¯ . However, the numerical range usually fails to provide a sharp description of the spectrum. To address this issue, Langer and Tretter [4] introduced the concept of the quadratic numerical range W 2 ( A ) for an operator matrix of the following form in Hilbert spaces:
A = A B C D ,
and proved that W 2 ( A ) W ( A ) . They further showed that, for an unbounded operator matrix A , the point spectrum σ p ( A ) and the approximate point spectrum σ app ( A ) satisfy
σ p ( A ) W 2 ( A ) , σ app ( A ) W 2 ( A ) ¯ .
The subsequent work in [11] demonstrated that, when A is a bounded operator matrix, the following spectral inclusion holds:
σ ( A ) W 2 ( A ) ¯ .
In recent years, considerable attention has been devoted to the quadratic numerical range [12,13,14]. It has been proven to be effective for it to have applications in several domains such as Krylov subspace methods, the analysis of damped systems, spectral perturbation theory, and the localization of polynomial zeros.
In another direction, it was established in [15] that the ε -pseudospectrum σ ε ( A ) of a linear operator A admits the inclusion
σ ε ( A ) W ( A ) ¯ + Δ ε ,
where Δ ε denotes the closed disc centered at the origin with radius ε . More recently, quadratic numerical ranges were employed in [16] to study spectral inclusion properties for a class of anti-triangular operator matrices, and related results on spectral gaps were also obtained. However, the numerical computation of pseudospectra is still rather demanding even in finite-dimensional settings, since it usually requires repeated evaluations of the smallest singular value of λ I T . To reduce this cost, several techniques have been proposed, such as Lanczos-type approximation methods [17], inverse iteration applied to ( λ I T ) * ( λ I T ) [18], and structure-preserving schemes that exploit the shift structure of λ I T [19]. Nonetheless, despite these advances, accurately and robustly computing pseudospectra for large-scale problems remains highly nontrivial.
In recent years, substantial progress has been made in understanding the relationship between the spectrum and the quadratic numerical range, as well as the intrinsic connection between the pseudospectrum and the numerical range. However, to the best of our knowledge, the deeper links between the pseudospectrum and the quadratic numerical range have not yet been explored in the literature.
Stimulated by the substantial computational challenges associated with pseudospectra and the relatively limited research on their relationship with the quadratic numerical range, we investigate the structural properties of 2 × 2 upper triangular bounded operator matrices and the norm equivalence of the associated matrices. On this basis, we systematically establish inclusion relations between their pseudospectra and quadratic numerical ranges, and hence provide a more precise description of the pseudospectral sets from the perspective of the quadratic numerical range. Since the main technical tools in this paper are matrix operations, in particular matrix multiplication and block matrices, it is worth mentioning that a wide variety of fast algorithms for matrix multiplication and related procedures have been developed in the literature. Many other matrix operations can, in fact, be reduced to matrix multiplication, and modern fast matrix multiplication algorithms crucially exploit block matrix structures. We refer the reader to the survey by Respondek [20] for an intelligible and comprehensive overview of so-called matrix black box algorithms and their numerous applications in matrix and non-matrix problems.

2. Preliminaries

In what follows, we denote by X a Hilbert space and by X × X the corresponding product Hilbert space. The symbols B ( X ) and B ( X × X ) stand for the sets of all bounded linear operators on X and on X × X , respectively. The inner product of two elements x and y in a Hilbert space will be denoted by ( x , y ) whenever no confusion can arise.
Furthermore, M n ( C ) denotes the set of all n × n complex matrices, and M n ( M m ( C ) ) denotes the set of all n × n block matrices with entries in M m ( C ) . The symbols I and 0 denote the identity operator and the zero operator on X, respectively. For a matrix A, its spectral norm, Frobenius norm and infinity norm are denoted by A 2 , A F and A , respectively.
The equivalent norms used in this paper (such as the 2-norm, Frobenius norm, and infinity norm) always act on finite-dimensional matrices. In contrast, for bounded linear operators (or operator matrices) on infinite-dimensional spaces, we still use the standard operator norm. In addition, σ min ( A ) and σ max ( A ) denote the smallest and largest singular values of the matrix A, respectively. In the subsequent analysis, we will frequently pass from operator-theoretic expressions on X × X to finite-dimensional 2 × 2 block matrices to exploit explicit singular value formulas and norm equivalences. Whenever such a transition is made, it will be indicated in the notation.
In this section, we recall the definitions of the pseudospectrum, the numerical range, and the quadratic numerical range.
Definition 1.
([6]) Let A B ( X ) . For any ϵ > 0 , the ϵ-pseudospectrum σ ϵ ( A ) of the operator A is defined by
σ ϵ ( A ) = λ C : ( λ I A ) 1 ϵ 1 .
Using a perturbation characterization, this can equivalently be written as
σ ϵ ( A ) = λ C : λ σ ( A + E ) ,   E B ( X )   with   E     ϵ .
Definition 2.
([21]) Let A B ( X ) . The numerical range W ( A ) of the operator A is defined by
W ( A ) = { ( A x , x ) : x = 1 } .
Definition 3.
([4]) Let A = A B C D be a block operator matrix, where A , B , C , D B ( X ) . For unit elements f , g X , define
A f , g : = ( A f , f ) ( B g , f ) ( C f , g ) ( D g , g ) ,
which is called the companion matrix of A associated with f and g. The quadratic numerical range W 2 ( A ) of the operator matrix A is defined by
W 2 ( A ) = f , g X f = g = 1 σ p ( A f , g ) ,
where σ p ( A f , g ) denotes the set of all eigenvalues of the matrix A f , g .
Moreover, the spectrum, quadratic numerical range, and numerical range of a bounded operator matrix satisfy the inclusion relation [3]
σ ( A ) W 2 ( A ) W ( A ) ,
which shows that, compared with the numerical range, the quadratic numerical range provides a finer description of the spectral distribution of operator matrices, and can capture the spectral properties of the operator more accurately.
Definition 4.
([22]) Let A a and A b be two norms of an element A in the matrix space M n ( C ) , where a , b { · F , · 2 , · } . If there exist positive constants c 1 and c 2 , independent of A, such that
c 1 A b A a c 2 A b , A M n ( C ) ,
then the norms A a and A b are said to be equivalent.
Furthermore, any two matrix norms on M n ( C ) are equivalent, and the 2-norm, Frobenius norm, and infinity norm of A M n ( C ) satisfy the following relations:
A 2 A F n A 2 , 1 n A A 2 n A , A A F n A .
Let A , B , D B ( X ) . In what follows, we always use
T = A B 0 D B ( X × X ) ,
to denote 2 × 2 upper triangular bounded operator matrices.

3. Main Results

In this section, we first establish norm estimates, in the Frobenius norm · F , for the 2 × 2 upper triangular bounded operator matrix T . Subsequently, we present the computation formulas and related properties for the largest and smallest singular values of 2 × 2 upper triangular matrices. On this basis, by exploiting the equivalence of matrix norms, we further construct two outer approximation sets of the pseudospectrum of T in terms of the spectral norm · 2 and the quadratic numerical range, thereby systematically revealing the intrinsic relationship between its pseudospectrum and quadratic numerical range.
To characterize the pseudospectrum of the upper triangular operator matrix T , we first need to derive suitable estimates for its operator norm.
Lemma 1.
Assume that T is given as in (2). Then
T = A B 0 D A B 0 D F .
Proof of Lemma 1.
Let ξ = ( x , y ) T X × X . By the definition of the operator norm, we have
T = sup ξ = 1 T ξ = sup ξ = 1 ( A x + B y , D y ) T .
Because ξ = 1 , by the norm formula in the product Hilbert space X × X , we have
ξ 2 = ( x , y ) 2 = x 2 + y 2 = 1 .
By the definition of the vector norm, it follows that
T ξ 2 = A x + B y 2 + D y 2 ( A x + B y ) 2 + D y 2 A 2 x 2 + B 2 y 2 + 2 A x B y + D 2 y 2 A 2 x 2 + ( B 2 + D 2 ) y 2 + 2 A x B y .
Set p = x , q = y , A = a , B = b , and D = c . Our goal is to compute
max F ( p , q ) = a 2 p 2 + ( b 2 + c 2 ) q 2 + 2 a b p q | p 2 + q 2 = 1 .
To this end, consider the following auxiliary Lagrange function:
L ( p , q , λ ) = a 2 p 2 + ( b 2 + c 2 ) q 2 + 2 a b p q λ ( p 2 + q 2 1 ) .
From the conditions 𝜕 L 𝜕 p = 𝜕 L 𝜕 q = 0 , after simplification we obtain
( a 2 λ ) p + a b q = 0 , a b p + ( b 2 + c 2 λ ) q = 0 .
By the theory of linear algebra, a nontrivial solution exists if and only if the determinant of the coefficient matrix is zero, that is,
det a 2 λ a b a b b 2 + c 2 λ = 0 .
A direct calculation yields
F ( p , q ) = λ = a 2 + b 2 + c 2 ± ( a 2 + b 2 + c 2 ) 2 4 a 2 c 2 2 .
Since F ( p , q ) is continuous on the compact set { ( p , q ) | p 2 + q 2 = 1 } , it attains its maximum and minimum there, and
F ( p , q ) max = λ max = a 2 + b 2 + c 2 + ( a 2 + b 2 + c 2 ) 2 4 a 2 c 2 2 .
For convenience, set
S : = a 2 + b 2 + c 2 0 .
Since 4 a 2 c 2 0 , we have
S 2 4 a 2 c 2 S 2 S 2 4 a 2 c 2 S 2 = S .
Therefore,
λ max = S + S 2 4 a 2 c 2 2 S + S 2 = S = a 2 + b 2 + c 2 .
Therefore, we obtain T ξ 2 A 2 + B 2 + D 2 , and hence
T A 2 + B 2 + D 2 = A B 0 D F .
  □
The literature [10] investigates the pseudospectra of block upper triangular matrices in finite-dimensional spaces and establishes sharp outer and inner approximation estimates in terms of the pseudospectra of the diagonal blocks. In particular, ref. [10] provides the explicit singular value formulas and monotonicity properties for 2 × 2 upper triangular matrices stated in Lemmas 2 and 3 above.
Building on Lemma 1 and on the equivalence of matrix norms, the present paper extends the outer approximation results from [10] to the setting of general upper triangular bounded operator matrices on Hilbert spaces. Instead of working solely with the pseudospectra of the diagonal entries, we derive pseudospectral enclosure results in terms of the quadratic numerical range W 2 ( T ) of the block operator matrix T , thereby linking the pseudospectrum to a finer spectral localization set.
Lemma 2.
([10]) The singular values of the matrix C = α γ 0 β M 2 ( C ) are given by
σ min ( α , β , γ ) : = σ min ( C ) = 1 2 ( | α | + | β | ) 2 + | γ | 2 ( | α | | β | ) 2 + | γ | 2 ,
σ max ( α , β , γ ) : = σ max ( C ) = 1 2 ( | α | + | β | ) 2 + | γ | 2 + ( | α | | β | ) 2 + | γ | 2 .
Moreover, σ max ( C ) = C .
Lemma 3.
([10]) Let α k , β k , γ k C for k = 1 , 2 . Then the following assertions hold:
( i ) If   | α 1 | | α 2 | ,   | β 1 | | β 2 |   and   | γ 1 | | γ 2 | ,   then   σ max ( α 1 , β 1 , γ 1 ) σ max ( α 2 , β 2 , γ 2 ) ; ( ii ) If   | α 1 | | α 2 | ,   | β 1 | | β 2 |   and   | γ 2 | | γ 1 | ,   then   σ min ( α 1 , β 1 , γ 1 ) σ min ( α 2 , β 2 , γ 2 ) .
The literature [10] investigates the pseudospectra of block upper triangular matrices in finite-dimensional spaces and establishes corresponding outer approximation estimates. Building on Lemma 1 and on the equivalence of matrix norms, the present paper extends these outer approximation results to the case of general upper triangular bounded operator matrices. To this end, we first state the following two lemmas.
Lemma 4.
For any ϵ > 0 , it then holds that
σ ϵ ( T ) σ f ( ϵ ) ϵ ( A ) σ f ( ϵ ) ϵ ( D ) ,
where f ( ϵ ) = 2 + 2 B ϵ .
Proof of Lemma 4.
If λ σ ( T ) , then it is clear that λ σ ( A ) σ ( D ) σ f ( ϵ ) ϵ ( A ) σ f ( ϵ ) ϵ ( D ) . Let
a λ = max ( λ I A ) 1 ,   ( λ I D ) 1 ,
and assume in what follows that λ σ ϵ ( T ) σ ( T ) . If λ σ ϵ ( T ) , then we have
ϵ 1 ( λ I T ) 1 = ( λ I A ) 1 ( λ I A ) 1 B ( λ I D ) 1 0 ( λ I D ) 1 ( λ I A ) 1 ( λ I A ) 1 B ( λ I D ) 1 0 ( λ I D ) 1 F ( by   Lemma   1 ) .
We now regard the operator norms of the four blocks as scalar entries, forming a 2 × 2 numerical matrix, to which we can then apply the singular value theory for matrices. By (1), for any 2 × 2 matrix M, one has M 2 M F 2 M 2 , then we have
( λ I A ) 1 ( λ I A ) 1 B ( λ I D ) 1 0 ( λ I D ) 1 F 2 ( λ I A ) 1 ( λ I A ) 1 B ( λ I D ) 1 0 ( λ I D ) 1 2 2 a λ a λ 2 B 0 a λ 2 ( by   Lemma   3 ) = 2 2 a λ ( 4 + ( a λ B ) 2 + a λ B ) ( by   Lemma   2 ) .
Rearranging the above inequality yields
2 ( a λ ϵ ) 1 a λ B 4 + ( a λ B ) 2 .
When the left-hand side of (3) is nonnegative, squaring both sides and simplifying gives a λ ( f ( ϵ ) ϵ ) 1 . Hence λ σ f ( ϵ ) ϵ ( A ) σ f ( ϵ ) ϵ ( D ) .
When the left-hand side of (3) is negative, we have
a λ 2 B ϵ .
Noting that
1 2 2 B ϵ 1 2 ϵ 2 + 2 B ϵ ,
we again obtain a λ ( f ( ϵ ) ϵ ) 1 , and consequently λ σ f ( ϵ ) ϵ ( A ) σ f ( ϵ ) ϵ ( D ) .  □
For the convenience of stating the following lemma, we first recall the definition of the separation between two operators S , T B ( X ) :
sep ( S , T ) = min ϵ 1 + ϵ 2 | ϵ 1 , ϵ 2 0 ,   σ ϵ 1 ( S ) σ ϵ 2 ( T ) .
By Definition 1, it follows that
sep ( S , T ) = min ( λ I S ) 1 1 + ( λ I T ) 1 1 λ C .
Denote s = sep ( S , T ) . If ϵ < s / 2 , then σ ϵ ( S ) and σ ϵ ( T ) are disjoint. In what follows, we take S = A , T = D , and s = sep ( A , D ) .
Lemma 5.
Assume that σ ( A ) σ ( D ) = . Then, for any ϵ > 0 ,
σ ϵ ( T ) σ 2 r ϵ ( A ) σ 2 r ϵ ( D ) ,
where
r = 1 + B s 2 + B s .
Proof of Lemma 5.
Let λ C ( σ ( A ) σ ( D ) ) . Without loss of generality, assume that
( λ I A ) 1 ( λ I D ) 1 .
Then
s ( λ I A ) 1 1 + ( λ I D ) 1 1 ,
and hence
( λ I D ) 1 1 s 2 .
If, in addition, λ σ ϵ ( T ) , then
ϵ 1 ( λ I T ) 1 = ( λ I A ) 1 ( λ I A ) 1 B ( λ I D ) 1 0 ( λ I D ) 1 ( λ I A ) 1 ( λ I A ) 1 B ( λ I D ) 1 0 ( λ I D ) 1 F ( by   Lemma   1 ) 2 ( λ I A ) 1 ( λ I A ) 1 B ( λ I D ) 1 0 ( λ I D ) 1 2 2 ( λ I A ) 1 1 2 s B 0 1 2 ( by   Lemma   3 ) = 2 ( λ I A ) 1 r ( by   Lemma   2 ) .
This implies that λ σ 2 r ϵ ( A ) .  □
We now introduce some notation that will be used to state the next two lemmas. Let T of (2). If A and D are operators such that σ ( A ) σ ( D ) = , then the equation R D A R = B has a unique solution R for every operator B. This is known as the Sylvester-Rosenblum Theorem [23]. Let V 1 = U [ I 0 ] T , V 2 = U [ R T I ] T , where V 1 , V 2 B ( X ) and U denote unitary operator. Then T V 1 = V 1 A and T V 2 = V 2 D . Let the operator matrix Q = I R 0 0 be the projection of V 2 onto V 1 along the complementary space. We put
q = 1 + R 2 , k = q + R .
Lemma 6.
Let σ ( A ) σ ( D ) = . With the notation introduced previously, we derive for all ϵ > 0 ,
σ ϵ ( T ) σ 2 k ϵ ( A ) σ 2 k ϵ ( D ) .
Proof of Lemma 6.
By R D A R = B , we have R ( D λ I ) ( A λ I ) R = B for all λ C . This directly yields
( λ I T ) 1 = ( λ I A ) 1 ( λ I A ) 1 R + R ( λ I D ) 1 0 ( λ I D ) 1 .
For λ σ ϵ ( T ) , from Lemma 1 and Lemma 2, we have
( λ I T ) 1 ( λ I A ) 1 ( ( λ I A ) 1 + ( λ I D ) 1 ) R 0 ( λ I D ) 1 F 2 ( λ I A ) 1 ( ( λ I A ) 1 + ( λ I D ) 1 ) R 0 ( λ I D ) 1 2 2 b λ 1 2 R 0 1 2 = 2 b λ k ,
where b λ = max { ( λ I A ) 1 , ( λ I D ) 1 } . Therefore, λ σ 2 k ϵ ( A ) σ 2 k ϵ ( D ) .  □
Lemma 7.
Suppose σ ( A ) σ ( D ) = and assume that s > 0 and ϵ < s 2 k . Using the notation established above, we have
σ ϵ ( T ) σ 2 f ( ϵ ) ϵ ( A ) σ 2 f ( ϵ ) ϵ ( D ) where f ( ϵ ) = q ϵ s 1 2 + 1 4 ϵ s ( q ϵ s ) .
Proof of Lemma 7.
For λ σ ϵ ( T ) σ ( T ) , we can assume that
( λ I D ) 1 ( λ I A ) 1 .
From (7) we have
( λ I T ) 1 2 ( λ I A ) 1 1 ( 1 + t ) R 0 t 2 ,
where t = ( λ I D ) 1 ( λ I A ) 1 1 .
Setting h ( t ) = 1 ( 1 + t ) R 0 t 2 , we can conclude that
( λ I T ) 1 2 ( λ I A ) 1   h ( t ) and ( λ I T ) 1 2 ( λ I D ) 1   h ( t 1 ) .
The formulae are equivalent to
2 h ( t ) ( λ I T ) 1 1 ( λ I A ) 1 1 , 2 h ( t 1 ) ( λ I T ) 1 1 ( λ I D ) 1 1 .
Combining the definition of pseudospectra, we get
2 2 h ( t ) ( λ I A ) 1 1 ( λ I T ) 1 1 ϵ .
So, λ σ 2 h ( t ) ϵ ( A ) .
Next we only need to prove h ( t ) f ( ϵ ) under the condition
( λ I T ) 1 1 ϵ < s 2 k .
Adding two inequalities of (9), we conclude
( h ( t ) + h ( t 1 ) ) ( λ I T ) 1 1 ( λ I A ) 1 1 + ( λ I D ) 1 1 s .
Due to h ( t 1 ) = t 1 h ( t ) , then it yields
( 1 + t 1 ) h ( t ) s ( λ I T ) 1 1 s ϵ .
By Lemma 2, we get h ( t ) = σ max ( 1 , t , ( t + 1 ) R ) . Then h ( t ) fulfills the quadratic equation:
0 = h ( t ) 2 ( 1 + t ) q h ( t ) + t = h ( t ) ( h ( t ) q ) t ( q h ( t ) 1 ) .
Therefore,
( 1 + t 1 ) h ( t ) = h ( t ) 2 1 h ( t ) q .
Plugging this into (10) and combining terms we deduce that
0 h ( t ) 2 1 s ϵ ( h ( t ) q ) = p ϵ ( h ( t ) ) .
For x C ,
p ϵ ( x ) = x 2 1 s ϵ ( x q ) .
By (6) we have k 2 2 q k = 1 , inserting this in above equation
p ϵ ( x ) = x 2 + k 2 2 q k s ϵ ( x q ) = ( x k ) 2 + ( 2 k s ϵ ) ( x q ) .
Notably,
p ϵ ( q ) = ( k q ) 2 > 0 , p ϵ ( k ) = ( 2 k s ϵ ) ( k q ) = s ϵ 1 2 k s ϵ ( k q ) < 0 .
Clearly the quadratic polynomial p ϵ has two real zeros, f ( ϵ ) and g ( ϵ ) , which satisfy q < f ( ϵ ) < k < g ( ϵ ) . Moreover,
f ( ϵ ) = 1 2 s ϵ s ϵ 2 4 s q ϵ 1 = q ϵ s 1 2 + 1 4 ϵ s q ϵ s .
By (11), h ( t ) f ( ϵ ) or f ( ϵ ) h ( t ) . From Lemma 3, h ( t ) h ( 1 ) = k < f ( ϵ ) . Accordingly, h ( t ) f ( ϵ ) .  □
Remark 1.
Suppose that f ( · ) is defined as in Lemma 7. Let 0 < ϵ < ϵ s 2 k and f ( ϵ ) be the smaller zero of quadratic polynomial p ϵ ( x ) = x 2 1 s ϵ ( x q ) , for f ( 0 ) = q x < f ( ϵ ) we have p ϵ ( q ) = ( k q ) 2 > 0 . Since p ϵ ( x ) is an increasing function with respect to ϵ, then 0 < p ϵ ( x ) < p ϵ ( x ) . By p ϵ ( f ( ϵ ) ) = 0 , then p ϵ ( f ( ϵ ) ) > 0 and as p ϵ ( f ( ϵ ) ) = 0 . Hence, f ( ϵ ) < f ( ϵ ) . This shows f ( ϵ ) is an increasing function of ϵ with f ( 0 ) = q and f ( s 2 k ) = k .
The following theorem is the main result of this paper. It describes an inclusion relationship between the pseudospectrum and the quadratic numerical range of upper triangular operator matrices.
Theorem 1.
For any ϵ > 0 , the following statements hold:
(i) 
σ ϵ ( T ) W 2 ( T ) ¯ + Δ f ( ϵ ) ϵ , where f ( ϵ ) = 2 + 2 B ϵ ;
(ii) 
if σ ( A ) σ ( D ) = , then σ ϵ ( T ) W 2 ( T ) ¯ + Δ 2 r ϵ , where r = 1 + B s 2 + B s and s = sep ( A , D ) ;
(iii) 
σ ϵ ( T ) W 2 ( T ) ¯ + Δ 2 k ϵ under the condition σ ( A ) σ ( D ) = , where k is defined in (6);
(iv) 
σ ϵ ( T ) W 2 ( T ) ¯ + Δ 2 f ( ϵ ) ϵ under the condition σ ( A ) σ ( D ) = , s 0 and ϵ < s 2 k , where 2 f ( ϵ ) is defined in Lemma 7.
Proof of Theorem 1.
(i)
By Lemma 4, we have
σ ϵ ( T ) σ f ( ϵ ) ϵ ( A ) σ f ( ϵ ) ϵ ( D ) .
Noting that
σ f ( ϵ ) ϵ ( A ) W ( A ) ¯ + Δ f ( ϵ ) ϵ , σ f ( ϵ ) ϵ ( D ) W ( D ) ¯ + Δ f ( ϵ ) ϵ
and that W 2 ( T ) = W ( A ) W ( D ) , we obtain
σ ϵ ( T ) W 2 ( T ) ¯ + Δ f ( ϵ ) ϵ .
(ii)
By Lemma 5, we have
σ ϵ ( T ) σ 2 r ϵ ( A ) σ 2 r ϵ ( D ) .
Since W 2 ( T ) = W ( A ) W ( D ) , together with
σ 2 r ϵ ( A ) W ( A ) ¯ + Δ 2 r ϵ and σ 2 r ϵ ( D ) W ( D ) ¯ + Δ 2 r ϵ ,
it follows that
σ ϵ ( T ) W 2 ( T ) ¯ + Δ 2 r ϵ .
(iii)
By Lemma 6, we have
σ ϵ ( T ) σ 2 k ϵ ( A ) σ 2 k ϵ ( D ) .
Using the identity W 2 ( T ) = W ( A ) W ( D ) and the inclusions
σ 2 k ϵ ( A ) W ( A ) ¯ + Δ 2 k ϵ and σ 2 k ϵ ( D ) W ( D ) ¯ + Δ 2 k ϵ ,
we conclude that
σ ϵ ( T ) W 2 ( T ) ¯ + Δ 2 k ϵ .
(iv)
By Lemma 7, we have
σ ϵ ( T ) σ 2 f ( ϵ ) ϵ ( A ) σ 2 f ( ϵ ) ϵ ( D ) .
Putting together W 2 ( T ) = W ( A ) W ( D ) with
σ 2 f ( ϵ ) ϵ ( A ) W ( A ) ¯ + Δ 2 f ( ϵ ) ϵ , σ 2 f ( ϵ ) ϵ ( D ) W ( D ) ¯ + Δ 2 f ( ϵ ) ϵ ,
yields
σ ϵ ( T ) W 2 ( T ) ¯ + Δ 2 f ( ϵ ) ϵ .
  □
Next, we present two examples to verify the effectiveness of Theorem 1.
Example 1.
Let
T = A B 0 D = 2 0 i 1 0 1 + i 0 0 0 0 2 0 0 0 0 1 M 2 ( M 2 ( C ) ) .
It is easy to see that B = 2 and
σ ( A ) = { 2 , 1 + i } , σ ( D ) = { 2 , 1 } ,
so that
σ ( A ) σ ( D ) = { 2 } .
Consider ϵ = 1 . Then f ( ϵ ) ϵ = 2 . We now verify that
σ 1 ( T ) W 2 ( T ) + Δ 2 ,
which demonstrates the validity of Theorem 1. In fact, by the definition of the pseudospectrum, it suffices to show that, for any λ W 2 ( T ) + Δ 2 , we have ( T λ I ) 1 1 .
First, λ W 2 ( T ) + Δ 2 is equivalent to dist ( λ , W 2 ( T ) ) > 2 . Hence,
dist ( λ , W ( A ) ) > 2 , dist ( λ , W ( D ) ) > 2 .
We then obtain
( A λ I ) 1 = 1 dist ( λ , σ ( A ) ) 1 dist ( λ , W ( A ) ) < 1 2 ,
and similarly,
( D λ I ) 1 1 dist ( λ , W ( D ) ) < 1 2 .
( T λ I ) 1 = ( A λ I ) 1 ( A λ I ) 1 B ( D λ I ) 1 0 ( D λ I ) 1 .
Combining (1), (12), (13) and the properties of the Frobenius norm for block matrices, we obtain
( T λ I ) 1 ( T λ I ) 1 F ( A λ I ) 1 2 + ( A λ I ) 1 B ( D λ I ) 1 2 + ( D λ I ) 1 2 1 2 2 + 2 4 2 + 1 2 2 = 5 8 < 1 .
Thus, for any λ satisfying λ W 2 ( T ) + Δ 2 , we have
( T λ I ) 1 < 1 ,
that is, λ σ 1 ( T ) . This shows that, for ϵ = 1 ,
σ ϵ ( T ) W 2 ( T ) ¯ + Δ f ( ϵ ) ϵ .
The case ϵ > 0 with ϵ 1 can be treated in the same way as the case ϵ = 1 .
Example 2.
Consider the non-normal block matrix
T = 2 0 i 1 0 1 + i 0 0 0 0 i 0 0 0 0 i = A B 0 D M 2 ( M 2 ( C ) ) .
It is easy to see that B = 2 and
σ ( A ) = { 2 , 1 + i } , σ ( D ) = { i , i } ,
so that
σ ( A ) σ ( D ) = .
In the numerical experiments, we discretize the complex plane on a uniform grid and evaluate σ min ( λ I T ) at each grid point λ. We approximate the ϵ-pseudospectrum σ 1 ( T ) by computing the contour σ min ( λ I T ) = ϵ . Moreover, for the matrix case, the computation of s = sep ( A , D ) is given by s = σ min ( I A D T I ) [24]. Define L = I A D T I . A direct calculation yields
L = diag ( 2 i , 1 + 2 i , 2 i , 1 + 2 i ) ,
and consequently s = σ min ( L ) = 5 . In the case (ii) of Theorem 1, 2 r ϵ can be computed as:
2 r ϵ = 2 + 3 6 5 .
The numerical range W ( T ) is approximated via Monte Carlo sampling: we generate random unit vectors x C 4 , compute the Rayleigh quotients x * T x and plot the resulting points in the complex plane where x * stands for the conjugate of x. To approximate the quadratic numerical range W 2 ( T ) , we exploit the block structure of T . Specifically, we draw random unit-vector pairs ( f , g ) to form the corresponding 2 × 2 compression matrices T f , g , and plot their eigenvalues. Finally, with 2 r ϵ = 2 + 3 6 5 , we depict the Minkowski sums W ( T ) + Δ 2 + 3 6 5 and W 2 ( T ) + Δ 2 + 3 6 5 .
Figure 1 displays the numerical range W ( T ) and the quadratic numerical range W 2 ( T ) , together with their Δ 2 + 3 6 5 -neighbourhoods, and the ϵ-pseudospectrum σ ϵ ( T ) for ϵ = 1 . The curves are coded as follows: green corresponds to W ( T ) + Δ 2 + 3 6 5 (classical enclosure), blue to W 2 ( T ) + Δ 2 + 3 6 5 (quadratic enclosure), and black to σ 1 ( T ) . This visualization enables a direct assessment of the tightness of the two enclosures relative to the pseudospectrum.
As can be seen from Figure 1, the enclosure derived from the quadratic numerical range (blue) is markedly tighter than the classical numerical-range enclosure (green), and it tracks the pseudospectral boundary σ 1 ( T ) (black) more closely.
This example corroborates the case (ii) of Theorem 1 and shows that W 2 ( T ) + Δ 2 + 3 6 5 delivers computable stability bounds and a markedly tighter pseudospectral enclosure than W ( T ) + Δ 2 + 3 6 5 . For non-normal T , this is advantageous because it replaces the costly computation of σ ϵ ( T ) by the more tractable computation of W 2 ( T ) .

4. Conclusions

In this paper, we investigated the pseudospectral inclusion properties of 2 × 2 upper triangular bounded operator matrices on Hilbert spaces by means of the quadratic numerical range. Starting from a refined norm estimate for such block operator matrices, we derived explicit bounds for their largest and smallest singular values, which in turn yielded several external approximations of the pseudospectrum in terms of equivalent matrix norms.
On this basis, we established a family of pseudospectral enclosures for upper triangular operator matrices, showing that their ε -pseudospectrum are contained in suitable enlargements of the quadratic numerical range. More precisely, we obtained a series of inclusion results under increasingly restrictive spectral separation assumptions on the diagonal blocks, where the enclosure radii are explicitly described via separation quantities and solutions of a Sylvester–Rosenblum type equation. These results extend classical spectral inclusion theorems from the spectrum to the pseudospectrum and clarify the intrinsic role of the quadratic numerical range in capturing pseudospectral behavior of non-selfadjoint block operator matrices. In this sense, our results complement and extend the pseudospectral enclosure bounds for block triangular matrices obtained in [10] by moving from a purely finite-dimensional matrix framework to bounded operator matrices and by replacing the diagonal-block-based descriptions by enclosures in terms of the quadratic numerical range.
Finally, a detailed 2 × 2 block matrix example and a numerical example involving a non-normal block matrix were provided to verify the sharpness and applicability of the derived enclosures. The analysis highlights the effectiveness of the quadratic numerical range as a tool for locating pseudospectrum of upper triangular operator matrices and suggests further applications to stability analysis, perturbation theory, and numerical methods for non-normal operators. In particular, a numerical example of a finite-dimensional non-normal block matrix demonstrates that the quadratic numerical range–based enclosure can be significantly tighter than the classical numerical range–based one. In future work, it would be of particular interest to extend these techniques to more general block structures and to investigate their implications for concrete classes of differential and integral operators.

Author Contributions

Conceptualization, Y.Y. and G.H.; Methodology, Y.Y. and G.H.; Writing—original draft, Y.Y.; Writing—review & editing, Y.Y. and G.H.; Funding acquisition, Y.Y. and G.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (Grant No. 12261064) and the Natural Science Foundation of the Inner Mongolia Autonomous Region (Grant No. 2025MS01026).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zhong, W.X. A New Solution Framework for Elasticity; Dalian University of Technology Press: Dalian, China, 1995. [Google Scholar]
  2. Thaller, B. The Dirac Equation, Texts and Monographs in Physics; Springer: Berlin/Heidelberg, Germany, 1992. [Google Scholar]
  3. Tretter, C. Spectral Theory of Block Operator Matrices and Applications; Imperial College Press: London, UK, 2008. [Google Scholar]
  4. Langer, H.; Tretter, C. Spectral decomposition of some nonselfadjoint block operator matrices. J. Oper. Theory 1998, 39, 339–359. [Google Scholar]
  5. Davies, E.B. Linear Operators and Their Spectra; Cambridge University Press: Cambridge, UK, 2007. [Google Scholar]
  6. Trefethen, L.N.; Embree, M. Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators; Princeton University Press: Princeton, NJ, USA, 2005. [Google Scholar]
  7. Lancaster, P.; Psarrakos, P. On the pseudospectra of matrix polynomials. SIAM J. Matrix Anal. Appl. 2005, 27, 115–129. [Google Scholar] [CrossRef]
  8. Yu, Y.; Hou, G.L. Equivalence of structured and unstructured pseudospectra for some doubly-structured matrices. J. Comput. Appl. Math. 2026, 474, 116961. [Google Scholar] [CrossRef]
  9. Lindner, M.; Lindner, D. Finite sections: Stability, spectral pollution and asymptotics of condition numbers and pseudospectra. Linear Algebra Its Appl. 2024, 697, 583–614. [Google Scholar] [CrossRef]
  10. Roy, N.; Karow, M.; Bora, S.; Armentia, G. Approximation of pseudospectra of block triangular matrices. Linear Algebra Its Appl. 2021, 623, 398–419. [Google Scholar] [CrossRef]
  11. Langer, H.; Markus, A.; Matsaev, V.; Tretter, C. A new concept for block operator matrices: The quadratic numerical range. Linear Algebra Its Appl. 2001, 330, 89–112. [Google Scholar] [CrossRef]
  12. Muhammad, A.; Marletta, M. A numerical investigation of the quadratic numerical range of Hain-Lüst operators. Int. J. Comput. Math. 2013, 90, 2431–2451. [Google Scholar] [CrossRef]
  13. Linden, H. The Quadratic numerical range and the location of zeros of polynomials. SIAM J. Matrix Anal. Appl. 2003, 25, 266–284. [Google Scholar] [CrossRef]
  14. Jacob, B.; Vorberg, L.; Wyss, C. Computing the quadratic numerical range. J. Comput. Appl. Math. 2025, 453, 1–17. [Google Scholar] [CrossRef]
  15. Reddy, S.C.; Schmid, P.J.; Henningson, D.S. Pseudospectra of the Orr–Sommerfeld operator. SIAM J. Appl. Math. 1993, 53, 15–47. [Google Scholar] [CrossRef]
  16. Qi, Y.R.; Qiu, W.W.; Trunk, C.; Wilson, M. Spectral Inclusion Property for a class of block operator matrices. Oper. Matrices 2023, 17, 953–966. [Google Scholar]
  17. Lui, S.H. Computation of pseudospectra with continuation. SIAM J. Sci. Comput. 1997, 18, 565–573. [Google Scholar] [CrossRef]
  18. Sun, J.G. A note on simple non-zero singular values. J. Comput. Math. 1988, 6, 258–266. [Google Scholar]
  19. Janovská, D.; Janovsk, V.; Tanabe, K. A note on computation of pseudospectra. Math. Comput. Simul. 2012, 82, 1732–1743. [Google Scholar] [CrossRef]
  20. Respondek, J. Matrix black box algorithms—A survey. Bull. Pol. Acad. Sci. 2022, 70, e140535. [Google Scholar] [CrossRef]
  21. Toeplitz, O. Das algebraische Analogon zu einem Satze von Fejér. Math. Z. 1918, 2, 187–197. [Google Scholar] [CrossRef]
  22. Horn, R.A.; Johnson, C.R. Matrix Analysis, 2nd ed.; Cambridge University Press: Cambridge, UK, 2013. [Google Scholar]
  23. Rosenblum, M. On the operator equation BX-XA=Q. Duke Math. J. 1956, 23, 263–270. [Google Scholar] [CrossRef]
  24. Varah, J.M. On the separation of two matrices. SIAM J. Numer. Anal. 1979, 16, 216–222. [Google Scholar] [CrossRef]
Figure 1. Position relation between σ ϵ ( T ) , W ( T ) and W 2 ( T ) for ϵ = 1 .
Figure 1. Position relation between σ ϵ ( T ) , W ( T ) and W 2 ( T ) for ϵ = 1 .
Axioms 15 00208 g001
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yu, Y.; Hou, G. On the Relationship Between the Pseudospectrum and the Quadratic Numerical Range for Upper Triangular Bounded Operator Matrices. Axioms 2026, 15, 208. https://doi.org/10.3390/axioms15030208

AMA Style

Yu Y, Hou G. On the Relationship Between the Pseudospectrum and the Quadratic Numerical Range for Upper Triangular Bounded Operator Matrices. Axioms. 2026; 15(3):208. https://doi.org/10.3390/axioms15030208

Chicago/Turabian Style

Yu, Yang, and Guolin Hou. 2026. "On the Relationship Between the Pseudospectrum and the Quadratic Numerical Range for Upper Triangular Bounded Operator Matrices" Axioms 15, no. 3: 208. https://doi.org/10.3390/axioms15030208

APA Style

Yu, Y., & Hou, G. (2026). On the Relationship Between the Pseudospectrum and the Quadratic Numerical Range for Upper Triangular Bounded Operator Matrices. Axioms, 15(3), 208. https://doi.org/10.3390/axioms15030208

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop