LU Decomposition Method: Decomposing a Matrix Example: Part 1 of 2
Loading...
48,320
Uploader Comments (numericalmethodsguy)
see all
All Comments (14)
-
thank you from Jordan :)
-
Ax = b we know A and b and want to find x
A = LU the L has 1s for the main diagonal
Ly = b, find y
Ux = y, find x
-
39,376 students have bad teachers at their universities :)
-
Thankyou, from Australia
-
Great Class, congratulations!
-
this video was GREAT.
the 2nd half is giving me a server error... I have a quiz on this in 28.5 hours... ehh I'll learn elsewhere.
Loading...
first step is to change row 1 with row 3 - and the solution vector is changed from (x1, x2, x3) to (x3, x2, x1) - than it's easier to calculate it - and more accurate if you do it with the computer
MrMuesli 11 months ago
@MrMuesli The example is solely for explaining the algorithm. We do not change rows, as we follow the Naive Gauss Elimination Forward Elimination steps to find A=LU. If we change the rows for less round-off error, we follow the Gaussian Elimination with Partial Pivoting, and would get PA=LU, where P is called the perturbation matrix. Exchanging rows does not change the unknown vector.
numericalmethodsguy 11 months ago
When we use LU Decomposition to solve a system of equations, how do we guarantee its uniqueness? Will different LU Decompositions give different solutions to the same system of equations?
sammyjny 1 year ago
@sammyjny The system of equations will have a unique solution if the coefficient matrix is nonsingular. That has nothing to do with the uniqueness of LU Decomposition.
numericalmethodsguy 11 months ago