Next Article in Journal
Mathematical Modeling, Bifurcation Theory, and Chaos in a Dusty Plasma System with Generalized (r, q) Distributions
Previous Article in Journal
New Class of Specific Functions with Fractional Derivatives
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Structured Distance to Normality of Dirichlet–Neumann Tridiagonal Toeplitz Matrices

1
School of Intelligent Science and Control Engineering, Shandong Vocational and Technical University of International Studies, Rizhao 276800, China
2
School of Mathematics and Statistics, Linyi University, Linyi 276000, China
3
School of Mathematics and Statistics, Qingdao University, Qingdao 266071, China
4
School of Information Science and Engineering, Linyi University, Linyi 276000, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(8), 609; https://doi.org/10.3390/axioms14080609
Submission received: 8 July 2025 / Revised: 31 July 2025 / Accepted: 1 August 2025 / Published: 5 August 2025

Abstract

This paper conducts a rigorous study on the spectral properties and operator-space distances of perturbed Dirichlet–Neumann tridiagonal (PDNT) Toeplitz matrices, with emphasis on their asymptotic behaviors. We establish explicit closed-form solutions for the eigenvalues and associated eigenvectors, highlighting their fundamental importance for characterizing matrix stability in the presence of perturbations. By exploiting the structural characteristics of PDNT Toeplitz matrices, we obtain closed-form expressions quantifying the distance to normality, the deviation from normality.

1. Introduction

When solving the wave equations using the method of separation of variables in Cartesian coordinates, one often encounters eigenvalue problems of the following form. It is necessary to find μ and N ( x ) that satisfy [1]
d 2 N d x 2 + μ N = 0 ,
and the function must satisfy the homogeneous Dirichlet and Neumann boundary conditions (BCs) at m and n, i.e.,
N ( m ) = 0 , N ( n ) = 0 , x [ m , n ] .
Discretize Equation (1) by letting x = m + h l and N h = N ( m + h l ) , where l is the step size and h is an integer index ( h = 1 , , z ) . We then carry out second-order finite difference discretization incorporating operator symmetry. BCs are fulfilled through odd-even extensions, and the scheme is formulated in matrix form. Substituting symmetric constraints remove boundary variables to reduce the number of problem variables. Hence, the matrix eigenvalue problem
1 1     0 1 0 1             1 0 1 0     2 0 z × z N 1 N 2 N z 1 N z = λ N 1 N 2 N z 1 N z
is obtained.
The structure of (3) shows the following: matching left–right vectors and a corresponding square matrix. It is evident that the aforementioned coefficient matrix can be diagonalized via the discrete sine transform of type VIII (DST8). The core of this research lies in exploring a broader family of matrices diagonalizable by DST8.
In domains like resistance network modeling [2,3], quantum anomalous Hall effect analysis [4], and molecular orbital theory [5]. Fields such as partial differential equations [6,7,8,9], time series decomposition [10], and regularization of discrete ill-posed problems via Tikhonov methods [11,12] also rely on the application of these matrices. It is essential to study the fundamental computational characteristics of tridiagonal Toeplitz matrices.
Numerous studies [13,14,15,16,17] have rigorously analyzed the determinant properties and eigenvalue systems of bordered periodic tridiagonal matrices. Comprehensive discussions on determinants, inverses, and norm equalities/inequalities for perturbed tridiagonal Toeplitz matrices are available in references [18,19,20,21,22]. Systematic analysis approaches for two regular matrix pairs are available in [23,24,25]. Matrix nearness problems have drawn considerable research attention, with significant contributions found in [26,27,28,29,30,31,32] and subsequent studies. Works [33,34,35] investigate ε -pseudospectral separations in banded Toeplitz matrices, revealing characteristic spectral behaviors. The study of tridiagonal Toeplitz matrix operators is motivated by their dual strengths: efficient computation of key metrics and multidisciplinary applicability. Biswa Datta pioneered the investigation of multiple themes, including the inverse eigenvalue problems examined here, in foundational works [36,37,38,39].
This paper is organized as follows: We begin by clarifying the symbolic representations and associated definitions utilized in this research. Section 2 provides explicit analytic representations for eigenvalues and eigenvectors of PDNT Toeplitz matrices. Section 4 examines spectral distance and matrix normalization. Section 3 and Section 5 explore the structured distances between PDNT Toeplitz matrices and two algebraic varieties. Section 6 presents numerical examples.

Concept and Symbol

This work employs the Euclidean vector norm · 2 and its induced matrix counterpart. Additionally, the Frobenius norm · F , with its distinct applications, is employed to quantify matrices and vectors. The following provides explanations of the symbols used in this paper:
(1)
Q ˜ : The subspace of C z × z formed by PDNT Toeplitz matrices.
(2)
U : The algebraic variety formed by normal matrices within C z × z .
(3)
U Q ˜ : U Q ˜
(4)
V : The collection of matrices with multiple eigenvalues constitutes an algebraic set in C z × z .
(5)
V Q ˜ : V Q ˜
(6)
( · ) T : This symbol represents the transpose operation.
(7)
( · ) H : This symbol signifies Hermitian adjoint.
Definition 1.
E = γ 0 γ 1 γ 2 γ 1         0 γ 2 γ 0 γ 1                               γ 1           γ 2 γ 0 2 γ 1 0         2 γ 2 γ 0 C z × z .
Standardized as PDNT Toeplitz matrix E = (z ; γ 1 γ 2 , γ 2 , γ 0 , γ 1 , 2 γ 2 , 2 γ 1 ), a z-order square matrix conforming to Equation (4). Phase parameters are further defined as follows:
ϖ 1 = arg γ 2 , ϖ 2 = arg γ 1 , ϖ 3 = arg γ 0 .
When γ 0 = 0 , the matrix is given by E 0 = ( z ; γ 1 γ 2 , γ 2 , 0 , γ 1 , 2 γ 2 , 2 γ 1 ) .
Definition 2.
For a matrix E C z × z , the Frobenius norm distance to the set of normal matrices is defined as the minimal norm of the difference between E and E U U , expressed as follows:
d F ( E , U ) = min E U U E E U F .
See [26,28,40,41,42,43] for detailed discussions.
Definition 3.
The Frobenius norm measures the distance between PDNT Toeplitz matrix E and the set U Q ˜ , formally defined as follows:
d F ( E , U Q ˜ ) = min E U U Q ˜ E E U F .
Definition 4.
The Frobenius distance between PDNT Toeplitz matrix E and the family V Q ˜ can be expressed as follows:
d F ( E , V Q ˜ ) = min E V V Q ˜ E E V F .

