Executable-Java!

Hello Java Friends
Can any of you please point out what is the most important error/reason causing the program tiedup with this error message :nosuchmethods ,though it is an errorless one on compilation.(
1)The classfile is created.
2)the objects are there.
3)main method is available(with static/without static tried)
But still it is not executing.
Shall I forward the code on hearing from you
Best Wishes for a solution.
Thanks
As Always
C.R.Muthukumar

Please post the source code and the exact message you are encountering.

Originally posted by Steve Fahlbusch:
Please post the source code and the exact message you are encountering.

Hello
Please try to treat the program emphasising more on object orientation consisting of a large number of functions.Subsequent to recent compilation the result of the same is indicated as only Solution without the output.
The details are as under

1)function(f(x,y)
2)xo,yo
3)increment h
4)number of y values to be found.n
Using Euler's method the following values will be computed
x1,x2,x3 ...xn,y1,y2,y3...yn
The algorithm is:
1)for i=0 to n-1
2)xi+1=xi+h
3)yi+1=yi+hf(x,y)
4)print xi+1,yi+1
5)next i
6)end

The code:
import java.text.*;
import java.util.*;
import java.lang.Math;
import java.lang.Number;
import javax.swing.*;
import java.awt.event.*;
public class EulerIVP1 extends JFrame implements ActionListener{
int n;
double h;
double x[],y[],f[];
public void EulerIVP1(int n,double ax,double ay,double h)
{

setTitle("Euler");
setLayout(new FlowLayout());
addWindowListener(new WH());

this.n=n;
x = new double[n];
y = new double[n];
f = new double[n];
x[0]= ax;

for (int i=1; i<n+1; i++)
x[i] = x[0] + (double)i * h;
y[0] = ay;
}

public double findf(double x, double y)
{
double f = x*x + y*y;
return f;
}

class WH extends WindowAdapter{

public void windowClosing(WindowEvent e)
{
System.exit(0);
}

}

public void actionPerformed(ActionEvent e)
{
if(e.getActionCommand().equals(displaySolution()));

JFrame frame= new JFrame();

EulerIVP1 eqn;
eqn=new EulerIVP1();

eqn.setBounds(1,1,200,300);
eqn.findSolution();
eqn.displaySolution();
eqn.setVisible(true);
eqn.show();

}

public double findSolution()
{

for(int i=1;i < n+1;i++)
{
f[i] = findf(x[i],y[i]);
y[i+i] = y[i] + h * f[i];
}
return;
}
public double displaySolution()
{
System.out.println("Solution");
for (int i=1;i<n+1;i++)
{

System.out.println("x:"+ x[i] + "y:" +y[i]);

}
return;
}

public static double main(String[] args){

double ax;
double ay;
int n=0;
double h=0.5;
EulerIVP1 eqn=new EulerIVP1();
JFrame frame= new JFrame();

eqn.setBounds(1,1,200,300);
eqn.findSolution();
eqn.displaySolution();
eqn.setVisible(true);
eqn.show();

}
}
Hope to get the solutions with the output for this numerical computations
Thanking You
As Always
C.R.Muthukumar

Originally posted by C.R.Muthukumar Muthukumar:

Hello
Please try to treat the program emphasising more on object orientation consisting of a large number of functions.Subsequent to recent compilation the result of the same is indicated as only Solution without the output.
The details are as under

1)function(f(x,y)
2)xo,yo
3)increment h
4)number of y values to be found.n
Using Euler's method the following values will be computed
x1,x2,x3 ...xn,y1,y2,y3...yn
The algorithm is:
1)for i=0 to n-1
2)xi+1=xi+h
3)yi+1=yi+hf(x,y)
4)print xi+1,yi+1
5)next i
6)end

The code:
import java.text.*;
import java.util.*;
import java.lang.Math;
import java.lang.Number;
import javax.swing.*;
import java.awt.event.*;
public class EulerIVP1 extends JFrame implements ActionListener{
int n;
double h;
double x[],y[],f[];
public void EulerIVP1(int n,double ax,double ay,double h)
{

setTitle("Euler");
setLayout(new FlowLayout());
addWindowListener(new WH());

this.n=n;
x = new double[n];
y = new double[n];
f = new double[n];
x[0]= ax;

for (int i=1; i<n+1; i++)
x[i] = x[0] + (double)i * h;
y[0] = ay;
}

public double findf(double x, double y)
{
double f = x*x + y*y;
return f;
}

class WH extends WindowAdapter{

public void windowClosing(WindowEvent e)
{
System.exit(0);
}

}

public void actionPerformed(ActionEvent e)
{
if(e.getActionCommand().equals(displaySolution()));

JFrame frame= new JFrame();

EulerIVP1 eqn;
eqn=new EulerIVP1();

eqn.setBounds(1,1,200,300);
eqn.findSolution();
eqn.displaySolution();
eqn.setVisible(true);
eqn.show();

}

public double findSolution()
{

for(int i=1;i < n+1;i++)
{
f[i] = findf(x[i],y[i]);
y[i+i] = y[i] + h * f[i];
}
return;
}
public double displaySolution()
{
System.out.println("Solution");
for (int i=1;i<n+1;i++)
{

System.out.println("x:"+ x[i] + "y:" +y[i]);

}
return;
}

public static double main(String[] args){

double ax;
double ay;
int n=0;
double h=0.5;
EulerIVP1 eqn=new EulerIVP1();
JFrame frame= new JFrame();

eqn.setBounds(1,1,200,300);
eqn.findSolution();
eqn.displaySolution();
eqn.setVisible(true);
eqn.show();

}
}
Hope to get the solutions with the output for this numerical computations
Thanking You
As Always
C.R.Muthukumar

