Department of Mathematics University of Massachusetts at Dartmouth North Dartmouth, MA02747
In many application fields choosing optimal shapes requires the minimization of a cost functional that depends on many physical parameters. In this talk we will discuss a method of using parallel computers to solve a class of application motivated shape optimization problems. Numerical comparisons will demonstrate that using parallelism drastically reduces the amount of time needed to solve certain problems.