2. Eigenvalues and Associated Eigenvectors

This section utilizes similarity transformations to construct explicit representations of eigenvalues and eigenvectors for the PDNT Toeplitz matrix E defined in (4). Let
Λ z = diag ( 1 , γ 1 γ 2 , , ( γ 1 γ 2 ) z 2 , ( γ 1 γ 2 ) z 1 ) .
From | γ 1 | = | γ 2 | it follows that Λ z is unitary. This property implies Λ z Λ z H = I z , equivalently Λ z 1 = Λ z H . Here, I z is the z-dimensional identity matrix, Λ z 1 denotes the inverse of the matrix Λ z and Λ z H represents the Hermitian adjoint of Λ z .
Define the matrix
S z V I I I = 2 2 z 1 d k d j sin ( 2 k 1 ) ( 2 j 1 ) π 2 ( 2 z 1 ) k , j = 1 z ,
where d q = 1 q z , 2 2 q = z .
The eighth discrete sine transform matrix S z V I I I , defined by its orthogonality property [44], automatically obeys the relation
( S z V I I I ) 1 = ( S z V I I I ) T = S z V I I I .
The following equation is derived by diagonalizing E and performing a series of matrix multiplications with sophisticated algebraic manipulations:
( S z V I I I ) 1 Λ z E Λ z 1 ( S z V I I I ) = diag ( λ 1 , λ 2 , , λ z ) .
Equation (9) enables the expression of E as
E = Λ z 1 ( S z V I I I ) diag ( λ 1 , λ 2 , , λ z ) ( S z V I I I ) 1 Λ z ,
where λ j is defined by
λ j = γ 0 + 2 γ 1 γ 2 cos ( 2 j 1 ) π 2 z 1 , j = 1 , , z .
Equation (9) explicitly presents the diagonalization diag ( λ 1 , , λ z ) of PDNT Toeplitz matrix E , with λ j as its eigenvalues.
Left-multiplication of Equation (9) by Λ z 1 S z V I I I constructs the eigensystem:
E Λ z 1 S z V I I I = Λ z 1 S z V I I I diag ( λ 1 , λ 2 , , λ z ) ,
rewritten as
E ( v ( 1 ) , v ( 2 ) , , v ( z ) ) = ( v ( 1 ) , v ( 2 ) , , v ( z ) ) diag ( λ 1 , λ 2 , , λ z ) ,
where the vectors v ( j ) = ( v 1 ( j ) , , v z ( j ) ) T satisfy
v k ( j ) = 2 2 z 1 d k d j ( γ 2 γ 1 ) k 1 sin 2 k 1 ( 2 j 1 ) π 2 ( 2 z 1 ) , k = 1 , , z , j = 1 , , z ,
where d q = 1 q z , 2 2 q = z .
Equation (11) is equivalent to
E v ( j ) = λ j v ( j ) , j = 1 , 2 , , z .
The right eigenvector v ( j ) = ( v 1 ( j ) , , v z ( j ) ) T is derived directly from Equation (12). The eigenvalues of E derived from Equations (5) and (10) is
λ j ( E ) = γ 0 + 2 | γ 1 γ 2 | e ϖ 1 + ϖ 2 i 2 cos ( 2 j 1 ) π 2 z 1 , j = 1 , , z .
If γ 1 γ 2 0 , E possesses z distinct eigenvalues. The eigenvalues lie on a closed segment in the complex plane
S λ ( E ) = γ 0 + b e ϖ 1 + ϖ 2 i 2 : b R , | b | 2 | γ 1 γ 2 | cos π 2 z 1 C .
For matrix E , its spectral radius admits the following expression
ρ ( E ) = max | γ 0 + 2 | γ 1 γ 2 | e ϖ 1 + ϖ 2 i 2 cos π 2 z 1 | , | γ 0 2 | γ 1 γ 2 | e ϖ 1 + ϖ 2 i 2 | .
Under the nonsingularity of E , the spectral radius of E 1 can be computable by Equation (13)
ρ ( E 1 ) = max j = 1 , , z | γ 0 + 2 | γ 1 γ 2 | e ϖ 1 + ϖ 2 i 2 cos ( 2 j 1 ) π 2 z 1 | 1 .
For γ 1 γ 2 0 , the elements of the right eigenvector v ( j ) = [ v 1 ( j ) , , v z ( j ) ] T belonging to λ j ( E ) are determined by
v k ( j ) = 2 2 z 1 d k d j ( γ 2 γ 1 ) k 1 s i n ( 2 k 1 ) ( 2 j 1 ) π 2 ( 2 z 1 ) , k = 1 , , z , j = 1 , , z ,
Correspondingly, the left eigenvector u ( j ) = [ u 1 ( j ) , , u z ( j ) ] T is expressed as follows:
u k ( j ) = 2 2 z 1 d k d j ( γ ¯ 1 γ ¯ 2 ) k 1 s i n ( 2 k 1 ) ( 2 j 1 ) π 2 ( 2 z 1 ) , k = 1 , , z , j = 1 , , z ,
where d q = 1 q z , 2 2 q = z . The overline represents complex conjugation.
As shown, specifying the dimension and γ 2 γ 1 ratio of the PDNT Toeplitz matrix E uniquely determines its left and right eigenvectors.

