Integral transforms
All four entries are eager dispatchers: a table of closed-form atoms fires
first, then algebraic rules (linearity, shifts, scaling, derivative,
convolution), and inputs neither layer recognises return the unevaluated
transform node (composable via execute later). Unevaluated transform
nodes can also be built directly through parse.
laplace_transform#
Explicit context
func laplaceTransform(
target: UniffiExpression,
timeVariable: String,
frequencyVariable: String,
) -> UniffiExpressionCalling forms and variants
Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.laplaceTransform
func laplaceTransform(
target: UniffiExpression,
timeVariable: String,
frequencyVariable: String,
) -> UniffiExpressionForward Laplace transform .
A polynomial time moment is frequency differentiation:
for a literal positive integer n
whenever itself closes, so . The
moment has the same half-plane of convergence as f, so the rule adds no hypothesis. A symbolic
order has no formable derivative and leaves the transform unevaluated.
inverse_laplace_transform#
Explicit context
func inverseLaplaceTransform(
target: UniffiExpression,
frequencyVariable: String,
timeVariable: String,
) -> UniffiExpressionInverse Laplace transform; rational inputs route through a partial-fraction reverse lookup.
fourier_transform#
Explicit context
func fourierTransform(
target: UniffiExpression,
timeVariable: String,
frequencyVariable: String,
) -> UniffiExpressionCalling forms and variants
Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.fourierTransform
func fourierTransform(
target: UniffiExpression,
timeVariable: String,
frequencyVariable: String,
) -> UniffiExpressionForward Fourier transform in the angular-frequency convention .
inverse_fourier_transform#
Explicit context
func inverseFourierTransform(
target: UniffiExpression,
frequencyVariable: String,
timeVariable: String,
) -> UniffiExpressionInverse Fourier transform of the same convention.