Question

Python Help（screen shot if you can）thx！

Consider the example found in the lecture notes: Example: A horizontal cantiever beam is subject to a uniform, vertical load. The beam extends from its clamped end (x 0) to its free end ( L). The beam has a maximum deflection δmar at L. The deflection δ at location x aL is related to δmax by: Use the incremental-search method to solve the value of α at which δ/6,nar is equal to 0.75. Develop a program that solves for the root with the following inputs 1 0.05 10 where the values represent x0, h, and N, respectively. The program should output to the screen the value of the root (with five decimal places) if found, otherwise the program should output to the screen Solution not found". Test the program with different values of x0, h, and N

Answer 1

CODE:

#defining beam function
def beam_func(a):
return a**4 - 4*a**3 + 6*a**2 - 3*0.75

#increment search method
def roots(x0, h, N):
  
# initial values for starting the method
x1 = x0
f1 = beam_func(x1)
x2 = x0 + h
f2 = beam_func(x2)
i = 0
#checking for change in sign while iterating
while(f1*f2 > 0):
if(i > N):
print("Solution Not Found")
return None
  
x1 = x2
f1 = f2
#incrementing with the step h
x2 = x1 + h
f2 = beam_func(x2)
i = i + 1
  
#root is in between x1 and x2 so we take average for approximation
return (x1 + x2)/2
  
def main():
n = int(input('How many times to run increment search method: '))
i = 0
while(i < n):
#taking input
x0 = int(input('Enter x0: '))
h = float(input('Enter h: '))
N = int(input('Enter N: '))
#print only if solution found
if(roots(x0, h, N) != None):
print("%4.5f" %roots(x0, h, N))
i = i + 1

main()

SCREENSHOT

In [6]: #defining beam function def beam_func (a): return a**4 - 4*a**3 6*a**23*0.75 #increment search method def roots(xe, h, N): # initial values for starting the method f1-beam_func (x1) f2-beam_func(x2) #checking for change in sign while iterating while(f142 > 0): print( "Solution Not Found") return None f1 f2 #incrementing with the step h x21 + h f2-beam_func (x2) #root is in between x1 and x2 so we take average for approximation return (xi + x2)/2

def main() n- int (input'How many times to run increment search method:)) while(i n): #taking input xe- int (input( Enter xe: ) h- float(input( Enter h: )) N -int (input( Enter N: )) #print only if solution found if (roots(xe, h, N)!- None): print("Solution: %4.5f" %roots(x8, h, N)) main()

How many times to run increment search method: 3 Enter xe: 1 Enter h: -0.05 Enter N: 10 Solution: 0.82500 Enter xe: 3 Enter h: 0.01 Enter N: 100 Solution Not Found Enter xe: -1 Enter h: 0.01 Enter N: 100 Solution: -0.51500

NOTE: Please take care of indentation while copying and pasting the code as the indentation is lost while pasting.

Please go though above code and comments and message me if you have any doubt.

Give me a thumbs up. Thanks.