Skip to main content

Domain Decomposition Methods for PDE Constrained Optimization Problems

  • Conference paper
  • 564 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3402))

Abstract

Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for the parallel numerical solution of such problems involve sequential quadratic programming (SQP), with either reduced or full space approaches. In this paper we propose and investigate a class of parallel full space SQP Lagrange-Newton-Krylov-Schwarz (LNKSz) algorithms. In LNKSz, a Lagrangian functional is formed and differentiated to obtain a Karush-Kuhn-Tucker (KKT) system of nonlinear equations. Inexact Newton method with line search is then applied. At each Newton iteration the linearized KKT system is solved with a Schwarz preconditioned Krylov subspace method. We apply LNKSz to the parallel numerical solution of some boundary control problems of two-dimensional incompressible Navier-Stokes equations. Numerical results are reported for different combinations of Reynolds number, mesh size and number of parallel processors.

The work of Prudencio and Cai was partially supported by the Department of Energy, DE-FC02-01ER25479, and by the National Science Foundation, CCR-0219190, ACI-0072089 and ACI-0305666. The work of Byrd was supported in part by the National Science Foundation, CCR-0219190, and by Army Research Office contract DAAD19-02-1-0407.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balay, S., Buschelman, K., Gropp, W.D., Kaushik, D., Knepley, M., McInnes, L.C., Smith, B.F., Zhang, H.: Portable, Extensible Toolkit for Scientific computation (PETSc) home page (2003), http://www.mcs.anl.gov/petsc

  2. Biros, G., Ghattas, O.: Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization, part I: The Krylov-Schur solver. SIAM J. Sci. Comput. (to appear)

    Google Scholar 

  3. Biros, G., Ghattas, O.: Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization, part II: The Lagrange-Newton solver and its application to optimal control of steady viscous flows. SIAM J. Sci. Comput. (to appear)

    Google Scholar 

  4. Cai, X.-C., Dryja, M., Sarkis, M.: Restricted additive Schwarz preconditioners with harmonic overlap for symmetric positive definite linear systems. SIAM J. Numer. Anal. 41, 1209–1231 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cai, X.-C., Gropp, W.D., Keyes, D.E., Melvin, R.G., Young, D.P.: Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation. SIAM J. Sci. Comput. 19, 246–265 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cai, X.-C., Keyes, D.E.: Nonlinearly preconditioned inexact Newton algorithms. SIAM J. Sci. Comput. 24, 183–200 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cai, X.-C., Keyes, D.E., Marcinkowski, L.: Nonlinear additive Schwarz preconditioners and applications in computational fluid dynamics. Int. J. Numer. Meth. Fluids 40, 1463–1470 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cai, X.-C., Sarkis, M.: A restricted additive schwarz preconditioner for general sparse linear systems. SIAM J. Sci. Comput. 21, 792–797 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Coleman, T.F., Moré, J.J.: Estimation of sparse Jacobian matrices and graph coloring problem. SIAM J. Numer. Anal. 20, 243–209 (1983)

    Google Scholar 

  10. Dennis Jr., J.E., Schnabel, R.B.: Numerical Methods for Unsconstrained Optimization and Nonlinear Equations, 2nd edn. SIAM, Philadelphia (1996)

    Google Scholar 

  11. Dryja, M., Widlund, O.: Domain decomposition algorithms with small overlap. SIAM J. Sci. Comp. 15, 604–620 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Eisenstat, S.C., Walker, H.F.: Globally convergent inexact Newton method. SIAM J. Optim. 4, 393–422 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Eisenstat, S.C., Walker, H.F.: Choosing the forcing terms in an inexact Newton method. SIAM J. Sci. Comput. 17, 16–32 (1996)

    Google Scholar 

  14. Gunzburger, M.D., Hou, L.S.: Finite-dimensional approximation of a class of constrained nonlinear optimal control problems. SIAM J. on Control and Optimization 34, 1001–1043 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gunzburger, M.D., Hou, L.S., Svobodny, T.P.: Optimal control and optimization systems arising in optimal control of viscous incompressible flows. In: Gunzburger, M.D., Nicolaides, R.A. (eds.) Incompressible Computational Fluid Dynamics: Trends and Advances, pp. 109–150. Cambridge University Press, Cambridge (1993)

    Chapter  Google Scholar 

  16. Hou, L.S., Ravindran, S.S.: A penalized Neumann control approach for solving an optimal Dirichlet control problem for the Navier-Stokes equations. SIAM J. Sci. Comput. 20, 1795–1814 (1998)

    Google Scholar 

  17. Hou, L.S., Ravindran, S.S.: Numerical approximation of optimal flow control problems by a penalty method: Error estimates and numerical results. SIAM J. Sci. Comput. 20, 1753–1777 (1999)

    Google Scholar 

  18. Ioffe, A., Tihomirov, V.: Theory of Extremal Problems. North-Holland Publishing Company, Amsterdam (1979);Translation from russian edition ©NAUKA, Moscow (1974)

    Google Scholar 

  19. Nocedal, J., Wright, S.J.: Numerical Optimization, 1st edn. Springer, New York (2000)

    Google Scholar 

  20. Prudencio, E., Byrd, R., Cai, X.-C.: Parallel full space SQP Lagrange-Newton-Krylov-Schwarz algorithms for PDE-constrained optimization problems (2004) (submitted)

    Google Scholar 

  21. Quartapelle, L.: Numerical Solution of the Incompressible Navier-Stokes Equations. International Series of Numerical Mathematics, vol. 113. Birkhäuser, Basel (1996)

    Google Scholar 

  22. Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)

    Book  MATH  Google Scholar 

  23. Smith, B., Bjørstad, P., Gropp, W.: Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, Cambridge (1996)

    MATH  Google Scholar 

  24. Tihomirov, V.M.: Fundamental Principles of the Theory of Extremal Problems. John-Wiley & Sons, West Sussex (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prudencio, E., Byrd, R., Cai, XC. (2005). Domain Decomposition Methods for PDE Constrained Optimization Problems . In: Daydé, M., Dongarra, J., Hernández, V., Palma, J.M.L.M. (eds) High Performance Computing for Computational Science - VECPAR 2004. VECPAR 2004. Lecture Notes in Computer Science, vol 3402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11403937_43

Download citation

  • DOI: https://doi.org/10.1007/11403937_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25424-9

  • Online ISBN: 978-3-540-31854-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics