Struct extendr_api::prelude::sparse::linalg::qr::supernodal::SupernodalQrRef
pub struct SupernodalQrRef<'a, I, E>{
symbolic: &'a SymbolicSupernodalQr<I>,
rt_values: SliceGroup<'a, E>,
householder_values: SliceGroup<'a, E>,
tau_values: SliceGroup<'a, E>,
householder_row_indices: &'a [I],
tau_blocksize: &'a [I],
householder_nrows: &'a [I],
householder_ncols: &'a [I],
}
Expand description
QR factors containing both the symbolic and numeric representations.
Fields§
§symbolic: &'a SymbolicSupernodalQr<I>
§rt_values: SliceGroup<'a, E>
§householder_values: SliceGroup<'a, E>
§tau_values: SliceGroup<'a, E>
§householder_row_indices: &'a [I]
§tau_blocksize: &'a [I]
§householder_nrows: &'a [I]
§householder_ncols: &'a [I]
Implementations§
§impl<'a, I, E> SupernodalQrRef<'a, I, E>
impl<'a, I, E> SupernodalQrRef<'a, I, E>
pub unsafe fn new_unchecked(
symbolic: &'a SymbolicSupernodalQr<I>,
householder_row_indices: &'a [I],
tau_blocksize: &'a [I],
householder_nrows: &'a [I],
householder_ncols: &'a [I],
r_values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>,
householder_values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>,
tau_values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>,
) -> SupernodalQrRef<'a, I, E>
pub unsafe fn new_unchecked( symbolic: &'a SymbolicSupernodalQr<I>, householder_row_indices: &'a [I], tau_blocksize: &'a [I], householder_nrows: &'a [I], householder_ncols: &'a [I], r_values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>, householder_values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>, tau_values: <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>, ) -> SupernodalQrRef<'a, I, E>
Creates QR factors from their components.
§Safety
The inputs must be the outputs of factorize_supernodal_numeric_qr
.
pub fn symbolic(self) -> &'a SymbolicSupernodalQr<I>
pub fn symbolic(self) -> &'a SymbolicSupernodalQr<I>
Returns the symbolic structure of the QR factorization.
pub fn r_values(
self,
) -> <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>
pub fn r_values( self, ) -> <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>
Returns the numerical values of the factor $R$ of the QR factorization.
pub fn householder_values(
self,
) -> <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>
pub fn householder_values( self, ) -> <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>
Returns the numerical values of the Householder factors of the QR factorization.
pub fn tau_values(
self,
) -> <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>
pub fn tau_values( self, ) -> <<E as Entity>::Group as ForType>::FaerOf<&'a [<E as Entity>::Unit]>
Returns the numerical values of the $T$ factors of the QR factorization.
pub fn solve_in_place_with_conj(
&self,
conj: Conj,
rhs: MatMut<'_, E>,
parallelism: Parallelism<'_>,
work: MatMut<'_, E>,
stack: PodStack<'_>,
)where
E: ComplexField,
pub fn solve_in_place_with_conj(
&self,
conj: Conj,
rhs: MatMut<'_, E>,
parallelism: Parallelism<'_>,
work: MatMut<'_, E>,
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<I, E> Clone for SupernodalQrRef<'_, I, E>
impl<I, E> Clone for SupernodalQrRef<'_, I, E>
§fn clone(&self) -> SupernodalQrRef<'_, I, E>
fn clone(&self) -> SupernodalQrRef<'_, I, E>
Returns a copy 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 more§impl<'a, I, E> Debug for SupernodalQrRef<'a, I, E>
impl<'a, I, E> Debug for SupernodalQrRef<'a, I, E>
impl<I, E> Copy for SupernodalQrRef<'_, I, E>
Auto Trait Implementations§
impl<'a, I, E> Freeze for SupernodalQrRef<'a, I, E>
impl<'a, I, E> RefUnwindSafe for SupernodalQrRef<'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 SupernodalQrRef<'a, I, E>
impl<'a, I, E> Sync for SupernodalQrRef<'a, I, E>
impl<'a, I, E> Unpin for SupernodalQrRef<'a, I, E>
impl<'a, I, E> UnwindSafe for SupernodalQrRef<'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