Convergence analysis of multigrid methods with collective point smoothers for optimal control problems (Q434223): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The analysis presented in this paper is discussed for the following elliptic distributed control model problem of tracking type: Minimize the cost functional \(J\) given by \[ J(y,u)=(1/2)\|y-y_d\|^2_{L_2(\Omega)} + (\alpha/2)\|u\|^2_{L_2(\Omega)}, \] subject to the elliptic boundary value problem \[ -\Delta y + y = u \text{ in } \Omega \text{ and } (\partial y / \partial n)=0 \text{ on }\partial \Omega, \] where \(y \in H^1(\Omega)\) is the state variable and \(u \in L^2(\Omega)\) is the control variable. The function \(y_d \in L^2(\Omega)\) is given and \(\alpha >0\) is some regularization or cost parameter. Here \(\Omega\) is a bounded domain in \(\mathbb{R}^d\) for \(d \in \{1,2,3\}\) with Lipschitz boundary \(\partial \Omega\). The authors construct and analyze numerical methods that produce an approximate solution to the optimization problem, where the computational time can be bounded by the number of unknowns times a constant which is independent of the parameter \(\alpha\), in particular for small values of \(\alpha\). The solution of the optimization problem is characterized by the Karush-Kuhn-Tucker (KKT) system. The authors derive the KKT system for the model problem. The discretization is done by standard techniques. For the model problem the authors use a family of meshes which is obtained based on some coarsed triangular mesh (grid level \(K=0\)) and uniform refinement. The space of discretized functions \(X_K = Y_K \times P_K\) is constructed by the Courant element: \(Y_K = P_K\) is the set of continuous and piecewise linear functions. A convergence proof for multigrid methods with special collective point smoothers for general grids, based on the classical splitting of the analysis into smoothing and approximation property, is presented. Finally, numerical results which confirm the theoretical results and illustrate the efficiency of the method (even in cases which are not governed by the convergence theory) are proposed.
Property / review text: The analysis presented in this paper is discussed for the following elliptic distributed control model problem of tracking type: Minimize the cost functional \(J\) given by \[ J(y,u)=(1/2)\|y-y_d\|^2_{L_2(\Omega)} + (\alpha/2)\|u\|^2_{L_2(\Omega)}, \] subject to the elliptic boundary value problem \[ -\Delta y + y = u \text{ in } \Omega \text{ and } (\partial y / \partial n)=0 \text{ on }\partial \Omega, \] where \(y \in H^1(\Omega)\) is the state variable and \(u \in L^2(\Omega)\) is the control variable. The function \(y_d \in L^2(\Omega)\) is given and \(\alpha >0\) is some regularization or cost parameter. Here \(\Omega\) is a bounded domain in \(\mathbb{R}^d\) for \(d \in \{1,2,3\}\) with Lipschitz boundary \(\partial \Omega\). The authors construct and analyze numerical methods that produce an approximate solution to the optimization problem, where the computational time can be bounded by the number of unknowns times a constant which is independent of the parameter \(\alpha\), in particular for small values of \(\alpha\). The solution of the optimization problem is characterized by the Karush-Kuhn-Tucker (KKT) system. The authors derive the KKT system for the model problem. The discretization is done by standard techniques. For the model problem the authors use a family of meshes which is obtained based on some coarsed triangular mesh (grid level \(K=0\)) and uniform refinement. The space of discretized functions \(X_K = Y_K \times P_K\) is constructed by the Courant element: \(Y_K = P_K\) is the set of continuous and piecewise linear functions. A convergence proof for multigrid methods with special collective point smoothers for general grids, based on the classical splitting of the analysis into smoothing and approximation property, is presented. Finally, numerical results which confirm the theoretical results and illustrate the efficiency of the method (even in cases which are not governed by the convergence theory) are proposed. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jan Lovíšek / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49J20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49M27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6053949 / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal control
Property / zbMATH Keywords: optimal control / rank
 
Normal rank
Property / zbMATH Keywords
 
cost functional
Property / zbMATH Keywords: cost functional / rank
 
Normal rank
Property / zbMATH Keywords
 
