Решение нелинейных уравнений

package cmeth1;

import java.util.*;

public class CMeth1 {

    static double func(double u, double m[]) {
        return m[0] * u * u * u * u + m[1] * u * u * u + m[2] * u * u + m[3] * u + m[4];
    }

    static double max(double m[]) {
        double max = m[0];
        for (int i = 1; i < m.length; i++) {
            if (max < m[i]) {
                max = m[i];
            }
        }
        return max;
    }

    public static void main(String[] args) {
        //x ^ 4 + 4.3x ^ 3 + 0.34x ^ 2 − 8.56x + 2.64=0
        Scanner sc = new Scanner(System.in);
        double m[] = new double[5];
        for (int i = 0; i < m.length; i++) {

            m[i] = sc.nextDouble();
            //System.out.println("J");
        }
        double e = 0.0001;
        double b;
        //System.out.println("Jj");
        double d = sc.nextDouble();
        //System.out.println("Jjj");
        b = 1 + (max(m)) / (m[4]);
        double a = -b;
        //double b = a + d;
        /*double u1, u2, u;
        double J = 0;

        int n = 0;*/
        ArrayList<Double> list = new ArrayList<>();
        while (a + d <= b) {
            //System.out.println("Jjjj");
            if (func(a, m) * func(a + d, m) < 0) {
                list.add(a);
            } else {
            }
            a += d;
        }

        //System.out.println("J = " + J + ", num of iterations - " + n);
    }

}