jn_zeros(n, nt)

Compute :None:None:`nt` zeros of the Bessel functions $J_n(x)$ on the interval $(0, \infty)$ . The zeros are returned in ascending order. Note that this interval excludes the zero at $x = 0$ that exists for $n > 0$ .

Parameters

n : int

Order of Bessel function

nt : int

Number of zeros to return

Returns

ndarray

First :None:None:`nt` zeros of the Bessel function.

Compute zeros of integer-order Bessel functions Jn.

See Also

jv

Examples

>>> import scipy.special as sc

We can check that we are getting approximations of the zeros by evaluating them with jv .

>>> n = 1
... x = sc.jn_zeros(n, 3)
... x
array([ 3.83170597,  7.01558667, 10.17346814])

>>> sc.jv(n, x)
array([-0.00000000e+00,  1.72975330e-16,  2.89157291e-16])

Note that the zero at x = 0 for n > 0 is not included.

>>> sc.jv(1, 0)
0.0

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.special._basic.jnyn_zeros scipy.special._basic.jnjnp_zeros scipy.special._basic.jn_zeros

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /scipy/special/_basic.py#297
type: <class 'function'>
Commit: