Skip to content

Releases: william-dawson/NTPoly

Version 2.7.0

04 Sep 16:04
Compare
Choose a tag to compare

Since 2.6.0 never got past beta, this wraps in those changes.

Features:

  • Logger can now print to a file, or an open file stream, so you can integrate it into your code
  • Pivoted cholesky decomposition for generating localized orbitals

Bug Fixes:

  • Fixed code hang when openmp threads are capped to 1
  • Fixed a bug that can emerge in the PM solver when exact convergence leads to division by zero

Version 2.6 Beta

16 Nov 10:28
8d04484
Compare
Choose a tag to compare
Version 2.6 Beta Pre-release
Pre-release

This is a beta version for integration testing of the log.

Version 2.5.1

14 Oct 11:49
d7d0193
Compare
Choose a tag to compare

This minor release fixes any compilation bug from gcc version 10. It also has some code cleanup from when I overused iso_c_bindings.

Version 2.5

28 May 02:01
14402bb
Compare
Choose a tag to compare

Features:

  • Ability to gather a matrix on to each process locally.
  • Ability to change a matrix to a fixed sparsity pattern to facilitate conversion.

Bug Fixes:

  • Some bug fixes related to the formatting of matrix market output.

Miscellaneous:

  • Automatic Code Linting
  • Some cleaning up of constants

Version 2.4.3 Beta

21 May 04:01
40b2433
Compare
Choose a tag to compare
Version 2.4.3 Beta Pre-release
Pre-release

Another beta for integration testing.

Version 2.4.2 Beta

11 May 06:54
f972047
Compare
Choose a tag to compare
Version 2.4.2 Beta Pre-release
Pre-release

Another beta for integration.

Version 2.4.1 Beta

21 Apr 05:32
e7d98ed
Compare
Choose a tag to compare
Version 2.4.1 Beta Pre-release
Pre-release

A beta release for checking integration.

Version 2.4

04 Feb 08:34
f668b9c
Compare
Choose a tag to compare

The main improvement in 2.4 is related to dense matrix operations. As a backup plan, NTPoly can convert to dense matrix multiplication when it determines that a block is not very sparse. I noticed that there were some potential bugs in this code when using older compilers. I also discovered that the performance was sub-optimal because we were still transposing those matrices using the sparse data structures. Version 2.4 fixes those issues, and in general improves the code.

As another minor improvement, I've set the matrix maps module to allow optional arguments.

Finally, we've fully switched from Travis-CI to Github actions, and I've removed any legacy files that were only there for Travis.

Version 2.3.2

14 Nov 04:59
10836f5
Compare
Choose a tag to compare

Version 2.3.2 contains some fixes.

Bug Fixes:

  • @vyu16 found some memory that was not being deallocated.

Miscellaneous:

  • Build system fixes for newer versions of OpenMPI.
  • Continuous integration simplified.
  • Code cleanup with the flake8 tool.

Version 2.3.1

10 May 07:00
b034c9e
Compare
Choose a tag to compare

Version 2.3.1 contains some fixes and minor improvements.

Bug Fixes:

  • Major fix to the implementation of the purification based extrapolation
    technique (thanks to Victor Yu).

Features:

  • Rubennson's Scale and Fold purification technique.

Miscellaneous:

  • cmake now automatically handles the use of position independent code.
  • More options for cmake.
  • Improvements to the CI system.

I would note that the Scale and Fold technique requires knowledge about the
homo and lumo band locations, which makes it less easy to use. However, the
performance is good, so I think this should at least be included as a
benchmark to compare new methods against.

I hope that this new version of NTPoly is easier to compile. I am also planning
on adding it to the SPACK package manager soon.