3. The Structured Distance Between PDNT Toeplitz and the Family of Normal Matrices

This section focuses on a PDNT Toeplitz matrix, examining both its distance from and deviation to the family of normal matrices.
Theorem 1.
The matrix E defined by (4) is normal if and only if the equality
| γ 1 | = | γ 2 |
holds.
Proof. 
E H E = E E H can be proved, an equality equivalent to (17). □
The above theorem indicates that a normal PDNT Toeplitz matrix admits the following representation.
E = γ 0 Ψ e ϖ 1 + ϖ 2 i 2 Ψ e i ϖ 2 O Ψ e i ϖ 1 γ 0 Ψ e i ϖ 2 Ψ e i ϖ 1 · · · · · · · · · · 2 Ψ e i ϖ 2 O 2 Ψ e i ϖ 1 γ 0 ,
where E = ( z ; Ψ e ϖ 1 + ϖ 2 i 2 , Ψ e i ϖ 1 , γ 0 , Ψ e i ϖ 2 , 2 Ψ e i ϖ 1 , 2 Ψ e i ϖ 1 ) , with parameters satisfying γ 0 C , Ψ 0 , and ϖ 1 , ϖ 2 R .
Based on Equation (13), we obtain explicit solutions for the eigenvalues of matrix E .
λ j ( E ) = γ 0 + 2 Ψ e ϖ 1 + ϖ 2 i 2 cos ( 2 j 1 ) π 2 z 1 , j = 1 , , z .
In the complex plane, the eigenvalues of E are distributed on a closed line segment that can be parameterized as follows:
S λ ( E ) = γ 0 + b e ϖ 1 + ϖ 2 i 2 : b R , | b | 2 Ψ cos π 2 z 1 C .
Theorem 2.
For the PDNT Toeplitz matrix E , the Frobenius norm minimization problem min E E U F has a unique optimal solution E * = ( z ; γ 1 * γ 2 * , γ 2 * , γ 0 * , γ 1 * , 2 γ 2 * , 2 γ 1 * ) U Q ˜ , with parameters γ 0 * = γ 0 , γ 1 * = Ψ * e i ϖ 2 , γ 2 * = Ψ * e i ϖ 1 , where ϖ 1 and ϖ 2 are given by (5) and Ψ * is computed as γ 1 γ 2 + z ( γ 1 + γ 2 ) 2 z + 1 .
Proof. 
According to Theorem 1, the Frobenius norm minimum min E E U F is attained by the matrix E * U Q ˜ , with the condition | γ 1 * | = | γ 2 * | . The parameter assignments are necessarily chosen as follows:
γ 0 * = γ 0 , γ 1 * = Ψ * e i ϖ 2 , γ 2 * = Ψ * e i ϖ 1 .
To achieve the global minimum of the objective function g ( Ψ ) = ( Ψ | γ 1 γ 2 | ) 2 + z ( ( Ψ γ 1 ) 2 + ( Ψ γ 2 ) 2 ) , the parameter Ψ must be determined. The unique global minimizer is given by Ψ * = γ 1 γ 2 + z ( γ 1 + γ 2 ) 2 z + 1 , thereby completing the proof of the theorem. □
Corollary 1.
Let E * = ( z ; γ 1 * γ 2 * , γ 2 * , γ 0 * , γ 1 * , 2 γ 2 * , 2 γ 1 * ) U Q ˜ be the optimal normal approximation to E , with eigenvalues
λ j ( E * ) = γ 0 + 2 Ψ * e ϖ 1 + ϖ 2 i 2 cos ( 2 j 1 ) π 2 z 1 , j = 1 , , z ,
where ϖ 1 and ϖ 2 are given by Equation (5).
All eigenvalues lie within the closed line segment in the complex plane
S λ ( E * ) = { γ 0 + b e ϖ 1 + ϖ 2 i 2 : b R , | b | 2 Ψ * cos π 2 z 1 } .
E U Q ˜ holds if and only if the line segment defined in Equation (14) is contained within this segment. The spectral radius of E * admits the following characterization.
ρ ( E * ) = max | γ 0 + 2 Ψ * e ϖ 1 + ϖ 2 i 2 cos π 2 z 1 | , | γ 0 2 Ψ * e ϖ 1 + ϖ 2 i 2 | ,
where Ψ * = γ 1 γ 2 + z ( γ 1 + γ 2 ) 2 z + 1 .
Regarding the distance to normality of the PDNT Toeplitz matrix, the following result presents a succinct representation.
Theorem 3.
Consider the PDNT Toeplitz matrix E = ( z ; γ 1 γ 2 , γ 2 , γ 0 , γ 1 , 2 γ 2 , 2 γ 1 ) . The Frobenius distance between E and the normal matrix variety U Q ˜ is
d F ( E , U Q ˜ ) = z 2 2 z + 1 ( γ 1 γ 2 ) 2 + z γ 1 + γ 2 2 z + 1 ( γ 1 γ 2 ) 2 ,
with U Q ˜ representing the algebraic variety of normal PDNT Toeplitz matrices.
Proof. 
The proof is established by substituting Theorem 2 into Equation (7), with the following derivation
E E * F 2 = z ( | γ 1 γ 1 * | 2 + | γ 2 γ 2 * | 2 ) + | γ 1 γ 2 γ 1 * γ 2 * | 2 = 2 z + 1 2 Ψ * 2 Ψ * z γ 1 + γ 2 + γ 1 γ 2 + z γ 1 2 + γ 2 2 + γ 1 γ 2 = ( 2 z + 1 ) Ψ * 2 + z ( γ 1 2 + γ 2 2 ) + γ 1 γ 2 = z 2 2 z + 1 ( γ 1 γ 2 ) 2 + z γ 1 + γ 2 2 z + 1 ( γ 1 γ 2 ) 2 .
This establishes the desired result. □
Example 1.
For a PDNT Toeplitz matrix
A = 1 i 0 0 0 4 i 1 i 0 0 0 4 i 1 i 0 0 0 4 i 1 2 i 0 0 0 4 2 i 1 .
By virtue of Equation (20), we can show that
d F ( A , U Q ˜ ) = 5 110 11 ,
meanwhile, direct computation shows that the unstructured F-distance
d F u = 3 10 .
These two results compute the distance from structured and unstructured perspectives, respectively.
Remark 1.
Theorem 3 establishes that the Frobenius distance d F ( E , U Q ˜ ) from PDNT Toeplitz matrix E to U Q ˜ shows no dependence on γ 0 . However, the normal PDNT Toeplitz matrix E * nearest to E varies with changes in γ 0 . Briefly put, while variations in γ 0 leave the distance to U Q ˜ invariant, they alter the optimal approximating matrices within this algebraic variety. In particular, the matrix pair E 1 = ( z ; γ 1 γ 2 , γ 2 , γ 0 1 , γ 1 , 2 γ 2 , 2 γ 1 ) and E 2 = ( z ; γ 1 γ 2 , γ 2 , γ 0 2 , γ 1 , 2 γ 2 , 2 γ 1 ) satisfies the following equality:
| | E 1 * E 2 * | | F = | | E 1 E 2 | | F = z | γ 0 1 γ 0 2 | .

