Publications related to Efficient Approximate Scaling of Spherical Functions in the Fourier Domain With Generalization to Hyperspheres

An optimal preconditioned FFT-accelerated finite element solver for homogenization

We generalize and provide a linear algebra-based perspective on a finite element (FE) ho-mogenization scheme, pioneered by Schneider et al. (2017)[1] and Leuschner and Fritzen (2018)[2]. The efficiency of the scheme is based on a preconditioned, well-scale ...

ELSEVIER SCIENCE INC2023

pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration

Martin Vetterli, Paul Hurley, Eric Bezzam, Sepand Kashani, Matthieu Martin Jean-André Simeoni

Fourier transforms are an often necessary component in many computational tasks, and can be computed efficiently through the fast Fourier transform (FFT) algorithm. However, many applications involve an underlying continuous signal, and a more natural choi ...

2022

A Characterisation Of The Continuum Gaussian Free Field In Arbitrary Dimensions

Juhan Aru

We prove that under certain mild moment and continuity assumptions, the d-dimensional continuum Gaussian free field is the only stochastic process satisfying the usual domain Markov property and a scaling assumption. Our proof is based on a decomposition o ...

ECOLE POLYTECHNIQUE2022

Correcting for non-periodic behaviour in perturbative experiments: application to heat pulse propagation and modulated gas-puff experiments

Federico Alberto Alfredo Felici, Cristian Galperti

This paper introduces a recent innovation in dealing with non-periodic behavior often referred to as transients in perturbative experiments. These transients can be the result from the unforced response due to the initial condition and other slow trends in ...

2020

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Amir Zandieh

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...

EPFL2020

Fourier Tools

Paul Hurley, Sepand Kashani, Matthieu Martin Jean-André Simeoni

The FFT algorithm is a key pillar of modern numerical computing. This document is a collection of working notes on FFT-based algorithms. Efficient implementations of the former are made available through the pyFFS package. ...

2020

Mixture Models for the Analysis, Edition, and Synthesis of Continuous Time Series

Sylvain Calinon

This chapter presents an overview of techniques used for the analysis, edition, and synthesis of time series, with a particular emphasis on motion data. The use of mixture models allows the decomposition of time signals as a superposition of basis function ...

Springer2019

A Fourier-accelerated volume integral method for elastoplastic contact

Jean-François Molinari, Guillaume Anciaux, Lucas Henri Galilée Frérot

The contact of solids with rough surfaces plays a fundamental role in physical phenomena such as friction, wear, sealing, and thermal transfer. However, its simulation is a challenging problem due to surface asperities covering a wide range of length-scale ...

2019

Fourier could be a data scientist: From graph Fourier transform to signal processing on graphs

Pierre Vandergheynst, Benjamin Ricaud, Nicolas Tremblay

The legacy of Joseph Fourier in science is vast, especially thanks to the essential tool that the Fourier transform is. The flexibility of this analysis, its computational efficiency and the physical interpretation it offers makes it a cornerstone in many ...

ELSEVIER FRANCE-EDITIONS SCIENTIFIQUES MEDICALES ELSEVIER2019

An Adaptive Sublinear-Time Block Sparse Fourier Transform

Volkan Cevher, Mikhail Kapralov, Jonathan Mark Scarlett, Amir Zandieh

The problem of approximately computing the

k

dominant Fourier coefficients of a vector

X

quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT has resulted in ...

2017

Efficient Approximate Scaling of Spherical Functions in the Fourier Domain With Generalization to Hyperspheres

Graph Chatbot

Chat with Graph Search

An optimal preconditioned FFT-accelerated finite element solver for homogenization

pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration

A Characterisation Of The Continuum Gaussian Free Field In Arbitrary Dimensions

Correcting for non-periodic behaviour in perturbative experiments: application to heat pulse propagation and modulated gas-puff experiments

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Fourier Tools

Mixture Models for the Analysis, Edition, and Synthesis of Continuous Time Series

A Fourier-accelerated volume integral method for elastoplastic contact

Fourier could be a data scientist: From graph Fourier transform to signal processing on graphs

An Adaptive Sublinear-Time Block Sparse Fourier Transform

An optimal preconditioned FFT-accelerated finite element solver for homogenization

Fourier Sampling in Signal Processing and Numerical Linear Algebra

pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration

Fourier Tools

A Characterisation Of The Continuum Gaussian Free Field In Arbitrary Dimensions

Mixture Models for the Analysis, Edition, and Synthesis of Continuous Time Series

Correcting for non-periodic behaviour in perturbative experiments: application to heat pulse propagation and modulated gas-puff experiments

Fourier could be a data scientist: From graph Fourier transform to signal processing on graphs

A Fourier-accelerated volume integral method for elastoplastic contact

An Adaptive Sublinear-Time Block Sparse Fourier Transform