This package lets you create and manipulate complex numbers. By default, *Perl* limits itself to real numbers, but an extra "use" statement brings full complex support, along with a full set of mathematical functions typically associated with and/or ...

Here is a list of all the functions included in this module : "gsl_complex_arg($z)" Return the argument of the complex number $z "gsl_complex_abs($z)" Return |$z|, the magnitude of the complex number $z "gsl_complex_rect($x,$y)" Create a complex numb...

This module is a layer on top of the basic routines in the cephes math library to handle complex numbers. A complex number is created via any of the following syntaxes: my $f = Math::Cephes::Complex->new(3, 2); # $f = 3 + 2 i my $g = new Math::Cephes...

This module adds complex number support to Math::Symbolic. It does so by extending the parser of the Math::Symbolic module (that is, the one stored in $Math::Symbolic::Parser) with certain special functions that create complex constants. (Math::Symbo...

"Math::Trig" defines many trigonometric functions not defined by the core Perl which defines only the "sin()" and "cos()". The constant pi is also defined as are a few convenience functions for angle conversions, and *great circle formulas* for spher...

use warnings; use strict; use Math::Complex_C qw(:all); # For brevity, use MCD which is an alias for Math::Complex_C::new my $c = MCD(12.5, 1125); # assign as NV my $root = MCD(); sqrt_c($root, $c); print "Square root of $c is $root\n"; See also the ...

use warnings; use strict; use Math::Complex_C::Q qw(:all); # For brevity, use MCQ which is an alias for Math::Complex_C::Q::new my $c = MCQ(12.5, 1125); # assign as NV my $root = MCQ(); sqrt_cq($root, $c); print "Square root of $c is $root\n"; See al...

use warnings; use strict; use Math::Complex_C::L qw(:all); # For brevity, use MCL which is an alias for Math::Complex_C::L::new my $c = MCL(12.5, 1125); # assign as NV my $root = MCL(); sqrt_cl($root, $c); print "Square root of $c is $root\n"; See al...

"gsl_matrix_complex_alloc " "gsl_matrix_complex_calloc " "gsl_matrix_complex_alloc_from_block " "gsl_matrix_complex_alloc_from_matrix " "gsl_vector_complex_alloc_row_from_matrix " "gsl_vector_complex_alloc_col_from_matrix " "gsl_matrix_complex_free "...

This path traverses points by a complex number base i+r for integer r>=1. The default is base i+1 30 31 14 15 5 28 29 12 13 4 26 27 22 23 10 11 6 7 3 24 25 20 21 8 9 4 5 2 62 63 46 47 18 19 2 3 1 60 61 44 45 16 17 0 1 <- Y=0 58 59 54 55 42 43 38 39 -...

Inline::Octave gives you the power of the octave programming language from within your Perl programs. Basically, I create an octave process with controlled stdin and stdout. Commands send by stdin. Data is send by stdin and read with fread(stdin, [di...

This path traverses points by a complex number base i-r for given integer r. The default is base i-1 as per Solomon I. Khmelnik "Specialized Digital Computer for Operations with Complex Numbers" (in Russian), Questions of Radio Electronics, volume 12...

This path traverses points by a complex number base i+1 with turn factor i (+90 degrees) at each 1 bit. This is the "revolving binary representation" of Knuth's Seminumerical Algorithms section 4.1 exercise 28....

Here is a list of all the functions included in this module : * gsl_poly_eval(@values, $length, $x) This function evaluates a polynomial with real coefficients for the real variable $x. $length is the number of elements inside @values. The function r...

This module is part of the Math::GSL distribution. It defines a Perl insterface to GNU Scientific Library matrices. There are two different (but not exclusive) ways to use this module: using the OO API, built manually over the GSL functions, or using...

Here is a list of all the functions included in this module : gsl_linalg_matmult gsl_linalg_matmult_mod gsl_linalg_exponential_ss gsl_linalg_householder_transform gsl_linalg_complex_householder_transform gsl_linalg_householder_hm($tau, $v, $A) - This...

* "gsl_fft_complex_radix2_forward($data, $stride, $n) " This function computes the forward FFTs of length $n with stride $stride, on the array reference $data using an in-place radix-2 decimation-in-time algorithm. The length of the transform $n is r...