Skip to main content

Taylor Series

Taylor Series is based on a theorem that states, any smooth function, 𝑓(𝑥), can be expressed as a polynomial in the neighborhood of a point 𝑎. Assuming all derivatives of the function exist at 𝑎, the series takes the form

f(a) = C0

The derivative of f(x) by differentiating the individual terms,

the derivative is also a power series, then computing all of its higher derivatives

when the function is evaluated at a, the constant term is obtained for each power series.

f'(a) = 1 · C1

f''(a) = 2 · 1 · C2

f'''(a) = 3 · 2 · 1 · C3

.. . . . 

f(k)(a) = k! · Ck

Solving the equation for the k-th coefficient Ck,

If function has a power series expansion at a with radius of convergence R > 0, that is,

then Cn,

Substituting Cn value in the formula, 

The above series is called Taylor series of the function f at a.

When  a = 0, the series becomes

which is called  Maclaurin series.

Labels:

Popular posts from this blog

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807
Read more

Decision Tree Classification

 A decision tree is a flowchart-like tree structure. The topmost node in a tree is the root node. The each internal node (non-leaf node) denotes a test on an attribute and each branch represents an outcome of the test. The each leaf node (or terminal node) holds a class label. Decision trees can handle multidimensional data.  Some of the decision tree algorithms are Iterative Dichotomiser (ID3), C4.5 (a successor of ID3), Classification and Regression Trees (CART). Most algorithms for decision tree induction  follow a top-down approach.  The tree starts with a training set of tuples and their associated class labels. The algorithm is called with data partition, attribute list, and attribute selection method, where the data partition is the complete set of training tuples and their associated class labels. The splitting criterion is determined by attribute selection method which indicates the splitting attribute that may be splitting point or splitting subset. Attribu...
Read more

Exercise 1 - Amdahl's Law

A programmer is given the job to write a program on a computer with processor having speedup factor 3.8 on 4 processors. He makes it 95% parallel and goes home dreaming of a big pay raise. Using Amdahl’s law, and assuming the problem size is the same as the serial version, and ignoring communication costs, what is the speedup factor that the programmer will get? Solution Speedup formula as per Amdahl's Law, N - no of processor = 4 f - % of parallel operation = 95% Speedup = 1 / (1 - 0.95) + (0.95/4) = 1 / 0.5 + (0.95/4) Speedup = 3.478 The programmer gets  3.478 as t he speedup factor.
Read more