19 if (
x.indexmin() != y.indexmin() ||
x.indexmax() != y.indexmax())
21 cerr <<
"Incompatible shapes in df1b2vector function" << s <<
endl;
34 if (
x.indexmin() != y.indexmin() ||
x.indexmax() != y.indexmax())
36 cerr <<
"Incompatible shapes in df1b2vector function" << s <<
endl;
49 if (
x.indexmin() != y.indexmin() ||
x.indexmax() != y.indexmax())
51 cerr <<
"Incompatible shapes in df1b2vector function" << s <<
endl;
64 if (
x.indexmin() != y(y.indexmin()).indexmin() ||
65 x.indexmax() != y(y.indexmin()).indexmax())
67 cerr <<
"Incompatible shapes in df1b2vector function" << s <<
endl;
81 check_shape(*
this,
x,
"df1b2vector& df1b2vector::operator =");
82 int mmin=
x.indexmin();
83 int mmax=
x.indexmax();
84 for (
int i=mmin;i<=mmax;i++)
103 check_shape(*
this,
x,
"df1b2vector& df1b2vector::operator =");
104 int mmin=
x.indexmin();
105 int mmax=
x.indexmax();
106 for (
int i=mmin;i<=mmax;i++) (*
this)(i)=
x(i);
119 for (
int i=mmin;i<=mmax;i++) (*
this)(i)=
x;
131 for (
int i=mmin;i<=mmax;i++) (*
this)(i)=x;
144 int rmin=
M.indexmin();
145 int rmax=
M.indexmax();
150 for (
int i=rmin;i<=rmax;i++)
166 int rmin=
M.indexmin();
167 int rmax=
M.indexmax();
172 for (
int i=rmin;i<=rmax;i++)
190 int rmin =
M.indexmin();
191 int cmin =
M(rmin).indexmin();
192 int cmax =
M(rmin).indexmax();
193 int mmin =
x.indexmin();
194 int mmax =
x.indexmax();
199 for (
int i = cmin; i <= cmax; ++i)
201 for (
int j = mmin; j <= mmax; ++j)
203 tmp(i) +=
M(j, i) *
x(j);
220 int rmin =
M.indexmin();
221 int cmin =
M(rmin).indexmin();
222 int cmax =
M(rmin).indexmax();
223 int mmin =
x.indexmin();
224 int mmax =
x.indexmax();
229 for (
int i = cmin; i <= cmax; ++i)
231 for (
int j = mmin; j <= mmax; ++j)
233 tmp(i) +=
M(j, i) *
x(j);
250 int rmin =
M.indexmin();
251 int cmin =
M(rmin).indexmin();
252 int cmax =
M(rmin).indexmax();
253 int mmin =
x.indexmin();
254 int mmax =
x.indexmax();
259 for (
int i = cmin; i <= cmax; ++i)
261 for (
int j = mmin; j <= mmax; ++j)
263 tmp(i) +=
M(j, i) *
x(j);
282 int cmin=
N(kmin).indexmin();
283 int cmax=
N(kmin).indexmax();
286 cerr <<
"incompatible matrix sizes" <<
endl;
291 for (
int i=rmin;i<=rmax;i++)
293 for (
int j=cmin;j<=cmax;j++)
295 for (
int k=kmin;k<=kmax;k++)
297 tmp(i,j)+=
M(i,k)*
N(k,j);
313 int rmin=
M.indexmin();
314 int rmax=
M.indexmax();
315 int cmin=
x.indexmin();
316 int cmax=
x.indexmax();
318 for (
int i=rmin;i<=rmax;i++)
319 for (
int j=cmin;j<=cmax;j++)
335 for (
int i=rmin;i<=rmax;i++)
337 int cmin=
M(i).indexmin();
338 int cmax=
M(i).indexmax();
339 tmp(i).noallocate(cmin,cmax);
340 for (
int j=cmin;j<=cmax;j++)
342 tmp(i,j)=
M(i,j)*
N(i,j);
359 for (
int i=rmin;i<=rmax;i++)
361 int cmin=
M(i).indexmin();
362 int cmax=
M(i).indexmax();
363 tmp(i).noallocate(cmin,cmax);
364 for (
int j=cmin;j<=cmax;j++)
366 tmp(i,j)=
M(i,j)*
N(i,j);
383 for (
int i=rmin;i<=rmax;i++)
385 int cmin=
M(i).indexmin();
386 int cmax=
M(i).indexmax();
387 tmp(i).noallocate(cmin,cmax);
388 for (
int j=cmin;j<=cmax;j++)
390 tmp(i,j)=
M(i,j)*
N(i,j);
407 for (
int i=rmin;i<=rmax;i++)
409 int cmin=
M(i).indexmin();
410 int cmax=
M(i).indexmax();
411 tmp(i).noallocate(cmin,cmax);
412 for (
int j=cmin;j<=cmax;j++)
414 tmp(i,j)=
M(i,j)/
N(i,j);
431 for (
int i=rmin;i<=rmax;i++)
433 int cmin=
M(i).indexmin();
434 int cmax=
M(i).indexmax();
435 tmp(i).noallocate(cmin,cmax);
436 for (
int j=cmin;j<=cmax;j++)
438 tmp(i,j)=
M(i,j)/
N(i,j);
455 for (
int i=rmin;i<=rmax;i++)
457 int cmin=
M(i).indexmin();
458 int cmax=
M(i).indexmax();
459 tmp(i).noallocate(cmin,cmax);
460 for (
int j=cmin;j<=cmax;j++)
462 tmp(i,j)=
M(i,j)/
N(i,j);
476 int rmin=v.indexmin();
477 int rmax=v.indexmax();
480 for (
int i=rmin;i<=rmax;i++)
495 int rmin=v.indexmin();
496 int rmax=v.indexmax();
499 for (
int i=rmin;i<=rmax;i++)
514 int rmin=v.indexmin();
515 int rmax=v.indexmax();
518 for (
int i=rmin;i<=rmax;i++)
533 int rmin=v.indexmin();
534 int rmax=v.indexmax();
537 for (
int i=rmin;i<=rmax;i++)
552 int rmin=v.indexmin();
553 int rmax=v.indexmax();
556 for (
int i=rmin;i<=rmax;i++)
571 int rmin=v.indexmin();
572 int rmax=v.indexmax();
575 for (
int i=rmin;i<=rmax;i++)
669 cerr <<
" Error allocating memory in df1b2matrix contructor\n";
674 cerr <<
" Error allocating memory in df1b2matrix contructor\n";
677 for (
int i=nrl; i<=nrh; i++)
694 cerr <<
" Error allocating memory in df1b2matrix contructor\n";
699 cerr <<
" Error allocating memory in df1b2matrix contructor\n";
702 for (
int i=nrl; i<=nrh; i++)
729 cerr <<
" Error allocating memory in df1b2matrix contructor\n";
734 cerr <<
" Error allocating memory in df1b2matrix contructor\n";
800 (*this)[i][j] = values[i];
814 int mmin=
x.indexmin();
815 int mmax=
x.indexmax();
816 for (
int i=mmin;i<=mmax;i++)
832 int mmin=
x.indexmin();
833 int mmax=
x.indexmax();
834 double fn=mmax-mmin+1;
835 for (
int i=mmin;i<=mmax;i++)
851 int mmin=
x.indexmin();
852 int mmax=
x.indexmax();
853 for (
int i=mmin;i<=mmax;i++)
870 int mmin=
x.indexmin();
871 int mmax=
x.indexmax();
872 for (
int i=mmin;i<=mmax;i++)
888 int mmin=
x.indexmin();
889 int mmax=
x.indexmax();
890 for (
int i=mmin;i<=mmax;i++)
907 int mmin=
x.indexmin();
908 int mmax=
x.indexmax();
909 for (
int i=mmin;i<=mmax;i++)
925 int mmin=
x.indexmin();
926 int mmax=
x.indexmax();
927 for (
int i=mmin;i<=mmax;i++)
943 int mmin=
x.indexmin();
944 int mmax=
x.indexmax();
946 for (
int i=mmin;i<=mmax;i++)
949 nitems+=
x(i).indexmax()-
x(i).indexmin()+1;
df1b2matrix(void)
Description not yet available.
d3_array elem_prod(const d3_array &a, const d3_array &b)
Returns d3_array results with computed elements product of a(i, j, k) * b(i, j, k).
Uses polymorphism to get index information from various data types to be used in constructing and all...
Description not yet available.
double sumsq(const d3_array &a)
#define ADUNCONST(type, obj)
Creates a shallow copy of obj that is not CONST.
Vector of double precision numbers.
~df1b2matrix()
Destructor.
void allocate(int lb, int ub, const char *)
Description not yet available.
double sum(const d3_array &darray)
Author: David Fournier Copyright (c) 2008-2012 Regents of the University of California.
void copy(const df1b2vector &)
Description not yet available.
Description not yet available.
d3_array elem_div(const d3_array &a, const d3_array &b)
Returns d3_array results with computed elements division of a(i, j, k) / b(i, j, k).
void initialize(void)
Description not yet available.
double mean(const dvector &vec)
Returns computed mean of vec.
double norm(const d3_array &a)
Return computed norm value of a.
Description not yet available.
dmatrix operator*(const d3_array &t, const dvector &v)
Description not yet available.
df1b2vector & operator=(const df3_one_vector &)
prnstream & endl(prnstream &)
d3_array sqrt(const d3_array &arr3)
Author: David Fournier Copyright (c) 2008-2012 Regents of the University of California.
void noallocate(int lib, int ub)
Description not yet available.
void deallocate(void)
Description not yet available.
Description not yet available.
double norm2(const d3_array &a)
Return sum of squared elements in a.
void check_shape(const df1b2vector &x, const df1b2vector &y, const char *s)
Description not yet available.
Description not yet available.
Description not yet available.
void initialize(void)
Description not yet available.
void colfill(const int j, const df1b2vector &v)
Copy vector values into column j of df1b2matrix.
void allocate(void)
Description not yet available.
unsigned int size() const
double square(const double value)
Return square of value; constant object.