On Optimal Backward Perturbation Analysis for the Linear System with Skew Circulant Coefficient Matrix

We first give the style spectral decomposition of a special skew circulant matrix C and then get the style decomposition of arbitrary skew circulant matrix by making use of the Kronecker products between the elements of first row in skew circulant and the special skew circulant C. Besides that, we obtain the singular value of skew circulant matrix as well. Finally, we deal with the optimal backward perturbation analysis for the linear system with skew circulant coefficient matrix on the base of its style spectral decomposition.


Introduction
A skew circulant matrix with the first row ( 1 , 2 , . . . , ) is a square matrix of the form denoted by SCirc ( 1 , 2 , . . . , ). Skew circulant matrices have important applications in various disciplines including image processing, signal processing, solving Toeplitz matrix problems, and preconditioner. The skew circulant matrices are considered as preconditioners for linear-multistep-formulae (LMF-) based ordinary differential equations (ODEs) codes; Hermitian and skew-Hermitian Toeplitz systems are considered in [1][2][3][4]. Lyness and Sörevik [5] employed a skew circulant matrix to construct -dimensional lattice rules. Spectral decompositions of skew circulant and skew left circulant matrices are discussed in [6]. Akhondi and Toutounian [7] presented a new iteration method for the numerical solution of Hermitian positive definite Toeplitz systems of linear equations. Narasimha [8] believed that the linear convolution required in block filtering can be decomposed into a sum of skewcirculant convolutions and such convolutions can be realized efficiently with half-length complex transforms when the signals are real. Liu and Vaidyanathan [9] presented a new family of normal form state-space structures, the method used allows people to synthesize in normal form, most IIR transfer functions, and the state transition matrices involved are either circulant or skew circulant matrices. Vaidyanathan and Pal [10] examined a case where two arrays are generated by matrices that are adjugates of each other; in this case, it is possible to obtain a dense rectangular tiling of the 2 frequency plane from a pair of coarse 2 DFT filter banks; the special case where the adjugate pairs are generated by skew circulant matrices has some advantages, which are examined in detail. An additional convolution-multiplication property for the skew-circulant convolution operation = ℎⓈ = , where is a skew-circulant matrix; besides, skewcirculant convolution is the underlying form of convolution in half of the 40 cases of symmetric convolution, and the convolution is an extension of a result Vernet's [11], Foltz and Welsh provided the convolution performed between ℎ and is skew-circulant rather than circulant in [12].
Liu and Guo [13] gave the optimal backward perturbation analysis for a linear system with block circulant coefficient matrix. The optimal backward perturbation bound for underdetermined systems is studied by J.-G. Sun and Z. Sun in [14]. Some new theorems generalizing a result of Oettli and Prager are applied to the a posteriori analysis of the compatibility of a computed solution to the uncertain data of a linear system by Rigal and Gaches in [15].
In this paper, we first give the style spectral decomposition of a special skew circulant matrix and then get the style spectral decomposition of arbitrary skew circulant matrix by making use of Kronecker products between the elements of first row in skew circulant and the special skew circuant . Besides that, we obtain the singular value of skew circulant matrix as well. Finally, we deal with the optimal backward perturbation analysis for the linear system with skew circulant coefficient matrix on the base of its style spectral decomposition.

Style Spectral Decomposition of a Special Skew Circulant
Some properties of this matrix are given in the following theorem.

Lemma 1. (1) The eigenvalues of matrix are
(2) If is even, the matrix has no real eigenvalue and The basis of the associated two-dimensional invariant subspace can be taken as ) , (3) If is odd, the matrix has only one real eigenvalue ( +1)/2 = −1, and the associated eigenvector is The basis of the associated two-dimensional invariant subspace can be taken as ) , Specially, if is even, then (1) and (2) span the twodimensional invariant subspace associated with and .

The Style Spectral Decomposition of the Skew Circulant
where ( is even, the same case as (10)), ( is odd, the same case as (11)).
Noticing that is an orthogonal matrix, hence (12) is the style spectral decomposition of the matrix .
The following are the computation formulae of the factors in (12): Hence, when is even, where, for arbitrary = 1, 2, . . . , /2, When is odd, wherẽis defined by (18), and Hence the style spectral decomposition of the matrix is ) . (21)

The Structured Perturbation Analysis
In this section we give the structured perturbation analysis for linear systems with skew circulant coefficient matrix.

Condition Number and Relative Error of Linear Skew Circulant Equation System
. Consider the following: where is defined in (2). From (12), we know that the style spectral decomposition of the matrix is = ( 4

Lemma 3. A is an invertible matrix if and only if
Consequently, the spectral decomposition of the matrix (by using the complex style spectral decomposition of = where 0 is a unitary matrix. Let Δ , Δ be the perturbation of the coefficient matrix and vector , respectively, where Let̂= + Δ ,̂= + , then̂( Hencêis an invertible matrix. Let where Notice that̂− = Δ is a skew circulant matrix, and ‖ −̂‖ 2 = | − 1|‖̂− ‖ 2 = ‖̂− ‖ 2 . So we get Hence we have the following theorem.
Theorem 5. Let ,̂, , Δ, and min be defined as above. If Δ < min , then Computational and Mathematical Methods in Medicine Remark 6. From (38) and (39), the condition number of the skew circulant system can be defined as K = max{ }/ min{ }. It is easily computed, as well as the bound of perturbation (38).

Optimal Backward Perturbation
which is equivalent to Due to [15], we have If the recycling property of is not utilized in the algorithm in forminĝ, then (̂) can be used to estimate the backward stability for this algorithm.
Let̂be an approximate solution to = , where is defined in (2): Then Ω ̸ = (such that Δ = 0 is a skew circulant matrix, and Δ =̂− ) and Since so Besides that, we can get ) , ) . Let which is equivalent to Hence the is a convex function about ( 1 , . . . , ), and the point of minimal value is Substituting it back into (49), we can get the following.

Algorithm 9.
Step 1. Form the block style spectral decomposition of the matrix Step 2. Compute = −̂.

Conclusion
The related problems of skew-circulant matrix are considered in this paper. We not only present style spectral decomposition and singular value but also study backward perturbation analysis for the linear system with skew-circulant coefficient matrix. The reason why we focus our attentions on skewcirculant is to explore the application of skew circulant in the related field in medicine. Wittsack et al. in [16] validated a deconvolution method originating from magnetic resonance techniques and apply it to the calculation of dynamic contrast enhanced computed tomography perfusion imaging, and the application of a block circulant matrix approach for singular value decomposition renders the analysis independent of tracer arrival time to improve the results. On the basis of existing application situation, we conjecture that SVD decomposition of skew circulant matrix will play an important role in CT-perfusion imaging of human brain.