#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
#include "numerical_recipes.h"

Include dependency graph for numerical_recipes.cpp:

Go to the source code of this file.

Classes
struct	cfsqpcomplex

struct	doublecomplex

struct	cilist

struct	icilist

struct	olist

struct	cllist

struct	alist

struct	inlist

union	Multitype

struct	Vardesc

struct	Namelist

struct	Tcmache

struct	_objective

struct	_constraint

struct	_parameter

struct	_violation

struct	Tglob_info

struct	Tglob_prnt

struct	Tglob_grd

struct	Tglob_log

Macros
#define	NRSIGN(a, b) ((b) >= 0.0 ? fabs(a) : -fabs(a))

#define	M1 259200

#define	IA1 7141

#define	IC1 54773

#define	RM1 (1.0/M1)

#define	M2 134456

#define	IA2 8121

#define	IC2 28411

#define	RM2 (1.0/M2)

#define	M3 243000

#define	IA3 4561

#define	IC3 51349

#define	NUSE1 5

#define	NUSE2 5

#define	EPS 1.0e-16

#define	FPMIN 1.0e-30

#define	MAXIT 10000

#define	XMIN 2.0

#define	ITMAX 100

#define	EPS 3.0e-7

#define	GOLD 1.618034

#define	GLIMIT 100.0

#define	TINY 1.0e-20

#define	MAX(a, b) ((a) > (b) ? (a) : (b))

#define	SIGN(a, b) ((b) > 0.0 ? fabs(a) : -fabs(a))

#define	SHFT(a, b, c, d) (a)=(b);(b)=(c);(c)=(d);

#define	F1DIM(x, f)

#define	ITMAX 100

#define	CGOLD 0.3819660

#define	ZEPS 1.0e-10

#define	TOL 2.0e-4

#define	ITMAX 200

#define	SQR(a) ((a)*(a))

#define	SVDMAXITER 1000

#define	TRUE 1

#define	FALSE 0

#define	F2C_INCLUDE

#define	TRUE_ (1)

#define	FALSE_ (0)

#define	Extern extern

#define	VOID void

#define	abs(x) ((x) >= 0 ? (x) : -(x))

#define	dabs(x) (doublereal)abs(x)

#define	min(a, b) ((a) <= (b) ? (a) : (b))

#define	max(a, b) ((a) >= (b) ? (a) : (b))

#define	dmin(a, b) (doublereal)min(a,b)

#define	dmax(a, b) (doublereal)max(a,b)

#define	F2C_proc_par_types 1

#define	Skip_f2c_Undefs

#define	cmache_1 cmache_

#define	DMAX1(a, b) ((a) > (b) ? (a) : (b))

#define	DMIN1(a, b) ((a) < (b) ? (a) : (b))

#define	NONE 0

#define	OBJECT 1

#define	CONSTR 2

#define	ITMAX 100

#define	EPS 3.0e-7

#define	ITMAX 100

#define	EPS 3.0e-7

#define	FPMIN 1.0e-30

Typedefs
typedef int	integer

typedef char *	address

typedef short int	shortint

typedef float	cfsqpreal

typedef double	doublereal

typedef long int	logical

typedef short int	shortlogical

typedef long	flag

typedef long	ftnlen

typedef long	ftnint

typedef union Multitype	Multitype

typedef long	Long

typedef struct Vardesc	Vardesc

typedef struct Namelist	Namelist

typedef int(*	U_fp) ()

typedef shortint(*	J_fp) ()

typedef integer(*	I_fp) ()

typedef cfsqpreal(*	R_fp) ()

typedef doublereal(*	D_fp) ()

typedef doublereal()(	E_fp) ()

typedef VOID(*	C_fp) ()

typedef VOID(*	Z_fp) ()

typedef logical(*	L_fp) ()

typedef shortlogical(*	K_fp) ()

typedef VOID(*	H_fp) ()

typedef int(*	S_fp) ()

typedef VOID	C_f

typedef VOID	H_f

typedef VOID	Z_f

typedef doublereal	E_f

Functions
void	nrerror (const char error_text[])

double	ran1 (int *idum)

double	gasdev (int *idum)

double	tdev (double nu, int *idum)

void	ksone (double data[], int n, double(func)(double), double d, double *prob)

double	probks (double alam)

void	indexx (int n, double arrin[], int indx[])

double	bessj0 (double x)

double	bessi0 (double x)

double	bessi1 (double x)

double	chebev (double a, double b, double c[], int m, double x)

void	beschb (double x, double gam1, double gam2, double gampl, double gammi)

void	bessjy (double x, double xnu, double rj, double ry, double rjp, double ryp)

double	bessi0_5 (double x)

double	bessi1_5 (double x)

double	bessi2 (double x)

double	bessi2_5 (double x)

double	bessi3 (double x)

double	bessi3_5 (double x)

double	bessi4 (double x)

double	bessj1_5 (double x)

double	bessj3_5 (double x)

double	gammln (double xx)

double	betai (double a, double b, double x)

double	betacf (double a, double b, double x)

void	mnbrak (double ax, double bx, double cx, double fa, double fb, double fc, double(func)(double , void ), void prm, int ncom, double pcom, double xicom)

double	brent (double ax, double bx, double cx, double(func)(double , void ), void prm, double tol, double xmin, int ncom, double pcom, double *xicom)

void	linmin (double p, double xi, int n, double &fret, double(func)(double , void ), void prm)

void	powell (double p, double xi, int n, double ftol, int &iter, double &fret, double(func)(double , void ), void prm, bool show)

void	_nnls_g1 (double a, double b, double cterm, double sterm, double *sig)

int	_nnls_h12 (int mode, int lpivot, int l1, int m, double u, int u_dim1, double up, double *cm, int ice, int icv, int ncv)

int	nnls (double a, int m, int n, double b, double x, double rnorm, double wp, double zzp, int *indexp)

int	nnlsWght (int N, int M, double A, double b, double *weight)

double	Pythag (double a, double b)

void	svdcmp (double U, int Lines, int Columns, double W, double *V)

void	svbksb (double u, double w, double v, int m, int n, double b, double *x)

int	ql0002_ ()

int	ql0001_ (m, me, mmax, n, nmax, mnn, c, d, a, b, xl, xu, x, u, iout, ifail, iprint, war, lwar, iwar, liwar, eps1) integer *m

	if (fabs(c[nmax+ nmax *c_dim1])==0.e0)

	if (iwar[1]==1)

	for (j=1;j<=i__1;++j)

	if (inw2+lw > *lwar)

	ql0002_ (n, m, me, mmax, &mn, mnn, nmax, &lql, &a[a_offset], &war[inw1], &d[1], &c[c_offset], &xl[1], &xu[1], &x[1], &nact, &iwar[1], &maxit, &qpeps, &info, &diag, &war[inw2], &lw)

	if (info==1)

	if (info< 0)

	if (nact==0)

	for (i=1;i<=i__1;++i) = nfsr + mesh_pts[i]

int	ql0002_ (n, m, meq, mmax, mn, mnn, nmax, lql, a, b, grad, g, xl, xu, x, nact, iact, maxit, vsmall, info, diag, w, lw) integer *n

	for (k=1;k<=i__1;++k)

	if (!(*lql))

	if (k >=2)

	if (w[kdrop] >=zero)

	if (iact[kdrop]<= *meq)

	if (cvmax<= *vsmall)

	if (jfinc==0)

	if (jfinc !=ifinc)

	if (sum<=fdiffa)

	if (temp<=sum)

	if (iterc<= *maxit)

	if (knext > *m)

	if (k1 > *n)

	if (tempa<=temp)

	if (sumb > *vsmall)

	if (knext<= *m)

	if (kdrop==0)

	if (itref<=0)

	if (itref==1)

	if (i > 1)

	if (lflag==3)

	if (iact[kdrop] > *mn)

	switch ((int) mflag)

	if (nu== *nact)

	if (w[is]==zero)

int	ql0001_ ()

void	grobfd ()

void	grcnfd ()