The Distance from Matrix E 0 to Matrix Family U Q ˜

The deviation of matrix E from normality is measured by the Frobenius norm, with the specific expression
Δ F ( E ) = ( | | E | | F 2 j = 1 z | λ j | 2 ) 1 2 , E C z × z ,
as defined in [41].
In order to present the above formulas, we first give the following expression.
j = 1 z cos 2 ( 2 j 1 ) π 2 z 1 = 1 , z = 1 , 2 z + 1 4 , z > 1 .
Proof. 
To derive the formula, we first transform the original expression using the double–angle formula, obtaining
j = 1 z cos 2 ( 2 j 1 ) π 2 z 1 = 1 2 j = 1 z ( 1 + cos 2 ( 2 j 1 ) π 2 z 1 ) .
With t = 2 π 2 z 1 , when z > 1 , by applying the product–to–sum formula, we simplify
2 sin t j = 1 z cos ( 2 j 1 ) t = 2 sin t ( cos t + cos 3 t + + cos ( 2 z 3 ) t + cos ( 2 z 1 ) t ) = sin 2 t + sin 4 t sin 2 t + + sin ( 2 z 2 ) t sin ( 2 z 4 ) t + sin 2 z t sin ( 2 z 2 ) t = sin 2 z t ,
from which we can deduce that
j = 1 z cos ( 2 j 1 ) t = sin 2 z t 2 sin t = 1 2 .
Consequently,
j = 1 z cos 2 ( 2 j 1 ) π 2 z 1 = z 2 + 1 2 j = 1 z cos 4 j π 2 v + 1 = z 2 + 1 4 = 2 z + 1 4 .
When z = 1 ,
cos 2 ( 2 j 1 ) π 2 z 1 = 1 .
Thus, the proof is completed. □
Theorem 4.
Given z > 1 and the family U Q ˜ consisting of all normal PDNT Toeplitz matrices, the deviation Δ F ( E 0 ) of the PDNT Toeplitz matrix E 0 is related to the distance d F ( E 0 , U Q ˜ ) as
Δ F ( E 0 ) = ( 2 z + 1 z ( γ 1 γ 2 ) 2 + 2 γ 1 γ 2 z 2 ( γ 1 γ 2 ) 2 + z γ 1 + γ 2 ( γ 1 γ 2 ) 2 ) d F ( E 0 , U Q ˜ ) .
Proof. 
By applying Equations (21) and (22), the Frobenius deviation of the PDNT Toeplitz matrix E 0 from U Q ˜ is computed as follows:
for z > 1 ,
Δ F ( E 0 ) = γ 1 γ 2 + ( z 2 ) ( γ 1 2 + γ 2 2 ) + 2 γ 1 2 + 2 γ 2 2 j = 1 z 2 γ 1 γ 2 cos ( 2 j 1 ) π 2 z 1 2 = γ 1 γ 2 + z ( γ 1 2 + γ 2 2 ) 4 γ 1 γ 2 j = 1 z cos ( 2 j 1 ) π 2 z 1 2 = γ 1 γ 2 + z ( γ 1 2 + γ 2 2 ) ( 2 z 1 ) γ 1 γ 2 .
And Δ F ( E 0 ) = 0 , when z = 1 .
Thus, the deviation is given by the piecewise function
Δ F ( E 0 ) = 0 , z = 1 , z ( γ 1 γ 2 ) 2 + 2 γ 1 γ 2 , z > 1 .
Moreover, using Equation (20), the deviation for z > 1 can be compactly expressed as follows:
Δ F ( E 0 ) = 2 z + 1 z ( γ 1 γ 2 ) 2 + 2 γ 1 γ 2 z 2 ( γ 1 γ 2 ) 2 + z γ 1 + γ 2 ( γ 1 γ 2 ) 2 d F ( E 0 , U Q ˜ ) .
Lemma 1.
([42]). The Frobenius distance d F ( E , U ) between a matrix E C z × z and the normal matrix family U is bounded by:
Δ F ( E ) z d F ( E , U ) Δ F ( E ) .
which Equation (25) explicitly links the deviation Δ F ( E 0 ) to the distance.
Corollary 2.
For z > 1 , define θ as
θ = 2 z + 1 z ( γ 1 γ 2 ) 2 + 2 γ 1 γ 2 z 2 ( γ 1 γ 2 ) 2 + z γ 1 + γ 2 ( γ 1 γ 2 ) 2 ,
such that Equation (23) reduces to
Δ F ( E 0 ) = θ d F ( E 0 , U Q ˜ ) .
Substituting this into Equation (25) yields
θ z d F ( E 0 , U Q ˜ ) d F ( E 0 , U ) θ d F ( E 0 , U Q ˜ ) .

