Skip to main content

AcSensitivity

Struct AcSensitivity 

Source
pub struct AcSensitivity { /* private fields */ }
Expand description

A converged operating point, factorized once and ready to be differentiated.

Holds one factorization of the power-flow Jacobian at that point. Every accessor is a triangular solve against it, never a refactorization — the same contract DcSensitivity offers, and the reason both own a RealFactorization rather than borrowing the Newton path’s solver.

Implementations§

Source§

impl AcSensitivity

Source

pub fn new( buses: &[Bus], ybus: &YBusSparse, lines: &[Line], transformers: &[Transformer], ) -> Option<Self>

Factorizes the Jacobian at the operating point buses describes.

buses must be a converged solution — this linearizes about whatever state it is handed and cannot tell a solved network from an unsolved one, so the derivatives of a non-converged state are meaningless rather than wrong-looking. ybus, lines and transformers must be the same network that solution came from.

Takes the branch lists rather than a finished Vec<BranchParams> for the same reason crate::run_power_flow does: the tap sensitivities need each transformer’s own tap, which BranchParams has already folded into its four admittance entries. Deriving both here also means a caller cannot pass a branch list that disagrees with the Y-bus.

Returns None if the Jacobian is singular there.

Unlike the DC side there is no per-island bookkeeping, and none is needed: every island carries its own slack, so the assembled Jacobian is block-diagonal across islands and non-singular as a whole. A sourceless island contributes no rows at all, because network::mark_unreferenced_islands has already pinned its buses to Slack — so it is excluded rather than making the system singular.

Source

pub fn n_buses(&self) -> usize

Source

pub fn n_branches(&self) -> usize

Source

pub fn state_response(&self, variable: Variable) -> Option<StateResponse>

How the whole state responds to one variable — the forward direction, one solve.

Returns an all-zero response for a variable that is not a free input (active injection at a slack bus, reactive injection where the voltage is held). That is the correct derivative, not a failure: perturbing a quantity the solve itself determines moves nothing.

None only for an out-of-range bus, or a singular solve.

Source

pub fn branch_response( &self, variable: Variable, terminal: Terminal, ) -> Option<Vec<(f64, f64)>>

(dP, dQ) at every branch’s terminal, for one variable.

The AC counterpart of a PTDF column, and the reason the forward direction exists: one solve, then a dot product per branch.

Source

pub fn function_row(&self, function: Function) -> Option<FunctionRow>

How one function responds to injection at every bus — the adjoint direction, one solve.

The AC counterpart of a PTDF row. Where branch_response answers “one variable moves, what happens everywhere”, this answers “one thing is watched, what moves it” — which is the question an overload actually poses.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V