variational discretization
Recently Published Documents


TOTAL DOCUMENTS

50
(FIVE YEARS 1)

H-INDEX

8
(FIVE YEARS 0)

2021 ◽  
Vol 6 (1) ◽  
pp. 772-793
Author(s):  
Chunjuan Hou ◽  
◽  
Zuliang Lu ◽  
Xuejiao Chen ◽  
Fei Huang ◽  
...  


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Yuelong Tang ◽  
Yuchun Hua

AbstractIn this paper, we study variational discretization method for parabolic optimization problems. Firstly, we obtain some convergence and superconvergence analysis results of the approximation scheme. Secondly, we derive a posteriori error estimates of the approximation solutions. Finally, we present variational discretization approximation algorithm and adaptive variational discretization approximation algorithm for parabolic optimization problems and do some numerical experiments to confirm our theoretical results.



2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Pei Yin ◽  
Hongyun Yue ◽  
Hongbo Guan

This paper presents a new numerical method and analysis for solving second-order elliptic interface problems. The method uses a modified nonconforming rotated Q1 immersed finite element (IFE) space to discretize the state equation required in the variational discretization approach. Optimal order error estimates are derived in L2-norm and broken energy norm. Numerical examples are provided to confirm the theoretical results.





2020 ◽  
Vol 13 (4) ◽  
pp. 1075-1102 ◽  
Author(s):  
Benjamin Couéraud ◽  
◽  
François Gay-Balmaz ◽  




Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 642 ◽  
Author(s):  
Tomasz M. Tyranowski ◽  
Mathieu Desbrun

Moving mesh methods (also called r-adaptive methods) are space-adaptive strategies used for the numerical simulation of time-dependent partial differential equations. These methods keep the total number of mesh points fixed during the simulation but redistribute them over time to follow the areas where a higher mesh point density is required. There are a very limited number of moving mesh methods designed for solving field-theoretic partial differential equations, and the numerical analysis of the resulting schemes is challenging. In this paper, we present two ways to construct r-adaptive variational and multisymplectic integrators for (1+1)-dimensional Lagrangian field theories. The first method uses a variational discretization of the physical equations, and the mesh equations are then coupled in a way typical of the existing r-adaptive schemes. The second method treats the mesh points as pseudo-particles and incorporates their dynamics directly into the variational principle. A user-specified adaptation strategy is then enforced through Lagrange multipliers as a constraint on the dynamics of both the physical field and the mesh points. We discuss the advantages and limitations of our methods. Numerical results for the Sine–Gordon equation are also presented.



2019 ◽  
Vol 40 (3) ◽  
pp. 2106-2142 ◽  
Author(s):  
A Allendes ◽  
F Fuica ◽  
E Otárola

Abstract We propose and analyse reliable and efficient a posteriori error estimators for an optimal control problem that involves a nondifferentiable cost functional, the Poisson problem as state equation and control constraints. To approximate the solution to the state and adjoint equations we consider a piecewise linear finite element method, whereas three different strategies are used to approximate the control variable: piecewise constant discretization, piecewise linear discretization and the so-called variational discretization approach. For the first two aforementioned solution techniques we devise an error estimator that can be decomposed as the sum of four contributions: two contributions that account for the discretization of the control variable and the associated subgradient and two contributions related to the discretization of the state and adjoint equations. The error estimator for the variational discretization approach is decomposed only in two contributions that are related to the discretization of the state and adjoint equations. On the basis of the devised a posteriori error estimators, we design simple adaptive strategies that yield optimal rates of convergence for the numerical examples that we perform.



Sign in / Sign up

Export Citation Format

Share Document