Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

y1(3) [mojave man page]

J0(3)							   BSD Library Functions Manual 						     J0(3)

NAME
j0, j1, jn, y0, y1, yn -- bessel functions of first and second kind SYNOPSIS
#include <math.h> double j0(double x); double j1(double x); double jn(int n, double x); double y0(double x); double y1(double x); double yn(int n, double x); DESCRIPTION
The functions j0(x) and j1(x) compute the Bessel function of the first kind of the order 0 and the order 1, respectively; the function jn(n, x) computes the Bessel function of the first kind of the integer order n. The functions y0(x) and y1(x) compute the linearly independent Bessel function of the second kind of the order 0 and the order 1, respec- tively, for the positive integer value x (expressed as a double); the function yn(n, x) computes the Bessel function of the second kind for the integer order n for the positive integer value x (expressed as a double). SPECIAL VALUES
j0(0) returns 1. j0(+-infinity) returns 0. j0(NaN) returns a NaN. j1(0) returns 0. j1(+infinity) returns 0. j1(NaN) returns a NaN. y0(0) , y1(0) , and yn(n, 0) all return -infinity and raise the "division-by-zero" floating-point flag. 4th Berkeley Distribution December 11, 2006 4th Berkeley Distribution

Check Out this Related Man Page

J0(3)							   BSD Library Functions Manual 						     J0(3)

NAME
j0, j1, jn, y0, y1, yn -- bessel functions of first and second kind SYNOPSIS
#include <math.h> double j0(double x); double j1(double x); double jn(int n, double x); double y0(double x); double y1(double x); double yn(int n, double x); DESCRIPTION
The functions j0(x) and j1(x) compute the Bessel function of the first kind of the order 0 and the order 1, respectively; the function jn(n, x) computes the Bessel function of the first kind of the integer order n. The functions y0(x) and y1(x) compute the linearly independent Bessel function of the second kind of the order 0 and the order 1, respec- tively, for the positive integer value x (expressed as a double); the function yn(n, x) computes the Bessel function of the second kind for the integer order n for the positive integer value x (expressed as a double). SPECIAL VALUES
j0(0) returns 1. j0(+-infinity) returns 0. j0(NaN) returns a NaN. j1(0) returns 0. j1(+infinity) returns 0. j1(NaN) returns a NaN. y0(0) , y1(0) , and yn(n, 0) all return -infinity and raise the "division-by-zero" floating-point flag. 4th Berkeley Distribution December 11, 2006 4th Berkeley Distribution
Man Page

6 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

Diving In

Well, I'm kind of diving into all this. My cp is pretty much pooched so I figured instead of going out and buying a new one, I'd try to build my own. I'd pretty much be set, but I'm kind of board with MS and I want to try something new, so I decided to kind of dive right into this UNIX thing. ... (3 Replies)
Discussion started by: Nocturne
3 Replies

2. UNIX for Advanced & Expert Users

ar -r libmsc.a mslnw8.o.

Hi, if you would be kind to explaine me what does this do : ar -r libmsc.a mslnw8.o. Many thanks before. (3 Replies)
Discussion started by: big123456
3 Replies

3. UNIX for Dummies Questions & Answers

double dashes

function date_diff { integer _dt1=$(date_to_num ${1:?}) integer _dt2=$(date_to_num ${2:?}) integer _ndt=0 if ] then ((_ndt=_dt2-_dt1)) fi print -- $_ndt } What does double dash '--' indicate ? Can anyone please answer this (2 Replies)
Discussion started by: systemsb
2 Replies

4. UNIX for Dummies Questions & Answers

is there kind of good utility that convert make files to dsp?

Hello all im looking for some kind of utility that convert make files to dsp files is there any kind of tool/script that does this job? thanks (1 Reply)
Discussion started by: umen
1 Replies

5. Shell Programming and Scripting

sed help,,kind of urgent!!

(3 Replies)
Discussion started by: solaix14
3 Replies

6. Programming

How to invert order in QuickSort

Hello! Iam trying to reverse my order of quicksort in C from asc order (1-99) that is the original way of the algoritm, to descending (99-1). I've tried so many ways that iam a kind of lost now!:s The original quicksort is: void swap(int* a, int* B) { int tmp; tmp = *a; *a = *b; ... (1 Reply)
Discussion started by: rafazz
1 Replies