<< Chapter < Page | Chapter >> Page > |
Figure 1. Torsion beam.
In this figure, we observe a situation in which forces are applied at each end of the beam. We also note that each force is applied at a right angle to the beam. Under such conditions, torque can be calculated as the product of the force and the length of the beam from its end to its support point atop the pivot point of the beam.
The force ( F 1 ) contributes a counter-clockwise torque ( T CCW ) on the beam. The value of this torque can be calculated
The force ( F 2 ) contributes a clockwise torque ( T CW ) on the beam. The value of this torque can be calculated as
Suppose that the beam is not in motion. Engineers would say that the beam is static or that the beam system is in equillibrium. A necessary condition for equillibrium of the system is that the two torques be equal, that is
We now will apply what we know about simultaneous equations to solve a problem involving a torsion beam.
Example 2: Assume that a a beam of length 56 inches is supported by a fulcrum. Force is applied at each end of the beam. Assume that the force ( F 1 ) on the left hand side of the beam is 24 lbs while the force on the right hand side of the beam ( F 2 ) is 32 lbs. If the beam is static, then what are the values of R 1 and R 2 ?
We know from that the clockwise and counter-clockwise torques must balance as a condition for equilibrium. This leads to the first equation that we will use to solve this problem
which can be written as
We also know that the overall length of the beam is 56 inches. Therefore,
which can be solved for R 1 as
We may substitute the expression for R 1 in equation () to obtain
Multiplication and rearrangement yield the equation
which can be solved for R 2 .
The value for R1 can be easily found as
Parallel processing is a term drawn from Compute Science that involves the simultaneous use of more than one central processing unit (CPU) to execute a program. Ideally, parallel processing makes programs run faster because there are more than one processors in use to execute the program. Though most computers have just one CPU, newer computer architectures that feature several CPU’s are becoming the norm more prevalent.
Example 3: Suppose that we are interested in implementing a computer algorithm on two processors. Let us call these processors A and B. The steps involved in the accomplishment of the algorithm are divided among the two processors. In all there are 17,000,000 computations which will need to be performed on the two processors. Working in parallel, the two processors accomplish the algorithm. In doing so, the processor A is in service for 3 seconds while the processor B is in services for 2 seconds.
Suppose that a second algorithm is to be accomplished by processors A and B working in parallel. In all, the second algorithm requires the execution of 15,500,000 computations. In executing the second algorithm, 2 seconds of computing time are required of processor A while 3 seconds of computing time are required of processor B.
Notification Switch
Would you like to follow the 'Math 1508 (laboratory) engineering applications of precalculus' conversation and receive update notifications?