Struct CudaLinearSolver
pub struct CudaLinearSolver { /* private fields */ }Description
One CUDA device selected for CSR Krylov execution.
Implementations§
§impl CudaLinearSolver
impl CudaLinearSolver
pub const fn new(device_ordinal: u16) -> CudaLinearSolver
pub const fn new(device_ordinal: u16) -> CudaLinearSolver
Select a runtime-visible device without loading CUDA yet.
pub fn capabilities() -> SolverCapabilities
pub fn capabilities() -> SolverCapabilities
Exact numerical policies admitted by the first CUDA solver slice.
pub fn admit_device(self, device: &DeviceDescriptor) -> Result<(), Diagnostic>
pub fn admit_device(self, device: &DeviceDescriptor) -> Result<(), Diagnostic>
Admit one already discovered device for this solver slice without creating a context, queue, allocation, or vendor-library handle.
§Errors
Returns EQ0807 for a descriptor from another runtime, a descriptor
with a different deployment-visible ordinal, or the first missing
device capability, in that order.
pub fn solve(
self,
system: &CanonicalCsrSystemView,
initial_guess: Option<&[f64]>,
plan: SolverPlan,
) -> Result<CudaLinearSolveResult, Diagnostic>
pub fn solve( self, system: &CanonicalCsrSystemView, initial_guess: Option<&[f64]>, plan: SolverPlan, ) -> Result<CudaLinearSolveResult, Diagnostic>
Solve one finalized assembled system with a single resident CSR and resident Krylov vectors, then accept it through the independent serial host operator and fixed-order reduction oracle.
§Errors
Returns a stable diagnostic for unsupported policy/property, invalid CSR or preconditioner, unavailable CUDA capability, library failure, numerical breakdown/non-convergence, or host true-residual rejection.
Trait Implementations§
§impl Clone for CudaLinearSolver
impl Clone for CudaLinearSolver
§impl CudaAdmittedExecutionAdapter for CudaLinearSolver
impl CudaAdmittedExecutionAdapter for CudaLinearSolver
§fn execute_admitted(
self,
admitted: AdmittedExecution<'_>,
) -> Result<AcceptedCudaLinearSolveResult, Diagnostic>
fn execute_admitted( self, admitted: AdmittedExecution<'_>, ) -> Result<AcceptedCudaLinearSolveResult, Diagnostic>
§impl Debug for CudaLinearSolver
impl Debug for CudaLinearSolver
§impl PartialEq for CudaLinearSolver
impl PartialEq for CudaLinearSolver
§fn eq(&self, other: &CudaLinearSolver) -> bool
fn eq(&self, other: &CudaLinearSolver) -> bool
self and other values to be equal, and is used by ==.impl Copy for CudaLinearSolver
impl Eq for CudaLinearSolver
impl StructuralPartialEq for CudaLinearSolver
Auto Trait Implementations§
impl Freeze for CudaLinearSolver
impl RefUnwindSafe for CudaLinearSolver
impl Send for CudaLinearSolver
impl Sync for CudaLinearSolver
impl Unpin for CudaLinearSolver
impl UnsafeUnpin for CudaLinearSolver
impl UnwindSafe for CudaLinearSolver
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Source§impl<T> From<T> for T
impl<T> From<T> for T
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
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>
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>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
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§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Same for T
impl<T> Same for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.