galerkin_method.cpp

算法的一些集合

#include "vs.h"
int main() {
   double weight[5] = {14.0/45.0, 64.0/45.0, 24.0/45.0, 64.0/45.0, 14.0/45.0};
   C0 M(2, 2, (double*)0), b(2, (double*)0);
   Quadrature qp(weight, 0.0, 1.0, 5);
   J d_l(1.0/4.0);
   for(int i = 0; i < 2; i ++) {
      H2 x((double*)0, qp), w,
      phi = INTEGRABLE_VECTOR_OF_TANGENT_OF_TANGENT_BUNDLE(
      	"int, int, Quadrature", 2, 1, qp);
      phi[0] = x*(1-x); phi[1] = x.pow(2)*(1-x);
      M[i] = (((H0)phi[i])* (+dd(phi))(0)+((H0)phi) ) | d_l;
      b[i] = -(((H0)phi[i])*((H0)x)) | d_l;
   }
   C0 c = b / M;
   cout << c << endl;
   cout << M << endl;
   cout << b << endl;
	return 0;
}