Daniel Patrik, Ern Alexandre, Vohralík Martin

**Abstract:** In this work we extend our recently proposed adaptive refinement strategy for hp-finite element approximations of elliptic problems by taking into account an inexact algebraic solver. Namely, on each level of refinement and on each iteration of an (arbitrary) iterative algebraic solver, we compute guaranteed a posteriori error bounds on the algebraic and the total errors in energy norm. For the algebraic error upper bound, we crucially exploit the nested hierarchy of hp-finite element spaces created throughout the adaptive algorithm, whereas the rest of the components of the total error upper and lower bounds are computed using the finest space only. These error bounds allow us to formulate adaptive stopping criteria for the algebraic solver ensuring that the algebraic error does not significantly contribute to the total error. Next, we use the total error bound to mark mesh vertices for refinement via Dörfler's bulk-chasing criterion. On patches associated with marked vertices only, we solve two separate primal finite element problems with homogeneous Dirichlet (Neumann) boundary conditions, which serve to decide between h-, p-, or hp-refinement. Altogether, we show that these ingredients lead to a computable guaranteed bound on the ratio of the total errors of the inexact approximations between successive refinements (the error reduction factor), when the stopping criteria are satisfied. Finally, in a series of numerical experiments, we investigate the practicality of the proposed adaptive solver, the accuracy of our bound on the reduction factor, and show that exponential convergence rates are also achieved even in the presence of an inexact algebraic solver.

Daniel Patrik, Ern Alexandre, Smears Iain, Vohralík Martin

**Abstract:** We propose a new practical adaptive refinement strategy for hp-finite element approximations of elliptic problems. Following recent theoretical developments in polynomial-degree-robust a posteriori error analysis, we solve two types of discrete local problems on vertex-based patches. The first type involves the solution on each patch of a mixed finite element problem with homogeneous Neumann boundary conditions, which leads to an H(div,Ω)-conforming equilibrated flux. This, in turn, yields a guaranteed upper bound on the error and serves to mark mesh vertices for refinement via Dörfler's bulk-chasing criterion. The second type of local problems involves the solution, on patches associated with marked vertices only, of two separate primal finite element problems with homogeneous Dirichlet boundary conditions, which serve to decide between h-, p-, or hp-refinement. Altogether, we show that these ingredients lead to a computable guaranteed bound on the ratio of the errors between successive refinements (error reduction factor). In a series of numerical experiments featuring smooth and singular solutions, we study the performance of the proposed hp-adaptive strategy and observe exponential convergence rates. We also investigate the accuracy of our bound on the reduction factor by evaluating the ratio of the predicted reduction factor relative to the true error reduction, and we find that this ratio is in general quite close to the optimal value of one.

Daniel Patrik, Medľa Matej, Mikula Karol, Remešíková Mariana

**Abstract:** We present a method for reconstruction of surfaces in R3 from point clouds. Given a set of points, we construct a triangular mesh approximation of a surface that they represent. The triangulation is obtained by a Lagrangian surface evolution model consisting of an advection and a curvature term. To construct them, we compute the distance function d to the given point cloud. Then the advection evolution is driven by ∇d and the curvature term depends on d and the mean curvature of the evolving surface. In order to control the quality of the mesh during the evolution, we perform tangential redistribution of mesh points as the surface evolves.

Last update: January 2019 © Bootstrap stylesheet