BEEMs

  • Level of openness 3 ★★★
  • Document quality 2 ★★☆

BEEMs is a Bayesian optimization tool of Effective Models (BEEMs). In BEEMs, the quantum lattice model solver HΦ is used as a forward problem solver to compute the magnetisation curve based on the given Hamiltonian. The deviation between the obtained magnetisation curve and the target magnetisation curve is used as a cost function, and the Bayesian optimization library PHYSBO is used to propose the next candidate point of the Hamiltonian for searching the minimum cost function

To Detail

QDS

  • Level of openness 1 ★☆☆
  • Document quality 1 ★☆☆

QDS (Quantum Dynamics Simulator) is a program for computing magnetization curves and spectra of electron-spin resonance (ESR) in molecular magnets. Input data of this program can be magnetic interactions, the shape of a molecule, etc. Calculation is carried out with the combination of exact diagonalization, the quantum master equation, and the Kubo formula. It can be chosen whether the dissipation exists or not in the calculations of dynamical magnetization curves.

To Detail

k-ep

  • Level of openness 3 ★★★
  • Document quality 1 ★☆☆

Fortran codes for computing the specified k-th eigenvalue and eigenvector for generalized symmetric definite eigenvalue problems. Sylvester’s law of inertia is employed as the fundamental principle in computations, and the sparse direct linear solver (MUMPS) is used in the main routine. By inputting Hamiltonian and its overlap matrices, user can compute electron’s energy and its wave function in the specified k-th energy level.

To Detail

KOBEPACK

  • Level of openness 3 ★★★
  • Document quality 0 ☆☆☆

An open-source program package for numerical diagonalization based on the Lanczos method, specialized for spin chains with unit spin magnitude, S=1. This package, which uses another open-source program package, TITPACK, calculates eigenenergies and eigenvectors of ground states and low-lying excited states of spin chains with finite length. By the subspace partitioning method, both memory and cpu-time requirements are considerably reduced.

To Detail