Blame poly/zsolve.c

Packit 67cb25
/* poly/zsolve.c
Packit 67cb25
 * 
Packit 67cb25
 * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Brian Gough
Packit 67cb25
 * 
Packit 67cb25
 * This program is free software; you can redistribute it and/or modify
Packit 67cb25
 * it under the terms of the GNU General Public License as published by
Packit 67cb25
 * the Free Software Foundation; either version 3 of the License, or (at
Packit 67cb25
 * your option) any later version.
Packit 67cb25
 * 
Packit 67cb25
 * This program is distributed in the hope that it will be useful, but
Packit 67cb25
 * WITHOUT ANY WARRANTY; without even the implied warranty of
Packit 67cb25
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
Packit 67cb25
 * General Public License for more details.
Packit 67cb25
 * 
Packit 67cb25
 * You should have received a copy of the GNU General Public License
Packit 67cb25
 * along with this program; if not, write to the Free Software
Packit 67cb25
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
Packit 67cb25
 */
Packit 67cb25
Packit 67cb25
/* zsolve.c - finds the complex roots of  = 0 */
Packit 67cb25
Packit 67cb25
#include <config.h>
Packit 67cb25
#include <math.h>
Packit 67cb25
#include <stdlib.h>
Packit 67cb25
#include <gsl/gsl_math.h>
Packit 67cb25
#include <gsl/gsl_errno.h>
Packit 67cb25
#include <gsl/gsl_complex.h>
Packit 67cb25
#include <gsl/gsl_poly.h>
Packit 67cb25
Packit 67cb25
/* C-style matrix elements */
Packit 67cb25
#define MAT(m,i,j,n) ((m)[(i)*(n) + (j)])
Packit 67cb25
Packit 67cb25
/* Fortran-style matrix elements */
Packit 67cb25
#define FMAT(m,i,j,n) ((m)[((i)-1)*(n) + ((j)-1)])
Packit 67cb25
Packit 67cb25
#include "companion.c"
Packit 67cb25
#include "balance.c"
Packit 67cb25
#include "qr.c"
Packit 67cb25
Packit 67cb25
int
Packit 67cb25
gsl_poly_complex_solve (const double *a, size_t n,
Packit 67cb25
                        gsl_poly_complex_workspace * w,
Packit 67cb25
                        gsl_complex_packed_ptr z)
Packit 67cb25
{
Packit 67cb25
  int status;
Packit 67cb25
  double *m;
Packit 67cb25
Packit 67cb25
  if (n == 0)
Packit 67cb25
    {
Packit 67cb25
      GSL_ERROR ("number of terms must be a positive integer", GSL_EINVAL);
Packit 67cb25
    }
Packit 67cb25
Packit 67cb25
  if (n == 1)
Packit 67cb25
    {
Packit 67cb25
      GSL_ERROR ("cannot solve for only one term", GSL_EINVAL);
Packit 67cb25
    }
Packit 67cb25
Packit 67cb25
  if (a[n - 1] == 0)
Packit 67cb25
    {
Packit 67cb25
      GSL_ERROR ("leading term of polynomial must be non-zero", GSL_EINVAL) ;
Packit 67cb25
    }
Packit 67cb25
Packit 67cb25
  if (w->nc != n - 1)
Packit 67cb25
    {
Packit 67cb25
      GSL_ERROR ("size of workspace does not match polynomial", GSL_EINVAL);
Packit 67cb25
    }
Packit 67cb25
  
Packit 67cb25
  m = w->matrix;
Packit 67cb25
Packit 67cb25
  set_companion_matrix (a, n - 1, m);
Packit 67cb25
Packit 67cb25
  balance_companion_matrix (m, n - 1);
Packit 67cb25
Packit 67cb25
  status = qr_companion (m, n - 1, z);
Packit 67cb25
Packit 67cb25
  if (status)
Packit 67cb25
    {
Packit 67cb25
      GSL_ERROR("root solving qr method failed to converge", GSL_EFAILED);
Packit 67cb25
    }
Packit 67cb25
Packit 67cb25
  return GSL_SUCCESS;
Packit 67cb25
}
Packit 67cb25
Packit 67cb25
Packit 67cb25