Comparison of Gaussian Elimination and Cholesky Decomposition Solving A Linear System Of Equation.

dc.contributor.authorNzabonimpa, Godfrey
dc.date.accessioned2024-01-15T11:53:32Z
dc.date.available2024-01-15T11:53:32Z
dc.date.issued2022
dc.description.abstractThere are several methods of solving a system of linear equations. Some of which are direct methods and others are iterative methods. In this work, we study direct methods specifically Gaussian elimination and Cholesky decomposition and make a comparison between the two. It is found out that Gaussian elimination is an algorithm in linear algebra for solving a system of linear equations and can also be used to find the rank of a matrix, to calculate the determinant of a matrix, and to calculate the inverse of an invertible square matrix Whereas Cho!sky decomposition is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions.
dc.identifier.citationNzabonimpa, Godfrey (2022). Comparison of Gaussian Elimination and Cholesky Decomposition Solving A Linear System Of Equation. Kabale: Kabale University.
dc.identifier.urihttp://hdl.handle.net/20.500.12493/1652
dc.language.isoen_US
dc.publisherKabale University
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United Statesen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/
dc.subjectComparison
dc.subjectGaussian Elimination
dc.subjectCholesky Decomposition Solving
dc.subjectLinear System
dc.subjectEquation
dc.titleComparison of Gaussian Elimination and Cholesky Decomposition Solving A Linear System Of Equation.
dc.typeThesis

Files