A bidimensional Taylor approximation in the point (x,y) has the form f(x,y)=a(0,0)+a(0,1)*1/x+a(1,0)*1/y+a(0,2)*1/x2+a(1,1)*1/(xy)+a(2,0)*1/y2+... Given the polynomial (the coefficients) and a square mesh of points, we want to obtain the Taylor approximation with this polynomial for each point in the mesh.
A number of problems is solved. For each problem the function to parallelize has:
Input parameters:
-int N: the size of the matrix where the coefficients of the Taylor polynomial are represented; the representation will be of degree N-1
-double *a: the matrix NxN with the coefficients of the Taylor polynomial (only the upper-triangular part of the matrix is used)
-int P: the number of points at each dimension in the mesh
-double *meshx, double *meshy: contain the coordinates x and y for the PxP points in the mesh
Output parameter
-double *r: a matrix, of size PxP, with the Taylor approximations of the points
For more instructions: general instructions.