2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2012, by the GROMACS development team, led by
5 * David van der Spoel, Berk Hess, Erik Lindahl, and including many
6 * others, as listed in the AUTHORS file in the top-level source
7 * directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
36 #include "gmx_lapack.h"
39 F77_FUNC(slaebz,SLAEBZ)(int *ijob,
60 int nab_dim1, nab_offset, ab_dim1, ab_offset, i__1, i__2, i__3, i__4,
62 float d__1, d__2, d__3, d__4;
64 int j, kf, ji, kl, jp, jit;
66 int itmp1, itmp2, kfnew, klnew;
69 nab_offset = 1 + nab_dim1;
72 ab_offset = 1 + ab_dim1;
83 if (*ijob < 1 || *ijob > 3) {
93 for (ji = 1; ji <= i__1; ++ji) {
94 for (jp = 1; jp <= 2; ++jp) {
95 tmp1 = d__[1] - ab[ji + jp * ab_dim1];
96 if (fabs(tmp1) < *pivmin) {
99 nab[ji + jp * nab_dim1] = 0;
101 nab[ji + jp * nab_dim1] = 1;
105 for (j = 2; j <= i__2; ++j) {
106 tmp1 = d__[j] - e2[j - 1] / tmp1 - ab[ji + jp * ab_dim1];
107 if (fabs(tmp1) < *pivmin) {
111 ++nab[ji + jp * nab_dim1];
115 *mout = *mout + nab[ji + (nab_dim1 << 1)] - nab[ji + nab_dim1];
125 for (ji = 1; ji <= i__1; ++ji) {
126 c__[ji] = (ab[ji + ab_dim1] + ab[ji + (ab_dim1 << 1)]) * .5;
131 for (jit = 1; jit <= i__1; ++jit) {
133 if (kl - kf + 1 >= *nbmin && *nbmin > 0) {
136 for (ji = kf; ji <= i__2; ++ji) {
138 work[ji] = d__[1] - c__[ji];
140 if (work[ji] <= *pivmin) {
142 d__1 = work[ji], d__2 = -(*pivmin);
143 work[ji] = (d__1<d__2) ? d__1 : d__2;
147 for (j = 2; j <= i__3; ++j) {
148 work[ji] = d__[j] - e2[j - 1] / work[ji] - c__[ji];
149 if (work[ji] <= *pivmin) {
151 d__1 = work[ji], d__2 = -(*pivmin);
152 work[ji] = (d__1<d__2) ? d__1 : d__2;
161 for (ji = kf; ji <= i__2; ++ji) {
163 i__5 = nab[ji + nab_dim1];
165 i__3 = nab[ji + (nab_dim1 << 1)];
166 i__4 = (i__5>i__6) ? i__5 : i__6;
167 iwork[ji] = (i__3<i__4) ? i__3 : i__4;
169 if (iwork[ji] == nab[ji + (nab_dim1 << 1)]) {
171 ab[ji + (ab_dim1 << 1)] = c__[ji];
173 } else if (iwork[ji] == nab[ji + nab_dim1]) {
175 ab[ji + ab_dim1] = c__[ji];
178 if (klnew <= *mmax) {
180 ab[klnew + (ab_dim1 << 1)] = ab[ji + (ab_dim1 <<
182 nab[klnew + (nab_dim1 << 1)] = nab[ji + (nab_dim1
184 ab[klnew + ab_dim1] = c__[ji];
185 nab[klnew + nab_dim1] = iwork[ji];
186 ab[ji + (ab_dim1 << 1)] = c__[ji];
187 nab[ji + (nab_dim1 << 1)] = iwork[ji];
200 for (ji = kf; ji <= i__2; ++ji) {
201 if (iwork[ji] <= nval[ji]) {
202 ab[ji + ab_dim1] = c__[ji];
203 nab[ji + nab_dim1] = iwork[ji];
205 if (iwork[ji] >= nval[ji]) {
206 ab[ji + (ab_dim1 << 1)] = c__[ji];
207 nab[ji + (nab_dim1 << 1)] = iwork[ji];
216 for (ji = kf; ji <= i__2; ++ji) {
219 tmp2 = d__[1] - tmp1;
221 if (tmp2 <= *pivmin) {
223 d__1 = tmp2, d__2 = -(*pivmin);
224 tmp2 = (d__1<d__2) ? d__1 : d__2;
228 for (j = 2; j <= i__3; ++j) {
229 tmp2 = d__[j] - e2[j - 1] / tmp2 - tmp1;
230 if (tmp2 <= *pivmin) {
232 d__1 = tmp2, d__2 = -(*pivmin);
233 tmp2 = (d__1<d__2) ? d__1 : d__2;
239 i__5 = nab[ji + nab_dim1];
240 i__3 = nab[ji + (nab_dim1 << 1)];
241 i__4 = (i__5>itmp1) ? i__5 : itmp1;
242 itmp1 = (i__3<i__4) ? i__3 : i__4;
244 if (itmp1 == nab[ji + (nab_dim1 << 1)]) {
246 ab[ji + (ab_dim1 << 1)] = tmp1;
248 } else if (itmp1 == nab[ji + nab_dim1]) {
250 ab[ji + ab_dim1] = tmp1;
251 } else if (klnew < *mmax) {
254 ab[klnew + (ab_dim1 << 1)] = ab[ji + (ab_dim1 << 1)];
255 nab[klnew + (nab_dim1 << 1)] = nab[ji + (nab_dim1 <<
257 ab[klnew + ab_dim1] = tmp1;
258 nab[klnew + nab_dim1] = itmp1;
259 ab[ji + (ab_dim1 << 1)] = tmp1;
260 nab[ji + (nab_dim1 << 1)] = itmp1;
267 if (itmp1 <= nval[ji]) {
268 ab[ji + ab_dim1] = tmp1;
269 nab[ji + nab_dim1] = itmp1;
271 if (itmp1 >= nval[ji]) {
272 ab[ji + (ab_dim1 << 1)] = tmp1;
273 nab[ji + (nab_dim1 << 1)] = itmp1;
283 for (ji = kf; ji <= i__2; ++ji) {
284 tmp1 = fabs(ab[ji + (ab_dim1 << 1)] - ab[ji + ab_dim1]);
285 d__3 = fabs(ab[ji + (ab_dim1 << 1)]);
286 d__4 = fabs(ab[ji + ab_dim1]);
287 tmp2 = (d__3>d__4) ? d__3 : d__4;
288 d__1 = (*abstol>*pivmin) ? *abstol : *pivmin;
289 d__2 = *reltol * tmp2;
290 if (tmp1 < ((d__1>d__2) ? d__1 : d__2) || nab[ji + nab_dim1] >= nab[ji + (
294 tmp1 = ab[ji + ab_dim1];
295 tmp2 = ab[ji + (ab_dim1 << 1)];
296 itmp1 = nab[ji + nab_dim1];
297 itmp2 = nab[ji + (nab_dim1 << 1)];
298 ab[ji + ab_dim1] = ab[kfnew + ab_dim1];
299 ab[ji + (ab_dim1 << 1)] = ab[kfnew + (ab_dim1 << 1)];
300 nab[ji + nab_dim1] = nab[kfnew + nab_dim1];
301 nab[ji + (nab_dim1 << 1)] = nab[kfnew + (nab_dim1 << 1)];
302 ab[kfnew + ab_dim1] = tmp1;
303 ab[kfnew + (ab_dim1 << 1)] = tmp2;
304 nab[kfnew + nab_dim1] = itmp1;
305 nab[kfnew + (nab_dim1 << 1)] = itmp2;
308 nval[ji] = nval[kfnew];
318 for (ji = kf; ji <= i__2; ++ji) {
319 c__[ji] = (ab[ji + ab_dim1] + ab[ji + (ab_dim1 << 1)]) * .5;