Fast Iterative Solution of Elliptic Control Problems in Wavelet Discretization
نویسندگان
چکیده
We investigate wavelet methods for the efficient numerical solution of a class of control problems constrained by a linear elliptic boundary value problem where the cost functional may contain fractional Sobolev norms of the control and the state. Starting point is the formulation of the infinite-dimensional control problem in terms of (boundary-adapted biorthogonal spline-)wavelets, involving only `2 norms of wavelet expansion coefficients (where different norms are realized by a diagonal scaling together with a Riesz map) and constraints in form of an `2 isomorphism. The coupled system of equations resulting from optimization is solved by an inexact conjugate gradient (CG) method for the control, which involves the approximate inversion of the primal and the adjoint operator using again CG iterations. Starting from a coarse discretization level, we use nested iteration to solve the coupled system on successively finer uniform discretizations up to discretization error accuracy on each level. The resulting inexact CG scheme is a ‘fast solver’: it is of asymptotic optimal complexity in the sense that the overall computational effort to compute the solution up to discretization error on the finest grid is proportional to the number of unknowns on that grid, a consequence of grid–independent condition numbers of the linear operators in wavelet coordinates. In the numerical examples we study the choice of different norms and the regularization parameter in the cost functional and their effect on the solution. Moreover, for different situations the performance of the fully iterative inexact CG scheme is investigated, confirming the theoretical results.
منابع مشابه
Semi-algebraic Multi-level Methods Based on Wavelet Decompositions I: Application to Two-point Boundary Value Problems
To clarify more precisely the vague but often indicated connection between wavelet and multi-grid theory is the main goal of the article. Therefore we present a multi-level method based on a wavelet approximation of the succesive error of a classical iterative solver. The resulting iteration is a hybrid between a purely algebraic multi-level technique and the usual multi-grid technique related ...
متن کاملWavelet Methods for Second-Order Elliptic Problems, Preconditioning, and Adaptivity
Wavelet methods allow to combine high order accuracy, eecient preconditioning techniques and adaptive approximation, in order to solve eeciently elliptic operator equations. Many diiculties remain, in particular related to the adaptation of wavelet decompositions to bounded domains with prescribed boundary conditions, as well as the possibly high constants in the O(1) preconditioning. In this p...
متن کاملIntroduction to Multigrid Methods for Elliptic Boundary Value Problems
We treat multigrid methods for the efficient iterative solution of discretized elliptic boundary value problems. Two model problems are the Poisson equation and the Stokes problem. For the discretization we use standard finite element spaces. After discretization one obtains a large sparse linear system of equations. We explain multigrid methods for the solution of these linear systems. The bas...
متن کاملSome iterative methods for the solution of a symmetric indefinite KKT system
This paper is concerned with the numerical solution of a Karush–Kuhn– Tucker system. Such symmetric indefinite system arises when we solve a nonlinear programming problem by an Interior–Point (IP) approach. In this framework, we discuss the effectiveness of two inner iterative solvers: the method of multipliers and the preconditioned conjugate gradient method. We discuss the implementation deta...
متن کاملAdaptive wavelet methods for elliptic operator equations: Convergence rates
This paper is concerned with the construction and analysis of wavelet-based adaptive algorithms for the numerical solution of elliptic equations. These algorithms approximate the solution u of the equation by a linear combination of N wavelets. Therefore, a benchmark for their performance is provided by the rate of best approximation to u by an arbitrary linear combination of N wavelets (so cal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005