Existence and Uniqueness of Solution for PDE with Boundary Conditions

  • Thread starter Thread starter somethingstra
  • Start date Start date
  • Tags Tags
    Pde
somethingstra
Messages
17
Reaction score
0

Homework Statement


Assume we are in the open first quadrant in the (x,y) plane
Say we have u(x,y) a C1 function in the closed first quadrant that satisfies the PDE:

u_{y}=3u_{x} in the open first quadrant

Boundary Conditions:
u(0,y)=0 for t greater than or equal to 0
u(x,0)= g(x) for x greater than or equal to 0

and g(x) = 0 for 0\preceq x\preceq1
g(x) = (x-1)^5 for x greater than or equal to 1

Is there a solution? And if there is, is the the only solution?


Homework Equations



For first order PDE: solution is f(Ay-Bx) where the PDE is AUx + BUy = 0

The Attempt at a Solution



u(x,y) = f(-x-3y)

so that means

u(0,y) = f(-3y)=0

u(x,0) = f(-x)=g(x)

set -x = w

f(w) = g(-x)

therefore f(-x-3y) = g(x+3y)

and u(x,y) = g(x+3y)

This solution works for u(x,0) but I can't find it to work with u(0,y), if y > 1/3, then the solution would be (x-1)^5 with x greater than or equal to 1, which does not satisfy u(0,y) = 0

so I concluded that there is no solution...this doesn't seem right for me. Any help? I feel that I don't actually have to try to find u in order to determine if a solution exists...
 
Last edited:
Physics news on Phys.org
Hello, maybe in a traditional pde view, it would be more helpful to think of y as t for time?
 
bump, am I being too confusing here?
 
bump...I have kind of a part two question depending on how correct my answer is.
 
Last edited:
Oh, nevermind, I got it =]
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top