Skip to content

Releases: DedalusProject/dedalus

Dedalus v3.0.3

07 Sep 18:39
Compare
Choose a tag to compare

What's Changed

  • Add built-in cprofile tooling by @kburns in #278
  • Profiling enhancements by @kburns in #288
  • Add ability to specify starting eigenvector in sparse eigs (328a4f4)
  • CartesianTrace with rank > 2 by @lecoanet in #292
  • Fix dispatching issues with get_basis on cartesian coordinates by @kburns in #294
  • Fix Hermitian transpose by @csskene in #297
  • Attempt to fix regularity recombination when array has size 0 by @csskene in #286
  • Polar components on tensors by @lecoanet in #295

Full Changelog: v3.0.2...v3.0.3

Dedalus v3.0.2

29 Jan 22:36
Compare
Choose a tag to compare

What's Changed

  • Fixed bug in setting scales with arrays (e.g. when loading data from hdf5) (d253239)
  • Updated sparse matrix routines for compatibility with scipy v1.12 (1885f70)
  • Added MPI explicitly to linking arguments during build, to help when not explicitly compiling with mpicc (bbb4f93)

Full Changelog: v3.0.1...v3.0.2

Dedalus v3.0.1

08 Jan 21:43
Compare
Choose a tag to compare

What's Changed

  • Reuse the LU decomposition when solving for left eigenvectors using the sparse solver by @csskene in #277
  • Patch a few distributor methods that weren't updated to v3.0 API and rerun tutorials (c5ae610)

Full Changelog: v3.0.0...v3.0.1

Dedalus v3.0.0

30 Dec 22:14
Compare
Choose a tag to compare

This is the first official release of v3 of Dedalus, which entails substantial restructuring from v2 to support:

  • curvilinear bases
  • tensorial equation entry (div, grad, curl)
  • higher-order problem formulations
  • problems involving fields with different dimensionalities

Supported bases now include:

  • Fourier (real and complex)
  • Jacobi (including Chebyshev and Legendre)
  • Annulus (using rational Chebyshev functions)
  • Disk (using one-sided Jacobi polynomials)
  • Sphere (using spin-weighted spherical harmonics)
  • SphericalShell (using rational Chebyshev functions)
  • Ball (using one-sided Jacobi polynomials)

Other changes are documented in the Changes from Dedalus v2 docs.

Dedalus v2.2207

27 Jul 15:30
Compare
Choose a tag to compare

Note: This is expected to be the last major v2 release. While we plan to continue issuing bugfixes and backporting major performance improvements and minor API additions from v3, we encourage new users to begin using v3.

Feature additions:

  • Transposed LU factorizations for the direct solution of bordered problems without Dirichlet preconditioning. This enables the efficient use of e.g. integral boundary conditions (e1541b9).
  • Interpolation can now be triggered by using a field/operator's __call__ method, like u(y='left') (2489221).
  • Left eigenvectors now available with the sparse eigenvalue solver (ad264a4).
  • Simplified stat logging has be backported from v3 (73981d8).

Performance changes:

  • Improved sparse matrix applications and other performance improvements have been backported from v3 (36c8e14).

Dedalus v2.2006

16 Sep 16:58
Compare
Choose a tag to compare

Feature additions:

  • New Legendre polynomial basis (77d92e5).
  • Problems now support variables marked as constant in the coupled dimension (see 1D Lane Emden example) (77d92e5).
  • New methods for computing CFL times based on diffusive terms in conservative and non-conservative form (6e2cec2).
  • Grid spacings are now available in the parsing namespace as e.g. 'sx' for the 'x' dimension (71219d1).
  • Number of tau rows removed per equation can now be specified with the 'tau' keyword in Problem.add_equation (ce8c131).
  • New command-line options get_config and get_examples for copying the configuration file and example scripts (cc0373e).

Behavior modifications:

  • Default value of 'ncc_cutoff' changed from 1e-10 to 1e-6 to produce more banded NCC matrices (7efb884)
  • Default value of 'entry_cutoff' changed from 0 to 1e-12 to prevent rounding errors from reducing matrix sparsity (7efb884).
  • Hermitian symmetry for real problems is now explicitly enforced every 100 iterations by default. This can be modified via the 'enforce_real_cadence' keyword for IVP solvers (5b3be57).

Performance changes:

  • Improved strategy for reducing the number of transforms when evaluating RHS terms (0ce1482).

Dedalus v2.1905

16 Sep 17:11
Compare
Choose a tag to compare
Version bump

hg hash: c1f074b4349be017f00780cfdbcbce1f61b24cc2

Dedalus v2.1810

16 Sep 17:12
Compare
Choose a tag to compare
Version bump

hg hash: da23b4184fc0287f8d81019e4b3435234f423be4