*
* Copyright (c) 1991-2000, University of Groningen, The Netherlands.
* Copyright (c) 2001-2004, The GROMACS development team.
- * Copyright (c) 2012,2014,2018, by the GROMACS development team, led by
+ * Copyright (c) 2012,2014,2018,2019, by the GROMACS development team, led by
* Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
* and including many others, as listed in the AUTHORS file in the
* top-level source directory and at http://www.gromacs.org.
* a matrix, i.e. eigenvector j starts at offset j*n, and
* is of length n.
*/
-void
-eigensolver(real * a,
- int n,
- int index_lower,
- int index_upper,
- real * eigenvalues,
- real * eigenvec);
-
+void eigensolver(real* a, int n, int index_lower, int index_upper, real* eigenvalues, real* eigenvec);
/*! \brief Sparse matrix eigensolver.
*
* maxiter=100000 should suffice in most cases!
*/
-void
-sparse_eigensolver(gmx_sparsematrix_t * A,
- int neig,
- real * eigenvalues,
- real * eigenvectors,
- int maxiter);
+void sparse_eigensolver(gmx_sparsematrix_t* A, int neig, real* eigenvalues, real* eigenvectors, int maxiter);
#endif