rlst 0.10.0

//! # Abstract linear algebra with RLST
//!
//! RLST has a module that allows algorithms on arbitrary linear structures. The basic concept is that
//! of a function space and operators acting on function spaces. Depending on the properties of function spaces
//! different types of algorithms can be implemented.
//!
//! # Linear Spaces
//!
//! A linear space is a basic structure that can generate elements of that space and supports addition and scalar multiplication
//! operations. The associated trait is [LinearSpace](crate::traits::LinearSpace). It has two associated types, namely the
//! underlying scalar field [LinearSpace::F](crate::traits::LinearSpace::F) and the
//! implementation type [LinearSpace::Impl](crate::traits::LinearSpace::Impl) of elements of the space.
//!
//! A linear space is a very basic structure. The following traits are for spaces that provide more functionality.
//!
//! - [DualSpace](crate::traits::DualSpace): A space that has a pairing with a dual space.
//! - [IndexableSpace](crate::traits::IndexableSpace): A space with a countable finite dimensional basis.
//! - [InnerProductSpace](crate::traits::InnerProductSpace): A space that supports an inner product.
//! - [NormedSpace](crate::traits::NormedSpace): A space that supports a norm.
//!
//! Note that each `InnerProductSpace` is also a `DualSpace` and a `NormedSpace` through default implementation of the corresponding traits.
//!
//! Associated with a linear space is an [Element](crate::operator::element::Element) of the space. This concrete type is a wrapper that stores
//! an implementation type and a reference to the underlying space. The following example demonstrates how to instantiate a linear space
//! for standard vectors and perform operations on the elements.
//!
//! ```
//! use rlst::operator::interface::array_vector_space::ArrayVectorSpace;
//! use rlst::operator::space::zero_element;
//! use rlst::traits::LinearSpace;
//! # use approx::assert_relative_eq;
//! let space = ArrayVectorSpace::new(10);
//! let mut elem1 = zero_element(&space);
//! *elem1.imp_mut().get_mut([0]).unwrap() = 1.0;
//! let elem2 = space.copy_from(&elem1);
//! let elem3 = 5.0_f64 * &elem1 + &elem2;
//! # assert_relative_eq!(*elem3.imp().get([0]).unwrap(), 6.0_f64, max_relative = 1E-10);
//! ```
//! We have defined an [ArrayVectorSpace](crate::operator::interface::array_vector_space::ArrayVectorSpace) with vectors of
//! dimension `10`. We then use the [zero_element](crate::operator::space::zero_element) to create a new element in that space.
//! Using [imp_mut](crate::operator::element::Element::imp_mut) we get a mutable reference to the implementation and assign the first
//! component of the vector the value `1.0`. We then copy this element using [Space::copy](crate::traits::LinearSpace::copy_from) and
//! create a new element `elem3` as a linear combination of `elem1` and `elem2`.
//! An element borrows its space; its implementation must have the dimension
//! promised by that particular space instance. The low-level `Element::new`
//! constructor does not check this invariant, so prefer space constructors such
//! as `zero_element` and `copy_from`.
//!
//! As opposed to the `Array` type in RLST, elements of vector spaces do not use lazy compile-time arithmetic. Hence, the operation `5.0 * &elem1`
//! creates a new element that is then added to `&elem2`.
//!
//! Why should we use this abstract wrapper? The advantage is that once the function space is instantiated any operation on elements of the space
//! is independent of the concrete implementation. This allows us to write algorithms that work on any linear structure and not just on specific types.
//!
//! # Frames of elements
//!
//! An [`ElementFrame`](crate::ElementFrame) is a growable collection of columns
//! in one space. It owns an implementation satisfying [`FrameImpl`](crate::FrameImpl)
//! and forwards all operations to it. [`GenericFrameImpl`](crate::GenericFrameImpl)
//! stores owned elements of arbitrary linear spaces; [`ArrayFrameImpl`](crate::ArrayFrameImpl)
//! uses a column-major matrix for an
//! [`ArrayVectorSpace`](crate::operator::interface::array_vector_space::ArrayVectorSpace).
//! A frame is built outside any space by wrapping the chosen implementation with
//! `ElementFrame::new`, so nothing has to be implemented on the space itself.
//!
//! ```
//! # extern crate blas_src;
//! # extern crate lapack_src;
//! use rlst::{ArrayFrameImpl, ElementFrame, FrameQrOptions, LinearSpace, SliceArray};
//! use rlst::operator::interface::array_vector_space::ArrayVectorSpace;
//!
//! let space = ArrayVectorSpace::<f64>::new(3);
//! let mut frame = ElementFrame::new(ArrayFrameImpl::new(&space));
//! let mut element = space.zero();
//! element.imp_mut()[[0]] = 1.0;
//! frame.push(&element)?;
//! element.imp_mut()[[0]] = 0.0;
//! element.imp_mut()[[1]] = 2.0;
//! frame.push(&element)?;
//!
//! let coefficients = SliceArray::from_shape(&[3.0, 4.0], [2]);
//! let result = frame.apply(&coefficients)?;
//! assert_eq!(result.imp()[[0]], 3.0);
//! assert_eq!(result.imp()[[1]], 8.0);
//!
//! let qr = frame.qr_pivoted(FrameQrOptions::default())?;
//! assert_eq!(qr.rank(), 2);
//! for (j, &original_index) in qr.permutation.iter().enumerate() {
//!     let reconstructed = qr.q.apply(&qr.r.r().col(j))?;
//!     let original = frame.element(original_index).unwrap();
//!     rlst::assert_array_abs_diff_eq!(reconstructed.imp(), original.imp(), 1e-12);
//! }
//! # Ok::<(), rlst::RlstError>(())
//! ```
//!
//! For explicit construction, wrap the desired implementation:
//!
//! ```
//! use rlst::{ArrayFrameImpl, ElementFrame, GenericFrameImpl};
//! use rlst::operator::interface::array_vector_space::ArrayVectorSpace;
//!
//! let space = ArrayVectorSpace::<f64>::new(3);
//! let generic = ElementFrame::new(GenericFrameImpl::new(&space));
//! let dense = ElementFrame::new(ArrayFrameImpl::new(&space));
//! assert!(generic.is_empty());
//! assert_eq!(dense.matrix().shape(), [3, 0]);
//! ```
//!
//! `GenericFrameImpl` works for every linear space and has no scalar bounds, so a
//! custom space needs no code of its own to be used with a frame. The wrapper's
//! `imp` and `imp_mut` methods borrow the implementation; `into_imp` transfers
//! ownership back without copying storage.
//!
//! `push` and `set_element` copy values; `element` returns an owned copy that
//! borrows the space, not the frame. Array frames additionally offer `matrix`,
//! `matrix_mut`, `column`, and `column_mut` for zero-copy access to active entries.
//! `reserve` grows capacity and `clear` retains it. Extracted elements and QR
//! results can outlive the original frame, but cannot outlive the space.
//!
//! ## Borrowing frame columns
//!
//! Element-backed implementations also support
//! [`FrameRefAccess`](crate::FrameRefAccess), which borrows the stored columns
//! instead of copying them: `element_ref`, `element_mut`, `iter`, and `iter_mut`.
//! Array frames store their columns packed in one matrix and have no stored
//! element to borrow, so they do not implement this trait and expose `column`
//! and `column_mut` instead.
//!
//! ```
//! use rlst::operator::interface::array_vector_space::ArrayVectorSpace;
//! use rlst::{ElementFrame, GenericFrameImpl, LinearSpace};
//!
//! let space = ArrayVectorSpace::<f64>::new(3);
//! let mut frame = ElementFrame::new(GenericFrameImpl::new(&space));
//! frame.push(&space.zero())?;
//!
//! // Borrow a column and mutate it in place, without copying it out.
//! frame.element_mut(0).unwrap().imp_mut()[[1]] = 5.0;
//! assert_eq!(frame.element_ref(0).unwrap().imp()[[1]], 5.0);
//! for element in frame.iter_mut() {
//!     *element *= 2.0;
//! }
//! assert_eq!(frame.iter().next().unwrap().imp()[[1]], 10.0);
//! # Ok::<(), rlst::RlstError>(())
//! ```
//!
//! The mutating accessors hand out the stored element itself, so a caller can
//! replace it with an incompatible value. Preserving the space's invariants is
//! the caller's responsibility, exactly as for `Element::new` and
//! `Element::imp_mut`.
//!
//! Implementations supporting [`FrameApply`](crate::FrameApply) enable the wrapper's
//! `apply`, `apply_into`, and `adjoint_apply` methods. `adjoint_apply` returns the
//! inner products of an element with every column, `V^H x` for the column matrix
//! `V`. When the columns are orthonormal, as for the Q factor of `qr_pivoted` or
//! a Krylov basis, `adjoint_apply` followed by `apply_into` projects an element
//! onto their span without copying columns; for general columns the result is
//! not a projection. `apply` and `apply_into` accept strided coefficient arrays
//! and lazy expressions. Dense application uses BLAS with a `Gemm` scalar,
//! borrowing the active matrix and packing only the coefficients. Generic
//! application uses the space's operations, borrowing each column and
//! accumulating through [`LinearSpace::axpy_inplace`](crate::LinearSpace::axpy_inplace)
//! rather than copying columns or forming temporaries, for `apply_into` as well.
//! `apply_into(alpha, coefficients, beta, output)` computes
//! `output = alpha * frame * coefficients + beta * output`; a zero `beta`
//! discards the old output. Dense frames validate element dimensions. Generic
//! frames assume compatible space instances, just like element arithmetic.
//!
//! ## Rank-adaptive pivoted QR
//!
//! Implementations supporting [`FrameQr`](crate::FrameQr) enable the wrapper's
//! `qr_pivoted` method for numerical inner-product spaces.
//! Generic frames use two classical Gram–Schmidt passes, recomputing candidate
//! residuals against the entire current Q and pivoting on the largest norm.
//! Array frames use LAPACK pivoted Householder QR and require a `Lapack` scalar.
//! Both return `frame[:, permutation] ≈ Q R`, with `rank` orthonormal Q columns
//! and an upper-trapezoidal R of shape `[rank, frame.len()]`.
//! The wrapper delegates to its implementation and wraps the returned Q in
//! another `ElementFrame` with the same implementation type. Wrappers also implement
//! `FrameImpl`, `FrameApply`, and `FrameQr` when their implementations do, so they
//! can be passed to generic algorithms using these trait bounds.
//!
//! [`FrameQrOptions`](crate::FrameQrOptions) stops when all remaining residual
//! norms are at most `max(atol, rtol * max_original_column_norm)`. Defaults are
//! `atol = 0` and `rtol = 100 * epsilon` of the real scalar type. The dense path
//! checks trailing R-column norms, rather than only diagonal entries. Omitting
//! small nonzero residuals makes reconstruction approximate; floating-point
//! rounding also contributes. Rank zero and empty inputs return an empty Q and
//! an R of shape `[0, frame.len()]`. Invalid tolerances and non-finite numerical
//! results are errors. Pivot ties and signs/phases may differ between backends.
//!
//! # Operators on linear spaces
//!
//! A linear operator maps between a domain space and a range space. RLST has a complete operator arithmetic that abstracts from concrete
//! types (e.g. matrices, etc.) to mappings between linear spaces. Default implementations of operators exists for two dimensional dense arrays,
//! CSR matrices and distributed CSR matrices. To implement operators on other types one needs to implement
//! the [OperatorBase](crate::traits::abstract_operator::OperatorBase) trait. The following gives an example of using abstract operators.
//!
//! ```
//! # extern crate blas_src;
//! use rlst::DynArray;
//! use rlst::operator::abstract_operator::Operator;
//! use rlst::traits::abstract_operator::OperatorBase;
//! use rlst::operator::space::zero_element;
//! use rlst::dot;
//! # use rlst::assert_array_relative_eq;
//! let mut mat = DynArray::<f64, 2>::from_shape([20, 10]);
//! mat.fill_from_seed_equally_distributed(0);
//! let op = Operator::from(&mat);
//! let mut x = zero_element(op.domain());
//! x.imp_mut().fill_from_seed_equally_distributed(0);
//! let y = dot!(op, x);
//! # assert_array_relative_eq!(y.imp(), rlst::dot_blas!(mat, x.imp()), 1E-10);
//! ```
//! Operators implement a complete algebra, that is we can take sums of operators and multiply them with scalars. The following gives an example.
//! ```
//! use rlst::DynArray;
//! use rlst::operator::abstract_operator::Operator;
//! use rlst::traits::abstract_operator::OperatorBase;
//! use rlst::operator::space::zero_element;
//! use rlst::dot;
//! # use rlst::assert_array_relative_eq;
//! let mut mat1 = DynArray::<f64, 2>::from_shape([20, 10]);
//! mat1.fill_from_seed_equally_distributed(0);
//!
//! let mut mat2 = DynArray::<f64, 2>::from_shape([20, 10]);
//! mat2.fill_from_seed_equally_distributed(0);
//! let op1 = Operator::from(&mat1);
//! let op2 = Operator::from(&mat2);
//!
//! let sum = op1.r() + op2.r();
//! ```
//! We take reference objects using the [Operator::r](crate::operator::abstract_operator::Operator::r) method as algebra operations on operators
//! always takes ownership.
//!
//! # Solving operator equations
//!
//! To solve abstract operator equations of the form `Ax = y`, where `A` is an operator, `y` is an object in the range space and `x` is an unnknown
//! object in the domain space, we can use iterative solvers. RLST provides Conjugate Gradients for self-adjoint positive definite operators
//! and GMRES for general operators, with more solvers to be added.
//! The following provides a complete worked out example of how to solve operator equations with `CG`. Note that `CG` requires that the operator
//! is self-adjoint and positive definite; using it for other operators can
//! break down or fail to converge. `run` mutates `x` and returns
//! `||b-Ax|| / ||b||`, except that it returns the absolute residual when b is
//! zero. Reaching the iteration limit is not a separate error, so compare the
//! returned value with the requested tolerance. The iteration borrows `x`
//! only until `run` returns, after which `x` holds the approximation.
//!
//!
//! ```
//! # extern crate blas_src;
//! # extern crate lapack_src;
//! use rand_chacha::ChaCha8Rng;
//! use rand::prelude::*;
//! use rlst::DynArray;
//! use rlst::operator::abstract_operator::Operator;
//! use rlst::operator::space::zero_element;
//! use rlst::operator::algorithms::conjugate_gradients::CgIteration;
//! use rlst::traits::abstract_operator::OperatorBase;
//! use rlst::traits::Norm;
//! let dim = 10;
//! let tol = 1E-5;
//! let mut residuals = Vec::<f64>::new();
//! let mut rng = ChaCha8Rng::seed_from_u64(0);
//! let mut mat = DynArray::<f64, 2>::from_shape([dim, dim]);
//! for index in 0..dim {
//!     mat[[index, index]] = rng.random_range(1.0..=2.0);
//! }
//! let op = Operator::from(&mat);
//! let mut rhs = zero_element(op.range());
//! rhs.imp_mut().fill_from_equally_distributed(&mut rng);
//! let mut x = zero_element(op.domain());
//! let cg = (CgIteration::new(&op, &rhs, &mut x))
//!     .set_callable(|_, res| {
//!         let res_norm = res.norm();
//!         residuals.push(res_norm);
//!     })
//!     .set_tol(tol)
//!     .print_debug();
//! let res = cg.run();
//! assert!(res < tol);
//! // `x` now holds the approximation.
//! let mut check = zero_element(op.range());
//! op.apply(1.0, &x, 0.0, &mut check);
//! assert!((&check - &rhs).norm() < tol * rhs.norm());
//! ```
//!
//! The callback receives the updated approximation and the corresponding
//! unnormalized residual after each successful CG update, before convergence
//! is checked. It is not called when the initial guess already solves the
//! system or when a zero/non-finite search-direction denominator causes
//! pre-update termination. An exact zero right-hand side and zero initial guess
//! therefore return `0` immediately.
//!
//! ## GMRES
//!
//! The Generalized Minimal Residual Method
//! ([GmresIteration](crate::operator::algorithms::gmres::GmresIteration)) does not
//! require the operator to be self-adjoint. It builds an orthonormal Krylov basis
//! with Arnoldi's method and minimizes the residual over the resulting affine
//! subspace. The basis is stored in an [ElementFrame](crate::ElementFrame), by
//! default a [GenericFrameImpl](crate::GenericFrameImpl) holding one element per
//! basis vector, which works for every inner-product space. `set_storage` takes a
//! frame borrowing the right-hand side's space to use instead, so an array-backed
//! space can keep the basis as a single dense matrix and run the orthogonalization
//! and the solution update as dense matrix-vector products, as in the example
//! below. The supplied frame is scratch space: it is cleared at the start of every
//! restart cycle.
//!
//! The builder mirrors `CG`, and `run` reports the residual in exactly the same
//! way. In addition, `set_restart` bounds the size of the Krylov basis. Without
//! it GMRES does not restart, so the basis can grow to `max_iter` elements and
//! the work per iteration grows with the iteration count. Restarting bounds both,
//! but restarted GMRES can stagnate on problems that full GMRES solves. The true
//! residual is recomputed at the end of every cycle; a cycle that does not
//! reduce it is undone and ends the iteration, so `x` is never worse than the
//! initial guess. Breakdown is detected relative to the norm of the new
//! Hessenberg column rather than by an exact comparison with zero, so a
//! numerically exhausted Krylov space ends the cycle instead of turning
//! rounding noise into basis vectors.
//!
//! ```
//! # extern crate blas_src;
//! # extern crate lapack_src;
//! use rand_chacha::ChaCha8Rng;
//! use rand::prelude::*;
//! use rlst::{ArrayFrameImpl, DynArray, ElementFrame};
//! use rlst::operator::abstract_operator::Operator;
//! use rlst::operator::space::zero_element;
//! use rlst::operator::algorithms::gmres::GmresIteration;
//! use rlst::traits::abstract_operator::OperatorBase;
//! use rlst::traits::Norm;
//! let dim = 20;
//! let tol = 1E-8;
//! let mut residuals = Vec::<f64>::new();
//! let mut rng = ChaCha8Rng::seed_from_u64(0);
//! // A non-symmetric, diagonally dominant matrix.
//! let mut mat = DynArray::<f64, 2>::from_shape([dim, dim]);
//! for row in 0..dim {
//!     for col in 0..dim {
//!         mat[[row, col]] = rng.random_range(-0.1..=0.1);
//!     }
//!     mat[[row, row]] += 4.0;
//! }
//! let op = Operator::from(&mat);
//! let mut rhs = zero_element(op.range());
//! rhs.imp_mut().fill_from_equally_distributed(&mut rng);
//! let mut x = zero_element(op.domain());
//! // Keep the Krylov basis in one dense matrix instead of separate elements.
//! let gmres = GmresIteration::new(&op, &rhs, &mut x)
//!     .set_storage(ElementFrame::new(ArrayFrameImpl::new(rhs.space())))
//!     .set_callable(|_, residual| residuals.push(residual))
//!     .set_restart(10)
//!     .set_tol(tol)
//!     .print_debug();
//! let res = gmres.run();
//! assert!(res < tol);
//! // `x` now holds the approximation.
//! let mut check = zero_element(op.range());
//! op.apply(1.0, &x, 0.0, &mut check);
//! assert!((&check - &rhs).norm() < tol * rhs.norm());
//! ```
//!
//! The callback of `set_callable` receives the number of Arnoldi steps taken so
//! far and the current residual, both obtained from the Givens recursion at no
//! extra cost. Unlike `CG`, GMRES does not carry the approximation and the
//! residual along, so they are only available through the separate
//! `set_element_callable`, which reconstructs them for every call at the cost of
//! one additional linear combination of the Krylov basis and one operator
//! application per iteration. Both callbacks follow the same schedule as the `CG`
//! callback: they run after each successful step, before convergence is checked,
//! and not for an already-converged initial guess or a step that ends in a
//! degenerate pivot.