1. (Due September 12) Use calculus to find the range of a function (4 + x) * (2 − x) on the interval [0, 6].
2. (Due September 13) Use calculus to find the range of a function (2 − x1) * (4 + x2) when x1 is in the interval [0, 6] and x2 is in the interval [−1, 6].
3. (Due September 18) Linearize the expression from Problem 1 around the interval's midpoint. Use the linearized expression to find the approximate value of the range of the original function, both with the actual derivative and with the result of numerical differentiation.
4. (Due September 18) Linearize the expression from Problem 2 around the intervals' midpoints. Use the linearized expression to find the approximate value of the range of the original function, both with the actual derivative and with the result of numerical differentiation.
5. (Due September 25) Write and test a program that estimates the range by using numerical differentiation, and a program that uses Cauchy techniques. Test it on an example of a simple function on a narrow box, e.g., for f(x1, x2) = x12 − x22 when x1 is in [0.9, 1.1] and x2 is in [0.8, 1.2]. For this example, you can find the exact range by using monotonicity.
In general, for each programming assignment, submit a softcopy of the program, and a softcopy of the testing results.
6. (Due September 25) Use straightforward interval computations to estimate the range of the functions from Problems 1 and 2.
7. (Due September 27) Write a program that implements all operations of interval arithmetic: addition, subtraction, multiplication, 1/x, and division. Submit printouts of the code and of the test results, be prepared to show how the program works if needed.
Comments:
8. (Due October 2) Check and, if possible, use monotonicity to estimate the ranges of the functions from Problems 1 and 2.
9. (Due October 16) Use monotonicity and one iteration of bisection to estimate the range of the function from Problem 1 when x is in the interval [−4,0].
10. (Due October 16) Use monotonicity and one iteration of bisection to estimate the range of the function from Problem 2 when x1 is in the interval [0,6] and x2 is in the interval [−6,6].
11. (Due October 18) Use full interval algorithm -- monotonicity, centered form, and bisection (one iteration) -- to estimate the range of the function from Problem 1 when x is in the interval [−4,0].
12. (Due October 23) Use full interval algorithm -- monotonicity, centered form, and bisection (one iteration) -- to estimate the range of the function from Problem 2 when x1 is in the interval [0,6] and x2 is in the interval [−6,6].
13. (Due October 30) Write and test a program that implements the full interval algorithm. This program should compute an enclosure for the range of any given function on any given box by:
public static Interval partial(Interval[] inputs, int i){}
that, given a box (described as an array of intervals) and
an index i, estimates the range of the partial derivative of f over
x i. Test your method on the example of a function and
intervals that we had in Problems 1 and 2.14. (Due November 13) Use the interval-based optimization algorithm to locate the maximum of the function f(x) = 2x + 4x2 on the interval [−0.4, 0]. Divide this interval into two, then divide the remaining intervals into two again, etc. At each iteration, dismiss subintervals where maximum cannot be attained. Stop when you get intervals of width 0.1.
15. (Due November 15) Use the constraints method to solve the following two problems:
16. (Due November 20) Write a method for simulating the propagation of random errors. We assume that:
In your program, first, you apply f to the measurement results, getting Y = f(X1, ..., Xn). Then, you select the number of iterations N (e.g., N = 50).
After that, for k = 1, ..., N, you do the following:
Test this program on some example. The resulting value should be close to the square root of the sum (c1 * d1)2 + ... + (cn * dn)2, where, as before, ci is the partial derivative of f with respect to xi.
17. (Due November 20) Write down:
18. (Due November 20) If we only use numbers with 2 digit after the decimal point, and we use rounding that preserves guaranteed bounds, what will be the result of multiplying the intervals [0.20, 0.69] and [0.39, 0.61]?
19. (Due November 22) If out of 10 experts, 9 think that the statement is true, what degree of confidence shall we assign to this statement?
20. (Due November 22) If an expert marked her confidence in a statement as 6 on a scale from 0 to 8, what degree of confidence shall we assign to this statement?
21. (Due November 22) If we have μ(1)=0.2 and μ(2)=0.8, what value shall we assign to μ(1.7)? Use linear interpolation.
22. (Due November 22) If the expert's degrees of confidence in two statements A and B are 0.7 and 0.9, and we use min as an "and"-operation and max as an "or"-operation, what degree of confidence shall we assign to A & B? To A \/ B? If a statement C has degree of confidence 0.8, what is our degree of belief in (A & B) \/ C?
23. (Due November 29) For a membership function μ(x) = 1 − |x|, what are the α-cuts corresponding to α = 0.6? to α = 0.4?
24. (Due November 29) Let us assume that the quantity x is described by the membership function μ(x) = max(1 − |1 − x|, 0) and the quantity y is described by the membership function μ(y) = max(1 − |− 1 − y|, 0). Use the values α = 0.25, 0.5, 0.75, and 1.0 to describe membership functions for z = x − y and t = x * y.
25. (Due November 29) Suppose that we have three alternatives, for which the gains are in the intervals [0, 100], [30, 60], and [80, 90].