X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=website%2Farchive%2Fbinaries%2Fmac%2Fsrc%2Fdisembl%2FTisean_3.0.1%2Fsource_c%2Ffsle.c;fp=website%2Farchive%2Fbinaries%2Fmac%2Fsrc%2Fdisembl%2FTisean_3.0.1%2Fsource_c%2Ffsle.c;h=3faf8ea6feef7be8ff45e345745e2ffb6c1e7435;hb=dbde3fb6f00b9bb770343631a517c0e599db8528;hp=0000000000000000000000000000000000000000;hpb=85f830bbd51a7277994bd4233141016304e210c9;p=jabaws.git diff --git a/website/archive/binaries/mac/src/disembl/Tisean_3.0.1/source_c/fsle.c b/website/archive/binaries/mac/src/disembl/Tisean_3.0.1/source_c/fsle.c new file mode 100644 index 0000000..3faf8ea --- /dev/null +++ b/website/archive/binaries/mac/src/disembl/Tisean_3.0.1/source_c/fsle.c @@ -0,0 +1,304 @@ +/* + * This file is part of TISEAN + * + * Copyright (c) 1998-2007 Rainer Hegger, Holger Kantz, Thomas Schreiber + * + * TISEAN is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. + * + * TISEAN 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 General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with TISEAN; if not, write to the Free Software + * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + */ +/*Author: Rainer Hegger, last modified: Mar 20, 1999 */ +#include +#include +#include +#include +#include +#include "routines/tsa.h" + +#define WID_STR "Estimates the finite size Lyapunov exponent; Vulpiani et al." + + +#define NMAX 256 + +char *outfile=NULL; +char *infile=NULL; +char epsset=0,stdo=1; +double *series; +long box[NMAX][NMAX],*list; +unsigned int dim=2,delay=1,mindist=0; +unsigned int column=1; +unsigned int verbosity=0xff; +const unsigned int nmax=NMAX-1; +unsigned long length=ULONG_MAX,exclude=0; +double eps0=1.e-3,eps,epsinv,epsmax,epsfactor; +int howmany; + +struct fsle { + double time,factor,eps; + long count; +} *data; + +void show_options(char *progname) +{ + what_i_do(progname,WID_STR); + fprintf(stderr," Usage: %s [options]\n",progname); + fprintf(stderr," Options:\n"); + fprintf(stderr,"Everything not being a valid option will be interpreted" + " as a possible" + " datafile.\nIf no datafile is given stdin is read. Just - also" + " means stdin\n"); + fprintf(stderr,"\t-l # of datapoints [default is whole file]\n"); + fprintf(stderr,"\t-x # of lines to be ignored [default is 0]\n"); + fprintf(stderr,"\t-c column to read[default 1]\n"); + fprintf(stderr,"\t-m embedding dimension [default 2]\n"); + fprintf(stderr,"\t-d delay [default 1]\n"); + fprintf(stderr,"\t-t time window to omit [default 0]\n"); + fprintf(stderr,"\t-r epsilon size to start with [default " + "(std. dev. of data)/1000]\n"); + fprintf(stderr,"\t-o name of output file [default 'datafile'.fsl ," + "without -o: stdout]\n"); + fprintf(stderr,"\t-V verbosity level [default 1]\n\t\t" + "0='only panic messages'\n\t\t" + "1='+ input/output messages'\n"); + fprintf(stderr,"\t-h show these options\n"); + fprintf(stderr,"\n"); + exit(0); +} + +void scan_options(int n,char **argv) +{ + char *out; + + if ((out=check_option(argv,n,'l','u')) != NULL) + sscanf(out,"%lu",&length); + if ((out=check_option(argv,n,'x','u')) != NULL) + sscanf(out,"%lu",&exclude); + if ((out=check_option(argv,n,'c','u')) != NULL) + sscanf(out,"%u",&column); + if ((out=check_option(argv,n,'m','u')) != NULL) + sscanf(out,"%u",&dim); + if ((out=check_option(argv,n,'d','u')) != NULL) + sscanf(out,"%u",&delay); + if ((out=check_option(argv,n,'t','u')) != NULL) + sscanf(out,"%u",&mindist); + if ((out=check_option(argv,n,'V','u')) != NULL) + sscanf(out,"%u",&verbosity); + if ((out=check_option(argv,n,'r','f')) != NULL) { + epsset=1; + sscanf(out,"%lf",&eps0); + } + if ((out=check_option(argv,n,'o','o')) != NULL) { + stdo=0; + if (strlen(out) > 0) + outfile=out; + } +} + +void put_in_boxes(void) +{ + int i,j,x,y,del; + + for (i=0;i mindist) { + for (k=0;k eps) + break; + } + if (k==del1) { + if (dx < mindx) { + ok=1; + if (dx > 0.0) { + mindx=dx; + minelement=element; + } + } + } + } + element=list[element]; + } + } + } + + if ((minelement != -1) && (mindx < eps)) { + act += del1-delay+1; + minelement += del1-delay+1; + which=(int)(log(mindx/eps0)/log(epsfactor)); + if (which < 0) { + while ((dx=fabs(series[act]-series[minelement])) < data[0].eps) { + act++; + minelement++; + if ((act >= length) || (minelement >= length)) + return ok; + } + mindx=dx; + which=(int)(log(mindx/eps0)/log(epsfactor)); + } + for (i=which;i= length) || (minelement >= length)) + return ok; + stime++; + } + if (stime > 0) { + data[i].time += stime; + data[i].factor += log(dx/mindx); + data[i].count++; + } + mindx=dx; + } + } + return ok; +} + +int main(int argc,char **argv) +{ + char stdi=0,*done,alldone; + int i; + long n; + long maxlength; + double min,max,se_av,se_var,se0_av,se0_var; + FILE *file; + + if (scan_help(argc,argv)) + show_options(argv[0]); + + scan_options(argc,argv); +#ifndef OMIT_WHAT_I_DO + if (verbosity&VER_INPUT) + what_i_do(argv[0],WID_STR); +#endif + + infile=search_datafile(argc,argv,&column,verbosity); + if (infile == NULL) + stdi=1; + + if (outfile == NULL) { + if (!stdi) { + check_alloc(outfile=(char*)calloc(strlen(infile)+5,(size_t)1)); + strcpy(outfile,infile); + strcat(outfile,".fsl"); + } + else { + check_alloc(outfile=(char*)calloc((size_t)10,(size_t)1)); + strcpy(outfile,"stdin.fsl"); + } + } + if (!stdo) + test_outfile(outfile); + + series=(double*)get_series(infile,&length,exclude,column,verbosity); + variance(series,length,&se0_av,&se0_var); + rescale_data(series,length,&min,&max); + variance(series,length,&se_av,&se_var); + + if (epsset) { + eps0 /= max; + epsmax=se0_var; + } + else { + eps0 *= se_var; + epsmax=se_var; + } + if (eps0 >= epsmax) { + fprintf(stderr,"The minimal epsilon is too large. Exiting!\n"); + exit(FSLE__TOO_LARGE_MINEPS); + } + epsfactor=sqrt(2.0); + + howmany=(int)(log(epsmax/eps0)/log(epsfactor))+1; + check_alloc(data=(struct fsle*)malloc(sizeof(struct fsle)*howmany)); + eps=eps0/epsfactor; + for (i=0;i 0.0) + fprintf(file,"%e %e %ld\n",data[i].eps*max, + data[i].factor/data[i].time,data[i].count); + fclose(file); + } + else { + if (verbosity&VER_INPUT) + fprintf(stderr,"Writing to stdout\n"); + for (i=0;i 0.0) + fprintf(stdout,"%e %e %ld\n",data[i].eps*max, + data[i].factor/data[i].time,data[i].count); + } + + if (infile != NULL) + free(infile); + if (outfile != NULL) + free(outfile); + free(series); + free(data); + free(list); + free(done); + + return 0; +}