関連する実験動画
Updated: Feb 7, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
402
効率的な全電子周期フーリエ変換クーロン法
Hieu Q Dinh1, Adam Rettig1, Xintian Feng2
1Department of Chemistry and Chemical Biology, Harvard University, Cambridge, Massachusetts 02138, USA.
The Journal of chemical physics
|February 6, 2026
まとめ
全電子周期クーロン行列構築のための効率的なアルゴリズムを開発し、固体計算を大幅に高速化しました。この手法は、材料科学研究のための密度汎関数理論(DFT)を強化します。
科学分野:
- 計算化学
- 材料科学
- 物性物理学
背景:
- クーロン行列の正確な計算は、電子構造法にとって非常に重要です。
- 周期系に対する既存の方法は、特に全電子基底セットを使用する場合、計算上の課題に直面しています。
- 大規模な固体密度汎関数理論(DFT)計算を処理するには、効率的なアルゴリズムが必要です。
研究 の 目的:
- 全電子周期クーロン行列を構築するための効率的なアルゴリズムを開発すること。
- 固体系のためのより高速で正確なDFT計算を可能にすること。
- 凝集エネルギーと吸着エネルギーの計算を改善すること。
主な方法:
- Ewald和とフーリエ変換クーロン法を組み合わせました。
- 短距離相互作用にガウス密度フィッティングを利用しました。
- 長距離相互作用のために積分直接平面波密度フィッティングスキームを導入しました。
- 全電子基底セットで分散補正PBE汎関数を適用しました。
主要な成果:
- 範囲分離密度フィッティングと比較して桁違いの高速化を達成しました。
- ベンゼン結晶の凝集エネルギーとMgO(001)上のCO吸着を計算しました。
- 既存の文献と良好な一致を示す結果を得ました。
結論:
- 新しいアルゴリズムにより、効率的なガウスベース半局所DFT計算が可能になります。
- 密なk点メッシュと従来の分子ガウス基底セットの使用が容易になります。
- 固体化学および物理学におけるより広範な計算研究への道を開きます。
関連する概念動画
Fast Fourier Transform
952
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
952
Properties of Fourier Transform I
671
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
671
Properties of Fourier Transform II
782
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
782
Discrete Fourier Transform
913
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
913
Basic signals of Fourier Transform
955
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
955
Continuous -time Fourier Transform
918
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
918

