Numerical Algorithms Methods For Computer Vision Machine Learning and Graphics 1st Solomon Solution Manual
Numerical Algorithms Methods For Computer Vision Machine Learning and Graphics 1st Solomon Solution Manual
http://testbankbell.com/product/numerical-methods-and-optimization-an-
introduction-1st-butenko-solution-manual/
http://testbankbell.com/product/numerical-methods-in-engineering-with-
matlab-3rd-kiusalaas-solution-manual/
http://testbankbell.com/product/solution-manual-for-computer-graphics-
with-open-gl-4-e-4th-edition-0136053580/
http://testbankbell.com/product/test-bank-for-choices-in-
relationships-an-introduction-to-marriage-and-the-family-11th-edition-
knox/
Test Bank for Biochemistry, 9th Edition, Mary K. Campbell,
Shawn O. Farrell Shawn O. FarrellOwen M. McDougal
http://testbankbell.com/product/test-bank-for-biochemistry-9th-
edition-mary-k-campbell-shawn-o-farrell-shawn-o-farrellowen-m-
mcdougal/
http://testbankbell.com/product/test-bank-for-family-therapy-an-
overview-8th-edition/
http://testbankbell.com/product/nclex-pn-2020-nclex-pn-practice-
questions-bank-with-rationale/
Test Bank For Social Studies for the Elementary and Middle
Grades: A Constructivist Approach, 4/E 4th Edition
http://testbankbell.com/product/test-bank-for-social-studies-for-the-
elementary-and-middle-grades-a-constructivist-approach-4-e-4th-
edition/
http://testbankbell.com/product/test-bank-for-pharmacology-for-nurses-
a-pathophysiological-approach-1st-edition-michael-patrick-adams-
download/
Solution Manual for Introduction to Management Science,
11/E 11th Edition Bernard W. Taylor
http://testbankbell.com/product/solution-manual-for-introduction-to-
management-science-11-e-11th-edition-bernard-w-taylor/
3
1 2
In×n − A (2In×n − 4A) = In×n − 2A − 2A + 4A
2
= In×n − 2A − 2A + 4A since A is idempotent
= In×n
(d) Aτx = λτx =⇒ A2 τx = λAτx = λ2 τx. But A2 = A, so A2 τx = Aτx = λτx. Thus, λτx = λ2 τx =⇒ λ = λ2 =⇒
λ ∈ {0, 1}.
1.16. The product AB is of size n2 . Obviously finding AB requires considering each element of AB at least once
(if nothing else, to write the result in memory!), already requiring O(n2 ) time even if each element of AB is
computed in O(1) time. The algorithms in the figure take O(n3 ) time to run due to the nested loops. Hence,
there is room for improvement, and indeed Strassen’s algorithm and several others achieve faster than O(n3 )
asymptotic runtime, at least for large n.
1.17. Define λ(τx) ≡ − ln p(τx). Since ln is monotonic, any local maximum of p(τx) is also a local maximum of λ(τx).
Hence, τx∗ is a critical point of λ(τx), implying ∇ λ(τx∗ ) = τ0. Let H be the Hessian of λ at τx∗ . Then, near τx∗ we
can approximate:
1 1
− ln p(τx) = λ(τx) ≈ λ(τx∗ ) + (τx − τx∗ ) H (τx − τx∗ ) = − ln p(τx∗ ) + (τx − τx∗ ) H (τx − τx∗ ).
2 2
The first derivative term of the expansion vanishes since ∇ λ(τx∗ ) = τ0. Exponentiating both sides shows
P̄ V PV V P̄ P
− = −
RT̄ RT R T̄ T
δP T − P δT
=n
P (T + δT )
δP T − P δT T ε P + P εT
≤
P (T + δT ) P (T − εT )
PV (100 Pa)(0.5 m3 )
n= = = 0.0201 mol
RT (8.31 J · mol−1 · K−1 )(300 K)
(101 Pa)(0.5 m3 )
= 0.0203 mol = n + 0.000234 mol = n + 1.17%.
(8.31 J · mol−1 · K−1 )(299.5 K)
The smallest possible value is
(99 Pa)(0.5 m3 )
= 0.0198 mol = n − 0.000234 mol = n − 1.17%.
(8.31 J · mol−1 · K−1 )(300.5 K)
Hence, the absolute error is bounded by 0.0198 mol and the relative error is bounded by 1.17%.
(d) At the range indicated by the problem, it is relatively well-conditioned. When the scale of εT is commen-
surate with that of T , the problem becomes ill-conditioned.
2.3. We can understand the relative error as the fraction
∆y|/|y| x∆y
|
κrel = = ,
|∆x|/|x| y∆x
where y + ∆y = f (x + ∆x) and y = f (x). By Taylor’s theorem, f (x + ∆x) = y + f (x)∆x + O(∆x2 ). Hence,
∆y = f (x)∆x + O(∆x2 ), so for small ∆x,
x · f (x)∆x xf (x)
κrel ≈ = .
f (x) · ∆x f (x)
∆y
≈ |f (x)| .
∆x
The function f (x) = ln x has a large relative condition number near x = 1, since κrel = 1/ln x, which blows up
near x = 1. Contrastingly, the function f(x) = x has relative condition number 1 for all x.
2.4. Since minima are roots of f , we can use the conditioning for root-finding, but with an extra derivative:
(a) |xest − x∗ |
(b) |f (xest ) − f (x∗ )| ≈ δx|f (x∗ )|
2.5. (a) The range is (−∞, 0] since limt→0 log t = −∞ and log 1 = 0.
(b) If the xk is very negative, then exk is exponentially close to zero. This near-zero value may not be repre-
sentable, and regardless a single slightly larger value will dominate the sum.
χ(x1 , . . . , xn ) = ln e xk by definition
k
= ln exk −a+a
k
= ln ea exk −a
k
= ln ea + ln exk −a
k
= a + ln exk −a
k
Suppose we take a = mink xk . Then, rather than adding together tiny values we have moved the scale to
be around e0 = 1. (Other heuristics for choosing a are possible)
2.6. There are rendering artifacts because the two surfaces overlap and hence have the same depth values; rounding
during depth computation can make one surface appear on top of the other. Possible resolutions include
slightly offsetting one surface, adding a tie-breaking rule when depths are within some tolerance of each other,
or merging the geometry before rendering to avoid overlap altogether.
2.7. (a) Recall that floating point arithmetic changes spacing as the order of magnitude of the value changes. Thus,
it makes sense to have multiplicative error that is relative to the scale of x and y.
(b) (adapted from course notes by D. Bindel, Cornell CS) The recurrence for the ground-truth sum is simply
sk = sk−1 + xk yk . Error terms for the addition and multiplication steps show
ŝk = (ŝk−1 + xk yk (1 + ε×k ))(1 + εk+).
Subtracting the two shows:
= x1 y1 (ε+ × + + × + + + × + × + ×
1 + ε1 + ε1 ε2 + ε1 ε2 + ε 2 ) + x2 y2 (ε 2 + ε 2 ) + [x1 y1 ε 1 ε 1 + x2 y 2 ε 2 ε 2 ] + O(ε max)
3
ŝk − sk = xi yi εi× + ε+
j
2
+ O(kεmax)
i=1 j=i
2.8. For convenience, define d ≡ x− y. We’ll start by simplifying the numerator of relative error and then substitute:
(1 + εx )x − (1 + εy )y = (x − y) + (εx x − εy y)
= d + εx d + (εx − εy )y
=⇒ (1 + ε− )((1 + εx )x − (1 + εy )y) = (1 + ε− )(d + εx d + (εx − εy )y)
= (1 + ε− )d + εx (1 + ε− )d + (1 + ε− )(εx − εy )y
(1 + ε− )((1 + εx )x − (1 + εy )y) − (x − y)
=⇒ E =
x− y
ε− d + εx (1 + ε− )d + (1 + ε− )(εx − εy )y
=
d
y
=
ε− + εx (1 + ε− ) + (1 + ε− )(εx − εy )
d
This can be unbounded as d → 0.
2.9. (a) Implicitly differentiating the relationship 0 = f (x(ε)) + εp(x(ε)) with respect to ε shows
d
0= [f (x(ε)) + εp(x(ε))]
dε
= f (x(ε))x (ε) + p(x(ε)) + εp (x(ε))x (ε) by the chain rule.
p(x∗ )
0 = f (x∗ )x (0) + p(x∗ ) =⇒ x (0) = − .
f (x∗ )
(b) We differentiate
d
f (x) = (x − 1) · (x − 2) · · · · · (x − 20)
dx
= (x − 2) · · · · · (x − 20) + (x − 1) · (x − 3) · · · · · (x − 20)
+ · · · + (x − 1) · · · · · (x − 19) by the product rule
Substituting x = j shows
(c) x (1) ≈ 8.2 × 10−18 and x (20) ≈ −4.3 × 107 ; hence, the root x∗ = 1 is far more stable.
2.10. (a) The alternative formula can be obtained by scaling the numerator and denominator of the quadratic
equation:
√ √ √
−b ± b2 − 4ac −b ± b2 − 4ac −b ∓ b2 − 4ac
= · √
2a 2a −b ∓ b2 − 4ac
b2 − (b2 − 4ac)
= √
−2ab ∓ 2a b2 − 4ac
4ac
= √
−2ab ∓ 2a b2 − 4ac
−2c
=
This way, there never can be cancellation because we always move b farther from the origin in the numer-
ator.
2.11. The bounds are worked out below:
[x] + [y] = [x + y, x + y]
[x] − [y] = [x − y, x − y]
value sign(x) sign(x) sign(y) sign(y)
xy, xy + + + +
xy, xy + + − +
yx, yx + + − −
[xy, xy] − + + +
[x] × [y] =
min(xy, yx), max(xy, xy) − + − +
xy, x − + − −
xy, xy − − + +
[xy, xy] − − − +
xy, xy − − − −
1 1
[x] ÷ [y] = [x] × ,
y y
[x]1/2 = [x1/2 , x1/2 ]
In finite-precision arithmetic, always round down the lower bounds and round up the upper bounds.
2.12. (a) Perturbing any of three collinear points slightly makes them not collinear. Furthermore, points may appear
collinear if you zoom out far enough but appear less so as you zoom in.
ε
q
ε
p
ε
ε
(b)
ε
φq
ε
pφ
ε
(c)
(d) Obvious from drawings above; ε-collinear points form the intersection of four half-planes, two of which
come from the ε-clockwise condition and two of which come from the ε-counterclockwise condition.
(e) No. See §3.1 of [55] for an example.
3.1. No; LU may not be possible for matrices requiring pivoting.
3.2. The steps of Gaussian elimination are below:
2 4 2 1 2 1 1/2 0
∼ , with elimina tion matrix
3 5 4 3 5 4 0 1
1 2 1 1 0
∼ , with elimination matrix
0 1 −1 3 −1
1 0 3 1 −2
∼ , with elimination matrix
0 1 −1 0 1
−1 −1
1/2 0 1 0 2 0 1 0 2 0
L= = = .
0 1 3 −1 0 1 3 −1 3 −1
1 0 0 1 2 7
L= 3 1 0 U= 0 −1 −22
6 11 1 0 0 204
3.4. Where it states “optionally insert pivoting code here,” find row r with largest value in column p; then swap
row r and row p of both A and φb.
3.5. No. Full pivoting can be preferable numerically but technically does not make a difference. The only way partial
pivoting would fail is if there is an all-zero column, which would indicate that A is not invertible.
3.6. Write A = A1 + A2 i, φb = φb1 + φb2 i, and φx = φx1 + φx2 i. Then, Aφx = φb =⇒ (A1 + A2 i)(φx1 + φx2 i) = φb1 + φb2 i =⇒
(A1 φx1 − A2 φx2 ) + (A2 φx1 + A1 φx2 )i = φb1 + φb2 i. So, we can solve the block system
A2
A1 −A2 A1 φx1
φb1 = .
φ
b
2
3.7. Carrying out Gaussian elimination is the same as pre-multiplying by the inverse of the leftmost n × n block.
Hence, the output is A−1 (A|In ×n ) = (A−1 A|A−1 ) = (I n×n |A−1 ).
Larger Image
Larger Image
Larger Image
Fig. 77. Flint working
stations of the Men of
the Old Stone Age
along the waters of
the Ilm, the Rhine,
and the Danube, from
Acheulean to Azilian
times. After R. R.
Schmidt, modified and
redrawn. These
Palæolithic sites of
Germany lie between
the terminal moraines
of the successive
glacial advances of the
Second, Third, and
Fourth (II, III, IV)
Glacial Stages,
extending from the
borders of the
Scandinavian ice-fields
on the north to those
of the Alpine ice-fields
on the south. The
dotted surface
represents the area
covered by the drift of
the Fourth Glacial
Stage.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
testbankbell.com