1 | /////////////////////////////////////////////////////////////////////////////////
|
---|
2 | //
|
---|
3 | // Levenberg - Marquardt non-linear minimization algorithm
|
---|
4 | // Copyright (C) 2004 Manolis Lourakis (lourakis at ics forth gr)
|
---|
5 | // Institute of Computer Science, Foundation for Research & Technology - Hellas
|
---|
6 | // Heraklion, Crete, Greece.
|
---|
7 | //
|
---|
8 | // This program is free software; you can redistribute it and/or modify
|
---|
9 | // it under the terms of the GNU General Public License as published by
|
---|
10 | // the Free Software Foundation; either version 2 of the License, or
|
---|
11 | // (at your option) any later version.
|
---|
12 | //
|
---|
13 | // This program is distributed in the hope that it will be useful,
|
---|
14 | // but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
15 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
16 | // GNU General Public License for more details.
|
---|
17 | //
|
---|
18 | /////////////////////////////////////////////////////////////////////////////////
|
---|
19 |
|
---|
20 | #ifndef _MISC_H_
|
---|
21 | #define _MISC_H_
|
---|
22 |
|
---|
23 | /* common prefix for BLAS subroutines. Leave undefined in case of no prefix. You might also need to modify LM_BLAS_PREFIX below */
|
---|
24 | /* f2c'd BLAS */
|
---|
25 | #define LM_BLAS_PREFIX f2c_
|
---|
26 | /* C BLAS */
|
---|
27 | //#define LM_BLAS_PREFIX cblas_
|
---|
28 |
|
---|
29 | /* common suffix for BLAS subroutines */
|
---|
30 | #define LM_BLAS_SUFFIX // define empty if a f2c_ or cblas_ prefix was defined for LM_BLAS_PREFIX above
|
---|
31 | //#define LM_BLAS_SUFFIX _ // use this in case of no BLAS prefix
|
---|
32 |
|
---|
33 |
|
---|
34 | #define LCAT_(a, b) #a b
|
---|
35 | #define LCAT(a, b) LCAT_(a, b) // force substitution
|
---|
36 | #define RCAT_(a, b) a #b
|
---|
37 | #define RCAT(a, b) RCAT_(a, b) // force substitution
|
---|
38 |
|
---|
39 | #define __BLOCKSZ__ 32 /* block size for cache-friendly matrix-matrix multiply. It should be
|
---|
40 | * such that __BLOCKSZ__^2*sizeof(LM_REAL) is smaller than the CPU (L1)
|
---|
41 | * data cache size. Notice that a value of 32 when LM_REAL=double assumes
|
---|
42 | * an 8Kb L1 data cache (32*32*8=8K). This is a concervative choice since
|
---|
43 | * newer Pentium 4s have a L1 data cache of size 16K, capable of holding
|
---|
44 | * up to 45x45 double blocks.
|
---|
45 | */
|
---|
46 | #define __BLOCKSZ__SQ (__BLOCKSZ__)*(__BLOCKSZ__)
|
---|
47 |
|
---|
48 | /* add a prefix in front of a token */
|
---|
49 | #define LM_CAT__(a, b) a ## b
|
---|
50 | #define LM_CAT_(a, b) LM_CAT__(a, b) // force substitution
|
---|
51 | #define LM_ADD_PREFIX(s) LM_CAT_(LM_PREFIX, s)
|
---|
52 |
|
---|
53 | #ifdef __cplusplus
|
---|
54 | extern "C" {
|
---|
55 | #endif
|
---|
56 |
|
---|
57 | /* blocking-based matrix multiply */
|
---|
58 | extern void slevmar_trans_mat_mat_mult(float *a, float *b, int n, int m);
|
---|
59 | extern void dlevmar_trans_mat_mat_mult(double *a, double *b, int n, int m);
|
---|
60 |
|
---|
61 | /* forward finite differences */
|
---|
62 | extern void slevmar_fdif_forw_jac_approx(void (*func)(float *p, float *hx, int m, int n, void *adata),
|
---|
63 | float *p, float *hx, float *hxx, float delta,
|
---|
64 | float *jac, int m, int n, void *adata);
|
---|
65 | extern void dlevmar_fdif_forw_jac_approx(void (*func)(double *p, double *hx, int m, int n, void *adata),
|
---|
66 | double *p, double *hx, double *hxx, double delta,
|
---|
67 | double *jac, int m, int n, void *adata);
|
---|
68 |
|
---|
69 | /* central finite differences */
|
---|
70 | extern void slevmar_fdif_cent_jac_approx(void (*func)(float *p, float *hx, int m, int n, void *adata),
|
---|
71 | float *p, float *hxm, float *hxp, float delta,
|
---|
72 | float *jac, int m, int n, void *adata);
|
---|
73 | extern void dlevmar_fdif_cent_jac_approx(void (*func)(double *p, double *hx, int m, int n, void *adata),
|
---|
74 | double *p, double *hxm, double *hxp, double delta,
|
---|
75 | double *jac, int m, int n, void *adata);
|
---|
76 |
|
---|
77 | /* e=x-y and ||e|| */
|
---|
78 | extern float slevmar_L2nrmxmy(float *e, float *x, float *y, int n);
|
---|
79 | extern double dlevmar_L2nrmxmy(double *e, double *x, double *y, int n);
|
---|
80 |
|
---|
81 | /* covariance of LS fit */
|
---|
82 | extern int slevmar_covar(float *JtJ, float *C, float sumsq, int m, int n);
|
---|
83 | extern int dlevmar_covar(double *JtJ, double *C, double sumsq, int m, int n);
|
---|
84 |
|
---|
85 | /* box constraints consistency check */
|
---|
86 | extern int slevmar_box_check(float *lb, float *ub, int m);
|
---|
87 | extern int dlevmar_box_check(double *lb, double *ub, int m);
|
---|
88 |
|
---|
89 | /* Cholesky */
|
---|
90 | extern int slevmar_chol(float *C, float *W, int m);
|
---|
91 | extern int dlevmar_chol(double *C, double *W, int m);
|
---|
92 |
|
---|
93 | #ifdef __cplusplus
|
---|
94 | }
|
---|
95 | #endif
|
---|
96 |
|
---|
97 | #endif /* _MISC_H_ */
|
---|