Struct bempp::assembly::potential::PotentialAssembler
source · pub struct PotentialAssembler<T: RlstScalar + MatrixInverse, Integrand: PotentialIntegrand<T = T>, Kernel: KernelEvaluator<T = T>> { /* private fields */ }
Expand description
Potential assembler
Assemble potential operators by processing batches of cells in parallel
Implementations§
source§impl<T: RlstScalar + MatrixInverse, K: Kernel<T = T>> PotentialAssembler<T, DoubleLayerPotentialIntegrand<T>, KernelEvaluator<T, K>>
impl<T: RlstScalar + MatrixInverse, K: Kernel<T = T>> PotentialAssembler<T, DoubleLayerPotentialIntegrand<T>, KernelEvaluator<T, K>>
sourcepub fn new_double_layer(kernel: KernelEvaluator<T, K>) -> Self
pub fn new_double_layer(kernel: KernelEvaluator<T, K>) -> Self
Create a new Double layer assembler
source§impl<T: RlstScalar + MatrixInverse> PotentialAssembler<T, DoubleLayerPotentialIntegrand<T>, KernelEvaluator<T, Laplace3dKernel<T>>>
impl<T: RlstScalar + MatrixInverse> PotentialAssembler<T, DoubleLayerPotentialIntegrand<T>, KernelEvaluator<T, Laplace3dKernel<T>>>
sourcepub fn new_laplace_double_layer() -> Self
pub fn new_laplace_double_layer() -> Self
Create a new Laplace Double layer assembler
source§impl<T: RlstScalar<Complex = T> + MatrixInverse> PotentialAssembler<T, DoubleLayerPotentialIntegrand<T>, KernelEvaluator<T, Helmholtz3dKernel<T>>>
impl<T: RlstScalar<Complex = T> + MatrixInverse> PotentialAssembler<T, DoubleLayerPotentialIntegrand<T>, KernelEvaluator<T, Helmholtz3dKernel<T>>>
sourcepub fn new_helmholtz_double_layer(wavenumber: T::Real) -> Self
pub fn new_helmholtz_double_layer(wavenumber: T::Real) -> Self
Create a new Helmholtz Double layer assembler
source§impl<T: RlstScalar + MatrixInverse, K: Kernel<T = T>> PotentialAssembler<T, SingleLayerPotentialIntegrand<T>, KernelEvaluator<T, K>>
impl<T: RlstScalar + MatrixInverse, K: Kernel<T = T>> PotentialAssembler<T, SingleLayerPotentialIntegrand<T>, KernelEvaluator<T, K>>
sourcepub fn new_single_layer(kernel: KernelEvaluator<T, K>) -> Self
pub fn new_single_layer(kernel: KernelEvaluator<T, K>) -> Self
Create a new single layer assembler
source§impl<T: RlstScalar + MatrixInverse> PotentialAssembler<T, SingleLayerPotentialIntegrand<T>, KernelEvaluator<T, Laplace3dKernel<T>>>
impl<T: RlstScalar + MatrixInverse> PotentialAssembler<T, SingleLayerPotentialIntegrand<T>, KernelEvaluator<T, Laplace3dKernel<T>>>
sourcepub fn new_laplace_single_layer() -> Self
pub fn new_laplace_single_layer() -> Self
Create a new Laplace single layer assembler
source§impl<T: RlstScalar<Complex = T> + MatrixInverse> PotentialAssembler<T, SingleLayerPotentialIntegrand<T>, KernelEvaluator<T, Helmholtz3dKernel<T>>>
impl<T: RlstScalar<Complex = T> + MatrixInverse> PotentialAssembler<T, SingleLayerPotentialIntegrand<T>, KernelEvaluator<T, Helmholtz3dKernel<T>>>
sourcepub fn new_helmholtz_single_layer(wavenumber: T::Real) -> Self
pub fn new_helmholtz_single_layer(wavenumber: T::Real) -> Self
Create a new Helmholtz single layer assembler
source§impl<T: RlstScalar + MatrixInverse, Integrand: PotentialIntegrand<T = T>, Kernel: KernelEvaluator<T = T>> PotentialAssembler<T, Integrand, Kernel>
impl<T: RlstScalar + MatrixInverse, Integrand: PotentialIntegrand<T = T>, Kernel: KernelEvaluator<T = T>> PotentialAssembler<T, Integrand, Kernel>
sourcepub fn quadrature_degree(&mut self, cell: ReferenceCellType, degree: usize)
pub fn quadrature_degree(&mut self, cell: ReferenceCellType, degree: usize)
Set (non-singular) quadrature degree for a cell type
sourcepub fn batch_size(&mut self, size: usize)
pub fn batch_size(&mut self, size: usize)
Set the maximum size of a batch of cells to send to an assembly function
Trait Implementations§
source§impl<T: RlstScalar + MatrixInverse, Integrand: PotentialIntegrand<T = T>, Kernel: KernelEvaluator<T = T>> PotentialAssembly for PotentialAssembler<T, Integrand, Kernel>
impl<T: RlstScalar + MatrixInverse, Integrand: PotentialIntegrand<T = T>, Kernel: KernelEvaluator<T = T>> PotentialAssembly for PotentialAssembler<T, Integrand, Kernel>
source§fn assemble_into_dense<Space: FunctionSpace<T = T> + Sync>(
&self,
output: &mut Array<T, BaseArray<T, VectorContainer<T>, DIM>, DIM>,
space: &Space,
points: &Array<T::Real, BaseArray<T::Real, VectorContainer<T::Real>, DIM>, DIM>,
)
fn assemble_into_dense<Space: FunctionSpace<T = T> + Sync>( &self, output: &mut Array<T, BaseArray<T, VectorContainer<T>, DIM>, DIM>, space: &Space, points: &Array<T::Real, BaseArray<T::Real, VectorContainer<T::Real>, DIM>, DIM>, )
Assemble into a dense matrix
impl<T: RlstScalar + MatrixInverse, Integrand: PotentialIntegrand<T = T>, Kernel: KernelEvaluator<T = T>> Sync for PotentialAssembler<T, Integrand, Kernel>
Auto Trait Implementations§
impl<T, Integrand, Kernel> Freeze for PotentialAssembler<T, Integrand, Kernel>
impl<T, Integrand, Kernel> RefUnwindSafe for PotentialAssembler<T, Integrand, Kernel>where
Integrand: RefUnwindSafe,
Kernel: RefUnwindSafe,
impl<T, Integrand, Kernel> Send for PotentialAssembler<T, Integrand, Kernel>
impl<T, Integrand, Kernel> Unpin for PotentialAssembler<T, Integrand, Kernel>
impl<T, Integrand, Kernel> UnwindSafe for PotentialAssembler<T, Integrand, Kernel>where
Integrand: UnwindSafe,
Kernel: UnwindSafe,
Blanket Implementations§
§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>
Convert the given value into an approximately equivalent representation.
§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,
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Convert the subject into an approximately equivalent representation.
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<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§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>,
Approximate the subject to a given type with the default scheme.
§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,
Approximate the subject to a given type with a specific scheme.
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 more§impl<T> Pointable for T
impl<T> Pointable 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>
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.§impl<Src> TryFrom<Src> for Src
impl<Src> TryFrom<Src> for Src
§impl<Src, Dst> TryInto<Dst> for Srcwhere
Dst: TryFrom<Src>,
impl<Src, Dst> TryInto<Dst> for Srcwhere
Dst: TryFrom<Src>,
§impl<Src> ValueFrom<Src> for Src
impl<Src> ValueFrom<Src> for Src
§fn value_from(src: Src) -> Result<Src, <Src as ValueFrom<Src>>::Err>
fn value_from(src: Src) -> Result<Src, <Src as ValueFrom<Src>>::Err>
Convert the given value into an exactly equivalent representation.
§impl<Src, Dst> ValueInto<Dst> for Srcwhere
Dst: ValueFrom<Src>,
impl<Src, Dst> ValueInto<Dst> for Srcwhere
Dst: ValueFrom<Src>,
§fn value_into(self) -> Result<Dst, <Src as ValueInto<Dst>>::Err>
fn value_into(self) -> Result<Dst, <Src as ValueInto<Dst>>::Err>
Convert the subject into an exactly equivalent representation.