4. Spectral Distance and Normalization Analysis

4.1. The Distance of the Spectra of E and E *

Theorem 5.
Let E * be the nearest normal PDNT Toeplitz matrix to E . Define the eigenvalue vectors of E and E * as
A = [ λ 1 ( E ) , λ 2 ( E ) , , λ z ( E ) ] ,
A * = [ λ 1 ( E * ) , λ 2 ( E * ) , , λ z ( E * ) ] ,
whose Euclidean distance is given by the piecewise formula
| | A A * | | 2 = z 2 z + 1 ( γ 1 γ 2 ) 2 , z > 1 , 2 z 2 z + 1 ( γ 1 γ 2 ) 2 , z = 1 .
Moreover, the limit
lim E E * | | A A * | | 2 d F ( E , U Q ˜ ) = 0
holds, where d F ( E , U Q ˜ ) is specified in (20).
Proof. 
By combining the eigenvalue expressions in Equations (10) and (19) with the trigonometric summation identity in Equation (22), we derive the spectral distance as follows:
| | A A * | | 2 = j = 1 z λ j ( E ) λ j ( E * ) 2 = 2 z 2 z + 1 ( γ 1 γ 2 ) 2 j = 1 z cos ( 2 j 1 ) π 2 z 1 2 .
| | A A * | | 2 = z 2 z + 1 ( γ 1 γ 2 ) 2 , z > 1 , 2 z 2 z + 1 ( γ 1 γ 2 ) 2 , z = 1 .
Equation (30) is established by substituting Equations (20) and (29) into the limit expression followed by algebraic simplifications. □
Theorem 6.
For the case where E U Q ˜ , it logically follows that
A A * 2 d F ( E , U Q ˜ ) = z γ 1 γ 2 z γ 1 + γ 2 2 + γ 1 γ 2 , z > 1 , 2 γ 1 γ 2 3 γ 1 + γ 2 2 + γ 1 γ 2 , z = 1 .
Proof. 
The combined application of Equations (20) and (29) establishes the quantitative relation between the eigenvalue vector distance and the Frobenius distance expressed as follows:
when z = 1 ,
A A * 2 d F ( E , U Q ˜ ) 2 z γ 1 γ 2 2 z + 1 z γ 1 + γ 2 2 + γ 1 + γ 2 ,
when z > 1 ,
A A * 2 d F ( E , U Q ˜ ) = z γ 1 γ 2 z γ 1 + γ 2 2 + γ 1 + γ 2 .

4.2. Normalized Distance of Matrix E 0 to the U Q ˜ Family

Theorem 7.
For a PDNT Toeplitz matrix E 0 with ( γ 1 , γ 2 ) ( 0 , 0 ) , the normalized Frobenius distance to the normal matrix family U Q ˜ is given
d F ( E 0 , U Q ˜ ) E 0 F = z ( z + 1 ) 2 z + 1 ( 1 γ 2 γ 1 ) 2 2 z 2 z + 1 γ 2 γ 1 ( 1 γ 2 γ 1 ) 2 γ 2 γ 1 + z ( 1 + ( γ 2 γ 1 ) 2 ) ,
with its value bounded in
0 d F ( E 0 , U Q ˜ ) E 0 F < z + 1 2 z + 1 .
Proof. 
For γ 1 γ 2 0 , Equation (20) yields the normalized structured distance
d F ( E 0 , U Q ˜ ) E 0 F = z 2 2 z + 1 ( γ 1 γ 2 ) 2 + z γ 1 + γ 2 2 z + 1 ( γ 1 γ 2 ) 2 γ 1 γ 2 + z ( γ 1 2 + γ 2 2 ) = z 2 2 z + 1 ( 1 γ 2 γ 1 ) 2 + z 2 z + 1 1 + γ 2 γ 1 ( 1 γ 2 γ 1 ) 2 γ 2 γ 1 + z ( 1 + γ 2 γ 1 2 ) = z 2 2 z + 1 ( 1 γ 1 γ 2 ) 2 + z 2 z + 1 1 + γ 1 γ 2 ( 1 γ 1 γ 2 ) 2 γ 1 γ 2 + z ( 1 + γ 1 γ 2 2 ) .
The normalized distance decreases from z + 1 2 z + 1 to 0 as either γ 1 γ 2 or γ 2 γ 1 increases from 0 to 1. So the bound is
0 d F ( E 0 , U Q ˜ ) E 0 F < z + 1 2 z + 1 .
Remark 2.
From Equation (32), the normalized distance from matrix E 0 to U Q ˜ is
d F ( E 0 , U Q ˜ ) E 0 F = 0 | γ 1 | = | γ 2 | , z + 1 2 z + 1 exactly one of γ 1 and γ 2 is 0 .
Remark 3.
The equality d F ( E , U Q ˜ ) = d F ( E 0 , U Q ˜ ) implies the normalized distance bound for the PDNT Toeplitz matrix E
0 d F ( E , U Q ˜ ) E F = d F ( E 0 , U Q ˜ ) E 0 F E 0 F E F = d F ( E 0 , U Q ˜ ) E 0 F | γ 1 γ 2 | + z ( | γ 1 | 2 + | γ 2 | 2 ) | γ 1 γ 2 | + z ( | γ 1 | 2 + | γ 2 | 2 ) + z | γ 0 | 2 2 | γ 0 | | γ 1 γ 2 | d F ( E 0 , U Q ˜ ) E 0 F z + 1 2 z + 1 ,
with the upper bound attained if and only if γ 0 = 0 , γ 1 γ 2 = 0 and E is bidiagonal.

5. The Distance Between PDNT Toeplitz Matrix E and Matrix Family V Q ˜

