Article

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

ACM Trans. Math. Softw 01/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.

1 Bookmark
 · 
368 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a Preconditioned Locally Harmonic Residual (PLHR) method for computing several interior eigenpairs of a generalized Hermitian eigenvalue problem, without traditional spectral transformations, matrix factorizations, or inversions. PLHR is based on a short-term recurrence, easily extended to a block form, computing eigenpairs simultaneously. PLHR can take advantage of Hermitian positive definite preconditioning, e.g., based on an approximate inverse of an absolute value of a shifted matrix, introduced in [SISC, 35 (2013), pp. A696--A718]. Our numerical experiments demonstrate that PLHR is efficient and robust for large-scale interior eigenvalue computations, especially if memory requirements are tight.
    07/2014;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we investigate the effectiveness of the Anderson acceleration method applied to modified Picard iteration for nonlinear problems arising in variably saturated flow modeling. While many authors have studied the relative merits of Newton’s method and modified Picard iteration in this context, the combination of Anderson acceleration and modified Picard iteration has not been investigated for these problems until recently. Since modified Picard iteration can be slow to converge, we investigate the use of Anderson acceleration to provide faster convergence while maintaining the robustness and lower memory requirements of modified Picard iteration relative to Newton’s method. Results indicate that Anderson acceleration significantly improves not only convergence speed but also robustness of modified Picard iteration and can often provide faster solutions than Newton’s method without the need for derivative computations.
    Advances in Water Resources 03/2012; 38:92–101. · 2.78 Impact Factor

Full-text (2 Sources)

Download
85 Downloads
Available from
May 29, 2014