Group Description

Evaluates polynomial of degree N:

Coefficients are stored in reverse order, i.e.

Interface

#include <codecogs/maths/algebra/polynomial/poly_eval.h>

using namespace Maths::Algebra::Polynomial;

	double	polyEval (double x, const double coef[], int N) Evaluates a polynomial of degree N.
	Real	cc_polyEval (Real x, Range coef, Integer N) This function is available as a Microsoft Excel add-in.
	double	polyEval1 (double x, const double coef[], int N) Evaluates a polynomial of degree N, with .
	Real	cc_polyEval1 (Real x, Range coef, Integer N) This function is available as a Microsoft Excel add-in.

---

Function Documentation

Evaluates polynomial of degree N

Example:

The following code computes solutions to the polynomial

(3)

#include <stdio.h>
#include <codecogs/maths/algebra/polynomial/poly_eval.h>
 
int main()
{
  using namespace Maths::Algebra::Polynomial;
  static double A[] = { 1,2,3 };
  for(int x=2;x<=5;x++)
    printf("\n polyEval(%d, A, 2)=%.1lf", x, polyEval(x, A, 2));
 
  return 0;
}

Output:

polyEval(2, A, 2)=11.0
polyEval(3, A, 2)=18.0
polyEval(4, A, 2)=27.0
polyEval(5, A, 2)=38.0

References:

Cephes Math Library Release 2.1: December, 1988

Parameters:

x	main variant
coef	array of coefficients coef[0..N] in reverse order[const]
N	degree of polynomial, also one less that number of coefficients supplied.

Note:

In the interest of speed, there are no checks for out of bounds arithmetic.

Authors:

Stephen L. Moshier Copyright 1984, 1987, 1988
Documentation by Will Bateman (August 2005)

Source Code:

- To get code register with CodeCogs. Already a Member, then Login.

Evaluates polynomial of degree N, where the coefficient . i.e. coef[0] = 1.0,

Example:

The following code computes solutions to the polynomial

(5)

#include <stdio.h>
#include <codecogs/maths/algebra/polynomial/poly_eval.h>
 
int main()
{
  using namespace Algebra::Polynomial;
  static double A[] = { -5, 4 };
  for(int x=2;x<=5;x++)
    printf("\n polyEval1(%d, A, 2)=%.1lf", x, polyEval(x, A, 2));
 
  return 0;
}

Output:

polyEval1(2, A, 2)=-2.0
polyEval1(3, A, 2)=-2.0
polyEval1(4, A, 2)=0.0
polyEval1(5, A, 2)=4.0

References:

Cephes Math Library Release 2.1: December, 1988

Parameters:

x	main variant
coef	array of coefficients coef[0..N-1] in reverse order[const]
N	degree of polynomial, also number of coefficients supplied. Must be 2 or more.

Note:

In the interest of speed, there are no checks for out of bounds arithmetic.

Authors:

Stephen L. Moshier Copyright 1984, 1987, 1988
Documentation by Will Bateman (August 2005)

Source Code:

- To get code register with CodeCogs. Already a Member, then Login.