The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors
From MaRDI portal
Publication:2284244
Cites work
- Approximations for the Bessel and Struve Functions
- Computing machine-efficient polynomial approximations
- Error estimates for Lagrange-Chebyshev interpolation formulae
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 4216820 (Why is no real title available?)
- scientific article; zbMATH DE number 3498321 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1937241 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- scientific article; zbMATH DE number 274399 (Why is no real title available?)
- scientific article; zbMATH DE number 3245839 (Why is no real title available?)
- scientific article; zbMATH DE number 3276110 (Why is no real title available?)
- On some properties of partial sums for Chebyshev series
Cited in
(3)
This page was built for publication: The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284244)