Annotation of 43BSDReno/lib/libm/common_source/j0.3, revision 1.1.1.1

1.1       root        1: .\" Copyright (c) 1985 Regents of the University of California.
                      2: .\" All rights reserved.  The Berkeley software License Agreement
                      3: .\" specifies the terms and conditions for redistribution.
                      4: .\"
                      5: .\"    @(#)j0.3        6.6 (Berkeley) 5/12/86
                      6: .\"
                      7: .TH J0 3M  "May 12, 1986"
                      8: .UC 4
                      9: .SH NAME
                     10: j0, j1, jn, y0, y1, yn \- bessel functions
                     11: .SH SYNOPSIS
                     12: .nf
                     13: .B #include <math.h>
                     14: .PP
                     15: .B double j0(x)
                     16: .B double x;
                     17: .PP
                     18: .B double j1(x)
                     19: .B double x;
                     20: .PP
                     21: .B double jn(n,x)
                     22: .B int n;
                     23: .B double x;
                     24: .PP
                     25: .B double y0(x)
                     26: .B double x;
                     27: .PP
                     28: .B double y1(x)
                     29: .B double x;
                     30: .PP
                     31: .B double yn(n,x)
                     32: .B int n;
                     33: .B double x;
                     34: .fi
                     35: .SH DESCRIPTION
                     36: These functions calculate Bessel functions of the first
                     37: and second kinds for real arguments and integer orders.
                     38: .SH DIAGNOSTICS
                     39: On a VAX, negative arguments cause y0, y1 and yn
                     40: to return the reserved operand and set \fIerrno\fR to EDOM.
                     41: .SH SEE ALSO
                     42: math(3M), infnan(3M)

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.