Professional Documents
Culture Documents
Mach Prob1
Mach Prob1
MATH-15
MACHINE PROBLEM 1
Instructions:
Create a program to solve the given problems.
1. The Maximum Moment of a two wheel moving loads is given by the equation.
Mmax = (PL-Psd)2
4PL
where P = larger axle load, Ps = smaller axle load, d = the distance between the two-axle load and
L = the length of the structural support system or most commonly as beam and girders.
A two wheeled truck is traveling across a 10-meter span of bridge. Determine the smaller axle load
of the system having a Max moment of 150 kn, m and larger axle load of 70 kn. The distance
between the axle loads is 5 m.
Solve by using the following methods. (Excel)
a. Incremental search method to locate the lower and upper bound values of the root (start from
zero with increments of 2).
b. Bisection method (use the values obtain from the incremental search method as your lower and
upper bound values).
c. Regula Falsi method (use the values obtain from the incremental search method as your lower
and upper bound values).
Solve by using the following methods. (C++)
d. You can use either bisection or regula falsi in your code.
PREPARED BY: ENGR. JUDE B. SANTILLAN As pressure and stress bear down on me, I find
joy in your commands.
Psalm 119:143
NUMNERICAL SOLUTIONS TO CE PROBLEMS
MATH-15
MACHINE PROBLEM 1
Ls = V3
RC
where Ls is the length of spiral, V = the design speed, R as radius of simple curve and C as rate of change
of centripetal acceleration.
The length of spiral of a single carriageway is 89 m. The radius of the simple curve is 450 m. Assume the
that the rate of change of the centripetal acceleration is 0.32 m/s 3 Determine the design speed of the
carriageway.
Solve by using the following methods. (Excel)
a. Incremental search method to locate the lower and upper bound values of the root (start from zero
with increments of 2).
b. Bisection method (use the values obtain from the incremental search method as your lower and
upper bound values).
c. Regula Falsi method (use the values obtain from the incremental search method as your lower and
upper bound values).
Solve by using the following methods. (C++)
d. You can use either bisection or regula falsi in your code.
PREPARED BY: ENGR. JUDE B. SANTILLAN As pressure and stress bear down on me, I find
joy in your commands.
Psalm 119:143