KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations.

ACM Transactions on Mathematical Software (Impact Factor: 3.29). 03/2009; 36. DOI: 10.1145/1499096.1499099
Source: DBLP

ABSTRACT We describe the design and implementation of KSSOLV, a MATLAB toolbox for solving a class of nonlinear eigenvalue problems known as the Kohn-Sham equations. These types of problems arise in electronic structure calculations, which are nowadays essential for studying the microscopic quantum mechanical properties of molecules, solids, and other nanoscale materials. KSSOLV is well suited for developing new algorithms for solving the Kohn-Sham equations and is designed to enable researchers in computational and applied mathematics to investigate the convergence properties of the existing algorithms. The toolbox makes use of the object-oriented programming features available in MATLAB so that the process of setting up a physical system is straightforward and the amount of coding effort required to prototype, test, and compare new algorithms is significantly reduced. All of these features should also make this package attractive to other computational scientists and students who wish to study small- to medium-size systems.

Download full-text


Available from: Juan C Meza, Jun 21, 2015
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper a family of fixed point algorithms, generalizing the \PM method, is considered. A previous work studied the convergence of the methods. Presented here is a second part of the analysis, concerning the introduction of some acceleration techniques into the iterative procedures. The purpose of the research is two-fold: one is improving the performance of the methods in case of convergence and the second one is widening their application when generating traveling waves in nonlinear dispersive wave equations, transforming some divergent into convergent cases. Two families of acceleration techniques are considered: the vector extrapolation methods and the Anderson acceleration methods. A comparative study through several numerical experiments is carried out.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a new method for solving parametrized linear systems. Under certain assumptions on the parametrization, solutions to the linear systems for all parameters can be accurately approximated by linear combinations of solutions to linear systems for a small set of fixed parameters. Combined with either direct solvers or preconditioned iterative solvers for each linear system with a fixed parameter, the method is particularly suitable for situations when solutions to a large number of distinct parameters or a large number of right hand sides are required. The method is also simple to parallelize. We demonstrate the applicability of the method to the calculation of the response functions in electronic structure theory. We demonstrate the numerical performance of the method using a benzene molecule and a DNA molecule.
    SIAM Journal on Scientific Computing 11/2013; 36(6). DOI:10.1137/130944825 · 1.94 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: First-principles density functional theory (DFT) calculations for the electronic structure problem require a solution of the Kohn–Sham equation, which requires one to solve a nonlinear eigenvalue problem. Solving the eigenvalue problem is usually the most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors can quickly become prohibitive for large scale problems. The Chebyshev-filtered subspace iteration (CheFSI) method avoids most of the explicit computation of eigenvectors and results in a significant speedup over iterative diagonalization methods for the DFT self-consistent field (SCF) calculations. However, the original formulation of the CheFSI method utilizes a sparse iterative diagonalization at the first SCF step to provide initial vectors for subspace filtering at latter SCF steps. This diagonalization is expensive for large scale problems. We develop a new initial filtering step to avoid completely this diagonalization, thus making the CheFSI method free of sparse iterative diagonalizations at all SCF steps. Our new approach saves memory usage and can be two to three times faster than the original CheFSI method.
    Journal of Computational Physics 10/2014; 274:770–782. DOI:10.1016/ · 2.49 Impact Factor