Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

(M) Compute the stifness matrix \({D^{ - {\bf{1}}}}\) for \(D\) in Exercise 39. List the forces needed to produce a deflection of .04 in. at point, with zero deflection at other points.

Short Answer

Expert verified

\(\left( {0,\, - 5,\;10} \right)\;{\rm{pounds}}\)

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Find the inverse of matrix D

Let \(D = \left( {\begin{aligned}{*{20}{c}}{.005}&{.002}&{.001}\\{.002}&{.004}&{.002}\\{.001}&{.002}&{.005}\end{aligned}} \right)\).

Use the code inMATLAB to find the inverse of D.

\( > > \,\,D = \left( {\begin{aligned}{*{20}{c}}{.005}&{.002}&{.001;\,\begin{aligned}{*{20}{c}}{.002}&{.004}&{.002;\,\,\begin{aligned}{*{20}{c}}{.001}&{.002}&{.005}\end{aligned}}\end{aligned}}\end{aligned}} \right)\)

\( > > {\rm{U}} = {\rm{Inv}}\left( D \right)\)

So, the inverse matrix is \({D^{ - 1}} = 125\left( {\begin{aligned}{*{20}{c}}2&{ - 1}&0\\{ - 1}&3&{ - 1}\\0&{ - 1}&2\end{aligned}} \right)\).

02

Solve the equation \(f = {D^{ - 1}}y\)

The deflection matrix is \(\left( {\begin{aligned}{*{20}{c}}0\\0\\{.04}\end{aligned}} \right)\).

Use the equation \(f = {D^{ - 1}}y\).

\(\begin{aligned}{c}f = 125\left( {\begin{aligned}{*{20}{c}}2&{ - 1}&0\\{ - 1}&3&{ - 1}\\0&{ - 1}&2\end{aligned}} \right)\left( {\begin{aligned}{*{20}{c}}0\\0\\{.04}\end{aligned}} \right)\\ = 125\left( {\begin{aligned}{*{20}{c}}0\\{ - .04}\\{.08}\end{aligned}} \right)\\ = \left( {\begin{aligned}{*{20}{c}}0\\{ - 5}\\{10}\end{aligned}} \right)\end{aligned}\)

So, the force required to produce the deflection at point 3 is \(\left( {0,\, - 5,\;10} \right)\;{\rm{pounds}}\).

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Suppose Ais an \(n \times n\) matrix with the property that the equation \(Ax = 0\)has only the trivial solution. Without using the Invertible Matrix Theorem, explain directly why the equation \(Ax = b\) must have a solution for each b in \({\mathbb{R}^n}\).

Use matrix algebra to show that if A is invertible and D satisfies \(AD = I\) then \(D = {A^{ - {\bf{1}}}}\).

If Ais an \(n \times n\) matrix and the equation \(A{\bf{x}} = {\bf{b}}\) has more than one solution for some b, then the transformation \({\bf{x}}| \to A{\bf{x}}\) is not one-to-one. What else can you say about this transformation? Justify your answer.

If a matrix \(A\) is \({\bf{5}} \times {\bf{3}}\) and the product \(AB\)is \({\bf{5}} \times {\bf{7}}\), what is the size of \(B\)?

Let \(A = \left( {\begin{aligned}{*{20}{c}}{\bf{1}}&{\bf{2}}\\{\bf{5}}&{{\bf{12}}}\end{aligned}} \right),{b_{\bf{1}}} = \left( {\begin{aligned}{*{20}{c}}{ - {\bf{1}}}\\{\bf{3}}\end{aligned}} \right),{b_{\bf{2}}} = \left( {\begin{aligned}{*{20}{c}}{\bf{1}}\\{ - {\bf{5}}}\end{aligned}} \right),{b_{\bf{3}}} = \left( {\begin{aligned}{*{20}{c}}{\bf{2}}\\{\bf{6}}\end{aligned}} \right),\) and \({b_{\bf{4}}} = \left( {\begin{aligned}{*{20}{c}}{\bf{3}}\\{\bf{5}}\end{aligned}} \right)\).

  1. Find \({A^{ - {\bf{1}}}}\), and use it to solve the four equations \(Ax = {b_{\bf{1}}},\)\(Ax = {b_2},\)\(Ax = {b_{\bf{3}}},\)\(Ax = {b_{\bf{4}}}\)\(\)
  2. The four equations in part (a) can be solved by the same set of row operations, since the coefficient matrix is the same in each case. Solve the four equations in part (a) by row reducing the augmented matrix \(\left( {\begin{aligned}{*{20}{c}}A&{{b_{\bf{1}}}}&{{b_{\bf{2}}}}&{{b_{\bf{3}}}}&{{b_{\bf{4}}}}\end{aligned}} \right)\).
See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free