Results 251 to 260 of about 129,078 (307)

Phase Engineering of Nanomaterials (PEN): Evolution, Current Challenges, and Future Opportunities

open access: yesAdvanced Materials, EarlyView.
This review summarizes the synthesis, phase transition, advanced characterization spanning ex situ to in situ and operando techniques, and diverse applications of phase engineering of nanomaterials (PEN). It further outlines key challenges and future opportunities, such as phase stability, architecture control, and artificial intelligence (AI)‐driven ...
Ye Chen   +7 more
wiley   +1 more source

Theory Guided Fine‐Tune of Strain Effects in Pt Ternary Alloy via Rare Earth Templating: Achieving High Performance PEMFCs Catalysts

open access: yesAdvanced Materials, EarlyView.
Theory‐guided strain engineering and rare‐earth templating are combined to create Pt5(Ce)Co@Pt multilayer nanoparticles with a Pt5Co‐like sublayer that fine‐tunes *OH binding near the ORR volcano optimum. The resulting catalyst delivers exceptional mass activity and remarkable long‐term PEMFC durability, revealing a strategy for designing highly active
Qi Zhang   +15 more
wiley   +1 more source

Targeted Modulation of d‐Band Center in MoS2 Interlayer With n‐Type Co/Fe Dopants Accelerating Sulfur Reaction Kinetics in Lithium‐Sulfur Batteries

open access: yesAdvanced Materials, EarlyView.
A targeted modulation of the MoS2 electronic structure is achieved via substitutional n‐type Co/Fe co‐doping. This strategy triggers S‐mediated d‐p hybridization, optimizing the binding affinity with polysulfides to establish a volcano‐shaped relationship between the d‐band center and catalytic activity.
Junhyuk Ji   +6 more
wiley   +1 more source

The Fast Fourier Transform

SIAM Journal on Control and Optimization, 2007
Fast Fourier transforms (FFTs) are fast algorithms, i.e., of low complexity, for the computation of the discrete Fourier transform (DFT) on a finite abelian group. They are among the most important algorithms in applied and engineering mathematics and in computer science, in particular for one- and multidimensional systems theory and signal processing.
Ulrich Oberst
exaly   +2 more sources

A Generalization of the Fast Fourier Transform

IEEE Transactions on Computers, 1970
A procedure for factoring of the N×N matrix representing the discrete Fourier transform is presented which does not produce shuffled data. Exactly one factor is produced for each factor of N, resulting in a fast Fourier transform valid for any N. The factoring algorithm enables the fast Fourier transform to be implemented in general with four nested ...
exaly   +2 more sources

Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

SIAM Journal of Scientific Computing, 1996
Accuracy of the discrete Fourier transform (DFT) and the fast Fourier transform (FFT) depends on the accuracy of the twiddle factors entirely. For accurate twiddle factor tables, this paper recommends to compute the sine/cosine functions with high precision arithmetic along the algorithms in terms of faster converging approximations, such as rational ...
exaly   +2 more sources

Home - About - Disclaimer - Privacy