pub struct LqDescriptor<'a, T> {
pub m: usize,
pub n: usize,
pub a: &'a [T],
pub l: &'a mut [T],
pub q: &'a mut [T],
pub order: MemoryOrder,
pub policy: ExecPolicy,
}Expand description
Thin LQ decomposition descriptor: A = L * Q
Computes the thin LQ of an m×n matrix A.
Data layout (A, L, Q slices) is specified by the order field;
a backend that does not support a given order returns
BackendError::InvalidArgument.
Outputs: L (m×k), Q (k×n)
where k = min(m, n).
Fields§
§m: usizeRows of A.
n: usizeColumns of A.
a: &'a [T]Input matrix A (m×n).
l: &'a mut [T]Output lower-triangular factor L (m×k, k = min(m, n)).
q: &'a mut [T]Output orthonormal factor Q (k×n).
order: MemoryOrderMemory layout of the matrix slices.
policy: ExecPolicyPer-call execution policy.
Auto Trait Implementations§
impl<'a, T> !UnwindSafe for LqDescriptor<'a, T>
impl<'a, T> Freeze for LqDescriptor<'a, T>
impl<'a, T> RefUnwindSafe for LqDescriptor<'a, T>where
T: RefUnwindSafe,
impl<'a, T> Send for LqDescriptor<'a, T>
impl<'a, T> Sync for LqDescriptor<'a, T>where
T: Sync,
impl<'a, T> Unpin for LqDescriptor<'a, T>
impl<'a, T> UnsafeUnpin for LqDescriptor<'a, T>
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