subdomain_collocation.cpp

算法的一些集合

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