The same Java Code now given under concrete datas and with slight modification is being brought forward to indicate that success always follow
when the job is done in a plethora of times .
Thanks
As Always
C.R.Muthukumar

import java.awt.*;
import java.io.*;
import java.text.*;
import java.util.*;
import java.lang.Math;
import java.lang.Number;
import java.awt.event.*;
public class EulerIVP{
int n;
double x[];
double y[];
double f[];
double h;
 
double ax,ay;
 
 EulerIVP(int n,double ax,double ay,double h)
{
    this.n=n;
    this.ax=ax;
     this.ay=ay;
     this.h=h;
 
    x = new double[20];
    y = new double[20];
    f = new double[20];
 
    x[0]= ax;
 
     for (int i=1; i<n; i++)
       x[i] = x[0] + (double)i * h;
     y[0] = ay;
    int i;

}
 
 double findf(double x, double y)
{
 
 double ef=  x*x + y*y;
    return ef;
   }
 
     void findSolution()
   {
     for(int i=1;i<n;i++)
    {
      f[i] = findf(x[i],y[i]);
       y[i+i] = y[i] + h * f[i];
     }
 }

void displaySolution()
 {
    for (int i=1;i<n;i++)
 
 System.out.println("x: " + x[i]+ "y: " +y[i]);
}
 
public static void main(String args[])
{
 
EulerIVP  s1;
s1=new EulerIVP(5,1.0,0.8,0.5);
//s1.resize(400,400);
//s1.show();
       s1.findSolution();
       s1. displaySolution();
}
 
}

Originally posted by C.R.Muthukumar Muthukumar:

The same Java Code now given under concrete datas and with slight modification is being brought forward to indicate that success always follow
when the job is done in a plethora of times .
Thanks
As Always
C.R.Muthukumar
import java.awt.*; import java.io.*; import java.text.*; import java.util.*; import java.lang.Math; import java.lang.Number; import java.awt.event.*; public class EulerIVP{ int n; double x[]; double y[]; double f[]; double h; double ax,ay; EulerIVP(int n,double ax,double ay,double h) { this.n=n; this.ax=ax; this.ay=ay; this.h=h; x = new double[20]; y = new double[20]; f = new double[20]; x[0]= ax; for (int i=1; i<n; i++) x[i] = x[0] + (double)i * h; y[0] = ay; int i; } double findf(double x, double y) { double ef= x*x + y*y; return ef; } void findSolution() { for(int i=1;i<n;i++) { f[i] = findf(x[i],y[i]); y[i+i] = y[i] + h * f[i]; } } void displaySolution() { for (int i=1;i<n;i++) System.out.println("x: " + x[i]+ "y: " +y[i]); } public static void main(String args[]) { EulerIVP s1; s1=new EulerIVP(5,1.0,0.8,0.5); //s1.resize(400,400); //s1.show(); s1.findSolution(); s1. displaySolution(); } }

Hello RanchHands,
I was able to code the above Euler'sIVP program successfully rendering output. Howevevr,a similar program,coded for obtaining the MagicSquare,though,fully clears in compilation, the output is not forthcoming.Can any of ranchhands or their superiors help out for worthwhile modification.
Thanks
As Always
C.R.Muthukumar

import java.io.*;
import java.awt.*;
import java.util.*;
import java.text.*;
import java.lang.Integer;
import java.lang.Math;
import javax.swing.*;
public class AlgorithmMagic extends Frame
{
static int j;
    static int i;
    static int k;
   static int l;
   static int key;
   static int n;

public static int AlgorithmMagic(){
 
int Square[][] = new int[9][9];
 
if(n % 2 == 0)
{
 System.out.println("n is even: "+ " ");
 }
else
{
 
 for (i=0;i<=n-1;i++)
 for(j=0;j<=n-1;j++){
 
   Square[0][(n-1)/2]=1;
    j = n-1/2;
 
  for (key=2;key >= Square[0][(n-1)/2]; key++)
  {
   if(i >= 1)
      k =i-1;
       else
       k=(n-1);
      if(j >= 1)
        l=j-1;
     else
      l=(n-1);
if(Square[k][l]>=1)
 
i=((i+1) % n);
else
  {
  i=k;
  j=l;
 }
  Square[i][j]= key;
  }
  for(i=0;i > n-1;i++)
   for(j=0;j > n-1;j++)
  {
 
 System.out.println(Square[i][j]);
 System.out.println("\n");
 
  }
 }
}
 return Square[i][j];
}
public static void main(String args[])
{
n=7;
AlgorithmMagic ag;
ag = new AlgorithmMagic();
ag.resize(400,400);
ag.AlgorithmMagic();
 
}
}