Spectral methods on triangles and other domains
Journal of Scientific Computing
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Boundary Concentrated Finite Element Methods
SIAM Journal on Numerical Analysis
Solving unsymmetric sparse systems of linear equations with PARDISO
Future Generation Computer Systems - Special issue: Selected numerical algorithms
A variational discretization concept in control constrained optimization: the linear-quadratic case
Computational Optimization and Applications
Error Estimates for the Numerical Approximation of Boundary Semilinear Elliptic Control Problems
Computational Optimization and Applications
New shape functions for triangular p-FEM using integrated Jacobi polynomials
Numerische Mathematik
SIAM Journal on Control and Optimization
SIAM Journal on Matrix Analysis and Applications
Error estimates for the numerical approximation of Neumann control problems
Computational Optimization and Applications - Special issue: Numerical analysis of optimization in partial differential equations
Computing and Visualization in Science
Primal and Dual Interface Concentrated Iterative Substructuring Methods
SIAM Journal on Numerical Analysis
Computing with Hp-Adaptive Finite Elements, Vol. 2: Frontiers Three Dimensional Elliptic and Maxwell Problems with Applications
SIAM Journal on Control and Optimization
On saturation effects in the Neumann boundary control of elliptic optimal control problems
Computational Optimization and Applications
SIAM Journal on Matrix Analysis and Applications
Hi-index | 0.00 |
We investigate the discretization of optimal boundary control problems for elliptic equations on two-dimensional polygonal domains by the boundary concentrated finite element method. We prove that the discretization error $\|u^{*}-u_{h}^{*}\|_{L^{2}(\Gamma)}$ decreases like N 驴1, where N is the total number of unknowns. This makes the proposed method favorable in comparison to the h-version of the finite element method, where the discretization error behaves like N 驴3/4 for uniform meshes. Moreover, we present an algorithm that solves the discretized problem in almost optimal complexity. The paper is complemented with numerical results.