Lines Matching refs:relation

33 All of the tools in this header require a description of the recurrence relation: this takes the fo…
34 …ctor that returns a tuple containing the 3 coefficients, specifically, given a recurrence relation:
45 For example, the recurrence relation for the Bessel J and Y functions when written in this form is:
50 Therefore, given local variables /x/ and /v/ of type `double` the recurrence relation for Bessel J …
55 Similarly, the Bessel I and K recurrence relation differs just by the sign of the final term:
69 Given a functor `r` which encodes the recurrence relation for function `F` at some location /n/, th…
75 is for the dominant solution (in the backwards direction) of the recurrence relation, if there are …
79 the recurrence relation, and should be no smaller than machine epsilon.  Argument /max_iter/ sets
85 Given a functor `r` which encodes the recurrence relation for function F at some location /n/, then…
91 is for the dominant solution (in the forwards direction) of the recurrence relation, if there are m…
95 the recurrence relation, and should be no smaller than machine epsilon.  Argument /max_iter/ sets
101 Applies a recurrence relation in a stable forward direction, starting with the values F[sub n-1] an…
104 …[[get_coefs] [Functor that returns the coefficients of the recurrence relation.  The coefficients …
105     [[number_of_steps][The number of steps to apply the recurrence relation onwards from /second/.]]
118 Applies a recurrence relation in a stable backward direction, starting with the values F[sub n+1] a…
121 …[[get_coefs] [Functor that returns the coefficients of the recurrence relation.  The coefficients …
122 … [[number_of_steps][The number of steps to apply the recurrence relation backwards from /second/.]]
142 Type `forward_recurrence_iterator` defines a forward-iterator for a recurrence relation stable in t…
143 forward direction.  The constructors take the recurrence relation, plus either one or two values: if
144 only one value is provided, then the second is computed by using the recurrence relation to calcula…
156 Type `backward_recurrence_iterator` defines a forward-iterator for a recurrence relation stable in …
157 backward direction.  The constructors take the recurrence relation, plus either one or two values: …
158 only one value is provided, then the second is computed by using the recurrence relation to calcula…