Algorithms for fast convolutions on motion groups
DOI10.1006/acha.2000.0321zbMath0966.65120OpenAlexW2056653204MaRDI QIDQ1582144
Gregory S. Chirikjian, Alexander B. Kyatkin
Publication date: 16 August 2001
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/acha.2000.0321
complexityFourier transformsfast algorithmsfast Fourier transformconvolution integralsdiscrete motion group
Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups, etc. (43A30)
Related Items (8)
Cites Work
- How to multiply matrices faster
- Computing Fourier transforms and convolutions on the 2-sphere
- Gaussian elimination is not optimal
- On the computational power of pushdown automata
- Motions and pattern analysis: harmonic analysis on motion groups and their homogeneous spaces
- How Can We Speed Up Matrix Multiplication?
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- Efficient workspace generation for binary manipulators with many actuators
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Some applications of the representation theory of the Euclidean group in three‐space
- A New Algorithm for Inner Product
- An operational calculus for the Euclidean motion group with applications in robotics and polymer science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for fast convolutions on motion groups