un algorithme pour le calcul des transformées de hankel d'ordre 0 et 1 an algorithm for computing zero and first hankel transforms
Clicks: 213
ID: 192742
2006
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
213 views
22 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #79 of 124 articles by views in addiction (abingdon, england)
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 124 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Une méthode pour la mise en oeuvre pratique des transformations de Hankel d'ordre 0 et 1 d'une fonction préalablement échantillonnée est présentée. Cette transformation dont les performances se rapprochent de celles des transformations rapides représente un bon compromis entre ces dernières (qui sont souvent incapables de traiter convenablement des fonctions très irrégulières) et les procédés classiques d'intégration qui sont mal adaptés aux intégrandes oscillants et nécessitent en outre des temps de calcul très importants.
A method for the practical implementation of 0 and first order Hankel transforms of a previously sampled function is described. This transform, whose performances approach those of fast transforms, represents a good compromise between such fast transforms (which are often incapable of dealing suitably with highly irregular functions) and standard integration processes, which are poorly suited for oscillating integrands and which also require very long computing times.
A method for the practical implementation of 0 and first order Hankel transforms of a previously sampled function is described. This transform, whose performances approach those of fast transforms, represents a good compromise between such fast transforms (which are often incapable of dealing suitably with highly irregular functions) and standard integration processes, which are poorly suited for oscillating integrands and which also require very long computing times.
| Reference Key |
j.2006oilun
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Quiblier J. |
| Journal | addiction (abingdon, england) |
| Year | 2006 |
| DOI |
10.2516/ogst:1990050
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.