Here is the problem I need help with: I need to write the answer in code form, b
ID: 3122968 • Letter: H
Question
Here is the problem I need help with:
I need to write the answer in code form, but not in full code. Somewhere about 3 to 9 lines of code. The answer I was able to come up with is this:
x[n] = b[n] / a[n];
x[n-1] = (b[n-1] – c[n]*x[n]) / a[n-1];
for (i = n-2; i > 0; i--){
x[i] = (b[i] – c[i+1]*x[i+1] – d[i+2]*x[i+2]) / a[i];
for (j = 1; i < n; i++)
a[i+1] = a[i+1] – (b[i]/a[i])*c[i+1]; //endfor
}//endfor
I'm not sure if this is the correct answer for this problem.
Write an et algorithm to soluko icient an n x n system On23 with nonzero dia aonals the form I n-3 A-2 n 2. te that A is non singular and that pinating YOU should first convert fo an Upper trt angularExplanation / Answer
This solution is correct. You may also check for different values of n and then run your algorithm. In general we just have to apply row reductions to convert this matrix into nice form, say upper triangular or lower traingular, once obtained then we can just apply substitution method. Your solution is correct.