please help 5-3!!! thanks (Jacobean matrix) using the Jth iterative solution X j

Question

please help 5-3!!! thanks

(Jacobean matrix) using the Jth iterative solution X j-(XU'? , xn.) 4. For a linear algebraic equation (LAB) Ax-b, A E R",xE R",b e R" with the symmetric property A A. Answer the following questions to solve the LAE using the Cholesky- decomposition method with A=LU, where Land U represent the lower and upper triangular matrices, respectively. (4-1) Prove the relation of L-U (4-2) Perform the Cholesky-decomposition to get L and U for the following matrix. 1 2 3 A 2 5 8 3 8 1 5. Derive operation counts (number of multiplications and divisions) for each method and explain the relative efficiency (5-1) Stanadard Gauss elimination (5-2) LU-decomposition (5-3) Cholesky-decomposition (in a case when the matrix A is symmetric) Tips) + n k-1 kel k-l 1,2 . 3n(n +1) (k+I)-k3k2 +3k+1 kal k-l

Explanation / Answer

To analyze complexity for Cholesky decomposition of n×nn×n matrix, let f(n)f(n) be the cost of decomposition of n×nn×n matrix

Then,

f(n)=2(n?1)2+(n?1)+1+f(n?1)f(n)=2(n?1)2+(n?1)+1+f(n?1) , if we use rank 1 update for A22?L12LT12A22?L12L12T.

But, since we are only interested in lower triangular matrix, only lower triangular part need to be updated which requires approximately n2flopsn2flops.

So, f(n)=(n?1)2+(n?1)+1+f(n?1)f(n)=(n?1)2+(n?1)+1+f(n?1)

f(1)=1f(1)=1

After solving this you get f(n)=13n3+23nf(n)=13n3+23n , which is approximately the total cost of Cholesky decomposition.

Taken from http://www.cs.utexas.edu/users/flame/Notes/NotesOnCholReal.pdf

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.