Enum PivotSearchStrategy 

pub enum PivotSearchStrategy {
    Full,
    Rook,
}

Strategy for finding new pivots during a two-site update.

Controls how much of the candidate matrix is evaluated when searching for the next pivot at each bond.

Examples

use tensor4all_tensorci::PivotSearchStrategy;

// Full is the default
let strategy = PivotSearchStrategy::default();
assert_eq!(strategy, PivotSearchStrategy::Full);

// Both variants can be compared
assert_ne!(PivotSearchStrategy::Full, PivotSearchStrategy::Rook);

Variants

Full

Evaluate the entire candidate matrix and pick the best pivot.

Exact but costs O(D_left * d * d * D_right) evaluations per bond, where d is the local dimension. This is the default and recommended for most problems.

Rook

Use lazy block-rook pivoting over partial matrix blocks.

Avoids materializing the full candidate matrix, making it faster for very large local dimensions. Error normalization uses the maximum sample value observed through the lazy requests rather than a full-grid scan.

Trait Implementations

impl Clone for PivotSearchStrategy

fn clone(&self) -> PivotSearchStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PivotSearchStrategy

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

Formats the value using the given formatter.

impl Default for PivotSearchStrategy

fn default() -> PivotSearchStrategy

Returns the “default value” for a type.

impl PartialEq for PivotSearchStrategy

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for PivotSearchStrategy

impl Eq for PivotSearchStrategy

impl StructuralPartialEq for PivotSearchStrategy