PolarTranslation

Struct PolarTranslation 

Source
pub struct PolarTranslation {
    terms: Vec<(i32, Complex)>,
    order: i32,
    degrees: [i32; 2],
    radial: Radial,
}
Expand description

Fixed spherical mode-pair couplings shared across displacements and pullbacks.

Upstream: treams.sw.translate of one mode pair, which combines treams.special.tl_vsw_A and tl_vsw_B (tl_vsw_rA and tl_vsw_rB for regular waves).

Fields§

§terms: Vec<(i32, Complex)>

Degree and weight of each term.

§order: i32

Order difference source.m - destination.m, shared by all terms.

§degrees: [i32; 2]

Smallest and largest term degree.

§radial: Radial

Implementations§

Source§

impl PolarTranslation

Source

pub fn new( destination: Mode, source: Mode, helicity: bool, radial: Radial, ) -> Result<Self>

Prepare one mode pair in helicity or parity polarization.

Source

fn radial_row<const N: usize>(&self, z: Jet<N>) -> Result<Option<Vec<Jet<N>>>>

Spherical radial jets z_p(kr) of the term degrees, indexed by p minus the smallest degree, or None when each term evaluates its own.

Outgoing functions come from one AMOS sequence over the degree range. Regular derivatives outside the series region evaluate each single value once and share j_p between the value of degree p and the derivative of p - 1, so they equal those of crate::special::spherical_radial bitwise.

Source

fn evaluate<const N: usize>(&self, args: [Complex; 3]) -> Result<Jet<N>>

The coefficient sum_p weight_p z_p(kr) P_p^order(cos theta) e^(i order phi) at args = [kr, theta, phi], with the derivatives with respect to the N leading arguments.

Source

fn evaluate_jets<const N: usize>(&self, args: [Jet<N>; 3]) -> Result<Jet<N>>

One numerical kernel for value-only, coordinate and directional jets.

Source

pub fn is_self_term(radial: Radial, kr: Complex) -> bool

Whether the polarized coefficient of radial waves at the radial argument kr is the self term, which is zero: singular waves with |kr| < 1e-16, which includes coinciding expansion centres. The tl_vsw_* coefficients have no such rule.

Upstream: treams.sw.translate, which returns zero there. Differences: treams returns this zero for any mode labels, such as l = 0 or polarization 2; the sw.translate ufunc checks the labels first and rejects those.

Source

pub fn value(&self, args: [Complex; 3]) -> Result<Complex>

Evaluate at (kr, theta, phi); all three arguments may be complex.

Source

pub fn pullback( &self, args: [Complex; 3], cotangent: Complex, ) -> Result<[Complex; 3]>

The gradients of the three arguments from a complex scalar cotangent.

Trait Implementations§

Source§

impl Debug for PolarTranslation

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,