English
Related papers

Related papers: Efficient Parallel Linear Scaling Method to get th…

200 papers

Density matrix perturbation theory [Niklasson and Challacombe, Phys. Rev. Lett. 92, 193001 (2004)] is generalized to canonical (NVT) free energy ensembles in tight-binding, Hartree-Fock or Kohn-Sham density functional theory. The canonical…

Chemical Physics · Physics 2015-12-09 Anders M. N. Niklasson , Marc J. Cawkwell , Emanuel H. Rubensson , Elias Rudberg

Density peaks clustering (DP) has the ability of detecting clusters of arbitrary shape and clustering non-Euclidean space data, but its quadratic complexity in both computing and storage makes it difficult to scale for big data. Various…

Machine Learning · Computer Science 2024-06-19 Ji Xu , Tianlong Xiao , Jinye Yang , Panpan Zhu

Density functional theory (DFT) offers a desirable balance between quantitative accuracy and computational efficiency in practical many-electron calculations. Its central component, the exchange-correlation energy functional, has been…

Space-time adaptive processing (STAP) is one of the most effective approaches to suppressing ground clutters in airborne radar systems. It basically takes two forms, i.e., full-dimension STAP (FD-STAP) and reduced-dimension STAP (RD-STAP).…

Information Theory · Computer Science 2022-02-11 Di Song , Shengyao Chen , Feng Xi , Zhong Liu

We propose a novel method for the efficient and accurate iterative solution of frequency domain integral equations (IEs) that are used for large/multi-scale electromagnetic scattering problems. The proposed method uses a novel…

Numerical Analysis · Mathematics 2025-12-22 Enes Koç , Mert Kalfa , Secil E. Dogan , Vakur B. Ertürk

Kernel matrices appear in machine learning and non-parametric statistics. Given $N$ points in $d$ dimensions and a kernel function that requires $\mathcal{O}(d)$ work to evaluate, we present an $\mathcal{O}(dN\log N)$-work algorithm for the…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-01-11 Chenhan D. Yu , William B. March , George Biros

Electronic density of states (DOS) is a key factor in condensed matter physics and material science that determines the properties of metals. First-principles density-functional theory (DFT) calculations have typically been used to obtain…

Materials Science · Physics 2019-04-12 Byung Chul Yeo , Donghun Kim , Chansoo Kim , Sang Soo Han

We present a perturbative approach within the scope of Kohn-Sham density functional theory (DFT). The method is based on the exact exchange-only optimized effective potential method, and correlation is included via perturbation expansion…

Chemical Physics · Physics 2007-05-23 P. Sule

The One Sided Crossing Minimization (OSCM) problem is an optimization problem in graph drawing that aims to minimize the number of edge crossings in bipartite graph layouts. It has practical applications in areas such as network…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-30 Bogdan-Ioan Popa , Adrian-Marius Dumitran , Livia Magureanu

This chapter presents controlled approximations of Kohn-Sham density functional theory (DFT) that enable very large scale simulations. The work is motivated by the study of defects in crystalline solids, though the ideas can be used in…

Materials Science · Physics 2021-12-14 Kaushik Bhattacharya , Vikram Gavini , Michael Ortiz , Mauricio Ponga , Phanish Suryanarayana

The self consistent version of the density functional theory (DFT) is presented, which allows to calculate the ground state and dynamic properties of finite multi-electron systems such as atoms, molecules and clusters. The exact functional…

Condensed Matter · Physics 2007-05-23 M. Ya. Amusia , V. R. Shaginyan

The use of integral equation methods for the efficient numerical solution of PDE boundary value problems requires two main tools: quadrature rules for the evaluation of layer potential integral operators with singular kernels, and fast…

Numerical Analysis · Mathematics 2017-06-28 Manas Rachh , Andreas Klöckner , Michael O'Neil

We address the communication overhead of distributed sparse matrix-(multiple)-vector multiplication in the context of large-scale eigensolvers, using filter diagonalization as an example. The basis of our study is a performance model which…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-27 Andreas Alvermann , Georg Hager , Holger Fehske

Classical density functional theory (DFT) of fluids is a valuable tool to analyze inhomogeneous fluids. However, few numerical solution algorithms for three-dimensional systems exist. Here we present an efficient numerical scheme for fluids…

Parallelization techniques have become ubiquitous for accelerating inference and training of deep neural networks. Despite this, several operations are still performed in a sequential manner. For instance, the forward and backward passes…

Machine Learning · Computer Science 2023-10-30 Federico Danieli , Miguel Sarabia , Xavier Suau , Pau Rodríguez , Luca Zappella

The parallel full approximation scheme in space and time (PFASST) is a parallel-in-time integrator that allows to integrate multiple time-steps simultaneously. It has been shown to extend scaling limits of spatial parallelization strategies…

Numerical Analysis · Mathematics 2021-03-18 Oliver Sander , Ruth Schöbel , Robert Speck

The dynamical mean field theory (DMFT) has become a standard technique for the study of strongly correlated models and materials overcoming some of the limitations of density functional approaches based on local approximations. An important…

Strongly Correlated Electrons · Physics 2015-10-28 K. Hallberg , D. J. García , Pablo S. Cornaglia , Jorge I. Facio , Y. Núñez-Fernández

The widely-used Kohn-Sham implementation of density functional theory (DFT) maps a system of interacting electrons onto an auxiliary non-interacting one and is presumably inaccurate for strongly correlated materials. We present a concrete…

Strongly Correlated Electrons · Physics 2024-05-31 Jamin Kidd , Ruiqi Zhang , Shao-Kai Jian , Jianwei Sun

Detecting maximal square submatrices of ones in binary matrices is a fundamental problem with applications in computer vision and pattern recognition. While the standard dynamic programming (DP) solution achieves optimal asymptotic…

Data Structures and Algorithms · Computer Science 2025-07-22 Swastik Bhandari

Many applications in computational science require computing the elements of a function of a large matrix. A commonly used approach is based on the the evaluation of the eigenvalue decomposition, a task that, in general, involves a…

Computational Physics · Physics 2014-07-04 Marco Nava , Michele Ceriotti , Chaim Dryzun , Michele Parrinello