ariadnetor-algorithms 0.0.2

Tensor-network algorithms built on ariadnetor
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

//! Krylov-subspace eigensolvers.
//!
//! Currently exposes a single entry point, [`lanczos_smallest`],
//! which finds the smallest eigenvalue and corresponding eigenvector of
//! a Hermitian linear operator using the Lanczos iteration with full
//! reorthogonalization. The operator is supplied through the
//! [`LinearOp`] trait, which is the only contract callers need to
//! implement.
//!
//! Additional solvers (Arnoldi, LOBPCG, deflation/restart variants) are
//! deferred. The current scope is what DMRG's local effective-Hamiltonian
//! problem requires.

mod lanczos;
mod lanczos_kernels;

#[cfg(feature = "arpack")]
mod arpack;

pub use lanczos::{LanczosError, LanczosParams, LanczosResult, LinearOp, lanczos_smallest};

#[cfg(feature = "arpack")]
pub use arpack::{ArpackError, ArpackParams, ArpackResult, ArpackScalar, arpack_smallest};