LU Decomposition: Calculating Determinant of Square Matrix (Example Included)

  • Thread starter Thread starter demipaul
  • Start date Start date
  • Tags Tags
    Decomposition
demipaul
Messages
1
Reaction score
0
How would I calculate the determinant of a square matrix using LU Decomposition. Please be plain, I am not good with technical terms. An example would be nice. Thank you!
 
Physics news on Phys.org
Hello,

I looked up a nice example on how to compute LU Decomposition. On this http://www.utdallas.edu/dept/abp/PDF_Files/LinearAlgebra_Folder/LU_Decomposition.pdf" , the author has provided a nice clear explanation on how to do an LU decomposition (I've also attached the pdf, in case the link is taken down).

And according to http://en.wikipedia.org/wiki/LU_decomposition#Determinant"
The matrices L and U can be used to compute the determinant of the matrix A very quickly, because det(A) = det(L) det(U) and the determinant of a triangular matrix is simply the product of its diagonal entries. In particular, if L is a unit triangular matrix, then
det(A) = det(L)det(U) = 1 \cdot det(U) =\prod^{n}_{i = 1}u_{ii}.
(Note: A http://planetmath.org/encyclopedia/UnitLowerTriangularMatrix.html" is a triangular matrix with 1's along it's diagonals)

So if you used the methodology to get an LU decomposition and further reduce the L matrix to a lower triangular matrix with 1's along the diagonal- then you can simply take the product of the diagonals of the right upper triangular matrix U to get your determinant for matrix A.
 

Attachments

Last edited by a moderator:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top