Skip to main content

ElectrolyzerStack

Struct ElectrolyzerStack 

Source
pub struct ElectrolyzerStack {
    pub n_cells: usize,
    pub cell_area_cm2: f64,
    pub temperature_c: f64,
    pub pressure_bar: f64,
    pub exchange_current_density: f64,
    pub alpha: f64,
    pub membrane_resistance_ohm_cm2: f64,
}
Expand description

Electrolyzer stack model based on IV (current-voltage) curves.

Models the electrochemical cell behaviour using Butler-Volmer kinetics for activation overpotential, linear ohmic resistance for membrane loss, and a temperature-corrected reversible voltage.

Fields§

§n_cells: usize

Number of cells in series

§cell_area_cm2: f64

Active cell area [cm²]

§temperature_c: f64

Operating temperature [°C]

§pressure_bar: f64

Operating pressure [bar]

§exchange_current_density: f64

Exchange current density [A/cm²] (Butler-Volmer parameter)

§alpha: f64

Charge transfer coefficient α (Butler-Volmer)

§membrane_resistance_ohm_cm2: f64

Membrane area-specific resistance [Ω·cm²]

Implementations§

Source§

impl ElectrolyzerStack

Source

pub fn new(n_cells: usize, cell_area_cm2: f64) -> Self

Create a new electrolyzer stack with default parameters for a PEM cell.

Source

pub fn cell_voltage(&self, current_density_a_cm2: f64) -> f64

Compute single cell voltage at a given current density [A/cm²].

V_cell = V_rev + V_act + V_ohm

  • V_rev: temperature- and pressure-corrected reversible voltage
  • V_act: Butler-Volmer activation overpotential (anodic dominant)
  • V_ohm: Ohmic overpotential from membrane resistance
Source

pub fn operating_point(&self, current_density_a_cm2: f64) -> (f64, f64)

Compute stack operating point at a given current density.

Returns (power_kw, h2_kg_per_h).

H2 production follows Faraday’s law: ṁ_H2 = (n_cells * I * M_H2) / (n_e * F) [g/s] → [kg/h]

Source

pub fn efficiency(&self, current_density_a_cm2: f64) -> f64

Stack efficiency at given current density (LHV basis, using HHV here for consistency).

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> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

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> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

unsafe fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

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

Source§

type Error = Infallible

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

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

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.