fast Fourier transform. Abstract The broad problem of matrix algebra is taken up from the perspective of functional programming. A key question is how arrays should be represented in order to admit good implementations of well-known eecient algorithms, and whether functional architecture sheds any new light on these or other solutions. It relates directly to disarming the \ag-gregate update" pr...

This paper reports an attempt to structurally characterize isolated ligand-protected gold nanoclusters by means of gas-phase InfraRed Multiple Photon Dissociation (IRMPD) spectroscopy compared quantum chemistry Density Functional Theory (DFT) calculations. The mass-selected kilodalton nanocluster complexes consist ten or eleven atoms that are bound glutathione phosphine ligands and produced Ele...

We present a spectrally accurate numerical method for finding non-trivial timeperiodic solutions of non-linear partial differential equations. The method is based on minimizing a functional (of the initial condition and the period) that is positive unless the solution is periodic, in which case it is zero. We solve an adjoint PDE to compute the gradient of this functional with respect to the in...

We introduce an error resilient distributed computing method based on extension of the channel polarization phenomenon to algorithms. The leverages algorithmic split operation that transforms two identical compute nodes into slow and fast workers, which parallels in Polar Codes. This preserves average runtime, analogous conservation Shannon capacity polarization. By leveraging a recursive const...