mirror of https://github.com/CGAL/cgal
119 lines
3.5 KiB
C++
119 lines
3.5 KiB
C++
// Copyright (c) 2005 Stanford University (USA).
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public License as
|
|
// published by the Free Software Foundation; either version 3 of the License,
|
|
// or (at your option) any later version.
|
|
//
|
|
// Licensees holding a valid commercial license may use this file in
|
|
// accordance with the commercial license agreement provided with the software.
|
|
//
|
|
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
//
|
|
// $URL$
|
|
// $Id$
|
|
//
|
|
//
|
|
// Author(s) : Daniel Russel <drussel@alumni.princeton.edu>
|
|
|
|
#ifndef CGAL_POLYNOMIAL_INTERNAL_NUMERIC_SOLVERS_H
|
|
#define CGAL_POLYNOMIAL_INTERNAL_NUMERIC_SOLVERS_H
|
|
#include <CGAL/Polynomial/basic.h>
|
|
#include <vector>
|
|
|
|
namespace CGAL { namespace POLYNOMIAL { namespace internal {
|
|
|
|
// JAMA
|
|
CGAL_EXPORT
|
|
void jama_polynomial_compute_roots(const double *begin, const double *end,
|
|
double lb, double ub, std::vector<double> &roots);
|
|
|
|
CGAL_EXPORT
|
|
void jama_polynomial_compute_cleaned_roots(const double *begin, const double *end,
|
|
double lb, double ub, std::vector<double> &roots);
|
|
|
|
// GSL
|
|
CGAL_EXPORT
|
|
void gsl_polynomial_compute_roots(const double *begin, const double *end,
|
|
double lb, double ub, std::vector<double> &roots);
|
|
|
|
CGAL_EXPORT
|
|
void gsl_polynomial_compute_cleaned_roots(const double *begin, const double *end,
|
|
double lb, double ub, std::vector<double> &roots);
|
|
|
|
// Turkowski
|
|
CGAL_EXPORT
|
|
void Turkowski_polynomial_compute_roots(const double *begin, const double *end,
|
|
double lb, double ub, std::vector<double> &roots);
|
|
|
|
CGAL_EXPORT
|
|
void Turkowski_polynomial_compute_cleaned_roots(const double *begin, const double *end,
|
|
double lb, double ub, std::vector<double> &roots);
|
|
|
|
/*struct GSL_numeric_solver {
|
|
void operator()(const double *begin, const double *end,
|
|
double lb, double ub,
|
|
std::vector<double> &roots) const {
|
|
gsl_polynomial_compute_roots(begin, end, lb, ub, roots);
|
|
}
|
|
};
|
|
|
|
struct GSL_cleaned_numeric_solver {
|
|
void operator()(const double *begin, const double *end,
|
|
double lb, double ub,
|
|
std::vector<double> &roots) const {
|
|
gsl_polynomial_compute_cleaned_roots(begin, end, lb, ub, roots);
|
|
}
|
|
};*/
|
|
|
|
struct JAMA_numeric_solver
|
|
{
|
|
void operator()(const double *begin, const double *end,
|
|
double lb, double ub,
|
|
std::vector<double> &roots) const
|
|
{
|
|
jama_polynomial_compute_roots(begin, end, lb, ub, roots);
|
|
}
|
|
};
|
|
|
|
struct JAMA_cleaned_numeric_solver
|
|
{
|
|
void operator()(const double *begin, const double *end,
|
|
double lb, double ub,
|
|
std::vector<double> &roots) const
|
|
{
|
|
jama_polynomial_compute_cleaned_roots(begin, end, lb, ub, roots);
|
|
}
|
|
};
|
|
|
|
struct Turkowski_numeric_solver
|
|
{
|
|
void operator()(const double *begin, const double *end,
|
|
double lb, double ub,
|
|
std::vector<double> &roots) const
|
|
{
|
|
Turkowski_polynomial_compute_roots(begin, end, lb, ub, roots);
|
|
}
|
|
};
|
|
|
|
struct Turkowski_cleaned_numeric_solver
|
|
{
|
|
void operator()(const double *begin, const double *end,
|
|
double lb, double ub,
|
|
std::vector<double> &roots) const
|
|
{
|
|
Turkowski_polynomial_compute_cleaned_roots(begin, end, lb, ub, roots);
|
|
}
|
|
};
|
|
|
|
} } } //namespace CGAL::POLYNOMIAL::internal
|
|
|
|
#ifdef CGAL_HEADER_ONLY
|
|
#include <CGAL/Polynomial/internal/JAMA_numeric_solvers_impl.h>
|
|
#include <CGAL/Polynomial/internal/Turkowski_numeric_solvers_impl.h>
|
|
#endif // CGAL_HEADER_ONLY
|
|
|
|
#endif
|