Coloquim “Point source discovery in complicated domains” @ Coimbra


Description: We consider the inverse problem of discovering the location of point sources from very sparse point measurements in a bounded domain that contains impenetrable obstacles. The sources spread according to a class of linear equations, including the Laplace, heat, and Helmholtz equations, and limited information of the obstacles may only be estimated using the visibility from measurement location.

For these settings, we present a greedy algorithm for source discovery. The algorithm adaptively adds new measurement locations in order to improve estimates of the sources.

Start Date: 2010-11-24
Start Time: 15:00
Speaker: Richard Tsai (Univ. Texas at Austin, USA)
Institution: University of Texas at Austin
Place: Room 2.4
See more: <Main>

Leave a Reply

Please log in using one of these methods to post your comment: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s