// An example of implementing the simplest method to
// solve the Sturm-Liouville problem.
import java.lang.;
public class Sturm {
static final int n = 100, ni = 10;
public static void main(String argv[]) {
double del = 1e-6, l = 0.5, dl = 0.1;
l = secant(ni, del, l, dl);
// Output the eigenvalue obtained
System.out.println("The eigenvalue is: " + l);
}
public static double secant(int n, double del,
double x, double dx) {...}
// Method to provide the function for the root search.
public static double f(double l) {
double u[] = new double[n+1];
double p[] = new double[n+1];
double q[] = new double[n+1];
double s[] = new double[n+1];
double p1[] = new double[n+1];
double h = 1.0/n;
double u0 = 0;
double u1 = h;
for (int i=0; i<=n; ++i){
double x = hi;
p[i] = 1-xx;
p1[i] = -2x;
q[i] = l*(l+1);
s[i] = 0;
}
u = sturmLiouville(h, u0, u1, p, p1, q, s);
return u[n]-1;
}
// Method to integrate the Sturm-Liouville problem.
public static double[] sturmLiouville(double h,
double u0, double u1, double p[], double p1[],
double q[], double s[]) {
int n = p.length-1;
double u[] = new double[n+1];
double h2 = hh;
u[0] = u0;
u[1] = u1;
for (int i=1; i<n; ++i){
double c2 = 2p[i]+hp1[i];
double c1 = 4p[i]-2h2q[i];
double c0 = 2p[i]-hp1[i];
double d = 2h2s[i];
u[i+1] = (c1u[i]-c0u[i-1]+d)/c2;
}
return u;
}
}
不能转换 就像windows中的软件不能放到linux中