page # 2

page # 3

page # 4

return 0 ;

}

Remark: Replace the lines 9 and 10 in the solution of Question 24 with the following code segment to receive the linear system at the execution time (instead of fixing in the code).

//------------------------- Input Section -----------------------------//

cout

for ( i=0 ; i

for ( j=0 ; j

cin >> a[i][j] ;

cout

for ( i=0 ; i

cin >> b[i] ;

I want these code to converted in PYTHON. it just a conversion don't make an excuse 1 question policy if u don't want to answer please leave my question will refunded.

#include using namespace std; #define n 3 // number of unknowns int main() Chapter 6 char quit ; int i, j, k,n,r; double a[n][n] = {{1.7, 2.3, -1.5} , {1.1, 1.6, -1.9} , {2.7,-2.2, 1.5}}; double b[n] = {2.35, -0.94, 2.7}; // right-hand side constants double x[n]; // solution vector double sum, temp, tempi, multiplier ; Direct Linear Solvers I // Processing Section // Forward Elimination Phase // Searching largest absolute coefficient in the ith column for partial pivoting Problem 03: Solve the following system using the Gaussian Elimination method with partial pivoting. Use four digits after decimal point. 1.7x + 2.3x, - 1.5x3 = 2.35 1.1x1 + 1.6x2 1.9x3 = -0.94 2.7x1 - 2.2x2 1.5x3 2.70 The required solution vector is given by, X = [1.0998, 2.0997, 2.8996]7. Question 21: Write a C++ program to solve the following linear system using the Gaussian Elimination method with partial pivoting. For simplification, specify the linear system within the program. for (i=0; i // Output Section temp = a[i][j]; a[i][j] = a[r][j]; a[r][i] = temp; cout> quit ; return 0; } //row replacement in the augmented matrix for eliminating the coefficient below the pivot multiplier = a[k][i] / a[i]); for(j=i+1; j=0; i--) { sum = 0.0 ; for(j=i+1; j using namespace std; # define n 3 cout> a[i]); int main() { char quit; int i, j,s; double a[n][n] = {{1.7, 2.3,-1.5} , {1.1, 1.6,-1.9} , {2.7, -2.2, 1.5}}; double b[n] = {2.35, -0.94, 2.7}; // right-hand side constant vector double x[n]; double u[n][n], [n][n], y[n], sum ; cout> b[i]; // Processing Section ------ // Formation of Land U as factors of A, i.e., A=LU for (i=0;i=0; i--) { (x3 = L=i+1 Wij;]) cin>> quit ; #include using namespace std; #define n 3 // number of unknowns int main() Chapter 6 char quit ; int i, j, k,n,r; double a[n][n] = {{1.7, 2.3, -1.5} , {1.1, 1.6, -1.9} , {2.7,-2.2, 1.5}}; double b[n] = {2.35, -0.94, 2.7}; // right-hand side constants double x[n]; // solution vector double sum, temp, tempi, multiplier ; Direct Linear Solvers I // Processing Section // Forward Elimination Phase // Searching largest absolute coefficient in the ith column for partial pivoting Problem 03: Solve the following system using the Gaussian Elimination method with partial pivoting. Use four digits after decimal point. 1.7x + 2.3x, - 1.5x3 = 2.35 1.1x1 + 1.6x2 1.9x3 = -0.94 2.7x1 - 2.2x2 1.5x3 2.70 The required solution vector is given by, X = [1.0998, 2.0997, 2.8996]7. Question 21: Write a C++ program to solve the following linear system using the Gaussian Elimination method with partial pivoting. For simplification, specify the linear system within the program. for (i=0; i // Output Section temp = a[i][j]; a[i][j] = a[r][j]; a[r][i] = temp; cout> quit ; return 0; } //row replacement in the augmented matrix for eliminating the coefficient below the pivot multiplier = a[k][i] / a[i]); for(j=i+1; j=0; i--) { sum = 0.0 ; for(j=i+1; j using namespace std; # define n 3 cout> a[i]); int main() { char quit; int i, j,s; double a[n][n] = {{1.7, 2.3,-1.5} , {1.1, 1.6,-1.9} , {2.7, -2.2, 1.5}}; double b[n] = {2.35, -0.94, 2.7}; // right-hand side constant vector double x[n]; double u[n][n], [n][n], y[n], sum ; cout> b[i]; // Processing Section ------ // Formation of Land U as factors of A, i.e., A=LU for (i=0;i=0; i--) { (x3 = L=i+1 Wij;]) cin>> quit<><><><-1><><><><-1><>

<>

<>