Remark 4.
For the PDNT Toeplitz matrix E = (z ; γ 1 γ 2 , γ 2 , γ 0 , γ 1 , 2 γ 2 , 2 γ 1 ), the minimal distance matrix E + in V Q ˜ (with respect to Frobenius norm) is given by
E + = ( z ; 0 , γ 2 , γ 0 , 0 , 2 γ 2 , 0 ) | γ 1 | = min { | γ 1 | , | γ 2 | } , ( z ; 0 , 0 , γ 0 , γ 1 , 0 , 2 γ 1 ) | γ 2 | = min { | γ 1 | , | γ 2 | } .
Corollary 3.
For the PDNT Toeplitz matrix E , the Frobenius distance to the family V Q ˜ is calculated as follows:
  • when E Q ˜ ,
    d F ( E , V Q ˜ ) = d F ( E , E + ) = z min { | γ 1 | , | γ 2 | } 2 + | γ 1 γ 2 | ,
  • when E U Q ˜ ,
    d F ( E , V Q ˜ ) = d F ( E , E + ) = z | γ 1 | = z | γ 2 | ,
  • when E U Q ˜ ,
    d F ( E * , V Q ˜ ) = d F ( E * , E + ) = z ( γ 1 γ 2 + z ( γ 1 + γ 2 ) 2 z + 1 ) ,
where E * is the matrix in U Q ˜ closest to E , and E + is defined by Equation (34).
From Equations (35) and (36), we deduce
d F ( E * , V Q ˜ ) d F ( E , V Q ˜ ) = d F ( E * , E + ) d F ( E , E + ) = z ( γ 1 γ 2 + z ( γ 1 + γ 2 ) 2 z + 1 ) z min { | γ 1 | , | γ 2 | } 2 + | γ 1 γ 2 | = U d F ( E , U Q ˜ ) ,
where U = z ( γ 1 γ 2 + z ( γ 1 + γ 2 ) 2 z + 1 ) z min { | γ 1 | , | γ 2 | } 2 + | γ 1 γ 2 | z 2 2 z + 1 ( γ 1 γ 2 ) 2 + z γ 1 + γ 2 2 z + 1 ( γ 1 γ 2 ) 2 .
We introduce the ratio g as
g = min { | γ 1 | , | γ 2 | } max { | γ 1 | , | γ 2 | } ,
which will be utilized to estimate the bounds of the normalized distance between E 0 and V Q ˜ in the following proof.
Theorem 8.
When γ 0 = 0 , the normalized Frobenius distance from a PDNT Toeplitz matrix E 0 to the matrix family V Q ˜ satisfies
d F ( E 0 , V Q ˜ ) E 0 F z + 1 2 z + 1 ,
with equality holding when E 0 is normal.
Proof. 
Let g = | γ 1 | | γ 2 | . The following relation can be derived from Equations (7) and (34),
d F ( E 0 , V Q ˜ ) E 0 F = d F ( E 0 , E + ) E 0 F = z | γ 1 | 2 + | γ 1 γ 2 | z ( | γ 1 | 2 + | γ 2 | 2 ) + | γ 1 γ 2 | = z g 2 + g z ( g 2 + 1 ) + g z + 1 2 z + 1 .
With g gradually changing from 1 to 0, the normalized structured distance transitions from z + 1 2 z + 1 to 0. For g = | γ 2 | | γ 1 | , an entirely analogous derivation can be made using symmetry. □
By considering what has been discussed previously, we can derive the subsequent conclusions:
(1)
When | γ 1 | = | γ 2 | , d F ( E 0 , V Q ˜ ) E 0 F = z + 1 2 z + 1 ;
(2)
When γ 2 0 , lim | γ 1 | 0 d F ( E 0 , V Q ˜ ) E 0 F = 0 ;
(3)
When γ 1 0 , lim | γ 2 | 0 d F ( E 0 , V Q ˜ ) E 0 F = 1 .

6. Examples of Parameter

This section numerically verifies the properties of PDNT Toeplitz matrices and their eigenvalues as analyzed previously. The spectral distance between E and its closest normal matrix E * is obtained through Equations (20) and (31).
A ( E ) A ( E * ) 2 = z γ 1 γ 2 z γ 1 + γ 2 2 + γ 1 γ 2 d F ( E , U Q ˜ ) , z > 1 , 2 γ 1 γ 2 3 γ 1 + γ 2 2 + γ 1 γ 2 d F ( E , U Q ˜ ) , z = 1 .
For the matrix E ( g ) defined in
E ( g ) = ( 50 ; 5 g ( 4 + 3 i ) , ( 4 + 3 i ) g , 16 3 i , 5 , 2 ( 4 + 3 i ) g , 5 2 ) ,
with 0 < g < 1 , where g is the ratio in (37).
Figure 1 illustrates the linear relationship between the variable d F ( E ( g ) , U Q ˜ ) and g. It can be seen that as g gradually increases from 0 to 1, d F ( E ( g ) , U Q ˜ ) shows a linear decreasing trend. Figure 2 depicts the variation law of the A ( E ( g ) ) A ( E ( g ) * ) 2 with respect to the parameter g. When g starts to increase from 0, the spectral norm decays rapidly, showing a nonlinear decreasing trend; as g approaches 1, the spectral norm gradually becomes gentle. Table 1 presents numerical results of matrix E ( g ) . Based on the example related to parameter g established by Equation (39), the above results can be calculated by combining Equations (20) and (38). By combining these formulas, what is shown in the figure can be strictly proven.

Author Contributions

Conceptualization: Z.J. (Zhaolin Jiang); writing—original draft: H.C.; methodology: Z.J. (Zhaolin Jiang); writing—review and editing: Q.M.; supervision: Z.J. (Ziwu Jiang). All authors have read and agreed to the published version of the manuscript.

Funding

