• Keine Ergebnisse gefunden

(1)Solution of Problem 1

N/A
N/A
Protected

Academic year: 2022

Aktie "(1)Solution of Problem 1"

Copied!
7
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Solution of Problem 1. (a) By definition,(+) is exact if Dyf(x, y) =Dxg(x, y), where

f(x, y) :=y 1

√xy + 1

= ry

x+y, g(x, y) :=−x 1

√xy −1

=− rx

y +x, Since

Dyf(x, y) = 1 2

√1xy + 16=−1 2

√1xy+ 1 =Dxg(x, y),

it follows that (+) is not exact.

(b) We rewrite the given equation as

µ(x, y)ry x+y

dx+µ(x, y)

− rx

y +x

dy= 0. (1)

and let

F(x, y) :=µ(x, y)f(x, y) =µ(x, y)ry x+y

, G(x, y) :=µ(x, y)g(x, y) =µ(x, y)

− rx

y +x . By definition, (1)is exact if

DyF(x, y) =DxG(x, y), i.e., if

Dyµ(x, y)

f(x, y) +µ(x, y)Dyf(x, y) = Dxµ(x, y)

g(x, y) +µ(x, y)Dxg(x, y) Dyµ(x, y)ry

x +y

+µ(x, y)1 2

√1xy + 1

=Dxµ(x, y)

− rx

y +x

+µ(x, y)

−1 2

√1xy + 1

− rx

y +x

Dxµ(x, y)−ry x+y

Dyµ(x, y)− 1

√xyµ(x, y) = 0 (c) Forµ(x, y) =m(xy)we compute

Dxµ(x, y) =m0(xy)y, Dyµ(x, y) =m0(xy)x.

By (b) we know that (1) is exact if −

rx y +x

Dxµ(x, y)−ry x+y

Dyµ(x, y)− 1

√xyµ(x, y) = 0, i.e., if

−2√xym0(xy)− 1

√xym(xy) = 0, m0(xy) + 1

2xym(xy) = 0.

(2)

Letting z:=xy we get

m0(z) + 1

2zm(z) = 0, Zz m0(t)

m(t)dt=−1 2

Zz 1 tdt

⇒m(z) =z12.

Going back to the original variablesx, y we conclude that m(xy) = 1

√xy is an integrating factor for (+).

(d) By construction, equation

F(x, y)dx+G(x, y)dy= 0 with

F(x, y) =m(xy)f(x, y) = 1 x +

ry x, G(x, y) =m(xy)g(x, y) =−1

y + rx

y, is exact. Thus, its general solution is given by

H(x, y) =C=constant, whereH satisfies

Hx(x, y) =F(x, y), Hy(x, y) =G(x, y).

We compute

H(x, y) = Z

F(x, y)dx= lnx+ 2√xy+c(y).

Then, from

Hy(x, y) =G(x, y), we get

c0(y) =−1

y and thus c(y) =−lny.

Therefore, the general solution of(+) is

lnx

y + 2√xy=C.

Solution of Problem 2. (a) We compute the first and the second derivatives of u(x):

u0(x) =αeαx, u00(x) =α2eαx.

2

(3)

Plugging them into the given equation, we get

(x+ 1)α2eαx+xαeαx−eαx= 0 eαx α(α+ 1)x

| {z }

=0forα=

0

−1

+ (α+ 1)(α−1)

| {z }

=0forα=

1

−1

| {z }

=0forα=1

= 0

Thus, u(x) =ex is a solution of the given equation.

(b) Sincex >−1, we can devide both of the sides of the given equation by(x+ 1). We get y00+ x

x+ 1y0− 1

x+ 1y=x+ 1 (2)

We use the suggested ansatzy(x) =v(x)u(x). First we compute the first and the second derivatives ofy:

y0(x) =v0(x)u(x) +v(x)u0(x),

y00(x) =v00(x)u(x) + 2v0(x)u0(x) +v(x)u00(x).

Plugging them into (2), we get

v00u+v0 2u0+ x x+ 1u

+v u00+ x

x+ 1u0− 1 x+ 1u

| {z }

=0 since u solves the homog. eq.

=x+ 1. (3)

Now we letw(x) :=v0(x). Furthermore, we useu(x) =e−x andu0(x) =−e−x. Thus, (3)is equivalent to

w0+

−2 + x x+ 1

w=ex(x+ 1). (4)

We solve the homogeneous counterpart of (4)

w0+

−2 + x x+ 1

w= 0 w0= x+ 2

x+ 1w Zx w0(t)

w(t)dt=

Zx t+ 2 t+ 1dt

⇒wh(x) =ex(x+ 1)

Now, in order to solve the inhomogeneous equation(4), we use the variation of constants method. We have to findc(x)s.t.

c0(x)wh(x) =ex(x+ 1), i.e.,

c0(x)ex(x+ 1) =ex(x+ 1) c0(x) = 1

⇒c(x) =x

(4)

Thus, a particular solution of the inhomogeneous equation is wp(x) =c(x)wh(x) =xex(x+ 1) and its general solution is

w(x) =Awh(x) +wp(x)

=Awh(x) +c(x)wh(x)

=ex(x2+Ax+x+A) (A=constant) Going back tov, we get

v(x) = Zx

w(t)dt

= Zx

(t2+At+t+A)etdt

=ex x2+Ax−x+ 1) +B (B=constant) Hence,

y(x) =v(x)u(x)

=x2+Ax−x+ 1 +Bex We find the constantsAandB from the initial conditions

1 =y(0) = 1 +B⇒B= 0 1 =y0(0) =A−1−B⇒A= 2 Thus, the solution of the initial value problem is

y(x) =x2+x+ 1.

4

(5)
(6)
(7)

Referenzen

ÄHNLICHE DOKUMENTE

Operating Systems (WS2021) Faculty of Computer Science and Engineering Frankfurt University of Applied Sciences.. Solution of Exercise

has been built away from

We check the rank of the matrix in order to observe if its column vectors are linearly independent (we use the fact that the rank w.r.t?. the column vectors contained in B 2 will be

In the total of these properties, h·, ·i S is a valid inner product for S symmetric and positive definite. Solution of

Mathematical Foundations of Computer Vision Example Solutions – Assignment 4.. Solution of

• The particular solution x 0 is a point which is a member of the set of all possible solutions of the underlying system.. • The set of solutions x is given by translating the kernel

Mathematical Foundations of Computer Vision Example Solutions – Assignment 6.. Solution of

We now head for an adequate formulation enabling the numerical solution of the problem by standard numerical software. Stacking the unknowns