Numerical Mathematics and Computing
Sixth Edition
Ward Cheney & David Kincaid
Brooks/Cole: Engage Learning (c) 2008
Errata
CHAPTER 1
-
Page, 29, Line 1-2 (reword):
If we stop after terms, at , then the error does not
exceed , which is the first neglected term.
-
Page, 29, End Solution Exp2.1.8 (add):
[The actual error after five terms is .]
CHAPTER 2
-
NMC7: Consider changing Marc-32 to Marc-64 with IEEE floating-point standard arithmetic thoughout.
-
Page 48, Example 2, Line 1:
Omit the first occurrence of "single-precision" to read:
"Determine the machine representation of the decimal number .."
-
Page 50, 1st Displayed Eqn (Line +9), Last inequality should read:
-
[
NMC7 Note:
(Page 51, Line 3):
The IEEE Standard does not define the terms
{&bf machine epsilon} and {&bf unit roundoff error} .
Frequently, they are used interchangeably or
some authors may define them as being different.
Machine epsilon is used to study the effect of
rounding errors because the actual errors of machine arithmetic are
extremely complicated. Program libraries may provide
precomputed values for these and other standard numerical quantites.
Often students are assigned the textbook exercise to compute
an approximate value for machine epsilon.
It is done in the sense of the spacing of the floating-point
numbers at 1 rather than in the sense of the unit roundoff error.
The following psuedo-code produces an approximation to machine
epsilon (within a factor of 2)
eps = 1.0
while (1.0 + eps > 1.0)
eps = eps/2.0
end
eps = 2.0*eps
As with any computational results,
it depends on the particular
computer platform used as well as the programming language,
the floating-point format
(float, double, long double, etc.), and the runtime library.
]
-
Page 70, Problem 2.2.24(a):
omit "nn" should read
-
Page 74, Computer Problem 2.2.19:
Change sign of the last term in the demoninator from plus to minus:
-28.17694u^6
CHAPTER 3
-
Page 87, Problem 3.1.21, Lines 1-2:
Replace with and
replace with
-
Page 120, Problem 3.3.10, Line -1, Rewrite to read:
Establish this. Explore the conjecture that the standard form may be more
numerically stable and may have better achievable accuracy.
CHAPTER 4
-
Page 127, Line 9:
Omit to read:
..., and .
-
Page 140, Line -3 above Figure 4.4: Should read:
... as shown in Figure 4.3.
-
Page 144, Line -1 above pseudo-code:
Replace subscript with subscript to read:
... to evaluate when ...
-
Page 144, Last line in pseudo-code:
Replace subscript with subscript to read:
return
-
Page 147, Problem 4.1.9b:
Change Hint to read:
Use polynomial starting with 93 and involving factors .
-
Page 154, Line +2 in Solution after FIGURE 4.6:
Replace with to read:
... we added the points , , and ...
-
Page 156, Figure 4.9:
FIGURE 4.9,
Label should read: Chebyhev nodes of .
-
Page 156, Figure 4.9:
Change x-axis from -5 to 5 to -1 to 1.
-
Page 156, Line 1, Should read:
The Chebyshev nodes of are obtained by taking equally-spaced
points
on the unit circle
and projecting them onto the horizontal axis, as in Figure 4.9.
-
[
NMC7 Note:
Page 156, Figure 4.9:
Modify Figure 4.9 as shown below.
Leave center points above 0 and dashed line as is.
Move four points on right side of the semi-circle so that the
first four are equally spaced (20 degrees apart)
and the last one is half the distance (10 degrees),
with no point at the right end of the x-axis.
Repeat for the four points on the left side of the semi-circle.
Dashed lines and points on the x-axis are to be moved relative
to the above movement of points.
[
NMC7 Note:
Nine points on the semi-circle are
not all evenly spaced but at
10, 30, 50, 70, 90, 110, 130, 150, 170 degress (counterclockwise).
The points on the unit circle are
with
and .]
-
Page 167, 4th line from bottom:
Replace by
-
Page 169,
Algorithm 2, Step 4:
Replace by
-
Page 173, Line 5:
Replace the superscript (v) by the superscript (5).
-
Page 175, Line 4:
Replace the superscript (v) by the superscript (5).
CHAPTER 5
-
Page 198, first and third displayed equations:
Replace h by n (four times).
-
Page 199, Summary (2), last line:
where the error is
-
Page 201, Problem 5.2.17(d):
Minus sign should be plus sign to read:
-
Page 210, first table: should be .
CHAPTER 6
-
Page 217, second displayed equation, insert missing "1 =" to read:
\int_0^1 dx = 1 = A + B
-
Page 218, Line 9:
Linear mapping is missing an x.
Should read:
-
Page 219, first displayed equation, replace limits of integral -1 to 1
with 0 to 1
-
Page 219,
first three displayed equations, replace ds with dx.
-
Page 234, Example 3,
second = should be \approx
-
Page 235, THEOREM 2, WEIGHTED GAUSSIAN QUADRATURE THEOREM,
last displayed equation replace first with script
to match its second appearance in righthand integral.
CHAPTER 7
-
Page 258, Computer Problem 7:
Modify to read:
7. (Continuation) A common electrical engineering problem is to calculate
currents in an electric circuit. For example, suppose a circuit
leads to this complex system:
.... [leave linear system as is]
Letting volts, solve these two cases:
a. ... [leave as is]
b. ... [leave as is]
Using the complex arithmetric version of {\sl Naive\_Gauss},
solve the system for each case.
[Omit rest of problem statement as well as the figure.]
-
Page 272, Line 8:
Multiplier should be
in both equations.
-
Page 274, Problem 13d:
Add symbol "a" indicating answer in back of book.
-
Page 291, Problem 22:
Last entry in top diagonal should be "1" not "-1"
CHAPTER 8
-
Page 333, line 6:
Sentence not complete:
add "is"
-
Page 340, Problem 10, last line of coefficient matrix:
Should be 4/3 -6 12
-
Page 341, Problem 11, last line of righthand-side matrix:
Should be 2.5
-
Page 369, Computer Problem 6b: should read
CHAPTER 9
-
Page 382, Problem 9.1.9:
Should read: Hint: Use Problem 7 and assume equally spaced knots.
-
Page 389, Example 2, Solution, Line 3:
Should read:
-
Page 395, Example 4, line -2:
should be
CHAPTER 9
-
Page 446, Probelm 10.2.12, Change to read:
"... if ten decimal places of accuracy , are required.
Assume that you use a computer with adaquate precision, and
assume that the fourth-order Runge-Kutta method involves truncation
errors of maginitude .
CHAPTER 10
-
Page 445, Problem 10.2.6:
Change to .
CHAPTER 13
-
Page 536, pseudocode Coarse_Check, Line 9, should be:
per = 100*real(m)/real(i)
CHAPTER 14
-
Page 571, Last Displayed Equation:
()
CHAPTER 16
-
Page 637, Problem 15d:
Add symbol "a" indicating answer in back of book.
APPENDIX
-
Page 715, Lines 8, 17:
Entry (3,1) should read ⅓ not -8 (twice)
ANSWERS
-
Page 724, Solution Pb 1.1.8c:
Replace 10 with 16, to read:
-
Page 727, Solution Pb 3.1.21:
Replace with
-
Page 729, Solution Pb. 4.1.9a:
Change boxes in the difference table from
around numbers in second downward diagonal from the top
(9, 14, 7, 1) to
the second upward diagonal from the bottom
(93, 35, 7, 1)
-
Page 729, Solution Pb. 4.1.9b:
Change to read: f(4.2)\approx 104.488
-
Page 731, Solution CPb 5.3.6:
Insert minus signs to read:
-
Page 732, Computer Problems 7.1.7, should read:
7a.
, ,
7b.
, ,
-
Page 733, Solution CPb 8.1.2a:
In element (4,2) change 0 to 6.
-
Page 734, Solution Pb 9.1.9:
Replace with: Knots
-
Page 736, Soluton Pb 10.2.12:
Replace with only: .
-
Page 744, Problem B, 4g:
Should be
BIBLIOGRAPHY
-
Page 753, column 1:
van der Vorst should be lower case "v"
COVERS
-
Inside back cover (left side), integral formulas.
First should be
and other two should be
-
Inside back cover (right side), line 5:
smaller parens for
Student Solutions Manual for Numerical Mathematics and Computing
Sixth Edition
Ward Cheney \& David Kincaid
Brooks/Cole: Engage Learning (c) 2008
Errata
-
Page 2, Solution Pb 1.1.8c:
Replace 10 with 16, to read:
-
Page 22, Solution 3.1.21, Line 1-2:
Should read:
Now so
and .
-
Page 36, Solution 4.1.9:
Change boxes in the difference table from
around numbers in second downward diagonal from the top
(9, 14, 7, 1) to
the second upward diagonal from the bottom
(93, 35, 7, 1)
-
Page 37, Solution 4.1.9b:
Change to read:
,
,
We obtain the same polynomial using either the top diagonal downward
or the second diagonal upward! Notice that
and
.
-
Page 38, Solution 4.1.18, Line -1:
Should read:
-
Page 55, Solution CPb 5.3.6:
-
Page 67, Computer Problems 7.1.7, should read:
7a.
, ,
7b.
, ,
Instructor Solutions Manual for Numerical Mathematics and Computing
Sixth Edition
Ward Cheney & David Kincaid
Brooks/Cole: Engage Learning (c) 2008
Errata
-
Page 2, Solution Pb 1.1.8c:
Replace 10 with 16, to read:
-
Pb 1.2.17, change to read:
After terms, the first neglected term is
and .
-
Cp 1.1.17, last displayed equation should read:
-
Cp 1.2.54, change to read:
We have
.
The convergence of this series is very slow requiring an extremely
large number of terms! For example, terms gives a relative error of
.` This is no a practial way of computing !
-
Pb 2.1.2d: line 3 should read: ...=(001\ 111\ 010)_2
-
Pb 3.1.10:
This problem involves the comparison of two different forms for the
secant method, which are equivalent in exact arithmetic.
This conjecture was shown to be
somewhat confirmed by numerical tests, but the difference
was not significant enough to pay much attention to it.
-
Pb 3.2.17, line 1:
replace "(-term)" with "(general term)
-
Page 55, Solution 3.1.21, Line 1-2:
Should read:
Now so
and .
-
Page 79, Solution 4.1.9:
Change boxes in the difference table from
around numbers in second downward diagonal from the top
(9, 14, 7, 1) to
the second upward diagonal from the bottom
(93, 35, 7, 1)
-
Page 79, Solution 4.1.9b:
Change to read:
,
,
We obtain the same polynomial using either the top diagonal downward
or the second diagonal upward! Notice that
and
.
-
Page 80, Solution 4.1.18, Line -1:
Should read:
-
Page, 91, Solution 3.3.10, add to end:
The standard form is more numerically stable and has a better
achievable accuracy. This may be confirmed by numerical experiments, but
the difference between these two forms may not be significant
enough for paying much attention to it!
-
Page 123, Solution CPb 5.3.6:
-
Page 142, Computer Problems 7.1.7, should read:
7a.
, ,
7b.
, ,
Acknowledgements:
We welcome comments and suggestions concerning either the textbook or solution
manuals. Send email to
Ward Cheney
or
David Kincaid .
We are grateful to the following individuals and others who have
send us email concerning typos and errors in the textbook or
solution manuals:
Bernard Bialecki,
Fatih Celiker,
Debao Chen,
Lloyd Clark,
Roger Crawfis,
Mohamad El Gharamti,
John Eisenmenger,
Richard Fa Wai,
Scott Hency,
Jason S. Howell,
Harunrashid Muhammad,
Victoria Interrante,
Andrew Knyazev,
Jacob Y Kazakia,
Daniel Kopelove,
Kevin Lee,
Stacy Long,
Igor Malkiman,
Peter McNamara,
Yuan Xu,