1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
/*************************************************************************
* Copyright (C) 2009-2011 Tavian Barnes <tavianator@tavianator.com> *
* *
* This file is part of The Dimension Library. *
* *
* The Dimension Library is free software; 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. *
* *
* The Dimension Library is distributed in the hope that it will be *
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty *
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public *
* License along with this program. If not, see *
* <http://www.gnu.org/licenses/>. *
*************************************************************************/
/**
* @file
* Utility functions for working with and numerically solving polynomials.
* Polynomials are represented as simple arrays where the ith element is the
* coefficient on x^i. In general, we are only interested in positive roots.
*/
#include <stddef.h>
#include <stdio.h>
/**
* Evaluate a polynomial at \p x.
* @param[in] poly The coefficients of the polynomial to evaluate, in order
* from lowest degree to highest degree. The array should
* have dimension <tt>degree + 1</tt>.
* @param[in] degree The degree of the polynomial.
* @param[in] x The value of the variable at which to evaluate.
*/
DMNSN_INLINE double
dmnsn_evaluate_polynomial(const double poly[], size_t degree, double x)
{
double ret = poly[degree];
size_t i;
for (i = degree; i-- > 0;) {
ret = ret*x + poly[i];
}
return ret;
}
/**
* Evaluate the derivative of a polynomial at \p x.
* @param[in] poly The coefficients of the polynomial to evaluate.
* @param[in] degree The degree of the polynomial.
* @param[in] x The value of the variable at which to evaluate.
*/
DMNSN_INLINE double
dmnsn_evaluate_polynomial_derivative(const double poly[], size_t degree,
double x)
{
double ret = poly[degree]*degree;
size_t i;
for (i = degree - 1; i >= 1; --i) {
ret = ret*x + poly[i]*i;
}
return ret;
}
/**
* Find the positive roots of a polynomial.
* @param[in] poly The coefficients of the polynomial to solve.
* @param[in] degree The degree of the polynomial.
* @param[out] x An array in which to store the roots. It should have
* dimension \p degree.
* @return The number of positive roots stored in \c x[].
*/
size_t dmnsn_solve_polynomial(const double poly[], size_t degree, double x[]);
/**
* Output a polynomial. The polynomial is printed as a function of x suitable
* for input into a CAS, and without a trailing newline.
* @param[in,out] file The file to write to.
* @param[in] poly The coefficients of the polynomial to print.
* @param[in] degree The degree of the polynomial.
*/
void dmnsn_print_polynomial(FILE *file, const double poly[], size_t degree);
|
