On the reducibility of centrosymmetric matices - applications in engineering problems
type: Item
instance of: scholarly article
title: On the reducibility of centrosymmetric matices - applications in engineering problems
zbMATH Open document ID: 0674.15005
DOI: 10.1007/BF01598746
author: Lokesh Datta
author: Salvatore D. Morgera
published in: Circuits, Systems, and Signal Processing
publication date: 1989-01-01T00:00:00Z
review text: This work concerns the class \(K^{N\times N}\) of centrosymmetric complex \(N\times N\) matrices and offers a number of results leading to significant computational saving in many engineering applications. A matrix \(R\in C^{N\times N}\) is said to be centrosymmetric if \(R=E_ NRE_ N\), where \(E_ N\) is the contra-identity matrix having ones along the crossdiagonal and zeros elsewhere. The class \(K^{N\times N}\) is closed under addition, multiplication, transposition, inversion and left multiplication by \(E_ N\) (Lemma 3). Every matrix \(R\in K^{N\times N}\) is similar to a quasi-diagonal matrixa \(\hat R=diag(F,G)\), where \(F\in C^{M\times M}\) and \(G\in C^{M\times M}\) for \(N=2M\), or \(G\in C^{(M+1)\times (M+1)}\) for \(N=2M+1\) (Lemma 4). The last Lemma reduces the problem of computing det(R) to two problems of computing det(F) and det(G) (Th. 1). For \(R\in K^{N\times N}\) having distinct eigenvalues from M linearly independent (l.i.) eigenvectors of F, M. l.i. skew-symmetric eigenvectors of R and from M, or \(M+1\) l.i. eigenvectors of G, M or \(M+1\) symmetric eigenvectors of R can be determined, where \(N=2M\), or \(N=2M+1\), respectively (Th. 2.). Thereby, a vector \(x\in C^{N\times 1}\) is said to be symmetric, or skew-symmetric if \(x=E_ Nx\), or \(x=-E_ Nx\), respectively. In general, for every eigenvalues \(\lambda\) of \(R\in K^{N\times N}\) there is a corresponding symmetric or skew-symmetric eigenvector x of R (see pp. 80-81). The converse of Th. 2 is also true: A matrix \(R\in C^{N\times N}\) having N l.i. eigenvectors which are either symmetric or skew-symmetric, is a centrosymmetric matrix (Th. 7). Some applications of the above results are given.
Mathematics Subject Classification ID: 15A23
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 00A06
Mathematics Subject Classification ID: 15B57
Mathematics Subject Classification ID: 15A15
zbMATH DE Number: 4103262
zbMATH Keywords: reducibility of centro-symmetric matrices
zbMATH Keywords: complexity
zbMATH Keywords: determinants
zbMATH Keywords: engineering applications
zbMATH Keywords: eigenvalues
zbMATH Keywords: eigenvectors
reviewed by: Veselin Perić
MaRDI profile type: Publication
cites work: Toeplitz Matrix Inversion: The Algorithm of W. F. Trench
cites work: Eigenvalues and eigenvectors of symmetric centrosymmetric matrices
cites work: Comments and corrections on "On the eigenvectors of symmetric Toeplitz matrices"
cites work: Eigenvectors of certain matrices
cites work: Linear Statistical Inference and its Applications
cites work: Toward a Fundamental Theory of Optimal Feature Selection: Part I
cites work: On the best finite set of linear observables for discriminating two Gaussian signals
cites work: An Algorithm for the Inversion of Finite Toeplitz Matrices
cites work: Q4131773
cites work: Q5674306
cites work: Q5571270
cites work: Q3286217
cites work: On the asymptotic eigenvalue distribution of Toeplitz matrices
cites work: Q3247378
cites work: Properties of the Eigenvectors of Persymmetric Matrices with Applications to Communication Theory
cites work: Adaptive Channel Memory Truncation for Maximum Likelihood Sequence Estimation
cites work: An estimate of the upper bound on error probability for maximum-likelihood sequence estimation on channels having a finite-duration pulse response (Corresp.)
cites work: Connections between classical and statistical methods of FIR digital filter design
cites work: A class of all-zero lattice digital filters: Properties and applications
cites work: Statistical design of autoregressive-moving average digital filters
cites work: A simplified Schur-Cohn test
cites work: On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
cites work: On the method of maximum entropy spectrum estimation (Corresp.)
cites work: The effects of noise on the autoregressive spectral estimator
cites work: Structured estimation: Sample size reduction for adaptive pattern classification
cites work: Rate-distortion speech coding with a minimum discrimination information distortion measure
full work available at URL: https://doi.org/10.1007/bf01598746
OpenAlex ID: W2020376719
description: scientific article; zbMATH DE number 4103262