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 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.
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 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.
Amazing :)
sircamzo 2 weeks ago
you are an excellent teacher!
you explained this much better than my professor did, now i just need to learn how to put it in code haha
dinodonia 3 weeks ago
thank you from Jordan :)
esramer 1 month ago
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
TimpBizkit 1 month ago
39,376 students have bad teachers at their universities :)
sabatonchik 3 months ago 3
Thankyou, from Australia
Ninjarni 9 months ago
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 1 year 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 1 year ago
Great Class, congratulations!
vitfc 1 year 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 1 year ago
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.
xelink 1 year ago
LMFAO! Very helpful, and entertaining
DocJ32290 2 years ago
reall well put together lecture on LUD
jiminikiz 2 years ago
Thank you for that really nice vid! ^^
Greetings from spain
zildjian 2 years ago
i have final exam tomorrow thnx alot that help me alott ...
8soso8 2 years ago