Struct extendr_api::prelude::sparse::linalg::qr::supernodal::SymbolicSupernodalQr
pub struct SymbolicSupernodalQr<I>where
I: Index,{
L: SymbolicSupernodalCholesky<I>,
H: SymbolicSupernodalHouseholder<I>,
min_col: Vec<I>,
min_col_perm: Vec<I>,
index_to_super: Vec<I>,
child_head: Vec<I>,
child_next: Vec<I>,
}
Expand description
Symbolic structure of the QR decomposition,
Fields§
§L: SymbolicSupernodalCholesky<I>
§H: SymbolicSupernodalHouseholder<I>
§min_col: Vec<I>
§min_col_perm: Vec<I>
§index_to_super: Vec<I>
§child_head: Vec<I>
§child_next: Vec<I>
Implementations§
§impl<I> SymbolicSupernodalQr<I>where
I: Index,
impl<I> SymbolicSupernodalQr<I>where
I: Index,
pub fn r_adjoint(&self) -> &SymbolicSupernodalCholesky<I>
pub fn r_adjoint(&self) -> &SymbolicSupernodalCholesky<I>
Returns the symbolic structure of $R^H$.
pub fn householder(&self) -> &SymbolicSupernodalHouseholder<I>
pub fn householder(&self) -> &SymbolicSupernodalHouseholder<I>
Returns the symbolic structure of the Householder and $T$ factors.
pub fn solve_in_place_req<E>(
&self,
rhs_ncols: usize,
parallelism: Parallelism<'_>,
) -> Result<StackReq, SizeOverflow>where
E: Entity,
pub fn solve_in_place_req<E>(
&self,
rhs_ncols: usize,
parallelism: Parallelism<'_>,
) -> Result<StackReq, SizeOverflow>where
E: Entity,
Computes the size and alignment of the workspace required to solve the linear system $A x = \text{rhs}$ in the sense of least squares.
Trait Implementations§
Auto Trait Implementations§
impl<I> Freeze for SymbolicSupernodalQr<I>
impl<I> RefUnwindSafe for SymbolicSupernodalQr<I>where
I: RefUnwindSafe,
impl<I> Send for SymbolicSupernodalQr<I>
impl<I> Sync for SymbolicSupernodalQr<I>
impl<I> Unpin for SymbolicSupernodalQr<I>where
I: Unpin,
impl<I> UnwindSafe for SymbolicSupernodalQr<I>where
I: UnwindSafe,
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> 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