|
version 1.1, 2000/12/28 18:49:56
|
version 1.6, 2001/05/02 17:47:10
|
|
Line 1
|
Line 1
|
| |
|
| /*********************** Imach ************************************** |
/*********************** Imach **************************************
|
| This program computes Healthy Life Expectancies from cross-longitudinal |
This program computes Healthy Life Expectancies from cross-longitudinal
|
| data. Cross-longitudinal consist in a first survey ("cross") where |
data. Cross-longitudinal consist in a first survey ("cross") where
|
| individuals from different ages are interviewed on their health status |
individuals from different ages are interviewed on their health status
|
| or degree of disability. At least a second wave of interviews |
or degree of disability. At least a second wave of interviews
|
| ("longitudinal") should measure each new individual health status. |
("longitudinal") should measure each new individual health status.
|
| Health expectancies are computed from the transistions observed between |
Health expectancies are computed from the transistions observed between
|
| waves and are computed for each degree of severity of disability (number |
waves and are computed for each degree of severity of disability (number
|
| of life states). More degrees you consider, more time is necessary to |
of life states). More degrees you consider, more time is necessary to
|
| reach the Maximum Likekilhood of the parameters involved in the model. |
reach the Maximum Likelihood of the parameters involved in the model.
|
| The simplest model is the multinomial logistic model where pij is |
The simplest model is the multinomial logistic model where pij is
|
| the probabibility to be observed in state j at the second wave conditional |
the probabibility to be observed in state j at the second wave conditional
|
| to be observed in state i at the first wave. Therefore the model is: |
to be observed in state i at the first wave. Therefore the model is:
|
| log(pij/pii)= aij + bij*age+ cij*sex + etc , where 'age' is age and 'sex' |
log(pij/pii)= aij + bij*age+ cij*sex + etc , where 'age' is age and 'sex'
|
| is a covariate. If you want to have a more complex model than "constant and |
is a covariate. If you want to have a more complex model than "constant and
|
| age", you should modify the program where the markup |
age", you should modify the program where the markup
|
| *Covariates have to be included here again* invites you to do it. |
*Covariates have to be included here again* invites you to do it.
|
| More covariates you add, less is the speed of the convergence. |
More covariates you add, less is the speed of the convergence.
|
| |
|
| The advantage that this computer programme claims, comes from that if the |
The advantage that this computer programme claims, comes from that if the
|
| delay between waves is not identical for each individual, or if some |
delay between waves is not identical for each individual, or if some
|
| individual missed an interview, the information is not rounded or lost, but |
individual missed an interview, the information is not rounded or lost, but
|
| taken into account using an interpolation or extrapolation. |
taken into account using an interpolation or extrapolation.
|
| hPijx is the probability to be |
hPijx is the probability to be
|
| observed in state i at age x+h conditional to the observed state i at age |
observed in state i at age x+h conditional to the observed state i at age
|
| x. The delay 'h' can be split into an exact number (nh*stepm) of |
x. The delay 'h' can be split into an exact number (nh*stepm) of
|
| unobserved intermediate states. This elementary transition (by month or |
unobserved intermediate states. This elementary transition (by month or
|
| quarter trimester, semester or year) is model as a multinomial logistic. |
quarter trimester, semester or year) is model as a multinomial logistic.
|
| The hPx matrix is simply the matrix product of nh*stepm elementary matrices |
The hPx matrix is simply the matrix product of nh*stepm elementary matrices
|
| and the contribution of each individual to the likelihood is simply hPijx. |
and the contribution of each individual to the likelihood is simply hPijx.
|
| |
|
| Also this programme outputs the covariance matrix of the parameters but also |
Also this programme outputs the covariance matrix of the parameters but also
|
| of the life expectancies. It also computes the prevalence limits. |
of the life expectancies. It also computes the prevalence limits.
|
| |
|
| Authors: Nicolas Brouard (brouard@ined.fr) and Agnès Lièvre (lievre@ined.fr). |
Authors: Nicolas Brouard (brouard@ined.fr) and Agnès Lièvre (lievre@ined.fr).
|
| Institut national d'études démographiques, Paris. |
Institut national d'études démographiques, Paris.
|
| This software have been partly granted by Euro-REVES, a concerted action |
This software have been partly granted by Euro-REVES, a concerted action
|
| from the European Union. |
from the European Union.
|
| It is copyrighted identically to a GNU software product, ie programme and |
It is copyrighted identically to a GNU software product, ie programme and
|
| software can be distributed freely for non commercial use. Latest version |
software can be distributed freely for non commercial use. Latest version
|
| can be accessed at http://euroreves.ined.fr/imach . |
can be accessed at http://euroreves.ined.fr/imach .
|
| **********************************************************************/ |
**********************************************************************/
|
| |
|
| #include <math.h> |
#include <math.h>
|
| #include <stdio.h> |
#include <stdio.h>
|
| #include <stdlib.h> |
#include <stdlib.h>
|
| #include <unistd.h> |
#include <unistd.h>
|
| |
|
| #define MAXLINE 256 |
#define MAXLINE 256
|
| #define FILENAMELENGTH 80 |
#define FILENAMELENGTH 80
|
| /*#define DEBUG*/ |
/*#define DEBUG*/
|
| /*#define win*/ |
#define windows
|
| |
#define GLOCK_ERROR_NOPATH -1 /* empty path */
|
| #define MAXPARM 30 /* Maximum number of parameters for the optimization */ |
#define GLOCK_ERROR_GETCWD -2 /* cannot get cwd */
|
| #define NPARMAX 64 /* (nlstate+ndeath-1)*nlstate*ncov */ |
|
| |
#define MAXPARM 30 /* Maximum number of parameters for the optimization */
|
| #define NINTERVMAX 8 |
#define NPARMAX 64 /* (nlstate+ndeath-1)*nlstate*ncovmodel */
|
| #define NLSTATEMAX 8 /* Maximum number of live states (for func) */ |
|
| #define NDEATHMAX 8 /* Maximum number of dead states (for func) */ |
#define NINTERVMAX 8
|
| #define NCOVMAX 8 /* Maximum number of covariates */ |
#define NLSTATEMAX 8 /* Maximum number of live states (for func) */
|
| #define MAXN 20000 |
#define NDEATHMAX 8 /* Maximum number of dead states (for func) */
|
| #define YEARM 12. /* Number of months per year */ |
#define NCOVMAX 8 /* Maximum number of covariates */
|
| #define AGESUP 130 |
#define MAXN 20000
|
| #define AGEBASE 40 |
#define YEARM 12. /* Number of months per year */
|
| |
#define AGESUP 130
|
| |
#define AGEBASE 40
|
| int nvar; |
|
| |
|
| int npar=NPARMAX; |
int nvar;
|
| int nlstate=2; /* Number of live states */ |
static int cptcov;
|
| int ndeath=1; /* Number of dead states */ |
int cptcovn, cptcovage=0;
|
| int ncov; /* Total number of covariables including constant a12*1 +b12*x ncov=2 */ |
int npar=NPARMAX;
|
| |
int nlstate=2; /* Number of live states */
|
| int *wav; /* Number of waves for this individuual 0 is possible */ |
int ndeath=1; /* Number of dead states */
|
| int maxwav; /* Maxim number of waves */ |
int ncovmodel, ncov; /* Total number of covariables including constant a12*1 +b12*x ncovmodel=2 */
|
| int mle, weightopt; |
|
| int **mw; /* mw[mi][i] is number of the mi wave for this individual */ |
int *wav; /* Number of waves for this individuual 0 is possible */
|
| int **dh; /* dh[mi][i] is number of steps between mi,mi+1 for this individual */ |
int maxwav; /* Maxim number of waves */
|
| double **oldm, **newm, **savm; /* Working pointers to matrices */ |
int mle, weightopt;
|
| double **oldms, **newms, **savms; /* Fixed working pointers to matrices */ |
int **mw; /* mw[mi][i] is number of the mi wave for this individual */
|
| FILE *fic,*ficpar, *ficparo,*ficres, *ficrespl, *ficrespij, *ficrest; |
int **dh; /* dh[mi][i] is number of steps between mi,mi+1 for this individual */
|
| FILE *ficgp, *fichtm; |
double **oldm, **newm, **savm; /* Working pointers to matrices */
|
| |
double **oldms, **newms, **savms; /* Fixed working pointers to matrices */
|
| #define NR_END 1 |
FILE *fic,*ficpar, *ficparo,*ficres, *ficrespl, *ficrespij, *ficrest;
|
| #define FREE_ARG char* |
FILE *ficgp, *fichtm;
|
| #define FTOL 1.0e-10 |
FILE *ficreseij;
|
| |
char filerese[FILENAMELENGTH];
|
| #define NRANSI |
FILE *ficresvij;
|
| #define ITMAX 200 |
char fileresv[FILENAMELENGTH];
|
| |
FILE *ficresvpl;
|
| #define TOL 2.0e-4 |
char fileresvpl[FILENAMELENGTH];
|
| |
|
| #define CGOLD 0.3819660 |
#define NR_END 1
|
| #define ZEPS 1.0e-10 |
#define FREE_ARG char*
|
| #define SHFT(a,b,c,d) (a)=(b);(b)=(c);(c)=(d); |
#define FTOL 1.0e-10
|
| |
|
| #define GOLD 1.618034 |
#define NRANSI
|
| #define GLIMIT 100.0 |
#define ITMAX 200
|
| #define TINY 1.0e-20 |
|
| |
#define TOL 2.0e-4
|
| static double maxarg1,maxarg2; |
|
| #define FMAX(a,b) (maxarg1=(a),maxarg2=(b),(maxarg1)>(maxarg2)? (maxarg1):(maxarg2)) |
#define CGOLD 0.3819660
|
| #define FMIN(a,b) (maxarg1=(a),maxarg2=(b),(maxarg1)<(maxarg2)? (maxarg1):(maxarg2)) |
#define ZEPS 1.0e-10
|
| |
#define SHFT(a,b,c,d) (a)=(b);(b)=(c);(c)=(d);
|
| #define SIGN(a,b) ((b)>0.0 ? fabs(a) : -fabs(a)) |
|
| #define rint(a) floor(a+0.5) |
#define GOLD 1.618034
|
| |
#define GLIMIT 100.0
|
| static double sqrarg; |
#define TINY 1.0e-20
|
| #define SQR(a) ((sqrarg=(a)) == 0.0 ? 0.0 :sqrarg*sqrarg) |
|
| #define SWAP(a,b) {temp=(a);(a)=(b);(b)=temp;} |
static double maxarg1,maxarg2;
|
| |
#define FMAX(a,b) (maxarg1=(a),maxarg2=(b),(maxarg1)>(maxarg2)? (maxarg1):(maxarg2))
|
| int imx; |
#define FMIN(a,b) (maxarg1=(a),maxarg2=(b),(maxarg1)<(maxarg2)? (maxarg1):(maxarg2))
|
| int stepm; |
|
| /* Stepm, step in month: minimum step interpolation*/ |
#define SIGN(a,b) ((b)>0.0 ? fabs(a) : -fabs(a))
|
| |
#define rint(a) floor(a+0.5)
|
| int m,nb; |
|
| int *num, firstpass=0, lastpass=2,*cod; |
static double sqrarg;
|
| double **agev,*moisnais, *annais, *moisdc, *andc,**mint, **anint; |
#define SQR(a) ((sqrarg=(a)) == 0.0 ? 0.0 :sqrarg*sqrarg)
|
| double **pmmij; |
#define SWAP(a,b) {temp=(a);(a)=(b);(b)=temp;}
|
| |
|
| double *weight; |
int imx;
|
| int **s; /* Status */ |
int stepm;
|
| double *agedc, **covar, idx; |
/* Stepm, step in month: minimum step interpolation*/
|
| |
|
| |
int m,nb;
|
| double ftol=FTOL; /* Tolerance for computing Max Likelihood */ |
int *num, firstpass=0, lastpass=4,*cod, *ncodemax, *Tage;
|
| double ftolhess; /* Tolerance for computing hessian */ |
double **agev,*moisnais, *annais, *moisdc, *andc,**mint, **anint;
|
| |
double **pmmij;
|
| |
|
| /******************************************/ |
double *weight;
|
| |
int **s; /* Status */
|
| void replace(char *s, char*t) |
double *agedc, **covar, idx;
|
| { |
int **nbcode, *Tcode, *Tvar, **codtab;
|
| int i; |
|
| int lg=20; |
double ftol=FTOL; /* Tolerance for computing Max Likelihood */
|
| i=0; |
double ftolhess; /* Tolerance for computing hessian */
|
| lg=strlen(t); |
|
| for(i=0; i<= lg; i++) { |
|
| (s[i] = t[i]); |
static int split( char *path, char *dirc, char *name )
|
| if (t[i]== '\\') s[i]='/'; |
{
|
| } |
char *s; /* pointer */
|
| } |
int l1, l2; /* length counters */
|
| void cut(char *u,char *v, char*t) |
|
| { |
l1 = strlen( path ); /* length of path */
|
| int i,lg,j,p; |
if ( l1 == 0 ) return( GLOCK_ERROR_NOPATH );
|
| i=0; |
s = strrchr( path, '\\' ); /* find last / */
|
| for(j=0; j<=strlen(t); j++) { |
if ( s == NULL ) { /* no directory, so use current */
|
| if(t[j]=='\\') p=j; |
#if defined(__bsd__) /* get current working directory */
|
| } |
extern char *getwd( );
|
| |
|
| lg=strlen(t); |
if ( getwd( dirc ) == NULL ) {
|
| for(j=0; j<p; j++) { |
#else
|
| (u[j] = t[j]); |
extern char *getcwd( );
|
| u[p]='\0'; |
|
| } |
if ( getcwd( dirc, FILENAME_MAX ) == NULL ) {
|
| |
#endif
|
| for(j=0; j<= lg; j++) { |
return( GLOCK_ERROR_GETCWD );
|
| if (j>=(p+1))(v[j-p-1] = t[j]); |
}
|
| } |
strcpy( name, path ); /* we've got it */
|
| } |
} else { /* strip direcotry from path */
|
| |
s++; /* after this, the filename */
|
| /********************** nrerror ********************/ |
l2 = strlen( s ); /* length of filename */
|
| |
if ( l2 == 0 ) return( GLOCK_ERROR_NOPATH );
|
| void nrerror(char error_text[]) |
strcpy( name, s ); /* save file name */
|
| { |
strncpy( dirc, path, l1 - l2 ); /* now the directory */
|
| fprintf(stderr,"ERREUR ...\n"); |
dirc[l1-l2] = 0; /* add zero */
|
| fprintf(stderr,"%s\n",error_text); |
}
|
| exit(1); |
l1 = strlen( dirc ); /* length of directory */
|
| } |
if ( dirc[l1-1] != '\\' ) { dirc[l1] = '\\'; dirc[l1+1] = 0; }
|
| /*********************** vector *******************/ |
return( 0 ); /* we're done */
|
| double *vector(int nl, int nh) |
}
|
| { |
|
| double *v; |
|
| v=(double *) malloc((size_t)((nh-nl+1+NR_END)*sizeof(double))); |
/******************************************/
|
| if (!v) nrerror("allocation failure in vector"); |
|
| return v-nl+NR_END; |
void replace(char *s, char*t)
|
| } |
{
|
| |
int i;
|
| /************************ free vector ******************/ |
int lg=20;
|
| void free_vector(double*v, int nl, int nh) |
i=0;
|
| { |
lg=strlen(t);
|
| free((FREE_ARG)(v+nl-NR_END)); |
for(i=0; i<= lg; i++) {
|
| } |
(s[i] = t[i]);
|
| |
if (t[i]== '\\') s[i]='/';
|
| /************************ivector *******************************/ |
}
|
| int *ivector(long nl,long nh) |
}
|
| { |
|
| int *v; |
int nbocc(char *s, char occ)
|
| v=(int *) malloc((size_t)((nh-nl+1+NR_END)*sizeof(int))); |
{
|
| if (!v) nrerror("allocation failure in ivector"); |
int i,j=0;
|
| return v-nl+NR_END; |
int lg=20;
|
| } |
i=0;
|
| |
lg=strlen(s);
|
| /******************free ivector **************************/ |
for(i=0; i<= lg; i++) {
|
| void free_ivector(int *v, long nl, long nh) |
if (s[i] == occ ) j++;
|
| { |
}
|
| free((FREE_ARG)(v+nl-NR_END)); |
return j;
|
| } |
}
|
| |
|
| /******************* imatrix *******************************/ |
void cutv(char *u,char *v, char*t, char occ)
|
| int **imatrix(long nrl, long nrh, long ncl, long nch) |
{
|
| /* allocate a int matrix with subscript range m[nrl..nrh][ncl..nch] */ |
int i,lg,j,p=0;
|
| { |
i=0;
|
| long i, nrow=nrh-nrl+1,ncol=nch-ncl+1; |
for(j=0; j<=strlen(t)-1; j++) {
|
| int **m; |
if((t[j]!= occ) && (t[j+1]== occ)) p=j+1;
|
| |
}
|
| /* allocate pointers to rows */ |
|
| m=(int **) malloc((size_t)((nrow+NR_END)*sizeof(int*))); |
lg=strlen(t);
|
| if (!m) nrerror("allocation failure 1 in matrix()"); |
for(j=0; j<p; j++) {
|
| m += NR_END; |
(u[j] = t[j]);
|
| m -= nrl; |
}
|
| |
u[p]='\0';
|
| |
|
| /* allocate rows and set pointers to them */ |
for(j=0; j<= lg; j++) {
|
| m[nrl]=(int *) malloc((size_t)((nrow*ncol+NR_END)*sizeof(int))); |
if (j>=(p+1))(v[j-p-1] = t[j]);
|
| if (!m[nrl]) nrerror("allocation failure 2 in matrix()"); |
}
|
| m[nrl] += NR_END; |
}
|
| m[nrl] -= ncl; |
|
| |
/********************** nrerror ********************/
|
| for(i=nrl+1;i<=nrh;i++) m[i]=m[i-1]+ncol; |
|
| |
void nrerror(char error_text[])
|
| /* return pointer to array of pointers to rows */ |
{
|
| return m; |
fprintf(stderr,"ERREUR ...\n");
|
| } |
fprintf(stderr,"%s\n",error_text);
|
| |
exit(1);
|
| /****************** free_imatrix *************************/ |
}
|
| void free_imatrix(m,nrl,nrh,ncl,nch) |
/*********************** vector *******************/
|
| int **m; |
double *vector(int nl, int nh)
|
| long nch,ncl,nrh,nrl; |
{
|
| /* free an int matrix allocated by imatrix() */ |
double *v;
|
| { |
v=(double *) malloc((size_t)((nh-nl+1+NR_END)*sizeof(double)));
|
| free((FREE_ARG) (m[nrl]+ncl-NR_END)); |
if (!v) nrerror("allocation failure in vector");
|
| free((FREE_ARG) (m+nrl-NR_END)); |
return v-nl+NR_END;
|
| } |
}
|
| |
|
| /******************* matrix *******************************/ |
/************************ free vector ******************/
|
| double **matrix(long nrl, long nrh, long ncl, long nch) |
void free_vector(double*v, int nl, int nh)
|
| { |
{
|
| long i, nrow=nrh-nrl+1, ncol=nch-ncl+1; |
free((FREE_ARG)(v+nl-NR_END));
|
| double **m; |
}
|
| |
|
| m=(double **) malloc((size_t)((nrow+NR_END)*sizeof(double*))); |
/************************ivector *******************************/
|
| if (!m) nrerror("allocation failure 1 in matrix()"); |
int *ivector(long nl,long nh)
|
| m += NR_END; |
{
|
| m -= nrl; |
int *v;
|
| |
v=(int *) malloc((size_t)((nh-nl+1+NR_END)*sizeof(int)));
|
| m[nrl]=(double *) malloc((size_t)((nrow*ncol+NR_END)*sizeof(double))); |
if (!v) nrerror("allocation failure in ivector");
|
| if (!m[nrl]) nrerror("allocation failure 2 in matrix()"); |
return v-nl+NR_END;
|
| m[nrl] += NR_END; |
}
|
| m[nrl] -= ncl; |
|
| |
/******************free ivector **************************/
|
| for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol; |
void free_ivector(int *v, long nl, long nh)
|
| return m; |
{
|
| } |
free((FREE_ARG)(v+nl-NR_END));
|
| |
}
|
| /*************************free matrix ************************/ |
|
| void free_matrix(double **m, long nrl, long nrh, long ncl, long nch) |
/******************* imatrix *******************************/
|
| { |
int **imatrix(long nrl, long nrh, long ncl, long nch)
|
| free((FREE_ARG)(m[nrl]+ncl-NR_END)); |
/* allocate a int matrix with subscript range m[nrl..nrh][ncl..nch] */
|
| free((FREE_ARG)(m+nrl-NR_END)); |
{
|
| } |
long i, nrow=nrh-nrl+1,ncol=nch-ncl+1;
|
| |
int **m;
|
| /******************* ma3x *******************************/ |
|
| double ***ma3x(long nrl, long nrh, long ncl, long nch, long nll, long nlh) |
/* allocate pointers to rows */
|
| { |
m=(int **) malloc((size_t)((nrow+NR_END)*sizeof(int*)));
|
| long i, j, nrow=nrh-nrl+1, ncol=nch-ncl+1, nlay=nlh-nll+1; |
if (!m) nrerror("allocation failure 1 in matrix()");
|
| double ***m; |
m += NR_END;
|
| |
m -= nrl;
|
| m=(double ***) malloc((size_t)((nrow+NR_END)*sizeof(double*))); |
|
| if (!m) nrerror("allocation failure 1 in matrix()"); |
|
| m += NR_END; |
/* allocate rows and set pointers to them */
|
| m -= nrl; |
m[nrl]=(int *) malloc((size_t)((nrow*ncol+NR_END)*sizeof(int)));
|
| |
if (!m[nrl]) nrerror("allocation failure 2 in matrix()");
|
| m[nrl]=(double **) malloc((size_t)((nrow*ncol+NR_END)*sizeof(double))); |
m[nrl] += NR_END;
|
| if (!m[nrl]) nrerror("allocation failure 2 in matrix()"); |
m[nrl] -= ncl;
|
| m[nrl] += NR_END; |
|
| m[nrl] -= ncl; |
for(i=nrl+1;i<=nrh;i++) m[i]=m[i-1]+ncol;
|
| |
|
| for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol; |
/* return pointer to array of pointers to rows */
|
| |
return m;
|
| m[nrl][ncl]=(double *) malloc((size_t)((nrow*ncol*nlay+NR_END)*sizeof(double))); |
}
|
| if (!m[nrl][ncl]) nrerror("allocation failure 3 in matrix()"); |
|
| m[nrl][ncl] += NR_END; |
/****************** free_imatrix *************************/
|
| m[nrl][ncl] -= nll; |
void free_imatrix(m,nrl,nrh,ncl,nch)
|
| for (j=ncl+1; j<=nch; j++) |
int **m;
|
| m[nrl][j]=m[nrl][j-1]+nlay; |
long nch,ncl,nrh,nrl;
|
| |
/* free an int matrix allocated by imatrix() */
|
| for (i=nrl+1; i<=nrh; i++) { |
{
|
| m[i][ncl]=m[i-1l][ncl]+ncol*nlay; |
free((FREE_ARG) (m[nrl]+ncl-NR_END));
|
| for (j=ncl+1; j<=nch; j++) |
free((FREE_ARG) (m+nrl-NR_END));
|
| m[i][j]=m[i][j-1]+nlay; |
}
|
| } |
|
| return m; |
/******************* matrix *******************************/
|
| } |
double **matrix(long nrl, long nrh, long ncl, long nch)
|
| |
{
|
| /*************************free ma3x ************************/ |
long i, nrow=nrh-nrl+1, ncol=nch-ncl+1;
|
| void free_ma3x(double ***m, long nrl, long nrh, long ncl, long nch,long nll, long nlh) |
double **m;
|
| { |
|
| free((FREE_ARG)(m[nrl][ncl]+ nll-NR_END)); |
m=(double **) malloc((size_t)((nrow+NR_END)*sizeof(double*)));
|
| free((FREE_ARG)(m[nrl]+ncl-NR_END)); |
if (!m) nrerror("allocation failure 1 in matrix()");
|
| free((FREE_ARG)(m+nrl-NR_END)); |
m += NR_END;
|
| } |
m -= nrl;
|
| |
|
| /***************** f1dim *************************/ |
m[nrl]=(double *) malloc((size_t)((nrow*ncol+NR_END)*sizeof(double)));
|
| extern int ncom; |
if (!m[nrl]) nrerror("allocation failure 2 in matrix()");
|
| extern double *pcom,*xicom; |
m[nrl] += NR_END;
|
| extern double (*nrfunc)(double []); |
m[nrl] -= ncl;
|
| |
|
| double f1dim(double x) |
for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol;
|
| { |
return m;
|
| int j; |
}
|
| double f; |
|
| double *xt; |
/*************************free matrix ************************/
|
| |
void free_matrix(double **m, long nrl, long nrh, long ncl, long nch)
|
| xt=vector(1,ncom); |
{
|
| for (j=1;j<=ncom;j++) xt[j]=pcom[j]+x*xicom[j]; |
free((FREE_ARG)(m[nrl]+ncl-NR_END));
|
| f=(*nrfunc)(xt); |
free((FREE_ARG)(m+nrl-NR_END));
|
| free_vector(xt,1,ncom); |
}
|
| return f; |
|
| } |
/******************* ma3x *******************************/
|
| |
double ***ma3x(long nrl, long nrh, long ncl, long nch, long nll, long nlh)
|
| /*****************brent *************************/ |
{
|
| double brent(double ax, double bx, double cx, double (*f)(double), double tol, double *xmin) |
long i, j, nrow=nrh-nrl+1, ncol=nch-ncl+1, nlay=nlh-nll+1;
|
| { |
double ***m;
|
| int iter; |
|
| double a,b,d,etemp; |
m=(double ***) malloc((size_t)((nrow+NR_END)*sizeof(double*)));
|
| double fu,fv,fw,fx; |
if (!m) nrerror("allocation failure 1 in matrix()");
|
| double ftemp; |
m += NR_END;
|
| double p,q,r,tol1,tol2,u,v,w,x,xm; |
m -= nrl;
|
| double e=0.0; |
|
| |
m[nrl]=(double **) malloc((size_t)((nrow*ncol+NR_END)*sizeof(double)));
|
| a=(ax < cx ? ax : cx); |
if (!m[nrl]) nrerror("allocation failure 2 in matrix()");
|
| b=(ax > cx ? ax : cx); |
m[nrl] += NR_END;
|
| x=w=v=bx; |
m[nrl] -= ncl;
|
| fw=fv=fx=(*f)(x); |
|
| for (iter=1;iter<=ITMAX;iter++) { |
for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol;
|
| xm=0.5*(a+b); |
|
| tol2=2.0*(tol1=tol*fabs(x)+ZEPS); |
m[nrl][ncl]=(double *) malloc((size_t)((nrow*ncol*nlay+NR_END)*sizeof(double)));
|
| /* if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret)))*/ |
if (!m[nrl][ncl]) nrerror("allocation failure 3 in matrix()");
|
| printf(".");fflush(stdout); |
m[nrl][ncl] += NR_END;
|
| #ifdef DEBUG |
m[nrl][ncl] -= nll;
|
| printf("br %d,x=%.10e xm=%.10e b=%.10e a=%.10e tol=%.10e tol1=%.10e tol2=%.10e x-xm=%.10e fx=%.12e fu=%.12e,fw=%.12e,ftemp=%.12e,ftol=%.12e\n",iter,x,xm,b,a,tol,tol1,tol2,(x-xm),fx,fu,fw,ftemp,ftol); |
for (j=ncl+1; j<=nch; j++)
|
| /* if ((fabs(x-xm) <= (tol2-0.5*(b-a)))||(2.0*fabs(fu-ftemp) <= ftol*1.e-2*(fabs(fu)+fabs(ftemp)))) { */ |
m[nrl][j]=m[nrl][j-1]+nlay;
|
| #endif |
|
| if (fabs(x-xm) <= (tol2-0.5*(b-a))){ |
for (i=nrl+1; i<=nrh; i++) {
|
| *xmin=x; |
m[i][ncl]=m[i-1l][ncl]+ncol*nlay;
|
| return fx; |
for (j=ncl+1; j<=nch; j++)
|
| } |
m[i][j]=m[i][j-1]+nlay;
|
| ftemp=fu; |
}
|
| if (fabs(e) > tol1) { |
return m;
|
| r=(x-w)*(fx-fv); |
}
|
| q=(x-v)*(fx-fw); |
|
| p=(x-v)*q-(x-w)*r; |
/*************************free ma3x ************************/
|
| q=2.0*(q-r); |
void free_ma3x(double ***m, long nrl, long nrh, long ncl, long nch,long nll, long nlh)
|
| if (q > 0.0) p = -p; |
{
|
| q=fabs(q); |
free((FREE_ARG)(m[nrl][ncl]+ nll-NR_END));
|
| etemp=e; |
free((FREE_ARG)(m[nrl]+ncl-NR_END));
|
| e=d; |
free((FREE_ARG)(m+nrl-NR_END));
|
| if (fabs(p) >= fabs(0.5*q*etemp) || p <= q*(a-x) || p >= q*(b-x)) |
}
|
| d=CGOLD*(e=(x >= xm ? a-x : b-x)); |
|
| else { |
/***************** f1dim *************************/
|
| d=p/q; |
extern int ncom;
|
| u=x+d; |
extern double *pcom,*xicom;
|
| if (u-a < tol2 || b-u < tol2) |
extern double (*nrfunc)(double []);
|
| d=SIGN(tol1,xm-x); |
|
| } |
double f1dim(double x)
|
| } else { |
{
|
| d=CGOLD*(e=(x >= xm ? a-x : b-x)); |
int j;
|
| } |
double f;
|
| u=(fabs(d) >= tol1 ? x+d : x+SIGN(tol1,d)); |
double *xt;
|
| fu=(*f)(u); |
|
| if (fu <= fx) { |
xt=vector(1,ncom);
|
| if (u >= x) a=x; else b=x; |
for (j=1;j<=ncom;j++) xt[j]=pcom[j]+x*xicom[j];
|
| SHFT(v,w,x,u) |
f=(*nrfunc)(xt);
|
| SHFT(fv,fw,fx,fu) |
free_vector(xt,1,ncom);
|
| } else { |
return f;
|
| if (u < x) a=u; else b=u; |
}
|
| if (fu <= fw || w == x) { |
|
| v=w; |
/*****************brent *************************/
|
| w=u; |
double brent(double ax, double bx, double cx, double (*f)(double), double tol, double *xmin)
|
| fv=fw; |
{
|
| fw=fu; |
int iter;
|
| } else if (fu <= fv || v == x || v == w) { |
double a,b,d,etemp;
|
| v=u; |
double fu,fv,fw,fx;
|
| fv=fu; |
double ftemp;
|
| } |
double p,q,r,tol1,tol2,u,v,w,x,xm;
|
| } |
double e=0.0;
|
| } |
|
| nrerror("Too many iterations in brent"); |
a=(ax < cx ? ax : cx);
|
| *xmin=x; |
b=(ax > cx ? ax : cx);
|
| return fx; |
x=w=v=bx;
|
| } |
fw=fv=fx=(*f)(x);
|
| |
for (iter=1;iter<=ITMAX;iter++) {
|
| /****************** mnbrak ***********************/ |
xm=0.5*(a+b);
|
| |
tol2=2.0*(tol1=tol*fabs(x)+ZEPS);
|
| void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb, double *fc, |
/* if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret)))*/
|
| double (*func)(double)) |
printf(".");fflush(stdout);
|
| { |
#ifdef DEBUG
|
| double ulim,u,r,q, dum; |
printf("br %d,x=%.10e xm=%.10e b=%.10e a=%.10e tol=%.10e tol1=%.10e tol2=%.10e x-xm=%.10e fx=%.12e fu=%.12e,fw=%.12e,ftemp=%.12e,ftol=%.12e\n",iter,x,xm,b,a,tol,tol1,tol2,(x-xm),fx,fu,fw,ftemp,ftol);
|
| double fu; |
/* if ((fabs(x-xm) <= (tol2-0.5*(b-a)))||(2.0*fabs(fu-ftemp) <= ftol*1.e-2*(fabs(fu)+fabs(ftemp)))) { */
|
| |
#endif
|
| *fa=(*func)(*ax); |
if (fabs(x-xm) <= (tol2-0.5*(b-a))){
|
| *fb=(*func)(*bx); |
*xmin=x;
|
| if (*fb > *fa) { |
return fx;
|
| SHFT(dum,*ax,*bx,dum) |
}
|
| SHFT(dum,*fb,*fa,dum) |
ftemp=fu;
|
| } |
if (fabs(e) > tol1) {
|
| *cx=(*bx)+GOLD*(*bx-*ax); |
r=(x-w)*(fx-fv);
|
| *fc=(*func)(*cx); |
q=(x-v)*(fx-fw);
|
| while (*fb > *fc) { |
p=(x-v)*q-(x-w)*r;
|
| r=(*bx-*ax)*(*fb-*fc); |
q=2.0*(q-r);
|
| q=(*bx-*cx)*(*fb-*fa); |
if (q > 0.0) p = -p;
|
| u=(*bx)-((*bx-*cx)*q-(*bx-*ax)*r)/ |
q=fabs(q);
|
| (2.0*SIGN(FMAX(fabs(q-r),TINY),q-r)); |
etemp=e;
|
| ulim=(*bx)+GLIMIT*(*cx-*bx); |
e=d;
|
| if ((*bx-u)*(u-*cx) > 0.0) { |
if (fabs(p) >= fabs(0.5*q*etemp) || p <= q*(a-x) || p >= q*(b-x))
|
| fu=(*func)(u); |
d=CGOLD*(e=(x >= xm ? a-x : b-x));
|
| } else if ((*cx-u)*(u-ulim) > 0.0) { |
else {
|
| fu=(*func)(u); |
d=p/q;
|
| if (fu < *fc) { |
u=x+d;
|
| SHFT(*bx,*cx,u,*cx+GOLD*(*cx-*bx)) |
if (u-a < tol2 || b-u < tol2)
|
| SHFT(*fb,*fc,fu,(*func)(u)) |
d=SIGN(tol1,xm-x);
|
| } |
}
|
| } else if ((u-ulim)*(ulim-*cx) >= 0.0) { |
} else {
|
| u=ulim; |
d=CGOLD*(e=(x >= xm ? a-x : b-x));
|
| fu=(*func)(u); |
}
|
| } else { |
u=(fabs(d) >= tol1 ? x+d : x+SIGN(tol1,d));
|
| u=(*cx)+GOLD*(*cx-*bx); |
fu=(*f)(u);
|
| fu=(*func)(u); |
if (fu <= fx) {
|
| } |
if (u >= x) a=x; else b=x;
|
| SHFT(*ax,*bx,*cx,u) |
SHFT(v,w,x,u)
|
| SHFT(*fa,*fb,*fc,fu) |
SHFT(fv,fw,fx,fu)
|
| } |
} else {
|
| } |
if (u < x) a=u; else b=u;
|
| |
if (fu <= fw || w == x) {
|
| /*************** linmin ************************/ |
v=w;
|
| |
w=u;
|
| int ncom; |
fv=fw;
|
| double *pcom,*xicom; |
fw=fu;
|
| double (*nrfunc)(double []); |
} else if (fu <= fv || v == x || v == w) {
|
| |
v=u;
|
| void linmin(double p[], double xi[], int n, double *fret,double (*func)(double [])) |
fv=fu;
|
| { |
}
|
| double brent(double ax, double bx, double cx, |
}
|
| double (*f)(double), double tol, double *xmin); |
}
|
| double f1dim(double x); |
nrerror("Too many iterations in brent");
|
| void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb, |
*xmin=x;
|
| double *fc, double (*func)(double)); |
return fx;
|
| int j; |
}
|
| double xx,xmin,bx,ax; |
|
| double fx,fb,fa; |
/****************** mnbrak ***********************/
|
| |
|
| ncom=n; |
void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb, double *fc,
|
| pcom=vector(1,n); |
double (*func)(double))
|
| xicom=vector(1,n); |
{
|
| nrfunc=func; |
double ulim,u,r,q, dum;
|
| for (j=1;j<=n;j++) { |
double fu;
|
| pcom[j]=p[j]; |
|
| xicom[j]=xi[j]; |
*fa=(*func)(*ax);
|
| } |
*fb=(*func)(*bx);
|
| ax=0.0; |
if (*fb > *fa) {
|
| xx=1.0; |
SHFT(dum,*ax,*bx,dum)
|
| mnbrak(&ax,&xx,&bx,&fa,&fx,&fb,f1dim); |
SHFT(dum,*fb,*fa,dum)
|
| *fret=brent(ax,xx,bx,f1dim,TOL,&xmin); |
}
|
| #ifdef DEBUG |
*cx=(*bx)+GOLD*(*bx-*ax);
|
| printf("retour brent fret=%.12e xmin=%.12e\n",*fret,xmin); |
*fc=(*func)(*cx);
|
| #endif |
while (*fb > *fc) {
|
| for (j=1;j<=n;j++) { |
r=(*bx-*ax)*(*fb-*fc);
|
| xi[j] *= xmin; |
q=(*bx-*cx)*(*fb-*fa);
|
| p[j] += xi[j]; |
u=(*bx)-((*bx-*cx)*q-(*bx-*ax)*r)/
|
| } |
(2.0*SIGN(FMAX(fabs(q-r),TINY),q-r));
|
| free_vector(xicom,1,n); |
ulim=(*bx)+GLIMIT*(*cx-*bx);
|
| free_vector(pcom,1,n); |
if ((*bx-u)*(u-*cx) > 0.0) {
|
| } |
fu=(*func)(u);
|
| |
} else if ((*cx-u)*(u-ulim) > 0.0) {
|
| /*************** powell ************************/ |
fu=(*func)(u);
|
| void powell(double p[], double **xi, int n, double ftol, int *iter, double *fret, |
if (fu < *fc) {
|
| double (*func)(double [])) |
SHFT(*bx,*cx,u,*cx+GOLD*(*cx-*bx))
|
| |
SHFT(*fb,*fc,fu,(*func)(u))
|
| { |
}
|
| |
} else if ((u-ulim)*(ulim-*cx) >= 0.0) {
|
| |
u=ulim;
|
| void linmin(double p[], double xi[], int n, double *fret, |
fu=(*func)(u);
|
| double (*func)(double [])); |
} else {
|
| int i,ibig,j; |
u=(*cx)+GOLD*(*cx-*bx);
|
| double del,t,*pt,*ptt,*xit; |
fu=(*func)(u);
|
| double fp,fptt; |
}
|
| double *xits; |
SHFT(*ax,*bx,*cx,u)
|
| pt=vector(1,n); |
SHFT(*fa,*fb,*fc,fu)
|
| ptt=vector(1,n); |
}
|
| xit=vector(1,n); |
}
|
| xits=vector(1,n); |
|
| *fret=(*func)(p); |
/*************** linmin ************************/
|
| for (j=1;j<=n;j++) pt[j]=p[j]; |
|
| for (*iter=1;;++(*iter)) { |
int ncom;
|
| fp=(*fret); |
double *pcom,*xicom;
|
| ibig=0; |
double (*nrfunc)(double []);
|
| del=0.0; |
|
| printf("\nPowell iter=%d -2*LL=%.12f",*iter,*fret); |
void linmin(double p[], double xi[], int n, double *fret,double (*func)(double []))
|
| for (i=1;i<=n;i++) |
{
|
| printf(" %d %.12f",i, p[i]); |
double brent(double ax, double bx, double cx,
|
| printf("\n"); |
double (*f)(double), double tol, double *xmin);
|
| for (i=1;i<=n;i++) { |
double f1dim(double x);
|
| for (j=1;j<=n;j++) xit[j]=xi[j][i]; |
void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb,
|
| fptt=(*fret); |
double *fc, double (*func)(double));
|
| #ifdef DEBUG |
int j;
|
| printf("fret=%lf \n",*fret); |
double xx,xmin,bx,ax;
|
| #endif |
double fx,fb,fa;
|
| printf("%d",i);fflush(stdout); |
|
| linmin(p,xit,n,fret,func); |
ncom=n;
|
| if (fabs(fptt-(*fret)) > del) { |
pcom=vector(1,n);
|
| del=fabs(fptt-(*fret)); |
xicom=vector(1,n);
|
| ibig=i; |
nrfunc=func;
|
| } |
for (j=1;j<=n;j++) {
|
| #ifdef DEBUG |
pcom[j]=p[j];
|
| printf("%d %.12e",i,(*fret)); |
xicom[j]=xi[j];
|
| for (j=1;j<=n;j++) { |
}
|
| xits[j]=FMAX(fabs(p[j]-pt[j]),1.e-5); |
ax=0.0;
|
| printf(" x(%d)=%.12e",j,xit[j]); |
xx=1.0;
|
| } |
mnbrak(&ax,&xx,&bx,&fa,&fx,&fb,f1dim);
|
| for(j=1;j<=n;j++) |
*fret=brent(ax,xx,bx,f1dim,TOL,&xmin);
|
| printf(" p=%.12e",p[j]); |
#ifdef DEBUG
|
| printf("\n"); |
printf("retour brent fret=%.12e xmin=%.12e\n",*fret,xmin);
|
| #endif |
#endif
|
| } |
for (j=1;j<=n;j++) {
|
| if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret))) { |
xi[j] *= xmin;
|
| #ifdef DEBUG |
p[j] += xi[j];
|
| int k[2],l; |
}
|
| k[0]=1; |
free_vector(xicom,1,n);
|
| k[1]=-1; |
free_vector(pcom,1,n);
|
| printf("Max: %.12e",(*func)(p)); |
}
|
| for (j=1;j<=n;j++) |
|
| printf(" %.12e",p[j]); |
/*************** powell ************************/
|
| printf("\n"); |
void powell(double p[], double **xi, int n, double ftol, int *iter, double *fret,
|
| for(l=0;l<=1;l++) { |
double (*func)(double []))
|
| for (j=1;j<=n;j++) { |
{
|
| ptt[j]=p[j]+(p[j]-pt[j])*k[l]; |
void linmin(double p[], double xi[], int n, double *fret,
|
| printf("l=%d j=%d ptt=%.12e, xits=%.12e, p=%.12e, xit=%.12e", l,j,ptt[j],xits[j],p[j],xit[j]); |
double (*func)(double []));
|
| } |
int i,ibig,j;
|
| printf("func(ptt)=%.12e, deriv=%.12e\n",(*func)(ptt),(ptt[j]-p[j])/((*func)(ptt)-(*func)(p))); |
double del,t,*pt,*ptt,*xit;
|
| } |
double fp,fptt;
|
| #endif |
double *xits;
|
| |
pt=vector(1,n);
|
| |
ptt=vector(1,n);
|
| free_vector(xit,1,n); |
xit=vector(1,n);
|
| free_vector(xits,1,n); |
xits=vector(1,n);
|
| free_vector(ptt,1,n); |
*fret=(*func)(p);
|
| free_vector(pt,1,n); |
for (j=1;j<=n;j++) pt[j]=p[j];
|
| return; |
for (*iter=1;;++(*iter)) {
|
| } |
fp=(*fret);
|
| if (*iter == ITMAX) nrerror("powell exceeding maximum iterations."); |
ibig=0;
|
| for (j=1;j<=n;j++) { |
del=0.0;
|
| ptt[j]=2.0*p[j]-pt[j]; |
printf("\nPowell iter=%d -2*LL=%.12f",*iter,*fret);
|
| xit[j]=p[j]-pt[j]; |
for (i=1;i<=n;i++)
|
| pt[j]=p[j]; |
printf(" %d %.12f",i, p[i]);
|
| } |
printf("\n");
|
| fptt=(*func)(ptt); |
for (i=1;i<=n;i++) {
|
| if (fptt < fp) { |
for (j=1;j<=n;j++) xit[j]=xi[j][i];
|
| t=2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del)-del*SQR(fp-fptt); |
fptt=(*fret);
|
| if (t < 0.0) { |
#ifdef DEBUG
|
| linmin(p,xit,n,fret,func); |
printf("fret=%lf \n",*fret);
|
| for (j=1;j<=n;j++) { |
#endif
|
| xi[j][ibig]=xi[j][n]; |
printf("%d",i);fflush(stdout);
|
| xi[j][n]=xit[j]; |
linmin(p,xit,n,fret,func);
|
| } |
if (fabs(fptt-(*fret)) > del) {
|
| #ifdef DEBUG |
del=fabs(fptt-(*fret));
|
| printf("Direction changed last moved %d in place of ibig=%d, new last is the average:\n",n,ibig); |
ibig=i;
|
| for(j=1;j<=n;j++) |
}
|
| printf(" %.12e",xit[j]); |
#ifdef DEBUG
|
| printf("\n"); |
printf("%d %.12e",i,(*fret));
|
| #endif |
for (j=1;j<=n;j++) {
|
| } |
xits[j]=FMAX(fabs(p[j]-pt[j]),1.e-5);
|
| } |
printf(" x(%d)=%.12e",j,xit[j]);
|
| } |
}
|
| } |
for(j=1;j<=n;j++)
|
| |
printf(" p=%.12e",p[j]);
|
| /**** Prevalence limit ****************/ |
printf("\n");
|
| |
#endif
|
| double **prevalim(double **prlim, int nlstate, double x[], double age, double **oldm, double **savm, double ftolpl) |
}
|
| { |
if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret))) {
|
| /* Computes the prevalence limit in each live state at age x by left multiplying the unit |
#ifdef DEBUG
|
| matrix by transitions matrix until convergence is reached */ |
int k[2],l;
|
| |
k[0]=1;
|
| int i, ii,j,k; |
k[1]=-1;
|
| double min, max, maxmin, maxmax,sumnew=0.; |
printf("Max: %.12e",(*func)(p));
|
| double **matprod2(); |
for (j=1;j<=n;j++)
|
| double **out, cov[NCOVMAX], **pmij(); |
printf(" %.12e",p[j]);
|
| double **newm; |
printf("\n");
|
| double agefin, delaymax=50 ; /* Max number of years to converge */ |
for(l=0;l<=1;l++) {
|
| |
for (j=1;j<=n;j++) {
|
| for (ii=1;ii<=nlstate+ndeath;ii++) |
ptt[j]=p[j]+(p[j]-pt[j])*k[l];
|
| for (j=1;j<=nlstate+ndeath;j++){ |
printf("l=%d j=%d ptt=%.12e, xits=%.12e, p=%.12e, xit=%.12e", l,j,ptt[j],xits[j],p[j],xit[j]);
|
| oldm[ii][j]=(ii==j ? 1.0 : 0.0); |
}
|
| } |
printf("func(ptt)=%.12e, deriv=%.12e\n",(*func)(ptt),(ptt[j]-p[j])/((*func)(ptt)-(*func)(p)));
|
| /* Even if hstepm = 1, at least one multiplication by the unit matrix */ |
}
|
| for(agefin=age-stepm/YEARM; agefin>=age-delaymax; agefin=agefin-stepm/YEARM){ |
#endif
|
| newm=savm; |
|
| /* Covariates have to be included here again */ |
|
| cov[1]=1.; |
free_vector(xit,1,n);
|
| cov[2]=agefin; |
free_vector(xits,1,n);
|
| out=matprod2(newm, pmij(pmmij,cov,ncov,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, oldm); |
free_vector(ptt,1,n);
|
| /* printf("age=%f agefin=%f po=%f pn=%f\n",age,agefin,oldm[1][1],newm[1][1]);*/ |
free_vector(pt,1,n);
|
| |
return;
|
| savm=oldm; |
}
|
| oldm=newm; |
if (*iter == ITMAX) nrerror("powell exceeding maximum iterations.");
|
| maxmax=0.; |
for (j=1;j<=n;j++) {
|
| for(j=1;j<=nlstate;j++){ |
ptt[j]=2.0*p[j]-pt[j];
|
| min=1.; |
xit[j]=p[j]-pt[j];
|
| max=0.; |
pt[j]=p[j];
|
| for(i=1; i<=nlstate; i++) { |
}
|
| sumnew=0; |
fptt=(*func)(ptt);
|
| for(k=1; k<=ndeath; k++) sumnew+=newm[i][nlstate+k]; |
if (fptt < fp) {
|
| prlim[i][j]= newm[i][j]/(1-sumnew); |
t=2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del)-del*SQR(fp-fptt);
|
| max=FMAX(max,prlim[i][j]); |
if (t < 0.0) {
|
| min=FMIN(min,prlim[i][j]); |
linmin(p,xit,n,fret,func);
|
| } |
for (j=1;j<=n;j++) {
|
| maxmin=max-min; |
xi[j][ibig]=xi[j][n];
|
| maxmax=FMAX(maxmax,maxmin); |
xi[j][n]=xit[j];
|
| } |
}
|
| if(maxmax < ftolpl){ |
#ifdef DEBUG
|
| return prlim; |
printf("Direction changed last moved %d in place of ibig=%d, new last is the average:\n",n,ibig);
|
| } |
for(j=1;j<=n;j++)
|
| } |
printf(" %.12e",xit[j]);
|
| } |
printf("\n");
|
| |
#endif
|
| /*************** transition probabilities **********/ |
}
|
| |
}
|
| double **pmij(double **ps, double *cov, int ncov, double *x, int nlstate ) |
}
|
| { |
}
|
| double s1, s2; |
|
| /*double t34;*/ |
/**** Prevalence limit ****************/
|
| int i,j,j1, nc, ii, jj; |
|
| |
double **prevalim(double **prlim, int nlstate, double x[], double age, double **oldm, double **savm, double ftolpl, int ij)
|
| for(i=1; i<= nlstate; i++){ |
{
|
| for(j=1; j<i;j++){ |
/* Computes the prevalence limit in each live state at age x by left multiplying the unit
|
| for (nc=1, s2=0.;nc <=ncov; nc++){ |
matrix by transitions matrix until convergence is reached */
|
| /*s2 += param[i][j][nc]*cov[nc];*/ |
|
| s2 += x[(i-1)*nlstate*ncov+(j-1)*ncov+nc+(i-1)*(ndeath-1)*ncov]*cov[nc]; |
int i, ii,j,k;
|
| /*printf("Int j<i s1=%.17e, s2=%.17e\n",s1,s2);*/ |
double min, max, maxmin, maxmax,sumnew=0.;
|
| } |
double **matprod2();
|
| ps[i][j]=s2; |
double **out, cov[NCOVMAX], **pmij();
|
| /*printf("s1=%.17e, s2=%.17e\n",s1,s2);*/ |
double **newm;
|
| } |
double agefin, delaymax=50 ; /* Max number of years to converge */
|
| for(j=i+1; j<=nlstate+ndeath;j++){ |
|
| for (nc=1, s2=0.;nc <=ncov; nc++){ |
for (ii=1;ii<=nlstate+ndeath;ii++)
|
| s2 += x[(i-1)*nlstate*ncov+(j-2)*ncov+nc+(i-1)*(ndeath-1)*ncov]*cov[nc]; |
for (j=1;j<=nlstate+ndeath;j++){
|
| /*printf("Int j>i s1=%.17e, s2=%.17e %lx %lx\n",s1,s2,s1,s2);*/ |
oldm[ii][j]=(ii==j ? 1.0 : 0.0);
|
| } |
}
|
| ps[i][j]=s2; |
|
| } |
cov[1]=1.;
|
| } |
|
| for(i=1; i<= nlstate; i++){ |
/* Even if hstepm = 1, at least one multiplication by the unit matrix */
|
| s1=0; |
for(agefin=age-stepm/YEARM; agefin>=age-delaymax; agefin=agefin-stepm/YEARM){
|
| for(j=1; j<i; j++) |
newm=savm;
|
| s1+=exp(ps[i][j]); |
/* Covariates have to be included here again */
|
| for(j=i+1; j<=nlstate+ndeath; j++) |
cov[2]=agefin;
|
| s1+=exp(ps[i][j]); |
|
| ps[i][i]=1./(s1+1.); |
for (k=1; k<=cptcovn;k++) {
|
| for(j=1; j<i; j++) |
cov[2+k]=nbcode[Tvar[k]][codtab[ij][k]];
|
| ps[i][j]= exp(ps[i][j])*ps[i][i]; |
|
| for(j=i+1; j<=nlstate+ndeath; j++) |
/*printf("Tcode[ij]=%d nbcode=%d\n",Tcode[ij],nbcode[k][Tcode[ij]]);*/
|
| ps[i][j]= exp(ps[i][j])*ps[i][i]; |
}
|
| /* ps[i][nlstate+1]=1.-s1- ps[i][i];*/ /* Sum should be 1 */ |
for (k=1; k<=cptcovage;k++)
|
| } /* end i */ |
cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2];
|
| |
|
| for(ii=nlstate+1; ii<= nlstate+ndeath; ii++){ |
out=matprod2(newm, pmij(pmmij,cov,ncovmodel,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, oldm);
|
| for(jj=1; jj<= nlstate+ndeath; jj++){ |
|
| ps[ii][jj]=0; |
savm=oldm;
|
| ps[ii][ii]=1; |
oldm=newm;
|
| } |
maxmax=0.;
|
| } |
for(j=1;j<=nlstate;j++){
|
| |
min=1.;
|
| /* for(ii=1; ii<= nlstate+ndeath; ii++){ |
max=0.;
|
| for(jj=1; jj<= nlstate+ndeath; jj++){ |
for(i=1; i<=nlstate; i++) {
|
| printf("%lf ",ps[ii][jj]); |
sumnew=0;
|
| } |
for(k=1; k<=ndeath; k++) sumnew+=newm[i][nlstate+k];
|
| printf("\n "); |
prlim[i][j]= newm[i][j]/(1-sumnew);
|
| } |
max=FMAX(max,prlim[i][j]);
|
| printf("\n ");printf("%lf ",cov[2]);*/ |
min=FMIN(min,prlim[i][j]);
|
| /* |
}
|
| for(i=1; i<= npar; i++) printf("%f ",x[i]); |
maxmin=max-min;
|
| goto end;*/ |
maxmax=FMAX(maxmax,maxmin);
|
| return ps; |
}
|
| } |
if(maxmax < ftolpl){
|
| |
return prlim;
|
| /**************** Product of 2 matrices ******************/ |
}
|
| |
}
|
| double **matprod2(double **out, double **in,long nrl, long nrh, long ncl, long nch, long ncolol, long ncoloh, double **b) |
}
|
| { |
|
| /* Computes the matric product of in(1,nrh-nrl+1)(1,nch-ncl+1) times |
/*************** transition probabilities **********/
|
| b(1,nch-ncl+1)(1,ncoloh-ncolol+1) into out(...) */ |
|
| /* in, b, out are matrice of pointers which should have been initialized |
double **pmij(double **ps, double *cov, int ncovmodel, double *x, int nlstate )
|
| before: only the contents of out is modified. The function returns |
{
|
| a pointer to pointers identical to out */ |
double s1, s2;
|
| long i, j, k; |
/*double t34;*/
|
| for(i=nrl; i<= nrh; i++) |
int i,j,j1, nc, ii, jj;
|
| for(k=ncolol; k<=ncoloh; k++) |
|
| for(j=ncl,out[i][k]=0.; j<=nch; j++) |
for(i=1; i<= nlstate; i++){
|
| out[i][k] +=in[i][j]*b[j][k]; |
for(j=1; j<i;j++){
|
| |
for (nc=1, s2=0.;nc <=ncovmodel; nc++){
|
| return out; |
/*s2 += param[i][j][nc]*cov[nc];*/
|
| } |
s2 += x[(i-1)*nlstate*ncovmodel+(j-1)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc];
|
| |
/*printf("Int j<i s1=%.17e, s2=%.17e\n",s1,s2);*/
|
| |
}
|
| /************* Higher Matrix Product ***************/ |
ps[i][j]=s2;
|
| |
/*printf("s1=%.17e, s2=%.17e\n",s1,s2);*/
|
| double ***hpxij(double ***po, int nhstepm, double age, int hstepm, double *x, int nlstate, int stepm, double **oldm, double **savm ) |
}
|
| { |
for(j=i+1; j<=nlstate+ndeath;j++){
|
| /* Computes the transition matrix starting at age 'age' over 'nhstepm*hstepm*stepm' month |
for (nc=1, s2=0.;nc <=ncovmodel; nc++){
|
| duration (i.e. until |
s2 += x[(i-1)*nlstate*ncovmodel+(j-2)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc];
|
| age (in years) age+nhstepm*stepm/12) by multiplying nhstepm*hstepm matrices. |
/*printf("Int j>i s1=%.17e, s2=%.17e %lx %lx\n",s1,s2,s1,s2);*/
|
| Output is stored in matrix po[i][j][h] for h every 'hstepm' step |
}
|
| (typically every 2 years instead of every month which is too big). |
ps[i][j]=s2;
|
| Model is determined by parameters x and covariates have to be |
}
|
| included manually here. |
}
|
| |
for(i=1; i<= nlstate; i++){
|
| */ |
s1=0;
|
| |
for(j=1; j<i; j++)
|
| int i, j, d, h; |
s1+=exp(ps[i][j]);
|
| double **out, cov[NCOVMAX]; |
for(j=i+1; j<=nlstate+ndeath; j++)
|
| double **newm; |
s1+=exp(ps[i][j]);
|
| |
ps[i][i]=1./(s1+1.);
|
| /* Hstepm could be zero and should return the unit matrix */ |
for(j=1; j<i; j++)
|
| for (i=1;i<=nlstate+ndeath;i++) |
ps[i][j]= exp(ps[i][j])*ps[i][i];
|
| for (j=1;j<=nlstate+ndeath;j++){ |
for(j=i+1; j<=nlstate+ndeath; j++)
|
| oldm[i][j]=(i==j ? 1.0 : 0.0); |
ps[i][j]= exp(ps[i][j])*ps[i][i];
|
| po[i][j][0]=(i==j ? 1.0 : 0.0); |
/* ps[i][nlstate+1]=1.-s1- ps[i][i];*/ /* Sum should be 1 */
|
| } |
} /* end i */
|
| /* Even if hstepm = 1, at least one multiplication by the unit matrix */ |
|
| for(h=1; h <=nhstepm; h++){ |
for(ii=nlstate+1; ii<= nlstate+ndeath; ii++){
|
| for(d=1; d <=hstepm; d++){ |
for(jj=1; jj<= nlstate+ndeath; jj++){
|
| newm=savm; |
ps[ii][jj]=0;
|
| /* Covariates have to be included here again */ |
ps[ii][ii]=1;
|
| cov[1]=1.; |
}
|
| cov[2]=age+((h-1)*hstepm + (d-1))*stepm/YEARM; |
}
|
| /*printf("h=%d d=%d age=%f cov=%f\n",h,d,age,cov[2]);*/ |
|
| out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, |
/* for(ii=1; ii<= nlstate+ndeath; ii++){
|
| pmij(pmmij,cov,ncov,x,nlstate)); |
for(jj=1; jj<= nlstate+ndeath; jj++){
|
| savm=oldm; |
printf("%lf ",ps[ii][jj]);
|
| oldm=newm; |
}
|
| } |
printf("\n ");
|
| for(i=1; i<=nlstate+ndeath; i++) |
}
|
| for(j=1;j<=nlstate+ndeath;j++) { |
printf("\n ");printf("%lf ",cov[2]);*/
|
| po[i][j][h]=newm[i][j]; |
/*
|
| /*printf("i=%d j=%d h=%d po[i][j][h]=%f ",i,j,h,po[i][j][h]); |
for(i=1; i<= npar; i++) printf("%f ",x[i]);
|
| */ |
goto end;*/
|
| } |
return ps;
|
| } /* end h */ |
}
|
| return po; |
|
| } |
/**************** Product of 2 matrices ******************/
|
| |
|
| |
double **matprod2(double **out, double **in,long nrl, long nrh, long ncl, long nch, long ncolol, long ncoloh, double **b)
|
| /*************** log-likelihood *************/ |
{
|
| double func( double *x) |
/* Computes the matric product of in(1,nrh-nrl+1)(1,nch-ncl+1) times
|
| { |
b(1,nch-ncl+1)(1,ncoloh-ncolol+1) into out(...) */
|
| int i, ii, j, k, mi, d; |
/* in, b, out are matrice of pointers which should have been initialized
|
| double l, ll[NLSTATEMAX], cov[NCOVMAX]; |
before: only the contents of out is modified. The function returns
|
| double **out; |
a pointer to pointers identical to out */
|
| double sw; /* Sum of weights */ |
long i, j, k;
|
| double lli; /* Individual log likelihood */ |
for(i=nrl; i<= nrh; i++)
|
| long ipmx; |
for(k=ncolol; k<=ncoloh; k++)
|
| /*extern weight */ |
for(j=ncl,out[i][k]=0.; j<=nch; j++)
|
| /* We are differentiating ll according to initial status */ |
out[i][k] +=in[i][j]*b[j][k];
|
| /* for (i=1;i<=npar;i++) printf("%f ", x[i]);*/ |
|
| /*for(i=1;i<imx;i++) |
return out;
|
| printf(" %d\n",s[4][i]); |
}
|
| */ |
|
| |
|
| for(k=1; k<=nlstate; k++) ll[k]=0.; |
/************* Higher Matrix Product ***************/
|
| for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
|
| for(mi=1; mi<= wav[i]-1; mi++){ |
double ***hpxij(double ***po, int nhstepm, double age, int hstepm, double *x, int nlstate, int stepm, double **oldm, double **savm, int ij )
|
| for (ii=1;ii<=nlstate+ndeath;ii++) |
{
|
| for (j=1;j<=nlstate+ndeath;j++) oldm[ii][j]=(ii==j ? 1.0 : 0.0); |
/* Computes the transition matrix starting at age 'age' over 'nhstepm*hstepm*stepm' month
|
| for(d=0; d<dh[mi][i]; d++){ |
duration (i.e. until
|
| newm=savm; |
age (in years) age+nhstepm*stepm/12) by multiplying nhstepm*hstepm matrices.
|
| cov[1]=1.; |
Output is stored in matrix po[i][j][h] for h every 'hstepm' step
|
| cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM; |
(typically every 2 years instead of every month which is too big).
|
| out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
Model is determined by parameters x and covariates have to be
|
| 1,nlstate+ndeath,pmij(pmmij,cov,ncov,x,nlstate)); |
included manually here.
|
| savm=oldm; |
|
| oldm=newm; |
*/
|
| |
|
| |
int i, j, d, h, k;
|
| } /* end mult */ |
double **out, cov[NCOVMAX];
|
| |
double **newm;
|
| lli=log(out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]); |
|
| /* printf(" %f ",out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]);*/ |
/* Hstepm could be zero and should return the unit matrix */
|
| ipmx +=1; |
for (i=1;i<=nlstate+ndeath;i++)
|
| sw += weight[i]; |
for (j=1;j<=nlstate+ndeath;j++){
|
| ll[s[mw[mi][i]][i]] += 2*weight[i]*lli; |
oldm[i][j]=(i==j ? 1.0 : 0.0);
|
| } /* end of wave */ |
po[i][j][0]=(i==j ? 1.0 : 0.0);
|
| } /* end of individual */ |
}
|
| |
/* Even if hstepm = 1, at least one multiplication by the unit matrix */
|
| for(k=1,l=0.; k<=nlstate; k++) l += ll[k]; |
for(h=1; h <=nhstepm; h++){
|
| /* printf("l1=%f l2=%f ",ll[1],ll[2]); */ |
for(d=1; d <=hstepm; d++){
|
| l= l*ipmx/sw; /* To get the same order of magnitude as if weight=1 for every body */ |
newm=savm;
|
| return -l; |
/* Covariates have to be included here again */
|
| } |
cov[1]=1.;
|
| |
cov[2]=age+((h-1)*hstepm + (d-1))*stepm/YEARM;
|
| |
if (cptcovn>0){
|
| /*********** Maximum Likelihood Estimation ***************/ |
for (k=1; k<=cptcovn;k++) cov[2+k]=nbcode[Tvar[k]][codtab[ij][k]];
|
| |
}
|
| void mlikeli(FILE *ficres,double p[], int npar, int ncov, int nlstate, double ftol, double (*func)(double [])) |
/*printf("hxi cptcov=%d cptcode=%d\n",cptcov,cptcode);*/
|
| { |
/*printf("h=%d d=%d age=%f cov=%f\n",h,d,age,cov[2]);*/
|
| int i,j, iter; |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath,
|
| double **xi,*delti; |
pmij(pmmij,cov,ncovmodel,x,nlstate));
|
| double fret; |
savm=oldm;
|
| xi=matrix(1,npar,1,npar); |
oldm=newm;
|
| for (i=1;i<=npar;i++) |
}
|
| for (j=1;j<=npar;j++) |
for(i=1; i<=nlstate+ndeath; i++)
|
| xi[i][j]=(i==j ? 1.0 : 0.0); |
for(j=1;j<=nlstate+ndeath;j++) {
|
| printf("Powell\n"); |
po[i][j][h]=newm[i][j];
|
| powell(p,xi,npar,ftol,&iter,&fret,func); |
/*printf("i=%d j=%d h=%d po[i][j][h]=%f ",i,j,h,po[i][j][h]);
|
| |
*/
|
| printf("\n#Number of iterations = %d, -2 Log likelihood = %.12f\n",iter,func(p)); |
}
|
| fprintf(ficres,"#Number of iterations = %d, -2 Log likelihood = %.12f ",iter,func(p)); |
} /* end h */
|
| |
return po;
|
| } |
}
|
| |
|
| /**** Computes Hessian and covariance matrix ***/ |
|
| void hesscov(double **matcov, double p[], int npar, double delti[], double ftolhess, double (*func)(double [])) |
/*************** log-likelihood *************/
|
| { |
double func( double *x)
|
| double **a,**y,*x,pd; |
{
|
| double **hess; |
int i, ii, j, k, mi, d, kk;
|
| int i, j,jk; |
double l, ll[NLSTATEMAX], cov[NCOVMAX];
|
| int *indx; |
double **out;
|
| |
double sw; /* Sum of weights */
|
| double hessii(double p[], double delta, int theta, double delti[]); |
double lli; /* Individual log likelihood */
|
| double hessij(double p[], double delti[], int i, int j); |
long ipmx;
|
| void lubksb(double **a, int npar, int *indx, double b[]) ; |
/*extern weight */
|
| void ludcmp(double **a, int npar, int *indx, double *d) ; |
/* We are differentiating ll according to initial status */
|
| |
/* for (i=1;i<=npar;i++) printf("%f ", x[i]);*/
|
| |
/*for(i=1;i<imx;i++)
|
| hess=matrix(1,npar,1,npar); |
printf(" %d\n",s[4][i]);
|
| |
*/
|
| printf("\nCalculation of the hessian matrix. Wait...\n"); |
cov[1]=1.;
|
| for (i=1;i<=npar;i++){ |
|
| printf("%d",i);fflush(stdout); |
for(k=1; k<=nlstate; k++) ll[k]=0.;
|
| hess[i][i]=hessii(p,ftolhess,i,delti); |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){
|
| /*printf(" %f ",p[i]);*/ |
for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i];
|
| } |
for(mi=1; mi<= wav[i]-1; mi++){
|
| |
for (ii=1;ii<=nlstate+ndeath;ii++)
|
| for (i=1;i<=npar;i++) { |
for (j=1;j<=nlstate+ndeath;j++) oldm[ii][j]=(ii==j ? 1.0 : 0.0);
|
| for (j=1;j<=npar;j++) { |
for(d=0; d<dh[mi][i]; d++){
|
| if (j>i) { |
newm=savm;
|
| printf(".%d%d",i,j);fflush(stdout); |
cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM;
|
| hess[i][j]=hessij(p,delti,i,j); |
for (kk=1; kk<=cptcovage;kk++) {
|
| hess[j][i]=hess[i][j]; |
cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2];
|
| } |
/*printf("%d %d",kk,Tage[kk]);*/
|
| } |
}
|
| } |
/*cov[4]=covar[1][i]*cov[2];scanf("%d", i);*/
|
| printf("\n"); |
/*cov[3]=pow(cov[2],2)/1000.;*/
|
| |
|
| printf("\nInverting the hessian to get the covariance matrix. Wait...\n"); |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath,
|
| |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate));
|
| a=matrix(1,npar,1,npar); |
savm=oldm;
|
| y=matrix(1,npar,1,npar); |
oldm=newm;
|
| x=vector(1,npar); |
|
| indx=ivector(1,npar); |
|
| for (i=1;i<=npar;i++) |
} /* end mult */
|
| for (j=1;j<=npar;j++) a[i][j]=hess[i][j]; |
|
| ludcmp(a,npar,indx,&pd); |
lli=log(out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]);
|
| |
/* printf(" %f ",out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]);*/
|
| for (j=1;j<=npar;j++) { |
ipmx +=1;
|
| for (i=1;i<=npar;i++) x[i]=0; |
sw += weight[i];
|
| x[j]=1; |
ll[s[mw[mi][i]][i]] += 2*weight[i]*lli;
|
| lubksb(a,npar,indx,x); |
} /* end of wave */
|
| for (i=1;i<=npar;i++){ |
} /* end of individual */
|
| matcov[i][j]=x[i]; |
|
| } |
for(k=1,l=0.; k<=nlstate; k++) l += ll[k];
|
| } |
/* printf("l1=%f l2=%f ",ll[1],ll[2]); */
|
| |
l= l*ipmx/sw; /* To get the same order of magnitude as if weight=1 for every body */
|
| printf("\n#Hessian matrix#\n"); |
return -l;
|
| for (i=1;i<=npar;i++) { |
}
|
| for (j=1;j<=npar;j++) { |
|
| printf("%.3e ",hess[i][j]); |
|
| } |
/*********** Maximum Likelihood Estimation ***************/
|
| printf("\n"); |
|
| } |
void mlikeli(FILE *ficres,double p[], int npar, int ncovmodel, int nlstate, double ftol, double (*func)(double []))
|
| |
{
|
| /* Recompute Inverse */ |
int i,j, iter;
|
| for (i=1;i<=npar;i++) |
double **xi,*delti;
|
| for (j=1;j<=npar;j++) a[i][j]=matcov[i][j]; |
double fret;
|
| ludcmp(a,npar,indx,&pd); |
xi=matrix(1,npar,1,npar);
|
| |
for (i=1;i<=npar;i++)
|
| /* printf("\n#Hessian matrix recomputed#\n"); |
for (j=1;j<=npar;j++)
|
| |
xi[i][j]=(i==j ? 1.0 : 0.0);
|
| for (j=1;j<=npar;j++) { |
printf("Powell\n");
|
| for (i=1;i<=npar;i++) x[i]=0; |
powell(p,xi,npar,ftol,&iter,&fret,func);
|
| x[j]=1; |
|
| lubksb(a,npar,indx,x); |
printf("\n#Number of iterations = %d, -2 Log likelihood = %.12f\n",iter,func(p));
|
| for (i=1;i<=npar;i++){ |
fprintf(ficres,"#Number of iterations = %d, -2 Log likelihood = %.12f ",iter,func(p));
|
| y[i][j]=x[i]; |
|
| printf("%.3e ",y[i][j]); |
}
|
| } |
|
| printf("\n"); |
/**** Computes Hessian and covariance matrix ***/
|
| } |
void hesscov(double **matcov, double p[], int npar, double delti[], double ftolhess, double (*func)(double []))
|
| */ |
{
|
| |
double **a,**y,*x,pd;
|
| free_matrix(a,1,npar,1,npar); |
double **hess;
|
| free_matrix(y,1,npar,1,npar); |
int i, j,jk;
|
| free_vector(x,1,npar); |
int *indx;
|
| free_ivector(indx,1,npar); |
|
| free_matrix(hess,1,npar,1,npar); |
double hessii(double p[], double delta, int theta, double delti[]);
|
| |
double hessij(double p[], double delti[], int i, int j);
|
| |
void lubksb(double **a, int npar, int *indx, double b[]) ;
|
| } |
void ludcmp(double **a, int npar, int *indx, double *d) ;
|
| |
|
| /*************** hessian matrix ****************/ |
|
| double hessii( double x[], double delta, int theta, double delti[]) |
hess=matrix(1,npar,1,npar);
|
| { |
|
| int i; |
printf("\nCalculation of the hessian matrix. Wait...\n");
|
| int l=1, lmax=20; |
for (i=1;i<=npar;i++){
|
| double k1,k2; |
printf("%d",i);fflush(stdout);
|
| double p2[NPARMAX+1]; |
hess[i][i]=hessii(p,ftolhess,i,delti);
|
| double res; |
/*printf(" %f ",p[i]);*/
|
| double delt, delts, nkhi=10.,nkhif=1., khi=1.e-4; |
}
|
| double fx; |
|
| int k=0,kmax=10; |
for (i=1;i<=npar;i++) {
|
| double l1; |
for (j=1;j<=npar;j++) {
|
| |
if (j>i) {
|
| fx=func(x); |
printf(".%d%d",i,j);fflush(stdout);
|
| for (i=1;i<=npar;i++) p2[i]=x[i]; |
hess[i][j]=hessij(p,delti,i,j);
|
| for(l=0 ; l <=lmax; l++){ |
hess[j][i]=hess[i][j];
|
| l1=pow(10,l); |
}
|
| delts=delt; |
}
|
| for(k=1 ; k <kmax; k=k+1){ |
}
|
| delt = delta*(l1*k); |
printf("\n");
|
| p2[theta]=x[theta] +delt; |
|
| k1=func(p2)-fx; |
printf("\nInverting the hessian to get the covariance matrix. Wait...\n");
|
| p2[theta]=x[theta]-delt; |
|
| k2=func(p2)-fx; |
a=matrix(1,npar,1,npar);
|
| /*res= (k1-2.0*fx+k2)/delt/delt; */ |
y=matrix(1,npar,1,npar);
|
| res= (k1+k2)/delt/delt/2.; /* Divided by because L and not 2*L */ |
x=vector(1,npar);
|
| |
indx=ivector(1,npar);
|
| #ifdef DEBUG |
for (i=1;i<=npar;i++)
|
| printf("%d %d k1=%.12e k2=%.12e xk1=%.12e xk2=%.12e delt=%.12e res=%.12e l=%d k=%d,fx=%.12e\n",theta,theta,k1,k2,x[theta]+delt,x[theta]-delt,delt,res, l, k,fx); |
for (j=1;j<=npar;j++) a[i][j]=hess[i][j];
|
| #endif |
ludcmp(a,npar,indx,&pd);
|
| /*if(fabs(k1-2.0*fx+k2) <1.e-13){ */ |
|
| if((k1 <khi/nkhi/2.) || (k2 <khi/nkhi/2.)){ |
for (j=1;j<=npar;j++) {
|
| k=kmax; |
for (i=1;i<=npar;i++) x[i]=0;
|
| } |
x[j]=1;
|
| else if((k1 >khi/nkhif) || (k2 >khi/nkhif)){ /* Keeps lastvalue before 3.84/2 KHI2 5% 1d.f. */ |
lubksb(a,npar,indx,x);
|
| k=kmax; l=lmax*10.; |
for (i=1;i<=npar;i++){
|
| } |
matcov[i][j]=x[i];
|
| else if((k1 >khi/nkhi) || (k2 >khi/nkhi)){ |
}
|
| delts=delt; |
}
|
| } |
|
| } |
printf("\n#Hessian matrix#\n");
|
| } |
for (i=1;i<=npar;i++) {
|
| delti[theta]=delts; |
for (j=1;j<=npar;j++) {
|
| return res; |
printf("%.3e ",hess[i][j]);
|
| |
}
|
| } |
printf("\n");
|
| |
}
|
| double hessij( double x[], double delti[], int thetai,int thetaj) |
|
| { |
/* Recompute Inverse */
|
| int i; |
for (i=1;i<=npar;i++)
|
| int l=1, l1, lmax=20; |
for (j=1;j<=npar;j++) a[i][j]=matcov[i][j];
|
| double k1,k2,k3,k4,res,fx; |
ludcmp(a,npar,indx,&pd);
|
| double p2[NPARMAX+1]; |
|
| int k; |
/* printf("\n#Hessian matrix recomputed#\n");
|
| |
|
| fx=func(x); |
for (j=1;j<=npar;j++) {
|
| for (k=1; k<=2; k++) { |
for (i=1;i<=npar;i++) x[i]=0;
|
| for (i=1;i<=npar;i++) p2[i]=x[i]; |
x[j]=1;
|
| p2[thetai]=x[thetai]+delti[thetai]/k; |
lubksb(a,npar,indx,x);
|
| p2[thetaj]=x[thetaj]+delti[thetaj]/k; |
for (i=1;i<=npar;i++){
|
| k1=func(p2)-fx; |
y[i][j]=x[i];
|
| |
printf("%.3e ",y[i][j]);
|
| p2[thetai]=x[thetai]+delti[thetai]/k; |
}
|
| p2[thetaj]=x[thetaj]-delti[thetaj]/k; |
printf("\n");
|
| k2=func(p2)-fx; |
}
|
| |
*/
|
| p2[thetai]=x[thetai]-delti[thetai]/k; |
|
| p2[thetaj]=x[thetaj]+delti[thetaj]/k; |
free_matrix(a,1,npar,1,npar);
|
| k3=func(p2)-fx; |
free_matrix(y,1,npar,1,npar);
|
| |
free_vector(x,1,npar);
|
| p2[thetai]=x[thetai]-delti[thetai]/k; |
free_ivector(indx,1,npar);
|
| p2[thetaj]=x[thetaj]-delti[thetaj]/k; |
free_matrix(hess,1,npar,1,npar);
|
| k4=func(p2)-fx; |
|
| res=(k1-k2-k3+k4)/4.0/delti[thetai]*k/delti[thetaj]*k/2.; /* Because of L not 2*L */ |
|
| #ifdef DEBUG |
}
|
| printf("%d %d k=%d, k1=%.12e k2=%.12e k3=%.12e k4=%.12e delti/k=%.12e deltj/k=%.12e, xi-de/k=%.12e xj-de/k=%.12e res=%.12e k1234=%.12e,k1-2=%.12e,k3-4=%.12e\n",thetai,thetaj,k,k1,k2,k3,k4,delti[thetai]/k,delti[thetaj]/k,x[thetai]-delti[thetai]/k,x[thetaj]-delti[thetaj]/k, res,k1-k2-k3+k4,k1-k2,k3-k4); |
|
| #endif |
/*************** hessian matrix ****************/
|
| } |
double hessii( double x[], double delta, int theta, double delti[])
|
| return res; |
{
|
| } |
int i;
|
| |
int l=1, lmax=20;
|
| /************** Inverse of matrix **************/ |
double k1,k2;
|
| void ludcmp(double **a, int n, int *indx, double *d) |
double p2[NPARMAX+1];
|
| { |
double res;
|
| int i,imax,j,k; |
double delt, delts, nkhi=10.,nkhif=1., khi=1.e-4;
|
| double big,dum,sum,temp; |
double fx;
|
| double *vv; |
int k=0,kmax=10;
|
| |
double l1;
|
| vv=vector(1,n); |
|
| *d=1.0; |
fx=func(x);
|
| for (i=1;i<=n;i++) { |
for (i=1;i<=npar;i++) p2[i]=x[i];
|
| big=0.0; |
for(l=0 ; l <=lmax; l++){
|
| for (j=1;j<=n;j++) |
l1=pow(10,l);
|
| if ((temp=fabs(a[i][j])) > big) big=temp; |
delts=delt;
|
| if (big == 0.0) nrerror("Singular matrix in routine ludcmp"); |
for(k=1 ; k <kmax; k=k+1){
|
| vv[i]=1.0/big; |
delt = delta*(l1*k);
|
| } |
p2[theta]=x[theta] +delt;
|
| for (j=1;j<=n;j++) { |
k1=func(p2)-fx;
|
| for (i=1;i<j;i++) { |
p2[theta]=x[theta]-delt;
|
| sum=a[i][j]; |
k2=func(p2)-fx;
|
| for (k=1;k<i;k++) sum -= a[i][k]*a[k][j]; |
/*res= (k1-2.0*fx+k2)/delt/delt; */
|
| a[i][j]=sum; |
res= (k1+k2)/delt/delt/2.; /* Divided by because L and not 2*L */
|
| } |
|
| big=0.0; |
#ifdef DEBUG
|
| for (i=j;i<=n;i++) { |
printf("%d %d k1=%.12e k2=%.12e xk1=%.12e xk2=%.12e delt=%.12e res=%.12e l=%d k=%d,fx=%.12e\n",theta,theta,k1,k2,x[theta]+delt,x[theta]-delt,delt,res, l, k,fx);
|
| sum=a[i][j]; |
#endif
|
| for (k=1;k<j;k++) |
/*if(fabs(k1-2.0*fx+k2) <1.e-13){ */
|
| sum -= a[i][k]*a[k][j]; |
if((k1 <khi/nkhi/2.) || (k2 <khi/nkhi/2.)){
|
| a[i][j]=sum; |
k=kmax;
|
| if ( (dum=vv[i]*fabs(sum)) >= big) { |
}
|
| big=dum; |
else if((k1 >khi/nkhif) || (k2 >khi/nkhif)){ /* Keeps lastvalue before 3.84/2 KHI2 5% 1d.f. */
|
| imax=i; |
k=kmax; l=lmax*10.;
|
| } |
}
|
| } |
else if((k1 >khi/nkhi) || (k2 >khi/nkhi)){
|
| if (j != imax) { |
delts=delt;
|
| for (k=1;k<=n;k++) { |
}
|
| dum=a[imax][k]; |
}
|
| a[imax][k]=a[j][k]; |
}
|
| a[j][k]=dum; |
delti[theta]=delts;
|
| } |
return res;
|
| *d = -(*d); |
|
| vv[imax]=vv[j]; |
}
|
| } |
|
| indx[j]=imax; |
double hessij( double x[], double delti[], int thetai,int thetaj)
|
| if (a[j][j] == 0.0) a[j][j]=TINY; |
{
|
| if (j != n) { |
int i;
|
| dum=1.0/(a[j][j]); |
int l=1, l1, lmax=20;
|
| for (i=j+1;i<=n;i++) a[i][j] *= dum; |
double k1,k2,k3,k4,res,fx;
|
| } |
double p2[NPARMAX+1];
|
| } |
int k;
|
| free_vector(vv,1,n); /* Doesn't work */ |
|
| ; |
fx=func(x);
|
| } |
for (k=1; k<=2; k++) {
|
| |
for (i=1;i<=npar;i++) p2[i]=x[i];
|
| void lubksb(double **a, int n, int *indx, double b[]) |
p2[thetai]=x[thetai]+delti[thetai]/k;
|
| { |
p2[thetaj]=x[thetaj]+delti[thetaj]/k;
|
| int i,ii=0,ip,j; |
k1=func(p2)-fx;
|
| double sum; |
|
| |
p2[thetai]=x[thetai]+delti[thetai]/k;
|
| for (i=1;i<=n;i++) { |
p2[thetaj]=x[thetaj]-delti[thetaj]/k;
|
| ip=indx[i]; |
k2=func(p2)-fx;
|
| sum=b[ip]; |
|
| b[ip]=b[i]; |
p2[thetai]=x[thetai]-delti[thetai]/k;
|
| if (ii) |
p2[thetaj]=x[thetaj]+delti[thetaj]/k;
|
| for (j=ii;j<=i-1;j++) sum -= a[i][j]*b[j]; |
k3=func(p2)-fx;
|
| else if (sum) ii=i; |
|
| b[i]=sum; |
p2[thetai]=x[thetai]-delti[thetai]/k;
|
| } |
p2[thetaj]=x[thetaj]-delti[thetaj]/k;
|
| for (i=n;i>=1;i--) { |
k4=func(p2)-fx;
|
| sum=b[i]; |
res=(k1-k2-k3+k4)/4.0/delti[thetai]*k/delti[thetaj]*k/2.; /* Because of L not 2*L */
|
| for (j=i+1;j<=n;j++) sum -= a[i][j]*b[j]; |
#ifdef DEBUG
|
| b[i]=sum/a[i][i]; |
printf("%d %d k=%d, k1=%.12e k2=%.12e k3=%.12e k4=%.12e delti/k=%.12e deltj/k=%.12e, xi-de/k=%.12e xj-de/k=%.12e res=%.12e k1234=%.12e,k1-2=%.12e,k3-4=%.12e\n",thetai,thetaj,k,k1,k2,k3,k4,delti[thetai]/k,delti[thetaj]/k,x[thetai]-delti[thetai]/k,x[thetaj]-delti[thetaj]/k, res,k1-k2-k3+k4,k1-k2,k3-k4);
|
| } |
#endif
|
| } |
}
|
| |
return res;
|
| /************ Frequencies ********************/ |
}
|
| void freqsummary(char fileres[], int agemin, int agemax, int **s, double **agev, int nlstate, int imx) |
|
| { /* Some frequencies */ |
/************** Inverse of matrix **************/
|
| |
void ludcmp(double **a, int n, int *indx, double *d)
|
| int i, m, jk; |
{
|
| double ***freq; /* Frequencies */ |
int i,imax,j,k;
|
| double *pp; |
double big,dum,sum,temp;
|
| double pos; |
double *vv;
|
| FILE *ficresp; |
|
| char fileresp[FILENAMELENGTH]; |
vv=vector(1,n);
|
| |
*d=1.0;
|
| pp=vector(1,nlstate); |
for (i=1;i<=n;i++) {
|
| |
big=0.0;
|
| strcpy(fileresp,"p"); |
for (j=1;j<=n;j++)
|
| strcat(fileresp,fileres); |
if ((temp=fabs(a[i][j])) > big) big=temp;
|
| if((ficresp=fopen(fileresp,"w"))==NULL) { |
if (big == 0.0) nrerror("Singular matrix in routine ludcmp");
|
| printf("Problem with prevalence resultfile: %s\n", fileresp); |
vv[i]=1.0/big;
|
| exit(0); |
}
|
| } |
for (j=1;j<=n;j++) {
|
| |
for (i=1;i<j;i++) {
|
| freq= ma3x(-1,nlstate+ndeath,-1,nlstate+ndeath,agemin,agemax+3); |
sum=a[i][j];
|
| for (i=-1; i<=nlstate+ndeath; i++) |
for (k=1;k<i;k++) sum -= a[i][k]*a[k][j];
|
| for (jk=-1; jk<=nlstate+ndeath; jk++) |
a[i][j]=sum;
|
| for(m=agemin; m <= agemax+3; m++) |
}
|
| freq[i][jk][m]=0; |
big=0.0;
|
| |
for (i=j;i<=n;i++) {
|
| for (i=1; i<=imx; i++) { |
sum=a[i][j];
|
| for(m=firstpass; m<= lastpass-1; m++){ |
for (k=1;k<j;k++)
|
| if(agev[m][i]==0) agev[m][i]=agemax+1; |
sum -= a[i][k]*a[k][j];
|
| if(agev[m][i]==1) agev[m][i]=agemax+2; |
a[i][j]=sum;
|
| freq[s[m][i]][s[m+1][i]][(int)agev[m][i]] += weight[i]; |
if ( (dum=vv[i]*fabs(sum)) >= big) {
|
| freq[s[m][i]][s[m+1][i]][(int) agemax+3] += weight[i]; |
big=dum;
|
| } |
imax=i;
|
| } |
}
|
| |
}
|
| fprintf(ficresp, "#"); |
if (j != imax) {
|
| for(i=1; i<=nlstate;i++) |
for (k=1;k<=n;k++) {
|
| fprintf(ficresp, " Age Prev(%d) N(%d) N",i,i); |
dum=a[imax][k];
|
| fprintf(ficresp, "\n"); |
a[imax][k]=a[j][k];
|
| |
a[j][k]=dum;
|
| for(i=(int)agemin; i <= (int)agemax+3; i++){ |
}
|
| if(i==(int)agemax+3) |
*d = -(*d);
|
| printf("Total"); |
vv[imax]=vv[j];
|
| else |
}
|
| printf("Age %d", i); |
indx[j]=imax;
|
| for(jk=1; jk <=nlstate ; jk++){ |
if (a[j][j] == 0.0) a[j][j]=TINY;
|
| for(m=-1, pp[jk]=0; m <=nlstate+ndeath ; m++) |
if (j != n) {
|
| pp[jk] += freq[jk][m][i]; |
dum=1.0/(a[j][j]);
|
| } |
for (i=j+1;i<=n;i++) a[i][j] *= dum;
|
| for(jk=1; jk <=nlstate ; jk++){ |
}
|
| for(m=-1, pos=0; m <=0 ; m++) |
}
|
| pos += freq[jk][m][i]; |
free_vector(vv,1,n); /* Doesn't work */
|
| if(pp[jk]>=1.e-10) |
;
|
| printf(" %d.=%.0f loss[%d]=%.1f%%",jk,pp[jk],jk,100*pos/pp[jk]); |
}
|
| else |
|
| printf(" %d.=%.0f loss[%d]=NaNQ%%",jk,pp[jk],jk); |
void lubksb(double **a, int n, int *indx, double b[])
|
| } |
{
|
| for(jk=1; jk <=nlstate ; jk++){ |
int i,ii=0,ip,j;
|
| for(m=1, pp[jk]=0; m <=nlstate+ndeath; m++) |
double sum;
|
| pp[jk] += freq[jk][m][i]; |
|
| } |
for (i=1;i<=n;i++) {
|
| for(jk=1,pos=0; jk <=nlstate ; jk++) |
ip=indx[i];
|
| pos += pp[jk]; |
sum=b[ip];
|
| for(jk=1; jk <=nlstate ; jk++){ |
b[ip]=b[i];
|
| if(pos>=1.e-5) |
if (ii)
|
| printf(" %d.=%.0f prev[%d]=%.1f%%",jk,pp[jk],jk,100*pp[jk]/pos); |
for (j=ii;j<=i-1;j++) sum -= a[i][j]*b[j];
|
| else |
else if (sum) ii=i;
|
| printf(" %d.=%.0f prev[%d]=NaNQ%%",jk,pp[jk],jk); |
b[i]=sum;
|
| if( i <= (int) agemax){ |
}
|
| if(pos>=1.e-5) |
for (i=n;i>=1;i--) {
|
| fprintf(ficresp," %d %.5f %.0f %.0f",i,pp[jk]/pos, pp[jk],pos); |
sum=b[i];
|
| else |
for (j=i+1;j<=n;j++) sum -= a[i][j]*b[j];
|
| fprintf(ficresp," %d NaNq %.0f %.0f",i,pp[jk],pos); |
b[i]=sum/a[i][i];
|
| } |
}
|
| } |
}
|
| for(jk=-1; jk <=nlstate+ndeath; jk++) |
|
| for(m=-1; m <=nlstate+ndeath; m++) |
/************ Frequencies ********************/
|
| if(freq[jk][m][i] !=0 ) printf(" %d%d=%.0f",jk,m,freq[jk][m][i]); |
void freqsummary(char fileres[], int agemin, int agemax, int **s, double **agev, int nlstate, int imx, int *Tvar, int **nbcode, int *ncodemax)
|
| if(i <= (int) agemax) |
{ /* Some frequencies */
|
| fprintf(ficresp,"\n"); |
|
| printf("\n"); |
int i, m, jk, k1, i1, j1, bool, z1,z2,j;
|
| } |
double ***freq; /* Frequencies */
|
| |
double *pp;
|
| fclose(ficresp); |
double pos;
|
| free_ma3x(freq,-1,nlstate+ndeath,-1,nlstate+ndeath,(int) agemin,(int) agemax+3); |
FILE *ficresp;
|
| free_vector(pp,1,nlstate); |
char fileresp[FILENAMELENGTH];
|
| |
|
| } /* End of Freq */ |
pp=vector(1,nlstate);
|
| |
|
| /************* Waves Concatenation ***************/ |
strcpy(fileresp,"p");
|
| |
strcat(fileresp,fileres);
|
| void concatwav(int wav[], int **dh, int **mw, int **s, double *agedc, double **agev, int firstpass, int lastpass, int imx, int nlstate, int stepm) |
if((ficresp=fopen(fileresp,"w"))==NULL) {
|
| { |
printf("Problem with prevalence resultfile: %s\n", fileresp);
|
| /* Concatenates waves: wav[i] is the number of effective (useful waves) of individual i. |
exit(0);
|
| Death is a valid wave (if date is known). |
}
|
| mw[mi][i] is the mi (mi=1 to wav[i]) effective wave of individual i |
freq= ma3x(-1,nlstate+ndeath,-1,nlstate+ndeath,agemin,agemax+3);
|
| dh[m][i] of dh[mw[mi][i][i] is the delay between two effective waves m=mw[mi][i] |
j1=0;
|
| and mw[mi+1][i]. dh depends on stepm. |
|
| */ |
j=cptcovn;
|
| |
if (cptcovn<1) {j=1;ncodemax[1]=1;}
|
| int i, mi, m; |
|
| int j, k=0,jk, ju, jl,jmin=1e+5, jmax=-1; |
for(k1=1; k1<=j;k1++){
|
| float sum=0.; |
for(i1=1; i1<=ncodemax[k1];i1++){
|
| |
j1++;
|
| for(i=1; i<=imx; i++){ |
|
| mi=0; |
for (i=-1; i<=nlstate+ndeath; i++)
|
| m=firstpass; |
for (jk=-1; jk<=nlstate+ndeath; jk++)
|
| while(s[m][i] <= nlstate){ |
for(m=agemin; m <= agemax+3; m++)
|
| if(s[m][i]>=1) |
freq[i][jk][m]=0;
|
| mw[++mi][i]=m; |
|
| if(m >=lastpass) |
for (i=1; i<=imx; i++) {
|
| break; |
bool=1;
|
| else |
if (cptcovn>0) {
|
| m++; |
for (z1=1; z1<=cptcovn; z1++)
|
| }/* end while */ |
if (covar[Tvar[z1]][i]!= nbcode[Tvar[z1]][codtab[j1][z1]]) bool=0;
|
| if (s[m][i] > nlstate){ |
}
|
| mi++; /* Death is another wave */ |
if (bool==1) {
|
| /* if(mi==0) never been interviewed correctly before death */ |
for(m=firstpass; m<=lastpass-1; m++){
|
| /* Only death is a correct wave */ |
if(agev[m][i]==0) agev[m][i]=agemax+1;
|
| mw[mi][i]=m; |
if(agev[m][i]==1) agev[m][i]=agemax+2;
|
| } |
freq[s[m][i]][s[m+1][i]][(int)agev[m][i]] += weight[i];
|
| |
freq[s[m][i]][s[m+1][i]][(int) agemax+3] += weight[i];
|
| wav[i]=mi; |
}
|
| if(mi==0) |
}
|
| printf("Warning, no any valid information for:%d line=%d\n",num[i],i); |
}
|
| } |
if (cptcovn>0) {
|
| |
fprintf(ficresp, "\n#Variable");
|
| for(i=1; i<=imx; i++){ |
for (z1=1; z1<=cptcovn; z1++) fprintf(ficresp, " V%d=%d",Tvar[z1],nbcode[Tvar[z1]][codtab[j1][z1]]);
|
| for(mi=1; mi<wav[i];mi++){ |
}
|
| if (stepm <=0) |
fprintf(ficresp, "\n#");
|
| dh[mi][i]=1; |
for(i=1; i<=nlstate;i++)
|
| else{ |
fprintf(ficresp, " Age Prev(%d) N(%d) N",i,i);
|
| if (s[mw[mi+1][i]][i] > nlstate) { |
fprintf(ficresp, "\n");
|
| j= rint(agedc[i]*12-agev[mw[mi][i]][i]*12); |
|
| if(j=0) j=1; /* Survives at least one month after exam */ |
for(i=(int)agemin; i <= (int)agemax+3; i++){
|
| } |
if(i==(int)agemax+3)
|
| else{ |
printf("Total");
|
| j= rint( (agev[mw[mi+1][i]][i]*12 - agev[mw[mi][i]][i]*12)); |
else
|
| k=k+1; |
printf("Age %d", i);
|
| if (j >= jmax) jmax=j; |
for(jk=1; jk <=nlstate ; jk++){
|
| else if (j <= jmin)jmin=j; |
for(m=-1, pp[jk]=0; m <=nlstate+ndeath ; m++)
|
| sum=sum+j; |
pp[jk] += freq[jk][m][i];
|
| } |
}
|
| jk= j/stepm; |
for(jk=1; jk <=nlstate ; jk++){
|
| jl= j -jk*stepm; |
for(m=-1, pos=0; m <=0 ; m++)
|
| ju= j -(jk+1)*stepm; |
pos += freq[jk][m][i];
|
| if(jl <= -ju) |
if(pp[jk]>=1.e-10)
|
| dh[mi][i]=jk; |
printf(" %d.=%.0f loss[%d]=%.1f%%",jk,pp[jk],jk,100*pos/pp[jk]);
|
| else |
else
|
| dh[mi][i]=jk+1; |
printf(" %d.=%.0f loss[%d]=NaNQ%%",jk,pp[jk],jk);
|
| if(dh[mi][i]==0) |
}
|
| dh[mi][i]=1; /* At least one step */ |
for(jk=1; jk <=nlstate ; jk++){
|
| } |
for(m=1, pp[jk]=0; m <=nlstate+ndeath; m++)
|
| } |
pp[jk] += freq[jk][m][i];
|
| } |
}
|
| printf("Delay (in months) between two waves Min=%d Max=%d Mean=%f\n\n ",jmin, jmax,sum/k); |
for(jk=1,pos=0; jk <=nlstate ; jk++)
|
| } |
pos += pp[jk];
|
| |
for(jk=1; jk <=nlstate ; jk++){
|
| /*********** Health Expectancies ****************/ |
if(pos>=1.e-5)
|
| |
printf(" %d.=%.0f prev[%d]=%.1f%%",jk,pp[jk],jk,100*pp[jk]/pos);
|
| void evsij(char fileres[], double ***eij, double x[], int nlstate, int stepm, int bage, int fage, double **oldm, double **savm) |
else
|
| { |
printf(" %d.=%.0f prev[%d]=NaNQ%%",jk,pp[jk],jk);
|
| /* Health expectancies */ |
if( i <= (int) agemax){
|
| int i, j, nhstepm, hstepm, h; |
if(pos>=1.e-5)
|
| double age, agelim,hf; |
fprintf(ficresp," %d %.5f %.0f %.0f",i,pp[jk]/pos, pp[jk],pos);
|
| double ***p3mat; |
else
|
| |
fprintf(ficresp," %d NaNq %.0f %.0f",i,pp[jk],pos);
|
| FILE *ficreseij; |
}
|
| char filerese[FILENAMELENGTH]; |
}
|
| |
for(jk=-1; jk <=nlstate+ndeath; jk++)
|
| strcpy(filerese,"e"); |
for(m=-1; m <=nlstate+ndeath; m++)
|
| strcat(filerese,fileres); |
if(freq[jk][m][i] !=0 ) printf(" %d%d=%.0f",jk,m,freq[jk][m][i]);
|
| if((ficreseij=fopen(filerese,"w"))==NULL) { |
if(i <= (int) agemax)
|
| printf("Problem with Health Exp. resultfile: %s\n", filerese); exit(0); |
fprintf(ficresp,"\n");
|
| } |
printf("\n");
|
| printf("Computing Health Expectancies: result on file '%s' \n", filerese); |
}
|
| |
}
|
| fprintf(ficreseij,"# Health expectancies\n"); |
}
|
| fprintf(ficreseij,"# Age"); |
|
| for(i=1; i<=nlstate;i++) |
fclose(ficresp);
|
| for(j=1; j<=nlstate;j++) |
free_ma3x(freq,-1,nlstate+ndeath,-1,nlstate+ndeath,(int) agemin,(int) agemax+3);
|
| fprintf(ficreseij," %1d-%1d",i,j); |
free_vector(pp,1,nlstate);
|
| fprintf(ficreseij,"\n"); |
|
| |
} /* End of Freq */
|
| hstepm=1*YEARM; /* Every j years of age (in month) */ |
|
| hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */ |
/************* Waves Concatenation ***************/
|
| |
|
| agelim=AGESUP; |
void concatwav(int wav[], int **dh, int **mw, int **s, double *agedc, double **agev, int firstpass, int lastpass, int imx, int nlstate, int stepm)
|
| for (age=bage; age<=fage; age ++){ /* If stepm=6 months */ |
{
|
| /* nhstepm age range expressed in number of stepm */ |
/* Concatenates waves: wav[i] is the number of effective (useful waves) of individual i.
|
| nhstepm=(int) rint((agelim-age)*YEARM/stepm); |
Death is a valid wave (if date is known).
|
| /* Typically if 20 years = 20*12/6=40 stepm */ |
mw[mi][i] is the mi (mi=1 to wav[i]) effective wave of individual i
|
| if (stepm >= YEARM) hstepm=1; |
dh[m][i] of dh[mw[mi][i][i] is the delay between two effective waves m=mw[mi][i]
|
| nhstepm = nhstepm/hstepm;/* Expressed in hstepm, typically 40/4=10 */ |
and mw[mi+1][i]. dh depends on stepm.
|
| p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
*/
|
| /* Computed by stepm unit matrices, product of hstepm matrices, stored |
|
| in an array of nhstepm length: nhstepm=10, hstepm=4, stepm=6 months */ |
int i, mi, m;
|
| hpxij(p3mat,nhstepm,age,hstepm,x,nlstate,stepm,oldm, savm); |
int j, k=0,jk, ju, jl,jmin=1e+5, jmax=-1;
|
| |
float sum=0.;
|
| |
|
| for(i=1; i<=nlstate;i++) |
for(i=1; i<=imx; i++){
|
| for(j=1; j<=nlstate;j++) |
mi=0;
|
| for (h=0, eij[i][j][(int)age]=0; h<=nhstepm; h++){ |
m=firstpass;
|
| eij[i][j][(int)age] +=p3mat[i][j][h]; |
while(s[m][i] <= nlstate){
|
| } |
if(s[m][i]>=1)
|
| |
mw[++mi][i]=m;
|
| hf=1; |
if(m >=lastpass)
|
| if (stepm >= YEARM) hf=stepm/YEARM; |
break;
|
| fprintf(ficreseij,"%.0f",age ); |
else
|
| for(i=1; i<=nlstate;i++) |
m++;
|
| for(j=1; j<=nlstate;j++){ |
}/* end while */
|
| fprintf(ficreseij," %.4f", hf*eij[i][j][(int)age]); |
if (s[m][i] > nlstate){
|
| } |
mi++; /* Death is another wave */
|
| fprintf(ficreseij,"\n"); |
/* if(mi==0) never been interviewed correctly before death */
|
| free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
/* Only death is a correct wave */
|
| } |
mw[mi][i]=m;
|
| fclose(ficreseij); |
}
|
| } |
|
| |
wav[i]=mi;
|
| /************ Variance ******************/ |
if(mi==0)
|
| void varevsij(char fileres[], double ***vareij, double **matcov, double x[], double delti[], int nlstate, int stepm, double bage, double fage, double **oldm, double **savm, double **prlim, double ftolpl) |
printf("Warning, no any valid information for:%d line=%d\n",num[i],i);
|
| { |
}
|
| /* Variance of health expectancies */ |
|
| /* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/ |
for(i=1; i<=imx; i++){
|
| double **newm; |
for(mi=1; mi<wav[i];mi++){
|
| double **dnewm,**doldm; |
if (stepm <=0)
|
| int i, j, nhstepm, hstepm, h; |
dh[mi][i]=1;
|
| int k; |
else{
|
| FILE *ficresvij; |
if (s[mw[mi+1][i]][i] > nlstate) {
|
| char fileresv[FILENAMELENGTH]; |
j= rint(agedc[i]*12-agev[mw[mi][i]][i]*12);
|
| double *xp; |
if(j=0) j=1; /* Survives at least one month after exam */
|
| double **gp, **gm; |
}
|
| double ***gradg, ***trgradg; |
else{
|
| double ***p3mat; |
j= rint( (agev[mw[mi+1][i]][i]*12 - agev[mw[mi][i]][i]*12));
|
| double age,agelim; |
k=k+1;
|
| int theta; |
if (j >= jmax) jmax=j;
|
| |
else if (j <= jmin)jmin=j;
|
| strcpy(fileresv,"v"); |
sum=sum+j;
|
| strcat(fileresv,fileres); |
}
|
| if((ficresvij=fopen(fileresv,"w"))==NULL) { |
jk= j/stepm;
|
| printf("Problem with variance resultfile: %s\n", fileresv);exit(0); |
jl= j -jk*stepm;
|
| } |
ju= j -(jk+1)*stepm;
|
| printf("Computing Variance-covariance of DFLEs: file '%s' \n", fileresv); |
if(jl <= -ju)
|
| |
dh[mi][i]=jk;
|
| |
else
|
| fprintf(ficresvij,"# Covariances of life expectancies\n"); |
dh[mi][i]=jk+1;
|
| fprintf(ficresvij,"# Age"); |
if(dh[mi][i]==0)
|
| for(i=1; i<=nlstate;i++) |
dh[mi][i]=1; /* At least one step */
|
| for(j=1; j<=nlstate;j++) |
}
|
| fprintf(ficresvij," Cov(e%1d, e%1d)",i,j); |
}
|
| fprintf(ficresvij,"\n"); |
}
|
| |
printf("Delay (in months) between two waves Min=%d Max=%d Mean=%f\n\n ",jmin, jmax,sum/k);
|
| xp=vector(1,npar); |
}
|
| dnewm=matrix(1,nlstate,1,npar); |
/*********** Tricode ****************************/
|
| doldm=matrix(1,nlstate,1,nlstate); |
void tricode(int *Tvar, int **nbcode, int imx)
|
| |
{
|
| hstepm=1*YEARM; /* Every year of age */ |
int Ndum[80],ij=1, k, j, i, Ntvar[20];
|
| hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */ |
int cptcode=0;
|
| agelim = AGESUP; |
for (k=0; k<79; k++) Ndum[k]=0;
|
| for (age=bage; age<=fage; age ++){ /* If stepm=6 months */ |
for (k=1; k<=7; k++) ncodemax[k]=0;
|
| nhstepm=(int) rint((agelim-age)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */ |
|
| if (stepm >= YEARM) hstepm=1; |
for (j=1; j<=cptcovn; j++) {
|
| nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
for (i=1; i<=imx; i++) {
|
| p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
ij=(int)(covar[Tvar[j]][i]);
|
| gradg=ma3x(0,nhstepm,1,npar,1,nlstate); |
Ndum[ij]++;
|
| gp=matrix(0,nhstepm,1,nlstate); |
if (ij > cptcode) cptcode=ij;
|
| gm=matrix(0,nhstepm,1,nlstate); |
}
|
| |
/*printf("cptcode=%d cptcovn=%d ",cptcode,cptcovn);*/
|
| for(theta=1; theta <=npar; theta++){ |
for (i=0; i<=cptcode; i++) {
|
| for(i=1; i<=npar; i++){ /* Computes gradient */ |
if(Ndum[i]!=0) ncodemax[j]++;
|
| xp[i] = x[i] + (i==theta ?delti[theta]:0); |
}
|
| } |
|
| hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm); |
ij=1;
|
| prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl); |
for (i=1; i<=ncodemax[j]; i++) {
|
| for(j=1; j<= nlstate; j++){ |
for (k=0; k<=79; k++) {
|
| for(h=0; h<=nhstepm; h++){ |
if (Ndum[k] != 0) {
|
| for(i=1, gp[h][j]=0.;i<=nlstate;i++) |
nbcode[Tvar[j]][ij]=k;
|
| gp[h][j] += prlim[i][i]*p3mat[i][j][h]; |
ij++;
|
| } |
}
|
| } |
if (ij > ncodemax[j]) break;
|
| |
}
|
| for(i=1; i<=npar; i++) /* Computes gradient */ |
}
|
| xp[i] = x[i] - (i==theta ?delti[theta]:0); |
}
|
| hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm); |
|
| prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl); |
}
|
| for(j=1; j<= nlstate; j++){ |
|
| for(h=0; h<=nhstepm; h++){ |
/*********** Health Expectancies ****************/
|
| for(i=1, gm[h][j]=0.;i<=nlstate;i++) |
|
| gm[h][j] += prlim[i][i]*p3mat[i][j][h]; |
void evsij(char fileres[], double ***eij, double x[], int nlstate, int stepm, int bage, int fage, double **oldm, double **savm, int ij)
|
| } |
{
|
| } |
/* Health expectancies */
|
| for(j=1; j<= nlstate; j++) |
int i, j, nhstepm, hstepm, h;
|
| for(h=0; h<=nhstepm; h++){ |
double age, agelim,hf;
|
| gradg[h][theta][j]= (gp[h][j]-gm[h][j])/2./delti[theta]; |
double ***p3mat;
|
| } |
|
| } /* End theta */ |
fprintf(ficreseij,"# Health expectancies\n");
|
| |
fprintf(ficreseij,"# Age");
|
| trgradg =ma3x(0,nhstepm,1,nlstate,1,npar); |
for(i=1; i<=nlstate;i++)
|
| |
for(j=1; j<=nlstate;j++)
|
| for(h=0; h<=nhstepm; h++) |
fprintf(ficreseij," %1d-%1d",i,j);
|
| for(j=1; j<=nlstate;j++) |
fprintf(ficreseij,"\n");
|
| for(theta=1; theta <=npar; theta++) |
|
| trgradg[h][j][theta]=gradg[h][theta][j]; |
hstepm=1*YEARM; /* Every j years of age (in month) */
|
| |
hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */
|
| for(i=1;i<=nlstate;i++) |
|
| for(j=1;j<=nlstate;j++) |
agelim=AGESUP;
|
| vareij[i][j][(int)age] =0.; |
for (age=bage; age<=fage; age ++){ /* If stepm=6 months */
|
| for(h=0;h<=nhstepm;h++){ |
/* nhstepm age range expressed in number of stepm */
|
| for(k=0;k<=nhstepm;k++){ |
nhstepm=(int) rint((agelim-age)*YEARM/stepm);
|
| matprod2(dnewm,trgradg[h],1,nlstate,1,npar,1,npar,matcov); |
/* Typically if 20 years = 20*12/6=40 stepm */
|
| matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg[k]); |
if (stepm >= YEARM) hstepm=1;
|
| for(i=1;i<=nlstate;i++) |
nhstepm = nhstepm/hstepm;/* Expressed in hstepm, typically 40/4=10 */
|
| for(j=1;j<=nlstate;j++) |
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
|
| vareij[i][j][(int)age] += doldm[i][j]; |
/* Computed by stepm unit matrices, product of hstepm matrices, stored
|
| } |
in an array of nhstepm length: nhstepm=10, hstepm=4, stepm=6 months */
|
| } |
hpxij(p3mat,nhstepm,age,hstepm,x,nlstate,stepm,oldm, savm, ij);
|
| h=1; |
|
| if (stepm >= YEARM) h=stepm/YEARM; |
|
| fprintf(ficresvij,"%.0f ",age ); |
for(i=1; i<=nlstate;i++)
|
| for(i=1; i<=nlstate;i++) |
for(j=1; j<=nlstate;j++)
|
| for(j=1; j<=nlstate;j++){ |
for (h=0, eij[i][j][(int)age]=0; h<=nhstepm; h++){
|
| fprintf(ficresvij," %.4f", h*vareij[i][j][(int)age]); |
eij[i][j][(int)age] +=p3mat[i][j][h];
|
| } |
}
|
| fprintf(ficresvij,"\n"); |
|
| free_matrix(gp,0,nhstepm,1,nlstate); |
hf=1;
|
| free_matrix(gm,0,nhstepm,1,nlstate); |
if (stepm >= YEARM) hf=stepm/YEARM;
|
| free_ma3x(gradg,0,nhstepm,1,npar,1,nlstate); |
fprintf(ficreseij,"%.0f",age );
|
| free_ma3x(trgradg,0,nhstepm,1,nlstate,1,npar); |
for(i=1; i<=nlstate;i++)
|
| free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
for(j=1; j<=nlstate;j++){
|
| } /* End age */ |
fprintf(ficreseij," %.4f", hf*eij[i][j][(int)age]);
|
| fclose(ficresvij); |
}
|
| free_vector(xp,1,npar); |
fprintf(ficreseij,"\n");
|
| free_matrix(doldm,1,nlstate,1,npar); |
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
|
| free_matrix(dnewm,1,nlstate,1,nlstate); |
}
|
| |
}
|
| } |
|
| |
/************ Variance ******************/
|
| /************ Variance of prevlim ******************/ |
void varevsij(char fileres[], double ***vareij, double **matcov, double x[], double delti[], int nlstate, int stepm, double bage, double fage, double **oldm, double **savm, double **prlim, double ftolpl, int ij)
|
| void varprevlim(char fileres[], double **varpl, double **matcov, double x[], double delti[], int nlstate, int stepm, double bage, double fage, double **oldm, double **savm, double **prlim, double ftolpl) |
{
|
| { |
/* Variance of health expectancies */
|
| /* Variance of health expectancies */ |
/* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/
|
| /* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/ |
double **newm;
|
| double **newm; |
double **dnewm,**doldm;
|
| double **dnewm,**doldm; |
int i, j, nhstepm, hstepm, h;
|
| int i, j, nhstepm, hstepm; |
int k, cptcode;
|
| int k; |
double *xp;
|
| FILE *ficresvpl; |
double **gp, **gm;
|
| char fileresvpl[FILENAMELENGTH]; |
double ***gradg, ***trgradg;
|
| double *xp; |
double ***p3mat;
|
| double *gp, *gm; |
double age,agelim;
|
| double **gradg, **trgradg; |
int theta;
|
| double age,agelim; |
|
| int theta; |
fprintf(ficresvij,"# Covariances of life expectancies\n");
|
| |
fprintf(ficresvij,"# Age");
|
| strcpy(fileresvpl,"vpl"); |
for(i=1; i<=nlstate;i++)
|
| strcat(fileresvpl,fileres); |
for(j=1; j<=nlstate;j++)
|
| if((ficresvpl=fopen(fileresvpl,"w"))==NULL) { |
fprintf(ficresvij," Cov(e%1d, e%1d)",i,j);
|
| printf("Problem with variance prev lim resultfile: %s\n", fileresvpl); |
fprintf(ficresvij,"\n");
|
| exit(0); |
|
| } |
xp=vector(1,npar);
|
| printf("Computing Variance-covariance of Prevalence limit: file '%s' \n", fileresvpl); |
dnewm=matrix(1,nlstate,1,npar);
|
| |
doldm=matrix(1,nlstate,1,nlstate);
|
| |
|
| fprintf(ficresvpl,"# Standard deviation of prevalences limit\n"); |
hstepm=1*YEARM; /* Every year of age */
|
| fprintf(ficresvpl,"# Age"); |
hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */
|
| for(i=1; i<=nlstate;i++) |
agelim = AGESUP;
|
| fprintf(ficresvpl," %1d-%1d",i,i); |
for (age=bage; age<=fage; age ++){ /* If stepm=6 months */
|
| fprintf(ficresvpl,"\n"); |
nhstepm=(int) rint((agelim-age)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */
|
| |
if (stepm >= YEARM) hstepm=1;
|
| xp=vector(1,npar); |
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */
|
| dnewm=matrix(1,nlstate,1,npar); |
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
|
| doldm=matrix(1,nlstate,1,nlstate); |
gradg=ma3x(0,nhstepm,1,npar,1,nlstate);
|
| |
gp=matrix(0,nhstepm,1,nlstate);
|
| hstepm=1*YEARM; /* Every year of age */ |
gm=matrix(0,nhstepm,1,nlstate);
|
| hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */ |
|
| agelim = AGESUP; |
for(theta=1; theta <=npar; theta++){
|
| for (age=bage; age<=fage; age ++){ /* If stepm=6 months */ |
for(i=1; i<=npar; i++){ /* Computes gradient */
|
| nhstepm=(int) rint((agelim-age)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */ |
xp[i] = x[i] + (i==theta ?delti[theta]:0);
|
| if (stepm >= YEARM) hstepm=1; |
}
|
| nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij);
|
| gradg=matrix(1,npar,1,nlstate); |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
|
| gp=vector(1,nlstate); |
for(j=1; j<= nlstate; j++){
|
| gm=vector(1,nlstate); |
for(h=0; h<=nhstepm; h++){
|
| |
for(i=1, gp[h][j]=0.;i<=nlstate;i++)
|
| for(theta=1; theta <=npar; theta++){ |
gp[h][j] += prlim[i][i]*p3mat[i][j][h];
|
| for(i=1; i<=npar; i++){ /* Computes gradient */ |
}
|
| xp[i] = x[i] + (i==theta ?delti[theta]:0); |
}
|
| } |
|
| prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl); |
for(i=1; i<=npar; i++) /* Computes gradient */
|
| for(i=1;i<=nlstate;i++) |
xp[i] = x[i] - (i==theta ?delti[theta]:0);
|
| gp[i] = prlim[i][i]; |
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij);
|
| |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
|
| for(i=1; i<=npar; i++) /* Computes gradient */ |
for(j=1; j<= nlstate; j++){
|
| xp[i] = x[i] - (i==theta ?delti[theta]:0); |
for(h=0; h<=nhstepm; h++){
|
| prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl); |
for(i=1, gm[h][j]=0.;i<=nlstate;i++)
|
| for(i=1;i<=nlstate;i++) |
gm[h][j] += prlim[i][i]*p3mat[i][j][h];
|
| gm[i] = prlim[i][i]; |
}
|
| |
}
|
| for(i=1;i<=nlstate;i++) |
for(j=1; j<= nlstate; j++)
|
| gradg[theta][i]= (gp[i]-gm[i])/2./delti[theta]; |
for(h=0; h<=nhstepm; h++){
|
| } /* End theta */ |
gradg[h][theta][j]= (gp[h][j]-gm[h][j])/2./delti[theta];
|
| |
}
|
| trgradg =matrix(1,nlstate,1,npar); |
} /* End theta */
|
| |
|
| for(j=1; j<=nlstate;j++) |
trgradg =ma3x(0,nhstepm,1,nlstate,1,npar);
|
| for(theta=1; theta <=npar; theta++) |
|
| trgradg[j][theta]=gradg[theta][j]; |
for(h=0; h<=nhstepm; h++)
|
| |
for(j=1; j<=nlstate;j++)
|
| for(i=1;i<=nlstate;i++) |
for(theta=1; theta <=npar; theta++)
|
| varpl[i][(int)age] =0.; |
trgradg[h][j][theta]=gradg[h][theta][j];
|
| matprod2(dnewm,trgradg,1,nlstate,1,npar,1,npar,matcov); |
|
| matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg); |
for(i=1;i<=nlstate;i++)
|
| for(i=1;i<=nlstate;i++) |
for(j=1;j<=nlstate;j++)
|
| varpl[i][(int)age] = doldm[i][i]; /* Covariances are useless */ |
vareij[i][j][(int)age] =0.;
|
| |
for(h=0;h<=nhstepm;h++){
|
| fprintf(ficresvpl,"%.0f ",age ); |
for(k=0;k<=nhstepm;k++){
|
| for(i=1; i<=nlstate;i++) |
matprod2(dnewm,trgradg[h],1,nlstate,1,npar,1,npar,matcov);
|
| fprintf(ficresvpl," %.5f (%.5f)",prlim[i][i],sqrt(varpl[i][(int)age])); |
matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg[k]);
|
| fprintf(ficresvpl,"\n"); |
for(i=1;i<=nlstate;i++)
|
| free_vector(gp,1,nlstate); |
for(j=1;j<=nlstate;j++)
|
| free_vector(gm,1,nlstate); |
vareij[i][j][(int)age] += doldm[i][j];
|
| free_matrix(gradg,1,npar,1,nlstate); |
}
|
| free_matrix(trgradg,1,nlstate,1,npar); |
}
|
| } /* End age */ |
h=1;
|
| fclose(ficresvpl); |
if (stepm >= YEARM) h=stepm/YEARM;
|
| free_vector(xp,1,npar); |
fprintf(ficresvij,"%.0f ",age );
|
| free_matrix(doldm,1,nlstate,1,npar); |
for(i=1; i<=nlstate;i++)
|
| free_matrix(dnewm,1,nlstate,1,nlstate); |
for(j=1; j<=nlstate;j++){
|
| |
fprintf(ficresvij," %.4f", h*vareij[i][j][(int)age]);
|
| } |
}
|
| |
fprintf(ficresvij,"\n");
|
| |
free_matrix(gp,0,nhstepm,1,nlstate);
|
| |
free_matrix(gm,0,nhstepm,1,nlstate);
|
| /***********************************************/ |
free_ma3x(gradg,0,nhstepm,1,npar,1,nlstate);
|
| /**************** Main Program *****************/ |
free_ma3x(trgradg,0,nhstepm,1,nlstate,1,npar);
|
| /***********************************************/ |
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
|
| |
} /* End age */
|
| /*int main(int argc, char *argv[])*/ |
|
| int main() |
free_vector(xp,1,npar);
|
| { |
free_matrix(doldm,1,nlstate,1,npar);
|
| |
free_matrix(dnewm,1,nlstate,1,nlstate);
|
| int i,j, k, n=MAXN,iter,m,size; |
|
| double agedeb, agefin,hf; |
}
|
| double agemin=1.e20, agemax=-1.e20; |
|
| |
/************ Variance of prevlim ******************/
|
| double fret; |
void varprevlim(char fileres[], double **varpl, double **matcov, double x[], double delti[], int nlstate, int stepm, double bage, double fage, double **oldm, double **savm, double **prlim, double ftolpl, int ij)
|
| double **xi,tmp,delta; |
{
|
| |
/* Variance of prevalence limit */
|
| double dum; /* Dummy variable */ |
/* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/
|
| double ***p3mat; |
double **newm;
|
| int *indx; |
double **dnewm,**doldm;
|
| char line[MAXLINE], linepar[MAXLINE]; |
int i, j, nhstepm, hstepm;
|
| char title[MAXLINE]; |
int k, cptcode;
|
| char optionfile[FILENAMELENGTH], datafile[FILENAMELENGTH], filerespl[FILENAMELENGTH]; |
double *xp;
|
| char fileres[FILENAMELENGTH], filerespij[FILENAMELENGTH], filereso[FILENAMELENGTH]; |
double *gp, *gm;
|
| char filerest[FILENAMELENGTH]; |
double **gradg, **trgradg;
|
| char fileregp[FILENAMELENGTH]; |
double age,agelim;
|
| char path[80],pathc[80],pathcd[80],pathtot[80]; |
int theta;
|
| int firstobs=1, lastobs=10; |
|
| int sdeb, sfin; /* Status at beginning and end */ |
fprintf(ficresvpl,"# Standard deviation of prevalences limit\n");
|
| int c, h , cpt,l; |
fprintf(ficresvpl,"# Age");
|
| int ju,jl, mi; |
for(i=1; i<=nlstate;i++)
|
| int i1,j1, k1,jk,aa,bb, stepsize; |
fprintf(ficresvpl," %1d-%1d",i,i);
|
| int jnais,jdc,jint4,jint1,jint2,jint3,**outcome,**adl,*tab; |
fprintf(ficresvpl,"\n");
|
| |
|
| int hstepm, nhstepm; |
xp=vector(1,npar);
|
| double bage, fage, age, agelim, agebase; |
dnewm=matrix(1,nlstate,1,npar);
|
| double ftolpl=FTOL; |
doldm=matrix(1,nlstate,1,nlstate);
|
| double **prlim; |
|
| double *severity; |
hstepm=1*YEARM; /* Every year of age */
|
| double ***param; /* Matrix of parameters */ |
hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */
|
| double *p; |
agelim = AGESUP;
|
| double **matcov; /* Matrix of covariance */ |
for (age=bage; age<=fage; age ++){ /* If stepm=6 months */
|
| double ***delti3; /* Scale */ |
nhstepm=(int) rint((agelim-age)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */
|
| double *delti; /* Scale */ |
if (stepm >= YEARM) hstepm=1;
|
| double ***eij, ***vareij; |
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */
|
| double **varpl; /* Variances of prevalence limits by age */ |
gradg=matrix(1,npar,1,nlstate);
|
| double *epj, vepp; |
gp=vector(1,nlstate);
|
| char version[80]="Imach version 0.64, May 2000, INED-EUROREVES "; |
gm=vector(1,nlstate);
|
| char *alph[]={"a","a","b","c","d","e"}, str[4]; |
|
| char z[1]="c"; |
for(theta=1; theta <=npar; theta++){
|
| #include <sys/time.h> |
for(i=1; i<=npar; i++){ /* Computes gradient */
|
| #include <time.h> |
xp[i] = x[i] + (i==theta ?delti[theta]:0);
|
| |
}
|
| /* long total_usecs; |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
|
| struct timeval start_time, end_time; |
for(i=1;i<=nlstate;i++)
|
| |
gp[i] = prlim[i][i];
|
| gettimeofday(&start_time, (struct timezone*)0); */ /* at first time */ |
|
| |
for(i=1; i<=npar; i++) /* Computes gradient */
|
| |
xp[i] = x[i] - (i==theta ?delti[theta]:0);
|
| printf("\nIMACH, Version 0.64"); |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
|
| printf("\nEnter the parameter file name: "); |
for(i=1;i<=nlstate;i++)
|
| #define windows 1 |
gm[i] = prlim[i][i];
|
| #ifdef windows |
|
| scanf("%s",pathtot); |
for(i=1;i<=nlstate;i++)
|
| getcwd(pathcd, size); |
gradg[theta][i]= (gp[i]-gm[i])/2./delti[theta];
|
| cut(path,optionfile,pathtot); |
} /* End theta */
|
| chdir(path); |
|
| replace(pathc,path); |
trgradg =matrix(1,nlstate,1,npar);
|
| #endif |
|
| #ifdef unix |
for(j=1; j<=nlstate;j++)
|
| scanf("%s",optionfile); |
for(theta=1; theta <=npar; theta++)
|
| #endif |
trgradg[j][theta]=gradg[theta][j];
|
| |
|
| /*-------- arguments in the command line --------*/ |
for(i=1;i<=nlstate;i++)
|
| |
varpl[i][(int)age] =0.;
|
| strcpy(fileres,"r"); |
matprod2(dnewm,trgradg,1,nlstate,1,npar,1,npar,matcov);
|
| strcat(fileres, optionfile); |
matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg);
|
| |
for(i=1;i<=nlstate;i++)
|
| /*---------arguments file --------*/ |
varpl[i][(int)age] = doldm[i][i]; /* Covariances are useless */
|
| |
|
| if((ficpar=fopen(optionfile,"r"))==NULL) { |
fprintf(ficresvpl,"%.0f ",age );
|
| printf("Problem with optionfile %s\n",optionfile); |
for(i=1; i<=nlstate;i++)
|
| goto end; |
fprintf(ficresvpl," %.5f (%.5f)",prlim[i][i],sqrt(varpl[i][(int)age]));
|
| } |
fprintf(ficresvpl,"\n");
|
| |
free_vector(gp,1,nlstate);
|
| strcpy(filereso,"o"); |
free_vector(gm,1,nlstate);
|
| strcat(filereso,fileres); |
free_matrix(gradg,1,npar,1,nlstate);
|
| if((ficparo=fopen(filereso,"w"))==NULL) { |
free_matrix(trgradg,1,nlstate,1,npar);
|
| printf("Problem with Output resultfile: %s\n", filereso);goto end; |
} /* End age */
|
| } |
|
| |
free_vector(xp,1,npar);
|
| /*--------- index.htm --------*/ |
free_matrix(doldm,1,nlstate,1,npar);
|
| |
free_matrix(dnewm,1,nlstate,1,nlstate);
|
| if((fichtm=fopen("index.htm","w"))==NULL) { |
|
| printf("Problem with index.htm \n");goto end; |
}
|
| } |
|
| |
|
| fprintf(fichtm,"<body><ul><li>Outputs files<br><br>\n |
|
| - Observed prevalence in each state: <a href=\"p%s\">p%s</a> <br>\n |
/***********************************************/
|
| - Estimated parameters and the covariance matrix: <a href=\"%s\">%s</a> <br> |
/**************** Main Program *****************/
|
| - Stationary prevalence in each state: <a href=\"pl%s\">pl%s</a> <br> |
/***********************************************/
|
| - Transition probabilities: <a href=\"pij%s\">pij%s</a><br> |
|
| - Copy of the parameter file: <a href=\"o%s\">o%s</a><br> |
/*int main(int argc, char *argv[])*/
|
| - Life expectancies by age and initial health status: <a href=\"e%s\">e%s</a> <br> |
int main()
|
| - Variances of life expectancies by age and initial health status: <a href=\"v%s\">v%s</a><br> |
{
|
| - Health expectancies with their variances: <a href=\"t%s\">t%s</a> <br> |
|
| - Standard deviation of stationary prevalences: <a href=\"vpl%s\">vpl%s</a> <br><br>",fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres); |
int i,j, k, n=MAXN,iter,m,size,cptcode, aaa, cptcod;
|
| |
double agedeb, agefin,hf;
|
| fprintf(fichtm," <li>Graphs<br> <br>"); |
double agemin=1.e20, agemax=-1.e20;
|
| |
|
| for(cpt=1; cpt<nlstate;cpt++) |
double fret;
|
| fprintf(fichtm,"- Prevalence of disability: p%s1.gif<br> |
double **xi,tmp,delta;
|
| <img src=\"p%s1.gif\"><br>",strtok(optionfile, "."),strtok(optionfile, "."),cpt); |
|
| for(cpt=1; cpt<=nlstate;cpt++) |
double dum; /* Dummy variable */
|
| fprintf(fichtm,"- Observed and stationary prevalence (with confident |
double ***p3mat;
|
| interval) in state (%d): v%s%d.gif <br> |
int *indx;
|
| <img src=\"v%s%d.gif\"><br>",cpt,strtok(optionfile, "."),cpt,strtok(optionfile, "."),cpt); |
char line[MAXLINE], linepar[MAXLINE];
|
| |
char title[MAXLINE];
|
| for(cpt=1; cpt<=nlstate;cpt++) |
char optionfile[FILENAMELENGTH], datafile[FILENAMELENGTH], filerespl[FILENAMELENGTH];
|
| fprintf(fichtm,"- Health life expectancies by age and initial health state (%d): exp%s%d.gif <br> |
char fileres[FILENAMELENGTH], filerespij[FILENAMELENGTH], filereso[FILENAMELENGTH];
|
| <img src=\"ex%s%d.gif\"><br>",cpt,strtok(optionfile, "."),cpt,strtok(optionfile, "."),cpt); |
char filerest[FILENAMELENGTH];
|
| |
char fileregp[FILENAMELENGTH];
|
| fprintf(fichtm,"- Total life expectancy by age and |
char path[80],pathc[80],pathcd[80],pathtot[80],model[20];
|
| health expectancies in states (1) and (2): e%s.gif<br> |
int firstobs=1, lastobs=10;
|
| <img src=\"e%s.gif\"></li> </ul></body>",strtok(optionfile, "."),strtok(optionfile, ".")); |
int sdeb, sfin; /* Status at beginning and end */
|
| |
int c, h , cpt,l;
|
| |
int ju,jl, mi;
|
| fclose(fichtm); |
int i1,j1, k1,k2,k3,jk,aa,bb, stepsize;
|
| |
int jnais,jdc,jint4,jint1,jint2,jint3,**outcome,**adl,*tab;
|
| /* Reads comments: lines beginning with '#' */ |
|
| while((c=getc(ficpar))=='#' && c!= EOF){ |
int hstepm, nhstepm;
|
| ungetc(c,ficpar); |
double bage, fage, age, agelim, agebase;
|
| fgets(line, MAXLINE, ficpar); |
double ftolpl=FTOL;
|
| puts(line); |
double **prlim;
|
| fputs(line,ficparo); |
double *severity;
|
| } |
double ***param; /* Matrix of parameters */
|
| ungetc(c,ficpar); |
double *p;
|
| |
double **matcov; /* Matrix of covariance */
|
| fscanf(ficpar,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%lf stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\n",title, datafile, &lastobs, &firstpass,&lastpass,&ftol, &stepm, &ncov, &nlstate,&ndeath, &maxwav, &mle, &weightopt); |
double ***delti3; /* Scale */
|
| printf("title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncov, nlstate,ndeath, maxwav, mle, weightopt); |
double *delti; /* Scale */
|
| fprintf(ficparo,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\n", title, datafile, lastobs, firstpass,lastpass,ftol,stepm,ncov,nlstate,ndeath,maxwav, mle, weightopt); |
double ***eij, ***vareij;
|
| |
double **varpl; /* Variances of prevalence limits by age */
|
| nvar=ncov-1; /* Suppressing age as a basic covariate */ |
double *epj, vepp;
|
| |
char version[80]="Imach version 62c, May 1999, INED-EUROREVES ";
|
| /* Read guess parameters */ |
char *alph[]={"a","a","b","c","d","e"}, str[4];
|
| /* Reads comments: lines beginning with '#' */ |
|
| while((c=getc(ficpar))=='#' && c!= EOF){ |
char z[1]="c", occ;
|
| ungetc(c,ficpar); |
#include <sys/time.h>
|
| fgets(line, MAXLINE, ficpar); |
#include <time.h>
|
| puts(line); |
char stra[80], strb[80], strc[80], strd[80],stre[80],modelsav[80];
|
| fputs(line,ficparo); |
/* long total_usecs;
|
| } |
struct timeval start_time, end_time;
|
| ungetc(c,ficpar); |
|
| |
gettimeofday(&start_time, (struct timezone*)0); */ /* at first time */
|
| param= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncov); |
|
| for(i=1; i <=nlstate; i++) |
|
| for(j=1; j <=nlstate+ndeath-1; j++){ |
printf("\nIMACH, Version 0.64a");
|
| fscanf(ficpar,"%1d%1d",&i1,&j1); |
printf("\nEnter the parameter file name: ");
|
| fprintf(ficparo,"%1d%1d",i1,j1); |
|
| printf("%1d%1d",i,j); |
#ifdef windows
|
| for(k=1; k<=ncov;k++){ |
scanf("%s",pathtot);
|
| fscanf(ficpar," %lf",¶m[i][j][k]); |
getcwd(pathcd, size);
|
| printf(" %lf",param[i][j][k]); |
/*cygwin_split_path(pathtot,path,optionfile);
|
| fprintf(ficparo," %lf",param[i][j][k]); |
printf("pathtot=%s, path=%s, optionfile=%s\n",pathtot,path,optionfile);*/
|
| } |
/* cutv(path,optionfile,pathtot,'\\');*/
|
| fscanf(ficpar,"\n"); |
|
| printf("\n"); |
split(pathtot, path,optionfile);
|
| fprintf(ficparo,"\n"); |
chdir(path);
|
| } |
replace(pathc,path);
|
| |
#endif
|
| npar= (nlstate+ndeath-1)*nlstate*ncov; |
#ifdef unix
|
| p=param[1][1]; |
scanf("%s",optionfile);
|
| |
#endif
|
| /* Reads comments: lines beginning with '#' */ |
|
| while((c=getc(ficpar))=='#' && c!= EOF){ |
/*-------- arguments in the command line --------*/
|
| ungetc(c,ficpar); |
|
| fgets(line, MAXLINE, ficpar); |
strcpy(fileres,"r");
|
| puts(line); |
strcat(fileres, optionfile);
|
| fputs(line,ficparo); |
|
| } |
/*---------arguments file --------*/
|
| ungetc(c,ficpar); |
|
| |
if((ficpar=fopen(optionfile,"r"))==NULL) {
|
| delti3= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncov); |
printf("Problem with optionfile %s\n",optionfile);
|
| delti=vector(1,npar); /* Scale of each paramater (output from hesscov) */ |
goto end;
|
| for(i=1; i <=nlstate; i++){ |
}
|
| for(j=1; j <=nlstate+ndeath-1; j++){ |
|
| fscanf(ficpar,"%1d%1d",&i1,&j1); |
strcpy(filereso,"o");
|
| printf("%1d%1d",i,j); |
strcat(filereso,fileres);
|
| fprintf(ficparo,"%1d%1d",i1,j1); |
if((ficparo=fopen(filereso,"w"))==NULL) {
|
| for(k=1; k<=ncov;k++){ |
printf("Problem with Output resultfile: %s\n", filereso);goto end;
|
| fscanf(ficpar,"%le",&delti3[i][j][k]); |
}
|
| printf(" %le",delti3[i][j][k]); |
|
| fprintf(ficparo," %le",delti3[i][j][k]); |
/* Reads comments: lines beginning with '#' */
|
| } |
while((c=getc(ficpar))=='#' && c!= EOF){
|
| fscanf(ficpar,"\n"); |
ungetc(c,ficpar);
|
| printf("\n"); |
fgets(line, MAXLINE, ficpar);
|
| fprintf(ficparo,"\n"); |
puts(line);
|
| } |
fputs(line,ficparo);
|
| } |
}
|
| delti=delti3[1][1]; |
ungetc(c,ficpar);
|
| |
|
| /* Reads comments: lines beginning with '#' */ |
fscanf(ficpar,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%lf stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n",title, datafile, &lastobs, &firstpass,&lastpass,&ftol, &stepm, &ncov, &nlstate,&ndeath, &maxwav, &mle, &weightopt,model);
|
| while((c=getc(ficpar))=='#' && c!= EOF){ |
printf("title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncov, nlstate,ndeath, maxwav, mle, weightopt,model);
|
| ungetc(c,ficpar); |
fprintf(ficparo,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol,stepm,ncov,nlstate,ndeath,maxwav, mle, weightopt,model);
|
| fgets(line, MAXLINE, ficpar); |
|
| puts(line); |
covar=matrix(0,NCOVMAX,1,n);
|
| fputs(line,ficparo); |
if (strlen(model)<=1) cptcovn=0;
|
| } |
else {
|
| ungetc(c,ficpar); |
j=0;
|
| |
j=nbocc(model,'+');
|
| matcov=matrix(1,npar,1,npar); |
cptcovn=j+1;
|
| for(i=1; i <=npar; i++){ |
}
|
| fscanf(ficpar,"%s",&str); |
|
| printf("%s",str); |
ncovmodel=2+cptcovn;
|
| fprintf(ficparo,"%s",str); |
nvar=ncovmodel-1; /* Suppressing age as a basic covariate */
|
| for(j=1; j <=i; j++){ |
|
| fscanf(ficpar," %le",&matcov[i][j]); |
/* Read guess parameters */
|
| printf(" %.5le",matcov[i][j]); |
/* Reads comments: lines beginning with '#' */
|
| fprintf(ficparo," %.5le",matcov[i][j]); |
while((c=getc(ficpar))=='#' && c!= EOF){
|
| } |
ungetc(c,ficpar);
|
| fscanf(ficpar,"\n"); |
fgets(line, MAXLINE, ficpar);
|
| printf("\n"); |
puts(line);
|
| fprintf(ficparo,"\n"); |
fputs(line,ficparo);
|
| } |
}
|
| for(i=1; i <=npar; i++) |
ungetc(c,ficpar);
|
| for(j=i+1;j<=npar;j++) |
|
| matcov[i][j]=matcov[j][i]; |
param= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel);
|
| |
for(i=1; i <=nlstate; i++)
|
| printf("\n"); |
for(j=1; j <=nlstate+ndeath-1; j++){
|
| |
fscanf(ficpar,"%1d%1d",&i1,&j1);
|
| |
fprintf(ficparo,"%1d%1d",i1,j1);
|
| if(mle==1){ |
printf("%1d%1d",i,j);
|
| /*-------- data file ----------*/ |
for(k=1; k<=ncovmodel;k++){
|
| if((ficres =fopen(fileres,"w"))==NULL) { |
fscanf(ficpar," %lf",¶m[i][j][k]);
|
| printf("Problem with resultfile: %s\n", fileres);goto end; |
printf(" %lf",param[i][j][k]);
|
| } |
fprintf(ficparo," %lf",param[i][j][k]);
|
| fprintf(ficres,"#%s\n",version); |
}
|
| |
fscanf(ficpar,"\n");
|
| if((fic=fopen(datafile,"r"))==NULL) { |
printf("\n");
|
| printf("Problem with datafile: %s\n", datafile);goto end; |
fprintf(ficparo,"\n");
|
| } |
}
|
| |
|
| n= lastobs; |
npar= (nlstate+ndeath-1)*nlstate*ncovmodel;
|
| severity = vector(1,maxwav); |
p=param[1][1];
|
| outcome=imatrix(1,maxwav+1,1,n); |
|
| num=ivector(1,n); |
/* Reads comments: lines beginning with '#' */
|
| moisnais=vector(1,n); |
while((c=getc(ficpar))=='#' && c!= EOF){
|
| annais=vector(1,n); |
ungetc(c,ficpar);
|
| moisdc=vector(1,n); |
fgets(line, MAXLINE, ficpar);
|
| andc=vector(1,n); |
puts(line);
|
| agedc=vector(1,n); |
fputs(line,ficparo);
|
| cod=ivector(1,n); |
}
|
| weight=vector(1,n); |
ungetc(c,ficpar);
|
| for(i=1;i<=n;i++) weight[i]=1.0; /* Equal weights, 1 by default */ |
|
| mint=matrix(1,maxwav,1,n); |
delti3= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel);
|
| anint=matrix(1,maxwav,1,n); |
delti=vector(1,npar); /* Scale of each paramater (output from hesscov) */
|
| covar=matrix(1,NCOVMAX,1,n); |
for(i=1; i <=nlstate; i++){
|
| s=imatrix(1,maxwav+1,1,n); |
for(j=1; j <=nlstate+ndeath-1; j++){
|
| adl=imatrix(1,maxwav+1,1,n); |
fscanf(ficpar,"%1d%1d",&i1,&j1);
|
| tab=ivector(1,NCOVMAX); |
printf("%1d%1d",i,j);
|
| i=1; |
fprintf(ficparo,"%1d%1d",i1,j1);
|
| while (fgets(line, MAXLINE, fic) != NULL) { |
for(k=1; k<=ncovmodel;k++){
|
| if ((i >= firstobs) && (i <lastobs)) { |
fscanf(ficpar,"%le",&delti3[i][j][k]);
|
| sscanf(line,"%d %lf %lf %lf %lf/%lf %lf/%lf %lf/%lf %d %lf/%lf %d %lf/%lf %d %lf/%lf %d", &num[i], &covar[1][i], &covar[2][i],&weight[i],&moisnais[i],&annais[i],&moisdc[i],&andc[i], &mint[1][i], &anint[1][i], &s[1][i], &mint[2][i],&anint[2][i], &s[2][i],&mint[3][i],&anint[3][i], &s[3][i],&mint[4][i],&anint[4][i], &s[4][i]); |
printf(" %le",delti3[i][j][k]);
|
| i=i+1; |
fprintf(ficparo," %le",delti3[i][j][k]);
|
| } |
}
|
| } |
fscanf(ficpar,"\n");
|
| imx=i-1; /* Number of individuals */ |
printf("\n");
|
| |
fprintf(ficparo,"\n");
|
| fclose(fic); |
}
|
| |
}
|
| if (weightopt != 1) { /* Maximisation without weights*/ |
delti=delti3[1][1];
|
| for(i=1;i<=n;i++) weight[i]=1.0; |
|
| } |
/* Reads comments: lines beginning with '#' */
|
| /*-calculation of age at interview from date of interview and age at death -*/ |
while((c=getc(ficpar))=='#' && c!= EOF){
|
| agev=matrix(1,maxwav,1,imx); |
ungetc(c,ficpar);
|
| |
fgets(line, MAXLINE, ficpar);
|
| for (i=1; i<=imx; i++) { |
puts(line);
|
| agedc[i]=(moisdc[i]/12.+andc[i])-(moisnais[i]/12.+annais[i]); |
fputs(line,ficparo);
|
| for(m=1; (m<= maxwav); m++){ |
}
|
| if(s[m][i] >0){ |
ungetc(c,ficpar);
|
| if (s[m][i] == nlstate+1) { |
|
| if(agedc[i]>0) |
matcov=matrix(1,npar,1,npar);
|
| agev[m][i]=agedc[i]; |
for(i=1; i <=npar; i++){
|
| else{ |
fscanf(ficpar,"%s",&str);
|
| printf("Warning negative age at death: %d line:%d\n",num[i],i); |
printf("%s",str);
|
| agev[m][i]=-1; |
fprintf(ficparo,"%s",str);
|
| } |
for(j=1; j <=i; j++){
|
| } |
fscanf(ficpar," %le",&matcov[i][j]);
|
| else if(s[m][i] !=9){ /* Should no more exist */ |
printf(" %.5le",matcov[i][j]);
|
| agev[m][i]=(mint[m][i]/12.+1./24.+anint[m][i])-(moisnais[i]/12.+1./24.+annais[i]); |
fprintf(ficparo," %.5le",matcov[i][j]);
|
| if(mint[m][i]==99 || anint[m][i]==9999) |
}
|
| agev[m][i]=1; |
fscanf(ficpar,"\n");
|
| else if(agev[m][i] <agemin){ |
printf("\n");
|
| agemin=agev[m][i]; |
fprintf(ficparo,"\n");
|
| /*printf(" Min anint[%d][%d]=%.2f annais[%d]=%.2f, agemin=%.2f\n",m,i,anint[m][i], i,annais[i], agemin);*/ |
}
|
| } |
for(i=1; i <=npar; i++)
|
| else if(agev[m][i] >agemax){ |
for(j=i+1;j<=npar;j++)
|
| agemax=agev[m][i]; |
matcov[i][j]=matcov[j][i];
|
| /* printf(" anint[%d][%d]=%.0f annais[%d]=%.0f, agemax=%.0f\n",m,i,anint[m][i], i,annais[i], agemax);*/ |
|
| } |
printf("\n");
|
| /*agev[m][i]=anint[m][i]-annais[i];*/ |
|
| /* agev[m][i] = age[i]+2*m;*/ |
|
| } |
/*-------- data file ----------*/
|
| else { /* =9 */ |
if((ficres =fopen(fileres,"w"))==NULL) {
|
| agev[m][i]=1; |
printf("Problem with resultfile: %s\n", fileres);goto end;
|
| s[m][i]=-1; |
}
|
| } |
fprintf(ficres,"#%s\n",version);
|
| } |
|
| else /*= 0 Unknown */ |
if((fic=fopen(datafile,"r"))==NULL) {
|
| agev[m][i]=1; |
printf("Problem with datafile: %s\n", datafile);goto end;
|
| } |
}
|
| |
|
| } |
n= lastobs;
|
| for (i=1; i<=imx; i++) { |
severity = vector(1,maxwav);
|
| for(m=1; (m<= maxwav); m++){ |
outcome=imatrix(1,maxwav+1,1,n);
|
| if (s[m][i] > (nlstate+ndeath)) { |
num=ivector(1,n);
|
| printf("Error: Wrong value in nlstate or ndeath\n"); |
moisnais=vector(1,n);
|
| goto end; |
annais=vector(1,n);
|
| } |
moisdc=vector(1,n);
|
| } |
andc=vector(1,n);
|
| } |
agedc=vector(1,n);
|
| |
cod=ivector(1,n);
|
| printf("Total number of individuals= %d, Agemin = %.2f, Agemax= %.2f\n\n", imx, agemin, agemax); |
weight=vector(1,n);
|
| |
for(i=1;i<=n;i++) weight[i]=1.0; /* Equal weights, 1 by default */
|
| free_vector(severity,1,maxwav); |
mint=matrix(1,maxwav,1,n);
|
| free_imatrix(outcome,1,maxwav+1,1,n); |
anint=matrix(1,maxwav,1,n);
|
| free_vector(moisnais,1,n); |
s=imatrix(1,maxwav+1,1,n);
|
| free_vector(annais,1,n); |
adl=imatrix(1,maxwav+1,1,n);
|
| free_matrix(mint,1,maxwav,1,n); |
tab=ivector(1,NCOVMAX);
|
| free_matrix(anint,1,maxwav,1,n); |
ncodemax=ivector(1,8);
|
| free_vector(moisdc,1,n); |
|
| free_vector(andc,1,n); |
i=1;
|
| |
while (fgets(line, MAXLINE, fic) != NULL) {
|
| |
if ((i >= firstobs) && (i <=lastobs)) {
|
| wav=ivector(1,imx); |
|
| dh=imatrix(1,lastpass-firstpass+1,1,imx); |
for (j=maxwav;j>=1;j--){
|
| mw=imatrix(1,lastpass-firstpass+1,1,imx); |
cutv(stra, strb,line,' '); s[j][i]=atoi(strb);
|
| |
strcpy(line,stra);
|
| /* Concatenates waves */ |
cutv(stra, strb,line,'/'); anint[j][i]=(double)(atoi(strb)); strcpy(line,stra);
|
| concatwav(wav, dh, mw, s, agedc, agev, firstpass, lastpass, imx, nlstate, stepm); |
cutv(stra, strb,line,' '); mint[j][i]=(double)(atoi(strb)); strcpy(line,stra);
|
| |
}
|
| /* Calculates basic frequencies. Computes observed prevalence at single age |
|
| and prints on file fileres'p'. */ |
cutv(stra, strb,line,'/'); andc[i]=(double)(atoi(strb)); strcpy(line,stra);
|
| freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx); |
cutv(stra, strb,line,' '); moisdc[i]=(double)(atoi(strb)); strcpy(line,stra);
|
| |
|
| pmmij= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
cutv(stra, strb,line,'/'); annais[i]=(double)(atoi(strb)); strcpy(line,stra);
|
| oldms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
cutv(stra, strb,line,' '); moisnais[i]=(double)(atoi(strb)); strcpy(line,stra);
|
| newms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
|
| savms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
cutv(stra, strb,line,' '); weight[i]=(double)(atoi(strb)); strcpy(line,stra);
|
| oldm=oldms; newm=newms; savm=savms; /* Keeps fixed addresses to free */ |
for (j=ncov;j>=1;j--){
|
| |
cutv(stra, strb,line,' '); covar[j][i]=(double)(atoi(strb)); strcpy(line,stra);
|
| /* For Powell, parameters are in a vector p[] starting at p[1] |
}
|
| so we point p on param[1][1] so that p[1] maps on param[1][1][1] */ |
num[i]=atol(stra);
|
| p=param[1][1]; /* *(*(*(param +1)+1)+0) */ |
|
| |
/*printf("%d %.lf %.lf %.lf %.lf/%.lf %.lf/%.lf %.lf/%.lf %d %.lf/%.lf %d %.lf/%.lf %d %.lf/%.lf %d\n",num[i],(covar[1][i]), (covar[2][i]), (weight[i]), (moisnais[i]), (annais[i]), (moisdc[i]), (andc[i]), (mint[1][i]), (anint[1][i]), (s[1][i]), (mint[2][i]), (anint[2][i]), (s[2][i]), (mint[3][i]), (anint[3][i]), (s[3][i]), (mint[4][i]), (anint[4][i]), (s[4][i]));*/
|
| mlikeli(ficres,p, npar, ncov, nlstate, ftol, func); |
|
| |
i=i+1;
|
| |
}
|
| /*--------- results files --------------*/ |
}
|
| fprintf(ficres,"\ntitle=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncov, nlstate, ndeath, maxwav, mle,weightopt); |
|
| |
/*scanf("%d",i);*/
|
| jk=1; |
imx=i-1; /* Number of individuals */
|
| fprintf(ficres,"# Parameters\n"); |
|
| printf("# Parameters\n"); |
/* Calculation of the number of parameter from char model*/
|
| for(i=1,jk=1; i <=nlstate; i++){ |
Tvar=ivector(1,15);
|
| for(k=1; k <=(nlstate+ndeath); k++){ |
Tage=ivector(1,15);
|
| if (k != i) |
|
| { |
if (strlen(model) >1){
|
| printf("%d%d ",i,k); |
j=0, j1=0;
|
| fprintf(ficres,"%1d%1d ",i,k); |
j=nbocc(model,'+');
|
| for(j=1; j <=ncov; j++){ |
j1=nbocc(model,'*');
|
| printf("%f ",p[jk]); |
cptcovn=j+1;
|
| fprintf(ficres,"%f ",p[jk]); |
|
| jk++; |
strcpy(modelsav,model);
|
| } |
if (j==0) {
|
| printf("\n"); |
if (j1==0){
|
| fprintf(ficres,"\n"); |
cutv(stra,strb,modelsav,'V');
|
| } |
Tvar[1]=atoi(strb);
|
| } |
}
|
| } |
else if (j1==1) {
|
| |
cutv(stra,strb,modelsav,'*');
|
| /* Computing hessian and covariance matrix */ |
/* printf("stra=%s strb=%s modelsav=%s ",stra,strb,modelsav);*/
|
| ftolhess=ftol; /* Usually correct */ |
Tage[1]=1; cptcovage++;
|
| hesscov(matcov, p, npar, delti, ftolhess, func); |
if (strcmp(stra,"age")==0) {
|
| fprintf(ficres,"# Scales\n"); |
cutv(strd,strc,strb,'V');
|
| printf("# Scales\n"); |
Tvar[1]=atoi(strc);
|
| for(i=1,jk=1; i <=nlstate; i++){ |
}
|
| for(j=1; j <=nlstate+ndeath; j++){ |
else if (strcmp(strb,"age")==0) {
|
| if (j!=i) { |
cutv(strd,strc,stra,'V');
|
| fprintf(ficres,"%1d%1d",i,j); |
Tvar[1]=atoi(strc);
|
| printf("%1d%1d",i,j); |
}
|
| for(k=1; k<=ncov;k++){ |
else {printf("Error"); exit(0);}
|
| printf(" %.5e",delti[jk]); |
}
|
| fprintf(ficres," %.5e",delti[jk]); |
}
|
| jk++; |
else {
|
| } |
for(i=j; i>=1;i--){
|
| printf("\n"); |
cutv(stra,strb,modelsav,'+');
|
| fprintf(ficres,"\n"); |
/*printf("%s %s %s\n", stra,strb,modelsav);*/
|
| } |
if (strchr(strb,'*')) {
|
| } |
cutv(strd,strc,strb,'*');
|
| } |
if (strcmp(strc,"age")==0) {
|
| |
cutv(strb,stre,strd,'V');
|
| k=1; |
Tvar[i+1]=atoi(stre);
|
| fprintf(ficres,"# Covariance\n"); |
cptcovage++;
|
| printf("# Covariance\n"); |
Tage[cptcovage]=i+1;
|
| for(i=1;i<=npar;i++){ |
printf("stre=%s ", stre);
|
| /* if (k>nlstate) k=1; |
}
|
| i1=(i-1)/(ncov*nlstate)+1; |
else if (strcmp(strd,"age")==0) {
|
| fprintf(ficres,"%s%d%d",alph[k],i1,tab[i]); |
cutv(strb,stre,strc,'V');
|
| printf("%s%d%d",alph[k],i1,tab[i]);*/ |
Tvar[i+1]=atoi(stre);
|
| fprintf(ficres,"%3d",i); |
cptcovage++;
|
| printf("%3d",i); |
Tage[cptcovage]=i+1;
|
| for(j=1; j<=i;j++){ |
}
|
| fprintf(ficres," %.5e",matcov[i][j]); |
else {
|
| printf(" %.5e",matcov[i][j]); |
cutv(strb,stre,strc,'V');
|
| } |
Tvar[i+1]=ncov+1;
|
| fprintf(ficres,"\n"); |
cutv(strb,strc,strd,'V');
|
| printf("\n"); |
for (k=1; k<=lastobs;k++)
|
| k++; |
covar[ncov+1][k]=covar[atoi(stre)][k]*covar[atoi(strc)][k];
|
| } |
}
|
| |
}
|
| while((c=getc(ficpar))=='#' && c!= EOF){ |
else {
|
| ungetc(c,ficpar); |
cutv(strd,strc,strb,'V');
|
| fgets(line, MAXLINE, ficpar); |
/* printf("%s %s %s", strd,strc,strb);*/
|
| puts(line); |
|
| fputs(line,ficparo); |
Tvar[i+1]=atoi(strc);
|
| } |
}
|
| ungetc(c,ficpar); |
strcpy(modelsav,stra);
|
| |
}
|
| fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf\n",&agemin,&agemax, &bage, &fage); |
cutv(strd,strc,stra,'V');
|
| |
Tvar[1]=atoi(strc);
|
| if (fage <= 2) { |
}
|
| bage = agemin; |
}
|
| fage = agemax; |
|
| } |
/* printf("tvar=%d %d cptcovage=%d %d",Tvar[1],Tvar[2],cptcovage,Tage[1]);
|
| |
scanf("%d ",i);*/
|
| fprintf(ficres,"# agemin agemax for life expectancy, bage fage (if mle==0 ie no data nor Max likelihood).\n"); |
fclose(fic);
|
| fprintf(ficres,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax,bage,fage); |
|
| /*------------ gnuplot -------------*/ |
if(mle==1){
|
| chdir(pathcd); |
if (weightopt != 1) { /* Maximisation without weights*/
|
| if((ficgp=fopen("graph.gp","w"))==NULL) { |
for(i=1;i<=n;i++) weight[i]=1.0;
|
| printf("Problem with file graph.gp");goto end; |
}
|
| } |
/*-calculation of age at interview from date of interview and age at death -*/
|
| #ifdef windows |
agev=matrix(1,maxwav,1,imx);
|
| fprintf(ficgp,"cd \"%s\" \n",pathc); |
|
| #endif |
for (i=1; i<=imx; i++) {
|
| /* 1eme*/ |
agedc[i]=(moisdc[i]/12.+andc[i])-(moisnais[i]/12.+annais[i]);
|
| |
for(m=1; (m<= maxwav); m++){
|
| for (cpt=1; cpt<= nlstate ; cpt ++) { |
if(s[m][i] >0){
|
| #ifdef windows |
if (s[m][i] == nlstate+1) {
|
| fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nset ter gif small size 400,300\nplot [%.f:%.f] \"vpl%s\" u 1:%d \"\%%lf",agemin,fage,fileres,cpt*2); |
if(agedc[i]>0)
|
| #endif |
if(moisdc[i]!=99 && andc[i]!=9999)
|
| #ifdef unix |
agev[m][i]=agedc[i];
|
| fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nplot [%.f:%.f] \"vpl%s\" u 1:%d \"\%%lf",agemin,fage,fileres,cpt*2); |
else{
|
| #endif |
printf("Warning negative age at death: %d line:%d\n",num[i],i);
|
| for (i=1; i<= nlstate ; i ++) fprintf(ficgp," \%%lf (\%%lf)"); |
agev[m][i]=-1;
|
| fprintf(ficgp,"\" t\"Stationary prevalence\" w l 0,\"vpl%s\" u 1:($%d+2*$%d) \"\%%lf",fileres,2*cpt,cpt*2+1); |
}
|
| for (i=1; i<= nlstate ; i ++) fprintf(ficgp," \%%lf (\%%lf)"); |
}
|
| fprintf(ficgp,"\" t\"95\%% CI\" w l 1,\"vpl%s\" u 1:($%d-2*$%d) \"\%%lf",fileres,2*cpt,2*cpt+1); |
else if(s[m][i] !=9){ /* Should no more exist */
|
| for (i=1; i<= nlstate ; i ++) fprintf(ficgp," \%%lf (\%%lf)"); |
agev[m][i]=(mint[m][i]/12.+1./24.+anint[m][i])-(moisnais[i]/12.+1./24.+annais[i]);
|
| fprintf(ficgp,"\" t\"\" w l 1,\"p%s\" u 1:($%d) t\"Observed prevalence \" w l 2",fileres,2+4*(cpt-1)); |
if(mint[m][i]==99 || anint[m][i]==9999)
|
| #ifdef unix |
agev[m][i]=1;
|
| fprintf(ficgp,"\nset ter gif small size 400,300"); |
else if(agev[m][i] <agemin){
|
| #endif |
agemin=agev[m][i];
|
| fprintf(ficgp,"\nset out \"v%s%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt); |
/*printf(" Min anint[%d][%d]=%.2f annais[%d]=%.2f, agemin=%.2f\n",m,i,anint[m][i], i,annais[i], agemin);*/
|
| |
}
|
| } |
else if(agev[m][i] >agemax){
|
| /*2 eme*/ |
agemax=agev[m][i];
|
| |
/* printf(" anint[%d][%d]=%.0f annais[%d]=%.0f, agemax=%.0f\n",m,i,anint[m][i], i,annais[i], agemax);*/
|
| fprintf(ficgp,"set ylabel \"Years\" \nset ter gif small size 400,300\nplot [%.f:%.f] ",agemin,fage); |
}
|
| for (i=1; i<= nlstate+1 ; i ++) { |
/*agev[m][i]=anint[m][i]-annais[i];*/
|
| k=2*i; |
/* agev[m][i] = age[i]+2*m;*/
|
| fprintf(ficgp,"\"t%s\" u 1:%d \"\%%lf \%%lf (\%%lf) \%%lf (\%%lf)",fileres,k); |
}
|
| for (j=1; j< nlstate ; j ++) fprintf(ficgp," \%%lf (\%%lf)"); |
else { /* =9 */
|
| if (i== 1) fprintf(ficgp,"\" t\"TLE\" w l ,"); |
agev[m][i]=1;
|
| else fprintf(ficgp,"\" t\"LE in state (%d)\" w l ,",i-1); |
s[m][i]=-1;
|
| fprintf(ficgp,"\"t%s\" u 1:($%d-2*$%d) \"\%%lf \%%lf (\%%lf) \%%lf (\%%lf)",fileres,k,k+1); |
}
|
| for (j=1; j< nlstate ; j ++) fprintf(ficgp," \%%lf (\%%lf)"); |
}
|
| fprintf(ficgp,"\" t\"\" w l 0,"); |
else /*= 0 Unknown */
|
| fprintf(ficgp,"\"t%s\" u 1:($%d+2*$%d) \"\%%lf \%%lf (\%%lf) \%%lf (\%%lf)",fileres,k,k+1); |
agev[m][i]=1;
|
| for (j=1; j< nlstate ; j ++) fprintf(ficgp," \%%lf (\%%lf)"); |
}
|
| if (i== (nlstate+1)) fprintf(ficgp,"\" t\"\" w l 0"); |
|
| else fprintf(ficgp,"\" t\"\" w l 0,"); |
}
|
| } |
for (i=1; i<=imx; i++) {
|
| fprintf(ficgp,"\nset out \"e%s.gif\" \nreplot\n\n",strtok(optionfile, ".")); |
for(m=1; (m<= maxwav); m++){
|
| |
if (s[m][i] > (nlstate+ndeath)) {
|
| /*3eme*/ |
printf("Error: Wrong value in nlstate or ndeath\n");
|
| for (cpt=1; cpt<= nlstate ; cpt ++) { |
goto end;
|
| k=2+nlstate*(cpt-1); |
}
|
| fprintf(ficgp,"set ter gif small size 400,300\nplot [%.f:%.f] \"e%s\" u 1:%d t \"e%d1\" w l",agemin,fage,fileres,k,cpt); |
}
|
| for (i=1; i< nlstate ; i ++) { |
}
|
| fprintf(ficgp,",\"e%s\" u 1:%d t \"e%d%d\" w l",fileres,k+1,cpt,i+1); |
|
| } |
printf("Total number of individuals= %d, Agemin = %.2f, Agemax= %.2f\n\n", imx, agemin, agemax);
|
| fprintf(ficgp,"\nset out \"ex%s%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt); |
|
| } |
free_vector(severity,1,maxwav);
|
| |
free_imatrix(outcome,1,maxwav+1,1,n);
|
| /* CV preval stat */ |
free_vector(moisnais,1,n);
|
| for (cpt=1; cpt<nlstate ; cpt ++) { |
free_vector(annais,1,n);
|
| k=3; |
free_matrix(mint,1,maxwav,1,n);
|
| fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nset ter gif small size 400,300\nplot [%.f:%.f] \"pij%s\" u 2:($%d/($%d",agemin,agemax,fileres,k+cpt,k); |
free_matrix(anint,1,maxwav,1,n);
|
| for (i=1; i< nlstate ; i ++) |
free_vector(moisdc,1,n);
|
| fprintf(ficgp,"+$%d",k+i); |
free_vector(andc,1,n);
|
| fprintf(ficgp,")) t\"prev(%d,%d)\" w l",cpt,cpt+1); |
|
| |
|
| l=3+(nlstate+ndeath)*cpt; |
wav=ivector(1,imx);
|
| fprintf(ficgp,",\"pij%s\" u 2:($%d/($%d",fileres,l+cpt,l); |
dh=imatrix(1,lastpass-firstpass+1,1,imx);
|
| |
mw=imatrix(1,lastpass-firstpass+1,1,imx);
|
| for (i=1; i< nlstate ; i ++) { |
|
| l=3+(nlstate+ndeath)*cpt; |
/* Concatenates waves */
|
| fprintf(ficgp,"+$%d",l+i); |
concatwav(wav, dh, mw, s, agedc, agev, firstpass, lastpass, imx, nlstate, stepm);
|
| } |
|
| fprintf(ficgp,")) t\"prev(%d,%d)\" w l\n",cpt+1,cpt+1); |
|
| |
Tcode=ivector(1,100);
|
| |
nbcode=imatrix(1,nvar,1,8);
|
| fprintf(ficgp,"set out \"p%s%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt); |
ncodemax[1]=1;
|
| } |
if (cptcovn > 0) tricode(Tvar,nbcode,imx);
|
| |
|
| |
codtab=imatrix(1,100,1,10);
|
| fclose(ficgp); |
h=0;
|
| |
m=pow(2,cptcovn);
|
| chdir(path); |
|
| free_matrix(agev,1,maxwav,1,imx); |
for(k=1;k<=cptcovn; k++){
|
| free_ivector(wav,1,imx); |
for(i=1; i <=(m/pow(2,k));i++){
|
| free_imatrix(dh,1,lastpass-firstpass+1,1,imx); |
for(j=1; j <= ncodemax[k]; j++){
|
| free_imatrix(mw,1,lastpass-firstpass+1,1,imx); |
for(cpt=1; cpt <=(m/pow(2,cptcovn+1-k)); cpt++){
|
| |
h++;
|
| free_imatrix(s,1,maxwav+1,1,n); |
if (h>m) h=1;codtab[h][k]=j;
|
| |
}
|
| |
}
|
| free_ivector(num,1,n); |
}
|
| free_vector(agedc,1,n); |
}
|
| free_vector(weight,1,n); |
|
| free_matrix(covar,1,NCOVMAX,1,n); |
/* for(i=1; i <=m ;i++){
|
| fclose(ficparo); |
for(k=1; k <=cptcovn; k++){
|
| fclose(ficres); |
printf("i=%d k=%d %d ",i,k,codtab[i][k]);
|
| } |
}
|
| |
printf("\n");
|
| /*________fin mle=1_________*/ |
}
|
| |
scanf("%d",i);*/
|
| |
|
| |
/* Calculates basic frequencies. Computes observed prevalence at single age
|
| /* No more information from the sample is required now */ |
and prints on file fileres'p'. */
|
| /* Reads comments: lines beginning with '#' */ |
freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvar,nbcode, ncodemax);
|
| while((c=getc(ficpar))=='#' && c!= EOF){ |
|
| ungetc(c,ficpar); |
pmmij= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| fgets(line, MAXLINE, ficpar); |
oldms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| puts(line); |
newms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| fputs(line,ficparo); |
savms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| } |
oldm=oldms; newm=newms; savm=savms; /* Keeps fixed addresses to free */
|
| ungetc(c,ficpar); |
|
| |
/* For Powell, parameters are in a vector p[] starting at p[1]
|
| fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf\n",&agemin,&agemax, &bage, &fage); |
so we point p on param[1][1] so that p[1] maps on param[1][1][1] */
|
| printf("agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax, bage, fage); |
p=param[1][1]; /* *(*(*(param +1)+1)+0) */
|
| fprintf(ficparo,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax,bage,fage); |
|
| |
mlikeli(ficres,p, npar, ncovmodel, nlstate, ftol, func);
|
| /*--------------- Prevalence limit --------------*/ |
|
| |
|
| strcpy(filerespl,"pl"); |
/*--------- results files --------------*/
|
| strcat(filerespl,fileres); |
fprintf(ficres,"\ntitle=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncov, nlstate, ndeath, maxwav, mle,weightopt,model);
|
| if((ficrespl=fopen(filerespl,"w"))==NULL) { |
|
| printf("Problem with Prev limit resultfile: %s\n", filerespl);goto end; |
jk=1;
|
| } |
fprintf(ficres,"# Parameters\n");
|
| printf("Computing prevalence limit: result on file '%s' \n", filerespl); |
printf("# Parameters\n");
|
| fprintf(ficrespl,"#Prevalence limit\n"); |
for(i=1,jk=1; i <=nlstate; i++){
|
| fprintf(ficrespl,"#Age "); |
for(k=1; k <=(nlstate+ndeath); k++){
|
| for(i=1; i<=nlstate;i++) fprintf(ficrespl,"%d-%d ",i,i); |
if (k != i)
|
| fprintf(ficrespl,"\n"); |
{
|
| |
printf("%d%d ",i,k);
|
| prlim=matrix(1,nlstate,1,nlstate); |
fprintf(ficres,"%1d%1d ",i,k);
|
| pmmij= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
for(j=1; j <=ncovmodel; j++){
|
| oldms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
printf("%f ",p[jk]);
|
| newms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
fprintf(ficres,"%f ",p[jk]);
|
| savms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */ |
jk++;
|
| oldm=oldms; newm=newms; savm=savms; /* Keeps fixed addresses to free */ |
}
|
| |
printf("\n");
|
| agebase=agemin; |
fprintf(ficres,"\n");
|
| agelim=agemax; |
}
|
| ftolpl=1.e-10; |
}
|
| for (age=agebase; age<=agelim; age++){ |
}
|
| prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl); |
|
| fprintf(ficrespl,"%.0f",age ); |
/* Computing hessian and covariance matrix */
|
| for(i=1; i<=nlstate;i++) |
ftolhess=ftol; /* Usually correct */
|
| fprintf(ficrespl," %.5f", prlim[i][i]); |
hesscov(matcov, p, npar, delti, ftolhess, func);
|
| fprintf(ficrespl,"\n"); |
fprintf(ficres,"# Scales\n");
|
| } |
printf("# Scales\n");
|
| fclose(ficrespl); |
for(i=1,jk=1; i <=nlstate; i++){
|
| |
for(j=1; j <=nlstate+ndeath; j++){
|
| /*------------- h Pij x at various ages ------------*/ |
if (j!=i) {
|
| |
fprintf(ficres,"%1d%1d",i,j);
|
| strcpy(filerespij,"pij"); strcat(filerespij,fileres); |
printf("%1d%1d",i,j);
|
| if((ficrespij=fopen(filerespij,"w"))==NULL) { |
for(k=1; k<=ncovmodel;k++){
|
| printf("Problem with Pij resultfile: %s\n", filerespij);goto end; |
printf(" %.5e",delti[jk]);
|
| } |
fprintf(ficres," %.5e",delti[jk]);
|
| printf("Computing pij: result on file '%s' \n", filerespij); |
jk++;
|
| stepsize=(int) (stepm+YEARM-1)/YEARM; |
}
|
| if (stepm<=24) stepsize=2; |
printf("\n");
|
| |
fprintf(ficres,"\n");
|
| agelim=AGESUP; |
}
|
| hstepm=stepsize*YEARM; /* Every year of age */ |
}
|
| hstepm=hstepm/stepm; /* Typically 2 years, = 2/6 months = 4 */ |
}
|
| for (agedeb=fage; agedeb>=bage; agedeb--){ /* If stepm=6 months */ |
|
| nhstepm=(int) rint((agelim-agedeb)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */ |
k=1;
|
| nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
fprintf(ficres,"# Covariance\n");
|
| p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
printf("# Covariance\n");
|
| oldm=oldms;savm=savms; |
for(i=1;i<=npar;i++){
|
| hpxij(p3mat,nhstepm,agedeb,hstepm,p,nlstate,stepm,oldm,savm); |
/* if (k>nlstate) k=1;
|
| fprintf(ficrespij,"# Age"); |
i1=(i-1)/(ncovmodel*nlstate)+1;
|
| for(i=1; i<=nlstate;i++) |
fprintf(ficres,"%s%d%d",alph[k],i1,tab[i]);
|
| for(j=1; j<=nlstate+ndeath;j++) |
printf("%s%d%d",alph[k],i1,tab[i]);*/
|
| fprintf(ficrespij," %1d-%1d",i,j); |
fprintf(ficres,"%3d",i);
|
| fprintf(ficrespij,"\n"); |
printf("%3d",i);
|
| for (h=0; h<=nhstepm; h++){ |
for(j=1; j<=i;j++){
|
| fprintf(ficrespij,"%.0f %.0f",agedeb, agedeb+ h*hstepm/YEARM*stepm ); |
fprintf(ficres," %.5e",matcov[i][j]);
|
| for(i=1; i<=nlstate;i++) |
printf(" %.5e",matcov[i][j]);
|
| for(j=1; j<=nlstate+ndeath;j++) |
}
|
| fprintf(ficrespij," %.5f", p3mat[i][j][h]); |
fprintf(ficres,"\n");
|
| fprintf(ficrespij,"\n"); |
printf("\n");
|
| } |
k++;
|
| free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
}
|
| fprintf(ficrespij,"\n"); |
|
| } |
while((c=getc(ficpar))=='#' && c!= EOF){
|
| fclose(ficrespij); |
ungetc(c,ficpar);
|
| |
fgets(line, MAXLINE, ficpar);
|
| /*---------- Health expectancies and variances ------------*/ |
puts(line);
|
| |
fputs(line,ficparo);
|
| eij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage); |
}
|
| oldm=oldms;savm=savms; |
ungetc(c,ficpar);
|
| evsij(fileres, eij, p, nlstate, stepm, (int) bage, (int)fage, oldm, savm); |
|
| |
fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf\n",&agemin,&agemax, &bage, &fage);
|
| vareij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage); |
|
| oldm=oldms;savm=savms; |
if (fage <= 2) {
|
| varevsij(fileres, vareij, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl); |
bage = agemin;
|
| |
fage = agemax;
|
| strcpy(filerest,"t"); |
}
|
| strcat(filerest,fileres); |
|
| if((ficrest=fopen(filerest,"w"))==NULL) { |
fprintf(ficres,"# agemin agemax for life expectancy, bage fage (if mle==0 ie no data nor Max likelihood).\n");
|
| printf("Problem with total LE resultfile: %s\n", filerest);goto end; |
fprintf(ficres,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax,bage,fage);
|
| } |
/*------------ gnuplot -------------*/
|
| printf("Computing Total LEs with variances: file '%s' \n", filerest); |
chdir(pathcd);
|
| fprintf(ficrest,"#Total LEs with variances: e.. (std) "); |
if((ficgp=fopen("graph.plt","w"))==NULL) {
|
| for (i=1;i<=nlstate;i++) fprintf(ficrest,"e.%d (std) ",i); |
printf("Problem with file graph.gp");goto end;
|
| fprintf(ficrest,"\n"); |
}
|
| |
#ifdef windows
|
| hf=1; |
fprintf(ficgp,"cd \"%s\" \n",pathc);
|
| if (stepm >= YEARM) hf=stepm/YEARM; |
#endif
|
| epj=vector(1,nlstate+1); |
m=pow(2,cptcovn);
|
| for(age=bage; age <=fage ;age++){ |
|
| prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl); |
/* 1eme*/
|
| fprintf(ficrest," %.0f",age); |
for (cpt=1; cpt<= nlstate ; cpt ++) {
|
| for(j=1, epj[nlstate+1]=0.;j <=nlstate;j++){ |
for (k1=1; k1<= m ; k1 ++) {
|
| for(i=1, epj[j]=0.;i <=nlstate;i++) { |
|
| epj[j] += prlim[i][i]*hf*eij[i][j][(int)age]; |
#ifdef windows
|
| } |
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nset ter gif small size 400,300\nplot [%.f:%.f] \"vpl%s\" every :::%d::%d u 1:2 \"\%%lf",agemin,fage,fileres,k1-1,k1-1);
|
| epj[nlstate+1] +=epj[j]; |
#endif
|
| } |
#ifdef unix
|
| for(i=1, vepp=0.;i <=nlstate;i++) |
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nplot [%.f:%.f] \"vpl%s\" u 1:2 \"\%%lf",agemin,fage,fileres);
|
| for(j=1;j <=nlstate;j++) |
#endif
|
| vepp += vareij[i][j][(int)age]; |
|
| fprintf(ficrest," %.2f (%.2f)", epj[nlstate+1],hf*sqrt(vepp)); |
for (i=1; i<= nlstate ; i ++) {
|
| for(j=1;j <=nlstate;j++){ |
if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)");
|
| fprintf(ficrest," %.2f (%.2f)", epj[j],hf*sqrt(vareij[j][j][(int)age])); |
else fprintf(ficgp," \%%*lf (\%%*lf)");
|
| } |
}
|
| fprintf(ficrest,"\n"); |
fprintf(ficgp,"\" t\"Stationary prevalence\" w l 0,\"vpl%s\" every :::%d::%d u 1:($2+2*$3) \"\%%lf",fileres,k1-1,k1-1);
|
| } |
for (i=1; i<= nlstate ; i ++) {
|
| fclose(ficrest); |
if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)");
|
| fclose(ficpar); |
else fprintf(ficgp," \%%*lf (\%%*lf)");
|
| free_vector(epj,1,nlstate+1); |
}
|
| |
fprintf(ficgp,"\" t\"95\%% CI\" w l 1,\"vpl%s\" every :::%d::%d u 1:($2-2*$3) \"\%%lf",fileres,k1-1,k1-1);
|
| /*------- Variance limit prevalence------*/ |
for (i=1; i<= nlstate ; i ++) {
|
| |
if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)");
|
| varpl=matrix(1,nlstate,(int) bage, (int) fage); |
else fprintf(ficgp," \%%*lf (\%%*lf)");
|
| oldm=oldms;savm=savms; |
}
|
| varprevlim(fileres, varpl, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl); |
fprintf(ficgp,"\" t\"\" w l 1,\"p%s\" every :::%d::%d u 1:($%d) t\"Observed prevalence \" w l 2",fileres,k1-1,k1-1,2+4*(cpt-1));
|
| |
#ifdef unix
|
| |
fprintf(ficgp,"\nset ter gif small size 400,300");
|
| free_matrix(varpl,1,nlstate,(int) bage, (int)fage); |
#endif
|
| |
fprintf(ficgp,"\nset out \"v%s%d%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt,k1);
|
| free_ma3x(vareij,1,nlstate,1,nlstate,(int) bage, (int)fage); |
}
|
| free_ma3x(eij,1,nlstate,1,nlstate,(int) bage, (int)fage); |
}
|
| |
/*2 eme*/
|
| |
|
| free_matrix(pmmij,1,nlstate+ndeath,1,nlstate+ndeath); |
for (k1=1; k1<= m ; k1 ++) {
|
| free_matrix(oldms, 1,nlstate+ndeath,1,nlstate+ndeath); |
fprintf(ficgp,"set ylabel \"Years\" \nset ter gif small size 400,300\nplot [%.f:%.f] ",agemin,fage);
|
| free_matrix(newms, 1,nlstate+ndeath,1,nlstate+ndeath); |
|
| free_matrix(savms, 1,nlstate+ndeath,1,nlstate+ndeath); |
for (i=1; i<= nlstate+1 ; i ++) {
|
| |
k=2*i;
|
| free_matrix(matcov,1,npar,1,npar); |
fprintf(ficgp,"\"t%s\" every :::%d::%d u 1:2 \"\%%lf",fileres,k1-1,k1-1);
|
| free_vector(delti,1,npar); |
for (j=1; j<= nlstate+1 ; j ++) {
|
| |
if (j==i) fprintf(ficgp," \%%lf (\%%lf)");
|
| free_ma3x(param,1,nlstate,1, nlstate+ndeath-1,1,ncov); |
else fprintf(ficgp," \%%*lf (\%%*lf)");
|
| |
}
|
| printf("End of Imach\n"); |
if (i== 1) fprintf(ficgp,"\" t\"TLE\" w l ,");
|
| /* gettimeofday(&end_time, (struct timezone*)0);*/ /* after time */ |
else fprintf(ficgp,"\" t\"LE in state (%d)\" w l ,",i-1);
|
| |
fprintf(ficgp,"\"t%s\" every :::%d::%d u 1:($2-$3*2) \"\%%lf",fileres,k1-1,k1-1);
|
| /* printf("Total time was %d Sec. %d uSec.\n", end_time.tv_sec -start_time.tv_sec, end_time.tv_usec -start_time.tv_usec);*/ |
for (j=1; j<= nlstate+1 ; j ++) {
|
| /*printf("Total time was %d uSec.\n", total_usecs);*/ |
if (j==i) fprintf(ficgp," \%%lf (\%%lf)");
|
| /*------ End -----------*/ |
else fprintf(ficgp," \%%*lf (\%%*lf)");
|
| |
}
|
| end: |
fprintf(ficgp,"\" t\"\" w l 0,");
|
| #ifdef windows |
fprintf(ficgp,"\"t%s\" every :::%d::%d u 1:($2+$3*2) \"\%%lf",fileres,k1-1,k1-1);
|
| chdir(pathcd); |
for (j=1; j<= nlstate+1 ; j ++) {
|
| #endif |
if (j==i) fprintf(ficgp," \%%lf (\%%lf)");
|
| system("gnuplot graph.gp"); |
else fprintf(ficgp," \%%*lf (\%%*lf)");
|
| |
}
|
| #ifdef windows |
if (i== (nlstate+1)) fprintf(ficgp,"\" t\"\" w l 0");
|
| while (z[0] != 'q') { |
else fprintf(ficgp,"\" t\"\" w l 0,");
|
| chdir(pathcd); |
}
|
| printf("\nType e to edit output files, c to start again, and q for exiting: "); |
fprintf(ficgp,"\nset out \"e%s%d.gif\" \nreplot\n\n",strtok(optionfile, "."),k1);
|
| scanf("%s",z); |
}
|
| if (z[0] == 'c') system("./imach"); |
|
| else if (z[0] == 'e') { |
/*3eme*/
|
| chdir(path); |
|
| system("index.htm"); |
for (k1=1; k1<= m ; k1 ++) {
|
| } |
for (cpt=1; cpt<= nlstate ; cpt ++) {
|
| else if (z[0] == 'q') exit(0); |
k=2+nlstate*(cpt-1);
|
| } |
fprintf(ficgp,"set ter gif small size 400,300\nplot [%.f:%.f] \"e%s\" every :::%d::%d u 1:%d t \"e%d1\" w l",agemin,fage,fileres,k1-1,k1-1,k,cpt);
|
| #endif |
for (i=1; i< nlstate ; i ++) {
|
| } |
fprintf(ficgp,",\"e%s\" every :::%d::%d u 1:%d t \"e%d%d\" w l",fileres,k1-1,k1-1,k+i,cpt,i+1);
|
| |
}
|
| |
fprintf(ficgp,"\nset out \"exp%s%d%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt,k1);
|
| |
}
|
| |
}
|
| |
|
| |
/* CV preval stat */
|
| |
for (k1=1; k1<= m ; k1 ++) {
|
| |
for (cpt=1; cpt<nlstate ; cpt ++) {
|
| |
k=3;
|
| |
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nset ter gif small size 400,300\nplot [%.f:%.f] \"pij%s\" u ($1==%d ? ($3):1/0):($%d/($%d",agemin,agemax,fileres,k1,k+cpt+1,k+1);
|
| |
for (i=1; i< nlstate ; i ++)
|
| |
fprintf(ficgp,"+$%d",k+i+1);
|
| |
fprintf(ficgp,")) t\"prev(%d,%d)\" w l",cpt,cpt+1);
|
| |
|
| |
l=3+(nlstate+ndeath)*cpt;
|
| |
fprintf(ficgp,",\"pij%s\" u ($1==%d ? ($3):1/0):($%d/($%d",fileres,k1,l+cpt+1,l+1);
|
| |
for (i=1; i< nlstate ; i ++) {
|
| |
l=3+(nlstate+ndeath)*cpt;
|
| |
fprintf(ficgp,"+$%d",l+i+1);
|
| |
}
|
| |
fprintf(ficgp,")) t\"prev(%d,%d)\" w l\n",cpt+1,cpt+1);
|
| |
fprintf(ficgp,"set out \"p%s%d%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt,k1);
|
| |
}
|
| |
}
|
| |
|
| |
/* proba elementaires */
|
| |
for(i=1,jk=1; i <=nlstate; i++){
|
| |
for(k=1; k <=(nlstate+ndeath); k++){
|
| |
if (k != i) {
|
| |
for(j=1; j <=ncovmodel; j++){
|
| |
/*fprintf(ficgp,"%s%1d%1d=%f ",alph[j],i,k,p[jk]);*/
|
| |
/*fprintf(ficgp,"%s",alph[1]);*/
|
| |
fprintf(ficgp,"p%d=%f ",jk,p[jk]);
|
| |
jk++;
|
| |
fprintf(ficgp,"\n");
|
| |
}
|
| |
}
|
| |
}
|
| |
}
|
| |
|
| |
for(jk=1; jk <=m; jk++) {
|
| |
fprintf(ficgp,"\nset ter gif small size 400,300\nset log y\nplot [%.f:%.f] ",agemin,agemax);
|
| |
i=1;
|
| |
for(k2=1; k2<=nlstate; k2++) {
|
| |
k3=i;
|
| |
for(k=1; k<=(nlstate+ndeath); k++) {
|
| |
if (k != k2){
|
| |
fprintf(ficgp," exp(p%d+p%d*x",i,i+1);
|
| |
|
| |
for(j=3; j <=ncovmodel; j++)
|
| |
fprintf(ficgp,"+p%d*%d",i+j-1,nbcode[Tvar[j-2]][codtab[jk][j-2]]);
|
| |
fprintf(ficgp,")/(1");
|
| |
|
| |
for(k1=1; k1 <=nlstate; k1++){
|
| |
fprintf(ficgp,"+exp(p%d+p%d*x",k3+(k1-1)*ncovmodel,k3+(k1-1)*ncovmodel+1);
|
| |
for(j=3; j <=ncovmodel; j++)
|
| |
fprintf(ficgp,"+p%d*%d",k3+(k1-1)*ncovmodel+1+j-2,nbcode[Tvar[j-2]][codtab[jk][j-2]]);
|
| |
fprintf(ficgp,")");
|
| |
}
|
| |
fprintf(ficgp,") t \"p%d%d\" ", k2,k);
|
| |
if ((k+k2)!= (nlstate*2+ndeath)) fprintf(ficgp,",");
|
| |
i=i+ncovmodel;
|
| |
}
|
| |
}
|
| |
}
|
| |
fprintf(ficgp,"\nset out \"pe%s%d.gif\" \nreplot\n\n",strtok(optionfile, "."),jk);
|
| |
}
|
| |
|
| |
fclose(ficgp);
|
| |
|
| |
chdir(path);
|
| |
free_matrix(agev,1,maxwav,1,imx);
|
| |
free_ivector(wav,1,imx);
|
| |
free_imatrix(dh,1,lastpass-firstpass+1,1,imx);
|
| |
free_imatrix(mw,1,lastpass-firstpass+1,1,imx);
|
| |
|
| |
free_imatrix(s,1,maxwav+1,1,n);
|
| |
|
| |
|
| |
free_ivector(num,1,n);
|
| |
free_vector(agedc,1,n);
|
| |
free_vector(weight,1,n);
|
| |
/*free_matrix(covar,1,NCOVMAX,1,n);*/
|
| |
fclose(ficparo);
|
| |
fclose(ficres);
|
| |
}
|
| |
|
| |
/*________fin mle=1_________*/
|
| |
|
| |
|
| |
|
| |
/* No more information from the sample is required now */
|
| |
/* Reads comments: lines beginning with '#' */
|
| |
while((c=getc(ficpar))=='#' && c!= EOF){
|
| |
ungetc(c,ficpar);
|
| |
fgets(line, MAXLINE, ficpar);
|
| |
puts(line);
|
| |
fputs(line,ficparo);
|
| |
}
|
| |
ungetc(c,ficpar);
|
| |
|
| |
fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf\n",&agemin,&agemax, &bage, &fage);
|
| |
printf("agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax, bage, fage);
|
| |
fprintf(ficparo,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax,bage,fage);
|
| |
/*--------- index.htm --------*/
|
| |
|
| |
if((fichtm=fopen("index.htm","w"))==NULL) {
|
| |
printf("Problem with index.htm \n");goto end;
|
| |
}
|
| |
|
| |
fprintf(fichtm,"<body><ul> Imach, Version 0.64a<hr> <li>Outputs files<br><br>\n
|
| |
- Observed prevalence in each state: <a href=\"p%s\">p%s</a> <br>\n
|
| |
- Estimated parameters and the covariance matrix: <a href=\"%s\">%s</a> <br>
|
| |
- Stationary prevalence in each state: <a href=\"pl%s\">pl%s</a> <br>
|
| |
- Transition probabilities: <a href=\"pij%s\">pij%s</a><br>
|
| |
- Copy of the parameter file: <a href=\"o%s\">o%s</a><br>
|
| |
- Life expectancies by age and initial health status: <a href=\"e%s\">e%s</a> <br>
|
| |
- Variances of life expectancies by age and initial health status: <a href=\"v%s\">v%s</a><br>
|
| |
- Health expectancies with their variances: <a href=\"t%s\">t%s</a> <br>
|
| |
- Standard deviation of stationary prevalences: <a href=\"vpl%s\">vpl%s</a> <br><br>",fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres);
|
| |
|
| |
fprintf(fichtm," <li>Graphs</li>\n<p>");
|
| |
|
| |
m=cptcovn;
|
| |
if (cptcovn < 1) {m=1;ncodemax[1]=1;}
|
| |
|
| |
j1=0;
|
| |
for(k1=1; k1<=m;k1++){
|
| |
for(i1=1; i1<=ncodemax[k1];i1++){
|
| |
j1++;
|
| |
if (cptcovn > 0) {
|
| |
fprintf(fichtm,"<hr>************ Results for covariates");
|
| |
for (cpt=1; cpt<=cptcovn;cpt++)
|
| |
fprintf(fichtm," V%d=%d ",Tvar[cpt],nbcode[Tvar[cpt]][codtab[j1][cpt]]);
|
| |
fprintf(fichtm," ************\n<hr>");
|
| |
}
|
| |
fprintf(fichtm,"<br>- Probabilities: pe%s%d.gif<br>
|
| |
<img src=\"pe%s%d.gif\">",strtok(optionfile, "."),j1,strtok(optionfile, "."),j1);
|
| |
for(cpt=1; cpt<nlstate;cpt++){
|
| |
fprintf(fichtm,"<br>- Prevalence of disability : p%s%d%d.gif<br>
|
| |
<img src=\"p%s%d%d.gif\">",strtok(optionfile, "."),cpt,j1,strtok(optionfile, "."),cpt,j1);
|
| |
}
|
| |
for(cpt=1; cpt<=nlstate;cpt++) {
|
| |
fprintf(fichtm,"<br>- Observed and stationary prevalence (with confident
|
| |
interval) in state (%d): v%s%d%d.gif <br>
|
| |
<img src=\"v%s%d%d.gif\">",cpt,strtok(optionfile, "."),cpt,j1,strtok(optionfile, "."),cpt,j1);
|
| |
}
|
| |
for(cpt=1; cpt<=nlstate;cpt++) {
|
| |
fprintf(fichtm,"\n<br>- Health life expectancies by age and initial health state (%d): exp%s%d%d.gif <br>
|
| |
<img src=\"exp%s%d%d.gif\">",cpt,strtok(optionfile, "."),cpt,j1,strtok(optionfile, "."),cpt,j1);
|
| |
}
|
| |
fprintf(fichtm,"\n<br>- Total life expectancy by age and
|
| |
health expectancies in states (1) and (2): e%s%d.gif<br>
|
| |
<img src=\"e%s%d.gif\">",strtok(optionfile, "."),j1,strtok(optionfile, "."),j1);
|
| |
fprintf(fichtm,"\n</body>");
|
| |
}
|
| |
}
|
| |
fclose(fichtm);
|
| |
|
| |
/*--------------- Prevalence limit --------------*/
|
| |
|
| |
strcpy(filerespl,"pl");
|
| |
strcat(filerespl,fileres);
|
| |
if((ficrespl=fopen(filerespl,"w"))==NULL) {
|
| |
printf("Problem with Prev limit resultfile: %s\n", filerespl);goto end;
|
| |
}
|
| |
printf("Computing prevalence limit: result on file '%s' \n", filerespl);
|
| |
fprintf(ficrespl,"#Prevalence limit\n");
|
| |
fprintf(ficrespl,"#Age ");
|
| |
for(i=1; i<=nlstate;i++) fprintf(ficrespl,"%d-%d ",i,i);
|
| |
fprintf(ficrespl,"\n");
|
| |
|
| |
prlim=matrix(1,nlstate,1,nlstate);
|
| |
pmmij= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| |
oldms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| |
newms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| |
savms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
|
| |
oldm=oldms; newm=newms; savm=savms; /* Keeps fixed addresses to free */
|
| |
k=0;
|
| |
agebase=agemin;
|
| |
agelim=agemax;
|
| |
ftolpl=1.e-10;
|
| |
i1=cptcovn;
|
| |
if (cptcovn < 1){i1=1;}
|
| |
|
| |
for(cptcov=1;cptcov<=i1;cptcov++){
|
| |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
|
| |
k=k+1;
|
| |
/*printf("cptcov=%d cptcod=%d codtab=%d nbcode=%d\n",cptcov, cptcod,Tcode[cptcode],codtab[cptcod][cptcov]);*/
|
| |
fprintf(ficrespl,"\n#******");
|
| |
for(j=1;j<=cptcovn;j++)
|
| |
fprintf(ficrespl," V%d=%d ",Tvar[j],nbcode[Tvar[j]][codtab[k][j]]);
|
| |
fprintf(ficrespl,"******\n");
|
| |
|
| |
for (age=agebase; age<=agelim; age++){
|
| |
prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl,k);
|
| |
fprintf(ficrespl,"%.0f",age );
|
| |
for(i=1; i<=nlstate;i++)
|
| |
fprintf(ficrespl," %.5f", prlim[i][i]);
|
| |
fprintf(ficrespl,"\n");
|
| |
}
|
| |
}
|
| |
}
|
| |
fclose(ficrespl);
|
| |
/*------------- h Pij x at various ages ------------*/
|
| |
|
| |
strcpy(filerespij,"pij"); strcat(filerespij,fileres);
|
| |
if((ficrespij=fopen(filerespij,"w"))==NULL) {
|
| |
printf("Problem with Pij resultfile: %s\n", filerespij);goto end;
|
| |
}
|
| |
printf("Computing pij: result on file '%s' \n", filerespij);
|
| |
|
| |
stepsize=(int) (stepm+YEARM-1)/YEARM;
|
| |
if (stepm<=24) stepsize=2;
|
| |
|
| |
agelim=AGESUP;
|
| |
hstepm=stepsize*YEARM; /* Every year of age */
|
| |
hstepm=hstepm/stepm; /* Typically 2 years, = 2/6 months = 4 */
|
| |
|
| |
k=0;
|
| |
for(cptcov=1;cptcov<=i1;cptcov++){
|
| |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
|
| |
k=k+1;
|
| |
fprintf(ficrespij,"\n#****** ");
|
| |
for(j=1;j<=cptcovn;j++)
|
| |
fprintf(ficrespij,"V%d=%d ",Tvar[j],nbcode[Tvar[j]][codtab[k][j]]);
|
| |
fprintf(ficrespij,"******\n");
|
| |
|
| |
for (agedeb=fage; agedeb>=bage; agedeb--){ /* If stepm=6 months */
|
| |
nhstepm=(int) rint((agelim-agedeb)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */
|
| |
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */
|
| |
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
|
| |
oldm=oldms;savm=savms;
|
| |
hpxij(p3mat,nhstepm,agedeb,hstepm,p,nlstate,stepm,oldm,savm, k);
|
| |
fprintf(ficrespij,"# Age");
|
| |
for(i=1; i<=nlstate;i++)
|
| |
for(j=1; j<=nlstate+ndeath;j++)
|
| |
fprintf(ficrespij," %1d-%1d",i,j);
|
| |
fprintf(ficrespij,"\n");
|
| |
for (h=0; h<=nhstepm; h++){
|
| |
fprintf(ficrespij,"%d %.0f %.0f",k,agedeb, agedeb+ h*hstepm/YEARM*stepm );
|
| |
for(i=1; i<=nlstate;i++)
|
| |
for(j=1; j<=nlstate+ndeath;j++)
|
| |
fprintf(ficrespij," %.5f", p3mat[i][j][h]);
|
| |
fprintf(ficrespij,"\n");
|
| |
}
|
| |
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
|
| |
fprintf(ficrespij,"\n");
|
| |
}
|
| |
}
|
| |
}
|
| |
|
| |
fclose(ficrespij);
|
| |
|
| |
/*---------- Health expectancies and variances ------------*/
|
| |
|
| |
strcpy(filerest,"t");
|
| |
strcat(filerest,fileres);
|
| |
if((ficrest=fopen(filerest,"w"))==NULL) {
|
| |
printf("Problem with total LE resultfile: %s\n", filerest);goto end;
|
| |
}
|
| |
printf("Computing Total LEs with variances: file '%s' \n", filerest);
|
| |
|
| |
|
| |
strcpy(filerese,"e");
|
| |
strcat(filerese,fileres);
|
| |
if((ficreseij=fopen(filerese,"w"))==NULL) {
|
| |
printf("Problem with Health Exp. resultfile: %s\n", filerese); exit(0);
|
| |
}
|
| |
printf("Computing Health Expectancies: result on file '%s' \n", filerese);
|
| |
|
| |
strcpy(fileresv,"v");
|
| |
strcat(fileresv,fileres);
|
| |
if((ficresvij=fopen(fileresv,"w"))==NULL) {
|
| |
printf("Problem with variance resultfile: %s\n", fileresv);exit(0);
|
| |
}
|
| |
printf("Computing Variance-covariance of DFLEs: file '%s' \n", fileresv);
|
| |
|
| |
k=0;
|
| |
for(cptcov=1;cptcov<=i1;cptcov++){
|
| |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
|
| |
k=k+1;
|
| |
fprintf(ficrest,"\n#****** ");
|
| |
for(j=1;j<=cptcovn;j++)
|
| |
fprintf(ficrest,"V%d=%d ",Tvar[j],nbcode[Tvar[j]][codtab[k][j]]);
|
| |
fprintf(ficrest,"******\n");
|
| |
|
| |
fprintf(ficreseij,"\n#****** ");
|
| |
for(j=1;j<=cptcovn;j++)
|
| |
fprintf(ficreseij,"V%d=%d ",j,nbcode[j][codtab[k][j]]);
|
| |
fprintf(ficreseij,"******\n");
|
| |
|
| |
fprintf(ficresvij,"\n#****** ");
|
| |
for(j=1;j<=cptcovn;j++)
|
| |
fprintf(ficresvij,"V%d=%d ",j,nbcode[j][codtab[k][j]]);
|
| |
fprintf(ficresvij,"******\n");
|
| |
|
| |
eij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage);
|
| |
oldm=oldms;savm=savms;
|
| |
evsij(fileres, eij, p, nlstate, stepm, (int) bage, (int)fage, oldm, savm, k);
|
| |
vareij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage);
|
| |
oldm=oldms;savm=savms;
|
| |
varevsij(fileres, vareij, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl,k);
|
| |
|
| |
fprintf(ficrest,"#Total LEs with variances: e.. (std) ");
|
| |
for (i=1;i<=nlstate;i++) fprintf(ficrest,"e.%d (std) ",i);
|
| |
fprintf(ficrest,"\n");
|
| |
|
| |
hf=1;
|
| |
if (stepm >= YEARM) hf=stepm/YEARM;
|
| |
epj=vector(1,nlstate+1);
|
| |
for(age=bage; age <=fage ;age++){
|
| |
prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl,k);
|
| |
fprintf(ficrest," %.0f",age);
|
| |
for(j=1, epj[nlstate+1]=0.;j <=nlstate;j++){
|
| |
for(i=1, epj[j]=0.;i <=nlstate;i++) {
|
| |
epj[j] += prlim[i][i]*hf*eij[i][j][(int)age];
|
| |
}
|
| |
epj[nlstate+1] +=epj[j];
|
| |
}
|
| |
for(i=1, vepp=0.;i <=nlstate;i++)
|
| |
for(j=1;j <=nlstate;j++)
|
| |
vepp += vareij[i][j][(int)age];
|
| |
fprintf(ficrest," %.2f (%.2f)", epj[nlstate+1],hf*sqrt(vepp));
|
| |
for(j=1;j <=nlstate;j++){
|
| |
fprintf(ficrest," %.2f (%.2f)", epj[j],hf*sqrt(vareij[j][j][(int)age]));
|
| |
}
|
| |
fprintf(ficrest,"\n");
|
| |
}
|
| |
}
|
| |
}
|
| |
|
| |
fclose(ficreseij);
|
| |
fclose(ficresvij);
|
| |
fclose(ficrest);
|
| |
fclose(ficpar);
|
| |
free_vector(epj,1,nlstate+1);
|
| |
/* scanf("%d ",i); */
|
| |
|
| |
/*------- Variance limit prevalence------*/
|
| |
|
| |
strcpy(fileresvpl,"vpl");
|
| |
strcat(fileresvpl,fileres);
|
| |
if((ficresvpl=fopen(fileresvpl,"w"))==NULL) {
|
| |
printf("Problem with variance prev lim resultfile: %s\n", fileresvpl);
|
| |
exit(0);
|
| |
}
|
| |
printf("Computing Variance-covariance of Prevalence limit: file '%s' \n", fileresvpl);
|
| |
|
| |
k=0;
|
| |
for(cptcov=1;cptcov<=i1;cptcov++){
|
| |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
|
| |
k=k+1;
|
| |
fprintf(ficresvpl,"\n#****** ");
|
| |
for(j=1;j<=cptcovn;j++)
|
| |
fprintf(ficresvpl,"V%d=%d ",Tvar[j],nbcode[Tvar[j]][codtab[k][j]]);
|
| |
fprintf(ficresvpl,"******\n");
|
| |
|
| |
varpl=matrix(1,nlstate,(int) bage, (int) fage);
|
| |
oldm=oldms;savm=savms;
|
| |
varprevlim(fileres, varpl, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl,k);
|
| |
}
|
| |
}
|
| |
|
| |
fclose(ficresvpl);
|
| |
|
| |
/*---------- End : free ----------------*/
|
| |
free_matrix(varpl,1,nlstate,(int) bage, (int)fage);
|
| |
|
| |
free_ma3x(vareij,1,nlstate,1,nlstate,(int) bage, (int)fage);
|
| |
free_ma3x(eij,1,nlstate,1,nlstate,(int) bage, (int)fage);
|
| |
|
| |
|
| |
free_matrix(pmmij,1,nlstate+ndeath,1,nlstate+ndeath);
|
| |
free_matrix(oldms, 1,nlstate+ndeath,1,nlstate+ndeath);
|
| |
free_matrix(newms, 1,nlstate+ndeath,1,nlstate+ndeath);
|
| |
free_matrix(savms, 1,nlstate+ndeath,1,nlstate+ndeath);
|
| |
|
| |
free_matrix(matcov,1,npar,1,npar);
|
| |
free_vector(delti,1,npar);
|
| |
|
| |
free_ma3x(param,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel);
|
| |
|
| |
printf("End of Imach\n");
|
| |
/* gettimeofday(&end_time, (struct timezone*)0);*/ /* after time */
|
| |
|
| |
/* printf("Total time was %d Sec. %d uSec.\n", end_time.tv_sec -start_time.tv_sec, end_time.tv_usec -start_time.tv_usec);*/
|
| |
/*printf("Total time was %d uSec.\n", total_usecs);*/
|
| |
/*------ End -----------*/
|
| |
|
| |
end:
|
| |
#ifdef windows
|
| |
chdir(pathcd);
|
| |
#endif
|
| |
system("wgnuplot graph.plt");
|
| |
|
| |
#ifdef windows
|
| |
while (z[0] != 'q') {
|
| |
chdir(pathcd);
|
| |
printf("\nType e to edit output files, c to start again, and q for exiting: ");
|
| |
scanf("%s",z);
|
| |
if (z[0] == 'c') system("./imach");
|
| |
else if (z[0] == 'e') {
|
| |
chdir(path);
|
| |
system("index.htm");
|
| |
}
|
| |
else if (z[0] == 'q') exit(0);
|
| |
}
|
| |
#endif
|
| |
}
|
| |
|
| |
|
![[BACK]](/icons/small/back.gif){kind=icon}
Return to imach.c CVS log ![[TXT]](/icons/small/text.gif){kind=icon}
![[DIR]](/icons/small/dir.gif){kind=icon}
Up to [Local Repository] / imach / src