• Keine Ergebnisse gefunden

Übungen zu Theorie und Numerik partieller Differentialgleichungen

N/A
N/A
Protected

Academic year: 2021

Aktie "Übungen zu Theorie und Numerik partieller Differentialgleichungen"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Universität Konstanz WS 11/12 Fachbereich Mathematik und Statistik

S. Volkwein, M. Gubisch, R. Mancini, S. Trenz

Übungen zu Theorie und Numerik partieller Differentialgleichungen

http://www.math.uni-konstanz.de/numerik/personen/volkwein/teaching/

Sheet 6 Deadline: 03.02.2012, 10:10 o’clock before the Lecture Exercise 16 (Mass and stiffness matrices) (4 Points)

1. Let y the solution to a 1D elliptic or parabolic problem on Ω = (0, 1) with Dirichlet boundary conditions y(0) = 0 and y(1) = 1. Compute the mass matrix Φ and the stiffness matrix Ψ for the polynomial basis functions φ

i

(x) = x

i

, i = 1, ..., n.

What disadvantage do you see compared to the ansatz with piecewise linear finite elements?

2. Compute the condition numbers of the matrices Ψ and

1k

Φ + Ψ for the polynomial and the piecewise linear ansatz with n = 15 and k = 0.01. Notice that the slope of the hat functions is h =

1n

here since a half-hat is needed for the right boundary.

What do you observe?

3. What tells us the condition number of a matrix?

Hint: The condition number of a symmetric and positive definite matrix S is given by the quotient of the maximal and the minimal eigenvalue. You may use the Matlab commands eig or eigs, respectively, to compute the eigenvalues of the matrices.

Exercise 17 (The pdetool of Matlab ) (4 Points) Consider the elliptic problem

−∆u(x, y) = 0 (x, y) ∈ (0, 2) × (−1, 1), u(x, y) = x(2 − x) (x, y) ∈ (0, 2) × {−1, 1}

u(x, y) = (y + 1)(y − 1) (x, y) ∈ {0, 2} × (−1, 1).

(1)

Solve (1) by using the graphical user interface pdetool of the Partial Differential Equation Toolbox in Matlab .

Follow the steps Draw, Boundary, PDE, Mesh and Solve. Finally plot the solution.

Hint: A short and good summary on the use of the pdetool can be found in the web by Prof. Heinrich Voss with the name Eine sehr kurze Einführung in die Partial Differential Equation Toolbox von Matlab . The hyperlink is

www.tu-harburg.de/rzt/tuinfo/software/numsoft/matlab/pde/pdetool.ps

(2)

Try to find the correct parameters to generate the symmetric grid

0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2

−1

−0.8

−0.6

−0.4

−0.2 0 0.2 0.4 0.6 0.8 1

and plot the solution in this case, too.

Remark: Your submission for this exercise shall just include the 3D-plots.

Exercise 18 (A nonlinear problem) (4 Points)

Consider the nonlinear elliptic equation

−∆u = f (u) on Ω

u = 0 on ∂Ω (2)

on a (bounded) square Ω ⊆ R

2

and f ∈ C

1

( R , R ) such that f

0

is bounded.

Let x = (x

0

, ..., x

n+1

) and y = (y

0

, ..., y

n+1

) be an equidistant discretization of Ω ¯ and A the five-point-stencil discretization matrix for −∆. Then (2) reads as

AU = F (U ) on {(x

i

, y

j

) | i = 1, ..., n, j = 1, ..., m} (3) where U = (U

ij

) ∈ R

n2

, U

ij

≈ u(x

i

, y

j

), and F (U ) = (f (U

ij

)) ∈ R

n2

.

1. Assume that (3) admits a unique solution U ∈ R

n

2

. Define the formal iteration sequence (U

k

)

k∈N

of the Newton method for some starting guess U

1

∈ R

n

2

. Present the matrices arising in this formulation explicitely.

2. Show that there is an ε > 0 such that the iteration sequence is well-defined for all stepsizes h < ε and all initializations U

1

.

3. What convergence rate do you get for (U

k

)

k∈N

if U

1

is chosen sufficiently close to

U ?

Referenzen

ÄHNLICHE DOKUMENTE

In this section we briey review an approach to the computation of the minimum eigenvalue of a real symmetric,positive denite Toeplitz matrix which was presented in 12] and which is

But, a block diagonal matrix is positive definite iff each diagonal block is positive definite, which concludes the proof.. (2) This is because for any symmetric matrix, T , and

Using piecewise linear and globally continuous nodal basis functions on a uniform mesh of size h = 1/N , N ≥ 2, write down the finite element approximation to this problem if p and

Solve (1) by using the Partial Differential Equation Toolbox in Matlab using the graphical user interface pdetool.. Follow the steps Draw, Boundary, PDE, Mesh

For the discretization of the Laplace operator use the classical finite difference scheme (i.e. Use the lexicographical ordering of the grid points in Ω. As a stopping criteria for

Hint: For the implementation the commands initmesh, refinemesh, assempde, assema, pdesurf together with the provided geometry and boundary files circle11_geom.m and circle11_bdry.m

In this communication we review our recent work 1 )' 2 ) on the magnetic response of ballistic microstructures. For a free electron gas the low-field susceptibility is

We study the number of minimal codewords in binary linear codes that arise by appending a unit matrix to the adjacency matrix of a graph..