Struct EvenKambe 

pub(crate) struct EvenKambe {
    argument: Complex,
    square: Complex,
    eta: Complex,
    exponential: Complex,
    terms: [f64; 2],
    values: Vec<Complex>,
}

Even Kambe orders I_2, I_0, I_-2, I_-4, ... of one argument from the closed-form pair I_-2, I_0 and the Kambe recurrence, one step per order, as treams evaluates them: the orders of one reciprocal point of a 2D spherical or 1D cylindrical lattice sum, whose correlated errors those sums cancel (see lattice::Reduced).

Fields

argument: Complex

The argument z with Re z >= 0 that the pair takes.

square: Complex

eta: Complex

exponential: Complex

terms: [f64; 2]

The moduli of the two terms of the closed-form pair (even_terms).

values: Vec<Complex>

I_0, I_-2, ... as far as requested.

Implementations

impl EvenKambe

pub(crate) fn new(z: Complex, eta: Complex) -> Self

The chain of I_n(z, eta), starting from the pair.

pub(crate) fn single(&self, n: i32) -> (Complex, f64)

I_n for even n <= 0 on its own, with a first-order bound on its absolute rounding error in units of epsilon (kambe_with_bound): below the base pair from the series where that bounds it more tightly than the recurrence.

pub(crate) fn sum_bounds(&self, weights: &[Complex]) -> (f64, f64)

A first-order bound, in units of epsilon, on the absolute rounding error of sum_j weights[j] I_(-2j) from this chain (which holds the orders down to the last weight), and the sum of the moduli of its terms: one ulp of each term of the pair and of each product and endpoint term of the recurrence, carried to the sum by the adjoint of the recurrence, which sees the correlation of the errors.

pub(crate) fn get(&mut self, n: i32) -> Complex

I_n for even n <= 2.

Trait Implementations

impl Clone for EvenKambe

fn clone(&self) -> EvenKambe

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for EvenKambe

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.