• Keine Ergebnisse gefunden

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

N/A
N/A
Protected

Academic year: 2022

Aktie "Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6"

Copied!
22
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

(1.1.1) (1.1.1)

(1.2.1) (1.2.1)

Problem 1: Lists and Sets in Maple

a)

b) Alternative 1

b) Alternative 2

(2)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

(1.4.1) (1.4.1) (1.3.1) (1.3.1)

b) Alternative 3

Problem 2: Decimal Expansion of Rational Numbers

(3)
(4)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

(3.1.3) (3.1.3) (2.1) (2.1)

(3.1.1) (3.1.1)

(3.1.2) (3.1.2)

"1.0"

"-0.75"

"0.p3"

"0.1p6"

"-0.00p142857"

Problem 3: Design of a Beer Glass

a)

b)

(5)

(3.3.1) (3.3.1) x

0 5 10 15 20

0 1 2 3 4 5

c)

(6)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

(3.5.1) (3.5.1)

(3.5.2) (3.5.2) (3.4.1) (3.4.1) The Volume of Revolution Around the Horizontal Axis of

f(x) = -59/6531840*x^5+463/1632960*x^4-403/136080*x^3+103/2835*

x^2-305/1008*x+11/4 on the Interval [0, 20]

d)

18.54183961

*)

(7)

(3.6.1) (3.6.1) The Volume of Revolution Around the Horizontal Axis of

f(x) = -59/6531840*x^5+463/1632960*x^4-403/136080*x^3+103/2835*

x^2-305/1008*x+11/4 on the Interval [0, 20]

e)

For every L, p(L)$p(L)$p$(20-L) is an upper bound for the volume of the cylinder on the interval [L,20]. Furthermore 19/10$19/10$p$20 is an upper bound for L <= 6, because otherwise, the cylinder would not fit in the glass. Let's have a look at this:

(8)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

(3.6.4) (3.6.4) (3.6.2) (3.6.2)

(3.6.5) (3.6.5) (3.6.3) (3.6.3) x

0 5 10 15 20

0 100 200 300 400

than that of a cylinder that has height 20. Of course, we have to check whether this is possible.

First of all, let's find this L:

Obviously, this can only be the second value:

14.55478011

Let's compare p(L) with p(20) to see whether we can put the glass over that cylinder:

3.735593423 4

f)

(9)

(3.8.1) (3.8.1)

(3.8.2) (3.8.2)

(4.1) (4.1) (3.7.1) (3.7.1)

The Volume of Revolution Around the Horizontal Axis of

f(x) = -59/6531840*x^5+463/1632960*x^4-403/136080*x^3+103/2835*

x^2-305/1008*x+11/4 on the Interval [0, 20]

g)

238.7176327

226.8229896

Problem 4: An Application: Image Processing

(10)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

(4.1.1) (4.1.1)

(4.2.1) (4.2.1)

(4.3.1) (4.3.1) (4.1) (4.1) (3.7.1) (3.7.1)

b)

c)

d)

e)

(11)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

(4.6.2) (4.6.2) (4.4.1) (4.4.1)

(4.5.1) (4.5.1)

(4.6.1) (4.6.1) (4.1) (4.1)

f)

g)

(12)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6

(4.7.1.1) (4.7.1.1) (4.6.4) (4.6.4) (4.4.1) (4.4.1)

(4.7.2.1) (4.7.2.1) (4.1) (4.1) (3.7.1) (3.7.1)

(4.6.3) (4.6.3)

h)

Maple 14

Maple 11 (should work with any recent version)

Problem 5: Koch Curve

(13)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1)

b)

(14)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1) (3.7.1) (3.7.1)

(15)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1)

(16)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1) (3.7.1) (3.7.1)

c)

KochFunction

KochFunction takes two parameters, which should be two-dimensional points as list of x- and y-coordinate, e.g.

KochFunction([0.5, 1], [1.5, 1]);

It interpolates these points by adding three additional points inbetween, as seen in pointplot([%], view = [0 .. 2, 0 .. 2]);

Imagine a linear interpolation between neighboring points. The KochFunction distorted the original line by inserting a peak to the left. By repeating that many times on different edges, the snow flake becomes more detailed.

KochPoints

KochPoints generates a segment of the snow flake by repeatedly distorting the initial point list

(17)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1)

You can visualize the segment of the snow flake by the following commands:

points := KochPoints(KochFunction, 3);

pointplot(points, connect = true);

d)

(18)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1) (3.7.1) (3.7.1)

(19)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1)

e)

(20)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1) (3.7.1) (3.7.1)

(21)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1)

(22)

Introduction to Mathematical Software – Winter Term 2010/2011 Solution 3-6 (4.4.1) (4.4.1) (4.1) (4.1) (3.7.1) (3.7.1)

Referenzen

ÄHNLICHE DOKUMENTE

PD Dr. Get familiar with the plots-package.. Use the same Interval as range of your plot. Have a look at help topic plot/options in order to find out how to do that. Also try to

A: The mathematician only needs paper, pencil, and a trash bin for his work – the philosopher can do without the trash bin..... Figure 1: Beer Glass with Calibration Mark put over a

The lecture defined ordinal addition and multiplication by constructing new well-orders from

In this exercise, we implement Euclid’s algorithm for finding the greatest common divisor of two natural numbers that you have come across in your linear algebra class. This will

Modify the greatest common divisor program that you have implemented in Exercise 2.1 such that the actual computation of the gcd is done in a function.. The function should accept

In the last lecture, you saw the implementation of a class for representing larger integers, BiggerInt, with an implemen- tation of the BiggerInt *add class member function.. a)

In the naïve approach we iteratively find the largest power of 2 which is less than or equal to the number we want to convert, place a 1 at the corresponding position of the

The algorithm is very inefficient as the number of recursive calls to Fib(n) grows exponentially in n. It is much more efficient to compute the Fibonacci numbers iteratively, as