ARTÍCULO
TITULO

Test of Computational Approaches for Gold-Thiolate Clusters Calculation

Nadezhda N. Nikitina    
Daria A. Pichugina    
Alexander V. Oleynichenko    
Oxana N. Ryzhova    
Kirill E. Kopylov    
Vladimir V. Krotov    
Nikolay E. Kuz?menko    

Resumen

High-level procedures (MP2, CCSD, CCSD(T)) and reliable experimental data have been used to assess the performance of a variety of exchange-correlation functionals for the calculation of structures and energies of small models of thiolate-protected gold clusters. Clusters represent rather complicated objects for examination, therefore the simple models including Au2, AuS were considered to find an appropriate method to calculate Au-Au and Au-S interactions in protected clusters. The mean unsigned errors of the quantum chemical methods were evaluated via reliable experimental bond distances and dissociation energies of Au2 and AuS. Based on the calculation, the SVWN5, TPSS+D3, PBE96+D3, and PBE0+D3 were found to give the most reliable results and can be recommended for calculation of the structure and properties of thiolate-protected gold clusters. The influence of the relativistic corrections calculated in Dirac-Coulomb-Breit framework and inclusion of dispersion corrections on the structure and energy of thiolate-protected gold clusters have been analyzed.

 Artículos similares

       
 
Daniele Granata, Alberto Savino and Alex Zanotti    
The present study aimed to investigate the capability of mid-fidelity aerodynamic solvers in performing a preliminary evaluation of the static and dynamic stability derivatives of aircraft configurations in their design phase. In this work, the mid-fidel... ver más
Revista: Aerospace

 
Nikolaos Bakas    
Function approximation is a fundamental process in a variety of problems in computational mechanics, structural engineering, as well as other domains that require the precise approximation of a phenomenon with an analytic function. This work demonstrates... ver más
Revista: Computation

 
Giorgio Lazzarinetti, Riccardo Dondi, Sara Manzoni and Italo Zoppis    
Solving combinatorial problems on complex networks represents a primary issue which, on a large scale, requires the use of heuristics and approximate algorithms. Recently, neural methods have been proposed in this context to find feasible solutions for r... ver más
Revista: Algorithms

 
Ken Jom Ho, Ender Özcan and Peer-Olaf Siebers    
Solving multiple objective optimization problems can be computationally intensive even when experiments can be performed with the help of a simulation model. There are many methodologies that can achieve good tradeoffs between solution quality and resour... ver más
Revista: Algorithms

 
Marcos E. González Laffitte and Peter F. Stadler    
The comparison of multiple (labeled) graphs with unrelated vertex sets is an important task in diverse areas of applications. Conceptually, it is often closely related to multiple sequence alignments since one aims to determine a correspondence, or more ... ver más
Revista: Algorithms