Optimization Based Domain Decomposition Methods for Linear and Nonlinear Problems
| dc.contributor.author | Lee, Hyesuk Kwon | en |
| dc.contributor.committeechair | Gunzburger, Max D. | en |
| dc.contributor.committeemember | Cliff, Eugene M. | en |
| dc.contributor.committeemember | Heinkenschloss, Matthias | en |
| dc.contributor.committeemember | Herdman, Terry L. | en |
| dc.contributor.department | Mathematics | en |
| dc.date.accessioned | 2014-03-14T20:22:30Z | en |
| dc.date.adate | 1997-08-05 | en |
| dc.date.available | 2014-03-14T20:22:30Z | en |
| dc.date.issued | 1997-06-27 | en |
| dc.date.rdate | 1997-08-05 | en |
| dc.date.sdate | 1997-06-27 | en |
| dc.description.abstract | Optimization based domain decomposition methods for the solution of partial differential equations are considered. The crux of the method is a constrained minimization problem for which the objective functional measures the jump in the dependent variables across the common boundaries between subdomains; the constraints are the partial differential equations. First, we consider a linear constraint. The existence of optimal solutions for the optimization problem is shown as is its convergence to the exact solution of the given problem. We then derive an optimality system of partial differential equations from which solutions of the domain decomposition problem may be determined. Finite element approximations to solutions of the optimality system are defined and analyzed as is an eminently parallelizable gradient method for solving the optimality system. The linear constraint minimization problem is also recast as a linear least squares problem and is solved by a conjugate gradient method. The domain decomposition method can be extended to nonlinear problems such as the Navier-Stokes equations. This results from the fact that the objective functional for the minimization problem involves the jump in dependent variables across the interfaces between subdomains. Thus, the method does not require that the partial differential equations themselves be derivable through an extremal problem. An optimality system is derived by applying a Lagrange multiplier rule to a constrained optimization problem. Error estimates for finite element approximations are presented as is a gradient method to solve the optimality system. We also use a Gauss-Newton method to solve the minimization problem with the nonlinear constraint. | en |
| dc.description.degree | Ph. D. | en |
| dc.identifier.other | etd-7497-163154 | en |
| dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-7497-163154/ | en |
| dc.identifier.uri | http://hdl.handle.net/10919/30696 | en |
| dc.publisher | Virginia Tech | en |
| dc.relation.haspart | kwon.pdf | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | domain decomposition | en |
| dc.subject | least squares problem | en |
| dc.subject | finite element methods | en |
| dc.title | Optimization Based Domain Decomposition Methods for Linear and Nonlinear Problems | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Mathematics | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1