- 08 Aug, 2018 1 commit
-
-
Pavel Kus authored
-
- 01 Aug, 2018 1 commit
-
-
Pavel Kus authored
this commit does not work, the generalized EVP problems fail from 2 reasons: - Cannons algorithm does not work for the processor grid shape we use at the moment in tests (It only works if num. of process columns is a multiple of num. of process rows, which is not true in ELPA for 2 mpi tasks) - Cannons algorithm does not work as integrated to ELPA for larger matrices (not clear why at the moment) There are 2 new tests, which should work - test_cannon.c: it tests the new algorithm without going through Fortran, as it has been delivered - test_c_bindings: it tests transfering a 2D fortran matrix to C and back, as it is done with the cannons algorithm in the normal ELPA tests
-
- 15 Jun, 2018 1 commit
-
-
Andreas Marek authored
-
- 12 Jun, 2018 1 commit
-
-
Andreas Marek authored
-
- 25 May, 2018 1 commit
-
-
Pavel Kus authored
-
- 24 May, 2018 1 commit
-
-
Pavel Kus authored
-
- 22 May, 2018 1 commit
-
-
Pavel Kus authored
on selected mpi ranks using suppress_warnings option
-
- 11 May, 2018 2 commits
-
-
Andreas Marek authored
-
Andreas Marek authored
-
- 18 Apr, 2018 3 commits
- 05 Feb, 2018 5 commits
-
-
Pavel Kus authored
instead, blacs context has to be set beforehand
-
Pavel Kus authored
added possibility to re-use the already decomposed matrix B in the generalized problem Added respective test
-
Pavel Kus authored
* tested with elpa1 only (should be sufficient) * not using Hermitian multiply at the moment * requires scalapack
-
Pavel Kus authored
-
Pavel Kus authored
and some modifications in test.f90
-
- 31 Jan, 2018 1 commit
-
-
Andreas Marek authored
-
- 03 Jan, 2018 1 commit
-
-
Andreas Marek authored
-
- 01 Dec, 2017 1 commit
-
-
Andreas Marek authored
-
- 28 Nov, 2017 1 commit
-
-
Andreas Marek authored
-
- 27 Nov, 2017 1 commit
-
-
Andreas Marek authored
-
- 07 Nov, 2017 3 commits
-
-
Pavel Kus authored
-
Pavel Kus authored
-
Pavel Kus authored
This test was wrong, it was computing A * A^T instead of A^T * A. The latter is correct since our implementation of Cholesky decomposition stores the triangular matrix in the upper triangle The test was passing only because the Cholesky decomposition was tested with diagonal matrix only, than this does not matter.
-
- 30 Oct, 2017 1 commit
-
-
Pavel Kus authored
-
- 26 Oct, 2017 1 commit
-
-
Lorenz Huedepohl authored
To be used like this class(elpa_t), pointer :: e class(elpa_autotune_t), pointer :: tune_state e => elpa_allocate() call e%set(...) [...] assert_elpa_ok(e%setup()) tune_state => e%autotune_setup(ELPA_AUTOTUNE_FAST, ELPA_AUTOTUNE_DOMAIN_REAL) ! Autotuning loop, continues until all combinations have been tried do while (e%autotune_step(tune_state)) ! Do the steps that are representative of your calculation call e%eigenvectors(a, ev, z, error) end do ! Fix best parameters, and de-allocate the autotune object call e%autotune_set_best(tune_state) call elpa_autotune_deallocate(tune_state)
-
- 25 Oct, 2017 3 commits
- 11 Sep, 2017 2 commits
-
-
Andreas Marek authored
-
Andreas Marek authored
But allow this in cholesky and hermitian multiply test
-
- 10 Sep, 2017 1 commit
-
-
Andreas Marek authored
-
- 09 Sep, 2017 2 commits
-
-
Andreas Marek authored
-
Andreas Marek authored
It is planned to add another matrix type for the tests. The names of the prepare routines have become a bit inconsistent and confusing. Thus the rename
-
- 03 Sep, 2017 2 commits
- 01 Sep, 2017 2 commits
- 24 Aug, 2017 1 commit
-
-
Andreas Marek authored
-