EFFICIENCY AND COMPUTATIONAL COMPLEXITY ANALYSIS OF DETERMINANT CALCULATION ALGORITHMS FOR SOLVING SYSTEMS OF LINEAR EQUATIONS IN ENGINEERING PROBLEMS
Keywords:
determinant, Cramer's rule, Gaussian elimination, computational complexity, engineering models.Abstract
This paper investigates the efficiency of determinant calculation algorithms for solving systems of linear equations in engineering problems. The time and space complexities of Cramer's rule, Laplace expansion, and Gaussian elimination are analyzed. Based on precise operation counts, a drastic performance degradation of factorial algorithms under increasing matrix dimensions is demonstrated. Practical recommendations for computational optimization in engineering workflows are provided.References
1.Golub, G. H., & Van Loan, C. F. (2013). Matrix Computations (4th ed.). Johns Hopkins University Press.
2.Strang, G. (2016). Introduction to Linear Algebra (5th ed.). Wellesley-Cambridge Press.
3.Quarteroni, A., Sacco, R., & Saleri, F. (2007). Numerical Mathematics (2nd ed.). Springer Science & Business Media. https://doi.org/10.1007/b138611
4.Demmel, J. W. (1997). Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics (SIAM). https://doi.org/10.1137/1.9781611971446
5.Saad, Y. (2003). Iterative Methods for Sparse Linear Systems (2nd ed.). Society for Industrial and Applied Mathematics.
6.Trefethen, L. N., & Bau, D. (1997). Numerical Linear Algebra. SIAM.
7.Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (2007). Numerical Recipes: The Art of Scientific Computing (3rd ed.). Cambridge University Press.
8.Knuth, D. E. (2011). The Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd ed.). Addison-Wesley Professional.