勒让德多项式的根c ++

Question

I'm writing a program to find the roots of nth order Legendre Polynomials using c++; my code is attached below:

double* legRoots(int n)
{
 double myRoots[n];
 double x, dx, Pi = atan2(1,1)*4;
 int iters = 0;
 double tolerance = 1e-20;
 double error = 10*tolerance;
 int maxIterations = 1000;

 for(int i = 1; i<=n; i++)
 {
  x = cos(Pi*(i-.25)/(n+.5));
  do
  {
   dx -= legDir(n,x)/legDif(n,x);
   x += dx;
   iters += 1;
   error = abs(dx);
  } while (error>tolerance && iters<maxIterations);
  myRoots[i-1] = x;
 }
 return myRoots;
}

Assuming the existence of functioning Legendre Polynomial and Legendre Polynomial derivative generating functions, which I do have but I thought that would make for unreadable walls of code text. This function is functioning in the sense that it's returning an array calculated values, but they're wildly off, outputting the following:

3.95253e-323
6.94492e-310
6.95268e-310
6.42285e-323
4.94066e-323
2.07355e-317

where an equivalent function I've written in Python gives the following:

[-0.90617985 -0.54064082  0.          0.54064082  0.90617985]

I was hoping another set of eyes could help me see what the issue in my C++ code is that's causing the values to be wildly off. I'm not doing anything different in my Python code that I'm doing in C++, so any help anyone could give on this is greatly appreciated, thanks. For reference, I'm mostly trying to emulate the method found on Rosetta code in regards to Gaussian Quadrature: http://rosettacode.org/wiki/Numerical_integration/Gauss-Legendre_Quadrature .

Answer 1

You are returning an address to a temporary variable in stack

{
    double myRoots[n];
    ...
    return myRoots; // Not a safe thing to do
}

I suggest changing your function definition to

void legRoots(int n, double *myRoots)

omitting the return statement, and defining myroots before calling the function

double myRoots[10];
legRoots(10, myRoots);

Option 2 would be to allocate myRoots dynamically with new or malloc.