libcminpack-dev 1.1.3-1build1 / usr / include / cminpack-1 / minpack.h

This file is indexed.

/usr/include/cminpack-1/minpack.h is in libcminpack-dev 1.1.3-1build1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below. 

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
#ifndef __MINPACK_H__
#define __MINPACK_H__

#ifdef __cplusplus
extern "C" {
#endif /* __cplusplus */

/* Declarations for minpack */

/* find a zero of a system of N nonlinear functions in N variables by
   a modification of the Powell hybrid method (Jacobian calculated by
   a forward-difference approximation) */
void hybrd1_ ( void (*fcn)(const int *n, const double *x, double *fvec, int *iflag ), 
	       const int *n, double *x, double *fvec, const double *tol, int *info,
	       double *wa, const int *lwa );

/* find a zero of a system of N nonlinear functions in N variables by
   a modification of the Powell hybrid method (Jacobian calculated by
   a forward-difference approximation, more general). */
void hybrd_ ( void (*fcn)(const int *n, const double *x, double *fvec, int *iflag ), 
	      const int *n, double *x, double *fvec, const double *xtol, const int *maxfev,
	      const int *ml, const int *mu, const double *epsfcn, double *diag, const int *mode,
	      const double *factor, const int *nprint, int *info, int *nfev,
	      double *fjac, const int *ldfjac, double *r, const int *lr, double *qtf,
	      double *wa1, double *wa2, double *wa3, double *wa4);
  
/* find a zero of a system of N nonlinear functions in N variables by
   a modification of the Powell hybrid method (user-supplied Jacobian) */
void hybrj1_ ( void (*fcn)(const int *n, const double *x, double *fvec, double *fjec,
			   const int *ldfjac, int *iflag ), const int *n, double *x,
	       double *fvec, double *fjec, const int *ldfjac, const double *tol,
	       int *info, double *wa, const int *lwa );
          
/* find a zero of a system of N nonlinear functions in N variables by
   a modification of the Powell hybrid method (user-supplied Jacobian,
   more general) */
void hybrj_ ( void (*fcn)(const int *n, const double *x, double *fvec, double *fjec,
			  const int *ldfjac, int *iflag ), const int *n, double *x,
	      double *fvec, double *fjec, const int *ldfjac, const double *xtol,
	      const int *maxfev, double *diag, const int *mode, const double *factor,
	      const int *nprint, int *info, int *nfev, int *njev, double *r,
	      const int *lr, double *qtf, double *wa1, double *wa2,
	      double *wa3, double *wa4 );

/* minimize the sum of the squares of nonlinear functions in N
   variables by a modification of the Levenberg-Marquardt algorithm
   (Jacobian calculated by a forward-difference approximation) */
void lmdif1_ ( void (*fcn)(const int *m, const int *n, const double *x, double *fvec,
			   int *iflag ),
	       const int *m, const int *n, double *x, double *fvec, const double *tol,
	       int *info, int *iwa, double *wa, const int *lwa );

/* minimize the sum of the squares of nonlinear functions in N
   variables by a modification of the Levenberg-Marquardt algorithm
   (Jacobian calculated by a forward-difference approximation, more
   general) */
void lmdif_ ( void (*fcn)(const int *m, const int *n, const double *x, double *fvec,
			  int *iflag ),
	      const int *m, const int *n, double *x, double *fvec, const double *ftol,
	      const double *xtol, const double *gtol, const int *maxfev, const double *epsfcn,
	      double *diag, const int *mode, const double *factor, const int *nprint,
	      int *info, int *nfev, double *fjac, const int *ldfjac, int *ipvt,
	      double *qtf, double *wa1, double *wa2, double *wa3,
	      double *wa4 );

/* minimize the sum of the squares of nonlinear functions in N
   variables by a modification of the Levenberg-Marquardt algorithm
   (user-supplied Jacobian) */
void lmder1_ ( void (*fcn)(const int *m, const int *n, const double *x, double *fvec,
			   double *fjec, const int *ldfjac, int *iflag ),
	       const int *m, const int *n, double *x, double *fvec, double *fjac,
	       const int *ldfjac, const double *tol, int *info, int *ipvt,
	       double *wa, const int *lwa );

/* minimize the sum of the squares of nonlinear functions in N
   variables by a modification of the Levenberg-Marquardt algorithm
   (user-supplied Jacobian, more general) */
void lmder_ ( void (*fcn)(const int *m, const int *n, const double *x, double *fvec,
			  double *fjec, const int *ldfjac, int *iflag ),
	      const int *m, const int *n, double *x, double *fvec, double *fjac,
	      const int *ldfjac, const double *ftol, const double *xtol, const double *gtol,
	      const int *maxfev, double *diag, const int *mode, const double *factor,
	      const int *nprint, int *info, int *nfev, int *njev, int *ipvt,
	      double *qtf, double *wa1, double *wa2, double *wa3,
	      double *wa4 );

/* minimize the sum of the squares of nonlinear functions in N
   variables by a modification of the Levenberg-Marquardt algorithm
   (user-supplied Jacobian, minimal storage) */
void lmstr1_ ( void (*fcn)(const int *m, const int *n, const double *x, double *fvec,
			   double *fjrow, int *iflag ), const int *m, const int *n,
	       double *x, double *fvec, double *fjac, const int *ldfjac,
	       const double *tol, int *info, int *ipvt, double *wa, const int *lwa );

/* minimize the sum of the squares of nonlinear functions in N
   variables by a modification of the Levenberg-Marquardt algorithm
   (user-supplied Jacobian, minimal storage, more general) */
void lmstr_ ( void (*fcn)(const int *m, const int *n, const double *x, double *fvec,
			  double *fjrow, int *iflag ), const int *m,
	      const int *n, double *x, double *fvec, double *fjac,
	      const int *ldfjac, const double *ftol, const double *xtol, const double *gtol,
	      const int *maxfev, double *diag, const int *mode, const double *factor,
	      const int *nprint, int *info, int *nfev, int *njev, int *ipvt,
	      double *qtf, double *wa1, double *wa2, double *wa3,
	      double *wa4 );
 
void chkder_ ( const int *m, const int *n, const double *x, double *fvec, double *fjec,
	       const int *ldfjac, double *xp, double *fvecp, const int *mode,
	       double *err  );

double dpmpar_ ( const int *i );

double enorm_ ( const int *n, const double *x );

/* compute a forward-difference approximation to the m by n jacobian
   matrix associated with a specified problem of m functions in n
   variables. */
void fdjac2_(void (*fcn)(const int *m, const int *n, const double *x, double *fvec,
			 int *iflag ),
	     const int *m, const int *n, double *x, const double *fvec, double *fjac,
	     const int *ldfjac, int *iflag, const double *epsfcn, double *wa);

/* compute a forward-difference approximation to the n by n jacobian
   matrix associated with a specified problem of n functions in n
   variables. if the jacobian has a banded form, then function
   evaluations are saved by only approximating the nonzero terms. */
void fdjac1_(void (*fcn)(const int *n, const double *x, double *fvec, int *iflag ),
	     const int *n, double *x, const double *fvec, double *fjac, const int *ldfjac,
	     int *iflag, const int *ml, const int *mu, const double *epsfcn, double *wa1,
	     double *wa2);

/* internal MINPACK subroutines */
void dogleg_(const int *n, const double *r, const int *lr, 
             const double *diag, const double *qtb, const double *delta, double *x, 
             double *wa1, double *wa2);
void qrfac_(const int *m, const int *n, double *a, const int *
            lda, const int *pivot, int *ipvt, const int *lipvt, double *rdiag,
            double *acnorm, double *wa);
void qrsolv_(const int *n, double *r, const int *ldr, 
             const int *ipvt, const double *diag, const double *qtb, double *x, 
             double *sdiag, double *wa);
void qform_(const int *m, const int *n, double *q, const int *
            ldq, double *wa);
void r1updt_(const int *m, const int *n, double *s, const int *
             ls, const double *u, double *v, double *w, int *sing);
void r1mpyq_(const int *m, const int *n, double *a, const int *
             lda, const double *v, const double *w);
void lmpar_(const int *n, double *r, const int *ldr, 
            const int *ipvt, const double *diag, const double *qtb, const double *delta, 
            double *par, double *x, double *sdiag, double *wa1, 
            double *wa2);
void rwupdt_(const int *n, double *r, const int *ldr, 
             const double *w, double *b, double *alpha, double *cos, 
             double *sin);
void covar_(const int *n, double *r, const int *ldr, 
           const int *ipvt, const double *tol, double *wa);
#ifdef __cplusplus
}
#endif /* __cplusplus */


#endif /* __CMINPACK_H__ */

APT Browse - Built by Thomas Orozco.