Arrow Research search
Back to TCS

TCS 2008

A fast Hermite transform

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

We present algorithms for fast and stable approximation of the Hermite transform of a compactly supported function on the real line, attainable via an application of a fast algebraic algorithm for computing sums associated with a three-term relation. Trade-offs between approximation in bandlimit (in the Hermite sense), and size of the support region are addressed. Numerical experiments are presented that show the feasibility and utility of our approach. Generalizations to any family of orthogonal polynomials are outlined. Applications to various problems in tomographic reconstruction, including the determination of protein structure, are discussed.

Authors

Keywords

  • Generalized Fourier transform
  • Hermite transform
  • Orthogonal polynomial transform
  • Three-term recurrence
  • Tomographic reconstruction
  • Protein structure

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
778567749150042962
v2026.09.13