leto-ops 0.45.2

Math, reduction, SIMD, and parallel kernels for Leto arrays
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
//! Non-linear solver algorithms — SSOT for the Atlas simulation stack.
//!
//! ## Algorithms
//!
//! - [Anderson acceleration](crate::application::nonlinear::anderson): Type-II
//!   MGS-QR variant with `VecDeque` history
//!   for fixed-point iterations. Achieves superlinear convergence without an
//!   explicit Jacobian (Anderson 1965; Walker & Ni 2011).
//!
//! ## Design
//!
//! All algorithms are generic over `T: eunomia::RealField + eunomia::FloatElement`
//! and operate on `leto::{Array1, Array2}`. No dependency on domain crates.

pub mod anderson;
pub(crate) mod linalg;

pub use anderson::{AndersonAccelerator, AndersonConfig, AndersonMethod};