S. Guritman, Jaharuddin, Teduh Wulandari, Siswandi
{"title":"用卢卡斯数计算圆周矩阵逆值和特征值的高效方法","authors":"S. Guritman, Jaharuddin, Teduh Wulandari, Siswandi","doi":"10.9734/jamcs/2024/v39i41879","DOIUrl":null,"url":null,"abstract":"In this article, the inverse including the determinant, and the eigenvalues of circulant matrices with entry Lucas numbers are formulated explicitly in a simple way so that their computations can be constructed efficiently. The formulation method of the determinant and inverse is simply applying the theory of elementary row or column operations and can be unified in one theorem. Meanwhile, for the eigenvalues formulation, the recently known formulation in the case of general circulant matrices is simplified by observing the specialty of the Lucas sequence and applying cyclic group properties of unit circles in the complex plane. Then, an algorithm of those formulations is constructed efficiently. From some implementation facts also showed that the algorithms performed very fast and was able to calculate large size of circulant matrices.","PeriodicalId":503149,"journal":{"name":"Journal of Advances in Mathematics and Computer Science","volume":" 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Efficient Method for Computing the Inverse and Eigenvalues of Circulant Matrices with Lucas Numbers\",\"authors\":\"S. Guritman, Jaharuddin, Teduh Wulandari, Siswandi\",\"doi\":\"10.9734/jamcs/2024/v39i41879\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, the inverse including the determinant, and the eigenvalues of circulant matrices with entry Lucas numbers are formulated explicitly in a simple way so that their computations can be constructed efficiently. The formulation method of the determinant and inverse is simply applying the theory of elementary row or column operations and can be unified in one theorem. Meanwhile, for the eigenvalues formulation, the recently known formulation in the case of general circulant matrices is simplified by observing the specialty of the Lucas sequence and applying cyclic group properties of unit circles in the complex plane. Then, an algorithm of those formulations is constructed efficiently. From some implementation facts also showed that the algorithms performed very fast and was able to calculate large size of circulant matrices.\",\"PeriodicalId\":503149,\"journal\":{\"name\":\"Journal of Advances in Mathematics and Computer Science\",\"volume\":\" 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advances in Mathematics and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/jamcs/2024/v39i41879\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advances in Mathematics and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/jamcs/2024/v39i41879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Method for Computing the Inverse and Eigenvalues of Circulant Matrices with Lucas Numbers
In this article, the inverse including the determinant, and the eigenvalues of circulant matrices with entry Lucas numbers are formulated explicitly in a simple way so that their computations can be constructed efficiently. The formulation method of the determinant and inverse is simply applying the theory of elementary row or column operations and can be unified in one theorem. Meanwhile, for the eigenvalues formulation, the recently known formulation in the case of general circulant matrices is simplified by observing the specialty of the Lucas sequence and applying cyclic group properties of unit circles in the complex plane. Then, an algorithm of those formulations is constructed efficiently. From some implementation facts also showed that the algorithms performed very fast and was able to calculate large size of circulant matrices.