Accuracy and Stability of Numerical Algorithms,
Second edition
by
Nicholas J. Higham, SIAM, 2002.
Errors
In the list below, line numbers do not include tables.
First Printing

Page 585, in the second table "mmsmax" should be "nmsmax".

Page 519, line 5:
the MATLAB statement "charpoly(P)" is not valid in current versions of
MATLAB and should be replaced by "poly(sym(P))".

Page 198, line 3: change
abs(\rhat_i^T \rhat_j) to abs(\rhat_i^T)abs(\rhat_j).

Page 517, Theorem 28.1 should read as follows:
Let the independent vectors $x_i \in \R^{ni+1}$ have elements from the
normal $\N(0,1)$ distribution for $i=1\colon n$.
Let $P_i = \diag(I_{i1}, \Pbar_i)$,
where $\Pbar_i$ is the Householder transformation that
reduces $x_i$ to $r_{ii}e_1$, for $i=1\colon n1$.
Then the product
$Q = D P_1 P_2 \dots P_{n1}$ is a random orthogonal matrix from the Haar
distribution, where $D = \diag(\sign(r_{ii}))$
and $r_{nn} = \sign(x_n)$.

Page 499, first line of Section 27.8:
replace "it estimated" by "is estimated".
Second Printing

Page 106, line 4 should read
"$\overline{x}_i y_i$ lies on the same ray".

On page 123, in (7.10) and several other places
"Ex" should be "Ex".

On page 123, two lines before (7.13)
$f = b$ should read $f = 0$.

On page 127, in the last line of Theorem 7.8 there is a missing x: the
parenthesized equation should read
$AA^{1}x = \rho(AA^{1}) x$.

On page 128, the second displayed equation should begin
$\rho_0(A) =$.

The curve for complete pivoting in Figure 9.2 on page 169 is
incorrect. It should grow more rapidly and reach about 10^6 at the
righthand end point.

On page 102, in the displayed equations P_1(x) should read P_1(X)
and P_3(x) should read P_3(X).

Page 143, line 6: should read
$\cond(U(\alpha), e) = \cond(U(\alpha)) \sim 2(1+\alpha)^{n1}$ as $\alpha \to \infty$.

On page 168, line 7 should read
"Note that
$\theta$ satisfies
$\kappa_{\infty}(A)^{1} \le \theta \le n^2 \kappa_{\infty}(A)^{1}$."

On page 223, in (11.15) the expression for x should read
x = P^Tw.

On page 360,
line 3 $n$ should be $m$ and this carries though into the two
following $\sqrt{n}$ changing to $\sqrt{m}$.
Back to the Accuracy and Stability of Numerical Algorithms
home page.