Enum Schedule 

pub enum Schedule {
    OneWay,
    Staggered,
    Iterative {
        max_iter: u32,
        tol: f64,
    },
    Multirate,
}

How the domains are interleaved.

Variants

OneWay

One pass in declared order, no feedback expected. Unconditionally stable; the only schedule whose domains could safely run concurrently.

Staggered

One pass in declared order, with each domain seeing the previous ones’ output from this step and the later ones’ from the last. Cheap, and stable only while the coupling is weak.

Iterative

Repeat the pass until every domain’s residual is under tol, or fail.

The cost is max_iter passes; the benefit is stability where a staggered scheme diverges no matter how small the step. Failing to converge is reported as a Violation rather than accepted, because an unconverged coupling that is allowed through is the most expensive kind of wrong answer: it looks like physics.

Fields

max_iter: u32

Give up after this many sweeps. Reaching it is a Violation, not a result.

tol: f64

The residual every domain must fall under for the step to be accepted.

Multirate

As Schedule::Staggered, but each evolving domain takes as many equal substeps as its own stability limit needs.

Trait Implementations

impl Clone for Schedule

fn clone(&self) -> Schedule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Schedule

impl Debug for Schedule

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

Formats the value using the given formatter.

impl PartialEq for Schedule

fn eq(&self, other: &Schedule) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Schedule