pub struct DeviceResidentPcgInput<'a> {
pub storage: &'a DeviceResidentRowHess,
pub b: &'a [f64],
pub rel_tol: f64,
pub max_iters: usize,
pub precond_diag_floor: f64,
}Expand description
Inputs to run_pcg_against_row_hessian_device. The right-hand-side
b is supplied as a host slice (it is the only host-resident vector
that needs to enter the loop — the iterate, residual, search direction,
and Hv output all live on the device).
Fields§
§storage: &'a DeviceResidentRowHessPer-fit row-Hessian + design storage. The PCG operator is
v ↦ launch_bms_flex_row_hvp_into_device(storage, ...).
b: &'a [f64]Right-hand-side b, length storage.block.p_total. Uploaded once.
rel_tol: f64Convergence tolerance on relative residual ‖r‖₂ / ‖b‖₂.
max_iters: usizeHard cap on iterations (the inner loop also bails on stagnation).
precond_diag_floor: f64Floor on |diag(H)[i]| used by the Jacobi preconditioner. Set to
1e-12 for the matrix-free row-Hessian path; the row-primary
Hessian’s diagonal is positive-definite by construction.
Auto Trait Implementations§
impl<'a> Freeze for DeviceResidentPcgInput<'a>
impl<'a> RefUnwindSafe for DeviceResidentPcgInput<'a>
impl<'a> Send for DeviceResidentPcgInput<'a>
impl<'a> Sync for DeviceResidentPcgInput<'a>
impl<'a> Unpin for DeviceResidentPcgInput<'a>
impl<'a> UnsafeUnpin for DeviceResidentPcgInput<'a>
impl<'a> UnwindSafe for DeviceResidentPcgInput<'a>
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.