void	cfsqp (nparam, nf, nfsr, nineqn, nineq, neqn, neq, ncsrl, ncsrn, mesh_pts, mode, iprint, miter, inform, bigbnd, eps, epseqn, udelta, bl, bu, x, f, g, lambda, obj, constr, gradob, gradcn, cd) int nparam

	if (ncsipn1) for(i

	if (glob_prnt.iprint > 0)

	check (nparam, nf, nfsr, &Linfty, nineq, nineqn, neq, neqn, ncsrl, ncsrn, mode, &modem, eps, bgbnd, param)

	if (glob_prnt.info==7)

	if (nclin !=0)

	if (!feasbl) = FALSE

	if (feasb)

	cfsqp1 (miter, nparam, nob, nobL, nfsip1, nineqn, neq, neqn, ncsipl1, ncsipn1, mesh_pts1, ncnstr, nctotl, nrowa, feasb, epskt, epseqn, indxob, indxcn, param, cs, ob, signeq, obj, constr, gradob, gradcn)

	free_iv (iw)

	free_dv (w)

	if (glob_prnt.info !=0)

	if (nf==1) lambda[1+nparam+nineq+neq]

	free ((char *) ob)

	dealloc (nineq, neq, signeq, indxcn, indxob, cs, param)

	free_dv (param->x)

	free_dv (signeq)

	free_iv (indxob)

	free_iv (indxcn)

	if (glob_info.mode !=0) nfs

	nullvc (nparam, grdpsf)

	if (feasb &&neqn !=0) resign(nparam

	if (feasb &&nob==0) fmax=0.e0

	if (glob_prnt.iprint >=3 &&glob_log.first)

	for (;;)

	free_dm (hess, nparam)

	free_dm (hess1, nparam+1)

	free_dv (di)

	free_dv (d)

	free_dv (gm)

	free_dv (grdpsf)

	free_dv (penp)

	free_dv (bl)

	free_dv (bu)

	free_dv (clamda)

	free_dv (cvec)

	free_dv (psmu)

	free_dv (span)

	free_dv (backup)

	free_iv (iact)

	free_iv (iskip)

	free_iv (istore)

	if (nparam<=0) error("nparam should be positive! "

	if (nparam<=neq - neqn) error("Must have nparam > number of linear equalities"

	if (glob_prnt.iprint< 0\|\|glob_prnt.iprint > 3) error("iprint mod 10 should be 0

	if (eps<=glob_grd.epsmac)

	if (!(mode==100\|\|mode==101\|\|mode==110\|\|mode==111\|\|mode==200\|\|mode==201\|\|mode==210\|\|mode==211)) error("mode is not properly specified! "

	if (mode >=200)

	free_dm (a, nrowa)

	free_dv (x)

	free_dv (bj)

	if (glob_prnt.iter % glob_prnt.iter_mod) display = FALSE

	if (ncsipn !=0)

	if (ncsipl !=0)

	if (glob_log.first) = FALSE

	if (steps< 1.e0 &&viol->type==CONSTR)

	if (glob_prnt.iprint >=2 &&display) fprintf(glob_prnt.io

	if (nfsip)

	if (nobL<=1)

	nullvc (nparam, cvec)

	dqp (nparam, nqprm0, nob, nobL, nfsip, nineqn, neq, neqn, nn, ncsipl, ncsipn, ncnstr, nctot0, nrowa0, nineqn, &infoqp, param, di, feasb, ob, *fmax, grdpsf, cs, a, cvec, bl, bu, clamda, hess, hess1, di, vv, 0)

	if (infoqp !=0)

	if (nn > 1)

	if (nobL > 1)

	if (nob > 0) vv

	if (glob_log.first &&nclin0==0)

	matrvc (nparam, nparam, hess, di, w)

	if (nn==0) *grdftd

	if (((d0nm<=epskt)\|\|((gLgeps > 0.e0) &&(sktnom<=gLgeps))) &&(neqn==0\|\| *scvneq<=epseqn))

	if (glob_prnt.iprint >=3 &&display)

	if (neqn !=0 &&d0nm<=DMIN1(0.5e0 epskt,(0.1e-1) glob_grd.rteps) &&scvneq > epseqn)

	if (nn !=0) *grdftd

	if (glob_info.mode==1)

	if (need_d1)

	if (rhol==0.e0)

	if (nob==1) grdfd1

	if (temp1<=0.e0) rhog

	if (!(glob_prnt.iprint< 3\|\|glob_info.mode==1\|\|nn==0) &&display)

	if (rho !=rhog) ncg=0

	if ((neqn !=0) &&(feasb)) resign(nparam

	if (ncg !=0) for(i

	if (job==1) xdi

	if (nobL==1)

	matrcp (nparam, hess, nparam+1, hess1)

	nullvc (nqpram, x)

ql0001_ &	k (htemp+1),(cvec+1),(atemp+1),(bj+1),(bl+1),(bu+1),(x+1),(clamda+1), &iout, infoqp, &zero,(w+1), &lenw,(iw+1), &leniw, &glob_grd.epsmac

	free_dv (htemp)

	free_dv (atemp)

	nullvc (nqpram, param->mult)

	if (ncsipl+ncsipn) for(i

	if (nctotl > nqnp)

	free_iv (iw_hold)

	if ((ncsipl+ncsipn) !=0) nrowa

	if (mode==0) eta=0.1e0 = 3.e0

	if (mode !=1)

	diagnl (nqpram, eta, hess1)

	if (nobL > nob) temp3

ql0001_ &	temp3 (htemp+1),(cvec+1),(atemp+1),(bj+1),(bl+1),(bu+1),(x+1),(clamda+1), &iout, infoqp, &zero,(w+1), &lenw,(iw+1), &leniw, &glob_grd.epsmac

	if (!glob_log.get_ne_mult)

	nullvc (nparam, delta)

	nullvc (nparam, eta)

	if (neqn !=0 &&(feasb))

	if (nfs !=0)

	if (ncnstr !=0)

	sbout1 (glob_prnt.io, nparam, "multipliers for x ", dummy, param->mult, 2, 2)

	if (glob_prnt.iter >=miter &&nstop !=0)

	if ((glob_prnt.info > 0 &&glob_prnt.info< 3)\|\|glob_prnt.info==7) goto L120

	if (glob_prnt.iprint<=2 &&nstop==0) fprintf(glob_prnt.io

	if (!((glob_prnt.iter) % glob_prnt.iter_mod)) display

	if (glob_prnt.iter_mod !=1 &&display) fprintf(glob_prnt.io

	if (display)

	if (glob_info.mode==1 &&glob_prnt.iter > 1 &&display) sbout1(glob_prnt.io

objective	if (nob > 1 &&display) sbout1(glob_prnt.io

	if (glob_prnt.iter<=1 &&display)

	if (glob_prnt.iprint >=2 &&glob_prnt.initvl==0 &&display) sbout1(glob_prnt.io

	if (glob_prnt.iprint >=3 &&glob_prnt.iter_mod !=1 &&nstop !=0 &&!(glob_prnt.iter % glob_prnt.iter_mod)) fprintf(glob_prnt.io

	if (nstop !=0 &&(glob_prnt.iter_mod==1)) fprintf(glob_prnt.io

	fprintf (glob_prnt.io, "\)

	if (glob_prnt.iprint >=3) fprintf(glob_prnt.io

	if (glob_prnt.info==0 &&sktnom > 0.1e0) fprintf(glob_prnt.io

void	grobfd (nparam, j, x, gradf, obj, cd) int nparam

void	grcnfd (nparam, j, x, gradg, constr, cd) int nparam

ql0001_ &	zero (ctemp+1),(cvec+1),(a+1),(b+1),(bl+1),(bu+1),(x+1),(w+1), &iout, ifail, &zero,(w+3), &lwar2,(iw+1), &leniw, &glob_grd.epsmac

	free_dv (ctemp)

	if (fabs(val)<=thrshd) temp

	while (mm > nfs) mm -

	if (isign >=0)

void	gser (double gamser, double a, double x, double gln)

void	gcf (double gammcf, double a, double x, double gln)

double	gammp (double a, double x)

void	choldc (double a, int n, double p)

void	cholsl (double a, int n, double p, double b, double x)

void	polint (double xa, double ya, int n, double x, double &y, double &dy)

Variables
int	x_is_new = TRUE

double	objeps = -1.e0

double	objrep = -1.e0

double	gLgeps = -1.e0

int	nstop = 1

struct Tcmache	cmache_

int *	me

int *	mmax

int *	n

int *	nmax

int *	mnn

doublereal *	c = c_offset

doublereal *	d = make_dv(nparam + 1)

doublereal *	a = a_offset

doublereal *	b

doublereal *	xl

doublereal *	xu

doublereal *	x = x[i]

doublereal *	u

integer *	iout = 6

integer *	ifail = 0

integer *	iprint = iprint % 10

doublereal *	war

integer *	lwar

integer *	iwar

integer *	liwar

doublereal *	eps1

	a_dim1 = *mmax

	a_offset = a_dim1 + 1

	c_dim1 = *nmax

	c_offset = c_dim1 + 1

cmache_1	eps = *eps1

if	m

	i__1 = *m

L20	__pad0__

L30	__pad1__

L70	__pad2__

	return

L80	__pad3__

L81	__pad4__

L82	__pad5__

L40	__pad6__

L90	__pad7__

int *	meq

doublereal *	grad

doublereal *	g = g_offset

integer *	iact = knext

doublereal *	vsmall

doublereal *	w = sum / w[ir]

doublereal	d__1

doublereal	d__2 = w[ir] / temp

doublereal	d__3 = (d__1 = w[ir - 1], abs(d__1))

doublereal	d__4 = (d__2 = w[ir], abs(d__2))

	g_dim1 = *nmax

	g_offset = g_dim1 + 1

L45	__pad8__

L70	__pad9__

L90	__pad10__

goto	L170

L140	__pad11__

L150	__pad12__

goto	L70

L165	__pad13__

L170	__pad14__

	i__2 = *n

L230	__pad15__

	else

L250	__pad16__

L280	__pad17__

L340	__pad18__

goto	L930

L350	__pad19__

L380	__pad20__

goto	L740

L390	__pad21__

L410	__pad22__

goto	L910

L420	__pad23__

goto	L440

L430	__pad24__

goto	L800

L440	__pad25__

L450	__pad26__

L481	__pad27__

L510	__pad28__

L530	__pad29__

goto	L710

L531	__pad30__

goto	L549

L541	__pad31__

goto	L550

L545	__pad32__

L549	__pad33__

L550	__pad34__

goto	L860

L560	__pad35__

goto	L570

L5	__pad36__

goto	L640

L567	__pad37__

L570	__pad38__

L571	__pad39__

goto	L775

L574	__pad40__

L580	__pad41__

L590	__pad42__

L601	__pad43__

L610	__pad44__

L630	__pad45__

L640	__pad46__

L650	__pad47__

L660	__pad48__

L680	__pad49__

L690	__pad50__

L700	__pad51__

L710	__pad52__

L730	__pad53__

L740	__pad54__

goto	L770

L750	__pad55__

L761	__pad56__

L770	__pad57__

L775	__pad58__

L791	__pad59__

case	__pad60__

L800	__pad61__

L810	__pad62__

L850	__pad63__

L860	__pad64__

L870	__pad65__

L880	__pad66__

goto	L880

L900	__pad67__

case	__pad68__

L910	__pad69__

L930	__pad70__

double	bgbnd = bigbnd

double	tolfea = glob_grd.epsmac * 1.e2

struct Tglob_info	glob_info

struct Tglob_prnt	glob_prnt

struct Tglob_grd	glob_grd

struct Tglob_log	glob_log

int	lenw

int	leniw

void	nf = nf - nfsr

void	nfsr = 0

void	neqn

void	nineqn = nineqn - ncsrn

void	nineq = nineq - ncsrl - ncsrn

void	neq

void	ncsrl = 0

void	ncsrn = 0

void	mode

void	miter

void *	mesh_pts = mesh_pts - 1

void *	inform = glob_prnt.info

double	bigbnd

double	epseqn

double	udelta = udelta

double *	bl = bl[i]

double *	bu = bu[i]

double *	f = f - 1

double *	lambda = lambda - 1

void(*	obj )()

void()()	constr ()

void()()(*)	gradob ()

void()()()()	gradcn ()

void *	cd = cd

int	feasbl

int	feasb = TRUE

int	prnt = FALSE

int	Linfty =0

int *	indxob = make_iv(DMAX1(nineq + neq, nf))

int *	indxcn = make_iv(nineq + neq)

int *	mesh_pts1 = mesh_pts

double *	signeq = make_dv(neqn)

double	xi

double	gi

double	gmax = -bgbnd

double	dummy = 0.e0

double	epskt

struct _constraint *	cs

struct _objective *	ob

struct _parameter *	param

struct _parameter	_param

glob_info	tot_actf_sip = glob_info.tot_actg_sip = 0

glob_info	nfsip = nfsr

glob_info	ncsipl = ncsrl

glob_info	ncsipn = ncsrn

	nfsip1 = nfsr

	ncsipl1 = ncsrl

	ncsipn1 = ncsrn

glob_prnt	iter = 0

	nn = nineqn + neqn

glob_grd	epsmac = smallNumber()

glob_grd	rteps = sqrt(glob_grd.epsmac)

glob_log	rhol_is1 = FALSE

glob_log	get_ne_mult = FALSE

	nob = 0

	ipp = iprint

glob_prnt	iter_mod = DMAX1(iprint - iprint % 10, 1)

glob_prnt	io = stdout

	ncnstr = nineq + neq

glob_info	nnineq = nineq

	nppram = nparam + 1

	nclin = ncnstr - nn

L510	__pad71__

	nrowa = DMAX1(ncnstr + DMAX1(nobL, 1), 1)

static void	nparam

static void	nobL

static void	nctotl

int *	iskip = make_iv(glob_info.nnineq + 1)

int *	istore = make_iv(nineqn + nob + neqn)

double	Cbar

double	Ck = Cbar = 1.e-2

double	dbar = 5.e0

double	fmax = -bgbnd

double	fM = fmax

double	fMp = fmax - psf

double	steps = 0.e0

double	d0nm = 0.e0

double	sktnom = 0.e0

double	scvneq = 0.e0

double	grdftd

double	psf = 0.e0

double *	di = make_dv(nparam + 1)

double *	gm = make_dv(4 * neqn)

double *	grdpsf = make_dv(nparam)

double *	penp = make_dv(neqn)

double *	clamda = make_dv(nctotl + nparam + 1)

double *	cvec = make_dv(nparam + 1)

double *	psmu = make_dv(neqn)

double *	span = make_dv(4)

double *	backup = make_dv(nob + ncnstr)

double **	hess = make_dm(nparam, nparam)

double **	hess1 = make_dm(nparam + 1, nparam + 1)

double *	tempv

struct _violation *	viol = &_viol

struct _violation	_viol

viol	index = 0

viol	type = NONE

glob_prnt	initvl = 1

glob_log	first = TRUE

	nrst = glob_prnt.ipd = 0

	e0

	nstart = 1

glob_info	ncallf = 0

	nfs = 0

	ncnst1 = ncnstr - nineqn - neqn

static void	nnl

static void *	modem

double	bli

double	bui

	or

glob_info	modec = 1

double	x0i

double *	atemp = convert(a, nrowa, nqpram)

double *	htemp = convert(hess1, nparam + 1, nparam + 1)

double *	bj = make_dv(nclin)

double	epsilon

double	g_max

double	fprev

double	fnow

double	fnext

double	fmult

else	display = TRUE

Xi_k for g glob_info	tot_actg_sip

static void *	iskp

double	fmxl

double	vv = 0.e0

double	dx

double	dmx

double	dnm1

double	dnm = sqrt(scaprd(nparam, di, di))

double	v0

double	v1

double	vk =0.

double	temp1 = temp2 = 0.e0

double	temp2 = (theta - 1.e0) * grdfd0 / temp1

double	theta = 0.2e0

double	rhol

double	rhog = DMIN1(rhol, temp2)

double	rho = rhog

double	grdfd0

double	grdfd1 = 0.e0

double	grdgd0

double	grdgd1

double	thrshd = tolfea

double	sign

double *	adummy = make_dv(1)

double	dnmtil

	ncg = ncf = *iskp = 0

	ncl = glob_info.nnineq - nineqn

glob_log	local = glob_log.update = FALSE

	need_d1 = TRUE

	nclin0 = ncnstr + nobL

	nctot0 = nqprm0 + nclin0

	nrowa0 = DMAX1(nclin0, 1)

glob_log	d0_is0 = FALSE

L310	__pad72__

	ncc = ncg + 1

	ninq = nncn = ncg

	ncnstr_used = k

if	infoqp

i<=ncnstr;i++) cs[i].mult=0.e0;if(nfsip) for(i=1;i<=nob;i++) { ob[i].mult=0.e0;ob[i].mult_L=0.e0;} for(i=1;i<=nqpram;i++) { ii=k+i;if(clamda[ii]==0.e0 &&clamda[ii+nqpram]==0.e0) continue;else if(clamda[ii] !=0.e0) clamda[ii]=-clamda[ii];else clamda[ii]=clamda[ii+nqpram];} nqnp=nqpram+ncnstr;for(i=1;i<=nqpram;i++) param->	mult [i] = clamda[k+i]

static void	nqpram

double *	d0

int *	iw_hold

double	eta

else	temp3 = k

static void *	ncf

double *	xnew

struct _violation *	sip_viol

double	prod1

double	prod

double	fmax1 =0.

double	tolfe = 0.e0

double	ostep = *steps = 1.e0

double	fii

	nlin = glob_info.nnineq - nineqn

	itry = ii = jj = 1

	fbind = cdone = fdone = eqdone = FALSE

	sipldone = (ncsipl == 0)

	ikeep = nlin - *iskp

directional	deriv

L1500	__pad73__

double *	delta

double *	gamma

double *	hd

double **	phess

double *	psb

double	dhd

double	gammd

double	etad

double	signgj =1.

double	psfnew = 0.e0

double	delta_s = glob_grd.rteps

glob_prnt	ipd = 0

	done = FALSE

static void	ncn

double	d0norm

double	SNECV

objective	max4

objective	objmax

ncallg glob_info	ncallg

n The following was calculated during	iteration

L120	__pad74__

nNormal	termination

Warning	__pad75__

nError	__pad76__

nError	__pad77__

L9000	__pad78__

double *	gradf

double *	gradg

double *	ctemp

	lwar2 = lenw - 1

int	col

int	nrows

static double *	y

double	z

return	mm

int	ndima

int	ndimb

Macro Definition Documentation

◆ abs

#define abs ( x ) ((x) >= 0 ? (x) : -(x))

Definition at line 2108 of file numerical_recipes.cpp.

◆ CGOLD

#define CGOLD 0.3819660

Definition at line 755 of file numerical_recipes.cpp.

◆ cmache_1

#define cmache_1 cmache_

Definition at line 2186 of file numerical_recipes.cpp.

◆ CONSTR

#define CONSTR 2

Definition at line 4138 of file numerical_recipes.cpp.

◆ dabs

#define dabs ( x ) (doublereal)abs(x)

Definition at line 2109 of file numerical_recipes.cpp.

◆ dmax

#define dmax	(	a,
		b
	)	(doublereal)max(a,b)

Definition at line 2113 of file numerical_recipes.cpp.

◆ DMAX1

#define DMAX1	(	a,
		b
	)	((a) > (b) ? (a) : (b))

Definition at line 4128 of file numerical_recipes.cpp.

◆ dmin

#define dmin	(	a,
		b
	)	(doublereal)min(a,b)

Definition at line 2112 of file numerical_recipes.cpp.

◆ DMIN1

#define DMIN1	(	a,
		b
	)	((a) < (b) ? (a) : (b))

Definition at line 4129 of file numerical_recipes.cpp.

◆ EPS [1/4]

#define EPS 1.0e-16

Definition at line 9291 of file numerical_recipes.cpp.

◆ EPS [2/4]

#define EPS 3.0e-7

Definition at line 9291 of file numerical_recipes.cpp.

◆ EPS [3/4]

#define EPS 3.0e-7

Definition at line 9291 of file numerical_recipes.cpp.

◆ EPS [4/4]

#define EPS 3.0e-7

Definition at line 9291 of file numerical_recipes.cpp.

◆ Extern

#define Extern extern

Definition at line 1973 of file numerical_recipes.cpp.

◆ F1DIM

#define F1DIM	(	x,
		f
	)

Value:

{\
    for (int j = 1; j<=ncom; j++) \
        xt[j] = pcom[j] + x * xicom[j]; \
    f = (*func)(xt,prm);}

Definition at line 674 of file numerical_recipes.cpp.

◆ F2C_INCLUDE

#define F2C_INCLUDE

barf [ba:rf] 2. "He suggested using FORTRAN, and everybody barfed."

From The Shogakukan DICTIONARY OF NEW ENGLISH (Second edition)

Definition at line 1948 of file numerical_recipes.cpp.

◆ F2C_proc_par_types

#define F2C_proc_par_types 1

Definition at line 2117 of file numerical_recipes.cpp.

◆ FALSE

#define FALSE 0

Definition at line 1824 of file numerical_recipes.cpp.

◆ FALSE_

#define FALSE_ (0)

Definition at line 1969 of file numerical_recipes.cpp.

◆ FPMIN [1/2]

#define FPMIN 1.0e-30

Definition at line 9292 of file numerical_recipes.cpp.

◆ FPMIN [2/2]

#define FPMIN 1.0e-30

Definition at line 9292 of file numerical_recipes.cpp.

◆ GLIMIT

#define GLIMIT 100.0

Definition at line 669 of file numerical_recipes.cpp.

◆ GOLD

#define GOLD 1.618034

Definition at line 668 of file numerical_recipes.cpp.

◆ IA1

#define IA1 7141

Definition at line 46 of file numerical_recipes.cpp.

◆ IA2

#define IA2 8121

Definition at line 50 of file numerical_recipes.cpp.

◆ IA3

#define IA3 4561

Definition at line 54 of file numerical_recipes.cpp.

◆ IC1

#define IC1 54773

Definition at line 47 of file numerical_recipes.cpp.

◆ IC2

#define IC2 28411

Definition at line 51 of file numerical_recipes.cpp.

◆ IC3

#define IC3 51349

Definition at line 55 of file numerical_recipes.cpp.

◆ ITMAX [1/5]

#define ITMAX 100

Definition at line 9290 of file numerical_recipes.cpp.

◆ ITMAX [2/5]

#define ITMAX 100

Definition at line 9290 of file numerical_recipes.cpp.

◆ ITMAX [3/5]

#define ITMAX 200

Definition at line 9290 of file numerical_recipes.cpp.

◆ ITMAX [4/5]

#define ITMAX 100

Definition at line 9290 of file numerical_recipes.cpp.

◆ ITMAX [5/5]

#define ITMAX 100

Definition at line 9290 of file numerical_recipes.cpp.

◆ M1

#define M1 259200

Definition at line 45 of file numerical_recipes.cpp.

◆ M2

#define M2 134456

Definition at line 49 of file numerical_recipes.cpp.

◆ M3

#define M3 243000

Definition at line 53 of file numerical_recipes.cpp.

◆ MAX

#define MAX	(	a,
		b
	)	((a) > (b) ? (a) : (b))

Definition at line 671 of file numerical_recipes.cpp.

◆ max

#define max	(	a,
		b
	)	((a) >= (b) ? (a) : (b))

Definition at line 2111 of file numerical_recipes.cpp.

◆ MAXIT

#define MAXIT 10000

Definition at line 379 of file numerical_recipes.cpp.

◆ min

#define min	(	a,
		b
	)	((a) <= (b) ? (a) : (b))

Definition at line 2110 of file numerical_recipes.cpp.

◆ NONE

#define NONE 0

Definition at line 4136 of file numerical_recipes.cpp.

◆ NRSIGN

#define NRSIGN	(	a,
		b
	)	((b) >= 0.0 ? fabs(a) : -fabs(a))

Definition at line 42 of file numerical_recipes.cpp.

◆ NUSE1

#define NUSE1 5

Definition at line 348 of file numerical_recipes.cpp.

◆ NUSE2

#define NUSE2 5

Definition at line 349 of file numerical_recipes.cpp.

◆ OBJECT

#define OBJECT 1

Definition at line 4137 of file numerical_recipes.cpp.

◆ RM1

#define RM1 (1.0/M1)

Definition at line 48 of file numerical_recipes.cpp.

◆ RM2

#define RM2 (1.0/M2)

Definition at line 52 of file numerical_recipes.cpp.

◆ SHFT

#define SHFT	(	a,
		b,
		c,
		d
	)	(a)=(b);(b)=(c);(c)=(d);

Definition at line 673 of file numerical_recipes.cpp.

◆ SIGN

#define SIGN	(	a,
		b
	)	((b) > 0.0 ? fabs(a) : -fabs(a))

Definition at line 672 of file numerical_recipes.cpp.

◆ Skip_f2c_Undefs

#define Skip_f2c_Undefs

Definition at line 2152 of file numerical_recipes.cpp.

◆ SQR

#define SQR ( a ) ((a)*(a))

◆ SVDMAXITER

#define SVDMAXITER 1000

Definition at line 1506 of file numerical_recipes.cpp.

◆ TINY

#define TINY 1.0e-20

Definition at line 670 of file numerical_recipes.cpp.

◆ TOL

#define TOL 2.0e-4

Definition at line 847 of file numerical_recipes.cpp.

◆ TRUE

#define TRUE 1

Definition at line 1821 of file numerical_recipes.cpp.

◆ TRUE_

#define TRUE_ (1)

Definition at line 1968 of file numerical_recipes.cpp.

◆ VOID

#define VOID void

Definition at line 2076 of file numerical_recipes.cpp.

◆ XMIN

#define XMIN 2.0

Definition at line 380 of file numerical_recipes.cpp.

◆ ZEPS

#define ZEPS 1.0e-10

Definition at line 756 of file numerical_recipes.cpp.

Typedef Documentation

◆ address

typedef char* address

Definition at line 1951 of file numerical_recipes.cpp.

◆ C_f

typedef VOID C_f

Definition at line 2144 of file numerical_recipes.cpp.

◆ C_fp

typedef VOID(* C_fp) ()

Definition at line 2136 of file numerical_recipes.cpp.

◆ cfsqpreal

typedef float cfsqpreal

Definition at line 1953 of file numerical_recipes.cpp.

◆ D_fp

typedef doublereal(* D_fp) ()

Definition at line 2135 of file numerical_recipes.cpp.

◆ doublereal

typedef double doublereal

Definition at line 1954 of file numerical_recipes.cpp.

◆ E_f

typedef doublereal E_f

Definition at line 2147 of file numerical_recipes.cpp.

◆ E_fp

typedef doublereal(*)(* E_fp) ()

Definition at line 2135 of file numerical_recipes.cpp.

◆ flag

typedef long flag

Definition at line 1984 of file numerical_recipes.cpp.

◆ ftnint

typedef long ftnint

Definition at line 1986 of file numerical_recipes.cpp.

◆ ftnlen

typedef long ftnlen

Definition at line 1985 of file numerical_recipes.cpp.

◆ H_f

typedef VOID H_f

Definition at line 2145 of file numerical_recipes.cpp.

◆ H_fp

typedef VOID(* H_fp) ()

Definition at line 2140 of file numerical_recipes.cpp.

◆ I_fp

typedef integer(* I_fp) ()

Definition at line 2133 of file numerical_recipes.cpp.

◆ integer

typedef int integer

Definition at line 1950 of file numerical_recipes.cpp.

◆ J_fp

typedef shortint(* J_fp) ()

Definition at line 2132 of file numerical_recipes.cpp.

◆ K_fp

typedef shortlogical(* K_fp) ()

Definition at line 2139 of file numerical_recipes.cpp.

◆ L_fp

typedef logical(* L_fp) ()

Definition at line 2138 of file numerical_recipes.cpp.

◆ logical

typedef long int logical

Definition at line 1965 of file numerical_recipes.cpp.

◆ Long

typedef long Long

Definition at line 2089 of file numerical_recipes.cpp.

◆ Multitype

typedef union Multitype Multitype

Definition at line 2087 of file numerical_recipes.cpp.

◆ Namelist

typedef struct Namelist Namelist

Definition at line 2106 of file numerical_recipes.cpp.

◆ R_fp

typedef cfsqpreal(* R_fp) ()

Definition at line 2134 of file numerical_recipes.cpp.

◆ S_fp

typedef int(* S_fp) ()

Definition at line 2141 of file numerical_recipes.cpp.

◆ shortint

typedef short int shortint

Definition at line 1952 of file numerical_recipes.cpp.

◆ shortlogical

typedef short int shortlogical

Definition at line 1966 of file numerical_recipes.cpp.

◆ U_fp

typedef int(* U_fp) ()

Definition at line 2131 of file numerical_recipes.cpp.

◆ Vardesc

typedef struct Vardesc Vardesc

Definition at line 2098 of file numerical_recipes.cpp.

◆ Z_f

typedef VOID Z_f

Definition at line 2146 of file numerical_recipes.cpp.

◆ Z_fp

typedef VOID(* Z_fp) ()

Definition at line 2137 of file numerical_recipes.cpp.

Function Documentation

◆ _nnls_g1()

void _nnls_g1	(	double	a,
		double	b,
		double *	cterm,
		double *	sterm,
		double *	sig
	)

Definition at line 1011 of file numerical_recipes.cpp.

 {
     double d1, xr, yr;
 
     if (fabs(a) > fabs(b))
     {
         xr = b / a;
         d1 = xr;
         yr = sqrt(d1 * d1 + 1.);
         d1 = 1. / yr;
         *cterm = (a >= 0.0 ? fabs(d1) : -fabs(d1));
         *sterm = (*cterm) * xr;
         *sig = fabs(a) * yr;
     }
     else if (b != 0.)
     {
         xr = a / b;
         d1 = xr;
         yr = sqrt(d1 * d1 + 1.);
         d1 = 1. / yr;
         *sterm = (b >= 0.0 ? fabs(d1) : -fabs(d1));
         *cterm = (*sterm) * xr;
         *sig = fabs(b) * yr;
     }
     else
     {
         *sig = 0.;
         *cterm = 0.;
         *sterm = 1.;
     }
 } /* _nnls_g1 */

◆ _nnls_h12()

int _nnls_h12	(	int	mode,
		int	lpivot,
		int	l1,
		int	m,
		double *	u,
		int	u_dim1,
		double *	up,
		double *	cm,
		int	ice,
		int	icv,
		int	ncv
	)

Definition at line 1052 of file numerical_recipes.cpp.

 {
     double d1, d2, b, clinv, cl, sm;
     int incr, k, j, i2, i3, i4;
 
     /* Check parameters */
     if (mode != 1 && mode != 2)
         return(1);
     if (m < 1 || u == NULL || u_dim1 < 1 || cm == NULL)
         return(2);
     if (lpivot < 0 || lpivot >= l1 || l1 >= m)
         return(0);
     /* Function Body */
     cl = (d1 = u[lpivot*u_dim1], fabs(d1));
     if (mode == 2)
     { /* Apply transformation I+U*(U**T)/B to cm[] */
         if (cl <= 0.)
             return(0);
     }
     else
     { /* Construct the transformation */
         for (j = l1; j < m; j++)
         { /* Computing MAX */
             d2 = (d1 = u[j*u_dim1], fabs(d1));
             if (d2 > cl)
                 cl = d2;
         }
         if (cl <= 0.)
             return(0);
         clinv = 1.0 / cl;
         /* Computing 2nd power */
         d1 = u[lpivot*u_dim1] * clinv;
         sm = d1 * d1;
         for (j = l1; j < m; j++)
         {
             d1 = u[j*u_dim1] * clinv;
             sm += d1 * d1;
         }
         cl *= sqrt(sm);
         if (u[lpivot*u_dim1] > 0.)
             cl = -cl;
         *up = u[lpivot*u_dim1] - cl;
         u[lpivot*u_dim1] = cl;
     }
     if (ncv <= 0)
         return(0);
     b = (*up) * u[lpivot*u_dim1];
     /* b must be nonpositive here; if b>=0., then return */
     if (b >= 0.)
         return(0);
     b = 1.0 / b;
     i2 = 1 - icv + ice * lpivot;
     incr = ice * (l1 - lpivot);
     for (j = 0; j < ncv; j++)
     {
         i2 += icv;
         i3 = i2 + incr;
         i4 = i3;
         sm = cm[i2-1] * (*up);
         for (k = l1; k < m; k++)
         {
             sm += cm[i3-1] * u[k*u_dim1];
             i3 += ice;
         }
         if (sm != 0.0)
         {
             sm *= b;
             cm[i2-1] += sm * (*up);
             for (k = l1; k < m; k++)
             {
                 cm[i4-1] += sm * u[k*u_dim1];
                 i4 += ice;
             }
         }
     }
     return(0);
 } /* _nnls_h12 */

◆ beschb()

void beschb	(	double	x,
		double *	gam1,
		double *	gam2,
		double *	gampl,
		double *	gammi
	)

Definition at line 351 of file numerical_recipes.cpp.

 {
     double xx;
     static double c1[] =
         {
             -1.142022680371172e0, 6.516511267076e-3,
             3.08709017308e-4, -3.470626964e-6, 6.943764e-9,
             3.6780e-11, -1.36e-13
         };
     static double c2[] =
         {
             1.843740587300906e0, -0.076852840844786e0,
             1.271927136655e-3, -4.971736704e-6, -3.3126120e-8,
             2.42310e-10, -1.70e-13, -1.0e-15
         };
 
     xx = 8.0 * x * x - 1.0;
     *gam1 = chebev(-1.0, 1.0, c1, NUSE1, xx);
     *gam2 = chebev(-1.0, 1.0, c2, NUSE2, xx);
     *gampl = *gam2 - x * (*gam1);
     *gammi = *gam2 + x * (*gam1);
 }

◆ bessi0()

double bessi0 ( double x )

Definition at line 286 of file numerical_recipes.cpp.

 {
     double y, ax, ans;
     if ((ax = fabs(x)) < 3.75)
     {
         y = x / 3.75;
         y *= y;
         ans = 1.0 + y * (3.5156229 + y * (3.0899424 + y * (1.2067492
                                           + y * (0.2659732 + y * (0.360768e-1 + y * 0.45813e-2)))));
     }
     else
     {
         y = 3.75 / ax;
         ans = (exp(ax) / sqrt(ax)) * (0.39894228 + y * (0.1328592e-1
                                       + y * (0.225319e-2 + y * (-0.157565e-2 + y * (0.916281e-2
                                                                 + y * (-0.2057706e-1 + y * (0.2635537e-1 + y * (-0.1647633e-1
                                                                                             + y * 0.392377e-2))))))));
     }
     return ans;
 }

◆ bessi0_5()

double bessi0_5 ( double x )

Definition at line 547 of file numerical_recipes.cpp.

 {
     return (x == 0) ? 0 : sqrt(2 / (PI*x))*sinh(x);
 }

◆ bessi1()

double bessi1 ( double x )

Definition at line 308 of file numerical_recipes.cpp.

 {
     double ax, ans;
     double y;
     if ((ax = fabs(x)) < 3.75)
     {
         y = x / 3.75;
         y *= y;
         ans = ax * (0.5 + y * (0.87890594 + y * (0.51498869 + y * (0.15084934
                                + y * (0.2658733e-1 + y * (0.301532e-2 + y * 0.32411e-3))))));
     }
     else
     {
         y = 3.75 / ax;
         ans = 0.2282967e-1 + y * (-0.2895312e-1 + y * (0.1787654e-1
                                   - y * 0.420059e-2));
         ans = 0.39894228 + y * (-0.3988024e-1 + y * (-0.362018e-2
                                 + y * (0.163801e-2 + y * (-0.1031555e-1 + y * ans))));
         ans *= (exp(ax) / sqrt(ax));
     }
     return x < 0.0 ? -ans : ans;
 }

◆ bessi1_5()

double bessi1_5 ( double x )

Definition at line 551 of file numerical_recipes.cpp.

 {
     return (x == 0) ? 0 : sqrt(2 / (PI*x))*(cosh(x) - sinh(x) / x);
 }

◆ bessi2()

double bessi2 ( double x )

Definition at line 555 of file numerical_recipes.cpp.

 {
     return (x == 0) ? 0 : bessi0(x) - ((2*1) / x) * bessi1(x);
 }

◆ bessi2_5()

double bessi2_5 ( double x )

Definition at line 559 of file numerical_recipes.cpp.

 {
     return (x == 0) ? 0 : bessi0_5(x) - ((2*1.5) / x) * bessi1_5(x);
 }

◆ bessi3()

double bessi3 ( double x )

Definition at line 563 of file numerical_recipes.cpp.

 {
     return (x == 0) ? 0 : bessi1(x) - ((2*2) / x) * bessi2(x);
 }

◆ bessi3_5()

double bessi3_5 ( double x )

Definition at line 567 of file numerical_recipes.cpp.

 {
     return (x == 0) ? 0 : bessi1_5(x) - ((2*2.5) / x) * bessi2_5(x);
 }

◆ bessi4()

double bessi4 ( double x )

Definition at line 571 of file numerical_recipes.cpp.

 {
     return (x == 0) ? 0 : bessi2(x) - ((2*3) / x) * bessi3(x);
 }

◆ bessj0()

double bessj0 ( double x )

Definition at line 250 of file numerical_recipes.cpp.

 {
     double ax, z;
     double xx, y, ans, ans1, ans2;
 
     if ((ax = fabs(x)) < 8.0)
     {
         y = x * x;
         ans1 = 57568490574.0 + y * (-13362590354.0 +
                                     y * (651619640.7
                                          + y * (-11214424.18 +
                                                 y * (77392.33017 +
                                                      y * (-184.9052456)))));
         ans2 = 57568490411.0 + y * (1029532985.0 +
                                     y * (9494680.718
                                          + y * (59272.64853 +
                                                 y * (267.8532712 +
                                                      y * 1.0))));
         ans = ans1 / ans2;
     }
     else
     {
         z = 8.0 / ax;
         y = z * z;
         xx = ax - 0.785398164;
         ans1 = 1.0 + y * (-0.1098628627e-2 + y * (0.2734510407e-4
                           + y * (-0.2073370639e-5 + y * 0.2093887211e-6)));
         ans2 = -0.1562499995e-1 + y * (0.1430488765e-3
                                        + y * (-0.6911147651e-5 + y * (0.7621095161e-6
                                                                       - y * 0.934935152e-7)));
         ans = sqrt(0.636619772 / ax) * (cos(xx) * ans1 - z * sin(xx) * ans2);
     }
     return ans;
 }

◆ bessj1_5()

double bessj1_5 ( double x )

Definition at line 575 of file numerical_recipes.cpp.

 {
     double rj, ry, rjp, ryp;
     bessjy(x, 1.5, &rj, &ry, &rjp, &ryp);
     return rj;
 }

◆ bessj3_5()

double bessj3_5 ( double x )

Definition at line 581 of file numerical_recipes.cpp.

 {
     double rj, ry, rjp, ryp;
     bessjy(x, 3.5, &rj, &ry, &rjp, &ryp);
     return rj;
 }

◆ bessjy()

void bessjy	(	double	x,
		double	xnu,
		double *	rj,
		double *	ry,
		double *	rjp,
		double *	ryp
	)

Definition at line 381 of file numerical_recipes.cpp.

 {
     int i, isign, l, nl;
     double a, b, br, bi, c, cr, ci, d, del, del1, den, di, dlr, dli, dr, e, f, fact, fact2,
     fact3, ff, gam, gam1, gam2, gammi, gampl, h, p, pimu, pimu2, q, r, rjl,
     rjl1, rjmu, rjp1, rjpl, rjtemp, ry1, rymu, rymup, rytemp, sum, sum1,
     temp, w, x2, xi, xi2, xmu, xmu2;
 
     if (x <= 0.0 || xnu < 0.0)
         nrerror("bad arguments in bessjy");
     nl = (x < XMIN ? (int)(xnu + 0.5) : XMIPP_MAX(0, (int)(xnu - x + 1.5)));
     xmu = xnu - nl;
     xmu2 = xmu * xmu;
     xi = 1.0 / x;
     xi2 = 2.0 * xi;
     w = xi2 / PI;
     isign = 1;
     h = xnu * xi;
     if (h < FPMIN)
         h = FPMIN;
     b = xi2 * xnu;
     d = 0.0;
     c = h;
     for (i = 1;i <= MAXIT;i++)
     {
         b += xi2;
         d = b - d;
         if (fabs(d) < FPMIN)
             d = FPMIN;
         c = b - 1.0 / c;
         if (fabs(c) < FPMIN)
             c = FPMIN;
         d = 1.0 / d;
         del = c * d;
         h = del * h;
         if (d < 0.0)
             isign = -isign;
         if (fabs(del - 1.0) < EPS)
             break;
     }
     if (i > MAXIT)
         nrerror("x too large in bessjy; try asymptotic expansion");
     rjl = isign * FPMIN;
     rjpl = h * rjl;
     rjl1 = rjl;
     rjp1 = rjpl;
     fact = xnu * xi;
     for (l = nl;l >= 1;l--)
     {
         rjtemp = fact * rjl + rjpl;
         fact -= xi;
         rjpl = fact * rjtemp - rjl;
         rjl = rjtemp;
     }
     if (rjl == 0.0)
         rjl = EPS;
     f = rjpl / rjl;
     if (x < XMIN)
     {
         x2 = 0.5 * x;
         pimu = PI * xmu;
         fact = (fabs(pimu) < EPS ? 1.0 : pimu / sin(pimu));
         d = -log(x2);
         e = xmu * d;
         fact2 = (fabs(e) < EPS ? 1.0 : sinh(e) / e);
         beschb(xmu, &gam1, &gam2, &gampl, &gammi);
         ff = 2.0 / PI * fact * (gam1 * cosh(e) + gam2 * fact2 * d);
         e = exp(e);
         p = e / (gampl * PI);
         q = 1.0 / (e * PI * gammi);
         pimu2 = 0.5 * pimu;
         fact3 = (fabs(pimu2) < EPS ? 1.0 : sin(pimu2) / pimu2);
         r = PI * pimu2 * fact3 * fact3;
         c = 1.0;
         d = -x2 * x2;
         sum = ff + r * q;
         sum1 = p;
         for (i = 1;i <= MAXIT;i++)
         {
             ff = (i * ff + p + q) / (i * i - xmu2);
             c *= (d / i);
             p /= (i - xmu);
             q /= (i + xmu);
             del = c * (ff + r * q);
             sum += del;
             del1 = c * p - i * del;
             sum1 += del1;
             if (fabs(del) < (1.0 + fabs(sum))*EPS)
                 break;
         }
         if (i > MAXIT)
             nrerror("bessy series failed to converge");
         rymu = -sum;
         ry1 = -sum1 * xi2;
         rymup = xmu * xi * rymu - ry1;
         rjmu = w / (rymup - f * rymu);
     }
     else
     {
         a = 0.25 - xmu2;
         p = -0.5 * xi;
         q = 1.0;
         br = 2.0 * x;
         bi = 2.0;
         fact = a * xi / (p * p + q * q);
         cr = br + q * fact;
         ci = bi + p * fact;
         den = br * br + bi * bi;
         dr = br / den;
         di = -bi / den;
         dlr = cr * dr - ci * di;
         dli = cr * di + ci * dr;
         temp = p * dlr - q * dli;
         q = p * dli + q * dlr;
         p = temp;
         for (i = 2;i <= MAXIT;i++)
         {
             a += 2 * (i - 1);
             bi += 2.0;
             dr = a * dr + br;
             di = a * di + bi;
             if (fabs(dr) + fabs(di) < FPMIN)
                 dr = FPMIN;
             fact = a / (cr * cr + ci * ci);
             cr = br + cr * fact;
             ci = bi - ci * fact;
             if (fabs(cr) + fabs(ci) < FPMIN)
                 cr = FPMIN;
             den = dr * dr + di * di;
             dr /= den;
             di /= -den;
             dlr = cr * dr - ci * di;
             dli = cr * di + ci * dr;
             temp = p * dlr - q * dli;
             q = p * dli + q * dlr;
             p = temp;
             if (fabs(dlr - 1.0) + fabs(dli) < EPS)
                 break;
         }
         if (i > MAXIT)
             nrerror("cf2 failed in bessjy");
         gam = (p - f) / q;
         rjmu = sqrt(w / ((p - f) * gam + q));
         rjmu = NRSIGN(rjmu, rjl);
         rymu = rjmu * gam;
         rymup = rymu * (p + q / gam);
         ry1 = xmu * xi * rymu - rymup;
     }
     fact = rjmu / rjl;
     *rj = rjl1 * fact;
     *rjp = rjp1 * fact;
     for (i = 1;i <= nl;i++)
     {
         rytemp = (xmu + i) * xi2 * ry1 - rymu;
         rymu = ry1;
         ry1 = rytemp;
     }
     *ry = rymu;
     *ryp = xnu * xi * rymu - ry1;
 }

◆ betacf()

double betacf	(	double	a,
		double	b,
		double	x
	)

Definition at line 630 of file numerical_recipes.cpp.

 {
     double qap, qam, qab, em, tem, d;
     double bz, bm = 1.0, bp, bpp;
     double az = 1.0, am = 1.0, ap, app, aold;
     int m;
 
     qab = a + b;
     qap = a + 1.0;
     qam = a - 1.0;
     bz = 1.0 - qab * x / qap;
     for (m = 1;m <= ITMAX;m++)
     {
         em = (double) m;
         tem = em + em;
         d = em * (b - em) * x / ((qam + tem) * (a + tem));
         ap = az + d * am;
         bp = bz + d * bm;
         d = -(a + em) * (qab + em) * x / ((qap + tem) * (a + tem));
         app = ap + d * az;
         bpp = bp + d * bz;
         aold = az;
         am = ap / bpp;
         bm = bp / bpp;
         az = app / bpp;
         bz = 1.0;
         if (fabs(az - aold) < (EPS*fabs(az)))
             return az;
     }
     nrerror("a or b too big, or ITMAX too small in BETACF");
     return 0;
 }

◆ betai()

double betai	(	double	a,
		double	b,
		double	x
	)

Definition at line 612 of file numerical_recipes.cpp.

 {
     double bt;
     if (x < 0.0 || x > 1.0)
         nrerror("Bad x in routine BETAI");
     if (x == 0.0 || x == 1.0)
         bt = 0.0;
     else
         bt = exp(gammln(a + b) - gammln(a) - gammln(b) + a * log(x) + b * log(1.0 - x));
     if (x < (a + 1.0) / (a + b + 2.0))
         return bt*betacf(a, b, x) / a;
     else
         return 1.0 -bt*betacf(b, a, 1.0 - x) / b;
 
 }

◆ brent()

double brent	(	double	ax,
		double	bx,
		double	cx,
		double()(double , void *)	func,
		void *	prm,
		double	tol,
		double *	xmin,
		int	ncom,
		double *	pcom,
		double *	xicom
	)

Definition at line 757 of file numerical_recipes.cpp.

 {
     int iter;
     double a, b, d, etemp, fu, fv, fw, fx, p, q, r, tol1, tol2, u, v, w, x, xm;
     double e = 0.0;
     std::vector<double> buffer(ncom);
     auto *xt= buffer.data()-1;
 
     a = (ax < cx ? ax : cx);
     b = (ax > cx ? ax : cx);
     x = w = v = bx;
     F1DIM(x,fx);
     fw = fv = fx;
     for (iter = 1;iter <= ITMAX;iter++)
     {
         xm = 0.5 * (a + b);
         tol2 = 2.0 * (tol1 = tol * fabs(x) + ZEPS);
         if (fabs(x - xm) <= (tol2 - 0.5*(b - a)))
         {
             *xmin = x;
             return fx;
         }
         if (fabs(e) > tol1)
         {
             r = (x - w) * (fx - fv);
             q = (x - v) * (fx - fw);
             p = (x - v) * q - (x - w) * r;
             q = 2.0 * (q - r);
             if (q > 0.0)
                 p = -p;
             q = fabs(q);
             etemp = e;
             e = d;
             if (fabs(p) >= fabs(0.5*q*etemp) || p <= q*(a - x) || p >= q*(b - x))
                 d = CGOLD * (e = (x >= xm ? a - x : b - x));
             else
             {
                 d = p / q;
                 u = x + d;
                 if (u - a < tol2 || b - u < tol2)
                     d = SIGN(tol1, xm - x);
             }
         }
         else
         {
             d = CGOLD * (e = (x >= xm ? a - x : b - x));
         }
         u = (fabs(d) >= tol1 ? x + d : x + SIGN(tol1, d));
         F1DIM(u,fu);
         if (fu <= fx)
         {
             if (u >= x)
                 a = x;
             else
                 b = x;
             SHFT(v, w, x, u)
             SHFT(fv, fw, fx, fu)
         }
         else
         {
             if (u < x)
                 a = u;
             else
                 b = u;
             if (fu <= fw || w == x)
             {
                 v = w;
                 w = u;
                 fv = fw;
                 fw = fu;
             }
             else if (fu <= fv || v == x || v == w)
             {
                 v = u;
                 fv = fu;
             }
         }
     }
     nrerror("Too many iterations in brent");
     *xmin = x;
     return fx;
 }

◆ cfsqp()

void cfsqp	(	nparam	,
		nf	,
		nfsr	,
		nineqn	,
		nineq	,
		neqn	,
		neq	,
		ncsrl	,
		ncsrn	,
		mesh_pts	,
		mode	,
		iprint	,
		miter	,
		inform	,
		bigbnd	,
		eps	,
		epseqn	,
		udelta	,
		bl	,
		bu	,
		x	,
		f	,
		g	,
		lambda	,
		obj	,
		constr	,
		gradob	,
		gradcn	,
		cd
	)

◆ cfsqp1()

cfsqp1	(	miter	,
		nparam	,
		nob	,
		nobL	,
		nfsip1	,
		nineqn	,
		neq	,
		neqn	,
		ncsipl1	,
		ncsipn1	,
		mesh_pts1	,
		ncnstr	,
		nctotl	,
		nrowa	,
		feasb	,
		epskt	,
		epseqn	,
		indxob	,
		indxcn	,
		param	,
		cs	,
		ob	,
		signeq	,
		obj	,
		constr	,
		gradob	,
		gradcn
	)

◆ chebev()

double chebev	(	double	a,
		double	b,
		double	c[],
		int	m,
		double	x
	)

Definition at line 332 of file numerical_recipes.cpp.

 {
     double d = 0.0, dd = 0.0, sv, y, y2;
     int j;
 
     if ((x - a)*(x - b) > 0.0)
         nrerror("x not in range in routine chebev");
     y2 = 2.0 * (y = (2.0 * x - a - b) / (b - a));
     for (j = m - 1;j >= 1;j--)
     {
         sv = d;
         d = y2 * d - dd + c[j];
         dd = sv;
     }
     return y*d - dd + 0.5*c[0];
 }

◆ check()

check	(	nparam	,
		nf	,
		nfsr	,
		&	Linfty,
		nineq	,
		nineqn	,
		neq	,
		neqn	,
		ncsrl	,
		ncsrn	,
		mode	,
		&	modem,
		eps	,
		bgbnd	,
		param
	)

◆ choldc()

void choldc	(	double *	a,
		int	n,
		double *	p
	)

Definition at line 9347 of file numerical_recipes.cpp.

 {
     int i, j, k;
     double sum;
 
     for (i = 1;i <= n;i++)
     {
         for (j = i;j <= n;j++)
         {
             for (sum = a[i*n+j], k = i - 1;k >= 1;k--)
                 sum -= a[i*n+k] * a[j*n+k];
             if (i == j)
             {
                 if (sum <= 0.0)
                     nrerror("choldc failed");
                 p[i] = sqrt(sum);
             }
             else
                 a[j*n+i] = sum / p[i];
         }
     }
 }

◆ cholsl()

void cholsl	(	double *	a,
		int	n,
		double *	p,
		double *	b,
		double *	x
	)

Definition at line 9370 of file numerical_recipes.cpp.

 {
     int i, k;
     double sum;
 
     for (i = 1;i <= n;i++)
     {
         for (sum = b[i], k = i - 1;k >= 1;k--)
             sum -= a[i*n+k] * x[k];
         x[i] = sum / p[i];
     }
     for (i = n;i >= 1;i--)
     {
         for (sum = x[i], k = i + 1;k <= n;k++)
             sum -= a[k*n+i] * x[k];
         x[i] = sum / p[i];
     }
 }

◆ dealloc()

dealloc	(	nineq	,
		neq	,
		signeq	,
		indxcn	,
		indxob	,
		cs	,
		param
	)

◆ diagnl()

diagnl	(	nqpram	,
		eta	,
		hess1
	)

◆ dqp()

dqp	(	nparam	,
		nqprm0	,
		nob	,
		nobL	,
		nfsip	,
		nineqn	,
		neq	,
		neqn	,
		nn	,
		ncsipl	,
		ncsipn	,
		ncnstr	,
		nctot0	,
		nrowa0	,
		nineqn	,
		&	infoqp,
		param	,
		di	,
		feasb	,
		ob	,
		*	fmax,
		grdpsf	,
		cs	,
		a	,
		cvec	,
		bl	,
		bu	,
		clamda	,
		hess	,
		hess1	,
		di	,
		vv	,
		0
	)

◆ for() [1/4]

for ( j = 1; j <= i__1; ++j )

Definition at line 2310 of file numerical_recipes.cpp.

     {
         war[in] = -b[j];
         /* L10: */
         ++in;
     }

◆ for() [2/4]

for ( i = 1;i<=i__1;++i ) = nfsr + mesh_pts[i]

Definition at line 2368 of file numerical_recipes.cpp.

     {
         j = iwar[i];
         u[j] = war[in + i];
         /* L60: */
     }

◆ for() [3/4]

for ( k = 1; k <= i__1; ++k )

Definition at line 2608 of file numerical_recipes.cpp.

     {
         sum = zero;
         i__2 = *n;
         for (i = 1; i <= i__2; ++i)
         {
             /* L10: */
             /* Computing 2nd power */
             d__1 = a[k + i * a_dim1];
             sum += d__1 * d__1;
         }
         if (sum > zero)
         {
             goto L20;
         }
         if (b[k] == zero)
         {
             goto L30;
         }
         *info = -k;
         if (k <= *meq)
         {
             goto L730;
         }
         if (b[k] <= 0.)
         {
             goto L30;
         }
         else
         {
             goto L730;
         }
 L20:
         sum = one / sqrt(sum);
 L30:
         ia = iwa + k;
         /* L40: */
         w[ia] = sum;
     }

◆ for() [4/4]

for ( ;; )

Definition at line 5341 of file numerical_recipes.cpp.

     {
         out(miter, nparam, nob, nobL, nfsip, nineqn, nn, nineqn, ncnst1,
             ncsipl, ncsipn, mesh_pts, param->x, cs, ob, fM, fmax, steps,
             sktnom, d0nm, feasb);
         if (nstop == 0)
         {
             if (!feasb)
             {
                 dealloc1(nparam, nrowa, a, hess, hess1, di, d, gm,
                          grdpsf, penp, bl, bu, clamda, cvec, psmu, span, backup,
                          iact, iskip, istore);
                 return;
             }
             for (i = 1; i <= ncnst1; i++)
                 cs[i].val = backup[i];
             for (i = 1; i <= nob; i++)
                 ob[i].val = backup[i+ncnst1];
             for (i = 1; i <= neqn; i++)
                 cs[glob_info.nnineq+i].mult = signeq[i] * psmu[i];
             dealloc1(nparam, nrowa, a, hess, hess1, di, d, gm,
                      grdpsf, penp, bl, bu, clamda, cvec, psmu, span, backup,
                      iact, iskip, istore);
             return;
         }
         if (!feasb && glob_prnt.iprint == 0)
             glob_prnt.iter++;
         /*   Update the SIP constraint set Omega_k  */
         if ((ncsipl + ncsipn) != 0 || nfsip)
             update_omega(nparam, ncsipl, ncsipn, mesh_pts, nineqn, nob, nobL,
                          nfsip, steps, fmax, cs, ob, param->x, viol,
                          constr, obj, gradob, gradcn, param->cd, feasb);
         /*   Compute search direction               */
         dir(nparam, nob, nobL, nfsip, nineqn, neq, neqn, nn, ncsipl, ncsipn,
             ncnst1, feasb, &steps, epskt, epseqn, &sktnom, &scvneq, Ck, &d0nm,
             &grdftd, indxob, indxcn, iact, &iskp, iskip, istore, param, di, d,
             cs, ob, &fM, &fMp, &fmax, &psf, grdpsf, penp, a, bl, bu, clamda, cvec,
             hess, hess1, backup, signeq, viol, obj, constr);
         if (nstop == 0 && !glob_log.get_ne_mult)
             continue;
         glob_log.first = FALSE;
         if (!glob_log.update && !glob_log.d0_is0)
         {
             /*   Determine step length                                */
             step1(nparam, nob, nobL, nfsip, nineqn, neq, neqn, nn, ncsipl, ncsipn,
                   ncnst1, &ncg, &ncf, indxob, indxcn, iact, &iskp, iskip, istore,
                   feasb, grdftd, ob, &fM, &fMp, &fmax, &psf, penp, &steps, &scvneq,
                   bu, param->x, di, d, cs, backup, signeq, viol, obj, constr,
                   param->cd);
             if (nstop == 0)
                 continue;
         }
         /*   Update the Hessian                                      */
         hessian(nparam, nob, nfsip, nobL, nineqn, neq, neqn, nn, ncsipn, ncnst1,
                 nfs, &nstart, feasb, bu, param, ob, fmax, &fM, &fMp, &psf, grdpsf,
                 penp, cs, gm, indxob, indxcn, bl, clamda, di, hess, d, steps, &nrst,
                 signeq, span, obj, constr, gradob, gradcn, hess1, cvec, psmu, viol);
         if (nstop == 0 || glob_info.mode == 0)
             continue;
         if (d0nm > dbar)
             Ck = DMAX1(0.5e0 * Ck, Cbar);
         if (d0nm <= dbar && !glob_log.dlfeas &&
             !glob_log.rhol_is1)
             Ck = 10.e0 * Ck;
     }

◆ fprintf()

fprintf	(	glob_prnt.	io,
		"\
	)

◆ free()

free ( (char *) ob )

◆ free_dm() [1/3]

free_dm	(	hess	,
		nparam
	)

◆ free_dm() [2/3]

free_dm	(	hess1	,
		nparam+	1
	)

◆ free_dm() [3/3]

free_dm	(	a	,
		nrowa
	)

◆ free_dv() [1/20]

free_dv ( w )

◆ free_dv() [2/20]

free_dv ( param-> x )

◆ free_dv() [3/20]

free_dv ( signeq )

◆ free_dv() [4/20]

free_dv ( di )

◆ free_dv() [5/20]

free_dv ( d )

◆ free_dv() [6/20]

free_dv ( gm )

◆ free_dv() [7/20]

free_dv ( grdpsf )

◆ free_dv() [8/20]

free_dv ( penp )

◆ free_dv() [9/20]

free_dv ( bl )

◆ free_dv() [10/20]

free_dv ( bu )

◆ free_dv() [11/20]

free_dv ( clamda )

◆ free_dv() [12/20]

free_dv ( cvec )

◆ free_dv() [13/20]

free_dv ( psmu )

◆ free_dv() [14/20]

free_dv ( span )

◆ free_dv() [15/20]

free_dv ( backup )

◆ free_dv() [16/20]

free_dv ( x )

◆ free_dv() [17/20]

free_dv ( bj )

◆ free_dv() [18/20]

free_dv ( htemp )

◆ free_dv() [19/20]

free_dv ( atemp )

◆ free_dv() [20/20]

free_dv ( ctemp )

◆ free_iv() [1/7]

free_iv ( iw )

◆ free_iv() [2/7]

free_iv ( indxob )

◆ free_iv() [3/7]

free_iv ( indxcn )

◆ free_iv() [4/7]

free_iv ( iact )

◆ free_iv() [5/7]

free_iv ( iskip )

◆ free_iv() [6/7]

free_iv ( istore )

◆ free_iv() [7/7]

free_iv ( iw_hold )

◆ gammln()

double gammln ( double xx )

Definition at line 589 of file numerical_recipes.cpp.

 {
     double x, tmp, ser;
     static double cof[6] =
         {
             76.18009173, -86.50532033, 24.01409822,
             -1.231739516, 0.120858003e-2, -0.536382e-5
         };
     int j;
 
     x = xx - 1.0;
     tmp = x + 5.5;
     tmp -= (x + 0.5) * log(tmp);
     ser = 1.0;
     for (j = 0;j <= 5;j++)
     {
         x += 1.0;
         ser += cof[j] / x;
     }
     return -tmp + log(2.50662827465*ser);
 }

◆ gammp()

double gammp	(	double	a,
		double	x
	)

Definition at line 9328 of file numerical_recipes.cpp.

 {
     double gamser, gammcf, gln;
 
     if (x < 0.0 || a <= 0.0)
         nrerror("Invalid arguments in routine gammp");
     if (x < (a + 1.0))
     {
         gser(&gamser, a, x, &gln);
         return gamser;
     }
     else
     {
         gcf(&gammcf, a, x, &gln);
         return 1.0 -gammcf;
     }
 }

◆ gasdev()

double gasdev ( int * idum )

Definition at line 106 of file numerical_recipes.cpp.

 {
     static int iset = 0;
     static double gset;
     double fac, r, v1, v2;
 
     if (iset == 0)
     {
         do
         {
             v1 = 2.0 * ran1(idum) - 1.0;
             v2 = 2.0 * ran1(idum) - 1.0;
             r = v1 * v1 + v2 * v2;
         }
         while (r >= 1.0);
         fac = sqrt(-2.0 * log(r) / r);
         gset = v1 * fac;
         iset = 1;
         return v2*fac;
     }
     else
     {
         iset = 0;
         return gset;
     }
 }

◆ gcf()

void gcf	(	double *	gammcf,
		double	a,
		double	x,
		double *	gln
	)

Definition at line 9294 of file numerical_recipes.cpp.

 {
     int i;
     double an, b, c, d, del, h;
 
     *gln = gammln(a);
     b = x + 1.0 - a;
     c = 1.0 / FPMIN;
     d = 1.0 / b;
     h = d;
     for (i = 1;i <= ITMAX;i++)
     {
         an = -i * (i - a);
         b += 2.0;
         d = an * d + b;
         if (fabs(d) < FPMIN)
             d = FPMIN;
         c = b + an / c;
         if (fabs(c) < FPMIN)
             c = FPMIN;
         d = 1.0 / d;
         del = d * c;
         h *= del;
         if (fabs(del - 1.0) < EPS)
             break;
     }
     if (i > ITMAX)
         nrerror("a too large, ITMAX too small in gcf");
     *gammcf = exp(-x + a * log(x) - (*gln)) * h;
 }

◆ grcnfd() [1/2]

void grcnfd ( )

◆ grcnfd() [2/2]

void grcnfd	(	nparam	,
		j	,
		x	,
		gradg	,
		constr	,
		cd
	)

◆ grobfd() [1/2]

void grobfd ( )

◆ grobfd() [2/2]

void grobfd	(	nparam	,
		j	,
		x	,
		gradf	,
		obj	,
		cd
	)

◆ gser()

void gser	(	double *	gamser,
		double	a,
		double	x,
		double *	gln
	)

Definition at line 9255 of file numerical_recipes.cpp.

 {
     int n;
     double sum, del, ap;
 
     *gln = gammln(a);
     if (x <= 0.0)
     {
         if (x < 0.0)
             nrerror("x less than 0 in routine gser");
         *gamser = 0.0;
         return;
     }
     else
     {
         ap = a;
         del = sum = 1.0 / a;
         for (n = 1;n <= ITMAX;n++)
         {
             ++ap;
             del *= x / ap;
             sum += del;
             if (fabs(del) < fabs(sum)*EPS)
             {
                 *gamser = sum * exp(-x + a * log(x) - (*gln));
                 return;
             }
         }
         nrerror("a too large, ITMAX too small in routine gser");
         return;
     }
 }

◆ if() [1/102]

if ( fabs(c[ *nmax+*nmax *c_dim1]) = = 0.e0 )

Definition at line 2279 of file numerical_recipes.cpp.

     {
         c[*nmax + *nmax * c_dim1] = cmache_1.eps;
     }

◆ if() [2/102]

if ( iwar [1] = = 1 )

Definition at line 2292 of file numerical_recipes.cpp.

     {
         lql = TRUE_;
     }

◆ if() [3/102]

if	(	inw2+	lw,
		*	lwar
	)

Definition at line 2318 of file numerical_recipes.cpp.

     {
         goto L80;
     }

◆ if() [4/102]

if ( info = = 1 )

Definition at line 2341 of file numerical_recipes.cpp.

     {
         goto L40;
     }

◆ if() [5/102]

if ( )

Definition at line 2349 of file numerical_recipes.cpp.

     {
         goto L70;
     }

◆ if() [6/102]

if ( nact = = 0 )

Definition at line 2363 of file numerical_recipes.cpp.

     {
         goto L30;
     }

◆ if() [7/102]

if ( ! * lql )

Definition at line 2658 of file numerical_recipes.cpp.

     {
         goto L165;
     }

◆ if() [8/102]

if ( k >= 2 )

Definition at line 2775 of file numerical_recipes.cpp.

     {
         goto L150;
     }

◆ if() [9/102]

if ( w >= zero[kdrop] )

Definition at line 3137 of file numerical_recipes.cpp.

     {
         goto L440;
     }

◆ if() [10/102]

if ( iact<= * meq[kdrop] )

Definition at line 3141 of file numerical_recipes.cpp.

     {
         goto L440;
     }

◆ if() [11/102]

if ( cvmax<= * vsmall )

Definition at line 3257 of file numerical_recipes.cpp.

     {
         goto L700;
     }

◆ if() [12/102]

if ( jfinc = = 0 )

Definition at line 3266 of file numerical_recipes.cpp.

     {
         goto L510;
     }

◆ if() [13/102]

if ( jfinc ! = ifinc )

Definition at line 3270 of file numerical_recipes.cpp.

     {
         goto L530;
     }

◆ if() [14/102]

if ( sum<= fdiffa )

Definition at line 3322 of file numerical_recipes.cpp.

     {
         goto L700;
     }

◆ if() [15/102]

if ( temp<= sum )

Definition at line 3327 of file numerical_recipes.cpp.

     {
         goto L700;
     }

◆ if() [16/102]

if ( iterc<= * maxit )

Definition at line 3348 of file numerical_recipes.cpp.

     {
         goto L531;
     }

◆ if() [17/102]

if	(	knext	,
		*	m
	)

Definition at line 3356 of file numerical_recipes.cpp.

     {
         goto L541;
     }

◆ if() [18/102]

if	(	k1	,
		*	n
	)

Definition at line 3377 of file numerical_recipes.cpp.

     {
         goto L545;
     }

◆ if() [19/102]

if ( tempa<= temp )

Definition at line 3454 of file numerical_recipes.cpp.

     {
         goto L570;
     }

◆ if() [20/102]

if	(	sumb	,
		*	vsmall
	)

Definition at line 3458 of file numerical_recipes.cpp.

     {
         goto L5;
     }

◆ if() [21/102]

if ( knext<= * m )

Definition at line 3466 of file numerical_recipes.cpp.

     {
         sumc /= w[ia];
     }

◆ if() [22/102]

if ( kdrop = = 0 )

Definition at line 3633 of file numerical_recipes.cpp.

     {
         goto L700;
     }

◆ if() [23/102]

if ( itref<= 0 )

Definition at line 3764 of file numerical_recipes.cpp.

     {
         goto L450;
     }

◆ if() [24/102]

if ( itref = = 1 )

Definition at line 3783 of file numerical_recipes.cpp.

     {
         goto L250;
     }

◆ if() [25/102]

if	(	i	,
		1
	)

Definition at line 3840 of file numerical_recipes.cpp.

     {
         goto L750;
     }

◆ if() [26/102]

if ( lflag = = 3 )

Definition at line 3844 of file numerical_recipes.cpp.

     {
         goto L390;
     }

◆ if() [27/102]

if	(	iact	[kdrop],
		*	mn
	)

Definition at line 3906 of file numerical_recipes.cpp.

     {
         ia -= *n;
     }

◆ if() [28/102]

if ( nu = = *nact )

Definition at line 4009 of file numerical_recipes.cpp.

     {
         goto L900;
     }

◆ if() [29/102]

if ( w [is] = = zero )

Definition at line 4013 of file numerical_recipes.cpp.

     {
         goto L870;
     }

◆ if() [30/102]

if ( ncsipn1 )

◆ if() [31/102]

if	(	glob_prnt.	iprint,
		0
	)

Definition at line 4719 of file numerical_recipes.cpp.

     {
         fprintf(glob_prnt.io,
                 "\n\n    CFSQP Version 2.5b (Released June 1997) \n");
         fprintf(glob_prnt.io,
                 "          Copyright (c) 1993 --- 1997       \n");
         fprintf(glob_prnt.io,
                 "           C.T. Lawrence, J.L. Zhou         \n");
         fprintf(glob_prnt.io,
                 "                and A.L. Tits               \n");
         fprintf(glob_prnt.io,
                 "             All Rights Reserved            \n\n");
     }

◆ if() [32/102]

if ( glob_prnt. info = = 7 )

Definition at line 4737 of file numerical_recipes.cpp.

     {
         *inform = glob_prnt.info;
         return;
     }

◆ if() [33/102]

if ( nclin ! = 0 )

Definition at line 4764 of file numerical_recipes.cpp.

     {
         for (i = 1; i <= nclin; i++)
         {
             j = i + nineqn;
             if (j <= nineq)
             {
                 constr(nparam, j, (param->x) + 1, &gi, param->cd);
                 if (gi > glob_grd.epsmac)
                     feasbl = FALSE;
             }
             else
             {
                 constr(nparam, j + neqn, (param->x) + 1, &gi, param->cd);
                 if (fabs(gi) > glob_grd.epsmac)
                     feasbl = FALSE;
             }
             cs[j].val = gi;
         }
     }

◆ if() [34/102]

if ( ! feasbl ) = FALSE

Definition at line 4787 of file numerical_recipes.cpp.

     {
         if (glob_prnt.iprint > 0)
         {
             fprintf(glob_prnt.io,
                     " The given initial point is infeasible for inequality\n");
             fprintf(glob_prnt.io,
                     " constraints and linear equality constraints:\n");
             sbout1(glob_prnt.io, nparam, "                    ", dummy,
                    param->x, 2, 1);
             prnt = TRUE;
         }
         nctotl = nparam + nclin;
         lenw = 2 * nparam * nparam + 10 * nparam + 2 * nctotl + 1;
         leniw = DMAX1(2 * nparam + 2 * nctotl + 3, 2 * nclin + 2 * nparam + 6);
         /*-----------------------------------------------------*/
         /*   Attempt to generate a point satisfying all linear */
         /*   constraints.          */
         /*-----------------------------------------------------*/
         nrowa = DMAX1(nclin, 1);
         iw = make_iv(leniw);
         w = make_dv(lenw);
         initpt(nparam, nineqn, neq, neqn, nclin, nctotl, nrowa, param,
                &cs[nineqn], constr, gradcn);
         free_iv(iw);
         free_dv(w);
         if (glob_prnt.info != 0)
         {
             *inform = glob_prnt.info;
             return;
         }
     }

◆ if() [35/102]

if ( feasb )

Definition at line 4986 of file numerical_recipes.cpp.

     {
         for (i = 1; i <= neqn; i++)
         {
             if (cs[i+nineq].val > 0.e0)
                 signeq[i] = -1.e0;
             else
                 signeq[i] = 1.e0;
         }
     }

◆ if() [36/102]

if ( glob_prnt.info ! = 0 )

Definition at line 5034 of file numerical_recipes.cpp.

     {
         if (feasb)
         {
             for (i = 1; i <= nparam; i++)
                 x[i] = param->x[i];
             for (i = 1; i <= nineq + neq; i++)
                 g[i] = cs[i].val;
             *inform = glob_prnt.info;
             dealloc(nineq, neq, signeq, indxcn, indxob, cs, param);
             for (i = 1; i <= nf; i++)
             {
                 f[i] = ob[i].val;
                 free_dv(ob[i].grad);
             }
             free((char *) ob);
             return;
         }
         glob_prnt.info = 2;
         fprintf(glob_prnt.io,
                 "Error: No feasible point is found for nonlinear inequality\n");
         fprintf(glob_prnt.io,
                 "constraints and linear equality constraints\n");
         *inform = glob_prnt.info;
         dealloc(nineq, neq, signeq, indxcn, indxob, cs, param);
         for (i = 1; i <= nineqn; i++)
             free_dv(ob[i].grad);
         free((char *) ob);
         return;
     }

◆ if() [37/102]

if ( nf = =1 )

◆ if() [38/102]

if ( glob_info.mode ! = 0 )

Definition at line 6472 of file numerical_recipes.cpp.

     {
         v0 = pow(*d0nm, 2.1);
         v1 = DMAX1(0.5e0, pow(dnm1, 2.5));
         rho = v0 / (v0 + v1);
         rhog = rho;
     }

◆ if() [39/102]

if ( feasb &&neqn ! = 0 )

◆ if() [40/102]

if ( feasb && nob = =0 )

pure virtual

◆ if() [41/102]

if ( glob_prnt.iprint >=3 &&glob_log. first )

Definition at line 5291 of file numerical_recipes.cpp.

     {
         for (i = 1; i <= nob; i++)
         {
             if (feasb)
             {
                 if (nob > 1)
                 {
                     tempv = ob[i].grad;
                     sbout2(glob_prnt.io, nparam, i, "gradf(j,", ")", tempv);
                 }
                 if (nob == 1)
                 {
                     tempv = ob[1].grad;
                     sbout1(glob_prnt.io, nparam, "gradf(j)            ",
                            dummy, tempv, 2, 2);
                 }
                 continue;
             }
             tempv = ob[i].grad;
             sbout2(glob_prnt.io, nparam, indxob[i], "gradg(j,", ")", tempv);
         }
         if (ncnstr != 0)
         {
             for (i = 1; i <= ncnst1; i++)
             {
                 tempv = cs[indxcn[i]].grad;
                 sbout2(glob_prnt.io, nparam, indxcn[i], "gradg(j,", ")", tempv);
             }
             if (neqn != 0)
             {
                 sbout1(glob_prnt.io, nparam, "grdpsf(j)           ", dummy,
                        grdpsf, 2, 2);
                 sbout1(glob_prnt.io, neqn, "P                   ", dummy,
                        penp, 2, 2);
             }
         }
         for (i = 1; i <= nparam; i++)
         {
             tempv = colvec(hess, i, nparam);
             sbout2(glob_prnt.io, nparam, i, "hess (j,", ")", tempv);
             free_dv(tempv);
         }
     }

◆ if() [42/102]

if ( nparam<= 0 )

◆ if() [43/102]

if ( nparam<=neq - neqn )

◆ if() [44/102]

if ( glob_prnt.iprint< 0||glob_prnt.iprint > 3 )

◆ if() [45/102]

if ( eps<=glob_grd. epsmac )

Definition at line 5501 of file numerical_recipes.cpp.

     {
         error("eps should be bigger than epsmac!         ",
               &glob_prnt.info);
         fprintf(glob_prnt.io,
                 "epsmac = %22.14e which is machine dependent.\n",
                 glob_grd.epsmac);
     }

◆ if() [46/102]

if ( ! mode==100||mode==101||mode==110||mode==111||mode==200||mode==201||mode==210||mode==211 )

◆ if() [47/102]

if ( mode >= 200 )

Definition at line 5536 of file numerical_recipes.cpp.

     {
         i = mode - 200;
         glob_info.modec = 2;
     }

◆ if() [48/102]

if ( glob_prnt.iter % glob_prnt. iter_mod ) = FALSE

◆ if() [49/102]

if ( ncsipn ! = 0 )

Definition at line 5726 of file numerical_recipes.cpp.

     {
         offset = nineqn - ncsipn;
         for (i = 1; i <= glob_info.ncsipn; i++)
         {
             for (j = 1; j <= mesh_pts[glob_info.nfsip+i]; j++)
             {
                 offset++;
                 if (j == 1)
                 {
                     if (cs[offset].val >= -epsilon &&
                         cs[offset].val >= cs[offset+1].val)
                     {
                         cs[offset].act_sip = TRUE;
                         glob_info.tot_actg_sip++;
                         if (cs[offset].mult == 0.e0 && !glob_log.first)
                         {
                             glob_grd.valnom = cs[offset].val;
                             gradcn(nparam, offset, x + 1, cs[offset].grad + 1, constr,
                                    cd);
                         }
                         continue;
                     }
                 }
                 else if (j == mesh_pts[glob_info.nfsip+i])
                 {
                     if (cs[offset].val >= -epsilon &&
                         cs[offset].val > cs[offset-1].val)
                     {
                         cs[offset].act_sip = TRUE;
                         glob_info.tot_actg_sip++;
                         if (cs[offset].mult == 0.e0 && !glob_log.first)
                         {
                             glob_grd.valnom = cs[offset].val;
                             gradcn(nparam, offset, x + 1, cs[offset].grad + 1, constr,
                                    cd);
                         }
                         continue;
                     }
                 }
                 else
                 {
                     if (cs[offset].val >= -epsilon && cs[offset].val >
                         cs[offset-1].val && cs[offset].val >=
                         cs[offset+1].val)
                     {
                         cs[offset].act_sip = TRUE;
                         glob_info.tot_actg_sip++;
                         if (cs[offset].mult == 0.e0 && !glob_log.first)
                         {
                             glob_grd.valnom = cs[offset].val;
                             gradcn(nparam, offset, x + 1, cs[offset].grad + 1, constr,
                                    cd);
                         }
                         continue;
                     }
                 }
                 if (cs[offset].val >= -glob_grd.epsmac)
                 {
                     cs[offset].act_sip = TRUE;
                     glob_info.tot_actg_sip++;
                     if (cs[offset].mult == 0.e0 && !glob_log.first)
                     {
                         glob_grd.valnom = cs[offset].val;
                         gradcn(nparam, offset, x + 1, cs[offset].grad + 1, constr, cd);
                     }
                     continue;
                 }
                 if (cs[offset].mult > 0.e0)
                 {
                     cs[offset].act_sip = TRUE;
                     glob_info.tot_actg_sip++;
                 }
                 /* Add if binding for d1  */
                 if (cs[offset].d1bind)
                 {
                     cs[offset].act_sip = TRUE;
                     glob_info.tot_actg_sip++;
                     if (cs[offset].mult == 0.e0 && !glob_log.first)
                     {
                         glob_grd.valnom = cs[offset].val;
                         gradcn(nparam, offset, x + 1, cs[offset].grad + 1, constr, cd);
                     }
                 }
 
             }
         }
     }

◆ if() [50/102]

if ( ncsipl ! = 0 )

Definition at line 5814 of file numerical_recipes.cpp.

     {
         /* Don't need to get gradients */
         offset = nineq - ncsipl;
         for (i = 1; i <= glob_info.ncsipl; i++)
         {
             if (feasb)
                 index = glob_info.nfsip + glob_info.ncsipn + i;
             else
                 index = glob_info.ncsipn + i;
             for (j = 1; j <= mesh_pts[index]; j++)
             {
                 offset++;
                 if (j == 1)
                 {
                     if (cs[offset].val >= -epsilon &&
                         cs[offset].val >= cs[offset+1].val)
                     {
                         cs[offset].act_sip = TRUE;
                         glob_info.tot_actg_sip++;
                         continue;
                     }
                 }
                 else
                     if (j == mesh_pts[index])
                     {
                         if (cs[offset].val >= -epsilon &&
                             cs[offset].val > cs[offset-1].val)
                         {
                             cs[offset].act_sip = TRUE;
                             glob_info.tot_actg_sip++;
                             continue;
                         }
                     }
                     else
                     {
                         if (cs[offset].val >= -epsilon && cs[offset].val >
                             cs[offset-1].val && cs[offset].val >=
                             cs[offset+1].val)
                         {
                             cs[offset].act_sip = TRUE;
                             glob_info.tot_actg_sip++;
                             continue;
                         }
                     }
                 if (cs[offset].val >= -glob_grd.epsmac ||
                     cs[offset].mult > 0.e0 || cs[offset].d1bind)
                 {
                     cs[offset].act_sip = TRUE;
                     glob_info.tot_actg_sip++;
                 }
             }
         }
     }

◆ if() [51/102]

if ( glob_log. first ) = FALSE

Definition at line 5871 of file numerical_recipes.cpp.

     {
         if (feasb)
         {
             offset = nineqn - ncsipn;
             for (i = 1; i <= glob_info.ncsipn; i++)
             {
                 i_max = ++offset;
                 g_max = cs[i_max].val;
                 if (!cs[i_max].act_sip)
                 { /* add first point       */
                     cs[i_max].act_sip = TRUE;
                     glob_info.tot_actg_sip++;
                 }
                 for (j = 2;j <= mesh_pts[glob_info.nfsip+i];j++)
                 {
                     offset++;
                     if (cs[offset].val > g_max)
                     {
                         i_max = offset;
                         g_max = cs[i_max].val;
                     }
                 }
                 if (!cs[i_max].act_sip)
                 {
                     cs[i_max].act_sip = TRUE;
                     glob_info.tot_actg_sip++;
                 }
                 if (!cs[offset].act_sip)
                 { /* add last point          */
                     cs[offset].act_sip = TRUE;
                     glob_info.tot_actg_sip++;
                 }
             }
         }
         offset = nineq - ncsipl;
         for (i = 1; i <= glob_info.ncsipl; i++)
         {
             i_max = ++offset;
             g_max = cs[i_max].val;
             if (!cs[i_max].act_sip)
             { /* add first point       */
                 cs[i_max].act_sip = TRUE;
                 glob_info.tot_actg_sip++;
             }
             if (feasb)
                 index = glob_info.nfsip + glob_info.ncsipn + i;
             else
                 index = glob_info.ncsipn + i;
             for (j = 2;j <= mesh_pts[index]; j++)
             {
                 offset++;
                 if (cs[offset].val > g_max)
                 {
                     i_max = offset;
                     g_max = cs[i_max].val;
                 }
             }
             if (!cs[i_max].act_sip)
             {
                 cs[i_max].act_sip = TRUE;
                 glob_info.tot_actg_sip++;
             }
             if (!cs[offset].act_sip)
             { /* add last point          */
                 cs[offset].act_sip = TRUE;
                 glob_info.tot_actg_sip++;
             }
         }
     }

◆ if() [52/102]

if ( steps< 1.e0 &&viol-> type = = CONSTR )

Definition at line 5943 of file numerical_recipes.cpp.

     {
         i = viol->index;
         if (!cs[i].act_sip)
         {
             cs[i].act_sip = TRUE;
             glob_info.tot_actg_sip++;
         }
     }

◆ if() [53/102]

if ( glob_prnt.iprint >=2 && display )

◆ if() [54/102]

if ( nfsip )

Definition at line 5965 of file numerical_recipes.cpp.

     {
         offset = nob - nfsip;
         if (feasb)
             index = glob_info.nfsip;
         else
             index = glob_info.ncsipn;
         for (i = 1; i <= index; i++)
         {
             for (j = 1; j <= mesh_pts[i]; j++)
             {
                 offset++;
                 if (nobL > nob)
                 {
                     fnow = fabs(ob[offset].val);
                     fmult = DMAX1(fabs(ob[offset].mult),
                                   fabs(ob[offset].mult_L));
                 }
                 else
                 {
                     fnow = ob[offset].val;
                     fmult = ob[offset].mult;
                 }
                 if (j == 1)
                 {
                     if (nobL > nob)
                         fnext = fabs(ob[offset+1].val);
                     else
                         fnext = ob[offset+1].val;
                     if ((fnow >= fmax - epsilon) && fnow >= fnext)
                     {
                         ob[offset].act_sip = TRUE;
                         glob_info.tot_actf_sip++;
                         if (fmult == 0.e0 && !glob_log.first)
                         {
                             glob_grd.valnom = ob[offset].val;
                             if (feasb)
                                 gradob(nparam, offset, x + 1,
                                        ob[offset].grad + 1, obj, cd);
                             else
                                 gradcn(nparam, offset, x + 1, ob[offset].grad + 1,
                                        constr, cd);
                         }
                         continue;
                     }
                 }
                 else if (j == mesh_pts[i])
                 {
                     if (nobL > nob)
                         fprev = fabs(ob[offset-1].val);
                     else
                         fprev = ob[offset-1].val;
                     if ((fnow >= fmax - epsilon) && fnow > fprev)
                     {
                         ob[offset].act_sip = TRUE;
                         glob_info.tot_actf_sip++;
                         if (fmult == 0.e0 && !glob_log.first)
                         {
                             glob_grd.valnom = ob[offset].val;
                             if (feasb)
                                 gradob(nparam, offset, x + 1,
                                        ob[offset].grad + 1, obj, cd);
                             else
                                 gradcn(nparam, offset, x + 1, ob[offset].grad + 1,
                                        constr, cd);
                         }
                         continue;
                     }
                 }
                 else
                 {
                     if (nobL > nob)
                     {
                         fprev = fabs(ob[offset-1].val);
                         fnext = fabs(ob[offset+1].val);
                     }
                     else
                     {
                         fprev = ob[offset-1].val;
                         fnext = ob[offset+1].val;
                     }
                     if ((fnow >= fmax - epsilon) && fnow > fprev &&
                         fnow >= fnext)
                     {
                         ob[offset].act_sip = TRUE;
                         glob_info.tot_actf_sip++;
                         if (fmult == 0.e0 && !glob_log.first)
                         {
                             glob_grd.valnom = ob[offset].val;
                             if (feasb)
                                 gradob(nparam, offset, x + 1,
                                        ob[offset].grad + 1, obj, cd);
                             else
                                 gradcn(nparam, offset, x + 1, ob[offset].grad + 1,
                                        constr, cd);
                         }
                         continue;
                     }
                 }
                 if (fnow >= fmax - glob_grd.epsmac && !ob[offset].act_sip)
                 {
                     ob[offset].act_sip = TRUE;
                     glob_info.tot_actf_sip++;
                     if (fmult == 0.e0 && !glob_log.first)
                     {
                         glob_grd.valnom = ob[offset].val;
                         if (feasb)
                             gradob(nparam, offset, x + 1,
                                    ob[offset].grad + 1, obj, cd);
                         else
                             gradcn(nparam, offset, x + 1, ob[offset].grad + 1,
                                    constr, cd);
                     }
                     continue;
                 }
                 if (fmult != 0.e0 && !ob[offset].act_sip)
                 {
                     ob[offset].act_sip = TRUE;
                     glob_info.tot_actf_sip++;
                     continue;
                 }
             }
         }
         /* Addition of objectives for first iteration.          */
         /* Current heuristics: maximizers and end-points        */
         if (glob_log.first)
         {
             offset = nob - nfsip;
             if (feasb)
                 index = glob_info.nfsip;
             else
                 index = glob_info.ncsipn;
             for (i = 1; i <= index; i++)
             {
                 i_max = ++offset;
                 if (nobL == nob)
                     g_max = ob[i_max].val;
                 else
                     g_max = fabs(ob[i_max].val);
                 if (!ob[i_max].act_sip)
                 { /* add first point       */
                     ob[i_max].act_sip = TRUE;
                     glob_info.tot_actf_sip++;
                 }
                 for (j = 2;j <= mesh_pts[i];j++)
                 {
                     offset++;
                     if (nobL == nob)
                         fnow = ob[offset].val;
                     else
                         fnow = fabs(ob[offset].val);
                     if (fnow > g_max)
                     {
                         i_max = offset;
                         g_max = fnow;
                     }
                 }
                 if (!ob[i_max].act_sip)
                 {
                     ob[i_max].act_sip = TRUE;
                     glob_info.tot_actf_sip++;
                 }
                 if (!ob[offset].act_sip)
                 { /* add last point          */
                     ob[offset].act_sip = TRUE;
                     glob_info.tot_actf_sip++;
                 }
             }
         }
 
         /* If necessary, append omega_bar            */
         if (steps < 1.e0 && viol->type == OBJECT)
         {
             i = viol->index;
             if (!ob[i].act_sip)
             {
                 ob[i].act_sip = TRUE;
                 glob_info.tot_actf_sip++;
             }
         }
         if (glob_prnt.iprint >= 2 && display)
             fprintf(glob_prnt.io, " |Omega_k| for f %26d\n",
                     glob_info.tot_actf_sip);
     }

◆ if() [55/102]

if ( nobL<= 1 )

Definition at line 6233 of file numerical_recipes.cpp.

     {
         nqprm0 = nparam;
         nclin0 = ncnstr;
     }

◆ if() [56/102]

if ( infoqp ! = 0 )

Definition at line 6271 of file numerical_recipes.cpp.

     {
         glob_prnt.info = 5;
         if (!feasb)
             glob_prnt.info = 2;
         nstop = 0;
         free_dv(adummy);
         return;
     }

◆ if() [57/102]

if	(	nn	,
		1
	)

Definition at line 6283 of file numerical_recipes.cpp.

     {
         j = 1;
         k = nn;
         for (i = nn; i >= 1; i--)
         {
             if (fuscmp(cs[indxcn[i]].mult, thrshd))
             {
                 iact[j] = indxcn[i];
                 j++;
             }
             else
             {
                 iact[k] = indxcn[i];
                 k--;
             }
         }
     }

◆ if() [58/102]

if	(	nobL	,
		1
	)

Definition at line 6301 of file numerical_recipes.cpp.

     {
         j = nn + 1;
         k = nn + nob;
         for (i = nob; i >= 1; i--)
         {
             kk = nqprm0 + ncnstr;
             ltem1 = fuscmp(ob[i].mult, thrshd);
             ltem2 = (nobL != nob) && (fuscmp(ob[i].mult_L, thrshd));
             if (ltem1 || ltem2)
             {
                 iact[j] = i;
                 j++;
             }
             else
             {
                 iact[k] = i;
                 k--;
             }
         }
     }

◆ if() [59/102]

if	(	nob	,
		0
	)

◆ if() [60/102]

if ( glob_log.first && nclin0 = = 0 )

Definition at line 6325 of file numerical_recipes.cpp.

     {
         dx = sqrt(scaprd(nparam, param->x, param->x));
         dmx = DMAX1(dx, 1.e0);
         if (*d0nm > dmx)
         {
             for (i = 1; i <= nparam; i++)
                 di[i] = di[i] * dmx / (*d0nm);
             *d0nm = dmx;
         }
     }

◆ if() [61/102]

if ( nn = = 0 )

Definition at line 6401 of file numerical_recipes.cpp.

     {
         for (i = 1; i <= nparam; i++)
             d[i] = 0.e0;
         dnmtil = 0.e0;
         free_dv(adummy);
         return;
     }

◆ if() [62/102]

if ( ((*d0nm<=epskt)||((gLgeps > 0.e0) &&(*sktnom<=gLgeps))) &&(neqn==0||*scvneq<=epseqn) )

Definition at line 6340 of file numerical_recipes.cpp.

     {
         /* We are finished! */
         nstop = 0;
         if (feasb && glob_log.first && neqn != 0)
         {
             /*  Finished, but still need to estimate nonlinear equality
                 constraint multipliers   */
             glob_log.get_ne_mult = TRUE;
             glob_log.d0_is0 = TRUE;
         }
         if (!feasb)
             glob_prnt.info = 2;
         free_dv(adummy);
         if (glob_prnt.iprint < 3 || !display)
             return;
         if (nobL <= 1)
             nff = 1;
         if (nobL > 1)
             nff = 2;
         sbout1(glob_prnt.io, nparam, "multipliers for x   ", dummy,
                param->mult, 2, 2);
         if (ncnstr != 0)
         {
             fprintf(glob_prnt.io, "\t\t\t %s\t %22.14e\n",
                     "           for g    ", cs[1].mult);
             for (j = 2; j <= ncnstr; j++)
                 fprintf(glob_prnt.io, " \t\t\t\t\t\t %22.14e\n", cs[j].mult);
         }
         if (nobL > 1)
         {
             fprintf(glob_prnt.io, "\t\t\t %s\t %22.14e\n",
                     "           for f    ", ob[1].mult);
             for (j = 2; j <= nob; j++)
                 fprintf(glob_prnt.io, " \t\t\t\t\t\t %22.14e\n", ob[j].mult);
         }
         return;
     }

◆ if() [63/102]

if ( glob_prnt.iprint >=3 && display )

Definition at line 6379 of file numerical_recipes.cpp.

     {
         sbout1(glob_prnt.io, nparam, "d0                  ", dummy, di, 2, 2);
         sbout1(glob_prnt.io, 0, "d0norm              ", *d0nm, adummy, 1, 2);
         sbout1(glob_prnt.io, 0, "ktnorm              ", *sktnom, adummy, 1, 2);
     }

◆ if() [64/102]

if	(	neqn !	= `0 && d0nm <= DMIN1(0.5e0epskt, (0.1e-1)glob_grd.rteps) && scvneq`,
		epseqn
	)

Definition at line 6385 of file numerical_recipes.cpp.

     {
         /* d0 is "zero", but equality constraints not satisfied  */
         glob_log.d0_is0 = TRUE;
         return;
     }

◆ if() [65/102]

if ( nn ! = 0 )

◆ if() [66/102]

if ( glob_info. mode = = 1 )

Definition at line 6421 of file numerical_recipes.cpp.

     {
         vk = DMIN1(Ck * (*d0nm) * (*d0nm), *d0nm);
         need_d1 = FALSE;
         for (i = 1; i <= nn; i++)
         {
             tempv = cs[indxcn[i]].grad;
             grdgd0 = scaprd(nparam, tempv, di);
             temp1 = vk + cs[indxcn[i]].val + grdgd0;
             if (temp1 > 0.e0)
             {
                 need_d1 = TRUE;
                 break;
             }
         }
     }

◆ if() [67/102]

if ( need_d1 )

Definition at line 6437 of file numerical_recipes.cpp.

     {
         nqprm1 = nparam + 1;
         if (glob_info.mode == 0)
             nclin1 = ncnstr + DMAX1(nobL, 1);
         if (glob_info.mode == 1)
             nclin1 = ncnstr;
         nrowa1 = DMAX1(nclin1, 1);
         ninq = glob_info.nnineq;
         di1(nparam, nqprm1, nob, nobL, nfsip, nineqn, neq, neqn, ncnstr,
             ncsipl, ncsipn, nrowa1, &infoqp, glob_info.mode,
             param, di, ob, *fmax, grdpsf, cs, cvec, bl, bu, clamda,
             hess1, d, *steps);
         if (infoqp != 0)
         {
             glob_prnt.info = 6;
             if (!feasb)
                 glob_prnt.info = 2;
             nstop = 0;
             free_dv(adummy);
             return;
         }
         dnm1 = sqrt(scaprd(nparam, d, d));
         if (glob_prnt.iprint >= 3 && display)
         {
             sbout1(glob_prnt.io, nparam, "d1                  ", dummy, d, 2, 2);
             sbout1(glob_prnt.io, 0, "d1norm              ", dnm1, adummy, 1, 2);
         }
     }

◆ if() [68/102]

if ( rhol = = 0.e0 )

Definition at line 6508 of file numerical_recipes.cpp.

         {
             rhog = rho = 0.e0;
             dnm = *d0nm;
             goto L310;
         }

◆ if() [69/102]

if ( nob = =1 )

◆ if() [70/102]

if ( temp1<=0. e0 )

◆ if() [71/102]

if ( !(glob_prnt.iprint< 3||glob_info.mode==1||nn==0) && display )

Definition at line 6546 of file numerical_recipes.cpp.

     {
         sbout1(glob_prnt.io, 0, "rho                 ", rho, adummy, 1, 2);
         sbout1(glob_prnt.io, nparam, "d                   ", dummy, di, 2, 2);
         sbout1(glob_prnt.io, 0, "dnorm               ", dnm, adummy, 1, 2);
     }

◆ if() [72/102]

if ( rho ! = rhog )

pure virtual

◆ if() [73/102]

if ( (neqn !=0) &&(feasb) )

◆ if() [74/102]

if ( ncg ! = 0 )

◆ if() [75/102]

if ( job = =1 )

◆ if() [76/102]

if ( nobL = = 1 )

Definition at line 6898 of file numerical_recipes.cpp.

     {
         for (i = 1; i <= nparam; i++)
             cvec[i] = cvec[i] + ob[1].grad[i];
     }

◆ if() [77/102]

if ( ncsipl+ ncsipn )

Definition at line 7149 of file numerical_recipes.cpp.

     {
         for (i = 1; i <= ncnstr_used; i++)
             if (clamda[i] > 0.e0)
                 cs[iw_hold[i]].d1bind = TRUE;
     }

◆ if() [78/102]

if	(	nctotl	,
		nqnp
	)

Definition at line 6989 of file numerical_recipes.cpp.

     {                         /* Objectives    */
         for (i = 1; i <= numf_used; i++)
         {
             ij = ncnstr_used + i;
             if (nobL != nob)
             {
                 ii = k - 2 * numf_used + i;
                 ob[iw_hold[ij]].mult = clamda[ii] - clamda[ii+numf_used];
                 ob[iw_hold[ij]].mult_L = clamda[ii+numf_used];
             }
             else
             {
                 ii = k - numf_used + i;
                 ob[iw_hold[ij]].mult = clamda[ii];
             }
         }
     }

◆ if() [79/102]

if ( (ncsipl+ncsipn) ! = 0 )

◆ if() [80/102]

if ( mode = =0 ) = 3.e0

pure virtual

◆ if() [81/102]

if ( mode ! = 1 )

Definition at line 7095 of file numerical_recipes.cpp.

     {
         numf_used = nob - nfsip + glob_info.tot_actf_sip;
         for (i = 1; i <= nob; i++)
         {
             if ((i <= nob - nfsip) || ob[i].act_sip)
             {
                 k++;
                 bj[k] = fmax - ob[i].val;
                 for (j = 1; j <= nparam; j++)
                 {
                     a[k][j] = -ob[i].grad[j] + grdpsf[j];
                     if (nobL > nob)
                         a[k+numf_used][j] = ob[i].grad[j] + grdpsf[j];
                 }
                 a[k][nqpram] = 1.e0;
                 if (nobL > nob)
                     a[k+numf_used][nqpram] = 1.e0;
             }
         }
         if (nob == 0)
         {
             k++;
             bj[k] = fmax;
             for (j = 1; j <= nparam; j++)
                 a[k][j] = grdpsf[j];
             a[k][nqpram] = 1.e0;
         }
     }

◆ if() [82/102]

if	(	nobL	,
		nob
	)

◆ if() [83/102]

if ( !glob_log. get_ne_mult )

Definition at line 7614 of file numerical_recipes.cpp.

     {
         if (feasb && nstop && !neqn)
             if ((fabs(w[1] - fmax) <= objeps) ||
                 (fabs(w[1] - fmax) <= objrep*fabs(w[1])))
                 nstop = 0;
         if (!nstop)
         {
             for (i = 1; i <= nparam; i++)
                 param->x[i] = xnew[i];
             x_is_new = TRUE;
             return;
         }
     }

◆ if() [84/102]

if ( neqn ! = 0 && (feasb) )

Definition at line 7785 of file numerical_recipes.cpp.

     {
         i = glob_info.nnineq - nineqn;
         if (i != 0)
         {
             for (j = 1; j <= nparam; j++)
             {
                 gamma[j] = 0.e0;
                 for (k = 1; k <= i; k++)
                     gamma[j] = gamma[j] + cs[k+nineqn].grad[j] *
                                cs[nineqn+k].mult;
             }
             for (i = 1; i <= nparam; i++)
                 psb[i] = psb[i] + gamma[i];
         }
         i = neq - neqn;
         if (i != 0)
         {
             for (j = 1; j <= nparam; j++)
             {
                 gamma[j] = 0.e0;
                 for (k = 1; k <= i; k++)
                     gamma[j] = gamma[j] + cs[k+neqn+glob_info.nnineq].grad[j] *
                                cs[glob_info.nnineq+neqn+k].mult;
             }
             for (i = 1; i <= nparam; i++)
                 psb[i] = psb[i] + gamma[i];
         }
         /* Update penalty parameters for nonlinear equality constraints */
         estlam(nparam, neqn, &ifail, bgbnd, phess, delta, eta,
                gamma, cs, psb, hd, xnew, psmu);
         if (glob_log.get_ne_mult)
             return;
         for (i = 1; i <= neqn; i++)
         {
             if (ifail != 0 || glob_log.d0_is0)
                 penp[i] = 2.e0 * penp[i];
             else
             {
                 etad = psmu[i] + penp[i];
                 if (etad < 1.e0)
                     penp[i] = DMAX1((1.e0 - psmu[i]), (2.e0 * penp[i]));
             }
             if (penp[i] > bgbnd)
             {
                 nstop = 0;
                 glob_prnt.info = 9;
                 return;
             }
         }
         resign(nparam, neqn, psf, grdpsf, penp, cs, signeq, 20, 12);
         *fMp = *fM - *psf;
     }

◆ if() [85/102]

if ( nfs ! = 0 )

Definition at line 7838 of file numerical_recipes.cpp.

     {
         (*nstart)++;
         np = indexs(*nstart, nfs);
         span[np] = fmax;
         for (i = 1; i <= neqn; i++)
             gm[(np-1)*neqn+i] = cs[glob_info.nnineq+i].val;
         if (neqn != 0)
         {
             psfnew = 0.e0;
             for (i = 1; i <= neqn; i++)
                 psfnew = psfnew + gm[i]*penp[i];
         }
         *fM = span[1];
         *fMp = span[1] - psfnew;
         mnm = DMIN1(*nstart, nfs);
         for (i = 2; i <= mnm; i++)
         {
             if (neqn != 0)
             {
                 psfnew = 0.e0;
                 for (j = 1; j <= neqn; j++)
                     psfnew = psfnew + gm[(i-1)*neqn +j]*penp[j];
             }
             *fM = DMAX1(*fM, span[i]);
             *fMp = DMAX1(*fMp, span[i] - psfnew);
         }
     }

◆ if() [86/102]

objective if ( ncnstr ! = 0 )

Definition at line 7883 of file numerical_recipes.cpp.

     {
         for (i = 1; i <= ncnstr; i++)
         {
             tempv = cs[indxcn[i]].grad;
             sbout2(glob_prnt.io, nparam, indxcn[i], "gradg(j,", ")", tempv);
         }
         if (neqn != 0)
         {
             sbout1(glob_prnt.io, nparam, "grdpsf(j)           ",
                    dummy, grdpsf, 2, 2);
             sbout1(glob_prnt.io, neqn, "P                   ", dummy,
                    penp, 2, 2);
             sbout1(glob_prnt.io, neqn, "psmu                ", dummy,
                    psmu, 2, 2);
         }
     }

◆ if() [87/102]

if ( glob_prnt.iter >=miter &&nstop ! = 0 )

Definition at line 7954 of file numerical_recipes.cpp.

     {
         glob_prnt.info = 3;
         nstop = 0;
         if (glob_prnt.iprint == 0)
             goto L9000;
     }

◆ if() [88/102]

if ( (glob_prnt.info > 0 &&glob_prnt.info< 3)||glob_prnt. info = =7 )

◆ if() [89/102]

if ( glob_prnt.iprint<=2 && nstop = = 0 )

◆ if() [90/102]

if ( ! (glob_prnt.iter) % glob_prnt.iter_mod )

◆ if() [91/102]

if ( glob_prnt.iter_mod ! = 1 && display )

◆ if() [92/102]

if ( display )

Definition at line 8080 of file numerical_recipes.cpp.

     {
         if (nob > 0)
         {
             fprintf(glob_prnt.io, " objectives\n");
             for (i = 1; i <= nob - nfsip; i++)
             {
                 if (nob == nobL)
                     fprintf(glob_prnt.io, " \t\t\t %22.14e\n", ob[i].val);
                 else
                     fprintf(glob_prnt.io, " \t\t\t %22.14e\n",
                             fabs(ob[i].val));
             }
         }
         if (nfsip)
         {
             offset = nob - nfsip;
             if (feasb)
                 index = glob_info.nfsip;
             else
                 index = glob_info.ncsipn;
             for (i = 1; i <= index; i++)
             {
                 if (nob == nobL)
                     gmax = ob[++offset].val;
                 else
                     gmax = fabs(ob[++offset].val);
                 for (j = 2; j <= mesh_pts[i]; j++)
                 {
                     offset++;
                     if (nob == nobL && ob[offset].val > gmax)
                         gmax = ob[offset].val;
                     else if (nob != nobL && fabs(ob[offset].val) > gmax)
                         gmax = fabs(ob[offset].val);
                 }
                 fprintf(glob_prnt.io, " \t\t\t %22.14e\n", gmax);
             }
         }
     }

◆ if() [93/102]

if	(	glob_info.	mode = `= 1 && glob_prnt.iter`,
		1 &&	display
	)

◆ if() [94/102]

objective if	(	nob	,
		1 &&	display
	)

◆ if() [95/102]

if ( glob_prnt.iter<=1 && display )

Definition at line 8177 of file numerical_recipes.cpp.

     {
         fprintf(glob_prnt.io, " \n");
         fprintf(glob_prnt.io, " iteration           %26d\n",
                 glob_prnt.iter);
         goto L9000;
     }

◆ if() [96/102]

if ( glob_prnt.iprint >=2 &&glob_prnt. initvl = = 0 && display )

◆ if() [97/102]

if ( glob_prnt.iprint >=3 &&glob_prnt.iter_mod ! = 1 && nstop != 0 && !(glob_prnt.iter % glob_prnt.iter_mod) )

◆ if() [98/102]

if ( nstop ! = 0 && (glob_prnt.iter_mod == 1) )

◆ if() [99/102]

if ( glob_prnt.iprint >= 3 )

◆ if() [100/102]

if	(	glob_prnt.	info = `= 0 && sktnom`,
		0.	1e0
	)

◆ if() [101/102]

if ( fabs(val)<= thrshd )

◆ if() [102/102]

if ( isign >= 0 )

Definition at line 9189 of file numerical_recipes.cpp.

     {
         for (ii = 1, i = 1;i <= n;i += 2, ii++)
         {
             ni = i + nmod + wfilt.ioff;
             nj = i + nmod + wfilt.joff;
             double &aux1=wksp[ii];
             double &aux2=wksp[ii+nh];
             unsigned long kmax=4*(wfilt.ncof/4);
             // Loop unrolling (every 4 coefficients)
             for (k = 1;k <= kmax;k+=4)
             {
                 unsigned long k_1=k+1;
                 unsigned long k_2=k+2;
                 unsigned long k_3=k+3;
                 jf = n1 & (ni + k);
                 jr = n1 & (nj + k);
                 aux1 += wfilt.cc[k] * a[jf+1];
                 aux2 += wfilt.cr[k] * a[jr+1];
                 unsigned long jf_1 = n1 & (ni + k_1);
                 unsigned long jr_1 = n1 & (nj + k_1);
                 aux1 += wfilt.cc[k_1] * a[jf_1+1];
                 aux2 += wfilt.cr[k_1] * a[jr_1+1];
                 unsigned long jf_2 = n1 & (ni + k_2);
                 unsigned long jr_2 = n1 & (nj + k_2);
                 aux1 += wfilt.cc[k_2] * a[jf_2+1];
                 aux2 += wfilt.cr[k_2] * a[jr_2+1];
                 unsigned long jf_3 = n1 & (ni + k_3);
                 unsigned long jr_3 = n1 & (nj + k_3);
                 aux1 += wfilt.cc[k_3] * a[jf_3+1];
                 aux2 += wfilt.cr[k_3] * a[jr_3+1];
             }
             // The rest of coefficients
             for (k = kmax+1;k <= wfilt.ncof;++k)
             {
                 jf = n1 & (ni + k);
                 jr = n1 & (nj + k);
                 aux1 += wfilt.cc[k] * a[jf+1];
                 aux2 += wfilt.cr[k] * a[jr+1];
             }
         }
     }

◆ indexx()

void indexx	(	int	n,
		double	arrin[],
		int	indx[]
	)

Definition at line 206 of file numerical_recipes.cpp.

 {
     int l, j, ir, indxt, i;
     double q;
 
     for (j = 1;j <= n;j++)
         indx[j] = j;
     l = (n >> 1) + 1;
     ir = n;
     for (;;)
     {
         if (l > 1)
             q = arrin[(indxt=indx[--l])];
         else
         {
             q = arrin[(indxt=indx[ir])];
             indx[ir] = indx[1];
             if (--ir == 1)
             {
                 indx[1] = indxt;
                 return;
             }
         }
         i = l;
         j = l << 1;
         while (j <= ir)
         {
             if (j < ir && arrin[indx[j]] < arrin[indx[j+1]])
                 j++;
             if (q < arrin[indx[j]])
             {
                 indx[i] = indx[j];
                 j += (i = j);
             }
             else
                 j = ir + 1;
         }
         indx[i] = indxt;
     }
 }

◆ k()

ql0001_& k ( htemp+ 1 ) &

◆ ksone()

void ksone	(	double	data[],
		int	n,
		double(*)(double)	func,
		double *	d,
		double *	prob
	)

Definition at line 165 of file numerical_recipes.cpp.

 {
     std::sort(data, data + n);
     double fn, ff, en, dt, fo=0.;
     en = (double)n;
     *d = 0.;
     for (int j=1; j<=n; j++)
     {
         fn = j / en;
         ff = (*func)(data[j]);
         dt = XMIPP_MAX(fabs(fo - ff), fabs(fn - ff));
         if (dt> *d)
             *d = dt;
         fo = fn;
     }
     *prob = probks(sqrt(en)*(*d));
 }

◆ linmin()

void linmin	(	double *	p,
		double *	xi,
		int	n,
		double &	fret,
		double()(double , void *)	func,
		void *	prm
	)

Definition at line 848 of file numerical_recipes.cpp.

 {
     int j;
     double xx, xmin, fx, fb, fa, bx, ax;
 
     int ncom = n;
     std::vector<double> buffer(2*n);
     auto *pcom= buffer.data()-1;
     auto *xicom= pcom + n;
     for (j = 1;j <= n;j++)
     {
         pcom[j] = p[j];
         xicom[j] = xi[j];
     }
     ax = 0.0;
     xx = 1.0;
     bx = 2.0;
     mnbrak(&ax, &xx, &bx, &fa, &fx, &fb, func, prm, ncom, pcom, xicom);
     fret = brent(ax, xx, bx, func, prm, TOL, &xmin, ncom, pcom, xicom);
     for (j = 1;j <= n;j++)
     {
         xi[j] *= xmin;
         p[j] += xi[j];
     }
 }

◆ matrcp()

matrcp	(	nparam	,
		hess	,
		nparam+	1,
		hess1
	)

◆ matrvc()

matrvc	(	nparam	,
		nparam	,
		hess	,
		di	,
		w
	)

◆ mnbrak()

void mnbrak	(	double *	ax,
		double *	bx,
		double *	cx,
		double *	fa,
		double *	fb,
		double *	fc,
		double()(double , void *)	func,
		void *	prm,
		int	ncom,
		double *	pcom,
		double *	xicom
	)

Definition at line 679 of file numerical_recipes.cpp.

 {
     double ulim, u, r, q, fu, dum;
     std::vector<double> buffer(ncom);
     auto *xt= buffer.data()-1;
 
     F1DIM(*ax,*fa);
     F1DIM(*bx,*fb);
     if (*fb > *fa)
     {
         SHFT(dum, *ax, *bx, dum)
         SHFT(dum, *fb, *fa, dum)
     }
     *cx = (*bx) + GOLD * (*bx - *ax);
     F1DIM(*cx,*fc);
     while (*fb > *fc)
     {
         r = (*bx - *ax) * (*fb - *fc);
         q = (*bx - *cx) * (*fb - *fa);
         u = (*bx) - ((*bx - *cx) * q - (*bx - *ax) * r) /
             (2.0 * SIGN(MAX(fabs(q - r), TINY), q - r));
         ulim = (*bx) + GLIMIT * (*cx - *bx);
         if ((*bx - u)*(u - *cx) > 0.0)
         {
             F1DIM(u,fu);
             if (fu < *fc)
             {
                 *ax = (*bx);
                 *bx = u;
                 *fa = (*fb);
                 *fb = fu;
                 return;
             }
             else if (fu > *fb)
             {
                 *cx = u;
                 *fc = fu;
                 return;
             }
             u = (*cx) + GOLD * (*cx - *bx);
             F1DIM(u,fu);
         }
         else if ((*cx - u)*(u - ulim) > 0.0)
         {
             F1DIM(u,fu);
             if (fu < *fc)
             {
                 SHFT(*bx, *cx, u, *cx + GOLD*(*cx - *bx))
                 double aux;
                 F1DIM(u,aux);
                 SHFT(*fb, *fc, fu, aux)
             }
         }
         else if ((u - ulim)*(ulim - *cx) >= 0.0)
         {
             u = ulim;
             F1DIM(u,fu);
         }
         else
         {
             u = (*cx) + GOLD * (*cx - *bx);
             F1DIM(u,fu);
         }
         SHFT(*ax, *bx, *cx, u)
         SHFT(*fa, *fb, *fc, fu)
     }
 }

◆ nnls()

int nnls	(	double *	a,
		int	m,
		int	n,
		double *	b,
		double *	x,
		double *	rnorm,
		double *	wp,
		double *	zzp,
		int *	indexp
	)

Definition at line 1165 of file numerical_recipes.cpp.

 {
     int pfeas, ret = 0, iz, jz, iz1, iz2, npp1, *index;
     double d1, d2, sm, up, ss, *w, *zz;
     int iter, k, j = 0, l, itmax, izmax = 0, nsetp, ii, jj = 0, ip;
     double temp, wmax, t, alpha, asave, dummy, unorm, ztest, cc;
 
 
     /* Check the parameters and data */
     if (m <= 0 || n <= 0 || a == NULL || b == NULL || x == NULL)
         return(2);
     /* Allocate memory for working space, if required */
     if (wp != NULL)
         w = wp;
     else
         w = (double*)calloc(n, sizeof(double));
     if (zzp != NULL)
         zz = zzp;
     else
         zz = (double*)calloc(m, sizeof(double));
     if (indexp != NULL)
         index = indexp;
     else
         index = (int*)calloc(n, sizeof(int));
     if (w == NULL || zz == NULL || index == NULL)
         return(2);
 
     /* Initialize the arrays INDEX[] and X[] */
     for (k = 0; k < n; k++)
     {
         x[k] = 0.;
         index[k] = k;
     }
     iz2 = n - 1;
     iz1 = 0;
     nsetp = 0;
     npp1 = 0;
 
     /* Main loop; quit if all coeffs are already in the solution or */
     /* if M cols of A have been triangularized */
     iter = 0;
     itmax = n * 3;
     while (iz1 <= iz2 && nsetp < m)
     {
         /* Compute components of the dual (negative gradient) vector W[] */
         for (iz = iz1; iz <= iz2; iz++)
         {
             j = index[iz];
             sm = 0.;
             for (l = npp1; l < m; l++)
                 sm += a[j*m+l] * b[l];
             w[j] = sm;
         }
 
         while (1)
         {
             /* Find largest positive W[j] */
             for (wmax = 0., iz = iz1; iz <= iz2; iz++)
             {
                 j = index[iz];
                 if (w[j] > wmax)
                 {
                     wmax = w[j];
                     izmax = iz;
                 }
             }
 
             /* Terminate if wmax<=0.; */
             /* it indicates satisfaction of the Kuhn-Tucker conditions */
             if (wmax <= 0.0)
                 break;
             iz = izmax;
             j = index[iz];
 
             /* The sign of W[j] is ok for j to be moved to set P. */
             /* Begin the transformation and check new diagonal element to avoid */
             /* near linear dependence. */
             asave = a[j*m+npp1];
             _nnls_h12(1, npp1, npp1 + 1, m, &a[j*m+0], 1, &up, &dummy, 1, 1, 0);
             unorm = 0.;
             if (nsetp != 0)
                 for (l = 0; l < nsetp; l++)
                 {
                     d1 = a[j*m+l];
                     unorm += d1 * d1;
                 }
             unorm = sqrt(unorm);
             d2 = unorm + (d1 = a[j*m+npp1], fabs(d1)) * 0.01;
             if ((d2 - unorm) > 0.)
             {
                 /* Col j is sufficiently independent. Copy B into ZZ, update ZZ */
                 /* and solve for ztest ( = proposed new value for X[j] ) */
                 for (l = 0; l < m; l++)
                     zz[l] = b[l];
                 _nnls_h12(2, npp1, npp1 + 1, m, &a[j*m+0], 1, &up, zz, 1, 1, 1);
                 ztest = zz[npp1] / a[j*m+npp1];
                 /* See if ztest is positive */
                 if (ztest > 0.)
                     break;
             }
 
             /* Reject j as a candidate to be moved from set Z to set P. Restore */
             /* A[npp1,j], set W[j]=0., and loop back to test dual coeffs again */
             a[j*m+npp1] = asave;
             w[j] = 0.;
         } /* while(1) */
         if (wmax <= 0.0)
             break;
 
         /* Index j=INDEX[iz] has been selected to be moved from set Z to set P. */
         /* Update B and indices, apply householder transformations to cols in */
         /* new set Z, zero subdiagonal elts in col j, set W[j]=0. */
         for (l = 0; l < m; ++l)
             b[l] = zz[l];
         index[iz] = index[iz1];
         index[iz1] = j;
         iz1++;
         nsetp = npp1 + 1;
         npp1++;
         if (iz1 <= iz2)
             for (jz = iz1; jz <= iz2; jz++)
             {
                 jj = index[jz];
                 _nnls_h12(2, nsetp - 1, npp1, m, &a[j*m+0], 1, &up,
                           &a[jj*m+0], 1, m, 1);
             }
         if (nsetp != m)
             for (l = npp1; l < m; l++)
                 a[j*m+l] = 0.;
         w[j] = 0.;
         /* Solve the triangular system; store the solution temporarily in Z[] */
         for (l = 0; l < nsetp; l++)
         {
             ip = nsetp - (l + 1);
             if (l != 0)
                 for (ii = 0; ii <= ip; ii++)
                     zz[ii] -= a[jj*m+ii] * zz[ip+1];
             jj = index[ip];
             zz[ip] /= a[jj*m+ip];
         }
 
         /* Secondary loop begins here */
         while (++iter < itmax)
         {
             /* See if all new constrained coeffs are feasible; if not, compute alpha */
             for (alpha = 2.0, ip = 0; ip < nsetp; ip++)
             {
                 l = index[ip];
                 if (zz[ip] <= 0.)
                 {
                     t = -x[l] / (zz[ip] - x[l]);
                     if (alpha > t)
                     {
                         alpha = t;
                         jj = ip - 1;
                     }
                 }
             }
 
             /* If all new constrained coeffs are feasible then still alpha==2. */
             /* If so, then exit from the secondary loop to main loop */
             if (alpha == 2.0)
                 break;
             /* Use alpha (0.<alpha<1.) to interpolate between old X and new ZZ */
             for (ip = 0; ip < nsetp; ip++)
             {
                 l = index[ip];
                 x[l] += alpha * (zz[ip] - x[l]);
             }
 
             /* Modify A and B and the INDEX arrays to move coefficient i */
             /* from set P to set Z. */
             k = index[jj+1];
             pfeas = 1;
             do
             {
                 x[k] = 0.;
                 if (jj != (nsetp - 1))
                 {
                     jj++;
                     for (j = jj + 1; j < nsetp; j++)
                     {
                         ii = index[j];
                         index[j-1] = ii;
                         _nnls_g1(a[ii*m+j-1], a[ii*m+j], &cc, &ss, &a[ii*m+j-1]);
                         for (a[ii*m+j] = 0., l = 0; l < n; l++)
                             if (l != ii)
                             {
                                 /* Apply procedure G2 (CC,SS,A(J-1,L),A(J,L)) */
                                 temp = a[l*m+j-1];
                                 a[l*m+j-1] = cc * temp + ss * a[l*m+j];
                                 a[l*m+j] = -ss * temp + cc * a[l*m+j];
                             }
                         /* Apply procedure G2 (CC,SS,B(J-1),B(J)) */
                         temp = b[j-1];
                         b[j-1] = cc * temp + ss * b[j];
                         b[j] = -ss * temp + cc * b[j];
                     }
                 }
                 npp1 = nsetp - 1;
                 nsetp--;
                 iz1--;
                 index[iz1] = k;
 
                 /* See if the remaining coeffs in set P are feasible; they should */
                 /* be because of the way alpha was determined. If any are */
                 /* infeasible it is due to round-off error. Any that are */
                 /* nonpositive will be set to zero and moved from set P to set Z */
                 for (jj = 0; jj < nsetp; jj++)
                 {
                     k = index[jj];
                     if (x[k] <= 0.)
                     {
                         pfeas = 0;
                         break;
                     }
                 }
             }
             while (pfeas == 0);
 
             /* Copy B[] into zz[], then solve again and loop back */
             for (k = 0; k < m; k++)
                 zz[k] = b[k];
             for (l = 0; l < nsetp; l++)
             {
                 ip = nsetp - (l + 1);
                 if (l != 0)
                     for (ii = 0; ii <= ip; ii++)
                         zz[ii] -= a[jj*m+ii] * zz[ip+1];
                 jj = index[ip];
                 zz[ip] /= a[jj*m+ip];
             }
         } /* end of secondary loop */
         if (iter > itmax)
         {
             ret = 1;
             break;
         }
         for (ip = 0; ip < nsetp; ip++)
         {
             k = index[ip];
             x[k] = zz[ip];
         }
     } /* end of main loop */
     /* Compute the norm of the final residual vector */
     sm = 0.;
     if (npp1 < m)
         for (k = npp1; k < m; k++)
             sm += (b[k] * b[k]);
     else
         for (j = 0; j < n; j++)
             w[j] = 0.;
     *rnorm = sqrt(sm);
     /* Free working space, if it was allocated here */
     if (wp == NULL)
         free(w);
     if (zzp == NULL)
         free(zz);
     if (indexp == NULL)
         free(index);
     return(ret);
 } /* nnls_ */

◆ nnlsWght()

int nnlsWght	(	int	N,
		int	M,
		double *	A,
		double *	b,
		double *	weight
	)

Definition at line 1455 of file numerical_recipes.cpp.

 {
     int n, m;
     double *w;
 
     /* Check the arguments */
     if (N < 1 || M < 1 || A == NULL || b == NULL || weight == NULL)
         return(1);
 
     /* Allocate memory */
     w = (double*)malloc(M * sizeof(double));
     if (w == NULL)
         return(2);
 
     /* Check that weights are not zero and get the square roots of them to w[] */
     for (m = 0; m < M; m++)
     {
         if (weight[m] <= 1.0e-20)
             w[m] = 0.0;
         else
             w[m] = sqrt(weight[m]);
     }
 
     /* Multiply rows of matrix A and elements of vector b with weights*/
     for (m = 0; m < M; m++)
     {
         for (n = 0; n < N; n++)
         {
             A[n*M+m] *= w[m];
         }
         b[m] *= w[m];
     }
 
     free(w);
     return(0);
 }

◆ nrerror()

void nrerror ( const char error_text[] )

Definition at line 35 of file numerical_recipes.cpp.

 {
     fprintf(stderr, "Numerical Recipes run-time error...\n");
     fprintf(stderr, "%s\n", error_text);
     fprintf(stderr, "...now exiting to system...\n");
     exit(1);
 }

◆ nullvc() [1/6]

nullvc	(	nparam	,
		grdpsf
	)

◆ nullvc() [2/6]

nullvc	(	nparam	,
		cvec
	)

◆ nullvc() [3/6]

nullvc	(	nqpram	,
		x
	)

◆ nullvc() [4/6]

nullvc	(	nqpram	,
		param->	mult
	)

◆ nullvc() [5/6]

nullvc	(	nparam	,
		delta
	)

◆ nullvc() [6/6]

nullvc	(	nparam	,
		eta
	)

◆ polint()

void polint	(	double *	xa,
		double *	ya,
		int	n,
		double	x,
		double &	y,
		double &	dy
	)

Definition at line 9390 of file numerical_recipes.cpp.

 {
     int i, m, ns = 1;
     double den, dif, dift, ho, hp, w;
     dif = fabs(x - xa[1]);
     std::vector<double> buffer(2*n);
     auto *c= buffer.data()-1;
     auto *d= c + n;
     for (i = 1;i <= n;i++)
     {
         if ((dift = fabs(x - xa[i])) < dif)
         {
             ns = i;
             dif = dift;
         }
         c[i] = ya[i];
         d[i] = ya[i];
     }
     y = ya[ns--];
     for (m = 1;m < n;m++)
     {
         for (i = 1;i <= n - m;i++)
         {
             ho = xa[i] - x;
             hp = xa[i+m] - x;
             w = c[i+1] - d[i];
             if ((den = ho - hp) == 0.0)
             {
                 nrerror("error in routine polint\n");
             }
             den = w / den;
             d[i] = hp * den;
             c[i] = ho * den;
         }
         y += (dy = (2 * ns < (n - m) ? c[ns+1] : d[ns--]));
     }
 }

◆ powell()

void powell	(	double *	p,
		double *	xi,
		int	n,
		double	ftol,
		int &	iter,
		double &	fret,
		double()(double , void *)	func,
		void *	prm,
		bool	show
	)

Definition at line 877 of file numerical_recipes.cpp.

 {
     int i, ibig, j;
     double t, fptt, fp, del;
     std::vector<double> buffer(3*n);
     auto *pt= buffer.data()-1;
     auto *ptt= pt + n;
     auto *xit= ptt + n;
     bool   different_from_0;
 
     fret = (*func)(p,prm);
     for (j = 1;j <= n;j++)
         pt[j] = p[j];
 
     for (iter = 1;;(iter)++)
     {
         /* By coss ----- */
         if (show)
         {
             std::cout << iter << " (" << p[1];
             for (int co = 2; co <= n; co++)
                 std::cout << "," << p[co];
             std::cout << ")--->" << fret << std::endl;
         }
         /* ------------- */
 
         fp = fret;
         ibig = 0;
         del = 0.0;
         for (i = 1;i <= n;i++)
         {
             different_from_0 = false; // CO
             for (j = 1;j <= n;j++)
             {
                 xit[j] = xi[j*n+i];
                 if (xit[j] != 0)
                     different_from_0 = true;
             }
             if (different_from_0)
             {
                 fptt = fret;
                 linmin(p, xit, n, fret, func, prm);
                 if (fabs(fptt - fret) > del)
                 {
                     del = fabs(fptt - fret);
                     ibig = i;
                 }
                 /* By coss ----- */
                 if (show)
                 {
                     std::cout << "   (";
                     if (i == 1)
                         std::cout << "***";
                     std::cout << p[1];
                     for (int co = 2; co <= n; co++)
                     {
                         std::cout << ",";
                         if (co == i)
                             std::cout << "***";
                         std::cout << p[co];
                     }
                     std::cout << ")--->" << fret << std::endl;
                 }
                 /* ------------- */
             }
         }
         if (2.0*fabs(fp - fret) <= ftol*(fabs(fp) + fabs(fret)) || n==1) return;
         if (iter == ITMAX)
             nrerror("Too many iterations in routine POWELL");
         for (j = 1;j <= n;j++)
         {
             ptt[j] = 2.0 * p[j] - pt[j];
             xit[j] = p[j] - pt[j];
             pt[j] = p[j];
         }
         fptt = (*func)(ptt,prm);
         if (fptt < fp)
         {
 #define SQR(a) ((a)*(a))
             t = 2.0 * (fp - 2.0 * fret + fptt) * SQR(fp - fret - del) - del * SQR(fp - fptt);
             if (t < 0.0)
             {
                 linmin(p, xit, n, fret, func, prm);
                 for (j = 1;j <= n;j++)
                     xi[j*n+ibig] = xit[j];
             }
         }
     }
 }

◆ probks()

double probks ( double alam )

Definition at line 184 of file numerical_recipes.cpp.

 {
     int j;
     double a2, fac=2.0, sum=0.0, term, termbf=0.0;
     double EPS1=0.001, EPS2=1.0e-8;
 
     a2 = -2.0 * alam * alam;
     for (j = 1; j<= 100; j++)
     {
         term = fac * exp(a2*j*j);
         sum += term;
         if (fabs(term) <= EPS1*termbf || fabs(term) <= EPS2*sum)
             return sum;
         fac = -fac;
         termbf = fabs(term);
     }
     return 1.0;
 
 }

◆ Pythag()

double Pythag	(	double	a,
		double	b
	)

Definition at line 1495 of file numerical_recipes.cpp.

 {
     double absa, absb;
     absa = fabs(a);
     absb = fabs(b);
     if (absb < absa)
         return(absa * sqrt(1.0 + absb * absb / (absa * absa)));
     else
         return((absb == 0.0) ? (0.0) : (absb * sqrt(1.0 + absa * absa / (absb * absb))));
 }

◆ ql0001_() [1/2]

int ql0001_	(	m	,
		me	,
		mmax	,
		n	,
		nmax	,
		mnn	,
		c	,
		d	,
		a	,
		b	,
		xl	,
		xu	,
		x	,
		u	,
		iout	,
		ifail	,
		iprint	,
		war	,
		lwar	,
		iwar	,
		liwar	,
		eps1
	)

◆ ql0001_() [2/2]

int ql0001_ ( )

◆ ql0002_() [1/3]

int ql0002_ ( )

◆ ql0002_() [2/3]

ql0002_	(	n	,
		m	,
		me	,
		mmax	,
		&	mn,
		mnn	,
		nmax	,
		&	lql,
		&	a[a_offset],
		&	war[inw1],
		&	d[1],
		&	c[c_offset],
		&	xl[1],
		&	xu[1],
		&	x[1],
		&	nact,
		&	iwar[1],
		&	maxit,
		&	qpeps,
		&	info,
		&	diag,
		&	war[inw2],
		&	lw
	)

◆ ql0002_() [3/3]

int ql0002_	(	n	,
		m	,
		meq	,
		mmax	,
		mn	,
		mnn	,
		nmax	,
		lql	,
		a	,
		b	,
		grad	,
		g	,
		xl	,
		xu	,
		x	,
		nact	,
		iact	,
		maxit	,
		vsmall	,
		info	,
		diag	,
		w	,
		lw
	)

◆ ran1()

double ran1 ( int * idum )

Definition at line 58 of file numerical_recipes.cpp.

 {
     static long ix1, ix2, ix3;
     static double r[98];
     double temp;
     static int iff = 0;
     int j;
 
     if (*idum < 0 || iff == 0)
     {
         iff = 1;
         ix1 = (IC1 - (*idum)) % M1;
         ix1 = (IA1 * ix1 + IC1) % M1;
         ix2 = ix1 % M2;
         ix1 = (IA1 * ix1 + IC1) % M1;
         ix3 = ix1 % M3;
         for (j = 1;j <= 97;j++)
         {
             ix1 = (IA1 * ix1 + IC1) % M1;
             ix2 = (IA2 * ix2 + IC2) % M2;
             r[j] = (ix1 + ix2 * RM2) * RM1;
         }
         *idum = 1;
     }
     ix1 = (IA1 * ix1 + IC1) % M1;
     ix2 = (IA2 * ix2 + IC2) % M2;
     ix3 = (IA3 * ix3 + IC3) % M3;
     j = 1 + ((97 * ix3) / M3);
     if (j > 97 || j < 1)
         nrerror("RAN1: This cannot happen.");
     temp = r[j];
     r[j] = (ix1 + ix2 * RM2) * RM1;
     return temp;
 }

◆ sbout1()

sbout1	(	glob_prnt.	io,
		nparam	,
		"multipliers for x "	,
		dummy	,
		param->	mult,
		2	,
		2
	)

◆ svbksb()

void svbksb	(	double *	u,
		double *	w,
		double *	v,
		int	m,
		int	n,
		double *	b,
		double *	x
	)

Definition at line 1791 of file numerical_recipes.cpp.

 {
     int jj, j, i;
     double s;
 
     std::vector<double> buffer(n);
     auto *tmp= buffer.data()-1;
     for (j = 1;j <= n;j++)
     {
         s = 0.0;
         if (w[j])
         {
             for (i = 1;i <= m;i++)
                 s += u[i*n+j] * b[i];
             s /= w[j];
         }
         tmp[j] = s;
     }
     for (j = 1;j <= n;j++)
     {
         s = 0.0;
         for (jj = 1;jj <= n;jj++)
             s += v[j*n+jj] * tmp[jj];
         x[j] = s;
     }
 }

◆ svdcmp()

void svdcmp	(	double *	U,
		int	Lines,
		int	Columns,
		double *	W,
		double *	V
	)

Definition at line 1507 of file numerical_recipes.cpp.

 {
     double Norm, Scale;
     double c, f, g, h, s;
     double x, y, z;
     long i, its, j, jj, k, l = 0L, nm = 0L;
     bool    Flag;
     int     MaxIterations = SVDMAXITER;
 
     std::vector<double> buffer(Columns*Columns);
     auto *rv1= buffer.data();
     g = Scale = Norm = 0.0;
     for (i = 0L; (i < Columns); i++)
     {
         l = i + 1L;
         rv1[i] = Scale * g;
         g = s = Scale = 0.0;
         if (i < Lines)
         {
             for (k = i; (k < Lines); k++)
             {
                 Scale += fabs(U[k * Columns + i]);
             }
             if (Scale != 0.0)
             {
                 for (k = i; (k < Lines); k++)
                 {
                     U[k * Columns + i] /= Scale;
                     s += U[k * Columns + i] * U[k * Columns + i];
                 }
                 f = U[i * Columns + i];
                 g = (0.0 <= f) ? (-sqrt(s)) : (sqrt(s));
                 h = f * g - s;
                 U[i * Columns + i] = f - g;
                 for (j = l; (j < Columns); j++)
                 {
                     for (s = 0.0, k = i; (k < Lines); k++)
                     {
                         s += U[k * Columns + i] * U[k * Columns + j];
                     }
                     f = s / h;
                     for (k = i; (k < Lines); k++)
                     {
                         U[k * Columns + j] += f * U[k * Columns + i];
                     }
                 }
                 for (k = i; (k < Lines); k++)
                 {
                     U[k * Columns + i] *= Scale;
                 }
             }
         }
         W[i] = Scale * g;
         g = s = Scale = 0.0;
         if ((i < Lines) && (i != (Columns - 1L)))
         {
             for (k = l; (k < Columns); k++)
             {
                 Scale += fabs(U[i * Columns + k]);
             }
             if (Scale != 0.0)
             {
                 for (k = l; (k < Columns); k++)
                 {
                     U[i * Columns + k] /= Scale;
                     s += U[i * Columns + k] * U[i * Columns + k];
                 }
                 f = U[i * Columns + l];
                 g = (0.0 <= f) ? (-sqrt(s)) : (sqrt(s));
                 h = f * g - s;
                 U[i * Columns + l] = f - g;
                 for (k = l; (k < Columns); k++)
                 {
                     rv1[k] = U[i * Columns + k] / h;
                 }
                 for (j = l; (j < Lines); j++)
                 {
                     for (s = 0.0, k = l; (k < Columns); k++)
                     {
                         s += U[j * Columns + k] * U[i * Columns + k];
                     }
                     for (k = l; (k < Columns); k++)
                     {
                         U[j * Columns + k] += s * rv1[k];
                     }
                 }
                 for (k = l; (k < Columns); k++)
                 {
                     U[i * Columns + k] *= Scale;
                 }
             }
         }
         Norm = ((fabs(W[i]) + fabs(rv1[i])) < Norm) ? (Norm) : (fabs(W[i]) + fabs(rv1[i]));
     }
     for (i = Columns - 1L; (0L <= i); i--)
     {
         if (i < (Columns - 1L))
         {
             if (g != 0.0)
             {
                 for (j = l; (j < Columns); j++)
                 {
                     V[j * Columns + i] = U[i * Columns + j] / (U[i * Columns + l] * g);
                 }
                 for (j = l; (j < Columns); j++)
                 {
                     for (s = 0.0, k = l; (k < Columns); k++)
                     {
                         s += U[i * Columns + k] * V[k * Columns + j];
                     }
                     for (k = l; (k < Columns); k++)
                     {
                         if (s != 0.0)
                         {
                             V[k * Columns + j] += s * V[k * Columns + i];
                         }
                     }
                 }
             }
             for (j = l; (j < Columns); j++)
             {
                 V[i * Columns + j] = V[j * Columns + i] = 0.0;
             }
         }
         V[i * Columns + i] = 1.0;
         g = rv1[i];
         l = i;
     }
     for (i = (Lines < Columns) ? (Lines - 1L) : (Columns - 1L); (0L <= i); i--)
     {
         l = i + 1L;
         g = W[i];
         for (j = l; (j < Columns); j++)
         {
             U[i * Columns + j] = 0.0;
         }
         if (g != 0.0)
         {
             g = 1.0 / g;
             for (j = l; (j < Columns); j++)
             {
                 for (s = 0.0, k = l; (k < Lines); k++)
                 {
                     s += U[k * Columns + i] * U[k * Columns + j];
                 }
                 f = s * g / U[i * Columns + i];
                 for (k = i; (k < Lines); k++)
                 {
                     if (f != 0.0)
                     {
                         U[k * Columns + j] += f * U[k * Columns + i];
                     }
                 }
             }
             for (j = i; (j < Lines); j++)
             {
                 U[j * Columns + i] *= g;
             }
         }
         else
         {
             for (j = i; (j < Lines); j++)
             {
                 U[j * Columns + i] = 0.0;
             }
         }
         U[i * Columns + i] += 1.0;
     }
     for (k = Columns - 1L; (0L <= k); k--)
     {
         for (its = 1L; (its <= MaxIterations); its++)
         {
             Flag = true;
             for (l = k; (0L <= l); l--)
             {
                 nm = l - 1L;
                 if ((fabs(rv1[l]) + Norm) == Norm)
                 {
                     Flag = false;
                     break;
                 }
                 if ((fabs(W[nm]) + Norm) == Norm)
                 {
                     break;
                 }
             }
             if (Flag)
             {
                 c = 0.0;
                 s = 1.0;
                 for (i = l; (i <= k); i++)
                 {
                     f = s * rv1[i];
                     rv1[i] *= c;
                     if ((fabs(f) + Norm) == Norm)
                     {
                         break;
                     }
                     g = W[i];
                     h = Pythag(f, g);
                     W[i] = h;
                     h = 1.0 / h;
                     c = g * h;
                     s = -f * h;
                     for (j = 0L; (j < Lines); j++)
                     {
                         y = U[j * Columns + nm];
                         z = U[j * Columns + i];
                         U[j * Columns + nm] = y * c + z * s;
                         U[j * Columns + i] = z * c - y * s;
                     }
                 }
             }
             z = W[k];
             if (l == k)
             {
                 if (z < 0.0)
                 {
                     W[k] = -z;
                     for (j = 0L; (j < Columns); j++)
                     {
                         V[j * Columns + k] = -V[j * Columns + k];
                     }
                 }
                 break;
             }
             if (its == MaxIterations) return;
             x = W[l];
             nm = k - 1L;
             y = W[nm];
             g = rv1[nm];
             h = rv1[k];
             f = ((y - z) * (y + z) + (g - h) * (g + h)) / (2.0 * h * y);
             g = Pythag(f, 1.0);
             f = ((x - z) * (x + z) + h * ((y / (f + ((0.0 <= f) ? (fabs(g))
                                                 : (-fabs(g))))) - h)) / x;
             c = s = 1.0;
             for (j = l; (j <= nm); j++)
             {
                 i = j + 1L;
                 g = rv1[i];
                 y = W[i];
                 h = s * g;
                 g = c * g;
                 z = Pythag(f, h);
                 rv1[j] = z;
                 c = f / z;
                 s = h / z;
                 f = x * c + g * s;
                 g = g * c - x * s;
                 h = y * s;
                 y *= c;
                 for (jj = 0L; (jj < Columns); jj++)
                 {
                     x = V[jj * Columns + j];
                     z = V[jj * Columns + i];
                     V[jj * Columns + j] = x * c + z * s;
                     V[jj * Columns + i] = z * c - x * s;
                 }
                 z = Pythag(f, h);
                 W[j] = z;
                 if (z != 0.0)
                 {
                     z = 1.0 / z;
                     c = f * z;
                     s = h * z;
                 }
                 f = c * g + s * y;
                 x = c * y - s * g;
                 for (jj = 0L; (jj < Lines); jj++)
                 {
                     y = U[jj * Columns + j];
                     z = U[jj * Columns + i];
                     U[jj * Columns + j] = y * c + z * s;
                     U[jj * Columns + i] = z * c - y * s;
                 }
             }
             rv1[l] = 0.0;
             rv1[k] = f;
             W[k] = x;
         }
     }
 }

◆ switch()

switch ( (int) mflag )

Definition at line 3986 of file numerical_recipes.cpp.

     {
     case 1:
         goto L250;
     case 2:
         goto L610;
     }

◆ tdev()

double tdev	(	double	nu,
		int *	idum
	)

Definition at line 136 of file numerical_recipes.cpp.

 {
     static int iset = 0;
     static double gset;
     double fac, r, v1, v2;
 
     if (iset == 0)
     {
         do
         {
             v1 = 2.0 * ran1(idum) - 1.0;
             v2 = 2.0 * ran1(idum) - 1.0;
             r = v1 * v1 + v2 * v2;
         }
         while (r >= 1.0);
         fac = sqrt(nu*(pow(r,-2.0/nu) -1.0)/r);
         gset = v1 * fac;
         iset = 1;
         return v2*fac;
     }
     else
     {
         iset = 0;
         return gset;
     }
 }

◆ temp3()

ql0001_& temp3 ( htemp+ 1 ) &

◆ while()

while	(	mm	,
		nfs
	)

◆ zero()

ql0001_& zero ( ctemp+ 1 ) &

Variable Documentation

◆ pad0

L20 __pad0__

Definition at line 2317 of file numerical_recipes.cpp.

◆ pad10

L90 __pad10__

Definition at line 2714 of file numerical_recipes.cpp.

◆ pad11

L140 __pad11__

Definition at line 2756 of file numerical_recipes.cpp.

◆ pad12

L150 __pad12__

Definition at line 2760 of file numerical_recipes.cpp.

◆ pad13

L165 __pad13__

Definition at line 2786 of file numerical_recipes.cpp.

◆ pad14

L170 __pad14__

Definition at line 2802 of file numerical_recipes.cpp.

◆ pad15

L230 __pad15__

Definition at line 2860 of file numerical_recipes.cpp.

◆ pad16

L250 __pad16__

Definition at line 2909 of file numerical_recipes.cpp.

◆ pad17

L280 __pad17__

Definition at line 2992 of file numerical_recipes.cpp.

◆ pad18

L340 __pad18__

Definition at line 3070 of file numerical_recipes.cpp.

◆ pad19

L350 __pad19__

Definition at line 3075 of file numerical_recipes.cpp.

◆ pad1

L30 __pad1__

Definition at line 2375 of file numerical_recipes.cpp.

◆ pad20

L380 __pad20__

Definition at line 3107 of file numerical_recipes.cpp.

◆ pad21

L390 __pad21__

Definition at line 3110 of file numerical_recipes.cpp.

◆ pad22

L410 __pad22__

Definition at line 3122 of file numerical_recipes.cpp.

◆ pad23

L420 __pad23__

Definition at line 3127 of file numerical_recipes.cpp.

◆ pad24

L430 __pad24__

Definition at line 3136 of file numerical_recipes.cpp.

◆ pad25

L440 __pad25__

Definition at line 3151 of file numerical_recipes.cpp.

◆ pad26

L450 __pad26__

Definition at line 3159 of file numerical_recipes.cpp.

◆ pad27

L481 __pad27__

Definition at line 3212 of file numerical_recipes.cpp.

◆ pad28

L510 __pad28__

Definition at line 3334 of file numerical_recipes.cpp.

◆ pad29

L530 __pad29__

Definition at line 3347 of file numerical_recipes.cpp.

◆ pad2

L70 __pad2__

Definition at line 2380 of file numerical_recipes.cpp.

◆ pad30

L531 __pad30__

Definition at line 3355 of file numerical_recipes.cpp.

◆ pad31

L541 __pad31__

Definition at line 3369 of file numerical_recipes.cpp.

◆ pad32

L545 __pad32__

Definition at line 3394 of file numerical_recipes.cpp.

◆ pad33

L549 __pad33__

Definition at line 3408 of file numerical_recipes.cpp.

◆ pad34

L550 __pad34__

Definition at line 3411 of file numerical_recipes.cpp.

◆ pad35

L560 __pad35__

Definition at line 3427 of file numerical_recipes.cpp.

◆ pad36

L5 __pad36__

Definition at line 3464 of file numerical_recipes.cpp.

◆ pad37

L567 __pad37__

Definition at line 3487 of file numerical_recipes.cpp.

◆ pad38

L570 __pad38__

Definition at line 3490 of file numerical_recipes.cpp.

◆ pad39

L571 __pad39__

Definition at line 3498 of file numerical_recipes.cpp.

◆ pad3

L80 __pad3__

Definition at line 2396 of file numerical_recipes.cpp.

◆ pad40

L574 __pad40__

Definition at line 3559 of file numerical_recipes.cpp.

◆ pad41

L580 __pad41__

Definition at line 3632 of file numerical_recipes.cpp.

◆ pad42

L590 __pad42__

Definition at line 3645 of file numerical_recipes.cpp.

◆ pad43

L601 __pad43__

Definition at line 3663 of file numerical_recipes.cpp.

◆ pad44

L610 __pad44__

Definition at line 3674 of file numerical_recipes.cpp.

◆ pad45

L630 __pad45__

Definition at line 3690 of file numerical_recipes.cpp.

◆ pad46

L640 __pad46__

Definition at line 3692 of file numerical_recipes.cpp.

◆ pad47

L650 __pad47__

Definition at line 3708 of file numerical_recipes.cpp.

◆ pad48

L660 __pad48__

Definition at line 3727 of file numerical_recipes.cpp.

◆ pad49

L680 __pad49__

Definition at line 3744 of file numerical_recipes.cpp.

◆ pad4

L81 __pad4__

Definition at line 2406 of file numerical_recipes.cpp.

◆ pad50

L690 __pad50__

Definition at line 3762 of file numerical_recipes.cpp.

◆ pad51

L700 __pad51__

Definition at line 3779 of file numerical_recipes.cpp.

◆ pad52

L710 __pad52__

Definition at line 3790 of file numerical_recipes.cpp.

◆ pad53

L730 __pad53__

Definition at line 3800 of file numerical_recipes.cpp.

◆ pad54

L740 __pad54__

Definition at line 3814 of file numerical_recipes.cpp.

◆ pad55

L750 __pad55__

Definition at line 3819 of file numerical_recipes.cpp.

◆ pad56

L761 __pad56__

Definition at line 3834 of file numerical_recipes.cpp.

◆ pad57

L770 __pad57__

Definition at line 3837 of file numerical_recipes.cpp.

◆ pad58

L775 __pad58__

Definition at line 3856 of file numerical_recipes.cpp.

◆ pad59

L791 __pad59__

Definition at line 3892 of file numerical_recipes.cpp.

◆ pad5

L82 __pad5__

Definition at line 2416 of file numerical_recipes.cpp.

◆ pad60

case __pad60__

Definition at line 3894 of file numerical_recipes.cpp.

◆ pad61

L800 __pad61__

Definition at line 3905 of file numerical_recipes.cpp.

◆ pad62

L810 __pad62__

Definition at line 3922 of file numerical_recipes.cpp.

◆ pad63

L850 __pad63__

Definition at line 3985 of file numerical_recipes.cpp.

◆ pad64

L860 __pad64__

Definition at line 4003 of file numerical_recipes.cpp.

◆ pad65

L870 __pad65__

Definition at line 4005 of file numerical_recipes.cpp.

◆ pad66

L880 __pad66__

Definition at line 4007 of file numerical_recipes.cpp.

◆ pad67

L900 __pad67__

Definition at line 4043 of file numerical_recipes.cpp.

◆ pad68

case __pad68__

Definition at line 4045 of file numerical_recipes.cpp.

◆ pad69

L910 __pad69__

Definition at line 4056 of file numerical_recipes.cpp.

◆ pad6

L40 __pad6__

Definition at line 2426 of file numerical_recipes.cpp.

◆ pad70

L930 __pad70__

Definition at line 4094 of file numerical_recipes.cpp.

◆ pad71

L510 __pad71__

Definition at line 4824 of file numerical_recipes.cpp.

◆ pad72

L310 __pad72__

Definition at line 6553 of file numerical_recipes.cpp.

◆ pad73

L1500 __pad73__

Definition at line 7556 of file numerical_recipes.cpp.

◆ pad74

L120 __pad74__

Definition at line 8208 of file numerical_recipes.cpp.

◆ pad75

Warning __pad75__

Definition at line 8218 of file numerical_recipes.cpp.

◆ pad76

nError __pad76__

Definition at line 8233 of file numerical_recipes.cpp.

◆ pad77

nError __pad77__

Definition at line 8236 of file numerical_recipes.cpp.

◆ pad78

L9000 __pad78__

Definition at line 8253 of file numerical_recipes.cpp.

◆ pad7

L90 __pad7__

Definition at line 2437 of file numerical_recipes.cpp.

◆ pad8

L45 __pad8__

Definition at line 2648 of file numerical_recipes.cpp.

◆ pad9

L70 __pad9__

Definition at line 2701 of file numerical_recipes.cpp.

◆ _param

struct _parameter _param

Definition at line 4639 of file numerical_recipes.cpp.

◆ _viol

struct _violation _viol

Definition at line 5173 of file numerical_recipes.cpp.

◆ a

double * a = a_offset

Definition at line 2230 of file numerical_recipes.cpp.

◆ a_dim1

a_dim1 = *mmax

Definition at line 2264 of file numerical_recipes.cpp.

◆ a_offset

a_offset = a_dim1 + 1

Definition at line 2265 of file numerical_recipes.cpp.

◆ adummy

objective adummy = make_dv(1)

Definition at line 6214 of file numerical_recipes.cpp.

◆ atemp

double * atemp = convert(a, nrowa, nqpram)

Definition at line 5580 of file numerical_recipes.cpp.

◆ b

static void ** b

Definition at line 2230 of file numerical_recipes.cpp.

◆ backup

double * backup = make_dv(nob + ncnstr)

Definition at line 5168 of file numerical_recipes.cpp.

◆ bgbnd

bgbnd = bigbnd

Definition at line 4177 of file numerical_recipes.cpp.

◆ bigbnd

double bigbnd

Definition at line 4413 of file numerical_recipes.cpp.

◆ bj

double * bj = make_dv(nclin)

Definition at line 5583 of file numerical_recipes.cpp.

◆ bl

double * bl = bl[i]

Definition at line 4414 of file numerical_recipes.cpp.

◆ bli

double bli

Initial value:

{

int i

i

#define i

Definition: numerical_recipes.cpp:2493

Definition at line 5467 of file numerical_recipes.cpp.

◆ bu

double * bu = bu[i]

Definition at line 4414 of file numerical_recipes.cpp.

◆ bui

double bui

Definition at line 5467 of file numerical_recipes.cpp.

◆ c

c = c_offset

Definition at line 2230 of file numerical_recipes.cpp.

◆ c_dim1

c_dim1 = *nmax

Definition at line 2268 of file numerical_recipes.cpp.

◆ c_offset

c_offset = c_dim1 + 1

Definition at line 2269 of file numerical_recipes.cpp.

◆ Cbar

double Cbar

Definition at line 5166 of file numerical_recipes.cpp.

◆ cd

void * cd = cd

Definition at line 4416 of file numerical_recipes.cpp.

◆ Ck

double Ck = Cbar = 1.e-2

Definition at line 5166 of file numerical_recipes.cpp.

◆ clamda

double * clamda = make_dv(nctotl + nparam + 1)

Definition at line 5168 of file numerical_recipes.cpp.

◆ cmache_

struct Tcmache cmache_

◆ col

int col

Definition at line 8467 of file numerical_recipes.cpp.

◆ constr

void(* constr)()

Definition at line 4415 of file numerical_recipes.cpp.

◆ cs

struct _constraint * cs

Definition at line 4636 of file numerical_recipes.cpp.

◆ ctemp

ctemp

Initial value:

{

int i, j, zero, one, lwar2, mnn, iout

i

#define i

Definition: numerical_recipes.cpp:2493

lwar2

Definition: numerical_recipes.cpp:8447

j

#define j

Definition: numerical_recipes.cpp:2493

iout

integer * iout

Definition: numerical_recipes.cpp:2231

mnn

int * mnn

Definition: numerical_recipes.cpp:2229

zero

ql0001_ & zero(ctemp+1),(cvec+1),(a+1),(b+1),(bl+1),(bu+1),(x+1),(w+1), &iout, ifail, &zero,(w+3), &lwar2,(iw+1), &leniw, &glob_grd.epsmac

Definition at line 8425 of file numerical_recipes.cpp.

◆ cvec

double * cvec = make_dv(nparam + 1)

Definition at line 5168 of file numerical_recipes.cpp.

◆ d

double * d = make_dv(nparam + 1)

Definition at line 2230 of file numerical_recipes.cpp.

◆ d0

double* d0

Definition at line 7033 of file numerical_recipes.cpp.

◆ d0_is0

glob_log d0_is0 = FALSE

Definition at line 6267 of file numerical_recipes.cpp.

◆ d0nm

* d0nm = 0.e0

Definition at line 5166 of file numerical_recipes.cpp.

◆ d0norm

double d0norm

Definition at line 7942 of file numerical_recipes.cpp.

◆ d__1

d__1

Initial value:

{
    
    integer a_dim1, a_offset, g_dim1, g_offset, i__1, i__2, i__3, i__4

Definition at line 2480 of file numerical_recipes.cpp.

◆ d__2

d__2 = w[ir] / temp

Definition at line 2480 of file numerical_recipes.cpp.

◆ d__3

d__3 = (d__1 = w[ir - 1], abs(d__1))

Definition at line 2480 of file numerical_recipes.cpp.

◆ d__4

d__4 = (d__2 = w[ir], abs(d__2))

Definition at line 2480 of file numerical_recipes.cpp.

◆ dbar

dbar = 5.e0

Definition at line 5166 of file numerical_recipes.cpp.

◆ delta

double delta

Definition at line 7597 of file numerical_recipes.cpp.

◆ delta_s

delta_s = glob_grd.rteps

Definition at line 7607 of file numerical_recipes.cpp.

◆ deriv

directional deriv

Definition at line 7217 of file numerical_recipes.cpp.

◆ dhd

double dhd

Initial value:

{

int i, j, k, ifail, np, mnm, done, display

display

else display

Definition: numerical_recipes.cpp:5712

done

Definition: numerical_recipes.cpp:7636

i

#define i

Definition: numerical_recipes.cpp:2493

k

ql0001_ & k(htemp+1),(cvec+1),(atemp+1),(bj+1),(bl+1),(bu+1),(x+1),(clamda+1), &iout, infoqp, &zero,(w+1), &lenw,(iw+1), &leniw, &glob_grd.epsmac

j

#define j

Definition: numerical_recipes.cpp:2493

ifail

integer * ifail

Definition: numerical_recipes.cpp:2231

Definition at line 7605 of file numerical_recipes.cpp.

◆ di

double * di = make_dv(nparam + 1)

Definition at line 5168 of file numerical_recipes.cpp.

◆ display

else display = TRUE

Definition at line 5712 of file numerical_recipes.cpp.

◆ dmx

double dmx

Definition at line 6210 of file numerical_recipes.cpp.

◆ dnm

dnm = sqrt(scaprd(nparam, di, di))

Definition at line 6210 of file numerical_recipes.cpp.

◆ dnm1

double dnm1

Definition at line 6210 of file numerical_recipes.cpp.

◆ dnmtil

double dnmtil

Definition at line 6214 of file numerical_recipes.cpp.

◆ done

done = FALSE

Definition at line 7636 of file numerical_recipes.cpp.

◆ dummy

double dummy = 0.e0

Definition at line 4635 of file numerical_recipes.cpp.

◆ dx

double dx

Definition at line 6210 of file numerical_recipes.cpp.

◆ e0

e0

Definition at line 5209 of file numerical_recipes.cpp.

◆ else

else

Initial value:

{

goto L280

Definition at line 2902 of file numerical_recipes.cpp.

◆ eps

double eps = *eps1

Definition at line 2273 of file numerical_recipes.cpp.

◆ eps1

doublereal* eps1

Definition at line 2234 of file numerical_recipes.cpp.

◆ epseqn

double epseqn

Definition at line 4413 of file numerical_recipes.cpp.

◆ epsilon

epsilon

Initial value:

{

int i, j, i_max, index, offset, nineq, display

display

else display

Definition: numerical_recipes.cpp:5712

nineq

void nineq

Definition: numerical_recipes.cpp:4411

i

#define i

Definition: numerical_recipes.cpp:2493

index

viol index

Definition: numerical_recipes.cpp:5197

j

#define j

Definition: numerical_recipes.cpp:2493

Definition at line 5702 of file numerical_recipes.cpp.

◆ epskt

double epskt

Definition at line 4635 of file numerical_recipes.cpp.

◆ epsmac

glob_grd epsmac = smallNumber()

Definition at line 4701 of file numerical_recipes.cpp.

◆ eta

double * eta

Definition at line 7041 of file numerical_recipes.cpp.

◆ etad

double etad

Definition at line 7605 of file numerical_recipes.cpp.

◆ f

f = f - 1

Definition at line 4414 of file numerical_recipes.cpp.

◆ fbind

fbind = cdone = fdone = eqdone = FALSE

Definition at line 7202 of file numerical_recipes.cpp.

◆ feasb

static void feasb = TRUE

Definition at line 4629 of file numerical_recipes.cpp.

◆ feasbl

feasbl

Initial value:

{
    int i, ipp, j, ncnstr, nclin, nctotl, nob, nobL, modem=0, nn,
    nppram, nrowa, ncsipl1, ncsipn1, nfsip1

Definition at line 4629 of file numerical_recipes.cpp.

◆ fii

double fii

Definition at line 7197 of file numerical_recipes.cpp.

◆ first

glob_log first = TRUE

Definition at line 5201 of file numerical_recipes.cpp.

◆ fM

objective fM = fmax

Definition at line 5166 of file numerical_recipes.cpp.

◆ fmax

objective fmax = -bgbnd

Definition at line 5166 of file numerical_recipes.cpp.

◆ fmax1

double fmax1 =0.

Definition at line 7197 of file numerical_recipes.cpp.

◆ fMp

double * fMp = fmax - psf

Definition at line 5166 of file numerical_recipes.cpp.

◆ fmult

double fmult

Definition at line 5702 of file numerical_recipes.cpp.

◆ fmxl

fmxl

Initial value:

{
    int  i, j, k, kk, ncg, ncf, nqprm0, nclin0, nctot0, infoqp, nqprm1, ncl,
    nclin1=0, ncc, nff, nrowa0, nrowa1, ninq, nobb, nobbL,
    nncn, ltem1, ltem2, display, need_d1

Definition at line 6210 of file numerical_recipes.cpp.

◆ fnext

double fnext

Definition at line 5702 of file numerical_recipes.cpp.

◆ fnow

double fnow

Definition at line 5702 of file numerical_recipes.cpp.

◆ fprev

double fprev

Definition at line 5702 of file numerical_recipes.cpp.

◆ g

double * g = g_offset

Definition at line 2473 of file numerical_recipes.cpp.

◆ g_dim1

g_dim1 = *nmax

Definition at line 2560 of file numerical_recipes.cpp.

◆ g_max

double g_max

Definition at line 5702 of file numerical_recipes.cpp.

◆ g_offset

g_offset = g_dim1 + 1

Definition at line 2561 of file numerical_recipes.cpp.

◆ gamma

double * gamma

Definition at line 7597 of file numerical_recipes.cpp.

◆ gammd

double gammd

Definition at line 7605 of file numerical_recipes.cpp.

◆ get_ne_mult

glob_log get_ne_mult = FALSE

Definition at line 4707 of file numerical_recipes.cpp.

◆ gi

double gi

Definition at line 4635 of file numerical_recipes.cpp.

◆ gLgeps

double gLgeps = -1.e0

Definition at line 1831 of file numerical_recipes.cpp.

◆ glob_grd

struct Tglob_grd glob_grd

◆ glob_info

struct Tglob_info glob_info

◆ glob_log

struct Tglob_log glob_log

◆ glob_prnt

struct Tglob_prnt glob_prnt

◆ gm

double * gm = make_dv(4 * neqn)

Definition at line 5168 of file numerical_recipes.cpp.

◆ gmax

double gmax = -bgbnd

Definition at line 4635 of file numerical_recipes.cpp.

◆ grad

grad

Definition at line 2473 of file numerical_recipes.cpp.

◆ gradcn

void(*)(*)(*)(* gradcn

Definition at line 4415 of file numerical_recipes.cpp.

◆ gradf

double * gradf

Definition at line 8269 of file numerical_recipes.cpp.

◆ gradg

double * gradg

Definition at line 8313 of file numerical_recipes.cpp.

◆ gradob

void(*)(*)(* gradob

Definition at line 4415 of file numerical_recipes.cpp.

◆ grdfd0

double grdfd0

Definition at line 6214 of file numerical_recipes.cpp.

◆ grdfd1

else grdfd1 = 0.e0

Definition at line 6214 of file numerical_recipes.cpp.

◆ grdftd

directional grdftd

Definition at line 5166 of file numerical_recipes.cpp.

◆ grdgd0

double grdgd0

Definition at line 6214 of file numerical_recipes.cpp.

◆ grdgd1

double grdgd1

Definition at line 6214 of file numerical_recipes.cpp.

◆ grdpsf

double * grdpsf = make_dv(nparam)

Definition at line 5168 of file numerical_recipes.cpp.

◆ hd

double * hd

Definition at line 7597 of file numerical_recipes.cpp.

◆ hess

double ** hess = make_dm(nparam, nparam)

Definition at line 5170 of file numerical_recipes.cpp.

◆ hess1

double ** hess1 = make_dm(nparam + 1, nparam + 1)

Definition at line 5170 of file numerical_recipes.cpp.

◆ htemp

double * htemp = convert(hess1, nparam + 1, nparam + 1)

Definition at line 5580 of file numerical_recipes.cpp.

◆ i__1

i__1 = *m

Definition at line 2309 of file numerical_recipes.cpp.

◆ i__2

i__2 = *n

Definition at line 2803 of file numerical_recipes.cpp.

◆ iact

int * iact = knext

Definition at line 2474 of file numerical_recipes.cpp.

◆ ifail

static void * ifail = 0

Definition at line 2231 of file numerical_recipes.cpp.

◆ ikeep

ikeep = nlin - *iskp

Definition at line 7207 of file numerical_recipes.cpp.

◆ index

viol index = 0

Definition at line 5197 of file numerical_recipes.cpp.

◆ indxcn

int * indxcn = make_iv(nineq + neq)

Definition at line 4633 of file numerical_recipes.cpp.

◆ indxob

int * indxob = make_iv(DMAX1(nineq + neq, nf))

Definition at line 4633 of file numerical_recipes.cpp.

◆ infoqp

static void * infoqp

Initial value:

{

free_iv(iw_hold)

free_iv

free_iv(iw)

iw_hold

int * iw_hold

Definition: numerical_recipes.cpp:7038

Definition at line 6957 of file numerical_recipes.cpp.

◆ inform

* inform = glob_prnt.info

Definition at line 4411 of file numerical_recipes.cpp.

◆ initvl

glob_prnt initvl = 1

Definition at line 5200 of file numerical_recipes.cpp.

◆ io

glob_prnt io = stdout

Definition at line 4716 of file numerical_recipes.cpp.

◆ iout

iout = 6

Definition at line 2231 of file numerical_recipes.cpp.

◆ ipd

glob_prnt ipd = 0

Definition at line 7635 of file numerical_recipes.cpp.

◆ ipp

ipp = iprint

Definition at line 4714 of file numerical_recipes.cpp.

◆ iprint

glob_prnt iprint = iprint % 10

Definition at line 2231 of file numerical_recipes.cpp.

◆ iskip

int * iskip = make_iv(glob_info.nnineq + 1)

Definition at line 5163 of file numerical_recipes.cpp.

◆ iskp

static void * iskp

Definition at line 6197 of file numerical_recipes.cpp.

◆ istore

int * istore = make_iv(nineqn + nob + neqn)

Definition at line 5163 of file numerical_recipes.cpp.

◆ iter

n iteration glob_prnt iter = 0

Definition at line 4698 of file numerical_recipes.cpp.

◆ iter_mod

glob_prnt iter_mod = DMAX1(iprint - iprint % 10, 1)

Definition at line 4715 of file numerical_recipes.cpp.

◆ iteration

n The following was calculated during iteration

Definition at line 8201 of file numerical_recipes.cpp.

◆ itry

itry = ii = jj = 1

Definition at line 7200 of file numerical_recipes.cpp.

◆ iw_hold

iw_hold

Initial value:

{

int i, k, ii, jj, iout, j, mnn, zero, temp1, temp3, ncnstr_used, numf_used=0

ncnstr_used

Definition: numerical_recipes.cpp:6894

temp3

else temp3

Definition: numerical_recipes.cpp:7134

i

#define i

Definition: numerical_recipes.cpp:2493

k

ql0001_ & k(htemp+1),(cvec+1),(atemp+1),(bj+1),(bl+1),(bu+1),(x+1),(clamda+1), &iout, infoqp, &zero,(w+1), &lenw,(iw+1), &leniw, &glob_grd.epsmac

j

#define j

Definition: numerical_recipes.cpp:2493

iout

integer * iout

Definition: numerical_recipes.cpp:2231

mnn

int * mnn

Definition: numerical_recipes.cpp:2229

zero

ql0001_ & zero(ctemp+1),(cvec+1),(a+1),(b+1),(bl+1),(bu+1),(x+1),(w+1), &iout, ifail, &zero,(w+3), &lwar2,(iw+1), &leniw, &glob_grd.epsmac

temp1

double temp1

Definition: numerical_recipes.cpp:6214

Definition at line 7038 of file numerical_recipes.cpp.

◆ iwar

iwar

Definition at line 2233 of file numerical_recipes.cpp.

◆ L170

goto L170

Definition at line 2751 of file numerical_recipes.cpp.

◆ L440

goto L440

Definition at line 3134 of file numerical_recipes.cpp.

◆ L549

goto L549

Definition at line 3367 of file numerical_recipes.cpp.

◆ L550

goto L550

Definition at line 3392 of file numerical_recipes.cpp.

◆ L570

goto L570

Definition at line 3462 of file numerical_recipes.cpp.

◆ L640

goto L640

Definition at line 3480 of file numerical_recipes.cpp.

◆ L70

goto L70

Definition at line 2780 of file numerical_recipes.cpp.

◆ L710

goto L710

Definition at line 3353 of file numerical_recipes.cpp.

◆ L740

goto L740

Definition at line 3108 of file numerical_recipes.cpp.

◆ L770

goto L770

Definition at line 3817 of file numerical_recipes.cpp.

◆ L775

goto L775

Definition at line 3557 of file numerical_recipes.cpp.

◆ L800

goto L800

Definition at line 3147 of file numerical_recipes.cpp.

◆ L860

goto L860

Definition at line 3422 of file numerical_recipes.cpp.

◆ L880

goto L880

Definition at line 4038 of file numerical_recipes.cpp.

◆ L910

goto L910

Definition at line 3123 of file numerical_recipes.cpp.

◆ L930

goto L930

Definition at line 3071 of file numerical_recipes.cpp.

◆ lambda

lambda = lambda - 1

Definition at line 4414 of file numerical_recipes.cpp.

◆ leniw

int leniw

Definition at line 4215 of file numerical_recipes.cpp.

◆ lenw

int lenw

Definition at line 4215 of file numerical_recipes.cpp.

◆ Linfty

else * Linfty =0

Definition at line 4632 of file numerical_recipes.cpp.

◆ liwar

if liwar

Initial value:

{

goto L81

Definition at line 2233 of file numerical_recipes.cpp.

◆ local

glob_log local = glob_log.update = FALSE

Definition at line 6220 of file numerical_recipes.cpp.

◆ lwar

integer* lwar

Definition at line 2233 of file numerical_recipes.cpp.

◆ lwar2

lwar2 = lenw - 1

Definition at line 8447 of file numerical_recipes.cpp.

◆ m

if m

Initial value:

{

goto L20

Definition at line 2305 of file numerical_recipes.cpp.

◆ max4

objective max4

Definition at line 8120 of file numerical_recipes.cpp.

◆ me

int * me

Definition at line 2229 of file numerical_recipes.cpp.

◆ meq

int * meq

Definition at line 2471 of file numerical_recipes.cpp.

◆ mesh_pts

static void * mesh_pts = mesh_pts - 1

Definition at line 4411 of file numerical_recipes.cpp.

◆ mesh_pts1

mesh_pts1 = mesh_pts

Definition at line 4633 of file numerical_recipes.cpp.

◆ miter

void miter

Definition at line 4411 of file numerical_recipes.cpp.

◆ mm

return mm

Definition at line 8570 of file numerical_recipes.cpp.

◆ mmax

int * mmax

Definition at line 2229 of file numerical_recipes.cpp.

◆ mnn

int * mnn

Initial value:

{

goto L82

Definition at line 2229 of file numerical_recipes.cpp.

◆ mode

static void mode

Definition at line 4411 of file numerical_recipes.cpp.

◆ modec

glob_info modec = 1

Definition at line 5544 of file numerical_recipes.cpp.

◆ modem

void * modem

Definition at line 5462 of file numerical_recipes.cpp.

◆ mult

i<= ncnstr; i++) cs[i].mult = 0.e0; if (nfsip) for (i = 1; i <= nob; i++) { ob[i].mult = 0.e0; ob[i].mult_L = 0.e0; } for (i = 1; i <= nqpram; i++) { ii = k + i; if (clamda[ii] == 0.e0 && clamda[ii+nqpram] == 0.e0) continue; else if (clamda[ii] != 0.e0) clamda[ii] = -clamda[ii]; else clamda[ii] = clamda[ii+nqpram]; } nqnp = nqpram + ncnstr; for (i = 1; i <= nqpram; i++) param-> mult[i] = clamda[k+i]

Definition at line 6988 of file numerical_recipes.cpp.

◆ n

int n

Definition at line 2229 of file numerical_recipes.cpp.

◆ ncallf

ncallf glob_info ncallf = 0

Definition at line 5221 of file numerical_recipes.cpp.

◆ ncallg

ncallg glob_info ncallg

Definition at line 8196 of file numerical_recipes.cpp.

◆ ncc

ncc = ncg + 1

Definition at line 6602 of file numerical_recipes.cpp.

◆ ncf

void * ncf

Definition at line 7183 of file numerical_recipes.cpp.

◆ ncg

static void * ncg = ncf = *iskp = 0

Definition at line 6218 of file numerical_recipes.cpp.

◆ ncl

ncl = glob_info.nnineq - nineqn

Definition at line 6219 of file numerical_recipes.cpp.

◆ nclin

static void nclin = ncnstr - nn

Definition at line 4760 of file numerical_recipes.cpp.

◆ nclin0

nclin0 = ncnstr + nobL

Definition at line 6241 of file numerical_recipes.cpp.

◆ ncn

void ncn

Definition at line 7940 of file numerical_recipes.cpp.

◆ ncnst1

ncnst1 = ncnstr - nineqn - neqn

Definition at line 5234 of file numerical_recipes.cpp.

◆ ncnstr

static void ncnstr = nineq + neq

Definition at line 4717 of file numerical_recipes.cpp.

◆ ncnstr_used

ncnstr_used = k

Definition at line 6894 of file numerical_recipes.cpp.

◆ ncsipl

static void ncsipl = ncsrl

Definition at line 4645 of file numerical_recipes.cpp.

◆ ncsipl1

ncsipl1 = ncsrl

Definition at line 4655 of file numerical_recipes.cpp.

◆ ncsipn

static void ncsipn = ncsrn

Definition at line 4646 of file numerical_recipes.cpp.

◆ ncsipn1

ncsipn1 = ncsrn

Definition at line 4656 of file numerical_recipes.cpp.

◆ ncsrl

ncsrl = 0

Definition at line 4411 of file numerical_recipes.cpp.

◆ ncsrn

ncsrn = 0

Definition at line 4411 of file numerical_recipes.cpp.

◆ nctot0

nctot0 = nqprm0 + nclin0

Definition at line 6243 of file numerical_recipes.cpp.

◆ nctotl

static void nctotl

Definition at line 5153 of file numerical_recipes.cpp.

◆ ndima

int ndima

Definition at line 8582 of file numerical_recipes.cpp.

◆ ndimb

int ndimb

Definition at line 8582 of file numerical_recipes.cpp.

◆ need_d1

need_d1 = TRUE

Definition at line 6231 of file numerical_recipes.cpp.

◆ neq

static void neq

Definition at line 4411 of file numerical_recipes.cpp.

◆ neqn

static void neqn

Definition at line 4411 of file numerical_recipes.cpp.

◆ nf

static void nf = nf - nfsr

Definition at line 4411 of file numerical_recipes.cpp.

◆ nfs

static int nfs = 0

Definition at line 5223 of file numerical_recipes.cpp.

◆ nfsip

static void nfsip = nfsr

Definition at line 4644 of file numerical_recipes.cpp.

◆ nfsip1

nfsip1 = nfsr

Definition at line 4648 of file numerical_recipes.cpp.

◆ nfsr

nfsr = 0

Definition at line 4411 of file numerical_recipes.cpp.

◆ nineq

static void nineq = nineq - ncsrl - ncsrn

Definition at line 4411 of file numerical_recipes.cpp.

◆ nineqn

static void nineqn = nineqn - ncsrn

Definition at line 4411 of file numerical_recipes.cpp.

◆ ninq

ninq = nncn = ncg

Definition at line 6604 of file numerical_recipes.cpp.

◆ nlin

nlin = glob_info.nnineq - nineqn

Definition at line 7199 of file numerical_recipes.cpp.

◆ nmax

int * nmax

Definition at line 2229 of file numerical_recipes.cpp.

◆ nn

static void nn = nineqn + neqn

Definition at line 4700 of file numerical_recipes.cpp.

◆ nnineq

glob_info nnineq = nineq

Definition at line 4718 of file numerical_recipes.cpp.

◆ nnl

static void nnl

Definition at line 5462 of file numerical_recipes.cpp.

◆ nob

static void nob = 0

Definition at line 4710 of file numerical_recipes.cpp.

◆ nobL

static void nobL

Definition at line 5153 of file numerical_recipes.cpp.

◆ nparam

static void nparam

Definition at line 5153 of file numerical_recipes.cpp.

◆ nppram

nppram = nparam + 1

Definition at line 4747 of file numerical_recipes.cpp.

◆ nqpram

void nqpram

Definition at line 7030 of file numerical_recipes.cpp.

◆ nrowa

static void nrowa = DMAX1(ncnstr + DMAX1(nobL, 1), 1)

Definition at line 5014 of file numerical_recipes.cpp.

◆ nrowa0

nrowa0 = DMAX1(nclin0, 1)

Definition at line 6245 of file numerical_recipes.cpp.

◆ nrows

int nrows

Definition at line 8467 of file numerical_recipes.cpp.

◆ nrst

static void * nrst = glob_prnt.ipd = 0

Definition at line 5202 of file numerical_recipes.cpp.

◆ nstart

static void * nstart = 1

Definition at line 5220 of file numerical_recipes.cpp.

◆ nstop

int nstop = 1

Definition at line 4178 of file numerical_recipes.cpp.

◆ ob

struct _objective * ob

Definition at line 4637 of file numerical_recipes.cpp.

◆ obj

void(* obj)()

Definition at line 4415 of file numerical_recipes.cpp.

◆ objeps

double objeps = -1.e0

Definition at line 1829 of file numerical_recipes.cpp.

◆ objmax

objective objmax

Definition at line 8122 of file numerical_recipes.cpp.

◆ objrep

double objrep = -1.e0

Definition at line 1830 of file numerical_recipes.cpp.

◆ or

or

Definition at line 5499 of file numerical_recipes.cpp.

◆ ostep

ostep = *steps = 1.e0

Definition at line 7197 of file numerical_recipes.cpp.

◆ param

struct _parameter * param

Definition at line 4638 of file numerical_recipes.cpp.

◆ penp

double * penp = make_dv(neqn)

Definition at line 5168 of file numerical_recipes.cpp.

◆ phess

double ** phess

Definition at line 7597 of file numerical_recipes.cpp.

◆ prnt

prnt = FALSE

Definition at line 4629 of file numerical_recipes.cpp.

◆ prod

double prod

Definition at line 7194 of file numerical_recipes.cpp.

◆ prod1

prod1

Initial value:

{
    int i, ii, ij, jj, itry, ikeep, j, job, nlin, mnm, ltem1, ltem2, reform,
    fbind, cdone, fdone, eqdone, display, sipldone

Definition at line 7194 of file numerical_recipes.cpp.

◆ psb

double * psb

Definition at line 7597 of file numerical_recipes.cpp.

◆ psf

double * psf = 0.e0

Definition at line 5166 of file numerical_recipes.cpp.

◆ psfnew

psfnew = 0.e0

Definition at line 7607 of file numerical_recipes.cpp.

◆ psmu

double * psmu = make_dv(neqn)

Definition at line 5168 of file numerical_recipes.cpp.

◆ return

L1500 if steps return

Initial value:

{

*z = x * y + y

y

static double * y

Definition: numerical_recipes.cpp:8487

x

doublereal * x

Definition: numerical_recipes.cpp:2230

z

double z

Definition: numerical_recipes.cpp:8490

Definition at line 2394 of file numerical_recipes.cpp.

◆ rho

if steps rho = rhog

Definition at line 6214 of file numerical_recipes.cpp.

◆ rhog

else rhog = DMIN1(rhol, temp2)

Definition at line 6214 of file numerical_recipes.cpp.

◆ rhol

double rhol

Definition at line 6214 of file numerical_recipes.cpp.

◆ rhol_is1

glob_log rhol_is1 = FALSE

Definition at line 4706 of file numerical_recipes.cpp.

◆ rteps

glob_grd rteps = sqrt(glob_grd.epsmac)

Definition at line 4704 of file numerical_recipes.cpp.

◆ scvneq

double * scvneq = 0.e0

Definition at line 5166 of file numerical_recipes.cpp.

◆ sign

double sign

Definition at line 6214 of file numerical_recipes.cpp.

◆ signeq

double * signeq = make_dv(neqn)

Definition at line 4634 of file numerical_recipes.cpp.

◆ signgj

double signgj =1.

Definition at line 7607 of file numerical_recipes.cpp.

◆ sip_viol

struct _violation * sip_viol

Definition at line 7190 of file numerical_recipes.cpp.

◆ sipldone

sipldone = (ncsipl == 0)

Definition at line 7204 of file numerical_recipes.cpp.

◆ sktnom

double sktnom = 0.e0

Definition at line 5166 of file numerical_recipes.cpp.

◆ SNECV

double SNECV

Initial value:

{

int i, j, index, display, offset

display

else display

Definition: numerical_recipes.cpp:5712

i

#define i

Definition: numerical_recipes.cpp:2493

index

viol index

Definition: numerical_recipes.cpp:5197

j

#define j

Definition: numerical_recipes.cpp:2493

Definition at line 7947 of file numerical_recipes.cpp.

◆ span

double * span = make_dv(4)

Definition at line 5168 of file numerical_recipes.cpp.

◆ steps

double steps = 0.e0

Definition at line 5166 of file numerical_recipes.cpp.

◆ temp1

temp1 = temp2 = 0.e0

Definition at line 6214 of file numerical_recipes.cpp.

◆ temp2

temp2 = (theta - 1.e0) * grdfd0 / temp1

Definition at line 6214 of file numerical_recipes.cpp.

◆ temp3

else temp3 = k

Definition at line 7134 of file numerical_recipes.cpp.

◆ tempv

double * tempv

Definition at line 5171 of file numerical_recipes.cpp.

◆ termination

nNormal termination

Definition at line 8215 of file numerical_recipes.cpp.

◆ theta

double theta = 0.2e0

Definition at line 6214 of file numerical_recipes.cpp.

◆ thrshd

static int thrshd = tolfea

Definition at line 6214 of file numerical_recipes.cpp.

◆ tolfe

tolfe = 0.e0

Definition at line 7197 of file numerical_recipes.cpp.

◆ tolfea

tolfea = glob_grd.epsmac * 1.e2

Definition at line 4177 of file numerical_recipes.cpp.

◆ tot_actf_sip

Omega_k glob_info tot_actf_sip = glob_info.tot_actg_sip = 0

Definition at line 4642 of file numerical_recipes.cpp.

◆ tot_actg_sip

Xi_k glob_info tot_actg_sip

Definition at line 5953 of file numerical_recipes.cpp.

◆ type

viol type = NONE

Definition at line 5198 of file numerical_recipes.cpp.

◆ u

u

Definition at line 2230 of file numerical_recipes.cpp.

◆ udelta

glob_grd udelta = udelta

Definition at line 4413 of file numerical_recipes.cpp.

◆ v0

double v0

Definition at line 6210 of file numerical_recipes.cpp.

◆ v1

double v1

Definition at line 6210 of file numerical_recipes.cpp.

◆ viol

struct _violation * viol = &_viol

Definition at line 5172 of file numerical_recipes.cpp.

◆ vk

double vk =0.

Definition at line 6214 of file numerical_recipes.cpp.

◆ vsmall

doublereal* vsmall

Definition at line 2475 of file numerical_recipes.cpp.

◆ vv

vv = 0.e0

Definition at line 6210 of file numerical_recipes.cpp.

◆ w

directional w = sum / w[ir]

Definition at line 2477 of file numerical_recipes.cpp.

◆ war

war

Definition at line 2232 of file numerical_recipes.cpp.

◆ x

double * x = x[i]

Definition at line 2230 of file numerical_recipes.cpp.

◆ x0i

double x0i

Initial value:

{

int i, j, infoql, mnn, temp1, iout, zero

i

#define i

Definition: numerical_recipes.cpp:2493

j

#define j

Definition: numerical_recipes.cpp:2493

iout

integer * iout

Definition: numerical_recipes.cpp:2231

mnn

int * mnn

Definition: numerical_recipes.cpp:2229

zero

ql0001_ & zero(ctemp+1),(cvec+1),(a+1),(b+1),(bl+1),(bu+1),(x+1),(w+1), &iout, ifail, &zero,(w+3), &lwar2,(iw+1), &leniw, &glob_grd.epsmac

temp1

double temp1

Definition: numerical_recipes.cpp:6214

Definition at line 5580 of file numerical_recipes.cpp.

◆ x_is_new

int x_is_new = TRUE

Definition at line 1826 of file numerical_recipes.cpp.

◆ xi

double xi

Initial value:

{

int i

i

#define i

Definition: numerical_recipes.cpp:2493

Definition at line 4635 of file numerical_recipes.cpp.

◆ xl

doublereal * xl

Definition at line 2230 of file numerical_recipes.cpp.

◆ xnew

double * xnew

Definition at line 7187 of file numerical_recipes.cpp.

◆ xu

doublereal * xu

Definition at line 2230 of file numerical_recipes.cpp.

◆ y

void y

Definition at line 8487 of file numerical_recipes.cpp.

◆ z

static void * z

Initial value:

{

int i

i

#define i

Definition: numerical_recipes.cpp:2493

Definition at line 8490 of file numerical_recipes.cpp.

Classes

Macros

Typedefs

Functions

Variables

Macro Definition Documentation

◆ abs

◆ CGOLD

◆ cmache_1

◆ CONSTR

◆ dabs

◆ dmax

◆ DMAX1

◆ dmin

◆ DMIN1

◆ EPS [1/4]

◆ EPS [2/4]

◆ EPS [3/4]

◆ EPS [4/4]

◆ Extern

◆ F1DIM

◆ F2C_INCLUDE

◆ F2C_proc_par_types

◆ FALSE

◆ FALSE_

◆ FPMIN [1/2]

◆ FPMIN [2/2]

◆ GLIMIT

◆ GOLD

◆ IA1

◆ IA2

◆ IA3

◆ IC1

◆ IC2

◆ IC3

◆ ITMAX [1/5]

◆ ITMAX [2/5]

◆ ITMAX [3/5]

◆ ITMAX [4/5]

◆ ITMAX [5/5]

◆ M1

◆ M2

◆ M3

◆ MAX

◆ max

◆ MAXIT

◆ min

◆ NONE

◆ NRSIGN

◆ NUSE1

◆ NUSE2

◆ OBJECT

◆ RM1

◆ RM2

◆ SHFT

◆ SIGN

◆ Skip_f2c_Undefs

◆ SQR

◆ SVDMAXITER

◆ TINY

◆ TOL

◆ TRUE

◆ TRUE_

◆ VOID

◆ XMIN

◆ ZEPS

Typedef Documentation

◆ address

◆ C_f

◆ C_fp

◆ cfsqpreal

◆ D_fp

◆ doublereal

◆ E_f

◆ E_fp

◆ flag

◆ ftnint

◆ ftnlen

◆ H_f

◆ H_fp