Your Results For "Review Questions 11.1": Site Title: Mechanical Vibrations Location On Site: Date/Time Submitted

1/31/2021 Your Results for "Review Questions 11.
1"
Your Results for "Review Questions 11.1" Print this page
Site Title: Mechanical Vibrations Summary of Results

Location on Home > Review Questions > Chapter 11:
All 10 questions in this activity are essays, which are not
Site: Two Degree of Freedom System > Review
scored by the system.
Questions 11.1
Date/Time January 31, 2021 at 2:01 PM (UTC/GMT) You answered 10 questions, and left 0 questions blank.
Submitted: More information about scoring
1. Describe the procedure of the finite difference method.

Your Answer:
d
The governing differential equation and the associated boundary conditions are replaced by finite
difference equations. For this, each derivative is replaced by its finite difference equivalence. This leads
to a system of linear algebraic equations instead of a differential equation.
2. Derive the central difference formulas for the first and the second derivatives of a function, using
Taylor’s series expansion.
Your Answer:
d
The Taylor’s series expansions for and can be expressed about the grid point i as
(E.1)
(E.2)
where and By taking two terms only and substracting Eq.(E.2) from
(E.1) , we get the central difference formula for the first derivative as
(E.3)
By taking three terms only and adding Eqs.(E.1) and (E.2), we get the central difference formula for
the second derivative as
(E.4)
3. What is a conditionally stable method?

Your Answer:
d
A conditionally stable method is a numerical method that requires the use of the time step ( )
smaller than a critical time step ( ). If is chosen to be larger than , the method becomes
unstable.
https://wps.prenhall.com/wps/grader 1/3
1/31/2021 Your Results for "Review Questions 11.1"
4. What is the main difference between the central difference method and the Runge-Kutta method?
Your Answer:
d
The Runge-Kutta method requires the function value at a single previous point to find the function
value at the current point. The central-difference method requires function values at two previous
points to find the function value at the current point.
5. Why is it necessary to introduce fictitious mesh points in the finite difference method of solution?
Your Answer:
d
If a derivative is to be approximated at a boundary point using the finite difference method, it may
require the use of the function value at a grid point outside the material (which is called a fictitious grid
point). For example, if at a boundary (grid point i), the use of central difference approximation
gives
where with –1 denoting a fictitious grid point.
6. Define a tridiagonal matrix.

Your Answer:
d
Tridiagonal matrix is a square matrix that has non-zero elements only along the main diagonal and
each diagonal that lies on either side of the main diagonal.
7. What is the basic assumption of the Wilson method?

Your Answer:
d
The acceleration of the system is assumed to vary linearly between two instants of time, and .
8. What is a linear acceleration method?

Your Answer:
d
Linear acceleration method is one in which the acceleration is assumed to vary linearly between two
time stations and so that
( E.1 )
where and . By integrating Eq. ( E.1 ) once and twice, we can find expressions
for the velocity and displacement , respectively.
9. What is the difference between explicit and implicit integration methods?

Your Answer:
d
If a numerical integration method requires the use of the equilibrium equation at time to find the
solution , it is called an implicit integration method. If a numerical integration method requires the
values of the response at previous time steps and , including the use of the equilibrium equation
at time , to find the value of the response at , the method is known as an explicit integration
method.
10. Can we use the numerical integration methods discussed in this chapter to solve nonlinear vibration
problems?
Your Answer:
d
No, not directly.
E-mail Your Results
My name is (first last):
E-mail my results to:
E-mail address: Send as:
Me: Text
Instructor: Text
TA: Text
Other: Text
Help E-Mail Results
Copyright © 1995-2010, Pearson Education, Inc., publishing as Pearson Prentice Hall | Legal and Privacy Terms

63% Correct of 8 items:
5 correct: 63%
Questions 11.2
3 incorrect: 38%
Date/Time January 31, 2021 at 2:00 PM (UTC/GMT)
1. The grid points in the finite difference methods are required to be uniformly spaced.
Your Answer: True

Correct Answer: False
2. The Runge-Kutta method is stable.
Your Answer: True
3. The Runge-Kutta method is self-starting.
Your Answer: True
4. The finite difference method is an implicit integration method.
Your Answer: True

5. The Newmark method is an implicit integration method.
Your Answer: True
6. For a beam with grid points –1, 1, 2, 3, ... the central difference equivalence of the
condition is .
Your Answer: True
7. For a beam with grid points –1, 1, 2, 3, ... the central difference approximation of a
simply supported end condition at grid point 1 is given by .
Your Answer: True

8. For a beam with grid points –1, 1, 2, 3, ... the central difference approximation of
yields .
Your Answer: True
E-mail Your Results
Me: Text
Instructor: Text
TA: Text
Other: Text
Help E-Mail Results

0 correct: 0%
Questions 11.3
8 incorrect: 100%
1. Numerical methods are to be used when the equations of motion cannot be solved in
__________ form.
Your Answer: s
Correct Answer: closed
2. In finite difference methods, approximations are used for __________.
Your Answer: s
Correct Answer: derivatives
3. Finite difference equations can be derived using __________ different approaches.
Your Answer: s
Correct Answer: three
4. In finite difference methods, the solution domain is to be replaced by __________

