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.

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

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...

Decision Tree Scalability Methods

 The scalable decision tree induction methods are RainForest and BOAT. RainForest method maintains an AVC set for each attribute at each node. AVC stands for Attribute Value Classlabel. BOAT , stands for Bootstrapped Optimistic Algorithm for Tree construction, uses a statistical technique known as bootstrapping., by which several smaller subsets are created. The several trees are created using the subsets and finally the full tree is generated using the trees created by smaller subsets. BOAT was found to be two to three times faster than RainForest.