Skip to main content

TopOptSolver

Struct TopOptSolver 

Source
pub struct TopOptSolver {
    pub simp: SiMP,
    pub filter: FilteringMethods,
    pub move_limit: f64,
    pub damping: f64,
    pub tolerance: f64,
    pub max_iter: usize,
    pub compliance_history: Vec<f64>,
}
Expand description

Topology optimization solver using the Optimality Criteria (OC) method.

The OC update rule adjusts densities to satisfy KKT conditions for compliance minimization subject to a volume constraint.

Fields§

§simp: SiMP

SIMP model.

§filter: FilteringMethods

Filter.

§move_limit: f64

Move limit for density update.

§damping: f64

Damping exponent for OC update.

§tolerance: f64

Convergence tolerance.

§max_iter: usize

Maximum iterations.

§compliance_history: Vec<f64>

Current compliance history.

Implementations§

Source§

impl TopOptSolver

Source

pub fn new(simp: SiMP, filter: FilteringMethods) -> Self

Creates a new TopOptSolver.

Source

pub fn with_move_limit(self, m: f64) -> Self

Sets the move limit.

Source

pub fn with_damping(self, d: f64) -> Self

Sets the damping parameter.

Source

pub fn with_tolerance(self, t: f64) -> Self

Sets convergence tolerance.

Source

pub fn with_max_iter(self, n: usize) -> Self

Sets maximum iterations.

Source

pub fn oc_update( &self, density: &[f64], sensitivity: &[f64], volume_target: f64, ) -> (Vec<f64>, f64)

Performs one OC density update step.

Returns the new density vector and the Lagrange multiplier used.

Source

pub fn compute_compliance(&self, strain_energy: &[f64]) -> f64

Computes compliance given stiffness field and element strain energies.

Compliance = Σ E(ρ_e) * se_e (sum of strain energy contributions).

Source

pub fn run_mock(&mut self, load: f64) -> Vec<f64>

Runs the topology optimization loop with a mock FEA (diagonal stiffness).

For testing purposes the strain energy of element e is approximated as E(ρ_e) * load^2 / n where load is a uniform load parameter.

Source

pub fn volume_constraint_satisfied(&self, density: &[f64], tol: f64) -> bool

Checks whether the volume constraint is satisfied within tolerance.

Trait Implementations§

Source§

impl Clone for TopOptSolver

Source§

fn clone(&self) -> TopOptSolver

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for TopOptSolver

Source§

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

Formats the value using the given formatter. Read more

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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> 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§

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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.