Struct AndersonAccelerator 

pub struct AndersonAccelerator<F: IntegrateFloat> { /* private fields */ }

Anderson accelerator for fixed-point iterations

Accelerates iterations of the form x_{k+1} = G(x_k) by maintaining a history of iterates and residuals, then solving a least-squares problem to find optimal linear combination coefficients.

Implementations

impl<F: IntegrateFloat> AndersonAccelerator<F>

pub fn new(dimension: usize, options: AcceleratorOptions<F>) -> Self

Create a new Anderson accelerator

pub fn with_memory_depth(_dimension: usize, memorydepth: usize) -> Self

Create accelerator with default options

pub fn accelerate( &mut self, x_current: ArrayView1<'_, F>, g_x_current: ArrayView1<'_, F>, ) -> Option<Array1<F>>

Add a new iterate and return accelerated update if possible

pub fn restart(&mut self)

Restart the accelerator (clear history)

pub fn is_active(&self) -> bool

Check if acceleration is currently active

pub fn memory_usage(&self) -> usize

Get current memory usage (number of stored iterates)

pub fn iteration_count(&self) -> usize

Get iteration count

Trait Implementations

impl<F: Debug + IntegrateFloat> Debug for AndersonAccelerator<F>

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

Formats the value using the given formatter.