Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRandomised preconditioning for the forcing formulation of weak constraint 4D-Var
92
0
0.0
(
0
)
Added by
Ieva Dau\\v{z}ickait\\.e
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
There is growing awareness that errors in the model equations cannot be ignored in data assimilation methods such as four-dimensional variational assimilation (4D-Var). If allowed for, more information can be extracted from observations, longer time windows are possible, and the minimisation process is easier, at least in principle. Weak constraint 4D-Var estimates the model error and minimises a series of linear least-squares cost functionsfunctions, which can be achieved using the conjugate gradient (CG) method; minimising each cost function is called an inner loop. CG needs preconditioning to improve its performance. In previous work, limited memory preconditioners (LMPs) have been constructed using approximations of the eigenvalues and eigenvectors of the Hessian in the previous inner loop. If the Hessian changes significantly in consecutive inner loops, the LMP may be of limited usefulness. To circumvent this, we propose using randomised methods for low rank eigenvalue decomposition and use these approximations to cheaply construct LMPs using information from the current inner loop. Three randomised methods are compared. Numerical experiments in idealized systems show that the resulting LMPs perform better than the existing LMPs. Using these methods may allow more efficient and robust implementations of incremental weak constraint 4D-Var.
rate research
Read More
Using a high degree of parallelism is essential to perform data assimilation efficiently. The state formulation of the incremental weak constraint four-dimensional variational data assimilation method allows parallel calculations in the time dimension. In this approach, the solution is approximated by minimising a series of quadratic cost functions using the conjugate gradient method. To use this method in practice, effective preconditioning strategies that maintain the potential for parallel calculations are needed. We examine approximations to the control variable transform (CVT) technique when the latter is beneficial. The new strategy employs a randomised singular value decomposition and retains the potential for parallelism in the time domain. Numerical results for the Lorenz 96 model show that this approach accelerates the minimisation in the first few iterations, with better results when CVT performs well.
A randomised trapezoidal quadrature rule is proposed for continuous functions which enjoys less regularity than commonly required. Indeed, we consider functions in some fractional Sobolev space. Various error bounds for this randomised rule are established while an error bound for classical trapezoidal quadrature is obtained for comparison. The randomised trapezoidal quadrature rule is shown to improve the order of convergence by half.
In this paper, we develop an iterative scheme to construct multiscale basis functions within the framework of the Constraint Energy Minimizing Generalized Multiscale Finite Element Method (CEM-GMsFEM) for the mixed formulation. The iterative procedure starts with the construction of an energy minimizing snapshot space that can be used for approximating the solution of the model problem. A spectral decomposition is then performed on the snapshot space to form global multiscale space. Under this setting, each global multiscale basis function can be split into a non-decaying and a decaying parts. The non-decaying part of a global basis is localized and it is fixed during the iteration. Then, one can approximate the decaying part via a modified Richardson scheme with an appropriately defined preconditioner. Using this set of iterative-based multiscale basis functions, first-order convergence with respect to the coarse mesh size can be shown if sufficiently many times of iterations with regularization parameter being in an appropriate range are performed. Numerical results are presented to illustrate the effectiveness and efficiency of the proposed computational multiscale method.
Using the framework of operator or Calderon preconditioning, uniform preconditioners are constructed for elliptic operators discretized with continuous finite (or boundary) elements. The preconditioners are constructed as the composition of an opposite order operator, discretized on the same ansatz space, and two diagonal scaling operators.
Stable and accurate modeling of thin shells requires proper enforcement of all types of boundary conditions. Unfortunately, for Kirchhoff-Love shells, strong enforcement of Dirichlet boundary conditions is difficult because both functional and derivative boundary conditions must be applied. A popular alternative is to employ Nitsches method to weakly enforce all boundary conditions. However, while many Nitsche-based formulations have been proposed in the literature, they lack comprehensive error analyses and verifications. In fact, existing formulations are variationally inconsistent and yield sub-optimal convergence rates when used with common boundary condition specifications. In this paper, we present a novel Nitsche-based formulation for the linear Kirchhoff-Love shell that is provably stable and optimally convergent for general sets of admissible boundary conditions. To arrive at our formulation, we first present a framework for constructing Nitsches method for any abstract variational constrained minimization problem. We then apply this framework to the linear Kirchhoff-Love shell and, for the particular case of NURBS-based isogeometric analysis, we prove that the resulting formulation yields optimal convergence rates in both the shell energy norm and the standard $L^2$-norm. In the process, we derive the Euler-Lagrange equations for general sets of admissible boundary conditions and show that the Euler-Lagrange boundary conditions typically presented in the literature is incorrect. We verify our formulation by manufacturing solutions for a new shell obstacle course that encompasses flat, parabolic, hyperbolic, and elliptic geometric configurations. These manufactured solutions allow us to robustly measure the error across the entire shell in contrast with current best practices where displacement and stress errors are only measured at specific locations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