The research was partially supported by the Natural Science Foundation of Shandong Province (Grant No. ZR2022MA092, awarded to Zhaolin Jiang).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Chang, H.W.; Liu, S.E.; Burridge, R. Exact eigensystems for some matrices arising from discretizations. Linear Algebra Its Appl. 2009, 430, 999–1006. [Google Scholar] [CrossRef]
  2. Jiang, X.Y.; Zhang, G.J.; Zheng, Y.P.; Jiang, Z.L. Explicit potential function and fast algorithm for computing potentials in α×β conic surface resistor network. Expert Syst. Appl. 2024, 238, 122157. [Google Scholar] [CrossRef]
  3. Jiang, Z.L.; Zhou, Y.F.; Jiang, X.Y.; Zheng, Y.P. Analytical potential formulae and fast algorithm for a horn torus resistor network. Phys. Rev. E 2023, 107, 044123. [Google Scholar] [CrossRef] [PubMed]
  4. Yue, C.M.; Xu, Y.F.; Song, Z.D.; Weng, H.M.; Lu, Y.M.; Fang, C.; Dai, X. Symmetry-enforced chiral hinge states and surface quantum anomalous Hall effect in the magnetic axion insulator Bi2-xSmxSe3. Nat. Phys. 2019, 15, 577–581. [Google Scholar] [CrossRef]
  5. Schneider, B.I.; Gharibnejad, H. Numerical methods every atomic and molecular theorist should know. Nat. Rev. Phys. 2020, 2, 89–102. [Google Scholar] [CrossRef]
  6. Diele, F.; Lopez, L. The use of the factorization of five-diagonal matrices by tridiagonal Toeplitz matrices. Appl. Math. Lett. 1998, 11, 61–69. [Google Scholar] [CrossRef]
  7. Fischer, D.; Golub, G.; Hald, O.; Leiva, C.; Widlund, O. On Fourier-Toeplitz methods for separable elliptic problems. Math. Comput. 1974, 28, 349–368. [Google Scholar] [CrossRef]
  8. Willms, A.R. Analytic results for the eigenvalues of certain tridiagonal matrices. SIAM J. Matrix Anal. Appl. 2008, 30, 639–656. [Google Scholar] [CrossRef]
  9. Yueh, W.C.; Cheng, S.S. Explicit eigenvalues and inverses of tridiagonal Toeplitz matrices with four perturbed corners. ANZIAM J. 2008, 49, 361–387. [Google Scholar] [CrossRef]
  10. Luati, A.; Proietti, T. On the spectral properties of matrices associated with trend filters. Econom. Theory 2010, 26, 1247–1261. [Google Scholar] [CrossRef]
  11. Hansen, P.C. Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion; SIAM: Philadelphia, PA, USA, 1998. [Google Scholar]
  12. Reichel, L.; Ye, Q. Simple square smoothing regularization operators. Electron. Trans. Numer. Anal. 2009, 33, 63–83. [Google Scholar]
  13. Jia, J.; Li, S. On the inverse and determinant of general bordered tridiagonal matrices. Comput. Math. Appl. 2015, 69, 503–509. [Google Scholar] [CrossRef]
  14. Sogabe, T. New algorithms for solving periodic tridiagonal and periodic pentadiagonal linear systems. Appl. Math. Comput. 2008, 202, 850–856. [Google Scholar] [CrossRef]
  15. Liu, Z.; Li, S.; Yin, Y.; Zhang, Y. Fast solvers for tridiagonal Toeplitz linear systems. Comput. Appl. Math. 2020, 39, 315. [Google Scholar] [CrossRef]
  16. Da Fonseca, C.M. On the eigenvalues of some tridiagonal matrices. J. Comput. Appl. Math. 2007, 200, 283–286. [Google Scholar] [CrossRef]
  17. Du, L.; Sogabe, T.; Zhang, S.L. A fast algorithm for solving tridiagonal quasi-Toeplitz linear systems. Appl. Math. Lett. 2018, 75, 74–81. [Google Scholar] [CrossRef]
  18. Wang, J.; Zheng, Y.P.; Jiang, Z.L. Norm equalities and inequalities for tridiagonal perturbed Toeplitz operator matrices. J. Appl. Anal. Comput. 2023, 13, 671–683. [Google Scholar] [CrossRef]
  19. Fu, Y.; Jiang, X.Y.; Jiang, Z.L.; Jhang, S. Properties of a class of perturbed Toeplitz periodic tridiagonal matrices. Comput. Appl. Math. 2020, 39, 146. [Google Scholar] [CrossRef]
  20. Fu, Y.; Jiang, X.Y.; Jiang, Z.L.; Jhang, S. Inverses and eigenpairs of tridiagonal Toeplitz matrix with opposite-bordered rows. J. Appl. Anal. Comput. 2020, 10, 1599–1613. [Google Scholar] [CrossRef]
  21. Wei, Y.; Zheng, Y.P.; Jiang, Z.L.; Shon, S. The inverses and eigenpairs of tridiagonal Toeplitz matrices with perturbed rows. J. Appl. Math. Comput. 2022, 68, 623–636. [Google Scholar] [CrossRef]
  22. Wei, Y.L.; Jiang, X.Y.; Jiang, Z.L.; Shon, S. On inverses and eigenpairs of periodic tridiagonal Toeplitz matrices with perturbed corners. J. Appl. Anal. Comput. 2020, 10, 178–191. [Google Scholar] [CrossRef] [PubMed]
  23. Noschese, S.; Pasquini, L.; Reichel, L. Tridiagonal Toeplitz matrices: Properties and novel applications. Numer. Linear Algebra Appl. 2013, 20, 302–326. [Google Scholar] [CrossRef]
  24. Bebiano, N.; Furtado, S. Structured distance to normality of tridiagonal matrices. Linear Algebra Its Appl. 2018, 552, 239–255. [Google Scholar] [CrossRef]
  25. Demmel, J. Nearest Defective Matrices and the Geometry of Ill-Conditioning; Oxford University Press: New York, NY, USA, 1990. [Google Scholar]
  26. Higham, N.J. Matrix nearness problems and applications. In Applications of Matrix Theory; Oxford University Press: Oxford, UK, 1989. [Google Scholar]
  27. Lee, S.L. Best available bounds for departure from normality. SIAM J. Matrix Anal. Appl. 1996, 17, 984–991. [Google Scholar] [CrossRef]
  28. Noschese, S.; Pasquini, L.; Reichel, L. The structured distance to normality of an irreducible real tridiagonal matrix. Electron. Trans. Numer. Anal. 2007, 28, 65–77. [Google Scholar]
  29. Noschese, S.; Reichel, L. The structured distance to normality of banded Toeplitz matrices. BIT Numer. Math. 2009, 49, 629–640. [Google Scholar] [CrossRef]
  30. Chen, X.S. On estimating the separation of two regular matrix pairs. Numer. Math. 2016, 134, 223–247. [Google Scholar] [CrossRef]
  31. Chen, X.S. On estimating the separation of two periodic matrix sequences. BIT Numer. Math. 2017, 57, 75–91. [Google Scholar] [CrossRef]
  32. Chen, X.S.; Lv, P. On estimating the separation between (A, B) and (C, D) associated with the generalized Sylvester equation AXDBXC = E. J. Comput. Appl. Math. 2018, 330, 128–140. [Google Scholar] [CrossRef]
  33. Böttcher, A.; Grudsky, S.M. Spectral Properties of Banded Toeplitz Matrices; SIAM: Philadelphia, PA, USA, 2005. [Google Scholar]
  34. Reichel, L.; Trefethen, L.N. Eigenvalues and pseudo-eigenvalues of Toeplitz matrices. Linear Algebra Its Appl. 1992, 162, 153–185. [Google Scholar] [CrossRef]
  35. Trefethen, L.N.; Embree, M. Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators; Princeton University Press: Princeton, NJ, USA, 2005. [Google Scholar]
  36. Arnold, M.; Datta, B.N. Single-input eigenvalue assignment algorithms: A close look. SIAM J. Matrix Anal. Appl. 1998, 19, 444–467. [Google Scholar] [CrossRef]
  37. Datta, B. An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case. IEEE Trans. Autom. Control 1987, 32, 414–417. [Google Scholar] [CrossRef]
  38. Datta, B.N.; Lin, W.-W.; Wang, J.-N. Robust partial pole assignment for vibrating systems with aerodynamic effects. IEEE Trans. Autom. Control 2006, 51, 1979–1984. [Google Scholar] [CrossRef]
  39. Datta, B.N.; Sokolov, V. A solution of the affine quadratic inverse eigenvalue problem. Linear Algebra Its Appl. 2011, 434, 1745–1760. [Google Scholar] [CrossRef]
  40. Elsner, L.; Paardekooper, M.H.C. On measures of nonnormality of matrices. Linear Algebra Its Appl. 1987, 92, 107–123. [Google Scholar] [CrossRef]
  41. Henrici, P. Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices. Numer. Math. 1962, 4, 24–40. [Google Scholar] [CrossRef]
  42. László, L. An attainable lower bound for the best normal approximation. SIAM J. Matrix Anal. Appl. 1994, 15, 1035–1043. [Google Scholar] [CrossRef]
  43. Smithies, L. The structured distance to nearly normal matrices. Electron. Trans. Numer. Anal. 2010, 36, 99–112. [Google Scholar]
  44. Garcia, S.R.; Yih, S. Supercharacters and the discrete Fourier, cosine, and sine transforms. Commun. Algebra 2018, 46, 3745–3765. [Google Scholar] [CrossRef]
