pub struct ExpOp { /* private fields */ }Expand description
Matrix-free exponential exp(exponent * A).
Implementations§
Source§impl ExpOp
impl ExpOp
pub fn new( operator: Arc<dyn LinearOperator>, exponent: Complex64, krylov_dimension: usize, tolerance: f64, max_substeps: usize, ) -> Result<Self>
pub const fn exponent(&self) -> Complex64
pub fn generator(&self) -> &Arc<dyn LinearOperator> ⓘ
pub fn set_exponent(&mut self, exponent: Complex64) -> Result<()>
pub fn sandwich(&self, state: &[Complex64]) -> Result<Complex64>
pub fn matrix(&self, format: MatrixFormat) -> Result<Operator>
pub fn iter_grid( &self, input: &[Complex64], grid: ExpGrid, ) -> Result<ExpOpGridIter>
pub fn apply_grid( &self, input: &[Complex64], grid: ExpGrid, ) -> Result<Vec<Vec<Complex64>>>
pub fn transpose(&self) -> Result<Self>
pub fn conjugated(&self) -> Result<Self>
pub fn adjoint(&self) -> Result<Self>
pub fn right_apply(&self, input: &[Complex64]) -> Result<Vec<Complex64>>
Trait Implementations§
Source§impl LinearOperator for ExpOp
impl LinearOperator for ExpOp
Source§fn format(&self) -> MatrixFormat
fn format(&self) -> MatrixFormat
Report the public materialization format.
Source§fn apply(&self, input: &[Complex64], output: &mut [Complex64]) -> Result<()>
fn apply(&self, input: &[Complex64], output: &mut [Complex64]) -> Result<()>
Compute
output = A * input. Read moreSource§fn apply_transpose(
&self,
input: &[Complex64],
output: &mut [Complex64],
) -> Result<()>
fn apply_transpose( &self, input: &[Complex64], output: &mut [Complex64], ) -> Result<()>
Apply the algebraic transpose without conjugating either operand. Read more
Source§fn apply_real(&self, input: &[f64], output: &mut [f64]) -> Result<()>
fn apply_real(&self, input: &[f64], output: &mut [f64]) -> Result<()>
Apply this operator to a real vector. Read more
Source§fn apply_adjoint(
&self,
input: &[Complex64],
output: &mut [Complex64],
) -> Result<()>
fn apply_adjoint( &self, input: &[Complex64], output: &mut [Complex64], ) -> Result<()>
Apply the conjugate transpose.
Source§fn stored_triplets(&self) -> Result<Option<Vec<(usize, usize, Complex64)>>>
fn stored_triplets(&self) -> Result<Option<Vec<(usize, usize, Complex64)>>>
Return canonical stored nonzeros when the representation already owns them.
Source§fn shifted_solver(
&self,
_shift: f64,
) -> Result<Option<Box<dyn ShiftedLinearSolver>>>
fn shifted_solver( &self, _shift: f64, ) -> Result<Option<Box<dyn ShiftedLinearSolver>>>
Prepare a reusable solver for
(A - shift I) x = b, when supported.Auto Trait Implementations§
impl Freeze for ExpOp
impl !RefUnwindSafe for ExpOp
impl Send for ExpOp
impl Sync for ExpOp
impl Unpin for ExpOp
impl UnsafeUnpin for ExpOp
impl !UnwindSafe for ExpOp
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<O> RuntimeAdjointLinearOperator<CpuRuntime> for Owhere
O: LinearOperator + ?Sized,
impl<O> RuntimeAdjointLinearOperator<CpuRuntime> for Owhere
O: LinearOperator + ?Sized,
Source§fn apply_adjoint_on(
&self,
_runtime: &CpuRuntime,
input: &CpuBuffer,
output: &mut CpuBuffer,
) -> Result<(), QmbedError>
fn apply_adjoint_on( &self, _runtime: &CpuRuntime, input: &CpuBuffer, output: &mut CpuBuffer, ) -> Result<(), QmbedError>
Compute
output = A† * input in runtime-owned storage.Source§impl<O> RuntimeLinearOperator<CpuRuntime> for Owhere
O: LinearOperator + ?Sized,
impl<O> RuntimeLinearOperator<CpuRuntime> for Owhere
O: LinearOperator + ?Sized,
Source§fn runtime_shape(&self) -> (usize, usize)
fn runtime_shape(&self) -> (usize, usize)
Return
(rows, columns) in runtime coordinates.Source§fn apply_on(
&self,
_runtime: &CpuRuntime,
input: &CpuBuffer,
output: &mut CpuBuffer,
) -> Result<(), QmbedError>
fn apply_on( &self, _runtime: &CpuRuntime, input: &CpuBuffer, output: &mut CpuBuffer, ) -> Result<(), QmbedError>
Apply this map to backend-owned buffers.
§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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.