Enum QzStep 

pub enum QzStep {
    HessenbergTriangularReduction,
    QzIteration {
        shift_strategy: ShiftStrategy,
    },
    EigenvalueExtraction,
    SchurVectorAccumulation,
}

A step in the QZ decomposition pipeline.

The QZ algorithm is decomposed into discrete stages that can be individually profiled, debugged, or replaced.

Variants

HessenbergTriangularReduction

Reduce (A, B) to (H, T) form where H is upper Hessenberg and T is upper triangular, using Householder reflections applied from left and right.

QzIteration

One implicit double-shift QZ sweep on the (H, T) pencil.

Fields

shift_strategy: ShiftStrategy

The shift strategy to use for this sweep.

EigenvalueExtraction

Extract generalized eigenvalues (α, β) from the quasi-triangular Schur form.

SchurVectorAccumulation

Accumulate left (Q) and right (Z) Schur vectors from the individual Givens/Householder rotations.

Trait Implementations

impl Clone for QzStep

fn clone(&self) -> QzStep

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for QzStep

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

Formats the value using the given formatter.

impl PartialEq for QzStep

fn eq(&self, other: &QzStep) -> 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 StructuralPartialEq for QzStep