pub enum LinalgError {
Singular,
NotPositiveDefinite,
ConvergenceFailure,
}Expand description
Errors from linear algebra operations.
Returned by decomposition constructors and convenience methods
(solve, inverse, cholesky, qr, lu).
use numeris::Matrix;
use numeris::linalg::LinalgError;
let singular = Matrix::new([[1.0_f64, 2.0], [2.0, 4.0]]);
assert_eq!(singular.lu().unwrap_err(), LinalgError::Singular);
let not_pd = Matrix::new([[1.0_f64, 5.0], [5.0, 1.0]]);
assert_eq!(not_pd.cholesky().unwrap_err(), LinalgError::NotPositiveDefinite);Variants§
Singular
Matrix is singular or nearly singular.
NotPositiveDefinite
Matrix is not positive definite (required for Cholesky).
ConvergenceFailure
Iterative algorithm did not converge within the iteration budget.
Trait Implementations§
Source§impl Clone for LinalgError
impl Clone for LinalgError
Source§fn clone(&self) -> LinalgError
fn clone(&self) -> LinalgError
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for LinalgError
impl Debug for LinalgError
Source§impl Display for LinalgError
impl Display for LinalgError
Source§impl PartialEq for LinalgError
impl PartialEq for LinalgError
impl Copy for LinalgError
impl StructuralPartialEq for LinalgError
Auto Trait Implementations§
impl Freeze for LinalgError
impl RefUnwindSafe for LinalgError
impl Send for LinalgError
impl Sync for LinalgError
impl Unpin for LinalgError
impl UnsafeUnpin for LinalgError
impl UnwindSafe for LinalgError
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.