WebSVN – programming – Diff – //school/cs301/proj3/proj3.cpp

  * - Implemented Algorithm 7 (LaGrange) from Notes Set #3.
  * - Implemented Algorithm 8-9 (Newton Divided Diff) from Notes Set #3.
  * - Implemented GenEvenPts() which will generate evenly spaced points.
  * - Implemented GenChebychevPts() which will generate Chebychev points.
  * - Split the Newton algorithm into two parts: NewtonMethod() and NewtonCoef().
+ * - Implemented brute_search_lagrange() and brute_search_newton() to find the
+ *   worst values. This is taken from the Project #3 Handout.
+ * - Added each needed call to main().
+ *
  */
 #include <cstdio>
 #include <cmath>
 using namespace std;
 #define MAX_POINTS 26
-// Global Variables for easier return values
+// Global Variables for easier return values from the brute_search functions.
 double absmax, xsave;
 /**
  * Function #1 from the Project #3 Handout.
+ *
         xval += h;
+    }
+}
+/**
+ * Print a nice error line in the format we need.
+ *
+ * @param points the number of points
+ * @param absmax the value of absmax (redundant, I know)
+ * @param xsave the value of xsave (redundant)
+ */
+void print_error_line (int points, double absmax, double xsave)
+{
+    printf ("For %-2d Points, MAX ERROR is: %e"
+            " -- OCCURS at x = %e\n", points, absmax, xsave);
+}
 int main (void)
+{
-    int size, i;
+    int i; // number of points
     double x[MAX_POINTS];
     double y[MAX_POINTS];
     // In the following code, the correct functions are run for each of the
     // 12 times this needs to be run.
     printf ("Newton Polynomial, Equal Points, Function #1\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenEvenPts (size, &func1, x, y);
+        GenEvenPts (i, &func1, x, y);
-        brute_search_newton (x, y, size, &func1);
+        brute_search_newton (x, y, i, &func1);
+        print_error_line (i, absmax, xsave);
-        printf ("For %-2d Points, MAX ERROR is: %e"
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("Newton Polynomial, Equal Points, Function #2\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenEvenPts (size, &func2, x, y);
+        GenEvenPts (i, &func2, x, y);
-        brute_search_newton (x, y, size, &func2);
+        brute_search_newton (x, y, i, &func2);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("Newton Polynomial, Equal Points, Function #3\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenEvenPts (size, &func3, x, y);
+        GenEvenPts (i, &func3, x, y);
-        brute_search_newton (x, y, size, &func3);
+        brute_search_newton (x, y, i, &func3);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("LaGrange Polynomial, Equal Points, Function #1\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenEvenPts (size, &func1, x, y);
+        GenEvenPts (i, &func1, x, y);
-        brute_search_lagrange (x, y, size, &func1);
+        brute_search_lagrange (x, y, i, &func1);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("LaGrange Polynomial, Equal Points, Function #2\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenEvenPts (size, &func2, x, y);
+        GenEvenPts (i, &func2, x, y);
-        brute_search_lagrange (x, y, size, &func2);
+        brute_search_lagrange (x, y, i, &func2);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("LaGrange Polynomial, Equal Points, Function #3\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenEvenPts (size, &func3, x, y);
+        GenEvenPts (i, &func3, x, y);
-        brute_search_lagrange (x, y, size, &func3);
+        brute_search_lagrange (x, y, i, &func3);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("Newton Polynomial, Chebychev Points, Function #1\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenChebychevPts (size, &func1, x, y);
+        GenChebychevPts (i, &func1, x, y);
-        brute_search_newton (x, y, size, &func1);
+        brute_search_newton (x, y, i, &func1);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("Newton Polynomial, Chebychev Points, Function #2\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenChebychevPts (size, &func2, x, y);
+        GenChebychevPts (i, &func2, x, y);
-        brute_search_newton (x, y, size, &func2);
+        brute_search_newton (x, y, i, &func2);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("Newton Polynomial, Chebychev Points, Function #3\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenChebychevPts (size, &func3, x, y);
+        GenChebychevPts (i, &func3, x, y);
-        brute_search_newton (x, y, size, &func3);
+        brute_search_newton (x, y, i, &func3);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("LaGrange Polynomial, Chebychev Points, Function #1\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenChebychevPts (size, &func1, x, y);
+        GenChebychevPts (i, &func1, x, y);
-        brute_search_lagrange (x, y, size, &func1);
+        brute_search_lagrange (x, y, i, &func1);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("LaGrange Polynomial, Chebychev Points, Function #2\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenChebychevPts (size, &func2, x, y);
+        GenChebychevPts (i, &func2, x, y);
-        brute_search_lagrange (x, y, size, &func2);
+        brute_search_lagrange (x, y, i, &func2);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     printf ("\n\n");
     printf ("LaGrange Polynomial, Chebychev Points, Function #3\n");
     printf ("============================================================\n");
     for (i=6; i<=26; i+=5)
+    {
-        size = i;
-        GenChebychevPts (size, &func3, x, y);
+        GenChebychevPts (i, &func3, x, y);
-        brute_search_lagrange (x, y, size, &func3);
+        brute_search_lagrange (x, y, i, &func3);
-        printf ("For %-2d Points, MAX ERROR is: %e"
+        print_error_line (i, absmax, xsave);
-                " -- OCCURS at x = %e\n", size, absmax, xsave);
+    }
     return 0;
+}

Subversion Repositories programming

(root)//school/cs301/proj3/proj3.cpp – Rev 157 → 158