pub struct QrOptions {
pub reorth_eta: f64,
pub rank_tol: f64,
}Expand description
Options of Qr.
Fields§
§reorth_eta: f64DGKS reorthogonalization: a second Gram–Schmidt pass runs when the
norm fell below reorth_eta times its value before the pass
(default 1/√2, Daniel–Gragg–Kaufman–Stewart). Must be in (0, 1].
rank_tol: f64A new column (or a complement vector in delete_row) whose norm
after two passes is ≤ rank_tol · ‖column‖ is declared dependent.
0 (the default) means n · ε_T, resolved at each operation
from the scalar T and the number of columns n of the result
(the default cannot know either; see the question Q-L32-1 of task
L3.2). Must be finite and ≥ 0.
Implementations§
Trait Implementations§
impl Copy for QrOptions
impl StructuralPartialEq for QrOptions
Auto Trait Implementations§
impl Freeze for QrOptions
impl RefUnwindSafe for QrOptions
impl Send for QrOptions
impl Sync for QrOptions
impl Unpin for QrOptions
impl UnsafeUnpin for QrOptions
impl UnwindSafe for QrOptions
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