21,851 research outputs found
Adaptive asynchronous time-stepping, stopping criteria, and a posteriori error estimates for fixed-stress iterative schemes for coupled poromechanics problems
In this paper we develop adaptive iterative coupling schemes for the Biot
system modeling coupled poromechanics problems. We particularly consider the
space-time formulation of the fixed-stress iterative scheme, in which we first
solve the problem of flow over the whole space-time interval, then exploiting
the space-time information for solving the mechanics. Two common
discretizations of this algorithm are then introduced based on two coupled
mixed finite element methods in-space and the backward Euler scheme in-time.
Therefrom, adaptive fixed-stress algorithms are build on conforming
reconstructions of the pressure and displacement together with equilibrated
flux and stresses reconstructions. These ingredients are used to derive a
posteriori error estimates for the fixed-stress algorithms, distinguishing the
different error components, namely the spatial discretization, the temporal
discretization, and the fixed-stress iteration components. Precisely, at the
iteration of the adaptive algorithm, we prove that our estimate gives
a guaranteed and fully computable upper bound on the energy-type error
measuring the difference between the exact and approximate pressure and
displacement. These error components are efficiently used to design adaptive
asynchronous time-stepping and adaptive stopping criteria for the fixed-stress
algorithms. Numerical experiments illustrate the efficiency of our estimates
and the performance of the adaptive iterative coupling algorithms
Adaptive control in rollforward recovery for extreme scale multigrid
With the increasing number of compute components, failures in future
exa-scale computer systems are expected to become more frequent. This motivates
the study of novel resilience techniques. Here, we extend a recently proposed
algorithm-based recovery method for multigrid iterations by introducing an
adaptive control. After a fault, the healthy part of the system continues the
iterative solution process, while the solution in the faulty domain is
re-constructed by an asynchronous on-line recovery. The computations in both
the faulty and healthy subdomains must be coordinated in a sensitive way, in
particular, both under and over-solving must be avoided. Both of these waste
computational resources and will therefore increase the overall
time-to-solution. To control the local recovery and guarantee an optimal
re-coupling, we introduce a stopping criterion based on a mathematical error
estimator. It involves hierarchical weighted sums of residuals within the
context of uniformly refined meshes and is well-suited in the context of
parallel high-performance computing. The re-coupling process is steered by
local contributions of the error estimator. We propose and compare two criteria
which differ in their weights. Failure scenarios when solving up to
unknowns on more than 245\,766 parallel processes will be
reported on a state-of-the-art peta-scale supercomputer demonstrating the
robustness of the method
On barrier and modified barrier multigrid methods for 3d topology optimization
One of the challenges encountered in optimization of mechanical structures,
in particular in what is known as topology optimization, is the size of the
problems, which can easily involve millions of variables. A basic example is
the minimum compliance formulation of the variable thickness sheet (VTS)
problem, which is equivalent to a convex problem. We propose to solve the VTS
problem by the Penalty-Barrier Multiplier (PBM) method, introduced by R.\
Polyak and later studied by Ben-Tal and Zibulevsky and others. The most
computationally expensive part of the algorithm is the solution of linear
systems arising from the Newton method used to minimize a generalized augmented
Lagrangian. We use a special structure of the Hessian of this Lagrangian to
reduce the size of the linear system and to convert it to a form suitable for a
standard multigrid method. This converted system is solved approximately by a
multigrid preconditioned MINRES method. The proposed PBM algorithm is compared
with the optimality criteria (OC) method and an interior point (IP) method,
both using a similar iterative solver setup. We apply all three methods to
different loading scenarios. In our experiments, the PBM method clearly
outperforms the other methods in terms of computation time required to achieve
a certain degree of accuracy
Preconditioning and convergence in the right norm
The convergence of numerical approximations to the solutions of differential equations is a key aspect of Numerical Analysis and Scientific Computing. Iterative solution methods for the systems of linear(ised) equations which often result are also underpinned by analyses of convergence. In the function space setting, it is widely appreciated that there are appropriate ways in which to assess convergence and it is well-known that different norms are not equivalent. In the finite dimensional linear algebra setting, however, all norms are equivalent and little attention is often payed to the norms used. In this paper, we highlight this consideration in the context of preconditioning for minimum residual methods (MINRES and GMRES/GCR/ORTHOMIN) and argue that even in the linear algebra setting there is a ‘right’ norm in which to consider convergence: stopping an iteration which is rapidly converging in an irrelevant or highly scaled norm at some tolerance level may still give a poor answer
Monitoring a PGD solver for parametric power flow problems with goal-oriented error assessment
This is the peer reviewed version of the following article: [GarcÃa-Blanco, R., Borzacchiello, D., Chinesta, F., and Diez, P. (2017) Monitoring a PGD solver for parametric power flow problems with goal-oriented error assessment. Int. J. Numer. Meth. Engng, 111: 529–552. doi: 10.1002/nme.5470], which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/nme.5470/full. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.The parametric analysis of electric grids requires carrying out a large number of Power Flow computations. The different parameters describe loading conditions and grid properties. In this framework, the Proper Generalized Decomposition (PGD) provides a numerical solution explicitly accounting for the parametric dependence. Once the PGD solution is available, exploring the multidimensional parametric space is computationally inexpensive. The aim of this paper is to provide tools to monitor the error associated with this significant computational gain and to guarantee the quality of the PGD solution. In this case, the PGD algorithm consists in three nested loops that correspond to 1) iterating algebraic solver, 2) number of terms in the separable greedy expansion and 3) the alternated directions for each term. In the proposed approach, the three loops are controlled by stopping criteria based on residual goal-oriented error estimates. This allows one for using only the computational resources necessary to achieve the accuracy prescribed by the end- user. The paper discusses how to compute the goal-oriented error estimates. This requires linearizing the error equation and the Quantity of Interest to derive an efficient error representation based on an adjoint problem. The efficiency of the proposed approach is demonstrated on benchmark problems.Peer ReviewedPostprint (author's final draft
- …