J recurrence
BesselJ order reduction through backward recurrence.
Controller:
CodeCogs
Interface
#include <codecogs/maths/special/bessel/j/j_recurrence.h>
using namespace Maths::Special::Bessel::J;
| double | J_recurrence (double x, double &v, double &newv, bool cancel)
BesselJ order reduction through backward recurrence. |
Use the following HTML code to embed the calculators within other websites:
| Name | HTML Code |
|---|
J_recurrence
BesselJ order reduction through backward recurrence. | |
J Recurrence
Reduces the order of a Bessel function using backward recurrence,
References:
Cephes Math Library Release 2.8: June, 2000
Parameters
| x | input argument. |
| v | current order. |
| newv | new order. |
| cancel | return the larger of the last two iterates on the theory that it may have less cancellation error. |
Authors
- Stephen L. Moshier. Copyright 1984, 1987, 2000
Documentation by Will Bateman
Source Code
Source code is available when you agree to a GP Licence or buy a Commercial Licence.
Not a member, then Register with CodeCogs. Already a Member, then Login.
You must login to leave a messge