elliptic boundary value problem
Property / zbMATH Keywords: elliptic boundary value problem / rank
 
Normal rank
Property / zbMATH Keywords
 
control variable
Property / zbMATH Keywords: control variable / rank
 
Normal rank
Property / zbMATH Keywords
 
Karush-Kuhn-Tucker system
Property / zbMATH Keywords: Karush-Kuhn-Tucker system / rank
 
Normal rank
Property / zbMATH Keywords
 
Lagrange functional
Property / zbMATH Keywords: Lagrange functional / rank
 
Normal rank
Property / zbMATH Keywords
 
multigrid method
Property / zbMATH Keywords: multigrid method / rank
 
Normal rank
Property / zbMATH Keywords
 
collective iteration schemes
Property / zbMATH Keywords: collective iteration schemes / rank
 
Normal rank
Property / zbMATH Keywords
 
local problems
Property / zbMATH Keywords: local problems / rank
 
Normal rank
Property / zbMATH Keywords
 
Uzawa-type smoothers
Property / zbMATH Keywords: Uzawa-type smoothers / rank
 
Normal rank
Property / zbMATH Keywords
 
saddle point problem
Property / zbMATH Keywords: saddle point problem / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence rates
Property / zbMATH Keywords: convergence rates / rank
 
Normal rank
Property / zbMATH Keywords
 
regularization parameter
Property / zbMATH Keywords: regularization parameter / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical results
Property / zbMATH Keywords: numerical results / rank
 
Normal rank

Revision as of 23:35, 29 June 2023

scientific article
Language Label Description Also known as
English
Convergence analysis of multigrid methods with collective point smoothers for optimal control problems
scientific article

    Statements

    Convergence analysis of multigrid methods with collective point smoothers for optimal control problems (English)
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    The analysis presented in this paper is discussed for the following elliptic distributed control model problem of tracking type: Minimize the cost functional \(J\) given by \[ J(y,u)=(1/2)\|y-y_d\|^2_{L_2(\Omega)} + (\alpha/2)\|u\|^2_{L_2(\Omega)}, \] subject to the elliptic boundary value problem \[ -\Delta y + y = u \text{ in } \Omega \text{ and } (\partial y / \partial n)=0 \text{ on }\partial \Omega, \] where \(y \in H^1(\Omega)\) is the state variable and \(u \in L^2(\Omega)\) is the control variable. The function \(y_d \in L^2(\Omega)\) is given and \(\alpha >0\) is some regularization or cost parameter. Here \(\Omega\) is a bounded domain in \(\mathbb{R}^d\) for \(d \in \{1,2,3\}\) with Lipschitz boundary \(\partial \Omega\). The authors construct and analyze numerical methods that produce an approximate solution to the optimization problem, where the computational time can be bounded by the number of unknowns times a constant which is independent of the parameter \(\alpha\), in particular for small values of \(\alpha\). The solution of the optimization problem is characterized by the Karush-Kuhn-Tucker (KKT) system. The authors derive the KKT system for the model problem. The discretization is done by standard techniques. For the model problem the authors use a family of meshes which is obtained based on some coarsed triangular mesh (grid level \(K=0\)) and uniform refinement. The space of discretized functions \(X_K = Y_K \times P_K\) is constructed by the Courant element: \(Y_K = P_K\) is the set of continuous and piecewise linear functions. A convergence proof for multigrid methods with special collective point smoothers for general grids, based on the classical splitting of the analysis into smoothing and approximation property, is presented. Finally, numerical results which confirm the theoretical results and illustrate the efficiency of the method (even in cases which are not governed by the convergence theory) are proposed.
    0 references
    0 references
    optimal control
    0 references
    cost functional
    0 references
    elliptic boundary value problem
    0 references
    control variable
    0 references
    Karush-Kuhn-Tucker system
    0 references
    Lagrange functional
    0 references
    multigrid method
    0 references
    collective iteration schemes
    0 references
    local problems
    0 references
    Uzawa-type smoothers
    0 references
    saddle point problem
    0 references
    convergence rates
    0 references
    regularization parameter
    0 references
    numerical results
    0 references

    Identifiers