Merge branch 'master' of git://git.gromacs.org/gromacs
[gromacs/adressmacs.git] / include / nrjac.h
blob966fd514ab08079c5bf211db23a910a809c27c48
1 /*
2 *
3 * This source code is part of
4 *
5 * G R O M A C S
6 *
7 * GROningen MAchine for Chemical Simulations
8 *
9 * VERSION 3.2.0
10 * Written by David van der Spoel, Erik Lindahl, Berk Hess, and others.
11 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
12 * Copyright (c) 2001-2004, The GROMACS development team,
13 * check out http://www.gromacs.org for more information.
15 * This program is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU General Public License
17 * as published by the Free Software Foundation; either version 2
18 * of the License, or (at your option) any later version.
20 * If you want to redistribute modifications, please consider that
21 * scientific software is very special. Version control is crucial -
22 * bugs must be traceable. We will be happy to consider code for
23 * inclusion in the official distribution, but derived work must not
24 * be called official GROMACS. Details are found in the README & COPYING
25 * files - if they are missing, get the official version at www.gromacs.org.
27 * To help us fund GROMACS development, we humbly ask that you cite
28 * the papers on the package - you can find them in the top README file.
30 * For more info, check our website at http://www.gromacs.org
32 * And Hey:
33 * Gromacs Runs On Most of All Computer Systems
36 #ifndef _nrjac_h
37 #define _nrjac_h
39 #include "typedefs.h"
41 #ifdef __cplusplus
42 extern "C" {
43 #endif
45 void jacobi(double **a,int n,double d[],double **v,int *nrot);
46 /*
47 * real **omega = input matrix a[0..n-1][0..n-1] must be symmetric
48 * int natoms = number of rows and columns
49 * real NULL = d[0]..d[n-1] are the eigenvalues of a[][]
50 * real **v = v[0..n-1][0..n-1] the eigenvectors:
51 * v[i][j] is component i of vector j
52 * int *irot = number of jacobi rotations
55 int m_inv_gen(real **m,int n,real **minv);
56 /* Produces minv, a generalized inverse of m.
57 * Inversion is done via diagonalization,
58 * eigenvalues smaller than 1e-6 times the average diagonal element
59 * are assumed to be zero.
60 * For zero eigenvalues 1/eigenvalue is set to zero for the inverse matrix.
61 * Returns the number of zero eigenvalues.
64 #ifdef __cplusplus
66 #endif
68 #endif