pub struct LuRef<'a, I, E>{
symbolic: &'a SymbolicLu<I>,
numeric: &'a NumericLu<I, E>,
}
Expand description
Sparse LU factorization wrapper.
Fields§
§symbolic: &'a SymbolicLu<I>
§numeric: &'a NumericLu<I, E>
Implementations§
§impl<'a, I, E> LuRef<'a, I, E>
impl<'a, I, E> LuRef<'a, I, E>
pub unsafe fn new_unchecked(
symbolic: &'a SymbolicLu<I>,
numeric: &'a NumericLu<I, E>,
) -> LuRef<'a, I, E>
pub unsafe fn new_unchecked( symbolic: &'a SymbolicLu<I>, numeric: &'a NumericLu<I, E>, ) -> LuRef<'a, I, E>
Creates LU factors from their components.
§Safety
The numeric part must be the output of SymbolicLu::factorize_numeric_lu
, called with a
matrix having the same symbolic structure as the one used to create symbolic
.
pub fn symbolic(self) -> &'a SymbolicLu<I>
pub fn symbolic(self) -> &'a SymbolicLu<I>
Returns the symbolic structure of the LU factorization.
pub fn solve_in_place_with_conj(
self,
conj: Conj,
rhs: MatMut<'_, E>,
parallelism: Parallelism<'_>,
stack: PodStack<'_>,
)where
E: ComplexField,
pub fn solve_in_place_with_conj(
self,
conj: Conj,
rhs: MatMut<'_, E>,
parallelism: Parallelism<'_>,
stack: PodStack<'_>,
)where
E: ComplexField,
Solves the equation $\text{Op}(A) x = \text{rhs}$ and stores the result in rhs
, where
$\text{Op}$ is either the identity or the conjugate, depending on the value of conj
.
§Panics
- Panics if
self.nrows() != self.ncols()
. - Panics if
rhs.nrows() != self.nrows()
.
pub fn solve_transpose_in_place_with_conj(
self,
conj: Conj,
rhs: MatMut<'_, E>,
parallelism: Parallelism<'_>,
stack: PodStack<'_>,
)where
E: ComplexField,
pub fn solve_transpose_in_place_with_conj(
self,
conj: Conj,
rhs: MatMut<'_, E>,
parallelism: Parallelism<'_>,
stack: PodStack<'_>,
)where
E: ComplexField,
Solves the equation $\text{Op}(A^\top) x = \text{rhs}$ and stores the result in rhs
,
where $\text{Op}$ is either the identity or the conjugate, depending on the
value of conj
.
§Panics
- Panics if
self.nrows() != self.ncols()
. - Panics if
rhs.nrows() != self.nrows()
.
Trait Implementations§
impl<'a, I, E> Copy for LuRef<'a, I, E>
Auto Trait Implementations§
impl<'a, I, E> Freeze for LuRef<'a, I, E>
impl<'a, I, E> RefUnwindSafe for LuRef<'a, I, E>where
I: RefUnwindSafe,
<<E as Entity>::Group as ForType>::FaerOf<Vec<<E as Entity>::Unit>>: RefUnwindSafe,
impl<'a, I, E> Send for LuRef<'a, I, E>
impl<'a, I, E> Sync for LuRef<'a, I, E>
impl<'a, I, E> Unpin for LuRef<'a, I, E>
impl<'a, I, E> UnwindSafe for LuRef<'a, I, E>where
I: RefUnwindSafe,
<<E as Entity>::Group as ForType>::FaerOf<Vec<<E as Entity>::Unit>>: RefUnwindSafe,
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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more