Performing Gauss Elimination with MatLab

1,200 次查看（过去 30 天）
Lukumon Kazeem
Lukumon Kazeem 2012-7-11
评论： Ilyas Nhasse 2021-10-26
K =
-0.2106 0.4656 -0.4531 0.7106
-0.6018 0.2421 -0.8383 1.3634
0.0773 -0.5600 0.4168 -0.2733
0.7945 1.0603 1.5393 0.0098
I have the above matrix and I'd like to perform Gauss elimination on it with MatLab such that I am left with an upper triangular matrix. Please how can I proceed?

请先登录，再回答此问题。

回答（3 个）

József Szabó
József Szabó 2020-1-29
function x = solveGauss(A,b)
s = length(A);
for j = 1:(s-1)
for i = s:-1:j+1
m = A(i,j)/A(j,j);
A(i,:) = A(i,:) - m*A(j,:);
b(i) = b(i) - m*b(j);
end
end
x = zeros(s,1);
x(s) = b(s)/A(s,s);
for i = s-1:-1:1
sum = 0;
for j = s:-1:i+1
sum = sum + A(i,j)*x(j);
end
x(i) = (b(i)- sum)/A(i,i);
end
  2 个评论
Tyvaughn Holness
Tyvaughn Holness 2020-3-28
编辑：Tyvaughn Holness 2020-3-29
Great work, thanks! I found a faster implementation that avoids the double for loop to reduce complexity and time.
https://www.youtube.com/watch?v=juDxSMpzv6c

请先登录，再进行评论。

Richard Brown
Richard Brown 2012-7-12
The function you want is LU
[L, U] = lu(K);
The upper triangular matrix resulting from Gaussian elimination with partial pivoting is U. L is a permuted lower triangular matrix. If you're using it to solve equations K*x = b, then you can do
x = U \ (L \ b);
or if you only have one right hand side, you can save a bit of effort and let MATLAB do it:
x = K \ b;
  2 个评论
Lukumon Kazeem
Lukumon Kazeem 2012-7-12
Thank you Richard for your response. I have used this approach a no. of times ([L U]=lu(k)) and the results are always different from that in published literature. I suspect it's because it performs partial and not complete pivoting
Richard Brown
Richard Brown 2012-7-13
I wouldn't expect it would necessarily compare with published literature - what you get depends on the pivoting strategy (as you point out).
Complete pivoting is rarely used - it is pretty universally recognised that there is no practical advantage to using it over partial pivoting, and there is significantly more implementation overhead. So I would question whether results you've found in the literature use complete pivoting, unless it was a paper studying pivoting strategies.
What you might want is the LU factorisation with no pivoting. You can trick lu into providing this by using the sparse version of the algorithm with a pivoting threshold of zero:
[L, U] = lu(sparse(K),0);
% L = full(L); U = full(U); %optionally

请先登录，再进行评论。

James Tursa
James Tursa 2012-7-11
  2 个评论
Lukumon Kazeem
Lukumon Kazeem 2012-7-12
James, thank you for your response. I have tried to apply your suggestion to the matrix I posed earlier but it came up with the below prompt. What do you think?
"??? Undefined function or method 'gecp' for input arguments of type 'double'".
James Tursa
James Tursa 2012-7-13
You need to download the gecp function from the FEX link I posted above, and then put the file gecp.m somewhere on the MATLAB path.

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Linear Algebra 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by