The fast, the random

The fast and the random

Posted using ShareThis

This is very cool, look at how many bit per second they can resolve !
Put on a USB device and sell it!

Matrices Direct Product C GSL routine

This is my amateur routine of Matrices Direct Product or Kronecker Product using GSL. There is no advantage in doing this with GSL library, this is just a exercise.

#include <stdio.h>
#include <gsl/gsl_matrix.h>
#include <gsl/gsl_math.h>

double *produtodireto (int a,int b, double A[a*a],double B[b*b])
     {
 double *AxB;
 AxB = malloc(a*a*b*b*(sizeof *AxB));
 int i, j, k,l;
 gsl_matrix *M = gsl_matrix_alloc (a,a);
 gsl_matrix *L = gsl_matrix_alloc (b,b);
 for (i = 0; i < a; i++)
  {
  for (j = 0; j < a; j++)
   {
             gsl_matrix_set (M, i, j, A[i+a*j]);
   }
  }
 for (i = 0; i < b; i++)
  {
  for (j = 0; j < b; j++)
   {
      gsl_matrix_set (L, i, j, B[i+b*j]);
   }
  }
 gsl_matrix *R = gsl_matrix_alloc (a*b,a*b);
 for (i = 0; i < a; i++)
  {
  for (j = 0; j < a; j++)
   { 
   for (k = 0; k < b; k++)
    {
    for (l = 0; l < b; l++)
     {
     gsl_matrix_set (R, b*i+k-b+2,b*j+l-b+2, gsl_matrix_get (M, i, j)*gsl_matrix_get (L, k, l));
     }
    }
   }
  }
for (i = 0; i < a*b; i++)  
 {/* OUT OF RANGE ERRORRRRR */
 for (j = 0; j < a*b; j++)
  {
  AxB[i+a*b*j]=gsl_matrix_get (R, i, j);
  }
 }

gsl_matrix_free (M);
gsl_matrix_free (L);
gsl_matrix_free (R);
       return AxB;
     }

Using GSL to calculate Nonsymmetric matrices eigenvalues

Here is a example of using GSL - Gnu Scientific Library - to calculate the eigenvalues of a nonsymmetric matrix.
This is a simple example write in C. GSL uses BLAS and can be optimized with ATLAS, so can be used as a real tool for heavy calculations. To get know more about GSL visit http://www.gnu.org/software/gsl/ or the manual page.

Hint: Beware when using GSL or our own linear algebra routine, remember that greats matrices requires greats responsibilities, so keep track of precision errors. Find precision errors will be a great excuse to know more about multiple precision GMP .

#include <stdio.h>
#include <gsl/gsl_matrix.h>
#include <gsl/gsl_math.h>
#include <gsl/gsl_eigen.h>
int main (void)
        {
        int a=2; //matrix a x a
        int i,j;
        double cg[a][a];

        // Defining matrix
        cg[0][0] = 2.;
        cg[0][1] = 3.;
        cg[1][0] = -1.;
        cg[1][1] = 1.;

        gsl_matrix *TOTAL = gsl_matrix_alloc (a,a); //Alloc GSL matrix TOTAL

        //Setting TOTAL
        for (i = 0; i < a; i++)
                {
                for (j = 0; j < a; j++)
                        {
                        gsl_matrix_set (TOTAL, i, j, cg[i][j]);
                        }
                }


        gsl_vector_complex *eval = gsl_vector_complex_alloc (a); //Vector whose entries are the eigenvalues
        gsl_eigen_nonsymm_workspace *K = gsl_eigen_nonsymm_alloc (a); //alloc work space for GSL nonsymmetric calculations
        gsl_eigen_nonsymm (TOTAL,eval,K);
        gsl_eigen_nonsymm_free (K);
        gsl_matrix_free (TOTAL);


        for (i = 0; i < a; i++)  /* OUT OF RANGE ERROR */
                {
                gsl_complex eval_i = gsl_vector_complex_get (eval, i);
                printf ("%g + %g*i\n",GSL_REAL(eval_i),GSL_IMAG(eval_i) );
                }
return 0;
}

Testando a extenção do Firefox Firescribe

Gostei !!