Sergio Rojas

Tomasz Sluzalec, Rafal Grzeszczuk, Sergio Rojas et al.

We show how to construct the deep neural network (DNN) expert to predict quasi-optimal $hp$-refinements for a given computational problem. The main idea is to train the DNN expert during executing the self-adaptive $hp$-finite element method ($hp$-FEM) algorithm and use it later to predict further $hp$ refinements. For the training, we use a two-grid paradigm self-adaptive $hp$-FEM algorithm. It employs the fine mesh to provide the optimal $hp$ refinements for coarse mesh elements. We aim to construct the DNN expert to identify quasi-optimal $hp$ refinements of the coarse mesh elements. During the training phase, we use the direct solver to obtain the solution for the fine mesh to guide the optimal refinements over the coarse mesh element. After training, we turn off the self-adaptive $hp$-FEM algorithm and continue with quasi-optimal refinements as proposed by the DNN expert trained. We test our method on three-dimensional Fichera and two-dimensional L-shaped domain problems. We verify the convergence of the numerical accuracy with respect to the mesh size. We show that the exponential convergence delivered by the self-adaptive $hp$-FEM can be preserved if we continue refinements with a properly trained DNN expert. Thus, in this paper, we show that from the self-adaptive $hp$-FEM it is possible to train the DNN expert the location of the singularities, and continue with the selection of the quasi-optimal $hp$ refinements, preserving the exponential convergence of the method.

Victor M. Calo, Quanling Deng, Sergio Rojas et al.

Most variational forms of isogeometric analysis use highly-continuous basis functions for both trial and test spaces. For a partial differential equation with a smooth solution, isogeometric analysis with highly-continuous basis functions for trial space results in excellent discrete approximations of the solution. However, we observe that high continuity for test spaces is not necessary. In this work, we present a framework which uses highly-continuous B-splines for the trial spaces and basis functions with minimal regularity and possibly lower order polynomials for the test spaces. To realize this goal, we adopt the residual minimization methodology. We pose the problem in a mixed formulation, which results in a system governing both the solution and a Riesz representation of the residual. We present various variational formulations which are variationally-stable and verify their equivalence numerically via numerical tests.

Ignacio Muga, Jorge Perera, Sergio Rojas et al.

In this work, we propose and analyze a residual-minimization strategy for the numerical solution of nonlinear PDEs posed in Banach spaces. Given a finite-dimensional trial space and a suitably enriched discrete test space (of higher dimension than the trial space), we approximate the solution by minimizing the variational residual in a discrete dual norm. This minimization is equivalent to a nonlinear saddle-point formulation for the discrete solution in the trial space together with a residual representative in the test space. The latter provides a natural a posteriori error estimator, enabling automatic mesh adaptivity. To solve the resulting nonlinear saddle-point problem, we propose a Newton iteration whose linearized saddle-point system is symmetric, thereby guaranteeing solvability at each step. We take the $p$-Laplacian as a model problem and support the theoretical developments with representative numerical experiments, using standard $H^1$-conforming piecewise linear functions for the trial space, and lowest-order Crouzeix--Raviart functions for the test space.