pub struct QrRef<'a, I, E>{
symbolic: &'a SymbolicQr<I>,
indices: &'a [I],
values: SliceGroup<'a, E>,
}
Expand description
Sparse QR factorization wrapper.
Fields§
§symbolic: &'a SymbolicQr<I>
§indices: &'a [I]
§values: SliceGroup<'a, E>
Implementations§
§impl<'a, I, E> QrRef<'a, I, E>
impl<'a, I, E> QrRef<'a, I, E>
pub unsafe fn new_unchecked(
symbolic: &'a SymbolicQr<I>,
indices: &'a [I],
values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>,
) -> QrRef<'a, I, E>
pub unsafe fn new_unchecked( symbolic: &'a SymbolicQr<I>, indices: &'a [I], values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>, ) -> QrRef<'a, I, E>
Creates a QR decomposition reference from its symbolic and numerical components.
§Safety:
The indices must be filled by a previous call to SymbolicQr::factorize_numeric_qr
with
the right parameters.
pub fn symbolic(self) -> &'a SymbolicQr<I>
pub fn symbolic(self) -> &'a SymbolicQr<I>
Returns the symbolic structure of the QR 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}$ in the sense of least squares, where
$\text{Op}$ is either the identity or the conjugate, depending on the value of conj
,
and stores the result in the upper part of rhs
.
work
is a temporary workspace with the same dimensions as rhs
.
Trait Implementations§
impl<'a, I, E> Copy for QrRef<'a, I, E>
Auto Trait Implementations§
impl<'a, I, E> Freeze for QrRef<'a, I, E>
impl<'a, I, E> RefUnwindSafe for QrRef<'a, I, E>where
<<E as Entity>::Group as ForCopyType>::FaerOfCopy<*const [<E as Entity>::Unit]>: RefUnwindSafe,
I: RefUnwindSafe,
impl<'a, I, E> Send for QrRef<'a, I, E>
impl<'a, I, E> Sync for QrRef<'a, I, E>
impl<'a, I, E> Unpin for QrRef<'a, I, E>
impl<'a, I, E> UnwindSafe for QrRef<'a, I, E>where
<<E as Entity>::Group as ForCopyType>::FaerOfCopy<*const [<E as Entity>::Unit]>: UnwindSafe,
I: 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