MOIST Documentation#
Welcome to the documentation for MOIST, the Modular and Open-source Implicit Solvation Toolkit. MOIST is a library designed to provide tools and methods from the field of implicit and statistical solvation, especially in the context of quantum computational chemistry. This documentation describes the usage and functionality of the moist library.
Note
MOIST is currently in a pre-release state. This version only includes the cavity construction capabilities of the Modular and Open-source Implicit Solvation Toolkit.
References#
R. P. Brent. Algorithms for Minimization Without Derivatives. Prentice-Hall, Englewood Cliffs, NJ, 1973. URL: https://maths-people.anu.edu.au/~brent/pub/pub011.html.
R. H. Byrd, P. Lu, J. Nocedal, and C. Zhu. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput., 16:1190–1208, 1995. doi:10.1137/0916069.
S. Ehlert, M. Stahn, S. Spicher, and S. Grimme. Robust and efficient implicit solvation model for fast semiempirical methods. J. Chem. Theory Comput., 2021. doi:10.1021/acs.jctc.1c00471.
D. C.-L. Fong and M. A. Saunders. LSMR: an iterative algorithm for sparse least-squares problems. SIAM J. Sci. Comput., 33:2950–2971, 2011. doi:10.1137/10079687X.
P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. Maintaining LU factors of a general sparse matrix. Linear Algebra Appl., 88–89:239–270, 1987. doi:10.1016/0024-3795(87)90112-1.
W. Im, M. S. Lee, and C. L. Brooks. Generalized born model with a simple smoothing function. J. Comput. Chem., 2003. doi:10.1002/jcc.10321.
A. Klamt and M. Diedenhofen. A refined cavity construction algorithm for the conductor-like screening model. J. Comput. Chem., 39:1648–1655, 2018. doi:10.1002/jcc.25342.
D. Kraft. A software package for sequential quadratic programming. Technical Report DFVLR-FB 88-28, DLR German Aerospace Center, 1988.
D. Kraft. Algorithm 733: TOMP – Fortran modules for optimal control calculations. ACM Trans. Math. Softw., 20:262–281, 1994. doi:10.1145/192115.192124.
A. W. Lange and J. M. Herbert. A smooth, nonsingular, and faithful discretization scheme for PCM: the switching/Gaussian approach. J. Chem. Phys., 2010. doi:10.1063/1.3511297.
A. V. Marenich, C. J. Cramer, and D. G. Truhlar. Universal solvation model based on solute electron density and on a continuum model of the solvent defined by the bulk dielectric constant and atomic surface tensions. J. Phys. Chem. B, 2009. doi:10.1021/jp810292n.
J. L. Morales and J. Nocedal. Remark on algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization. ACM Trans. Math. Softw., 38:7, 2011. doi:10.1145/2049662.2049669.
C. C. Paige and M. A. Saunders. LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw., 8:43–71, 1982. doi:10.1145/355984.355989.
L. Wittmann, M. Garcia-Rates, and C. Riplinger. Analytical first derivatives of the SCF energy for the conductor-like PCM with non-static radii. J. Comput. Chem., 2025. doi:10.1002/jcc.70099.
L. Wittmann and A. Pausch. A smooth and fully differentiable molecular cavity based on discretization via reference-onto-surface projection. ChemRxiv, 2026. doi:10.26434/chemrxiv.15003893/v2.
C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw., 23:550–560, 1997. doi:10.1145/279232.279236.