Package com.nr.bvp

Examples of com.nr.bvp.Solvde

82
83
84
85
86
87
88
89
90
91
92
    scalv[0]=abs(anorm);
    scalv[1]=(y[1][M] > scalv[0] ? y[1][M] : scalv[0]);
    scalv[2]=(y[2][M] > 1.0 ? y[2][M] : 1.0);
    for (int j=0;j<MM;j++) {
      Difeq difeq = new Difeq(mm,n,mpt,h,c2[j],anorm,x);
      new Solvde(itmax,conv,slowc,scalv,indexv,NB,y,difeq);
      System.out.printf("\n m = %d  n = %d  c**2 = %f lamda = %f\n",
          mm, n, c2[j],(y[2][0]+mm*(mm+1)));
    }
    return 0;
  }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
      y[1][M]=(y[2][M]-c2[i])*y[0][M]/(2.0*(mm[i]+1.0));
      scalv[0]=abs(anorm);
      scalv[1]=(y[1][M] > scalv[0] ? y[1][M] : scalv[0]);
      scalv[2]=(y[2][M] > 1.0 ? y[2][M] : 1.0);
      Difeq difeq = new Difeq(mm[i],n[i],mpt,h,c2[i],anorm,x);
      new Solvde(itmax,conv,slowc,scalv,indexv,NB,y,difeq);
      result=y[2][0]+mm[i]*(mm[i]+1);
      System.out.printf("   m = %d  n = %d  c**2 = %f  lamda = %f\n",
          mm[i], n[i], c2[i],result);

//      System.out.printf(abs(result/expect[i]-1.0));
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
    scalv[0]=abs(anorm);
    scalv[1]=(y[1][M] > scalv[0] ? y[1][M] : scalv[0]);
    scalv[2]=(y[2][M] > 1.0 ? y[2][M] : 1.0);
    for (int j=0;j<MM;j++) {
      Difeq difeq = new Difeq(mm,n,mpt,h,c2[j],anorm,x);
      new Solvde(itmax,conv,slowc,scalv,indexv,NB,y,difeq);
      /*
      cout << endl << " m = " << setw(3) << mm;
      cout << "  n = " << setw(3) << n << "  c**2 = ";
      cout << fixed << setprecision(3) << setw(7) << c2[j];
      cout << " lamda = " << setprecision(6) << (y[2][0]+mm*(mm+1));
 
View Full Code Here
TOP

Related Classes of com.nr.bvp.Solvde

  • com.nr.example.Solvde_Ex
  • com.nr.test.test_chapter18.Test_sfroid
  • com.nr.test.test_chapter18.Test_Solvde
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.