Access the full text.
Sign up today, get DeepDyve free for 14 days.
Abstract. We review some classical and recent results on overdetermined problems both in bounded and unbounded domains, and we discuss how to recover, in some circumstances, a globally overdetermined problem from a partially overdetermined one.
Groups - Complexity - Cryptology – de Gruyter
Published: Dec 1, 2011
Keywords: Rigidity and symmetry results; classification of domains and solutions; overdetermined and inverse problems
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.