points.
Your Answer: s
Correct Answer: mesh/grid
5. The finite difference approximations are based on __________ series expansion.
Your Answer: s
Correct Answer: Taylor’s
6. Numerical methods that require the use of a time step (Δt) smaller than a critical value
(Δtcri) are said to be __________ stable.
Your Answer: s
Correct Answer: conditionally
7. In a conditionally stable method, the use of Δt larger than Δtcri makes the method
__________ .
Your Answer: s
Correct Answer: unstable
8. A __________ formula permits the computation of from known values of
Your Answer: s
Correct Answer: recurrence
E-mail Your Results
Me: Text
Instructor: Text
TA: Text
Other: Text
Help E-Mail Results

5 correct: 50%
Questions 11.4
5 incorrect: 50%
1.
The central difference approximation of at ti is given by:
Your Answer:
Correct Answer:
2.
The central difference approximation of at ti is given by:
Your Answer:
Correct Answer:
3. An integration method in which the computation of xi+1 is based on the equilibrium

equation at ti is known as:
Your Answer: explicit method
4. In a non self-starting method, w need to generate the value of the following quantity
using the finite difference approximations of and :
Your Answer:
Correct Answer:
5. Runge-Kutta methods find the approximate solutions of :
Your Answer: differential equations
6.
The finite difference approximation of at xi is given by:
Your Answer:
7. The finite difference method requires the use of finite difference approximations in:
Your Answer: governing differential equation as well as boundary conditions
8. If a bar under longitudinal vibration is fixed at node 1, the forward difference formula
gives:
Your Answer:
Correct Answer:
9. If a bar under longitudinal vibration is free at node 1, the forward difference formula
gives:
Your Answer:
10.
The central difference approximation of at grid point i with step size
h is:
Your Answer:
Correct Answer:
E-mail Your Results
Me: Text
Instructor: Text
TA: Text
Other: Text
Help E-Mail Results

1 correct: 17%
Questions 11.5
5 incorrect: 83%
Submitted: 1 total question in quiz (with 1 question containing
multiple pairs), for a total of 6 scored items. More
information about scoring
1. Match the following:
Option Your Answer Correct Answer
1.1 Houbolt A. same as Wilson method with E. uses finite difference

method expressions for and in
terms of , , and
1.2 Wilson B. based on the solution of F. assumes that acceleration

method equivalent system of first order varies linearly between and
equations
1.3 Newmark C. assumes that acceleration C. assumes that acceleration

method varies linearly between and varies linearly between and
; can lead to negative damping ; can lead to negative damping
1.4 Runge- D. conditionally stable B. based on the solution of

Kutta equivalent system of first order
method equations
1.5 Finite E. uses finite difference D. conditionally stable

difference expressions for and in
method
terms of , , and
1.6 Linear F. assumes that acceleration A. same as Wilson method with

acceleration varies linearly between and
method
E-mail Your Results
Me: Text
Instructor: Text
TA: Text
Other: Text
Help E-Mail Results

Your Results For "Review Questions 11.1": Site Title: Mechanical Vibrations Location On Site: Date/Time Submitted

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Your Results For "Review Questions 11.1": Site Title: Mechanical Vibrations Location On Site: Date/Time Submitted

Uploaded by

Copyright:

Available Formats

1/31/2021 Your Results for "Review Questions 11.

Your Results for "Review Questions 11.1" Print this page

Site Title: Mechanical Vibrations Summary of Results

1. Describe the procedure of the finite difference method.

3. What is a conditionally stable method?

where with –1 denoting a fictitious grid point.

6. Define a tridiagonal matrix.

7. What is the basic assumption of the Wilson method?

8. What is a linear acceleration method?

9. What is the difference between explicit and implicit integration methods?

No, not directly.

E-mail Your Results

My name is (first last):

E-mail my results to:

E-mail address: Send as:

Help E-Mail Results

Your Results for "Review Questions 11.2" Print this page

Site Title: Mechanical Vibrations Summary of Results

Your Answer: True

2. The Runge-Kutta method is stable.

Your Answer: True

3. The Runge-Kutta method is self-starting.

Your Answer: True

4. The finite difference method is an implicit integration method.

Your Answer: True

5. The Newmark method is an implicit integration method.

Your Answer: True

Your Answer: True

simply supported end condition at grid point 1 is given by .

Your Answer: True

Your Answer: True

E-mail Your Results

My name is (first last):

E-mail my results to:

E-mail address: Send as:

Help E-Mail Results

Your Results for "Review Questions 11.3" Print this page

Site Title: Mechanical Vibrations Summary of Results

2. In finite difference methods, approximations are used for __________.

3. Finite difference equations can be derived using __________ different approaches.

4. In finite difference methods, the solution domain is to be replaced by __________

5. The finite difference approximations are based on __________ series expansion.

8. A __________ formula permits the computation of from known values of

E-mail Your Results

My name is (first last):

E-mail my results to:

E-mail address: Send as:

Help E-Mail Results

Your Results for "Review Questions 11.4" Print this page

Site Title: Mechanical Vibrations Summary of Results

3. An integration method in which the computation of xi+1 is based on the equilibrium

Your Answer: explicit method

5. Runge-Kutta methods find the approximate solutions of :

Your Answer: differential equations

Your Answer: governing differential equation as well as boundary conditions

E-mail Your Results

My name is (first last):

E-mail my results to:

E-mail address: Send as:

Help E-Mail Results

Your Results for "Review Questions 11.5" Print this page

Site Title: Mechanical Vibrations Summary of Results

1. Match the following: