2 use Scalar::Util 'blessed';
5 use Math::GSL::Errno qw/:all/;
6 use Math::GSL::BLAS qw/gsl_blas_ddot/;
7 use Math::GSL::Complex qw/:all/;
8 use Math::GSL::Test qw/is_status_ok/;
11 '*' => \&_multiplication,
17 @EXPORT_all = qw/fopen fclose
18 gsl_vector_complex_alloc gsl_vector_complex_calloc gsl_vector_complex_alloc_from_block gsl_vector_complex_alloc_from_vector
19 gsl_vector_complex_free gsl_vector_complex_view_array gsl_vector_complex_view_array_with_stride gsl_vector_complex_const_view_array
20 gsl_vector_complex_const_view_array_with_stride gsl_vector_complex_subvector gsl_vector_complex_subvector_with_stride
21 gsl_vector_complex_const_subvector gsl_vector_complex_const_subvector_with_stride gsl_vector_complex_real gsl_vector_complex_imag
22 gsl_vector_complex_const_real gsl_vector_complex_const_imag gsl_vector_complex_get gsl_vector_complex_set
23 gsl_vector_complex_ptr gsl_vector_complex_const_ptr gsl_vector_complex_set_zero gsl_vector_complex_set_all
24 gsl_vector_complex_set_basis gsl_vector_complex_fread gsl_vector_complex_fwrite gsl_vector_complex_fscanf
25 gsl_vector_complex_fprintf gsl_vector_complex_memcpy gsl_vector_complex_reverse gsl_vector_complex_swap
26 gsl_vector_complex_swap_elements gsl_vector_complex_isnull gsl_vector_complex_ispos gsl_vector_complex_isneg
28 @EXPORT_file =qw/ fopen fclose/;
29 @EXPORT_OK = (@EXPORT_all, @EXPORT_file);
30 %EXPORT_TAGS = ( file => \@EXPORT_file, all => \@EXPORT_all );
34 Math::GSL::VectorComplex - Complex Vectors
38 use Math::GSL::VectorComplex qw/:all/;
39 my $vec1 = Math::GSL::VectorComplex->new([1 + 2*i, 7*i, 5, -3 ]);
41 my $vec3 = Math::GSL::Vector>new(10); # 10 element zero vector
42 my $vec4 = $vec1 + $vec2;
44 # set the element at index 1 to -i
45 # and the element at index 3 to i
46 $vec3->set([ 1, -i ], [ 9, i ]);
48 my @vec = $vec2->as_list; # return elements as Perl list
50 my $dot_product = $vec1 * $vec2;
51 my $length = $vec2->length;
52 my $first = $vec1->get(0);
57 =head1 Objected Oriented Interface to GSL Math::GSL::VectorComplex
61 Creates a new Vector of the given size.
63 my $vector = Math::GSL::VectorComplex->new(3);
65 You can also create and set directly the values of the vector like this :
67 my $vector = Math::GSL::VectorComplex->new([2,4,1]);
72 my ($class, $values) = @_;
73 my $length = $#$values;
77 # we expected $values to have Math::Complex objects
78 @$values = map { gsl_complex_rect(Re($_), Im($_)) } @$values;
80 if ( ref $values eq 'ARRAY' ){
81 die __PACKAGE__.'::new($x) - $x must be a nonempty array reference' if $length == -1;
82 $vector = gsl_vector_complex_alloc($length+1);
83 map { gsl_vector_complex_set($vector, $_, $values->[$_] ) } (0 .. $length);
84 $this->{_length} = $length+1;
85 } elsif ( (int($values) == $values) && ($values > 0)) {
86 $vector = gsl_vector_complex_alloc($values);
87 gsl_vector_complex_set_zero($vector);
88 $this->{_length} = $values;
90 die __PACKAGE__.'::new($x) - $x must be an int or array reference';
92 $this->{_vector} = $vector;
99 Get the underlying GSL vector object created by SWIG, useful for using gsl_vector_* functions which do not have an OO counterpart.
101 my $vector = Math::GSL::VectorComplex->new(3);
102 my $gsl_vector = $vector->raw;
103 my $stuff = gsl_vector_get($gsl_vector, 1);
109 return $self->{_vector};
114 Returns the minimum value contained in the vector.
116 my $vector = Math::GSL::VectorComplex->new([2,4,1]);
117 my $minimum = $vector->min;
123 return gsl_vector_min($self->raw);
128 Returns the minimum value contained in the vector.
130 my $vector = Math::GSL::VectorComplex->new([2,4,1]);
131 my $maximum = $vector->max;
137 return gsl_vector_max($self->raw);
142 Returns the number of elements contained in the vector.
144 my $vector = Math::GSL::VectorComplex->new([2,4,1]);
145 my $length = $vector->length;
149 sub length { my $self=shift; $self->{_length} }
153 Gets the content of a Math::GSL::Vector object as a Perl list.
155 my $vector = Math::GSL::VectorComplex->new(3);
157 my @values = $vector->as_list;
162 return map { cplxe( gsl_complex_abs($_), gsl_complex_arg($_) ) } $self->get( [ 0 .. $self->length - 1 ] );
167 Gets the value of an of a Math::GSL::Vector object.
169 my $vector = Math::GSL::VectorComplex->new(3);
171 my @values = $vector->get(2);
173 You can also enter an array of indices to receive their corresponding values:
175 my $vector = Math::GSL::VectorComplex->new(3);
177 my @values = $vector->get([0,2]);
182 my ($self, $indices) = @_;
183 return map { gsl_vector_complex_get($self->raw, $_ ) } @$indices ;
188 Returns the a vector with the elements in reversed order.
191 my $v1 = Math::GSL::VectorComplex->new([ 1, 2, 3*i]);
192 my $v2 = $v1->reverse;
198 my $copy = $self->copy();
199 unless ( is_status_ok( gsl_vector_complex_reverse( $copy->raw )) ) {
200 die( __PACKAGE__.": error reversing vector " . gsl_strerror($status) );
207 Sets values of an of a Math::GSL::Vector object.
209 my $vector = Math::GSL::VectorComplex->new(3);
210 $vector->set([1,2], [8,23]);
212 This sets the second and third value to 8 and 23.
217 my ($self, $indices, $values) = @_;
218 die (__PACKAGE__.'::set($indices, $values) - $indices and $values must be array references of the same length')
219 unless ( ref $indices eq 'ARRAY' && ref $values eq 'ARRAY' && $#$indices == $#$values );
221 map { gsl_vector_set($self->{_vector}, $indices->[$_], $values->[$_] ) } (0..$#$indices);
228 Returns a copy of the vector, which has the same length and values but resides at a different location in memory.
230 my $vector = Math::GSL::VectorComplex->new([10 .. 20]);
231 my $copy = $vector->copy;
238 my $copy = Math::GSL::VectorComplex->new( $self->length );
239 if ( gsl_vector_complex_memcpy($copy->raw, $self->raw) != $GSL_SUCCESS ) {
240 croak "Math::GSL - error copying memory, aborting";
245 sub _multiplication {
246 my ($left,$right) = @_;
247 my $lcopy = $left->copy;
249 if ( blessed $right && $right->isa(__PACKAGE__) ) {
250 return $lcopy->dot_product($right);
252 # will be in upcoming gsl 1.12
253 # gsl_vector_complex_scale($lcopy->raw, $right);
259 my ($left, $right, $flip) = @_;
262 my $lcopy = $left->copy;
263 gsl_vector_scale($lcopy->raw, -1 );
264 gsl_vector_add_constant($lcopy->raw, $right);
267 return _addition($left, -1.0*$right);
272 my ($left, $right, $flip) = @_;
274 my $lcopy = $left->copy;
276 if ( blessed $right && $right->isa('Math::GSL::Vector') && blessed $left && $left->isa('Math::GSL::Vector') ) {
277 if ( $left->length == $right->length ) {
278 gsl_vector_add($lcopy->raw, $right->raw);
280 croak "Math::GSL - addition of vectors must be called with two objects vectors and must have the same length";
283 gsl_vector_add_constant($lcopy->raw, $right);
289 my ($left,$right) = @_;
291 if ( blessed $right && $right->isa('Math::GSL::Vector') &&
292 $left->length == $right->length ) {
293 my @l = $left->as_list;
294 my @r = $right->as_list;
295 map { $sum += $l[$_] * $r[$_] } (0..$#l);
298 croak "dot_product() must be called with two vectors";
303 my ($left,$right) = @_;
305 my ($status, $product) = gsl_blas_ddot($left->raw,$right->raw);
306 croak sprintf "Math::GSL::dot_product - %s", gsl_strerror($status) if ($status != $GSL_SUCCESS);
314 Here is an example using both interfaces.
316 use Math::GSL::Vector qw/:all/;
318 print "We'll create this vector : [0,1,4,9,16] \n";
319 my $vector = Math::GSL::VectorComplex->new([0,1,4,9,16]);
320 my ($min, $max) = gsl_vector_minmax_index($vector->raw);
322 print "We then check the index value of the maximum and minimum values of the vector. \n";
323 print "The index of the maximum should be 4 and we received $max \n";
324 print "The index of the minimum should be 0 and we received $min \n";
325 print "We'll then swap the first and the third elements of the vector \n";
327 gsl_vector_swap_elements($vector->raw, 0, 3);
328 my @got = $vector->as_list;
329 print "The vector should now be like this : [9,1,4,0,16] \n";
330 print "and we received : [ @got ]\n";
334 Jonathan Leto <jonathan@leto.net> and Thierry Moisan <thierry.moisan@gmail.com>
336 =head1 COPYRIGHT AND LICENSE
338 Copyright (C) 2008 Jonathan Leto and Thierry Moisan
340 This program is free software; you can redistribute it and/or modify it
341 under the same terms as Perl itself.