ap.h   ap.h 
skipping to change at line 629 skipping to change at line 629
int round(double x); int round(double x);
int trunc(double x); int trunc(double x);
int ifloor(double x); int ifloor(double x);
int iceil(double x); int iceil(double x);
double pi(); double pi();
double sqr(double x); double sqr(double x);
int maxint(int m1, int m2); int maxint(int m1, int m2);
int minint(int m1, int m2); int minint(int m1, int m2);
double maxreal(double m1, double m2); double maxreal(double m1, double m2);
double minreal(double m1, double m2); double minreal(double m1, double m2);
bool fp_eq(double v1, double v2);
bool fp_neq(double v1, double v2);
bool fp_less(double v1, double v2);
bool fp_less_eq(double v1, double v2);
bool fp_greater(double v1, double v2);
bool fp_greater_eq(double v1, double v2);
}//namespace ap }//namespace ap
#endif #endif
 End of changes. 1 change blocks. 
0 lines changed or deleted 6 lines changed or added


 autogk.h   autogk.h 
skipping to change at line 31 skipping to change at line 31
#ifndef _autogk_h #ifndef _autogk_h
#define _autogk_h #define _autogk_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "tsort.h" #include "tsort.h"
#include "blas.h" #include "blas.h"
#include "rotations.h" #include "rotations.h"
#include "tdevd.h" #include "tdevd.h"
#include "gammaf.h" #include "gammafunc.h"
#include "gq.h" #include "gq.h"
#include "gkq.h" #include "gkq.h"
/*************************************************************************
Integration report:
* TerminationType = completetion code:
* -5 non-convergence of Gauss-Kronrod nodes
calculation subroutine.
* -1 incorrect parameters were specified
* 1 OK
* Rep.NFEV countains number of function calculations
* Rep.NIntervals contains number of intervals [a,b]
was partitioned into.
*************************************************************************/
struct autogkreport struct autogkreport
{ {
int terminationtype; int terminationtype;
int nfev; int nfev;
int nintervals; int nintervals;
}; };
struct autogkinternalstate struct autogkinternalstate
{ {
double a; double a;
skipping to change at line 66 skipping to change at line 77
double sumerr; double sumerr;
double sumabs; double sumabs;
ap::real_1d_array qn; ap::real_1d_array qn;
ap::real_1d_array wg; ap::real_1d_array wg;
ap::real_1d_array wk; ap::real_1d_array wk;
ap::real_1d_array wr; ap::real_1d_array wr;
int n; int n;
ap::rcommstate rstate; ap::rcommstate rstate;
}; };
/*************************************************************************
This structure stores internal state of the integration algorithm between
subsequent calls of the AutoGKIteration() subroutine.
*************************************************************************/
struct autogkstate struct autogkstate
{ {
double a; double a;
double b; double b;
double alpha; double alpha;
double beta; double beta;
double xwidth; double xwidth;
double x; double x;
double xminusa; double xminusa;
double bminusx; double bminusx;
skipping to change at line 232 skipping to change at line 247
/************************************************************************* /*************************************************************************
Adaptive integration results Adaptive integration results
Called after AutoGKIteration returned False. Called after AutoGKIteration returned False.
Input parameters: Input parameters:
State - algorithm state (used by AutoGKIteration). State - algorithm state (used by AutoGKIteration).
Output parameters: Output parameters:
V - integral(f(x)dx,a,b) V - integral(f(x)dx,a,b)
Rep - optimization report: Rep - optimization report (see AutoGKReport description)
* Rep.TerminationType completetion code:
* -5 non-convergence of Gauss-Kronrod nodes
calculation subroutine.
* -1 incorrect parameters were specified
* 1 OK
* Rep.NFEV countains number of function calculations
* Rep.NIntervals contains number of intervals [a,b]
was partitioned into.
-- ALGLIB -- -- ALGLIB --
Copyright 14.11.2007 by Bochkanov Sergey Copyright 14.11.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void autogkresults(const autogkstate& state, double& v, autogkreport& rep); void autogkresults(const autogkstate& state, double& v, autogkreport& rep);
#endif #endif
 End of changes. 4 change blocks. 
10 lines changed or deleted 17 lines changed or added


 bdsvd.h   bdsvd.h 
skipping to change at line 125 skipping to change at line 125
int n, int n,
bool isupper, bool isupper,
bool isfractionalaccuracyrequired, bool isfractionalaccuracyrequired,
ap::real_2d_array& u, ap::real_2d_array& u,
int nru, int nru,
ap::real_2d_array& c, ap::real_2d_array& c,
int ncc, int ncc,
ap::real_2d_array& vt, ap::real_2d_array& vt,
int ncvt); int ncvt);
/*************************************************************************
Obsolete 1-based subroutine. See RMatrixBDSVD for 0-based replacement.
History:
* 31 March, 2007.
changed MAXITR from 6 to 12.
-- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
October 31, 1999.
*************************************************************************/
bool bidiagonalsvddecomposition(ap::real_1d_array& d, bool bidiagonalsvddecomposition(ap::real_1d_array& d,
ap::real_1d_array e, ap::real_1d_array e,
int n, int n,
bool isupper, bool isupper,
bool isfractionalaccuracyrequired, bool isfractionalaccuracyrequired,
ap::real_2d_array& u, ap::real_2d_array& u,
int nru, int nru,
ap::real_2d_array& c, ap::real_2d_array& c,
int ncc, int ncc,
ap::real_2d_array& vt, ap::real_2d_array& vt,
 End of changes. 1 change blocks. 
12 lines changed or deleted 0 lines changed or added


 betaf.h   betaf.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _betaf_h #ifndef _betaf_h
#define _betaf_h #define _betaf_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
/************************************************************************* /*************************************************************************
Beta function Beta function
- - - -
| (a) | (b) | (a) | (b)
beta( a, b ) = -----------. beta( a, b ) = -----------.
- -
| (a+b) | (a+b)
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 bidiagonal.h   bidiagonal.h 
skipping to change at line 254 skipping to change at line 254
-- ALGLIB -- -- ALGLIB --
Copyright 2005-2007 by Bochkanov Sergey Copyright 2005-2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void rmatrixbdunpackdiagonals(const ap::real_2d_array& b, void rmatrixbdunpackdiagonals(const ap::real_2d_array& b,
int m, int m,
int n, int n,
bool& isupper, bool& isupper,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::real_1d_array& e); ap::real_1d_array& e);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixBD for 0-based replacement.
*************************************************************************/
void tobidiagonal(ap::real_2d_array& a, void tobidiagonal(ap::real_2d_array& a,
int m, int m,
int n, int n,
ap::real_1d_array& tauq, ap::real_1d_array& tauq,
ap::real_1d_array& taup); ap::real_1d_array& taup);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixBDUnpackQ for 0-based replacement.
*************************************************************************/
void unpackqfrombidiagonal(const ap::real_2d_array& qp, void unpackqfrombidiagonal(const ap::real_2d_array& qp,
int m, int m,
int n, int n,
const ap::real_1d_array& tauq, const ap::real_1d_array& tauq,
int qcolumns, int qcolumns,
ap::real_2d_array& q); ap::real_2d_array& q);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixBDMultiplyByQ for 0-based replacement.
*************************************************************************/
void multiplybyqfrombidiagonal(const ap::real_2d_array& qp, void multiplybyqfrombidiagonal(const ap::real_2d_array& qp,
int m, int m,
int n, int n,
const ap::real_1d_array& tauq, const ap::real_1d_array& tauq,
ap::real_2d_array& z, ap::real_2d_array& z,
int zrows, int zrows,
int zcolumns, int zcolumns,
bool fromtheright, bool fromtheright,
bool dotranspose); bool dotranspose);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixBDUnpackPT for 0-based replacement.
*************************************************************************/
void unpackptfrombidiagonal(const ap::real_2d_array& qp, void unpackptfrombidiagonal(const ap::real_2d_array& qp,
int m, int m,
int n, int n,
const ap::real_1d_array& taup, const ap::real_1d_array& taup,
int ptrows, int ptrows,
ap::real_2d_array& pt); ap::real_2d_array& pt);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixBDMultiplyByP for 0-based replacement.
*************************************************************************/
void multiplybypfrombidiagonal(const ap::real_2d_array& qp, void multiplybypfrombidiagonal(const ap::real_2d_array& qp,
int m, int m,
int n, int n,
const ap::real_1d_array& taup, const ap::real_1d_array& taup,
ap::real_2d_array& z, ap::real_2d_array& z,
int zrows, int zrows,
int zcolumns, int zcolumns,
bool fromtheright, bool fromtheright,
bool dotranspose); bool dotranspose);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixBDUnpackDiagonals for 0-based replacement.
*************************************************************************/
void unpackdiagonalsfrombidiagonal(const ap::real_2d_array& b, void unpackdiagonalsfrombidiagonal(const ap::real_2d_array& b,
int m, int m,
int n, int n,
bool& isupper, bool& isupper,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::real_1d_array& e); ap::real_1d_array& e);
#endif #endif
 End of changes. 6 change blocks. 
24 lines changed or deleted 0 lines changed or added


 binomialdistr.h   binomialdistr.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _binomialdistr_h #ifndef _binomialdistr_h
#define _binomialdistr_h #define _binomialdistr_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "ibetaf.h" #include "ibetaf.h"
#include "nearunityunit.h" #include "nearunityunit.h"
/************************************************************************* /*************************************************************************
Binomial distribution Binomial distribution
Returns the sum of the terms 0 through k of the Binomial Returns the sum of the terms 0 through k of the Binomial
probability density: probability density:
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 cdet.h   cdet.h 
skipping to change at line 63 skipping to change at line 63
A - matrix, array[0..N-1, 0..N-1] A - matrix, array[0..N-1, 0..N-1]
N - size of matrix A. N - size of matrix A.
Result: determinant of matrix A. Result: determinant of matrix A.
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
ap::complex cmatrixdet(ap::complex_2d_array a, int n); ap::complex cmatrixdet(ap::complex_2d_array a, int n);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
ap::complex complexdeterminantlu(const ap::complex_2d_array& a, ap::complex complexdeterminantlu(const ap::complex_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n); int n);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
ap::complex complexdeterminant(ap::complex_2d_array a, int n); ap::complex complexdeterminant(ap::complex_2d_array a, int n);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 chisquaredistr.h   chisquaredistr.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _chisquaredistr_h #ifndef _chisquaredistr_h
#define _chisquaredistr_h #define _chisquaredistr_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "igammaf.h" #include "igammaf.h"
/************************************************************************* /*************************************************************************
Chi-square distribution Chi-square distribution
Returns the area under the left hand tail (from 0 to x) Returns the area under the left hand tail (from 0 to x)
of the Chi square probability density function with of the Chi square probability density function with
v degrees of freedom. v degrees of freedom.
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 cholesky.h   cholesky.h 
skipping to change at line 67 skipping to change at line 67
Otherwise, the function returns False. This means that the Otherwise, the function returns False. This means that the
factorization could not be carried out. factorization could not be carried out.
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
February 29, 1992 February 29, 1992
*************************************************************************/ *************************************************************************/
bool spdmatrixcholesky(ap::real_2d_array& a, int n, bool isupper); bool spdmatrixcholesky(ap::real_2d_array& a, int n, bool isupper);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
bool choleskydecomposition(ap::real_2d_array& a, int n, bool isupper); bool choleskydecomposition(ap::real_2d_array& a, int n, bool isupper);
#endif #endif
 End of changes. 1 change blocks. 
3 lines changed or deleted 0 lines changed or added


 cinverse.h   cinverse.h 
skipping to change at line 82 skipping to change at line 82
Result: Result:
True, if the matrix is not singular. True, if the matrix is not singular.
False, if the matrix is singular. False, if the matrix is singular.
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool cmatrixinverse(ap::complex_2d_array& a, int n); bool cmatrixinverse(ap::complex_2d_array& a, int n);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool complexinverselu(ap::complex_2d_array& a, bool complexinverselu(ap::complex_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n); int n);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool complexinverse(ap::complex_2d_array& a, int n); bool complexinverse(ap::complex_2d_array& a, int n);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 clu.h   clu.h 
skipping to change at line 85 skipping to change at line 85
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
June 30, 1992 June 30, 1992
*************************************************************************/ *************************************************************************/
void cmatrixlu(ap::complex_2d_array& a, void cmatrixlu(ap::complex_2d_array& a,
int m, int m,
int n, int n,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
/*************************************************************************
Obsolete 1-based subroutine, left for backward compatibility.
See CMatrixLU for 0-based replacement.
*************************************************************************/
void complexludecomposition(ap::complex_2d_array& a, void complexludecomposition(ap::complex_2d_array& a,
int m, int m,
int n, int n,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
/*************************************************************************
Obsolete 1-based subroutine, left for backward compatibility.
See CMatrixLU for 0-based replacement.
*************************************************************************/
void complexludecompositionunpacked(ap::complex_2d_array a, void complexludecompositionunpacked(ap::complex_2d_array a,
int m, int m,
int n, int n,
ap::complex_2d_array& l, ap::complex_2d_array& l,
ap::complex_2d_array& u, ap::complex_2d_array& u,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
#endif #endif
 End of changes. 2 change blocks. 
8 lines changed or deleted 0 lines changed or added


 correlationtests.h   correlationtests.h 
skipping to change at line 27 skipping to change at line 27
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _correlationtests_h #ifndef _correlationtests_h
#define _correlationtests_h #define _correlationtests_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "ibetaf.h" #include "ibetaf.h"
#include "studenttdistr.h" #include "studenttdistr.h"
#include "correlation.h" #include "correlation.h"
/************************************************************************* /*************************************************************************
Pearson's correlation coefficient significance test Pearson's correlation coefficient significance test
This test checks hypotheses about whether X and Y are samples of two This test checks hypotheses about whether X and Y are samples of two
continuous distributions having zero correlation or whether their continuous distributions having zero correlation or whether their
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 crcond.h   crcond.h 
skipping to change at line 99 skipping to change at line 99
Input parameters: Input parameters:
LUDcmp - LU decomposition of a matrix in compact form. Output of LUDcmp - LU decomposition of a matrix in compact form. Output of
the CMatrixLU subroutine. the CMatrixLU subroutine.
N - size of matrix A. N - size of matrix A.
Result: 1/LowerBound(cond(A)) Result: 1/LowerBound(cond(A))
*************************************************************************/ *************************************************************************/
double cmatrixlurcondinf(const ap::complex_2d_array& ludcmp, int n); double cmatrixlurcondinf(const ap::complex_2d_array& ludcmp, int n);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
double complexrcond1(ap::complex_2d_array a, int n); double complexrcond1(ap::complex_2d_array a, int n);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
double complexrcond1lu(const ap::complex_2d_array& lu, int n); double complexrcond1lu(const ap::complex_2d_array& lu, int n);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
double complexrcondinf(ap::complex_2d_array a, int n); double complexrcondinf(ap::complex_2d_array a, int n);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
double complexrcondinflu(const ap::complex_2d_array& lu, int n); double complexrcondinflu(const ap::complex_2d_array& lu, int n);
void internalestimatecomplexrcondlu(const ap::complex_2d_array& lu, void internalestimatecomplexrcondlu(const ap::complex_2d_array& lu,
const int& n, const int& n,
bool onenorm, bool onenorm,
bool isanormprovided, bool isanormprovided,
double anorm, double anorm,
double& rcond); double& rcond);
#endif #endif
 End of changes. 4 change blocks. 
12 lines changed or deleted 0 lines changed or added


 csolve.h   csolve.h 
skipping to change at line 96 skipping to change at line 96
solution. solution.
-- ALGLIB -- -- ALGLIB --
Copyright 2005-2008 by Bochkanov Sergey Copyright 2005-2008 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool cmatrixsolve(ap::complex_2d_array a, bool cmatrixsolve(ap::complex_2d_array a,
ap::complex_1d_array b, ap::complex_1d_array b,
int n, int n,
ap::complex_1d_array& x); ap::complex_1d_array& x);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool complexsolvesystemlu(const ap::complex_2d_array& a, bool complexsolvesystemlu(const ap::complex_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
ap::complex_1d_array b, ap::complex_1d_array b,
int n, int n,
ap::complex_1d_array& x); ap::complex_1d_array& x);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool complexsolvesystem(ap::complex_2d_array a, bool complexsolvesystem(ap::complex_2d_array a,
ap::complex_1d_array b, ap::complex_1d_array b,
int n, int n,
ap::complex_1d_array& x); ap::complex_1d_array& x);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 ctrinverse.h   ctrinverse.h 
skipping to change at line 76 skipping to change at line 76
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
February 29, 1992 February 29, 1992
*************************************************************************/ *************************************************************************/
bool cmatrixtrinverse(ap::complex_2d_array& a, bool cmatrixtrinverse(ap::complex_2d_array& a,
int n, int n,
bool isupper, bool isupper,
bool isunittriangular); bool isunittriangular);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool complexinvtriangular(ap::complex_2d_array& a, bool complexinvtriangular(ap::complex_2d_array& a,
int n, int n,
bool isupper, bool isupper,
bool isunittriangular); bool isunittriangular);
#endif #endif
 End of changes. 1 change blocks. 
3 lines changed or deleted 0 lines changed or added


 det.h   det.h 
skipping to change at line 63 skipping to change at line 63
A - matrix, array[0..N-1, 0..N-1] A - matrix, array[0..N-1, 0..N-1]
N - size of matrix A. N - size of matrix A.
Result: determinant of matrix A. Result: determinant of matrix A.
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
double rmatrixdet(ap::real_2d_array a, int n); double rmatrixdet(ap::real_2d_array a, int n);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixDetLU for 0-based replacement.
*************************************************************************/
double determinantlu(const ap::real_2d_array& a, double determinantlu(const ap::real_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n); int n);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixDet for 0-based replacement.
*************************************************************************/
double determinant(ap::real_2d_array a, int n); double determinant(ap::real_2d_array a, int n);
#endif #endif
 End of changes. 2 change blocks. 
8 lines changed or deleted 0 lines changed or added


 fdistr.h   fdistr.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _fdistr_h #ifndef _fdistr_h
#define _fdistr_h #define _fdistr_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "ibetaf.h" #include "ibetaf.h"
/************************************************************************* /*************************************************************************
F distribution F distribution
Returns the area from zero to x under the F density Returns the area from zero to x under the F density
function (also known as Snedcor's density or the function (also known as Snedcor's density or the
variance ratio density). This is the density variance ratio density). This is the density
of x = (u1/df1)/(u2/df2), where u1 and u2 are random of x = (u1/df1)/(u2/df2), where u1 and u2 are random
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 gkq.h   gkq.h 
skipping to change at line 31 skipping to change at line 31
#ifndef _gkq_h #ifndef _gkq_h
#define _gkq_h #define _gkq_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "tsort.h" #include "tsort.h"
#include "blas.h" #include "blas.h"
#include "rotations.h" #include "rotations.h"
#include "tdevd.h" #include "tdevd.h"
#include "gammaf.h" #include "gammafunc.h"
#include "gq.h" #include "gq.h"
/************************************************************************* /*************************************************************************
Computation of nodes and weights of a Gauss-Kronrod quadrature formula Computation of nodes and weights of a Gauss-Kronrod quadrature formula
The algorithm generates the N-point Gauss-Kronrod quadrature formula with The algorithm generates the N-point Gauss-Kronrod quadrature formula with
weight function given by coefficients alpha and beta of a recurrence weight function given by coefficients alpha and beta of a recurrence
relation which generates a system of orthogonal polynomials: relation which generates a system of orthogonal polynomials:
P-1(x) = 0 P-1(x) = 0
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 gq.h   gq.h 
skipping to change at line 30 skipping to change at line 30
#ifndef _gq_h #ifndef _gq_h
#define _gq_h #define _gq_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "blas.h" #include "blas.h"
#include "rotations.h" #include "rotations.h"
#include "tdevd.h" #include "tdevd.h"
#include "gammaf.h" #include "gammafunc.h"
/************************************************************************* /*************************************************************************
Computation of nodes and weights for a Gauss quadrature formula Computation of nodes and weights for a Gauss quadrature formula
The algorithm generates the N-point Gauss quadrature formula with weight The algorithm generates the N-point Gauss quadrature formula with weight
function given by coefficients alpha and beta of a recurrence relation function given by coefficients alpha and beta of a recurrence relation
which generates a system of orthogonal polynomials: which generates a system of orthogonal polynomials:
P-1(x) = 0 P-1(x) = 0
P0(x) = 1 P0(x) = 1
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 hbisinv.h   hbisinv.h 
skipping to change at line 141 skipping to change at line 141
*************************************************************************/ *************************************************************************/
bool hmatrixevdi(ap::complex_2d_array a, bool hmatrixevdi(ap::complex_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
int i1, int i1,
int i2, int i2,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::complex_2d_array& z); ap::complex_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool hermitianeigenvaluesandvectorsininterval(ap::complex_2d_array a, bool hermitianeigenvaluesandvectorsininterval(ap::complex_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
double b1, double b1,
double b2, double b2,
int& m, int& m,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::complex_2d_array& z); ap::complex_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool hermitianeigenvaluesandvectorsbyindexes(ap::complex_2d_array a, bool hermitianeigenvaluesandvectorsbyindexes(ap::complex_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
int i1, int i1,
int i2, int i2,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::complex_2d_array& z); ap::complex_2d_array& z);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 hcholesky.h   hcholesky.h 
skipping to change at line 69 skipping to change at line 69
Otherwise, the function returns False. This means that the Otherwise, the function returns False. This means that the
factorization could not be carried out. factorization could not be carried out.
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
February 29, 1992 February 29, 1992
*************************************************************************/ *************************************************************************/
bool hmatrixcholesky(ap::complex_2d_array& a, int n, bool isupper); bool hmatrixcholesky(ap::complex_2d_array& a, int n, bool isupper);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool hermitiancholeskydecomposition(ap::complex_2d_array& a, bool hermitiancholeskydecomposition(ap::complex_2d_array& a,
int n, int n,
bool isupper); bool isupper);
#endif #endif
 End of changes. 1 change blocks. 
3 lines changed or deleted 0 lines changed or added


 hessenberg.h   hessenberg.h 
skipping to change at line 109 skipping to change at line 109
Output parameters: Output parameters:
H - matrix H. Array whose indexes range within [0..N-1, 0..N-1]. H - matrix H. Array whose indexes range within [0..N-1, 0..N-1].
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void rmatrixhessenbergunpackh(const ap::real_2d_array& a, void rmatrixhessenbergunpackh(const ap::real_2d_array& a,
int n, int n,
ap::real_2d_array& h); ap::real_2d_array& h);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixHessenberg for 0-based replacement.
*************************************************************************/
void toupperhessenberg(ap::real_2d_array& a, int n, ap::real_1d_array& tau) ; void toupperhessenberg(ap::real_2d_array& a, int n, ap::real_1d_array& tau) ;
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixHessenbergUnpackQ for 0-based replacement.
*************************************************************************/
void unpackqfromupperhessenberg(const ap::real_2d_array& a, void unpackqfromupperhessenberg(const ap::real_2d_array& a,
int n, int n,
const ap::real_1d_array& tau, const ap::real_1d_array& tau,
ap::real_2d_array& q); ap::real_2d_array& q);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixHessenbergUnpackH for 0-based replacement.
*************************************************************************/
void unpackhfromupperhessenberg(const ap::real_2d_array& a, void unpackhfromupperhessenberg(const ap::real_2d_array& a,
int n, int n,
const ap::real_1d_array& tau, const ap::real_1d_array& tau,
ap::real_2d_array& h); ap::real_2d_array& h);
#endif #endif
 End of changes. 3 change blocks. 
12 lines changed or deleted 0 lines changed or added


 hevd.h   hevd.h 
skipping to change at line 80 skipping to change at line 80
Copyright 2005, 23 March 2007 by Bochkanov Sergey Copyright 2005, 23 March 2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool hmatrixevd(ap::complex_2d_array a, bool hmatrixevd(ap::complex_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::complex_2d_array& z); ap::complex_2d_array& z);
/************************************************************************* /*************************************************************************
Obsolete 1-based subroutine
-- ALGLIB -- -- ALGLIB --
Copyright 2005, 23 March 2007 by Bochkanov Sergey Copyright 2005, 23 March 2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool hermitianevd(ap::complex_2d_array a, bool hermitianevd(ap::complex_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::complex_2d_array& z); ap::complex_2d_array& z);
 End of changes. 1 change blocks. 
1 lines changed or deleted 0 lines changed or added


 htridiagonal.h   htridiagonal.h 
skipping to change at line 136 skipping to change at line 136
-- ALGLIB -- -- ALGLIB --
Copyright 2005, 2007, 2008 by Bochkanov Sergey Copyright 2005, 2007, 2008 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void hmatrixtdunpackq(const ap::complex_2d_array& a, void hmatrixtdunpackq(const ap::complex_2d_array& a,
const int& n, const int& n,
const bool& isupper, const bool& isupper,
const ap::complex_1d_array& tau, const ap::complex_1d_array& tau,
ap::complex_2d_array& q); ap::complex_2d_array& q);
/************************************************************************* /*************************************************************************
Obsolete 1-based subroutine
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
October 31, 1992 October 31, 1992
*************************************************************************/ *************************************************************************/
void hermitiantotridiagonal(ap::complex_2d_array& a, void hermitiantotridiagonal(ap::complex_2d_array& a,
int n, int n,
bool isupper, bool isupper,
ap::complex_1d_array& tau, ap::complex_1d_array& tau,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::real_1d_array& e); ap::real_1d_array& e);
/************************************************************************* /*************************************************************************
Obsolete 1-based subroutine
-- ALGLIB -- -- ALGLIB --
Copyright 2005, 2007 by Bochkanov Sergey Copyright 2005, 2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void unpackqfromhermitiantridiagonal(const ap::complex_2d_array& a, void unpackqfromhermitiantridiagonal(const ap::complex_2d_array& a,
const int& n, const int& n,
const bool& isupper, const bool& isupper,
const ap::complex_1d_array& tau, const ap::complex_1d_array& tau,
ap::complex_2d_array& q); ap::complex_2d_array& q);
 End of changes. 2 change blocks. 
2 lines changed or deleted 0 lines changed or added


 ibetaf.h   ibetaf.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _ibetaf_h #ifndef _ibetaf_h
#define _ibetaf_h #define _ibetaf_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
/************************************************************************* /*************************************************************************
Incomplete beta integral Incomplete beta integral
Returns incomplete beta integral of the arguments, evaluated Returns incomplete beta integral of the arguments, evaluated
from zero to x. The function is defined as from zero to x. The function is defined as
x x
- - - -
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 igammaf.h   igammaf.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _igammaf_h #ifndef _igammaf_h
#define _igammaf_h #define _igammaf_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
/************************************************************************* /*************************************************************************
Incomplete gamma integral Incomplete gamma integral
The function is defined by The function is defined by
x x
- -
1 | | -t a-1 1 | | -t a-1
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 inv.h   inv.h 
skipping to change at line 82 skipping to change at line 82
Result: Result:
True, if the matrix is not singular. True, if the matrix is not singular.
False, if the matrix is singular. False, if the matrix is singular.
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool rmatrixinverse(ap::real_2d_array& a, int n); bool rmatrixinverse(ap::real_2d_array& a, int n);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixLUInverse for 0-based replacement.
*************************************************************************/
bool inverselu(ap::real_2d_array& a, bool inverselu(ap::real_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n); int n);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixInverse for 0-based replacement.
*************************************************************************/
bool inverse(ap::real_2d_array& a, int n); bool inverse(ap::real_2d_array& a, int n);
#endif #endif
 End of changes. 2 change blocks. 
10 lines changed or deleted 0 lines changed or added


 inverseupdate.h   inverseupdate.h 
skipping to change at line 131 skipping to change at line 131
InvA - inverse of matrix A + u*v'. InvA - inverse of matrix A + u*v'.
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void rmatrixinvupdateuv(ap::real_2d_array& inva, void rmatrixinvupdateuv(ap::real_2d_array& inva,
int n, int n,
const ap::real_1d_array& u, const ap::real_1d_array& u,
const ap::real_1d_array& v); const ap::real_1d_array& v);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
void shermanmorrisonsimpleupdate(ap::real_2d_array& inva, void shermanmorrisonsimpleupdate(ap::real_2d_array& inva,
int n, int n,
int updrow, int updrow,
int updcolumn, int updcolumn,
double updval); double updval);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
void shermanmorrisonupdaterow(ap::real_2d_array& inva, void shermanmorrisonupdaterow(ap::real_2d_array& inva,
int n, int n,
int updrow, int updrow,
const ap::real_1d_array& v); const ap::real_1d_array& v);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
void shermanmorrisonupdatecolumn(ap::real_2d_array& inva, void shermanmorrisonupdatecolumn(ap::real_2d_array& inva,
int n, int n,
int updcolumn, int updcolumn,
const ap::real_1d_array& u); const ap::real_1d_array& u);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
void shermanmorrisonupdateuv(ap::real_2d_array& inva, void shermanmorrisonupdateuv(ap::real_2d_array& inva,
int n, int n,
const ap::real_1d_array& u, const ap::real_1d_array& u,
const ap::real_1d_array& v); const ap::real_1d_array& v);
#endif #endif
 End of changes. 4 change blocks. 
12 lines changed or deleted 0 lines changed or added


 ldlt.h   ldlt.h 
skipping to change at line 102 skipping to change at line 102
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
June 30, 1999 June 30, 1999
*************************************************************************/ *************************************************************************/
void smatrixldlt(ap::real_2d_array& a, void smatrixldlt(ap::real_2d_array& a,
int n, int n,
bool isupper, bool isupper,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
/*************************************************************************
Obsolete subroutine.
*************************************************************************/
void ldltdecomposition(ap::real_2d_array& a, void ldltdecomposition(ap::real_2d_array& a,
int n, int n,
bool isupper, bool isupper,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
#endif #endif
 End of changes. 1 change blocks. 
3 lines changed or deleted 0 lines changed or added


 linreg.h   linreg.h 
skipping to change at line 28 skipping to change at line 28
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _linreg_h #ifndef _linreg_h
#define _linreg_h #define _linreg_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "descriptivestatistics.h" #include "descriptivestatistics.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "igammaf.h" #include "igammaf.h"
#include "reflections.h" #include "reflections.h"
#include "bidiagonal.h" #include "bidiagonal.h"
#include "qr.h" #include "qr.h"
#include "lq.h" #include "lq.h"
#include "blas.h" #include "blas.h"
#include "rotations.h" #include "rotations.h"
#include "bdsvd.h" #include "bdsvd.h"
#include "svd.h" #include "svd.h"
skipping to change at line 334 skipping to change at line 334
RA - real array which stores decision forest RA - real array which stores decision forest
OUTPUT PARAMETERS: OUTPUT PARAMETERS:
LM - unserialized structure LM - unserialized structure
-- ALGLIB -- -- ALGLIB --
Copyright 15.03.2009 by Bochkanov Sergey Copyright 15.03.2009 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void lrunserialize(const ap::real_1d_array& ra, linearmodel& lm); void lrunserialize(const ap::real_1d_array& ra, linearmodel& lm);
/*************************************************************************
Obsolete subroutine, use LRBuildS
-- ALGLIB --
Copyright 26.04.2008 by Bochkanov Sergey
References:
1. Numerical Recipes in C, "15.2 Fitting Data to a Straight Line"
*************************************************************************/
void lrlines(const ap::real_2d_array& xy, void lrlines(const ap::real_2d_array& xy,
const ap::real_1d_array& s, const ap::real_1d_array& s,
int n, int n,
int& info, int& info,
double& a, double& a,
double& b, double& b,
double& vara, double& vara,
double& varb, double& varb,
double& covab, double& covab,
double& corrab, double& corrab,
double& p); double& p);
/*************************************************************************
Obsolete subroutine, use LRBuild
-- ALGLIB --
Copyright 02.08.2008 by Bochkanov Sergey
*************************************************************************/
void lrline(const ap::real_2d_array& xy, void lrline(const ap::real_2d_array& xy,
int n, int n,
int& info, int& info,
double& a, double& a,
double& b); double& b);
#endif #endif
 End of changes. 3 change blocks. 
16 lines changed or deleted 1 lines changed or added


 lq.h   lq.h 
skipping to change at line 112 skipping to change at line 112
L - matrix L, array[0..M-1, 0..N-1]. L - matrix L, array[0..M-1, 0..N-1].
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void rmatrixlqunpackl(const ap::real_2d_array& a, void rmatrixlqunpackl(const ap::real_2d_array& a,
int m, int m,
int n, int n,
ap::real_2d_array& l); ap::real_2d_array& l);
/*************************************************************************
Obsolete 1-based subroutine
See RMatrixLQ for 0-based replacement.
*************************************************************************/
void lqdecomposition(ap::real_2d_array& a, void lqdecomposition(ap::real_2d_array& a,
int m, int m,
int n, int n,
ap::real_1d_array& tau); ap::real_1d_array& tau);
/*************************************************************************
Obsolete 1-based subroutine
See RMatrixLQUnpackQ for 0-based replacement.
*************************************************************************/
void unpackqfromlq(const ap::real_2d_array& a, void unpackqfromlq(const ap::real_2d_array& a,
int m, int m,
int n, int n,
const ap::real_1d_array& tau, const ap::real_1d_array& tau,
int qrows, int qrows,
ap::real_2d_array& q); ap::real_2d_array& q);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
void lqdecompositionunpacked(ap::real_2d_array a, void lqdecompositionunpacked(ap::real_2d_array a,
int m, int m,
int n, int n,
ap::real_2d_array& l, ap::real_2d_array& l,
ap::real_2d_array& q); ap::real_2d_array& q);
#endif #endif
 End of changes. 3 change blocks. 
11 lines changed or deleted 0 lines changed or added


 lu.h   lu.h 
skipping to change at line 85 skipping to change at line 85
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
June 30, 1992 June 30, 1992
*************************************************************************/ *************************************************************************/
void rmatrixlu(ap::real_2d_array& a, void rmatrixlu(ap::real_2d_array& a,
int m, int m,
int n, int n,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
/*************************************************************************
Obsolete 1-based subroutine. Left for backward compatibility.
See RMatrixLU for 0-based replacement.
*************************************************************************/
void ludecomposition(ap::real_2d_array& a, void ludecomposition(ap::real_2d_array& a,
int m, int m,
int n, int n,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
/*************************************************************************
Obsolete 1-based subroutine. Left for backward compatibility.
*************************************************************************/
void ludecompositionunpacked(ap::real_2d_array a, void ludecompositionunpacked(ap::real_2d_array a,
int m, int m,
int n, int n,
ap::real_2d_array& l, ap::real_2d_array& l,
ap::real_2d_array& u, ap::real_2d_array& u,
ap::integer_1d_array& pivots); ap::integer_1d_array& pivots);
#endif #endif
 End of changes. 2 change blocks. 
7 lines changed or deleted 0 lines changed or added


 nsevd.h   nsevd.h 
skipping to change at line 113 skipping to change at line 113
The algorithm is based on the LAPACK 3.0 library. The algorithm is based on the LAPACK 3.0 library.
*************************************************************************/ *************************************************************************/
bool rmatrixevd(ap::real_2d_array a, bool rmatrixevd(ap::real_2d_array a,
int n, int n,
int vneeded, int vneeded,
ap::real_1d_array& wr, ap::real_1d_array& wr,
ap::real_1d_array& wi, ap::real_1d_array& wi,
ap::real_2d_array& vl, ap::real_2d_array& vl,
ap::real_2d_array& vr); ap::real_2d_array& vr);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool nonsymmetricevd(ap::real_2d_array a, bool nonsymmetricevd(ap::real_2d_array a,
int n, int n,
int vneeded, int vneeded,
ap::real_1d_array& wr, ap::real_1d_array& wr,
ap::real_1d_array& wi, ap::real_1d_array& wi,
ap::real_2d_array& vl, ap::real_2d_array& vl,
ap::real_2d_array& vr); ap::real_2d_array& vr);
#endif #endif
 End of changes. 1 change blocks. 
3 lines changed or deleted 0 lines changed or added


 poissondistr.h   poissondistr.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _poissondistr_h #ifndef _poissondistr_h
#define _poissondistr_h #define _poissondistr_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "igammaf.h" #include "igammaf.h"
/************************************************************************* /*************************************************************************
Poisson distribution Poisson distribution
Returns the sum of the first k+1 terms of the Poisson Returns the sum of the first k+1 terms of the Poisson
distribution: distribution:
k j k j
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 qr.h   qr.h 
skipping to change at line 122 skipping to change at line 122
R - matrix R, array[0..M-1, 0..N-1]. R - matrix R, array[0..M-1, 0..N-1].
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void rmatrixqrunpackr(const ap::real_2d_array& a, void rmatrixqrunpackr(const ap::real_2d_array& a,
int m, int m,
int n, int n,
ap::real_2d_array& r); ap::real_2d_array& r);
/*************************************************************************
Obsolete 1-based subroutine. See RMatrixQR for 0-based replacement.
*************************************************************************/
void qrdecomposition(ap::real_2d_array& a, void qrdecomposition(ap::real_2d_array& a,
int m, int m,
int n, int n,
ap::real_1d_array& tau); ap::real_1d_array& tau);
/*************************************************************************
Obsolete 1-based subroutine. See RMatrixQRUnpackQ for 0-based replacement.
*************************************************************************/
void unpackqfromqr(const ap::real_2d_array& a, void unpackqfromqr(const ap::real_2d_array& a,
int m, int m,
int n, int n,
const ap::real_1d_array& tau, const ap::real_1d_array& tau,
int qcolumns, int qcolumns,
ap::real_2d_array& q); ap::real_2d_array& q);
/*************************************************************************
Obsolete 1-based subroutine. See RMatrixQR for 0-based replacement.
*************************************************************************/
void qrdecompositionunpacked(ap::real_2d_array a, void qrdecompositionunpacked(ap::real_2d_array a,
int m, int m,
int n, int n,
ap::real_2d_array& q, ap::real_2d_array& q,
ap::real_2d_array& r); ap::real_2d_array& r);
#endif #endif
 End of changes. 3 change blocks. 
9 lines changed or deleted 0 lines changed or added


 ratinterpolation.h   ratinterpolation.h 
skipping to change at line 27 skipping to change at line 27
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _ratinterpolation_h #ifndef _ratinterpolation_h
#define _ratinterpolation_h #define _ratinterpolation_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "polinterpolation.h"
#include "tsort.h" #include "tsort.h"
/************************************************************************* /*************************************************************************
Rational barycentric interpolation without poles Rational barycentric interpolation without poles
The subroutine constructs the rational interpolating function without real The subroutine constructs the rational interpolating function without real
poles. It should be noted that the barycentric weights of the interpolant poles. It should be noted that the barycentric weights of the interpolant
constructed are independent of the values of the given function. constructed are independent of the values of the given function.
Input parameters: Input parameters:
 End of changes. 1 change blocks. 
1 lines changed or deleted 0 lines changed or added


 rcond.h   rcond.h 
skipping to change at line 99 skipping to change at line 99
Input parameters: Input parameters:
LUDcmp - LU decomposition of a matrix in compact form. Output of LUDcmp - LU decomposition of a matrix in compact form. Output of
the RMatrixLU subroutine. the RMatrixLU subroutine.
N - size of matrix A. N - size of matrix A.
Result: 1/LowerBound(cond(A)) Result: 1/LowerBound(cond(A))
*************************************************************************/ *************************************************************************/
double rmatrixlurcondinf(const ap::real_2d_array& ludcmp, int n); double rmatrixlurcondinf(const ap::real_2d_array& ludcmp, int n);
/*************************************************************************
Obsolete 1-based version, see RMatrixRCond1 for 0-bases replacement
*************************************************************************/
double rcond1(ap::real_2d_array a, int n); double rcond1(ap::real_2d_array a, int n);
/*************************************************************************
Obsolete 1-based subroutine, see RMatrixLURCond1 for 0-based replacement.
*************************************************************************/
double rcond1lu(const ap::real_2d_array& ludcmp, int n); double rcond1lu(const ap::real_2d_array& ludcmp, int n);
/*************************************************************************
Obsolete 1-based subroutine, see RMatrixRCondInf for 0-based replacement.
*************************************************************************/
double rcondinf(ap::real_2d_array a, int n); double rcondinf(ap::real_2d_array a, int n);
/*************************************************************************
Obsolete 1-based subroutine, see RMatrixLURCondInf for 0-based replacement
*************************************************************************/
double rcondinflu(const ap::real_2d_array& ludcmp, int n); double rcondinflu(const ap::real_2d_array& ludcmp, int n);
#endif #endif
 End of changes. 4 change blocks. 
12 lines changed or deleted 0 lines changed or added


 sbisinv.h   sbisinv.h 
skipping to change at line 129 skipping to change at line 129
*************************************************************************/ *************************************************************************/
bool smatrixevdi(ap::real_2d_array a, bool smatrixevdi(ap::real_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
int i1, int i1,
int i2, int i2,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::real_2d_array& z); ap::real_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool symmetriceigenvaluesandvectorsininterval(ap::real_2d_array a, bool symmetriceigenvaluesandvectorsininterval(ap::real_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
double b1, double b1,
double b2, double b2,
int& m, int& m,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::real_2d_array& z); ap::real_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool symmetriceigenvaluesandvectorsbyindexes(ap::real_2d_array a, bool symmetriceigenvaluesandvectorsbyindexes(ap::real_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
int i1, int i1,
int i2, int i2,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::real_2d_array& z); ap::real_2d_array& z);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 schur.h   schur.h 
skipping to change at line 80 skipping to change at line 80
Result: Result:
True, True,
if the algorithm has converged and parameters A and S contain the r esult. if the algorithm has converged and parameters A and S contain the r esult.
False, False,
if the algorithm has not converged. if the algorithm has not converged.
Algorithm implemented on the basis of the DHSEQR subroutine (LAPACK 3.0 lib rary). Algorithm implemented on the basis of the DHSEQR subroutine (LAPACK 3.0 lib rary).
*************************************************************************/ *************************************************************************/
bool rmatrixschur(ap::real_2d_array& a, int n, ap::real_2d_array& s); bool rmatrixschur(ap::real_2d_array& a, int n, ap::real_2d_array& s);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixSchur for 0-based replacement.
*************************************************************************/
bool schurdecomposition(ap::real_2d_array& a, int n, ap::real_2d_array& s); bool schurdecomposition(ap::real_2d_array& a, int n, ap::real_2d_array& s);
#endif #endif
 End of changes. 1 change blocks. 
4 lines changed or deleted 0 lines changed or added


 sdet.h   sdet.h 
skipping to change at line 71 skipping to change at line 71
by its lower triangle. by its lower triangle.
Result: Result:
determinant of matrix A. determinant of matrix A.
-- ALGLIB -- -- ALGLIB --
Copyright 2005-2008 by Bochkanov Sergey Copyright 2005-2008 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
double smatrixdet(ap::real_2d_array a, int n, bool isupper); double smatrixdet(ap::real_2d_array a, int n, bool isupper);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
double determinantldlt(const ap::real_2d_array& a, double determinantldlt(const ap::real_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n, int n,
bool isupper); bool isupper);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
double determinantsymmetric(ap::real_2d_array a, int n, bool isupper); double determinantsymmetric(ap::real_2d_array a, int n, bool isupper);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 sevd.h   sevd.h 
skipping to change at line 74 skipping to change at line 74
-- ALGLIB -- -- ALGLIB --
Copyright 2005-2008 by Bochkanov Sergey Copyright 2005-2008 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool smatrixevd(ap::real_2d_array a, bool smatrixevd(ap::real_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::real_2d_array& z); ap::real_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool symmetricevd(ap::real_2d_array a, bool symmetricevd(ap::real_2d_array a,
int n, int n,
int zneeded, int zneeded,
bool isupper, bool isupper,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::real_2d_array& z); ap::real_2d_array& z);
#endif #endif
 End of changes. 1 change blocks. 
3 lines changed or deleted 0 lines changed or added


 sinverse.h   sinverse.h 
skipping to change at line 108 skipping to change at line 108
True, if the matrix is not singular. True, if the matrix is not singular.
False, if the matrix is singular and could not be inverted. False, if the matrix is singular and could not be inverted.
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
March 31, 1993 March 31, 1993
*************************************************************************/ *************************************************************************/
bool smatrixinverse(ap::real_2d_array& a, int n, bool isupper); bool smatrixinverse(ap::real_2d_array& a, int n, bool isupper);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool inverseldlt(ap::real_2d_array& a, bool inverseldlt(ap::real_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n, int n,
bool isupper); bool isupper);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool inversesymmetricindefinite(ap::real_2d_array& a, int n, bool isupper); bool inversesymmetricindefinite(ap::real_2d_array& a, int n, bool isupper);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 spddet.h   spddet.h 
skipping to change at line 69 skipping to change at line 69
Result: Result:
determinant of matrix A. determinant of matrix A.
If matrix A is not positive definite, then subroutine returns -1. If matrix A is not positive definite, then subroutine returns -1.
-- ALGLIB -- -- ALGLIB --
Copyright 2005-2008 by Bochkanov Sergey Copyright 2005-2008 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
double spdmatrixdet(ap::real_2d_array a, int n, bool isupper); double spdmatrixdet(ap::real_2d_array a, int n, bool isupper);
/*************************************************************************
Obsolete subroutine
*************************************************************************/
double determinantcholesky(const ap::real_2d_array& a, int n); double determinantcholesky(const ap::real_2d_array& a, int n);
/*************************************************************************
Obsolete subroutine
*************************************************************************/
double determinantspd(ap::real_2d_array a, int n, bool isupper); double determinantspd(ap::real_2d_array a, int n, bool isupper);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 spdgevd.h   spdgevd.h 
skipping to change at line 158 skipping to change at line 158
*************************************************************************/ *************************************************************************/
bool smatrixgevdreduce(ap::real_2d_array& a, bool smatrixgevdreduce(ap::real_2d_array& a,
int n, int n,
bool isuppera, bool isuppera,
const ap::real_2d_array& b, const ap::real_2d_array& b,
bool isupperb, bool isupperb,
int problemtype, int problemtype,
ap::real_2d_array& r, ap::real_2d_array& r,
bool& isupperr); bool& isupperr);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool generalizedsymmetricdefiniteevd(ap::real_2d_array a, bool generalizedsymmetricdefiniteevd(ap::real_2d_array a,
int n, int n,
bool isuppera, bool isuppera,
const ap::real_2d_array& b, const ap::real_2d_array& b,
bool isupperb, bool isupperb,
int zneeded, int zneeded,
int problemtype, int problemtype,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::real_2d_array& z); ap::real_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool generalizedsymmetricdefiniteevdreduce(ap::real_2d_array& a, bool generalizedsymmetricdefiniteevdreduce(ap::real_2d_array& a,
int n, int n,
bool isuppera, bool isuppera,
const ap::real_2d_array& b, const ap::real_2d_array& b,
bool isupperb, bool isupperb,
int problemtype, int problemtype,
ap::real_2d_array& r, ap::real_2d_array& r,
bool& isupperr); bool& isupperr);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 spdinverse.h   spdinverse.h 
skipping to change at line 93 skipping to change at line 93
is used, and the elements below the main diagonal are not is used, and the elements below the main diagonal are not
used nor changed. The same applies if IsUpper = False. used nor changed. The same applies if IsUpper = False.
Result: Result:
True, if the matrix is positive definite. True, if the matrix is positive definite.
False, if the matrix is not positive definite (and it could not be False, if the matrix is not positive definite (and it could not be
inverted by this algorithm). inverted by this algorithm).
*************************************************************************/ *************************************************************************/
bool spdmatrixinverse(ap::real_2d_array& a, int n, bool isupper); bool spdmatrixinverse(ap::real_2d_array& a, int n, bool isupper);
/*************************************************************************
Obsolete subroutine.
*************************************************************************/
bool inversecholesky(ap::real_2d_array& a, int n, bool isupper); bool inversecholesky(ap::real_2d_array& a, int n, bool isupper);
/*************************************************************************
Obsolete subroutine.
*************************************************************************/
bool inversesymmetricpositivedefinite(ap::real_2d_array& a, bool inversesymmetricpositivedefinite(ap::real_2d_array& a,
int n, int n,
bool isupper); bool isupper);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 spdrcond.h   spdrcond.h 
skipping to change at line 83 skipping to change at line 83
Input parameters: Input parameters:
CD - Cholesky decomposition of matrix A, CD - Cholesky decomposition of matrix A,
output of SMatrixCholesky subroutine. output of SMatrixCholesky subroutine.
N - size of matrix A. N - size of matrix A.
Result: 1/LowerBound(cond(A)) Result: 1/LowerBound(cond(A))
*************************************************************************/ *************************************************************************/
double spdmatrixcholeskyrcond(const ap::real_2d_array& a, int n, bool isupp er); double spdmatrixcholeskyrcond(const ap::real_2d_array& a, int n, bool isupp er);
/*************************************************************************
Obsolete subroutine
*************************************************************************/
double rcondspd(ap::real_2d_array a, int n, bool isupper); double rcondspd(ap::real_2d_array a, int n, bool isupper);
/*************************************************************************
Obsolete subroutine
*************************************************************************/
double rcondcholesky(const ap::real_2d_array& cd, int n, bool isupper); double rcondcholesky(const ap::real_2d_array& cd, int n, bool isupper);
void internalcholeskyrcond(const ap::real_2d_array& chfrm, void internalcholeskyrcond(const ap::real_2d_array& chfrm,
int n, int n,
bool isupper, bool isupper,
bool isnormprovided, bool isnormprovided,
double anorm, double anorm,
double& rcond); double& rcond);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 spdsolve.h   spdsolve.h 
skipping to change at line 101 skipping to change at line 101
-- ALGLIB -- -- ALGLIB --
Copyright 2005-2008 by Bochkanov Sergey Copyright 2005-2008 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool spdmatrixsolve(ap::real_2d_array a, bool spdmatrixsolve(ap::real_2d_array a,
ap::real_1d_array b, ap::real_1d_array b,
int n, int n,
bool isupper, bool isupper,
ap::real_1d_array& x); ap::real_1d_array& x);
/*************************************************************************
Obsolete 1-bases subroutine
*************************************************************************/
bool solvesystemcholesky(const ap::real_2d_array& a, bool solvesystemcholesky(const ap::real_2d_array& a,
ap::real_1d_array b, ap::real_1d_array b,
int n, int n,
bool isupper, bool isupper,
ap::real_1d_array& x); ap::real_1d_array& x);
/*************************************************************************
Obsolete 1-bases subroutine
*************************************************************************/
bool solvespdsystem(ap::real_2d_array a, bool solvespdsystem(ap::real_2d_array a,
ap::real_1d_array b, ap::real_1d_array b,
int n, int n,
bool isupper, bool isupper,
ap::real_1d_array& x); ap::real_1d_array& x);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 spline2d.h   spline2d.h 
skipping to change at line 28 skipping to change at line 28
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _spline2d_h #ifndef _spline2d_h
#define _spline2d_h #define _spline2d_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "spline3.h" #include "spline3.h"
#include "blas.h"
#include "trinverse.h"
#include "cholesky.h"
#include "spdsolve.h"
#include "lbfgs.h"
#include "minlm.h"
#include "reflections.h"
#include "bidiagonal.h"
#include "qr.h"
#include "lq.h"
#include "rotations.h"
#include "bdsvd.h"
#include "svd.h"
#include "lu.h"
#include "trlinsolve.h"
#include "rcond.h"
#include "leastsquares.h"
#include "lsfit.h"
#include "spline1d.h"
/*************************************************************************
2-dimensional spline inteprolant
*************************************************************************/
struct spline2dinterpolant
{
int k;
ap::real_1d_array c;
};
/************************************************************************* /*************************************************************************
This subroutine builds bilinear spline coefficients table. This subroutine builds bilinear spline coefficients table.
Input parameters: Input parameters:
X - spline abscissas, array[0..N-1] X - spline abscissas, array[0..N-1]
Y - spline ordinates, array[0..M-1] Y - spline ordinates, array[0..M-1]
F - function values, array[0..M-1,0..N-1] F - function values, array[0..M-1,0..N-1]
M,N - grid size, M>=2, N>=2 M,N - grid size, M>=2, N>=2
Output parameters: Output parameters:
C - coefficients table. Used by SplineInterpolation2D and other C - spline interpolant
subroutines from this file.
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 05.07.2007 by Bochkanov Sergey Copyright 05.07.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void buildbilinearspline(ap::real_1d_array x, void spline2dbuildbilinear(ap::real_1d_array x,
ap::real_1d_array y, ap::real_1d_array y,
ap::real_2d_array f, ap::real_2d_array f,
int m, int m,
int n, int n,
ap::real_1d_array& c); spline2dinterpolant& c);
/************************************************************************* /*************************************************************************
This subroutine builds bicubic spline coefficients table. This subroutine builds bicubic spline coefficients table.
Input parameters: Input parameters:
X - spline abscissas, array[0..N-1] X - spline abscissas, array[0..N-1]
Y - spline ordinates, array[0..M-1] Y - spline ordinates, array[0..M-1]
F - function values, array[0..M-1,0..N-1] F - function values, array[0..M-1,0..N-1]
M,N - grid size, M>=2, N>=2 M,N - grid size, M>=2, N>=2
Output parameters: Output parameters:
C - coefficients table. Used by SplineInterpolation2D and other C - spline interpolant
subroutines from this file.
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 05.07.2007 by Bochkanov Sergey Copyright 05.07.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void buildbicubicspline(ap::real_1d_array x, void spline2dbuildbicubic(ap::real_1d_array x,
ap::real_1d_array y, ap::real_1d_array y,
ap::real_2d_array f, ap::real_2d_array f,
int m, int m,
int n, int n,
ap::real_1d_array& c); spline2dinterpolant& c);
/************************************************************************* /*************************************************************************
This subroutine calculates the value of the bilinear or bicubic spline at This subroutine calculates the value of the bilinear or bicubic spline at
the given point X. the given point X.
Input parameters: Input parameters:
C - coefficients table. C - coefficients table.
Built by BuildBilinearSpline or BuildBicubicSpline. Built by BuildBilinearSpline or BuildBicubicSpline.
X, Y- point X, Y- point
Result: Result:
S(x,y) S(x,y)
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 05.07.2007 by Bochkanov Sergey Copyright 05.07.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
double splineinterpolation2d(const ap::real_1d_array& c, double x, double y ); double spline2dcalc(const spline2dinterpolant& c, double x, double y);
/************************************************************************* /*************************************************************************
This subroutine calculates the value of the bilinear or bicubic spline at This subroutine calculates the value of the bilinear or bicubic spline at
the given point X and its derivatives. the given point X and its derivatives.
Input parameters: Input parameters:
C - coefficients table. C - spline interpolant.
Built by BuildBilinearSpline or BuildBicubicSpline.
X, Y- point X, Y- point
Output parameters: Output parameters:
F - S(x,y) F - S(x,y)
FX - dS(x,y)/dX FX - dS(x,y)/dX
FY - dS(x,y)/dY FY - dS(x,y)/dY
FXY - d2S(x,y)/dXdY FXY - d2S(x,y)/dXdY
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 05.07.2007 by Bochkanov Sergey Copyright 05.07.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void splinedifferentiation2d(const ap::real_1d_array& c, void spline2ddiff(const spline2dinterpolant& c,
double x, double x,
double y, double y,
double& f, double& f,
double& fx, double& fx,
double& fy, double& fy,
double& fxy); double& fxy);
/************************************************************************* /*************************************************************************
This subroutine unpacks two-dimensional spline into the coefficients table This subroutine unpacks two-dimensional spline into the coefficients table
Input parameters: Input parameters:
C - coefficients table. C - spline interpolant.
Result: Result:
M, N- grid size (x-axis and y-axis) M, N- grid size (x-axis and y-axis)
Tbl - coefficients table, unpacked format, Tbl - coefficients table, unpacked format,
[0..(N-1)*(M-1)-1, 0..19]. [0..(N-1)*(M-1)-1, 0..19].
For I = 0...M-2, J=0..N-2: For I = 0...M-2, J=0..N-2:
K = I*(N-1)+J K = I*(N-1)+J
Tbl[K,0] = X[j] Tbl[K,0] = X[j]
Tbl[K,1] = X[j+1] Tbl[K,1] = X[j+1]
Tbl[K,2] = Y[i] Tbl[K,2] = Y[i]
skipping to change at line 150 skipping to change at line 175
... ...
Tbl[K,19] = C33 Tbl[K,19] = C33
On each grid square spline is equals to: On each grid square spline is equals to:
S(x) = SUM(c[i,j]*(x^i)*(y^j), i=0..3, j=0..3) S(x) = SUM(c[i,j]*(x^i)*(y^j), i=0..3, j=0..3)
t = x-x[j] t = x-x[j]
u = y-y[i] u = y-y[i]
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 29.06.2007 by Bochkanov Sergey Copyright 29.06.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void splineunpack2d(const ap::real_1d_array& c, void spline2dunpack(const spline2dinterpolant& c,
int& m, int& m,
int& n, int& n,
ap::real_2d_array& tbl); ap::real_2d_array& tbl);
/************************************************************************* /*************************************************************************
This subroutine performs linear transformation of the spline argument. This subroutine performs linear transformation of the spline argument.
Input parameters: Input parameters:
C - coefficients table. C - spline interpolant
AX, BX - transformation coefficients: x = A*t + B AX, BX - transformation coefficients: x = A*t + B
AY, BY - transformation coefficients: y = A*u + B AY, BY - transformation coefficients: y = A*u + B
Result: Result:
C - transformed spline C - transformed spline
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 30.06.2007 by Bochkanov Sergey Copyright 30.06.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void spline2dlintransxy(ap::real_1d_array& c, void spline2dlintransxy(spline2dinterpolant& c,
double ax, double ax,
double bx, double bx,
double ay, double ay,
double by); double by);
/************************************************************************* /*************************************************************************
This subroutine performs linear transformation of the spline. This subroutine performs linear transformation of the spline.
Input parameters: Input parameters:
C - coefficients table. Built by BuildLinearSpline, C - spline interpolant.
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
A, B- transformation coefficients: S2(x,y) = A*S(x,y) + B A, B- transformation coefficients: S2(x,y) = A*S(x,y) + B
Output parameters: Output parameters:
C - transformed spline C - transformed spline
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 30.06.2007 by Bochkanov Sergey Copyright 30.06.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void spline2dlintransf(ap::real_1d_array& c, double a, double b); void spline2dlintransf(spline2dinterpolant& c, double a, double b);
/************************************************************************* /*************************************************************************
This subroutine makes the copy of the spline. This subroutine makes the copy of the spline model.
Input parameters: Input parameters:
C - coefficients table. C - spline interpolant
Output parameters: Output parameters:
CC - spline copy CC - spline copy
-- ALGLIB PROJECT -- -- ALGLIB PROJECT --
Copyright 29.06.2007 by Bochkanov Sergey Copyright 29.06.2007 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void spline2dcopy(const ap::real_1d_array& c, ap::real_1d_array& cc); void spline2dcopy(const spline2dinterpolant& c, spline2dinterpolant& cc);
/*************************************************************************
Serialization of the spline interpolant
INPUT PARAMETERS:
B - spline interpolant
OUTPUT PARAMETERS:
RA - array of real numbers which contains interpolant,
array[0..RLen-1]
RLen - RA lenght
-- ALGLIB --
Copyright 17.08.2009 by Bochkanov Sergey
*************************************************************************/
void spline2dserialize(const spline2dinterpolant& c,
ap::real_1d_array& ra,
int& ralen);
/*************************************************************************
Unserialization of the spline interpolant
INPUT PARAMETERS:
RA - array of real numbers which contains interpolant,
OUTPUT PARAMETERS:
B - spline interpolant
-- ALGLIB --
Copyright 17.08.2009 by Bochkanov Sergey
*************************************************************************/
void spline2dunserialize(const ap::real_1d_array& ra, spline2dinterpolant&
c);
/************************************************************************* /*************************************************************************
Bicubic spline resampling Bicubic spline resampling
Input parameters: Input parameters:
A - function values at the old grid, A - function values at the old grid,
array[0..OldHeight-1, 0..OldWidth-1] array[0..OldHeight-1, 0..OldWidth-1]
OldHeight - old grid height, OldHeight>1 OldHeight - old grid height, OldHeight>1
OldWidth - old grid width, OldWidth>1 OldWidth - old grid width, OldWidth>1
NewHeight - new grid height, NewHeight>1 NewHeight - new grid height, NewHeight>1
NewWidth - new grid width, NewWidth>1 NewWidth - new grid width, NewWidth>1
Output parameters: Output parameters:
B - function values at the new grid, B - function values at the new grid,
array[0..NewHeight-1, 0..NewWidth-1] array[0..NewHeight-1, 0..NewWidth-1]
-- ALGLIB routine -- -- ALGLIB routine --
15 May, 2007 15 May, 2007
Copyright by Bochkanov Sergey Copyright by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void bicubicresamplecartesian(const ap::real_2d_array& a, void spline2dresamplebicubic(const ap::real_2d_array& a,
int oldheight, int oldheight,
int oldwidth, int oldwidth,
ap::real_2d_array& b, ap::real_2d_array& b,
int newheight, int newheight,
int newwidth); int newwidth);
/************************************************************************* /*************************************************************************
Bilinear spline resampling Bilinear spline resampling
Input parameters: Input parameters:
skipping to change at line 249 skipping to change at line 305
NewWidth - new grid width, NewWidth>1 NewWidth - new grid width, NewWidth>1
Output parameters: Output parameters:
B - function values at the new grid, B - function values at the new grid,
array[0..NewHeight-1, 0..NewWidth-1] array[0..NewHeight-1, 0..NewWidth-1]
-- ALGLIB routine -- -- ALGLIB routine --
09.07.2007 09.07.2007
Copyright by Bochkanov Sergey Copyright by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void bilinearresamplecartesian(const ap::real_2d_array& a, void spline2dresamplebilinear(const ap::real_2d_array& a,
int oldheight, int oldheight,
int oldwidth, int oldwidth,
ap::real_2d_array& b, ap::real_2d_array& b,
int newheight, int newheight,
int newwidth); int newwidth);
/*************************************************************************
Obsolete subroutine for backwards compatibility
*************************************************************************/
void bicubicresample(int oldwidth,
int oldheight,
int newwidth,
int newheight,
const ap::real_2d_array& a,
ap::real_2d_array& b);
/*************************************************************************
Obsolete subroutine for backwards compatibility
*************************************************************************/
void bilinearresample(int oldwidth,
int oldheight,
int newwidth,
int newheight,
const ap::real_2d_array& a,
ap::real_2d_array& b);
#endif #endif
 End of changes. 22 change blocks. 
44 lines changed or deleted 81 lines changed or added


 spline3.h   spline3.h 
skipping to change at line 27 skipping to change at line 27
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _spline3_h #ifndef _spline3_h
#define _spline3_h #define _spline3_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
/*************************************************************************
This subroutine builds linear spline coefficients table.
Input parameters:
X - spline nodes, array[0..N-1]
Y - function values, array[0..N-1]
N - points count, N>=2
Output parameters:
C - coefficients table. Used by SplineInterpolation and other
subroutines from this file.
-- ALGLIB PROJECT --
Copyright 24.06.2007 by Bochkanov Sergey
*************************************************************************/
void buildlinearspline(ap::real_1d_array x, void buildlinearspline(ap::real_1d_array x,
ap::real_1d_array y, ap::real_1d_array y,
int n, int n,
ap::real_1d_array& c); ap::real_1d_array& c);
/*************************************************************************
This subroutine builds cubic spline coefficients table.
Input parameters:
X - spline nodes, array[0..N-1]
Y - function values, array[0..N-1]
N - points count, N>=2
BoundLType - boundary condition type for the left boundary
BoundL - left boundary condition (first or second derivative,
depending on the BoundLType)
BoundRType - boundary condition type for the right boundary
BoundR - right boundary condition (first or second derivative,
depending on the BoundRType)
Output parameters:
C - coefficients table. Used by SplineInterpolation and
other subroutines from this file.
The BoundLType/BoundRType parameters can have the following values:
* 0, which corresponds to the parabolically terminated spline
(BoundL/BoundR are ignored).
* 1, which corresponds to the first derivative boundary condition
* 2, which corresponds to the second derivative boundary condition
-- ALGLIB PROJECT --
Copyright 23.06.2007 by Bochkanov Sergey
*************************************************************************/
void buildcubicspline(ap::real_1d_array x, void buildcubicspline(ap::real_1d_array x,
ap::real_1d_array y, ap::real_1d_array y,
int n, int n,
int boundltype, int boundltype,
double boundl, double boundl,
int boundrtype, int boundrtype,
double boundr, double boundr,
ap::real_1d_array& c); ap::real_1d_array& c);
/*************************************************************************
This subroutine builds cubic Hermite spline coefficients table.
Input parameters:
X - spline nodes, array[0..N-1]
Y - function values, array[0..N-1]
D - derivatives, array[0..N-1]
N - points count, N>=2
Output parameters:
C - coefficients table. Used by SplineInterpolation and
other subroutines from this file.
-- ALGLIB PROJECT --
Copyright 23.06.2007 by Bochkanov Sergey
*************************************************************************/
void buildhermitespline(ap::real_1d_array x, void buildhermitespline(ap::real_1d_array x,
ap::real_1d_array y, ap::real_1d_array y,
ap::real_1d_array d, ap::real_1d_array d,
int n, int n,
ap::real_1d_array& c); ap::real_1d_array& c);
/*************************************************************************
This subroutine builds Akima spline coefficients table.
Input parameters:
X - spline nodes, array[0..N-1]
Y - function values, array[0..N-1]
N - points count, N>=5
Output parameters:
C - coefficients table. Used by SplineInterpolation and
other subroutines from this file.
-- ALGLIB PROJECT --
Copyright 24.06.2007 by Bochkanov Sergey
*************************************************************************/
void buildakimaspline(ap::real_1d_array x, void buildakimaspline(ap::real_1d_array x,
ap::real_1d_array y, ap::real_1d_array y,
int n, int n,
ap::real_1d_array& c); ap::real_1d_array& c);
/*************************************************************************
This subroutine calculates the value of the spline at the given point X.
Input parameters:
C - coefficients table. Built by BuildLinearSpline,
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
X - point
Result:
S(x)
-- ALGLIB PROJECT --
Copyright 23.06.2007 by Bochkanov Sergey
*************************************************************************/
double splineinterpolation(const ap::real_1d_array& c, double x); double splineinterpolation(const ap::real_1d_array& c, double x);
/*************************************************************************
This subroutine differentiates the spline.
Input parameters:
C - coefficients table. Built by BuildLinearSpline,
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
X - point
Result:
S - S(x)
DS - S'(x)
D2S - S''(x)
-- ALGLIB PROJECT --
Copyright 24.06.2007 by Bochkanov Sergey
*************************************************************************/
void splinedifferentiation(const ap::real_1d_array& c, void splinedifferentiation(const ap::real_1d_array& c,
double x, double x,
double& s, double& s,
double& ds, double& ds,
double& d2s); double& d2s);
/*************************************************************************
This subroutine makes the copy of the spline.
Input parameters:
C - coefficients table. Built by BuildLinearSpline,
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
Result:
CC - spline copy
-- ALGLIB PROJECT --
Copyright 29.06.2007 by Bochkanov Sergey
*************************************************************************/
void splinecopy(const ap::real_1d_array& c, ap::real_1d_array& cc); void splinecopy(const ap::real_1d_array& c, ap::real_1d_array& cc);
/*************************************************************************
This subroutine unpacks the spline into the coefficients table.
Input parameters:
C - coefficients table. Built by BuildLinearSpline,
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
X - point
Result:
Tbl - coefficients table, unpacked format, array[0..N-2, 0..5].
For I = 0...N-2:
Tbl[I,0] = X[i]
Tbl[I,1] = X[i+1]
Tbl[I,2] = C0
Tbl[I,3] = C1
Tbl[I,4] = C2
Tbl[I,5] = C3
On [x[i], x[i+1]] spline is equals to:
S(x) = C0 + C1*t + C2*t^2 + C3*t^3
t = x-x[i]
-- ALGLIB PROJECT --
Copyright 29.06.2007 by Bochkanov Sergey
*************************************************************************/
void splineunpack(const ap::real_1d_array& c, int& n, ap::real_2d_array& tb l); void splineunpack(const ap::real_1d_array& c, int& n, ap::real_2d_array& tb l);
/*************************************************************************
This subroutine performs linear transformation of the spline argument.
Input parameters:
C - coefficients table. Built by BuildLinearSpline,
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
A, B- transformation coefficients: x = A*t + B
Result:
C - transformed spline
-- ALGLIB PROJECT --
Copyright 30.06.2007 by Bochkanov Sergey
*************************************************************************/
void splinelintransx(ap::real_1d_array& c, double a, double b); void splinelintransx(ap::real_1d_array& c, double a, double b);
/*************************************************************************
This subroutine performs linear transformation of the spline.
Input parameters:
C - coefficients table. Built by BuildLinearSpline,
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
A, B- transformation coefficients: S2(x) = A*S(x) + B
Result:
C - transformed spline
-- ALGLIB PROJECT --
Copyright 30.06.2007 by Bochkanov Sergey
*************************************************************************/
void splinelintransy(ap::real_1d_array& c, double a, double b); void splinelintransy(ap::real_1d_array& c, double a, double b);
/*************************************************************************
This subroutine integrates the spline.
Input parameters:
C - coefficients table. Built by BuildLinearSpline,
BuildHermiteSpline, BuildCubicSpline, BuildAkimaSpline.
X - right bound of the integration interval [a, x]
Result:
integral(S(t)dt,a,x)
-- ALGLIB PROJECT --
Copyright 23.06.2007 by Bochkanov Sergey
*************************************************************************/
double splineintegration(const ap::real_1d_array& c, double x); double splineintegration(const ap::real_1d_array& c, double x);
/*************************************************************************
Obsolete subroutine, left for backward compatibility.
*************************************************************************/
void spline3buildtable(int n, void spline3buildtable(int n,
const int& diffn, const int& diffn,
ap::real_1d_array x, ap::real_1d_array x,
ap::real_1d_array y, ap::real_1d_array y,
const double& boundl, const double& boundl,
const double& boundr, const double& boundr,
ap::real_2d_array& ctbl); ap::real_2d_array& ctbl);
/*************************************************************************
Obsolete subroutine, left for backward compatibility.
*************************************************************************/
double spline3interpolate(int n, const ap::real_2d_array& c, const double& x); double spline3interpolate(int n, const ap::real_2d_array& c, const double& x);
#endif #endif
 End of changes. 13 change blocks. 
185 lines changed or deleted 0 lines changed or added


 srcond.h   srcond.h 
skipping to change at line 88 skipping to change at line 88
IsUpper - storage format. IsUpper - storage format.
Result: Result:
1/LowerBound(cond(A)) 1/LowerBound(cond(A))
*************************************************************************/ *************************************************************************/
double smatrixldltrcond(const ap::real_2d_array& l, double smatrixldltrcond(const ap::real_2d_array& l,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n, int n,
bool isupper); bool isupper);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
double rcondsymmetric(ap::real_2d_array a, int n, bool isupper); double rcondsymmetric(ap::real_2d_array a, int n, bool isupper);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
double rcondldlt(const ap::real_2d_array& l, double rcondldlt(const ap::real_2d_array& l,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n, int n,
bool isupper); bool isupper);
void internalldltrcond(const ap::real_2d_array& l, void internalldltrcond(const ap::real_2d_array& l,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
int n, int n,
bool isupper, bool isupper,
bool isnormprovided, bool isnormprovided,
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 ssolve.h   ssolve.h 
skipping to change at line 103 skipping to change at line 103
-- ALGLIB -- -- ALGLIB --
Copyright 2005 by Bochkanov Sergey Copyright 2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool smatrixsolve(ap::real_2d_array a, bool smatrixsolve(ap::real_2d_array a,
const ap::real_1d_array& b, const ap::real_1d_array& b,
int n, int n,
bool isupper, bool isupper,
ap::real_1d_array& x); ap::real_1d_array& x);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
bool solvesystemldlt(const ap::real_2d_array& a, bool solvesystemldlt(const ap::real_2d_array& a,
const ap::integer_1d_array& pivots, const ap::integer_1d_array& pivots,
ap::real_1d_array b, ap::real_1d_array b,
int n, int n,
bool isupper, bool isupper,
ap::real_1d_array& x); ap::real_1d_array& x);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool solvesymmetricsystem(ap::real_2d_array a, bool solvesymmetricsystem(ap::real_2d_array a,
ap::real_1d_array b, ap::real_1d_array b,
int n, int n,
bool isupper, bool isupper,
ap::real_1d_array& x); ap::real_1d_array& x);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 stest.h   stest.h 
skipping to change at line 27 skipping to change at line 27
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _stest_h #ifndef _stest_h
#define _stest_h #define _stest_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "ibetaf.h" #include "ibetaf.h"
#include "nearunityunit.h" #include "nearunityunit.h"
#include "binomialdistr.h" #include "binomialdistr.h"
/************************************************************************* /*************************************************************************
Sign test Sign test
This test checks three hypotheses about the median of the given sample. This test checks three hypotheses about the median of the given sample.
The following tests are performed: The following tests are performed:
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 studenttdistr.h   studenttdistr.h 
skipping to change at line 34 skipping to change at line 34
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _studenttdistr_h #ifndef _studenttdistr_h
#define _studenttdistr_h #define _studenttdistr_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "ibetaf.h" #include "ibetaf.h"
/************************************************************************* /*************************************************************************
Student's t distribution Student's t distribution
Computes the integral from minus infinity to t of the Student Computes the integral from minus infinity to t of the Student
t distribution with integer k > 0 degrees of freedom: t distribution with integer k > 0 degrees of freedom:
t t
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 studentttests.h   studentttests.h 
skipping to change at line 27 skipping to change at line 27
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _studentttests_h #ifndef _studentttests_h
#define _studentttests_h #define _studentttests_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "ibetaf.h" #include "ibetaf.h"
#include "studenttdistr.h" #include "studenttdistr.h"
/************************************************************************* /*************************************************************************
One-sample t-test One-sample t-test
This test checks three hypotheses about the mean of the given sample. The This test checks three hypotheses about the mean of the given sample. The
following tests are performed: following tests are performed:
* two-tailed test (null hypothesis - the mean is equal to the given * two-tailed test (null hypothesis - the mean is equal to the given
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added


 svd.h   svd.h 
skipping to change at line 97 skipping to change at line 97
bool rmatrixsvd(ap::real_2d_array a, bool rmatrixsvd(ap::real_2d_array a,
int m, int m,
int n, int n,
int uneeded, int uneeded,
int vtneeded, int vtneeded,
int additionalmemory, int additionalmemory,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::real_2d_array& u, ap::real_2d_array& u,
ap::real_2d_array& vt); ap::real_2d_array& vt);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixSVD for 0-based replacement.
*************************************************************************/
bool svddecomposition(ap::real_2d_array a, bool svddecomposition(ap::real_2d_array a,
int m, int m,
int n, int n,
int uneeded, int uneeded,
int vtneeded, int vtneeded,
int additionalmemory, int additionalmemory,
ap::real_1d_array& w, ap::real_1d_array& w,
ap::real_2d_array& u, ap::real_2d_array& u,
ap::real_2d_array& vt); ap::real_2d_array& vt);
 End of changes. 1 change blocks. 
4 lines changed or deleted 0 lines changed or added


 tdbisinv.h   tdbisinv.h 
skipping to change at line 157 skipping to change at line 157
Copyright 25.12.2005 by Bochkanov Sergey Copyright 25.12.2005 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
bool smatrixtdevdi(ap::real_1d_array& d, bool smatrixtdevdi(ap::real_1d_array& d,
const ap::real_1d_array& e, const ap::real_1d_array& e,
int n, int n,
int zneeded, int zneeded,
int i1, int i1,
int i2, int i2,
ap::real_2d_array& z); ap::real_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool tridiagonaleigenvaluesandvectorsininterval(ap::real_1d_array& d, bool tridiagonaleigenvaluesandvectorsininterval(ap::real_1d_array& d,
const ap::real_1d_array& e, const ap::real_1d_array& e,
int n, int n,
int zneeded, int zneeded,
double a, double a,
double b, double b,
int& m, int& m,
ap::real_2d_array& z); ap::real_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
bool tridiagonaleigenvaluesandvectorsbyindexes(ap::real_1d_array& d, bool tridiagonaleigenvaluesandvectorsbyindexes(ap::real_1d_array& d,
const ap::real_1d_array& e, const ap::real_1d_array& e,
int n, int n,
int zneeded, int zneeded,
int i1, int i1,
int i2, int i2,
ap::real_2d_array& z); ap::real_2d_array& z);
bool internalbisectioneigenvalues(ap::real_1d_array d, bool internalbisectioneigenvalues(ap::real_1d_array d,
ap::real_1d_array e, ap::real_1d_array e,
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 tdevd.h   tdevd.h 
skipping to change at line 91 skipping to change at line 91
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
September 30, 1994 September 30, 1994
*************************************************************************/ *************************************************************************/
bool smatrixtdevd(ap::real_1d_array& d, bool smatrixtdevd(ap::real_1d_array& d,
ap::real_1d_array e, ap::real_1d_array e,
int n, int n,
int zneeded, int zneeded,
ap::real_2d_array& z); ap::real_2d_array& z);
/*************************************************************************
Obsolete 1-based subroutine.
*************************************************************************/
bool tridiagonalevd(ap::real_1d_array& d, bool tridiagonalevd(ap::real_1d_array& d,
ap::real_1d_array e, ap::real_1d_array e,
int n, int n,
int zneeded, int zneeded,
ap::real_2d_array& z); ap::real_2d_array& z);
#endif #endif
 End of changes. 1 change blocks. 
3 lines changed or deleted 0 lines changed or added


 tridiagonal.h   tridiagonal.h 
skipping to change at line 134 skipping to change at line 134
-- ALGLIB -- -- ALGLIB --
Copyright 2005-2008 by Bochkanov Sergey Copyright 2005-2008 by Bochkanov Sergey
*************************************************************************/ *************************************************************************/
void smatrixtdunpackq(const ap::real_2d_array& a, void smatrixtdunpackq(const ap::real_2d_array& a,
const int& n, const int& n,
const bool& isupper, const bool& isupper,
const ap::real_1d_array& tau, const ap::real_1d_array& tau,
ap::real_2d_array& q); ap::real_2d_array& q);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
void totridiagonal(ap::real_2d_array& a, void totridiagonal(ap::real_2d_array& a,
int n, int n,
bool isupper, bool isupper,
ap::real_1d_array& tau, ap::real_1d_array& tau,
ap::real_1d_array& d, ap::real_1d_array& d,
ap::real_1d_array& e); ap::real_1d_array& e);
/*************************************************************************
Obsolete 1-based subroutine
*************************************************************************/
void unpackqfromtridiagonal(const ap::real_2d_array& a, void unpackqfromtridiagonal(const ap::real_2d_array& a,
const int& n, const int& n,
const bool& isupper, const bool& isupper,
const ap::real_1d_array& tau, const ap::real_1d_array& tau,
ap::real_2d_array& q); ap::real_2d_array& q);
#endif #endif
 End of changes. 2 change blocks. 
6 lines changed or deleted 0 lines changed or added


 trinverse.h   trinverse.h 
skipping to change at line 75 skipping to change at line 75
-- LAPACK routine (version 3.0) -- -- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University Courant Institute, Argonne National Lab, and Rice University
February 29, 1992 February 29, 1992
*************************************************************************/ *************************************************************************/
bool rmatrixtrinverse(ap::real_2d_array& a, bool rmatrixtrinverse(ap::real_2d_array& a,
int n, int n,
bool isupper, bool isupper,
bool isunittriangular); bool isunittriangular);
/*************************************************************************
Obsolete 1-based subroutine.
See RMatrixTRInverse for 0-based replacement.
*************************************************************************/
bool invtriangular(ap::real_2d_array& a, bool invtriangular(ap::real_2d_array& a,
int n, int n,
bool isupper, bool isupper,
bool isunittriangular); bool isunittriangular);
#endif #endif
 End of changes. 1 change blocks. 
4 lines changed or deleted 0 lines changed or added


 variancetests.h   variancetests.h 
skipping to change at line 27 skipping to change at line 27
>>> END OF LICENSE >>> >>> END OF LICENSE >>>
*************************************************************************/ *************************************************************************/
#ifndef _variancetests_h #ifndef _variancetests_h
#define _variancetests_h #define _variancetests_h
#include "ap.h" #include "ap.h"
#include "ialglib.h" #include "ialglib.h"
#include "gammaf.h" #include "gammafunc.h"
#include "normaldistr.h" #include "normaldistr.h"
#include "ibetaf.h" #include "ibetaf.h"
#include "fdistr.h" #include "fdistr.h"
#include "igammaf.h" #include "igammaf.h"
#include "chisquaredistr.h" #include "chisquaredistr.h"
/************************************************************************* /*************************************************************************
Two-sample F-test Two-sample F-test
This test checks three hypotheses about dispersions of the given samples. This test checks three hypotheses about dispersions of the given samples.
 End of changes. 1 change blocks. 
1 lines changed or deleted 1 lines changed or added

This html diff was produced by rfcdiff 1.41. The latest version is available from http://tools.ietf.org/tools/rfcdiff/