Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29212

Select areas to restrict search in scientific publication database:
A Time-Reducible Approach to Compute Determinant |I-X|
Computation of determinant in the form |I-X| is primary and fundamental because it can help to compute many other determinants. This article puts forward a time-reducible approach to compute determinant |I-X|. The approach is derived from the Newton’s identity and its time complexity is no more than that to compute the eigenvalues of the square matrix X. Mathematical deductions and numerical example are presented in detail for the approach. By comparison with classical approaches the new approach is proved to be superior to the classical ones and it can naturally reduce the computational time with the improvement of efficiency to compute eigenvalues of the square matrix.
Digital Object Identifier (DOI):


[1] Ershaidat, M, N. History of Matrices and Determinants, Yarmouk University, Irbid Jordan, 2007, 1-6.
[2] Gunter Rote. Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches, Computational Discrete Mathematics, LNCS 2122, pp. 119–135, 2001.
[3] Seifullin T R. Acceleration of Computation of determinants and Characteristic polynomials without Divisions, Cybernetics and Systems Analysis, Vol. 39, No. 6, 2003.
[4] Kaltofen E. On Computing Determinants of Matrices without Divisions. Proceedings of the 1992 International Symposium on Symbolic Algebraic Computing, 1992:342-349.
[5] Villard G. Computation of the Inverse and Determinant of a Matrix (J), INRIA, (2003), pp. 29–32.
[6] Ioannis Z. Emirisa, and Victor Y. Panb, Improved Algorithms for computing determinants and resultants. Journal of Complexity 21 (2005) 43–71.
[7] Klaus Kirsten. Computation of determinants using contour integrals, American Journal of Physics.76:60-64,2008.
[8] Keček, Damira. Methods of computing determinants of the n-th order, Osječki matematički list, Vol.10 No.1 October 2010. 31–42.
[9] T Ogita. Robust Computation of Determinant (C). American Institute of Physics Conference Series, 2012, 1504(10):1119-1123.
[10] Almalki S, Alzahrani S. A Alabdullatif. New parallel algorithms for finding determinants of N×N matrices, World Congress on Computer & Information Technology, 2013:1-6.
[11] Beliakov G, Matiyasevich Y.A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters, arXiv:1308.1536v2,2013(8).
[12] Salman H. Abbas. Computing the Determinants in the Multiprocessor Computer. International Journal of Innovative Research in Science, Engineering and Technology, Vol. 3, Issue 8, August 2014.
[13] G Beliakov, Y Matiyasevich. A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic. Bit Numerical Mathematics, 2015:1-18.
[14] Jia L, Yao GT. On computation determinant of circulant matrices and its application (J), Journal of Xinyang Teachers College, 2014, 18(2):131-132.
[15] Elouafi M., Dah Ahmed. A New Algorithm for the Determinant and the Inverse of Banded Matrices (J).Open Access Library Journal, 2014, 01:1-5.
[16] Awol Assen, Venkateswara Rao J.A Study on the Computation of the Determinants of a 3x3 Matrix, International Journal of Science and Research, 2014,3(6):912-921.
[17] Wang Xingbo, Xian Yaoqi. How Difficult to Compute Coefficients of Characteristic Polynomial? International Journal of Scientific and Innovative Mathematical Research (IJSIMR), 2016,3(1):7-12.
[18] K Singh.Linear algebra step by Step, Oxford Press, 2013,pp517.
[19] C D Meyer. Matrix Analysis and Applied Linear Algebra, SIAM, Philadelphia, 2000,pp489-660.
[20] G W Stewart, Matrix Algorithms, SIAM, 1998,pp176-177.
[21] S S. Skiena, The Algorithm Design Manual, Springer- Verlag London Limited, 2008, pp404-406.
Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007