09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Remember that<br />

R stands <strong>for</strong> “‘real<br />

part.”<br />

9.3 0 MANIPULATION 437<br />

Power series give us some of the most useful operations of all. If the sum<br />

S(z) = tanz”<br />

n>O<br />

converges absolutely <strong>for</strong> some complex number z = a, then<br />

S(z) = O(l),<br />

This is obvious, because<br />

<strong>for</strong> all 121 6 /22/.<br />

In particular, S(z) =: O(1) as z + 0, and S(l/n) = O(1) as n + 00, provided<br />

only that S(z) converges <strong>for</strong> at least one nonzero value of z. We can use this<br />

principle to truncate a power series at any convenient point and estimate the<br />

remainder with 0. For example, not only is S(z) = 0( 1 ), but<br />

S(z) = a0 +0(z),<br />

S(z) = a0 + al2 + O(z2) ,<br />

and so on, because<br />

S(z) = x ukzk +zm x a,znem<br />

O$km<br />

and the latter sum is 0 (1). Table 438 lists some of the most useful asymptotic<br />

<strong>for</strong>mulas, half of which are simply based on truncation of power series<br />

according to this rule.<br />

Dirichlet series, which are sums of the <strong>for</strong>m tka, ak/k’, can be truncated<br />

in a similar way: If a Dirichlet series converges absolutely when z = a, we<br />

can truncate it at any term and get the approximation<br />

t ok/k’ + O(m-‘) ,<br />

l

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!