96#include "../../2d_interpolate/nn/nan.h"
98void print_coefs(FILE *fprec,
double x_offset,
double x_scale,
long chebyshev,
99 double *coef,
double *s_coef, int32_t *order,
long n_terms,
100 double chi,
long norm_term,
char *prepend);
101char **makeCoefficientUnits(
SDDS_DATASET *SDDSout,
char *xName,
char *yName,
102 int32_t *order,
long terms);
103long setCoefficientData(
SDDS_DATASET *SDDSout,
double *coef,
double *coefSigma,
104 char **coefUnits, int32_t *order,
long terms,
long chebyshev,
105 char *fitLabelFormat,
char *rpnSeqBuffer);
106char **initializeOutputFile(
SDDS_DATASET *SDDSout,
char *output,
108 char *yName,
char *xSigmaName,
char *ySigmaName,
109 long sigmasValid, int32_t *order,
long terms,
110 long chebyshev,
long copyParameters);
111void checkInputFile(
SDDS_DATASET *SDDSin,
char *xName,
char *yName,
112 char *xSigmaName,
char *ySigmaName);
113long coefficient_index(int32_t *order,
long terms,
long order_of_interest);
114void makeFitLabel(
char *buffer,
long bufsize,
char *fitLabelFormat,
115 double *coef, int32_t *order,
long terms,
long chebyshev);
116void createRpnSequence(
char *buffer,
long bufsize,
double *coef, int32_t *order,
119double tcheby(
double x,
long n);
120double dtcheby(
double x,
long n);
121double ipower(
double x,
long n);
122double dipower(
double x,
long n);
123long reviseFitOrders(
double *x,
double *y,
double *sy, int64_t points,
124 long terms, int32_t *order,
double *coef,
125 double *coefSigma,
double *diff,
126 double (*basis_fn)(
double xa,
long ordera),
127 unsigned long reviseOrders,
double xOffset,
128 double xScaleFactor,
long normTerm,
long ySigmasValid,
129 long chebyshev,
double revpowThreshold,
130 double revpowCompleteThres,
double goodEnoughChi);
131long reviseFitOrders1(
double *x,
double *y,
double *sy, int64_t points,
132 long terms, int32_t *order,
double *coef,
133 double *coefSigma,
double *diff,
134 double (*basis_fn)(
double xa,
long ordera),
135 unsigned long reviseOrders,
double xOffset,
136 double xScaleFactor,
long normTerm,
long ySigmasValid,
137 long chebyshev,
double revpowThreshold,
138 double goodEnoughChi);
139void compareOriginalToFit(
double *x,
double *y,
double **residual,
140 int64_t points,
double *rmsResidual,
double *coef,
141 int32_t *order,
long terms);
148CHEBYSHEV_COEF *makeChebyshevCoefficients(
long maxOrder,
long *nPoly);
149void convertFromChebyshev(
long termsT, int32_t *orderT,
double *coefT,
double *coefSigmaT,
150 long *termsOrdinaryRet, int32_t **orderOrdinaryRet,
double **coefOrdinaryRet,
double **coefSigmaOrdinaryRet);
178char *option[N_OPTIONS] = {
203 "sddspfit [<inputfile>] [<outputfile>] [-pipe=[input][,output]]\n\
204 -columns=<xname>,<yname>[,xSigma=<name>][,ySigma=<name>]\n\
205 [ {-terms=<number> [-symmetry={none|odd|even}] | -orders=<number>[,...]} ]\n\
206 [-reviseOrders [=threshold=<chiValue>] [,verbose] [,complete=<chiThreshold>] [,goodEnough=<chiValue>]]\n\
207 [-chebyshev [=convert]]\n\
208 [-xOffset=<value>] [-autoOffset] [-xFactor=<value>]\n\
209 [-sigmas=<value>,{absolute|fractional}] \n\
210 [-modifySigmas] [-generateSigmas[={keepLargest|keepSmallest}]]\n\
211 [-sparse=<interval>] [-range=<lower>,<upper>[,fitOnly]]\n\
212 [-normalize[=<termNumber>]] [-verbose]\n\
213 [-evaluate=<filename>[,begin=<value>] [,end=<value>] [,number=<integer>] \n\
214 [,valuesFile=<filename>,valuesColumn=<string>[,reusePage]]]\n\
215 [-fitLabelFormat=<sprintf-string>] [-copyParameters] [-majorOrder={row|column}]\n\n\
216Program by Michael Borland. (" __DATE__
" " __TIME__
", SVN revision: " SVN_VERSION
")\n";
218static char *additional_help1 =
"\n\
219sddspfit fits data to the form y = SUM(i){ A[i] * P(x - x_offset, i) }, where P(x, i) is the ith basis\n\
220function evaluated at x. By default, P(x, i) = x^i. Chebyshev T polynomials can also be selected as the basis functions.\n\n\
221 -columns Specify names of data columns to use.\n\
222 -terms Number of terms desired in fit.\n\
223 -symmetry Symmetry of desired fit about x_offset.\n\
224 -orders Orders (P[i]) to use in fitting.\n\
225 -reviseOrders Modify the orders used in the fit to eliminate poorly-determined coefficients based on fitting\n\
226 of the first data page. The algorithm adds one order at a time, terminating when the reduced\n\
227 chi-squared is less than the \"goodEnough\" value (default: 1) or when the new term does not improve\n\
228 the reduced chi-squared by more than the threshold value (default: 0.1). It next tries removing terms one at a time.\n\
229 Finally, if the resulting best reduced chi-squared is greater than the threshold given with the \"complete\" option,\n\
230 it also tries all possible combinations of allowed terms.\n\
231 -chebyshev Use Chebyshev T polynomials (xOffset is set automatically).\n\
232 Giving the `convert` option causes the fit to be written out in terms of ordinary polynomials.\n\
233 -majorOrder Specify output file in row or column major order.\n\
234 -xOffset Desired value of x to fit about.\n";
236static char *additional_help2 =
237 " -autoOffset Automatically offset x values by the mean x value for fitting.\n\
238 Helpful if x values are very large in magnitude.\n\
239 -xFactor Desired factor to multiply x values by before fitting.\n\
240 -sigmas Specify absolute or fractional sigma for all points.\n\
241 -modifySigmas Modify the y sigmas using the x sigmas and an initial fit.\n\
242 -generateSigmas Generate y sigmas from the RMS deviation from an initial fit.\n\
243 Optionally keep the sigmas from the data if larger/smaller than RMS deviation.\n\
244 -sparse Specify integer interval at which to sample data.\n\
245 -range Specify range of independent variable over which to perform fit and evaluation.\n\
246 If 'fitOnly' is given, then fit is compared to data over the original range.\n\
247 -normalize Normalize so that the specified term is unity.\n\
248 -verbose Generates extra output that may be useful.\n\
249 -evaluate Specify evaluation of fit over a selected range of equispaced points,\n\
250 or at values listed in a file.\n\
251 -copyParameters If given, program copies all parameters from the input file into the main output file.\n\
252 By default, no parameters are copied.\n\n";
255#define EVEN_SYMMETRY 1
256#define ODD_SYMMETRY 2
257#define N_SYMMETRY_OPTIONS 3
258char *symmetry_options[N_SYMMETRY_OPTIONS] = {
"none",
"even",
"odd"};
260#define ABSOLUTE_SIGMAS 0
261#define FRACTIONAL_SIGMAS 1
262#define N_SIGMAS_OPTIONS 2
263char *sigmas_options[N_SIGMAS_OPTIONS] = {
"absolute",
"fractional"};
265#define FLGS_GENERATESIGMAS 1
266#define FLGS_KEEPLARGEST 2
267#define FLGS_KEEPSMALLEST 4
269#define REVPOW_ACTIVE 0x0001
270#define REVPOW_VERBOSE 0x0002
271#define REVPOW_COMPLETE 0x0004
274static long iIntercept = -1, iInterceptSigma = -1;
275static long iSlope = -1, iSlopeSigma = -1;
276static long iCurvature = -1, iCurvatureSigma = -1;
277static long *iTerm = NULL, *iTermSig = NULL;
278static long iOffset = -1, iFactor = -1;
279static long iChiSq = -1, iRmsResidual = -1, iSigLevel = -1;
280static long iFitIsValid = -1, iFitLabel = -1, iTerms = -1;
281static long iRpnSequence;
283static long ix = -1, iy = -1, ixSigma = -1, iySigma = -1;
284static long iFit = -1, iResidual = -1;
286static char *xSymbol, *ySymbol;
288#define EVAL_BEGIN_GIVEN 0x0001U
289#define EVAL_END_GIVEN 0x0002U
290#define EVAL_NUMBER_GIVEN 0x0004U
291#define EVAL_VALUESFILE_GIVEN 0x0008U
292#define EVAL_VALUESCOLUMN_GIVEN 0x0010U
293#define EVAL_REUSE_PAGE_GIVEN 0x0020U
302 short inputInitialized;
303 char *valuesFile, *valuesColumn;
306void makeEvaluationTable(
EVAL_PARAMETERS *evalParameters,
double *x, int64_t n,
307 double *coef, int32_t *order,
long terms,
310static double (*basis_fn)(
double xa,
long ordera);
311static double (*basis_dfn)(
double xa,
long ordera);
313int main(
int argc,
char **argv) {
314 double *x = NULL, *y = NULL, *sy = NULL, *sx = NULL, *diff = NULL, xOffset,
316 double *xOrig = NULL, *yOrig = NULL, *sxOrig, *syOrig, *sy0 = NULL;
317 long terms, normTerm, ySigmasValid;
318 int64_t i, j, points, pointsOrig;
319 long symmetry, chebyshev, autoOffset, copyParameters = 0;
321 long sigmasMode, sparseInterval;
323 double *coef, *coefSigma;
324 double chi, xLow, xHigh, rmsResidual;
325 char *xName, *yName, *xSigmaName, *ySigmaName;
326 char *input, *output, **coefUnits;
328 long isFit, iArg, modifySigmas;
329 long generateSigmas, verbose, ignoreSigmas;
334 double xMin, xMax, revpowThreshold, revpowCompleteThres, goodEnoughChi;
335 long rangeFitOnly = 0;
336 double rms_average(
double *d_x, int64_t d_n);
337 char *fitLabelFormat =
"%g";
338 static char rpnSeqBuffer[SDDS_MAXLINE];
339 unsigned long pipeFlags, reviseOrders, majorOrderFlag;
341 short columnMajorOrder = -1;
343 sxOrig = syOrig = NULL;
347 argc =
scanargs(&s_arg, argc, argv);
348 if (argc < 2 || argc > (3 + N_OPTIONS)) {
349 fprintf(stderr,
"usage: %s%s%s\n", USAGE, additional_help1,
354 input = output = NULL;
355 xName = yName = xSigmaName = ySigmaName = NULL;
356 modifySigmas = reviseOrders = chebyshev = 0;
358 symmetry = NO_SYMMETRY;
366 verbose = ignoreSigmas = 0;
374 evalParameters.file = evalParameters.valuesFile = evalParameters.valuesColumn = NULL;
375 evalParameters.initialized = evalParameters.inputInitialized = 0;
377 for (iArg = 1; iArg < argc; iArg++) {
378 if (s_arg[iArg].arg_type == OPTION) {
379 switch (
match_string(s_arg[iArg].list[0], option, N_OPTIONS, 0)) {
380 case CLO_MAJOR_ORDER:
382 s_arg[iArg].n_items--;
383 if (s_arg[iArg].n_items > 0 &&
385 &s_arg[iArg].n_items, 0,
"row", -1, NULL, 0,
386 SDDS_ROW_MAJOR_ORDER,
"column", -1, NULL, 0,
387 SDDS_COLUMN_MAJOR_ORDER, NULL)))
388 SDDS_Bomb(
"invalid -majorOrder syntax/values");
389 if (majorOrderFlag & SDDS_COLUMN_MAJOR_ORDER)
390 columnMajorOrder = 1;
391 else if (majorOrderFlag & SDDS_ROW_MAJOR_ORDER)
392 columnMajorOrder = 0;
394 case CLO_MODIFYSIGMAS:
401 if (s_arg[iArg].n_items < 2)
403 order =
tmalloc(
sizeof(*order) * (terms = s_arg[iArg].n_items - 1));
404 for (i = 1; i < s_arg[iArg].n_items; i++) {
405 if (sscanf(s_arg[iArg].list[i],
"%" SCNd32, order + i - 1) != 1)
406 SDDS_Bomb(
"unable to scan order from -orders list");
411 if ((s_arg[iArg].n_items != 3 && s_arg[iArg].n_items != 4) ||
412 1 != sscanf(s_arg[iArg].list[1],
"%lf", &xMin) ||
413 1 != sscanf(s_arg[iArg].list[2],
"%lf", &xMax) || xMin >= xMax)
415 if (s_arg[iArg].n_items == 4) {
416 if (strncmp(
str_tolower(s_arg[iArg].list[3]),
"fitonly",
417 strlen(s_arg[iArg].list[3])) == 0) {
423 case CLO_GENERATESIGMAS:
424 generateSigmas = FLGS_GENERATESIGMAS;
425 if (s_arg[iArg].n_items > 1) {
426 if (s_arg[iArg].n_items != 2)
427 SDDS_Bomb(
"incorrect -generateSigmas syntax");
428 if (strncmp(s_arg[iArg].list[1],
"keepsmallest",
429 strlen(s_arg[iArg].list[1])) == 0)
430 generateSigmas |= FLGS_KEEPSMALLEST;
431 if (strncmp(s_arg[iArg].list[1],
"keeplargest",
432 strlen(s_arg[iArg].list[1])) == 0)
433 generateSigmas |= FLGS_KEEPLARGEST;
434 if ((generateSigmas & FLGS_KEEPSMALLEST) &&
435 (generateSigmas & FLGS_KEEPLARGEST))
436 SDDS_Bomb(
"ambiguous -generateSigmas syntax");
440 if (s_arg[iArg].n_items != 2 ||
441 sscanf(s_arg[iArg].list[1],
"%ld", &terms) != 1)
445 if (s_arg[iArg].n_items != 2 ||
446 sscanf(s_arg[iArg].list[1],
"%lf", &xOffset) != 1)
450 if (s_arg[iArg].n_items == 2) {
451 if ((symmetry =
match_string(s_arg[iArg].list[1], symmetry_options,
452 N_SYMMETRY_OPTIONS, 0)) < 0)
453 SDDS_Bomb(
"unknown option used with -symmetry");
458 if (s_arg[iArg].n_items != 3)
460 if (sscanf(s_arg[iArg].list[1],
"%lf", &sigmas) != 1)
461 SDDS_Bomb(
"couldn't scan value for -sigmas");
462 if ((sigmasMode =
match_string(s_arg[iArg].list[2], sigmas_options,
463 N_SIGMAS_OPTIONS, 0)) < 0)
467 if (s_arg[iArg].n_items != 2)
469 if (sscanf(s_arg[iArg].list[1],
"%ld", &sparseInterval) != 1)
470 SDDS_Bomb(
"couldn't scan value for -sparse");
471 if (sparseInterval < 1)
479 if (s_arg[iArg].n_items > 2 ||
480 (s_arg[iArg].n_items == 2 &&
481 sscanf(s_arg[iArg].list[1],
"%ld", &normTerm) != 1) ||
485 case CLO_REVISEORDERS:
486 revpowThreshold = 0.1;
487 revpowCompleteThres = 10;
489 s_arg[iArg].n_items -= 1;
491 &s_arg[iArg].n_items, 0,
493 "complete",
SDDS_DOUBLE, &revpowCompleteThres, 1, REVPOW_COMPLETE,
495 "verbose", -1, NULL, 1, REVPOW_VERBOSE, NULL) ||
496 revpowThreshold < 0 || revpowCompleteThres < 0 || goodEnoughChi < 0)
497 SDDS_Bomb(
"invalid -reviseOrders syntax");
498 reviseOrders |= REVPOW_ACTIVE;
501 if (s_arg[iArg].n_items > 2 ||
502 (s_arg[iArg].n_items == 2 &&
503 strncmp(s_arg[iArg].list[1],
"convert",
504 strlen(s_arg[iArg].list[1])) != 0))
506 chebyshev = s_arg[iArg].n_items;
511 if (s_arg[iArg].n_items != 2 ||
512 sscanf(s_arg[iArg].list[1],
"%lf", &xScaleFactor) != 1 ||
517 if (s_arg[iArg].n_items < 3 || s_arg[iArg].n_items > 5)
519 xName = s_arg[iArg].list[1];
520 yName = s_arg[iArg].list[2];
521 s_arg[iArg].n_items -= 3;
522 if (!
scanItemList(&flags, s_arg[iArg].list + 3, &s_arg[iArg].n_items, 0,
523 "xsigma",
SDDS_STRING, &xSigmaName, 1, 0,
"ysigma",
527 case CLO_FITLABELFORMAT:
528 if (s_arg[iArg].n_items != 2)
529 SDDS_Bomb(
"invalid -fitLabelFormat syntax");
530 fitLabelFormat = s_arg[iArg].list[1];
538 if (s_arg[iArg].n_items < 2)
540 evalParameters.file = s_arg[iArg].list[1];
541 s_arg[iArg].n_items -= 2;
542 s_arg[iArg].list += 2;
543 if (!
scanItemList(&evalParameters.flags, s_arg[iArg].list,
544 &s_arg[iArg].n_items, 0,
545 "begin",
SDDS_DOUBLE, &evalParameters.begin, 1, EVAL_BEGIN_GIVEN,
546 "end",
SDDS_DOUBLE, &evalParameters.end, 1, EVAL_END_GIVEN,
547 "number",
SDDS_LONG64, &evalParameters.number, 1, EVAL_NUMBER_GIVEN,
548 "valuesfile",
SDDS_STRING, &evalParameters.valuesFile, 1, EVAL_VALUESFILE_GIVEN,
549 "valuescolumn",
SDDS_STRING, &evalParameters.valuesColumn, 1, EVAL_VALUESCOLUMN_GIVEN,
550 "reusepage", 0, NULL, 0, EVAL_REUSE_PAGE_GIVEN,
553 if (evalParameters.flags & EVAL_VALUESFILE_GIVEN || evalParameters.flags & EVAL_VALUESCOLUMN_GIVEN) {
554 if (evalParameters.flags & (EVAL_BEGIN_GIVEN | EVAL_END_GIVEN | EVAL_NUMBER_GIVEN))
555 SDDS_Bomb(
"invalid -evaluate syntax: given begin/end/number or valuesFile/valuesColumn, not a mixture.");
556 if (!(evalParameters.flags & EVAL_VALUESFILE_GIVEN && evalParameters.flags & EVAL_VALUESCOLUMN_GIVEN))
557 SDDS_Bomb(
"invalid -evaluate syntax: give both valuesFile and valuesColumn, not just one");
559 evalParameters.initialized = 0;
561 case CLO_COPY_PARAMETERS:
565 bomb(
"unknown switch", USAGE);
570 input = s_arg[iArg].list[0];
571 else if (output == NULL)
572 output = s_arg[iArg].list[0];
580 if (symmetry && order)
581 SDDS_Bomb(
"can't specify both -symmetry and -orders");
582 if (chebyshev && order)
583 SDDS_Bomb(
"can't specify both -chebyshev and -orders");
584 if (chebyshev && symmetry)
585 SDDS_Bomb(
"can't specify both -chebyshev and -symmetry");
586 if (!xName || !yName)
587 SDDS_Bomb(
"you must specify a column name for x and y");
589 if (modifySigmas && !xSigmaName)
590 SDDS_Bomb(
"you must specify x sigmas with -modifySigmas");
591 if (generateSigmas) {
593 SDDS_Bomb(
"you can't specify both -generateSigmas and -modifySigmas");
596 if (sigmasMode != -1)
597 SDDS_Bomb(
"you can't specify both -sigmas and a y sigma name");
600 if (sigmasMode != -1 || generateSigmas || ySigmaName || modifySigmas)
603 if (normTerm >= 0 && normTerm >= terms)
604 SDDS_Bomb(
"can't normalize to that term--not that many terms");
605 if (reviseOrders && !(sigmasMode != -1 || generateSigmas || ySigmaName))
606 SDDS_Bomb(
"can't use -reviseOrders unless a y sigma or -generateSigmas is given");
608 if (symmetry == EVEN_SYMMETRY) {
609 order =
tmalloc(
sizeof(*order) * terms);
610 for (i = 0; i < terms; i++)
612 }
else if (symmetry == ODD_SYMMETRY) {
613 order =
tmalloc(
sizeof(*order) * terms);
614 for (i = 0; i < terms; i++)
615 order[i] = 2 * i + 1;
617 order =
tmalloc(
sizeof(*order) * terms);
618 for (i = 0; i < terms; i++)
621 coef =
tmalloc(
sizeof(*coef) * terms);
622 coefSigma =
tmalloc(
sizeof(*coefSigma) * terms);
623 iTerm =
tmalloc(
sizeof(*iTerm) * terms);
624 iTermSig =
tmalloc(
sizeof(*iTermSig) * terms);
628 checkInputFile(&SDDSin, xName, yName, xSigmaName, ySigmaName);
629 coefUnits = initializeOutputFile(&SDDSout, output, &SDDSin, input, xName,
630 yName, xSigmaName, ySigmaName, ySigmasValid,
631 order, terms, chebyshev, copyParameters);
632 if (columnMajorOrder != -1)
633 SDDSout.layout.data_mode.column_major = columnMajorOrder;
635 SDDSout.layout.data_mode.column_major =
636 SDDSin.layout.data_mode.column_major;
646 fprintf(stderr,
"error: unable to read column %s\n", xName);
648 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
651 fprintf(stderr,
"error: unable to read column %s\n", yName);
653 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
657 fprintf(stderr,
"error: unable to read column %s\n", xSigmaName);
659 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
663 fprintf(stderr,
"error: unable to read column %s\n", ySigmaName);
665 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
668 sy0 =
tmalloc(
sizeof(*sy0) * points);
670 if (xMin != xMax || sparseInterval != 1) {
671 xOrig =
tmalloc(
sizeof(*xOrig) * points);
672 yOrig =
tmalloc(
sizeof(*yOrig) * points);
674 sxOrig =
tmalloc(
sizeof(*sxOrig) * points);
676 syOrig =
tmalloc(
sizeof(*syOrig) * points);
678 for (i = j = 0; i < points; i++) {
687 for (i = j = 0; i < points; i++) {
688 if (xOrig[i] <= xMax && xOrig[i] >= xMin) {
700 if (sparseInterval != 1) {
701 for (i = j = 0; i < points; i++) {
702 if (i % sparseInterval == 0) {
724 if (sigmasMode == ABSOLUTE_SIGMAS) {
725 for (i = 0; i < points; i++)
728 for (i = 0; i < pointsOrig; i++)
730 }
else if (sigmasMode == FRACTIONAL_SIGMAS) {
731 for (i = 0; i < points; i++)
732 sy0[i] = sigmas * fabs(y[i]);
734 for (i = 0; i < pointsOrig; i++)
735 syOrig[i] = fabs(yOrig[i]) * sigmas;
738 if (!ySigmasValid || generateSigmas)
739 for (i = 0; i < points; i++)
742 for (i = 0; i < points; i++)
744 SDDS_Bomb(
"y sigma = 0 for one or more points.");
746 diff =
tmalloc(
sizeof(*x) * points);
747 sy =
tmalloc(
sizeof(*sy) * points);
748 for (i = 0; i < points; i++)
759 xScaleFactor = MAX(fabs(xHigh - xOffset), fabs(xLow - xOffset));
762 xOffset = (xHigh + xLow) / 2;
763 xScaleFactor = (xHigh - xLow) / 2;
769 if (generateSigmas || modifySigmas) {
771 isFit =
lsfg(x, y, sy, points, terms, order, coef, coefSigma, &chi,
776 fputs(
"initial_fit:", stdout);
777 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef, NULL,
778 order, terms, chi, normTerm,
"");
779 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
780 rms_average(diff, points));
784 for (i = 0; i < points; i++)
786 fabs(
eval_sum(basis_dfn, coef, order, terms, x[i]) * sx[i]);
788 for (i = 0; i < points; i++) {
791 sqr(
eval_sum(basis_dfn, coef, order, terms, x[i]) * sx[i]));
794 if (generateSigmas) {
796 for (i = sigma = 0; i < points; i++) {
797 sigma += sqr(diff[i]);
799 sigma = sqrt(sigma / (points - terms));
800 for (i = 0; i < points; i++) {
801 if (generateSigmas & FLGS_KEEPSMALLEST) {
804 }
else if (generateSigmas & FLGS_KEEPLARGEST) {
811 for (i = 0; i < pointsOrig; i++) {
812 if (generateSigmas & FLGS_KEEPSMALLEST) {
815 }
else if (generateSigmas & FLGS_KEEPLARGEST) {
825 if (reviseOrders & REVPOW_ACTIVE) {
826 terms = reviseFitOrders(
827 x, y, sy, points, terms, order, coef, coefSigma, diff, basis_fn,
828 reviseOrders, xOffset, xScaleFactor, normTerm, ySigmasValid,
829 chebyshev, revpowThreshold, revpowCompleteThres, goodEnoughChi);
833 isFit =
lsfg(x, y, sy, points, terms, order, coef, coefSigma, &chi, diff,
836 rmsResidual = rms_average(diff, points);
838 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef,
839 (ySigmasValid ? coefSigma : NULL), order, terms, chi,
841 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
845 fprintf(stdout,
"fit failed.\n");
847 if (evalParameters.file)
848 makeEvaluationTable(&evalParameters, x, points, coef, order, terms,
849 &SDDSin, xName, yName);
852 if (!
SDDS_StartPage(&SDDSout, rangeFitOnly ? pointsOrig : points))
854 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
857 setCoefficientData(&SDDSout, coef, (ySigmasValid ? coefSigma : NULL),
858 coefUnits, order, terms, chebyshev, fitLabelFormat,
862 compareOriginalToFit(xOrig, yOrig, &residual, pointsOrig, &rmsResidual,
870 pointsOrig, iResidual))
872 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
873 for (i = 0; i < pointsOrig; i++)
874 residual[i] = yOrig[i] - residual[i];
879 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
883 pointsOrig, ixSigma))
885 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
886 if (ySigmasValid && iySigma != -1 &&
888 pointsOrig, iySigma))
890 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
893 for (i = 0; i < points; i++)
903 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
904 for (i = 0; i < points; i++)
910 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
916 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
917 if (ySigmasValid && iySigma != -1 &&
921 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
927 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
929 &SDDSout, SDDS_SET_BY_INDEX | SDDS_PASS_BY_VALUE, iRpnSequence,
930 invalid ?
"" : rpnSeqBuffer, iRmsResidual,
931 invalid ? NaN : rmsResidual, iChiSq, invalid ? NaN : chi, iTerms,
934 invalid ? NaN : xOffset, iFactor, invalid ? NaN : xScaleFactor,
935 iFitIsValid, isFit ?
'y' :
'n', -1) ||
938 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
960 if (evalParameters.initialized && !
SDDS_Terminate(&(evalParameters.dataset)))
970 return (EXIT_SUCCESS);
973void print_coefs(FILE *fpo,
double xOffset,
double xScaleFactor,
long chebyshev,
974 double *coef,
double *coefSigma, int32_t *order,
long terms,
975 double chi,
long normTerm,
char *prepend) {
979 fprintf(fpo,
"%s%ld-term Chebyshev T polynomial least-squares fit about "
980 "x=%21.15e, scaled by %21.15e:\n",
981 prepend, terms, xOffset, xScaleFactor);
983 fprintf(fpo,
"%s%ld-term polynomial least-squares fit about x=%21.15e:\n",
984 prepend, terms, xOffset);
985 if (normTerm >= 0 && terms > normTerm) {
986 if (coef[normTerm] != 0)
987 fprintf(fpo,
"%s coefficients are normalized with factor %21.15e to "
989 prepend, coef[normTerm], (order ? order[normTerm] : normTerm));
991 fprintf(fpo,
"%s can't normalize coefficients as requested: a[%ld]==0\n",
992 prepend, (order ? order[normTerm] : normTerm));
998 for (i = 0; i < terms; i++) {
999 fprintf(fpo,
"%sa[%ld] = %21.15e ", prepend, (order ? order[i] : i),
1000 (normTerm < 0 ? coef[i] : coef[i] / coef[normTerm]));
1003 fpo,
"+/- %21.15e\n",
1004 (normTerm < 0 ? coefSigma[i] : coefSigma[i] / fabs(coef[normTerm])));
1009 fprintf(fpo,
"%sreduced chi-squared = %21.15e\n", prepend, chi);
1012void makeFitLabel(
char *buffer,
long bufsize,
char *fitLabelFormat,
1013 double *coef, int32_t *order,
long terms,
long chebyshev) {
1015 static char buffer1[SDDS_MAXLINE], buffer2[SDDS_MAXLINE];
1017 sprintf(buffer,
"%s = ", ySymbol);
1018 for (i = 0; i < terms; i++) {
1022 if (order[i] == 0) {
1024 strcat(buffer1,
"+");
1025 sprintf(buffer1 + 1, fitLabelFormat, coef[i]);
1027 sprintf(buffer1, fitLabelFormat, coef[i]);
1030 strcat(buffer1,
"+");
1031 sprintf(buffer1 + 1, fitLabelFormat, coef[i]);
1033 sprintf(buffer1, fitLabelFormat, coef[i]);
1034 if (order[i] >= 1) {
1035 strcat(buffer1,
"*");
1036 if (chebyshev != 1) {
1037 strcat(buffer1, xSymbol);
1039 sprintf(buffer2,
"$a%d$n", order[i]);
1040 strcat(buffer1, buffer2);
1043 sprintf(buffer2,
"T$b%d$n(%s)", order[i], xSymbol);
1044 strcat(buffer1, buffer2);
1048 if ((
long)(strlen(buffer) + strlen(buffer1)) > (
long)(0.95 * bufsize)) {
1049 fprintf(stderr,
"buffer overflow making fit label!\n");
1052 strcat(buffer, buffer1);
1056double rms_average(
double *x, int64_t n) {
1060 for (i = sum2 = 0; i < n; i++)
1063 return (sqrt(sum2 / n));
1066long coefficient_index(int32_t *order,
long terms,
long order_of_interest) {
1068 for (i = 0; i < terms; i++)
1069 if (order[i] == order_of_interest)
1074void checkInputFile(
SDDS_DATASET *SDDSin,
char *xName,
char *yName,
1075 char *xSigmaName,
char *ySigmaName) {
1078 SDDS_Bomb(
"x column doesn't exist or is nonnumeric");
1082 SDDS_Bomb(
"y column doesn't exist or is nonnumeric");
1086 !(ptr =
SDDS_FindColumn(SDDSin, FIND_NUMERIC_TYPE, xSigmaName, NULL)))
1087 SDDS_Bomb(
"x sigma column doesn't exist or is nonnumeric");
1092 !(ptr =
SDDS_FindColumn(SDDSin, FIND_NUMERIC_TYPE, ySigmaName, NULL)))
1093 SDDS_Bomb(
"y sigma column doesn't exist or is nonnumeric");
1099char **initializeOutputFile(
SDDS_DATASET *SDDSout,
char *output,
1101 char *yName,
char *xSigmaName,
char *ySigmaName,
1102 long sigmasValid, int32_t *order,
long terms,
1103 long chebyshev,
long copyParameters) {
1104 char buffer[SDDS_MAXLINE], buffer1[SDDS_MAXLINE], *xUnits, *yUnits,
1120 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1132 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1134 sprintf(buffer,
"%sFit", yName);
1135 sprintf(buffer1,
"Fit[%s]", ySymbol);
1138 SDDS_SET_BY_NAME, buffer))
1139 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1141 SDDS_Bomb(
"unable to get index of just-defined fit output column");
1143 sprintf(buffer,
"%sResidual", yName);
1144 sprintf(buffer1,
"Residual[%s]", ySymbol);
1147 SDDS_SET_BY_NAME, buffer))
1148 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1151 SDDS_Bomb(
"unable to get index of just-defined residual output column");
1153 if (sigmasValid && !ySigmaName) {
1154 sprintf(buffer,
"%sSigma", yName);
1157 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1160 sprintf(buffer1,
"Sigma[%s]", ySymbol);
1162 SDDS_SET_BY_NAME, buffer))
1164 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1168 if (!(coefUnits = makeCoefficientUnits(SDDSout, xName, yName, order, terms)))
1169 SDDS_Bomb(
"unable to make coefficient units");
1172 NULL,
SDDS_LONG, 0, 1,
"FitResults") < 0 ||
1174 "Coefficient of term in fit", NULL,
SDDS_DOUBLE, 0, 1,
1175 "FitResults") < 0 ||
1178 "[CoefficientUnits]",
1179 "Sigma of coefficient of term in fit", NULL,
1183 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1187 chebyshev ? (chebyshev == 1 ?
"Chebyshev T polynomials" :
"Converted Chebyshev T polynomials")
1188 :
"ordinary polynomials") < 0 ||
1190 SDDSout,
"ReducedChiSquared",
"$gh$r$a2$n/(N-M)", NULL,
1191 "Reduced chi-squared of fit", NULL,
SDDS_DOUBLE, NULL)) < 0 ||
1195 SDDSout,
"RmsResidual",
"$gs$r$bres$n", yUnits,
1196 "RMS residual of fit", NULL,
SDDS_DOUBLE, NULL)) < 0 ||
1199 "Probability that data is from fit function",
1202 "Rpn sequence to evaluate the fit",
1212 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1213 sprintf(buffer,
"%sOffset", xName);
1214 sprintf(buffer1,
"Offset of %s for fit", xName);
1217 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1218 sprintf(buffer,
"%sScale", xName);
1219 sprintf(buffer1,
"Scale factor of %s for fit", xName);
1222 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1227 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1230 "Number of terms in fit", NULL,
SDDS_LONG,
1232 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1237 if ((i = coefficient_index(order, terms, 0)) >= 0) {
1243 SDDSout,
"InterceptSigma",
"InterceptSigma", coefUnits[i],
1244 "Sigma of intercept of fit", NULL,
SDDS_DOUBLE, NULL);
1246 if ((i = coefficient_index(order, terms, 1)) >= 0) {
1251 coefUnits[i],
"Sigma of slope of fit",
1254 if ((i = coefficient_index(order, terms, 2)) >= 0) {
1260 SDDSout,
"CurvatureSigma",
"CurvatureSigma", coefUnits[i],
1261 "Sigma of curvature of fit", NULL,
SDDS_DOUBLE, NULL);
1265 for (i = 0; i < terms; i++) {
1267 sprintf(s,
"Coefficient%02ld", (
long)order[i]);
1271 for (i = 0; i < terms; i++) {
1274 sprintf(s,
"Coefficient%02ldSigma", (
long)order[i]);
1283 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1285 if (copyParameters &&
1287 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1290 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1295long setCoefficientData(
SDDS_DATASET *SDDSout,
double *coef,
double *coefSigma,
1296 char **coefUnits, int32_t *order,
long terms,
long chebyshev,
1297 char *fitLabelFormat,
char *rpnSeqBuffer) {
1300 static char fitLabelBuffer[SDDS_MAXLINE];
1302 if (chebyshev != 2) {
1303 createRpnSequence(rpnSeqBuffer, SDDS_MAXLINE, coef, order, terms);
1310 coefSigma, terms)) ||
1313 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1315 termIndex = coefficient_index(order, terms, 0);
1317 if (iIntercept != -1 &&
1319 iIntercept, invalid ? NaN : coef[termIndex], -1))
1321 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1322 if (iInterceptSigma != -1 &&
1325 invalid ? NaN : coefSigma[termIndex], -1))
1327 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1329 termIndex = coefficient_index(order, terms, 1);
1332 iSlope, invalid ? NaN : coef[termIndex], -1))
1334 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1335 if (iSlopeSigma != -1 &&
1337 iSlopeSigma, invalid ? NaN : coefSigma[termIndex],
1340 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1342 termIndex = coefficient_index(order, terms, 2);
1343 if (iCurvature != -1 &&
1345 iCurvature, invalid ? NaN : coef[termIndex], -1))
1347 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1348 if (iCurvatureSigma != -1 &&
1351 invalid ? NaN : coefSigma[termIndex], -1))
1353 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1354 if (iFitLabel != -1 && !invalid) {
1355 makeFitLabel(fitLabelBuffer, SDDS_MAXLINE, fitLabelFormat, coef, order,
1358 iFitLabel, fitLabelBuffer, -1))
1360 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1362 for (i = 0; i < terms; i++) {
1364 iTerm[i], coef[i], -1))
1366 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1367 if (iTermSig[i] != -1)
1369 SDDS_SET_BY_INDEX | SDDS_PASS_BY_VALUE,
1370 iTermSig[i], coefSigma[i], -1))
1372 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1377 double *coefC, *coefSigmaC;
1378 convertFromChebyshev(terms, order, coef, coefSigma, &termsC, &orderC, &coefC, &coefSigmaC);
1379 setCoefficientData(SDDSout, coefC, coefSigmaC, coefUnits, orderC, termsC, 0, fitLabelFormat,
1386char **makeCoefficientUnits(
SDDS_DATASET *SDDSout,
char *xName,
char *yName,
1387 int32_t *order,
long terms) {
1388 char *xUnits, *yUnits, buffer[SDDS_MAXLINE];
1389 char **coefUnits = NULL;
1396 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1398 coefUnits =
tmalloc(
sizeof(*coefUnits) * terms);
1402 for (i = 0; i < terms; i++)
1403 coefUnits[i] = yUnits;
1407 for (i = 0; i < terms; i++) {
1408 if (order[i] == 0) {
1409 if (strcmp(yUnits,
"1") != 0)
1413 }
else if (strcmp(xUnits, yUnits) == 0) {
1415 sprintf(buffer,
"1/%s$a%d$n", xUnits, order[i] - 1);
1421 sprintf(buffer,
"%s/%s$a%d$n", yUnits, xUnits, order[i]);
1423 sprintf(buffer,
"%s/%s", yUnits, xUnits);
1431void compareOriginalToFit(
double *x,
double *y,
double **residual,
1432 int64_t points,
double *rmsResidual,
double *coef,
1433 int32_t *order,
long terms) {
1435 double residualSum2, fit;
1437 *residual =
tmalloc(
sizeof(**residual) * points);
1440 for (i = 0; i < points; i++) {
1441 fit =
eval_sum(basis_fn, coef, order, terms, x[i]);
1442 (*residual)[i] = y[i] - fit;
1443 residualSum2 += sqr((*residual)[i]);
1445 *rmsResidual = sqrt(residualSum2 / points);
1449 int64_t points,
double *coef, int32_t *order,
1452 double *xEval, *yEval, delta;
1455 if (!evalParameters->initialized) {
1457 "sddspfit evaluation table",
1458 evalParameters->file) ||
1465 SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1466 evalParameters->initialized = 1;
1469 if (evalParameters->flags & EVAL_VALUESFILE_GIVEN) {
1470 if (!evalParameters->inputInitialized) {
1472 fprintf(stderr,
"error: unable to initialize %s\n", evalParameters->valuesFile);
1473 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1476 fprintf(stderr,
"error: unable to read page from %s\n", evalParameters->valuesFile);
1477 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1479 evalParameters->inputInitialized = 1;
1481 if (!(evalParameters->flags & EVAL_REUSE_PAGE_GIVEN) &&
1483 fprintf(stderr,
"error: unable to read page from %s\n", evalParameters->valuesFile);
1484 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1488 fprintf(stderr,
"error: unable to read column %s from %s\n", evalParameters->valuesColumn, evalParameters->valuesFile);
1489 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1493 if (!(evalParameters->flags & EVAL_BEGIN_GIVEN) ||
1494 !(evalParameters->flags & EVAL_END_GIVEN)) {
1497 if (!(evalParameters->flags & EVAL_BEGIN_GIVEN))
1498 evalParameters->begin = min;
1499 if (!(evalParameters->flags & EVAL_END_GIVEN))
1500 evalParameters->end = max;
1502 if (!(evalParameters->flags & EVAL_NUMBER_GIVEN))
1503 evalParameters->number = points;
1504 if (evalParameters->number > 1)
1505 delta = (evalParameters->end - evalParameters->begin) /
1506 (evalParameters->number - 1);
1510 if (!(xEval = (
double *)malloc(
sizeof(*xEval) * evalParameters->number)))
1513 for (i = 0; i < evalParameters->number; i++)
1514 xEval[i] = evalParameters->begin + i * delta;
1517 if (!(yEval = (
double *)malloc(
sizeof(*yEval) * evalParameters->number)))
1519 for (i = 0; i < evalParameters->number; i++)
1520 yEval[i] =
eval_sum(basis_fn, coef, order, terms, xEval[i]);
1522 if (!
SDDS_StartPage(&evalParameters->dataset, evalParameters->number) ||
1524 xEval, evalParameters->number, xName) ||
1526 yEval, evalParameters->number, yName) ||
1528 SDDS_PrintErrors(stderr, SDDS_VERBOSE_PrintErrors | SDDS_EXIT_PrintErrors);
1533long reviseFitOrders(
double *x,
double *y,
double *sy, int64_t points,
1534 long terms, int32_t *order,
double *coef,
1535 double *coefSigma,
double *diff,
1536 double (*basis_fn)(
double xa,
long ordera),
1537 unsigned long reviseOrders,
double xOffset,
1538 double xScaleFactor,
long normTerm,
long ySigmasValid,
1539 long chebyshev,
double revpowThreshold,
1540 double revpowCompleteThreshold,
double goodEnoughChi) {
1541 double bestChi, chi;
1542 long bestTerms, newTerms, newBest, *termUsed;
1543 int32_t *newOrder, *bestOrder;
1545 long origTerms, *origOrder;
1547 bestOrder =
tmalloc(
sizeof(*bestOrder) * terms);
1548 newOrder =
tmalloc(
sizeof(*newOrder) * terms);
1549 termUsed =
tmalloc(
sizeof(*termUsed) * terms);
1550 origOrder =
tmalloc(
sizeof(*origOrder) * terms);
1552 for (i = 0; i < terms; i++)
1553 origOrder[i] = order[i];
1554 qsort((
void *)order, terms,
sizeof(*order),
long_cmpasc);
1555 bestOrder[0] = newOrder[0] = order[0];
1557 newTerms = bestTerms = 1;
1559 if (!
lsfg(x, y, sy, points, newTerms, newOrder, coef, coefSigma, &bestChi,
1562 if (reviseOrders & REVPOW_VERBOSE) {
1563 fputs(
"fit to revise orders:", stdout);
1564 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef,
1565 (ySigmasValid ? coefSigma : NULL), bestOrder, bestTerms,
1566 bestChi, normTerm,
"");
1567 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
1568 rms_average(diff, points));
1573 newTerms = newTerms + 1;
1574 for (ip = 1; ip < terms; ip++) {
1577 newOrder[newTerms - 1] = order[ip];
1578 if (!
lsfg(x, y, sy, points, newTerms, newOrder, coef, coefSigma, &chi,
1581 if (reviseOrders & REVPOW_VERBOSE) {
1582 fputs(
"trial fit:", stdout);
1583 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef,
1584 (ySigmasValid ? coefSigma : NULL), newOrder, newTerms,
1586 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
1587 rms_average(diff, points));
1589 if ((bestChi > goodEnoughChi && chi < bestChi) ||
1590 (chi + revpowThreshold < bestChi && newTerms < bestTerms)) {
1592 bestTerms = newTerms;
1595 for (i = 0; i < newTerms; i++)
1596 bestOrder[i] = newOrder[i];
1597 if (reviseOrders & REVPOW_VERBOSE) {
1598 fputs(
"new best fit:", stdout);
1599 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef,
1600 (ySigmasValid ? coefSigma : NULL), bestOrder, bestTerms,
1601 bestChi, normTerm,
"");
1602 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
1603 rms_average(diff, points));
1608 }
while (newBest && bestChi > goodEnoughChi);
1611 for (ip = 0; ip < terms; ip++)
1612 order[ip] = bestOrder[ip];
1617 for (ip = 0; ip < terms; ip++) {
1618 for (i = j = 0; i < terms; i++) {
1620 newOrder[j++] = order[i];
1622 newTerms = terms - 1;
1623 if (!
lsfg(x, y, sy, points, newTerms, newOrder, coef, coefSigma, &chi, diff,
1626 if ((bestChi > goodEnoughChi && chi < goodEnoughChi) ||
1627 (chi + revpowThreshold < bestChi && newTerms < terms)) {
1631 for (i = 0; i < newTerms; i++)
1632 order[i] = newOrder[i];
1633 if (reviseOrders & REVPOW_VERBOSE) {
1634 fputs(
"new best fit:", stdout);
1635 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef,
1636 (ySigmasValid ? coefSigma : NULL), order, terms,
1637 bestChi, normTerm,
"");
1638 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
1639 rms_average(diff, points));
1644 }
while (newBest && terms > 1 && bestChi > goodEnoughChi);
1651 if ((reviseOrders & REVPOW_COMPLETE) && bestChi > revpowCompleteThreshold) {
1653 for (i = 0; i < origTerms; i++)
1654 order[i] = origOrder[i];
1655 if (reviseOrders & REVPOW_VERBOSE)
1656 fprintf(stdout,
"Result unsatisfactory---attempting complete trials\n");
1657 return reviseFitOrders1(x, y, sy, points, terms, order, coef, coefSigma,
1658 diff, basis_fn, reviseOrders, xOffset, xScaleFactor,
1659 normTerm, ySigmasValid, chebyshev, revpowThreshold,
1667long reviseFitOrders1(
double *x,
double *y,
double *sy, int64_t points,
1668 long terms, int32_t *order,
double *coef,
1669 double *coefSigma,
double *diff,
1670 double (*basis_fn)(
double xa,
long ordera),
1671 unsigned long reviseOrders,
double xOffset,
1672 double xScaleFactor,
long normTerm,
long ySigmasValid,
1673 long chebyshev,
double revpowThreshold,
1674 double goodEnoughChi) {
1675 double bestChi, chi;
1676 long bestTerms, newTerms;
1677 int32_t *newOrder = NULL, *bestOrder;
1679 long *counter = NULL, *counterLim = NULL;
1681 if (!(bestOrder = malloc(
sizeof(*bestOrder) * terms)) ||
1682 !(newOrder = malloc(
sizeof(*newOrder) * terms)) ||
1683 !(counter = calloc(
sizeof(*counter), terms)) ||
1684 !(counterLim = calloc(
sizeof(*counterLim), terms))) {
1685 fprintf(stderr,
"Error: memory allocation failure (%ld terms)\n", terms);
1688 for (i = 0; i < terms; i++)
1690 qsort((
void *)order, terms,
sizeof(*order),
long_cmpasc);
1692 if (!
lsfg(x, y, sy, points, 2, order, coef, coefSigma, &bestChi, diff,
1695 for (i = 0; i < 2; i++)
1696 bestOrder[i] = order[i];
1698 if (reviseOrders & REVPOW_VERBOSE) {
1699 fputs(
"starting fit to revise orders:", stdout);
1700 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef,
1701 (ySigmasValid ? coefSigma : NULL), order, 1, bestChi, normTerm,
1703 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
1704 rms_average(diff, points));
1709 for (i = j = 0; i < terms; i++) {
1711 newOrder[j++] = order[i];
1714 if (!
lsfg(x, y, sy, points, newTerms, newOrder, coef, coefSigma, &chi, diff,
1717 if ((chi < goodEnoughChi && newTerms < bestTerms) ||
1718 (bestChi > goodEnoughChi && chi < bestChi)) {
1720 bestTerms = newTerms;
1721 for (i = 0; i < newTerms; i++)
1722 bestOrder[i] = newOrder[i];
1723 if (reviseOrders & REVPOW_VERBOSE) {
1724 fputs(
"new best fit:", stdout);
1725 print_coefs(stdout, xOffset, xScaleFactor, chebyshev, coef,
1726 (ySigmasValid ? coefSigma : NULL), bestOrder, bestTerms,
1727 bestChi, normTerm,
"");
1728 fprintf(stdout,
"unweighted rms deviation from fit: %21.15e\n",
1729 rms_average(diff, points));
1735 for (ip = 0; ip < terms; ip++)
1736 order[ip] = bestOrder[ip];
1745void createRpnSequence(
char *buffer,
long bufsize,
double *coef, int32_t *order,
1747 long i, j, maxOrder;
1748 static char buffer1[SDDS_MAXLINE];
1754 for (i = 0; i < terms; i++) {
1755 if (maxOrder < order[i])
1756 maxOrder = order[i];
1758 if (maxOrder == 0) {
1759 snprintf(buffer, SDDS_MAXLINE,
"%.15e", coef[0]);
1764 snprintf(buffer, SDDS_MAXLINE,
"%le - ", offset);
1765 for (i = 2; i <= maxOrder; i++) {
1766 strcat(buffer,
"= ");
1767 if ((strlen(buffer) + 2) > bufsize) {
1768 fprintf(stderr,
"buffer overflow making rpn expression!\n");
1772 for (i = maxOrder; i >= 0; i--) {
1773 for (j = 0; j < terms; j++) {
1782 snprintf(buffer1, SDDS_MAXLINE,
"%.15g * ", coef1);
1783 else if (i == 0 && order[j] == 0) {
1785 snprintf(buffer1, SDDS_MAXLINE,
"%.15g + ", coef1);
1790 strcpy(buffer1,
"* ");
1792 snprintf(buffer1, SDDS_MAXLINE,
"%.15g + * ", coef1);
1794 if ((strlen(buffer) + strlen(buffer1)) >= bufsize) {
1795 fprintf(stderr,
"buffer overflow making rpn expression!\n");
1798 strcat(buffer, buffer1);
1806CHEBYSHEV_COEF *makeChebyshevCoefficients(
long maxOrder,
long *nPoly) {
1813 *nPoly = maxOrder + 1;
1815 coef =
tmalloc(
sizeof(*coef) * (*nPoly));
1818 coef[0].coef =
tmalloc(
sizeof(*(coef[0].coef)) * coef[0].nTerms);
1819 coef[0].coef[0] = 1;
1822 coef[1].coef =
tmalloc(
sizeof(*(coef[1].coef)) * coef[1].nTerms);
1823 coef[1].coef[0] = 0;
1824 coef[1].coef[1] = 1;
1826 for (i = 2; i < *nPoly; i++) {
1827 coef[i].nTerms = coef[i - 1].nTerms + 1;
1828 coef[i].coef = calloc(coef[i].nTerms,
sizeof(*(coef[i].coef)));
1829 for (j = 0; j < coef[i - 2].nTerms; j++)
1830 coef[i].coef[j] = -coef[i - 2].coef[j];
1831 for (j = 0; j < coef[i - 1].nTerms; j++)
1832 coef[i].coef[j + 1] += 2 * coef[i - 1].coef[j];
1847void convertFromChebyshev(
long termsT, int32_t *orderT,
double *coefT,
double *coefSigmaT,
1848 long *termsOrdinaryRet, int32_t **orderOrdinaryRet,
double **coefOrdinaryRet,
double **coefSigmaOrdinaryRet) {
1851 int32_t *orderOrdinary;
1852 double *coefOrdinary, *coefSigmaOrdinary, scale;
1854 static long nChebyCoef = 0, chebyMaxOrder = 0;
1857 for (i = 0; i < termsT; i++)
1858 if (orderT[i] > maxOrder)
1859 maxOrder = orderT[i];
1861 termsOrdinary = maxOrder + 1;
1862 orderOrdinary =
tmalloc(
sizeof(*orderOrdinary) * termsOrdinary);
1863 coefOrdinary = calloc(termsOrdinary,
sizeof(*coefOrdinary));
1865 coefSigmaOrdinary = calloc(termsOrdinary,
sizeof(*coefSigmaOrdinary));
1867 coefSigmaOrdinary = NULL;
1869 if (chebyCoef == NULL || maxOrder > chebyMaxOrder) {
1871 for (i = 0; i < nChebyCoef; i++)
1872 free(chebyCoef[i].coef);
1875 chebyCoef = makeChebyshevCoefficients(chebyMaxOrder = maxOrder, &nChebyCoef);
1878 for (i = 0; i < termsT; i++) {
1880 for (j = 0; j < chebyCoef[orderT[i]].nTerms; j++) {
1881 coefOrdinary[j] += coefT[i] * chebyCoef[i].coef[j];
1883 coefSigmaOrdinary[j] += sqr(coefSigmaT[i] * chebyCoef[i].coef[j]);
1887 for (i = 0; i < termsOrdinary; i++) {
1889 coefSigmaOrdinary[i] = sqrt(coefSigmaOrdinary[i]) /
ipow(scale, i);
1890 orderOrdinary[i] = i;
1891 coefOrdinary[i] /=
ipow(scale, i);
1893 *termsOrdinaryRet = termsOrdinary;
1894 *orderOrdinaryRet = orderOrdinary;
1895 *coefOrdinaryRet = coefOrdinary;
1896 *coefSigmaOrdinaryRet = coefSigmaOrdinary;
SDDS (Self Describing Data Set) Data Types Definitions and Function Prototypes.
int32_t SDDS_CopyParameters(SDDS_DATASET *SDDS_target, SDDS_DATASET *SDDS_source)
int32_t SDDS_StartPage(SDDS_DATASET *SDDS_dataset, int64_t expected_n_rows)
int32_t SDDS_SetArrayVararg(SDDS_DATASET *SDDS_dataset, char *array_name, int32_t mode, void *data_pointer,...)
Sets the values of an array variable in the SDDS dataset using variable arguments for dimensions.
int32_t SDDS_SetParameters(SDDS_DATASET *SDDS_dataset, int32_t mode,...)
int32_t SDDS_SetColumnFromDoubles(SDDS_DATASET *SDDS_dataset, int32_t mode, double *data, int64_t rows,...)
Sets the values for a single data column using double-precision floating-point numbers.
int32_t SDDS_ChangeColumnInformation(SDDS_DATASET *SDDS_dataset, char *field_name, void *memory, int32_t mode,...)
Modifies a specific field in a column definition within the SDDS dataset.
int32_t SDDS_GetColumnInformation(SDDS_DATASET *SDDS_dataset, char *field_name, void *memory, int32_t mode,...)
Retrieves information about a specified column in the SDDS dataset.
int32_t SDDS_InitializeOutput(SDDS_DATASET *SDDS_dataset, int32_t data_mode, int32_t lines_per_row, const char *description, const char *contents, const char *filename)
Initializes the SDDS output dataset.
int32_t SDDS_DefineArray(SDDS_DATASET *SDDS_dataset, const char *name, const char *symbol, const char *units, const char *description, const char *format_string, int32_t type, int32_t field_length, int32_t dimensions, const char *group_name)
Defines a data array within the SDDS dataset.
int32_t SDDS_WritePage(SDDS_DATASET *SDDS_dataset)
Writes the current data table to the output file.
int32_t SDDS_WriteLayout(SDDS_DATASET *SDDS_dataset)
Writes the SDDS layout header to the output file.
int32_t SDDS_DefineParameter(SDDS_DATASET *SDDS_dataset, const char *name, const char *symbol, const char *units, const char *description, const char *format_string, int32_t type, char *fixed_value)
Defines a data parameter with a fixed string value.
int32_t SDDS_TransferColumnDefinition(SDDS_DATASET *target, SDDS_DATASET *source, char *name, char *newName)
Transfers a column definition from a source dataset to a target dataset.
int32_t SDDS_TransferAllParameterDefinitions(SDDS_DATASET *SDDS_target, SDDS_DATASET *SDDS_source, uint32_t mode)
Transfers all parameter definitions from a source dataset to a target dataset.
int32_t SDDS_GetColumnIndex(SDDS_DATASET *SDDS_dataset, char *name)
Retrieves the index of a named column in the SDDS dataset.
void SDDS_PrintErrors(FILE *fp, int32_t mode)
Prints recorded error messages to a specified file stream.
void SDDS_RegisterProgramName(const char *name)
Registers the executable program name for use in error messages.
int32_t SDDS_NumberOfErrors()
Retrieves the number of errors recorded by SDDS library routines.
int32_t SDDS_StringIsBlank(char *s)
Checks if a string is blank (contains only whitespace characters).
char * SDDS_FindColumn(SDDS_DATASET *SDDS_dataset, int32_t mode,...)
Finds the first column in the SDDS dataset that matches the specified criteria.
void SDDS_Bomb(char *message)
Terminates the program after printing an error message and recorded errors.
int32_t SDDS_CopyString(char **target, const char *source)
Copies a source string to a target string with memory allocation.
#define SDDS_STRING
Identifier for the string data type.
#define SDDS_LONG
Identifier for the signed 32-bit integer data type.
#define SDDS_CHARACTER
Identifier for the character data type.
#define SDDS_DOUBLE
Identifier for the double data type.
#define SDDS_LONG64
Identifier for the signed 64-bit integer data type.
void * tmalloc(uint64_t size_of_block)
Allocates a memory block of the specified size with zero initialization.
void bomb(char *error, char *usage)
Reports error messages to the terminal and aborts the program.
long advance_counter(long *counter, long *max_count, long n_indices)
Advances the counter array based on maximum counts.
int find_min_max(double *min, double *max, double *list, int64_t n)
Finds the minimum and maximum values in a list of doubles.
double ipow(const double x, const int64_t p)
Compute x raised to the power p (x^p).
double get_argument_offset()
Get the current argument offset applied before function evaluations.
double get_argument_scale()
Get the current argument scale factor used before function evaluations.
double eval_sum(double(*fn)(double x, long ord), double *coef, int32_t *order, long n_coefs, double x0)
Evaluate a sum of basis functions.
long lsfg(double *xd, double *yd, double *sy, long n_pts, long n_terms, int32_t *order, double *coef, double *s_coef, double *chi, double *diff, double(*fn)(double x, long ord))
Computes generalized least squares fits using a function passed by the caller.
long match_string(char *string, char **option, long n_options, long mode)
Matches a given string against an array of option strings based on specified modes.
int scanargs(SCANNED_ARG **scanned, int argc, char **argv)
long processPipeOption(char **item, long items, unsigned long *flags)
void processFilenames(char *programName, char **input, char **output, unsigned long pipeFlags, long noWarnings, long *tmpOutputUsed)
long scanItemList(unsigned long *flags, char **item, long *items, unsigned long mode,...)
Scans a list of items and assigns values based on provided keywords and types.
void set_argument_scale(double scale)
Set the scale factor applied to the input argument of basis functions.
void set_argument_offset(double offset)
Set the offset applied to the input argument of basis functions.
double dtcheby(double x, long n)
Evaluate the derivative of the Chebyshev polynomial T_n(x).
double ipower(double x, long n)
Evaluate a power function x^n.
double dipower(double x, long n)
Evaluate the derivative of x^n.
double tcheby(double x, long n)
Evaluate the Chebyshev polynomial of the first kind T_n(x).
double ChiSqrSigLevel(double ChiSquared0, long nu)
Computes the probability that a chi-squared variable exceeds a given value.
int long_cmpasc(const void *a, const void *b)
Compare two long integers in ascending order.
char * str_tolower(char *s)
Convert a string to lower case.