1,640 research outputs found
Goal-based h-adaptivity of the 1-D diamond difference discrete ordinate method.
The quantity of interest (QoI) associated with a solution of a partial differential equation (PDE) is not, in general, the solution itself, but a functional of the solution. Dual weighted residual (DWR) error estimators are one way of providing an estimate of the error in the QoI resulting from the discretisation of the PDE. This paper aims to provide an estimate of the error in the QoI due to the spatial discretisation, where the discretisation scheme being used is the diamond difference (DD) method in space and discrete ordinate (SNSN) method in angle. The QoI are reaction rates in detectors and the value of the eigenvalue (Keff)(Keff) for 1-D fixed source and eigenvalue (KeffKeff criticality) neutron transport problems respectively. Local values of the DWR over individual cells are used as error indicators for goal-based mesh refinement, which aims to give an optimal mesh for a given QoI
A painless multi-level automatic goal-oriented hp-adaptive coarsening strategy for elliptic and non-elliptic problems
This work extends an automatic energy-norm -adaptive strategy based on performing quasi-optimal unrefinements to the case of non-elliptic problems and goal-oriented adaptivity. The proposed approach employs a multi-level hierarchical data structure and alternates global - and -refinements with a coarsening step. Thus, at each unrefinement step, we eliminate the basis functions with the lowest contributions to the solution. When solving elliptic problems using energy-norm adaptivity, the removed basis functions are those with the lowest contributions to the energy of the solution. For non-elliptic problems or goal-oriented adaptivity, we propose an upper bound of the error representation expressed in terms of an inner product of the specific equation, leading to error indicators that deliver quasi-optimal -unrefinements. This unrefinement strategy removes unneeded unknowns possibly introduced during the pre-asymptotical regime. In addition, the grids over which we perform the unrefinements are arbitrary, and thus, we can limit their size and associated computational costs. We numerically analyze our algorithm for energy-norm and goal-oriented adaptivity. In particular, we solve two-dimensional (D) Poisson, Helmholtz, convection-dominated equations, and a three-dimensional (D) Helmholtz-like problem. In all cases, we observe \revb{exponential} convergence rates. Our algorithm is robust and straightforward to implement; therefore, it can be easily adapted for industrial applications.BERC.2022-202
Easy-to-implement hp-adaptivity for non-elliptic goal-oriented problems
The FEM has become a foundational numerical technique in computational mechanics and civil engineering since its inception by Courant in 1943 Courant1943. Originating from the Ritz method and variational calculus, the FEM was primarily employed to derive solutions for vibrational systems. A distinctive strength of the FEM is its capability to represent mathematical models through the weak variational formulation of PDE, facilitating computational feasibility even in intricate geometries. However, the search for accuracy often imposes a significant computational task.
In the FEM, adaptive methods have emerged to balance the accuracy of solutions with computational costs. The -adaptive FEM designs more efficient meshes by reducing the mesh size locally while keeping the polynomial order of approximation fixed (usually ). An alternative approach to the -adaptive FEM is the -adaptive FEM, which locally enriches the polynomial space while keeping the mesh size constant. By dynamically adapting and , the -adaptive FEM achieves exponential convergence rates.
Adaptivity is crucial for obtaining accurate solutions. However, the traditional focus on global norms, such as or , might only sometimes serve the requirements of specific applications. In engineering, controlling errors in specific domains related to a particular QoI is often more critical than focusing on the overall solution. That motivated the development of GOA strategies.
In this dissertation, we develop automatic GO -adaptive algorithms tailored for non-elliptic problems. These algorithms shine in terms of robustness and simplicity in their implementation, attributes that make them especially suitable for industrial applications. A key advantage of our methodologies is that they do not require computing reference solutions on globally refined grids. Nevertheless, our approach is limited to anisotropic and isotropic refinements.
We conduct multiple tests to validate our algorithms. We probe the convergence behavior of our GO - and -adaptive algorithms using Helmholtz and convection-diffusion equations in one-dimensional scenarios. We test our GO -adaptive algorithms on Poisson, Helmholtz, and convection-diffusion equations in two dimensions. We use a Helmholtz-like scenario for three-dimensional cases to highlight the adaptability of our GO algorithms.
We also create efficient ways to build large databases ideal for training DNN using MAGO FEM. As a result, we efficiently generate large databases, possibly containing hundreds of thousands of synthetic datasets or measurements
Dual weighted residual based error control for nonstationary convection-dominated equations: potential or ballast?
Even though substantial progress has been made in the numerical approximation
of convection-dominated problems, its major challenges remain in the scope of
current research. In particular, parameter robust a posteriori error estimates
for quantities of physical interest and adaptive mesh refinement strategies
with proved convergence are still missing. Here, we study numerically the
potential of the Dual Weighted Residual (DWR) approach applied to stabilized
finite element methods to further enhance the quality of approximations. The
impact of a strict application of the DWR methodology is particularly focused
rather than the reduction of computational costs for solving the dual problem
by interpolation or localization.Comment: arXiv admin note: text overlap with arXiv:1803.1064
Goal-Oriented Adaptivity using Unconventional Error Representations
In Goal-Oriented Adaptivity (GOA), the error in a Quantity of Interest (QoI) is represented using global error functions of the direct and adjoint problems. This error representation is subsequently bounded above by element-wise error indicators that are used to drive optimal refinements. In this work, we propose to replace, in the error representation, the adjoint problem by an alternative operator. The main advantage of the proposed approach is that, when judiciously selecting such alternative operator, the corresponding upper bound of the error representation becomes sharper, leading to a more efficient GOA. These representations can be employed to design novel h, p, and hp energy-norm and goal-oriented adaptive algorithms. While the method can be applied to a variety of problems, in this Dissertation we first focus on one-dimensional (1D) problems, including Helmholtz and steady-state convection-dominated diffusion problems. Numerical results in 1D show that for the Helmholtz problem, it is advantageous to select the Laplace operator for the alternative error representation. Specifically, the upper bounds of the new error representation are sharper than the classical ones used in both energy-norm and goal-oriented adaptive methods, especially when the dispersion (pollution) error is significant. The 1D steady-state convection-dominated diffusion problem with homogeneous Dirichlet boundary conditions exhibits a boundary layer that produces a loss of numerical stability. The new error representation based on the Laplace operator delivers sharper error upper bounds. When applied to a p-GOA, the alternative error representation captures earlier the boundary layer, despite the existing spurious numerical oscillations. We then focus on the two- and three-dimensional (2D and 3D) Helmholtz equation. We show via extensive numerical experimentation that the upper bounds provided by the alternative error representations are sharper than the classical ones. When using the alternative error indicators, a naive p-adaptive process converges, whereas under the same conditions, the classical method fails and requires the use of the so-called Projection Based Interpolation (PBI) operator or some other technique to regain convergence. We also provide guidelines for finding operators delivering sharp error representation upper bounds.Basque Government Consolidated Research Group Grant IT649-1
Multigoal-oriented optimal control problems with nonlinear PDE constraints
In this work, we consider an optimal control problem subject to a nonlinear
PDE constraint and apply it to the regularized -Laplace equation. To this
end, a reduced unconstrained optimization problem in terms of the control
variable is formulated. Based on the reduced approach, we then derive an a
posteriori error representation and mesh adaptivity for multiple quantities of
interest. All quantities are combined to one, and then the dual-weighted
residual (DWR) method is applied to this combined functional. Furthermore, the
estimator allows for balancing the discretization error and the nonlinear
iteration error. These developments allow us to formulate an adaptive solution
strategy, which is finally substantiated via several numerical examples
- …