Using Taylor Series to Avoid Loss of Precision

Posted by Zachary on Stack Overflow See other posts from Stack Overflow or by Zachary
Published on 2009-02-12T20:33:48Z Indexed on 2010/03/15 18:29 UTC
Read the original article Hit count: 600

Filed under:

numerical-analysis

|

taylor-series

|

precision

|

significance

|

homework

I'm trying to use Taylor series to develop a numerically sound algorithm for solving a function. I've been at it for quite a while, but haven't had any luck yet. I'm not sure what I'm doing wrong.

The function is

f(x)=1 + x - sin(x)/ln(1+x)   x~0

Also: why does loss of precision even occur in this function? when x is close to zero, sin(x)/ln(1+x) isn't even close to being the same number as x. I don't see where significance is even being lost.

In order to solve this, I believe that I will need to use the Taylor expansions for sin(x) and ln(1+x), which are

x - x^3/3! + x^5/5! - x^7/7! + ...

and

x - x^2/2 + x^3/3 - x^4/4 + ...

respectfully. I have attempted to use like denominators to combine the x and sin(x)/ln(1+x) components, and even to combine all three, but nothing seems to work out correctly in the end. Any help is appreciated.

© Stack Overflow or respective owner

Related posts about numerical-analysis

Using Taylor Series to Avoid Loss of Precision

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to use Taylor series to develop a numerically sound algorithm for solving a function. I've been at it for quite a while, but haven't had any luck yet. I'm not sure what I'm doing wrong. The function is f(x)=1 + x - sin(x)/ln(1+x) x~0 Also: why does loss of precision even occur in… >>> More
Lack of IsNumeric function in C#

as seen on Stack Overflow - Search for 'Stack Overflow'
One thing that has bothered me about C# since its release was the lack of a generic IsNumeric function. I know it is difficult to generate a one-stop solution to detrmine if a value is numeric. I have used the following solution in the past, but it is not the best practice because I am generating… >>> More
matlab fit exp2

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm unsuccessfully looking for documentation of fit function using exp2 (sum of 2 exponents). How to operate the function is clear: [curve, gof] = fit(x, y,'exp2'); But since there are multiple ways to fit a sum of exponents I'm trying to find out what algorithm is used. Particularly what happens… >>> More
Implementation of GNU Scientific Library?

as seen on Stack Overflow - Search for 'Stack Overflow'
Does anyone know a collection of articles or books that describes the implementation of the GNU Scientific Library? This question is not about using the GSL; it's about how the GSL is implemented, their design decisions / tradeoffs. Thanks! >>> More
C++ Numerical Recipes – A New Adventure!

as seen on Geeks with Blogs - Search for 'Geeks with Blogs'
I am about to embark on a great journey – over the next 6 weeks I plan to read through C++ Numerical Recipes 3rd edition http://amzn.to/YtdpkS I'll be reading this with an eye to C++ AMP, thinking about implementing the suitable subset (non-recursive, additive, commutative) to run on the GPU. … >>> More

Related posts about taylor-series

Using Taylor Series to Avoid Loss of Precision

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to use Taylor series to develop a numerically sound algorithm for solving a function. I've been at it for quite a while, but haven't had any luck yet. I'm not sure what I'm doing wrong. The function is f(x)=1 + x - sin(x)/ln(1+x) x~0 Also: why does loss of precision even occur in… >>> More
Using Taylor Polynomials Programmatically in Maple

as seen on Stack Overflow - Search for 'Stack Overflow'
I am trying to use a Taylor polynomial programmatically in Maple, but the following does not seem to work... T[6]:=taylor(sin(x),x=Pi/4,6);convert(T[6], polynom, x); f:=proc(x) convert(T[6], polynom, x); end proc; f(1); All of the following also do not work: f:=convert(T[6], polynom); f:=convert(T[6]… >>> More
Function approximation with Maclaurin series

as seen on Stack Overflow - Search for 'Stack Overflow'
I need to approx (1-x)^0.25 with given accuracy (0.0001 e.g.). I'm using expansion found on Wikipedia for (1+x)^0.25. I need to stop approximating when current expression is less than the accuracy. long double s(long double x, long double d) { long double w = 1; long double n = 1; // nth… >>> More
Need help programming with Mclauren series and Taylor series!

as seen on Stack Overflow - Search for 'Stack Overflow'
Ok so here's what i have so far: #include <stdio.h> #include <math.h> //#define PI 3.14159 int factorial(int n){ if(n <= 1) return(1); else return(n * factorial(n-1)); } void McLaurin(float pi){ int factorial(int); float x = 42*pi/180; int i, val=0, sign; for(i=1… >>> More
Runge-Kutta (RK4) integration for game physics

as seen on Stack Overflow - Search for 'Stack Overflow'
Gaffer on Games has a great article about using RK4 integration for better game physics. The implementation is straightforward but the math behind it confuses me. I understand derivatives and integrals on a conceptual level but I haven't manipulated equations in a long time. Here's the brunt of Gaffer's… >>> More