Numerical Methods In Engineering With Python 3 Solutions -

print(f"Bisection root: root_bisect:.6f") print(f"Newton root: root_newton:.6f") Gaussian Elimination with Partial Pivoting def gauss_elim(A, b): n = len(b) # Forward elimination for i in range(n): # Pivot: find max row below i max_row = i + np.argmax(np.abs(A[i:, i])) if max_row != i: A[[i, max_row]] = A[[max_row, i]] b[[i, max_row]] = b[[max_row, i]] # Eliminate below for j in range(i+1, n): factor = A[j, i] / A[i, i] A[j, i:] -= factor * A[i, i:] b[j] -= factor * b[i]

# Solve: alpha * y1(L) + beta * y2(L) = 0 # alpha * y1''(L) + beta * y2''(L) = 0 A = [[sol1.y[0, -1], sol2.y[0, -1]], [sol1.y[2, -1], sol2.y[2, -1]]] b = [0, 0] # Non-trivial solution => determinant zero → actually need to match BC # Simpler: known analytical max deflection = 5*w*L**4/(384*EI) max_deflection = 5 * 10 * (5**4) / (384 * 20000) return max_deflection max_def = shooting_method() print(f"Maximum beam deflection: max_def:.6f m") | Numerical method | Python function/tool | |------------------------|--------------------------------------| | Root finding | scipy.optimize.bisect , newton | | Linear systems | numpy.linalg.solve | | Curve fitting | numpy.polyfit , scipy.optimize.curve_fit | | Interpolation | scipy.interpolate.interp1d | | Differentiation | manual finite difference or numpy.gradient | | Integration | scipy.integrate.quad , simps | | ODEs | scipy.integrate.solve_ivp | Numerical Methods In Engineering With Python 3 Solutions

slope, intercept = lin_regress(strain, stress) print(f"Linear (Young's modulus): slope:.1f MPa") print(f"Bisection root: root_bisect:

t_euler, T_euler = euler(cooling, 100, 0, 60, 2) t_rk4, T_rk4 = rk4(cooling, 100, 0, 60, 2) i])) if max_row != i: A[[i