[BUKU][B] Spherical harmonics and approximations on the unit sphere: an introduction

K Atkinson, W Han - 2012 - books.google.com
These notes provide an introduction to the theory of spherical harmonics in an arbitrary
dimension as well as an overview of classical and recent results on some aspects of the …

[BUKU][B] Numerical fourier analysis

G Plonka, D Potts, G Steidl, M Tasche - 2018 - Springer
The Applied and Numerical Harmonic Analysis (ANHA) book series aims to provide the
engineering, mathematical, and scientific communities with significant developments in …

Using NFFT 3---A software library for various nonequispaced fast Fourier transforms

J Keiner, S Kunis, D Potts - ACM Transactions on Mathematical Software …, 2009 - dl.acm.org
NFFT 3 is a software library that implements the nonequispaced fast Fourier transform
(NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier …

A Casimir preserving scheme for long-time simulation of spherical ideal hydrodynamics

K Modin, M Viviani - Journal of Fluid Mechanics, 2020 - cambridge.org
The incompressible two-dimensional Euler equations on a sphere constitute a fundamental
model in hydrodynamics. The long-time behaviour of solutions is largely unknown; statistical …

[PDF][PDF] Vandermonde neural operators

L Lingsch, M Michelis, SM Perera… - arxiv preprint arxiv …, 2023 - sam.math.ethz.ch
Fourier Neural Operators (FNOs) have emerged as very popular machine learning
architectures for learning operators, particularly those arising in PDEs. However, as FNOs …

Bin-picking—5 decades of research

D Buchholz, D Buchholz - Bin-Picking: New Approaches for a Classical …, 2016 - Springer
As the bin-picking problem is a very famous problem in robotics research, many researchers
have already been focusing their studies on it. Therefore, this chapter gives a brief summary …

On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms

M Gräf, D Potts - Numerische Mathematik, 2011 - Springer
Spherical t-designs are point sets X_ M={x_ 1, ..., x_ M\} ⊂ S^ 2 which provide quadrature
rules with equal weights for the sphere which are exact for polynomials up to degree t. In this …

[BUKU][B] Bin-picking: new approaches for a classical problem

D Buchholz - 2015 - books.google.com
This book is devoted to one of the most famous examples of automation handling tasks–the
“bin-picking” problem. To pick up objects, scrambled in a box is an easy task for humans, but …

Efficient reconstruction of functions on the sphere from scattered data

J Keiner, S Kunis, D Potts - Journal of Fourier Analysis and Applications, 2007 - Springer
Recently, fast and reliable algorithms for the evaluation of spherical harmonic expansions
have been developed. The corresponding sampling problem is the computation of Fourier …

A fast algorithm for nonequispaced Fourier transforms on the rotation group

D Potts, J Prestin, A Vollrath - Numerical Algorithms, 2009 - Springer
In this paper we present algorithms to calculate the fast Fourier synthesis and its adjoint on
the rotation group SO (3) for arbitrary sampling sets. They are based on the fast Fourier …