How is the MATLAB LU decomposition so accurate?
4 views (last 30 days)
Show older comments
Hello,
I wanted to implement my own LU factorization algorithm and I compared it with the output produced by the standard lu function in MATLAB. The results are correct, as the norm of the residual A-L*U has a very small value.
What other principle is applied in the MATLAB implementation of the algorithm as it is a lot more consistent and accurate compared with the basic factorization? I also tried partial, rook and complete pivoting and it's still a few orders of magnitude weaker generally. Is there some iterative refinement applied on the matrices or does the proprietary implementation have access to some extended precision when using the CPU?
I uploaded a plot of the comparison of the two methods.
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/193138/image.png)
0 Comments
Answers (0)
See Also
Categories
Find more on Matrix Decomposition in Help Center and File Exchange
Products
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!