Jump to content


  • Content Count

  • Joined

  • Last visited

Community Reputation

0 Neutral

About PeterK

  • Rank

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

  1. You are right about "Pade approximant", which is even better then "Chebyshev Approximation". I use the "Polynomial Approximation from Chebyshev Coefficients" which are easy to determine. If you google at "numerical recipes in c pdf", you will find the PDF version of the book I use. In this document you find full documented C-functions of "Chebyshev Approximation", "Polynomial Approximation from Chebyshev Coefficients", and of course "Pade approximant". You can copy and paste these functions directly from the PDF file, and you are in business in calculating your own polynomial coefficients. After
  2. I know this is an old topic, however I would like to comment on the implementation of the math functions as shown in this topic. The method used is not the proper way to do it. You can write for every math function a routine which uses at average 7 multiplications and 7 additions to calculate the value with 6 digits accuracy! Its very simple to create a polynome which has great accuracy for a small range of input values. With simple math rules you can translate all possible input values to this small range. All math libraries are written in this manner !!! I stumbled on this topic because
  • Create New...