5步算法加速预测[Au25(SR) 19] z集群 (z = 1-, 0, 1+) 的时间
1Universidad Autónoma de Nuevo León, CICFIM,-Facultad de Ciencias Físico-Matemáticas San Nicolás de los Garza Nuevo León 66455 Mexico tlahuicef@gmail.com.
RSC advances
|June 19, 2024
概括
新的计算方法加速了对硫化黄金集群结构的预测. 研究人员开发了一种新的算法和密度函数理论 (DFT-D) 来建模Au25(SR) 19集群,确定一个更稳定的结构.
科学领域:
- 计算化学的计算化学
- 材料科学 材料科学 材料科学
- 纳米技术纳米技术
背景情况:
- 预测硫化黄金集群的结构是计算密集的.
- 现有的Au25(SR) 18集群模型不考虑附加配体的变化.
研究的目的:
- 开发一种更快的方法来预测硫化黄金集群结构.
- 为中性和充电Au25 ((SR) 19集群提出新的结构模型.
主要方法:
- 采用了一个五步算法.
- 使用分散校正密度函数理论 (DFT-D) 的计算.
- 该算法识别了四面体/八面体单位,并按能量排序异构体.
主要成果:
- 确定了中性Au25(SR) 19星团的新型,更稳定的结构,能量比以前报告的模型低0.20 eV.
- 一个具有Au11内核的共同结构被发现是中性和带电Au25(SR) 19星团的能量最小值.
- 新结构和具有C2v对称性的新结构的紫外线可见/圆形二元体形状相似.
结论:
- 开发的算法和DFT-D方法有效地预测了化黄金集群的稳定结构.
- 这些发现为Au25(SR) 19集群的结构多样性和稳定性提供了新的见解.
- 这项工作为复杂的金纳米集群的结构预测提供了更有效的策略.
更多相关视频
相关概念视频
Wald-Wolfowitz Runs Test II
659
The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
659
Definition of z-Transform
1.9K
The z-transform is a powerful mathematical tool used in the analysis of discrete-time signals and systems. It is an essential analytical tool, analogous to the Laplace transform used in continuous-time systems. It plays a crucial role in the analysis of signals and systems, complementing the discrete-time Fourier transform. Both the z-transform and the Laplace transform convert differential or difference equations into algebraic equations, simplifying the process of solving complex problems.
1.9K
Properties of the z-Transform II
541
The property of Accumulation in signal processing is derived by analyzing the accumulated sum of a discrete-time signal and using the time-shifting property to determine its z-transform. This principle reveals that the z-transform of the summed signal is related to the z-transform of the original signal by a multiplicative factor.
Moreover, the convolution property indicates that the convolution of two signals in the time domain corresponds to the product of their z-transforms in the frequency...
Moreover, the convolution property indicates that the convolution of two signals in the time domain corresponds to the product of their z-transforms in the frequency...
541
Inverse z-Transform by Partial Fraction Expansion
821
The inverse z-transform is a crucial technique for converting a function from its z-domain representation back to the time domain. One effective method for finding the inverse z-transform is the Partial Fraction Method, which involves decomposing a function into simpler fractions with distinct coefficients. These fractions correspond to known z-transform pairs, facilitating the inverse transformation process.
To begin the process, the poles of the function are identified and the function is...
To begin the process, the poles of the function are identified and the function is...
821
Difference Equation Solution using z-Transform
775
The z-transform is a powerful tool for analyzing practical discrete-time systems, often represented by linear difference equations. Solving a higher-order difference equation requires knowledge of the input signal and the initial conditions up to one term less than the order of the equation.
The z-transform facilitates handling delayed signals by shifting the signal in the z-domain, which corresponds to delaying the signal in the time domain, and advancing signals by similarly shifting in the...
The z-transform facilitates handling delayed signals by shifting the signal in the z-domain, which corresponds to delaying the signal in the time domain, and advancing signals by similarly shifting in the...
775
Complex Zeros
423
Complex zeros are the solutions to polynomial equations that include imaginary numbers, specifically, numbers of the form a + bi, where a and b are real numbers and i is the imaginary unit defined by i2=-1. These zeros satisfy the equation P(x) = 0, where P(x) is a polynomial with real or complex coefficients. Since the complex number system includes all real numbers, it provides a complete framework for analyzing all possible roots of a polynomial.Every polynomial of degree n≥1 can be...
423


