Advertisement

A Computationally Simplified Numerical Algorithm for Evaluating a Determinant

  • S. N. Sivanandam
  • V. Ramani Bai
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 142)

Abstract

A computationally simplified new procedure is presented in this paper to evaluate the determinant of a matrix A [nxn], where A may be ill-conditioned. The proposed method reduces the nth order determinant using the elementary row operations into a sequence of column vectors and then the determinant is evaluated by multiplying the elements of all column vectors. We improve the condition of ill-conditioned determinant first and then evaluate the well-conditioned one. This procedure is direct and simple in application compared to Gauss reduction method. Both the procedures are applied to illustrative examples and the comparison is also reported.

Keywords

Determinant Ill-Conditioned Determinant Well-Conditioned Determinant Column Vectors Computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rice, J.R.: Matrix Computations and Mathematical Software. McGraw-Hill, New York (1981)zbMATHGoogle Scholar
  2. 2.
    Press, W.H.: Numerical Recipes: The Art of Scientific Computing, Cambridge (1992)Google Scholar
  3. 3.
    Hoffman, J.D.: Numerical Methods for Engineers and Scientists. McGraw-Hill, New York (1992)zbMATHGoogle Scholar
  4. 4.
    Mucha, M., Sankowski, P.: Maximum matching via Gaussian elimination. In: 45th Annual IEEE Symposium on Foundations of Computer Science (accepted 2004)Google Scholar
  5. 5.
    Sankowski, P.: Dynamic Transitive Closure via Dynamic Matrix Inverse. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 (2004)Google Scholar
  6. 6.
    Bunch, J., Hopcroft, J.: Triangular factorization and inversion by fast matrix multiplication. Math. Comp. 28, 231–236 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Gloub, G.H.: Matrix Computations. John Hopkins University Press, London (1989)Google Scholar
  8. 8.
    Broyden, C.G.: A class of Methods for Solving Nonlinear simultaneous equations. Mathematics of Computation 19(22), 577–593 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1974)zbMATHGoogle Scholar
  10. 10.
    Percival, W.S.: Improved Matrix and Determinant methods for Solving Networks. Monograph No. 96. Radio Section, pp. 258–266 (1964)Google Scholar
  11. 11.
    Clarkson, K.L.: A short method for evaluating determinants and solving system of linear equations with real and complex coefficients. AIEE Transactions 60, 1235–1248 (1941)Google Scholar
  12. 12.
    Bronnimann, H., Yvinec, M.: Efficient Exact Evaluation of Signs of Determinants. Algorithimica 27, 21–56 (2000) doi: 10.10007/s004530010003, MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • S. N. Sivanandam
    • 1
  • V. Ramani Bai
    • 2
  1. 1.Department of Computer Science and EngineeringPSG College of TechnologyCoimbatoreIndia
  2. 2.Department of Computer Science and EngineeringSAINTGITS College of EngineeringKottayamIndia

Personalised recommendations