This paper studies projective scaling trajectories, which are the trajectories obtained by following the infinitesimal version of Karmarkar's linear programming algorithm. A nonlinear change of ...

A key algorithm that quietly empowers and simplifies our electronics is the Fourier transform, which turns the graph of a signal varying in time into a graph that describes it in terms of its ...

A new algorithm performs Fourier transforms using a minimal number of samples. The fast Fourier transform, one of the most important algorithms of the 20th century, revolutionized signal processing.

This paper introduces new techniques for the efficient computation of a Fourier transform on a finite group. We present a divide and conquer approach to the computation. The divide aspect uses ...

Transforming light: illustration of how an arbitrary linear transform can be achieved in an all-optical system using diffractive surfaces (Courtesy: Ozcan Lab/UCLA) Researchers in the US have shown ...