Figure 1. The relationship between d F ( E ( g ) , U Q ˜ ) and g (horizontal axis: g; vertical axis: d F ( E ( g ) , U Q ˜ ) , denoted as d F ).
Figure 1. The relationship between d F ( E ( g ) , U Q ˜ ) and g (horizontal axis: g; vertical axis: d F ( E ( g ) , U Q ˜ ) , denoted as d F ).
Axioms 14 00609 g001
Figure 2. The relationship between A ( E ( g ) ) A ( E ( g ) * ) 2 and g (horizontal axis: g; vertical axis: A ( E ( g ) ) A ( E ( g ) * ) 2 , denoted as L 2 norm ).
Figure 2. The relationship between A ( E ( g ) ) A ( E ( g ) * ) 2 and g (horizontal axis: g; vertical axis: A ( E ( g ) ) A ( E ( g ) * ) 2 , denoted as L 2 norm ).
Axioms 14 00609 g002
Table 1. Partial parameter examples.
Table 1. Partial parameter examples.
g d F ( E ( g ) , U Q ˜ ) A ( E ( g ) ) A ( E ( g ) * ) 2
0.122.530011.6439
0.317.50745.1011
0.512.50182.1413
0.92.50000.0658
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

Jiang, Z.; Chu, H.; Miao, Q.; Jiang, Z. Structured Distance to Normality of Dirichlet–Neumann Tridiagonal Toeplitz Matrices. Axioms 2025, 14, 609. https://doi.org/10.3390/axioms14080609

AMA Style

Jiang Z, Chu H, Miao Q, Jiang Z. Structured Distance to Normality of Dirichlet–Neumann Tridiagonal Toeplitz Matrices. Axioms. 2025; 14(8):609. https://doi.org/10.3390/axioms14080609

Chicago/Turabian Style

Jiang, Zhaolin, Hongxiao Chu, Qiaoyun Miao, and Ziwu Jiang. 2025. "Structured Distance to Normality of Dirichlet–Neumann Tridiagonal Toeplitz Matrices" Axioms 14, no. 8: 609. https://doi.org/10.3390/axioms14080609

APA Style

Jiang, Z., Chu, H., Miao, Q., & Jiang, Z. (2025). Structured Distance to Normality of Dirichlet–Neumann Tridiagonal Toeplitz Matrices. Axioms, 14(8), 609. https://doi.org/10.3390/axioms14080609

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

Article Metrics

Back to TopTop