How is the MATLAB LU decomposition so accurate?
조회 수: 1 (최근 30일)
이전 댓글 표시
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
답변 (0개)
참고 항목
카테고리
Help Center 및 File Exchange에서 Matrix Decomposition에 대해 자세히 알아보기
제품
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!