updated 3rd party libs: CLapack 3.1.1.1 => 3.2.1, zlib 1.2.3 => 1.2.5, libpng 1.2.x => 1.4.3, libtiff 3.7.x => 3.9.4. fixed many 64-bit related VS2010 warnings
This commit is contained in:
112
3rdparty/lapack/dlasq2.c
vendored
112
3rdparty/lapack/dlasq2.c
vendored
@@ -1,5 +1,18 @@
|
||||
/* dlasq2.f -- translated by f2c (version 20061008).
|
||||
You must link the resulting object file with libf2c:
|
||||
on Microsoft Windows system, link with libf2c.lib;
|
||||
on Linux or Unix systems, link with .../path/to/libf2c.a -lm
|
||||
or, if you install libf2c.a in a standard place, with -lf2c -lm
|
||||
-- in that order, at the end of the command line, as in
|
||||
cc *.o -lf2c -lm
|
||||
Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
|
||||
|
||||
http://www.netlib.org/f2c/libf2c.zip
|
||||
*/
|
||||
|
||||
#include "clapack.h"
|
||||
|
||||
|
||||
/* Table of constant values */
|
||||
|
||||
static integer c__1 = 1;
|
||||
@@ -19,31 +32,32 @@ static integer c__11 = 11;
|
||||
double sqrt(doublereal);
|
||||
|
||||
/* Local variables */
|
||||
doublereal d__, e;
|
||||
doublereal d__, e, g;
|
||||
integer k;
|
||||
doublereal s, t;
|
||||
integer i0, i4, n0;
|
||||
doublereal dn;
|
||||
integer pp;
|
||||
doublereal dn1, dn2, eps, tau, tol;
|
||||
doublereal dn1, dn2, dee, eps, tau, tol;
|
||||
integer ipn4;
|
||||
doublereal tol2;
|
||||
logical ieee;
|
||||
integer nbig;
|
||||
doublereal dmin__, emin, emax;
|
||||
integer ndiv, iter;
|
||||
integer kmin, ndiv, iter;
|
||||
doublereal qmin, temp, qmax, zmax;
|
||||
integer splt;
|
||||
doublereal dmin1, dmin2;
|
||||
integer nfail;
|
||||
doublereal desig, trace, sigma;
|
||||
integer iinfo, ttype;
|
||||
extern /* Subroutine */ int dlazq3_(integer *, integer *, doublereal *,
|
||||
extern /* Subroutine */ int dlasq3_(integer *, integer *, doublereal *,
|
||||
integer *, doublereal *, doublereal *, doublereal *, doublereal *,
|
||||
integer *, integer *, integer *, logical *, integer *,
|
||||
doublereal *, doublereal *, doublereal *, doublereal *,
|
||||
doublereal *, doublereal *);
|
||||
doublereal *, doublereal *, doublereal *);
|
||||
extern doublereal dlamch_(char *);
|
||||
doublereal deemin;
|
||||
integer iwhila, iwhilb;
|
||||
doublereal oldemn, safmin;
|
||||
extern /* Subroutine */ int xerbla_(char *, integer *);
|
||||
@@ -53,11 +67,15 @@ static integer c__11 = 11;
|
||||
integer *);
|
||||
|
||||
|
||||
/* -- LAPACK routine (version 3.1) -- */
|
||||
/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
|
||||
/* November 2006 */
|
||||
/* -- LAPACK routine (version 3.2) -- */
|
||||
|
||||
/* Modified to call DLAZQ3 in place of DLASQ3, 13 Feb 03, SJH. */
|
||||
/* -- Contributed by Osni Marques of the Lawrence Berkeley National -- */
|
||||
/* -- Laboratory and Beresford Parlett of the Univ. of California at -- */
|
||||
/* -- Berkeley -- */
|
||||
/* -- November 2008 -- */
|
||||
|
||||
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
|
||||
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
|
||||
|
||||
/* .. Scalar Arguments .. */
|
||||
/* .. */
|
||||
@@ -81,7 +99,7 @@ static integer c__11 = 11;
|
||||
/* Note : DLASQ2 defines a logical variable, IEEE, which is true */
|
||||
/* on machines which follow ieee-754 floating-point standard in their */
|
||||
/* handling of infinities and NaNs, and false otherwise. This variable */
|
||||
/* is passed to DLAZQ3. */
|
||||
/* is passed to DLASQ3. */
|
||||
|
||||
/* Arguments */
|
||||
/* ========= */
|
||||
@@ -89,7 +107,7 @@ static integer c__11 = 11;
|
||||
/* N (input) INTEGER */
|
||||
/* The number of rows and columns in the matrix. N >= 0. */
|
||||
|
||||
/* Z (workspace) DOUBLE PRECISION array, dimension ( 4*N ) */
|
||||
/* Z (input/output) DOUBLE PRECISION array, dimension ( 4*N ) */
|
||||
/* On entry Z holds the qd array. On exit, entries 1 to N hold */
|
||||
/* the eigenvalues in decreasing order, Z( 2*N+1 ) holds the */
|
||||
/* trace, and Z( 2*N+2 ) holds the sum of the eigenvalues. If */
|
||||
@@ -355,7 +373,7 @@ static integer c__11 = 11;
|
||||
/* L80: */
|
||||
}
|
||||
|
||||
/* Initialise variables to pass to DLAZQ3 */
|
||||
/* Initialise variables to pass to DLASQ3. */
|
||||
|
||||
ttype = 0;
|
||||
dmin1 = 0.;
|
||||
@@ -363,6 +381,7 @@ static integer c__11 = 11;
|
||||
dn = 0.;
|
||||
dn1 = 0.;
|
||||
dn2 = 0.;
|
||||
g = 0.;
|
||||
tau = 0.;
|
||||
|
||||
iter = 2;
|
||||
@@ -372,7 +391,7 @@ static integer c__11 = 11;
|
||||
i__1 = *n + 1;
|
||||
for (iwhila = 1; iwhila <= i__1; ++iwhila) {
|
||||
if (n0 < 1) {
|
||||
goto L150;
|
||||
goto L170;
|
||||
}
|
||||
|
||||
/* While array unfinished do */
|
||||
@@ -426,10 +445,43 @@ static integer c__11 = 11;
|
||||
|
||||
L100:
|
||||
i0 = i4 / 4;
|
||||
pp = 0;
|
||||
|
||||
/* Store EMIN for passing to DLAZQ3. */
|
||||
|
||||
z__[(n0 << 2) - 1] = emin;
|
||||
if (n0 - i0 > 1) {
|
||||
dee = z__[(i0 << 2) - 3];
|
||||
deemin = dee;
|
||||
kmin = i0;
|
||||
i__2 = (n0 << 2) - 3;
|
||||
for (i4 = (i0 << 2) + 1; i4 <= i__2; i4 += 4) {
|
||||
dee = z__[i4] * (dee / (dee + z__[i4 - 2]));
|
||||
if (dee <= deemin) {
|
||||
deemin = dee;
|
||||
kmin = (i4 + 3) / 4;
|
||||
}
|
||||
/* L110: */
|
||||
}
|
||||
if (kmin - i0 << 1 < n0 - kmin && deemin <= z__[(n0 << 2) - 3] *
|
||||
.5) {
|
||||
ipn4 = i0 + n0 << 2;
|
||||
pp = 2;
|
||||
i__2 = i0 + n0 - 1 << 1;
|
||||
for (i4 = i0 << 2; i4 <= i__2; i4 += 4) {
|
||||
temp = z__[i4 - 3];
|
||||
z__[i4 - 3] = z__[ipn4 - i4 - 3];
|
||||
z__[ipn4 - i4 - 3] = temp;
|
||||
temp = z__[i4 - 2];
|
||||
z__[i4 - 2] = z__[ipn4 - i4 - 2];
|
||||
z__[ipn4 - i4 - 2] = temp;
|
||||
temp = z__[i4 - 1];
|
||||
z__[i4 - 1] = z__[ipn4 - i4 - 5];
|
||||
z__[ipn4 - i4 - 5] = temp;
|
||||
temp = z__[i4];
|
||||
z__[i4] = z__[ipn4 - i4 - 4];
|
||||
z__[ipn4 - i4 - 4] = temp;
|
||||
/* L120: */
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Put -(initial shift) into DMIN. */
|
||||
|
||||
@@ -437,22 +489,24 @@ L100:
|
||||
d__1 = 0., d__2 = qmin - sqrt(qmin) * 2. * sqrt(emax);
|
||||
dmin__ = -max(d__1,d__2);
|
||||
|
||||
/* Now I0:N0 is unreduced. PP = 0 for ping, PP = 1 for pong. */
|
||||
|
||||
pp = 0;
|
||||
/* Now I0:N0 is unreduced. */
|
||||
/* PP = 0 for ping, PP = 1 for pong. */
|
||||
/* PP = 2 indicates that flipping was applied to the Z array and */
|
||||
/* and that the tests for deflation upon entry in DLASQ3 */
|
||||
/* should not be performed. */
|
||||
|
||||
nbig = (n0 - i0 + 1) * 30;
|
||||
i__2 = nbig;
|
||||
for (iwhilb = 1; iwhilb <= i__2; ++iwhilb) {
|
||||
if (i0 > n0) {
|
||||
goto L130;
|
||||
goto L150;
|
||||
}
|
||||
|
||||
/* While submatrix unfinished take a good dqds step. */
|
||||
|
||||
dlazq3_(&i0, &n0, &z__[1], &pp, &dmin__, &sigma, &desig, &qmax, &
|
||||
dlasq3_(&i0, &n0, &z__[1], &pp, &dmin__, &sigma, &desig, &qmax, &
|
||||
nfail, &iter, &ndiv, &ieee, &ttype, &dmin1, &dmin2, &dn, &
|
||||
dn1, &dn2, &tau);
|
||||
dn1, &dn2, &g, &tau);
|
||||
|
||||
pp = 1 - pp;
|
||||
|
||||
@@ -485,7 +539,7 @@ L100:
|
||||
d__1 = oldemn, d__2 = z__[i4];
|
||||
oldemn = min(d__1,d__2);
|
||||
}
|
||||
/* L110: */
|
||||
/* L130: */
|
||||
}
|
||||
z__[(n0 << 2) - 1] = emin;
|
||||
z__[n0 * 4] = oldemn;
|
||||
@@ -493,7 +547,7 @@ L100:
|
||||
}
|
||||
}
|
||||
|
||||
/* L120: */
|
||||
/* L140: */
|
||||
}
|
||||
|
||||
*info = 2;
|
||||
@@ -501,9 +555,9 @@ L100:
|
||||
|
||||
/* end IWHILB */
|
||||
|
||||
L130:
|
||||
L150:
|
||||
|
||||
/* L140: */
|
||||
/* L160: */
|
||||
;
|
||||
}
|
||||
|
||||
@@ -512,14 +566,14 @@ L130:
|
||||
|
||||
/* end IWHILA */
|
||||
|
||||
L150:
|
||||
L170:
|
||||
|
||||
/* Move q's to the front. */
|
||||
|
||||
i__1 = *n;
|
||||
for (k = 2; k <= i__1; ++k) {
|
||||
z__[k] = z__[(k << 2) - 3];
|
||||
/* L160: */
|
||||
/* L180: */
|
||||
}
|
||||
|
||||
/* Sort and compute sum of eigenvalues. */
|
||||
@@ -529,7 +583,7 @@ L150:
|
||||
e = 0.;
|
||||
for (k = *n; k >= 1; --k) {
|
||||
e += z__[k];
|
||||
/* L170: */
|
||||
/* L190: */
|
||||
}
|
||||
|
||||
/* Store trace, sum(eigenvalues) and information on performance. */
|
||||
|
Reference in New Issue
Block a user