Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Dirichlet problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Methods of solution== For bounded domains, the Dirichlet problem can be solved using the [[Perron method]], which relies on the [[maximum principle]] for [[subharmonic function]]s. This approach is described in many text books.<ref>See for example: * {{harvnb|John|1982}} * {{harvnb|Bers|John|Schechter|1979}} * {{harvnb|Greene|Krantz|2006}} </ref> It is not well-suited to describing smoothness of solutions when the boundary is smooth. Another classical [[Hilbert space]] approach through [[Sobolev space]]s does yield such information.<ref>See for example: * {{harvnb|Bers|John|Schechter|1979}} * {{harvnb|Chazarain|Piriou|1982}} * {{harvnb|Taylor|2011}} </ref> The solution of the Dirichlet problem using [[Sobolev spaces for planar domains]] can be used to prove the smooth version of the [[Riemann mapping theorem]]. {{harvtxt|Bell|1992}} has outlined a different approach for establishing the smooth Riemann mapping theorem, based on the [[reproducing kernel]]s of SzegΕ and Bergman, and in turn used it to solve the Dirichlet problem. The classical methods of [[potential theory]] allow the Dirichlet problem to be solved directly in terms of [[integral operator]]s, for which the standard theory of [[compact operator|compact]] and [[Fredholm operator]]s is applicable. The same methods work equally for the [[Neumann problem]].<ref>See: * {{harvnb|Folland|1995}} * {{harvnb|Bers|John|Schechter|1979}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)