Counter Example: The Algorithm of Determinant of Centrosymmteric Matrix based on Lower Hessenberg Form
DOI:
https://doi.org/10.15642/mantik.2020.6.1.20-29Keywords:
Centrosymmetric; Determinant; Block matrices; Lower HessenbergAbstract
The algorithm for computing determinant of centrosymmetric matrix has been evaluated before. This algorithm shows the efficient computational determinant process on centrosymmetric matrix by working on block matrix only. One of block matrix at centrosymmetric matrix appearing on this algorithm is lower Hessenberg form. However, the other block matrices may possibly appear as block matrix for centrosymmetric matrix’s determinant. Therefore, this study is aimed to show the possible block matrices at centrosymmetric matrix and how the algorithm solve the centrosymmetric matrix’s determinant. Some numerical examples for different cases of block matrices on determinant of centrosymmetric matrix are given also. These examples are useful for more understanding for applying the algorithm with different cases.
Downloads
References
Zhong-Yun Liu, "Some properties of centrosymmetric matrices", Appl. Math. Comput. 141 pp. 297-306, 2003.
Hongyi Li, Di Zhao, Fei Dai and Donglin Su, "On the spectral radius of a nonnegative centrosymmetric matrix", Appl. Math. Comput., 218 (9) pp. 4962-4966, 2012.
Melman, "Symmetric centrosymmetric matrix-vector multiplication", Linear Algebra and Its Appl., 320 pp.193-198, 2000.
Iyad T. Abu-Jeib, "Centrosymmetric matrices : properties and an alternative approach", Canadian Applied Mathematics Quarterly, 10 pp. 429-445, 2000.
Alan L. Andrew, "Eigenvector of certain matrices", Linear Algebra and Its Appl., 7 pp. 151-162, 2000.
Charles F Van Loan and Joseph P Vokt, "Approximating matrices with multiple symmetries", SIAM J.Matrix Anal.Appl., 36(3) pp.974-993, 2015.
Dattatreya A.V. Rao and K. Venkata Ramana, "On LU decomposition of a centrosymmetric matrix", Information Sciences, 63 pp. 3-10, 2000.
Konrad Burnik, "A structure-preserving QR factorization for centrosymmetric real matrices", Linear Algebra and Its Applications, 484 pp. 356-378, 2015.
Gene H. Golub and Charles F. Van Loan, "Matrix Computations, third ed.", Johns Hopkins University Press, Baltimore and London, (1996).
Tomohiro Sogabe, "On a two-term recurrence for the determinant of a general matrix", Appl. Math. Comput., 187 pp. 785-788, 2007.
Mohamed Elouafi and A.D. Aiat Hadj, "A new recursive algorithm for inverting Hessenberg matrices", Appl. Math. Comput., 214 pp. 497-499, 2009.
F Bunger, “Inverse, determinant, eigenvalues, and eigenvectors of real symmetric Toeplitz matrices with linearly increasing entries”, Linear Algebra and its Applications.459 pp.595-619, 2014.
Mohamed Elouafi and A.D. Aiat Hadj, "A new recursive algorithm for inverting Hessenberg matrices", Appl. Math. Comput., 214 pp. 497-499, 2009.
Di Zhao and Hongyi Li, "On the computation of inverse and determinant of a kind of special matrices", Appl. Math. Comput., 250 pp. 721-726, 2015.
N Khasanah, Farikhin and B Surarso, "The algorithm of determinant of centrosymmetric matrix based on lower Hessenberg form", IOP Conf. Series : Journal of Physics : Conf. Series 824 ,2017.
Datta and Morgera, "On the reducibility of centrosymmetric matrices-Aplication in engineering problems", Circuits System Signal Process., 8 (1) pp. 71-95, 1989.
Downloads
Published
How to Cite
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work