Enum Parametrization 

pub enum Parametrization {
    Natural,
    Local,
    PseudoArcLength,
}

Which equation closes the n power-flow equations in n+1 unknowns.

All three share one sparsity pattern, so switching between them costs nothing and they can be mixed along a single trace — which the driver does: Natural is what lands exactly on a target λ and what the event locator corrects with, whatever the trace’s nominal choice.

Variants

Natural

λ − λ_pred = 0. Cheapest, and the only one whose continuation parameter is meaningful to a caller — but it cannot pass the nose, where λ stops being a valid parameter for the curve.

Local

z_k − z_k_pred = 0, with k the largest component of the tangent. The classical Ajjarapu–Christy choice, and the default: it passes the nose, and its border row is one entry rather than n+1. See the module docs for why that second property decides the matter at any real size.

PseudoArcLength

tᵀ(z − z₀) − σ = 0. The most robust in principle — its bordering row is non-orthogonal to the null vector by construction rather than by a search — and what MATPOWER defaults to. But its row is dense, which costs 92× a plain solve at n = 2449 against Local’s 1.4×. Worth having for small networks and for cross-checking Local; not the default.

Trait Implementations

impl Clone for Parametrization

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Parametrization

impl Debug for Parametrization

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

Formats the value using the given formatter.

impl Default for Parametrization

fn default() -> Self

Returns the “default value” for a type.

impl Eq for Parametrization

impl PartialEq for Parametrization

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Parametrization