ladiv1#

Functions

void sladiv1(
    const f32  a,
    const f32  b,
    const f32  c,
    const f32  d,
          f32* p,
          f32* q
);
void sladiv1(const f32 a, const f32 b, const f32 c, const f32 d, f32 *p, f32 *q)#

SLADIV1 is a helper routine for SLADIV, performing complex division when |D| <= |C| using the Baudin-Smith algorithm.

This function computes the real and imaginary parts of (A + i*B)/(C + i*D) when |D| <= |C|. It is part of the robust complex division algorithm described in “A Robust Complex Division in Scilab” by Baudin and Smith.

Parameters

in
a

Single precision scalar, real part of numerator.

in
b

Single precision scalar, imaginary part of numerator.

in
c

Single precision scalar, real part of denominator.

in
d

Single precision scalar, imaginary part of denominator.

out
p

Pointer to single, receives real part of result.

out
q

Pointer to single, receives imaginary part of result.

Functions

void dladiv1(
    const f64  a,
    const f64  b,
    const f64  c,
    const f64  d,
          f64* p,
          f64* q
);
void dladiv1(const f64 a, const f64 b, const f64 c, const f64 d, f64 *p, f64 *q)#

DLADIV1 is a helper routine for DLADIV, performing complex division when |D| <= |C| using the Baudin-Smith algorithm.

This function computes the real and imaginary parts of (A + i*B)/(C + i*D) when |D| <= |C|. It is part of the robust complex division algorithm described in “A Robust Complex Division in Scilab” by Baudin and Smith.

Parameters

in
a

Double precision scalar, real part of numerator.

in
b

Double precision scalar, imaginary part of numerator.

in
c

Double precision scalar, real part of denominator.

in
d

Double precision scalar, imaginary part of denominator.

out
p

Pointer to f64, receives real part of result.

out
q

Pointer to f64, receives imaginary part of result.

On this page

This Page