SGSelime Gürol

Selime Gürol

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Selime Gürol has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Efficient Scaled spectral preconditioner for sequences of symmetric positive definite linear systems

    by Youssef Diouane, Selime Gürol, Oussama Mouhtal, Dominique Orban

    We explore a scaled spectral preconditioner for the efficient solution of sequences of symmetric and positive-definite linear systems. We design the scaled preconditioner not only as an approximation of the inverse of the linear system but also with consideration of its use within the conjugate gradient (CG) method. We propose three different strategies for selecting a scaling parameter, which aims to position the eigenvalues of the preconditioned matrix in a way that reduces the energy norm of the error, the quantity that CG monotonically decreases at each iteration. Our focus is on accelerating convergence especially in the early iterations, which is particularly important when CG is truncated due to computational cost constraints. Numerical experiments provide in data assimilation confirm that the scaled spectral preconditioner can significantly improve early CG convergence with negligible computational cost.

  • Open Access

    Parallelization in the time dimension of four‐dimensional variational data assimilation

    by Michael Fisher, Selime Gürol

    The current evolution of computer architectures towards increasing parallelism requires a corresponding evolution towards more parallel data assimilation algorithms. In this article, we consider parallelization of weak‐constraint four‐dimensional variational data assimilation (4D‐Var) in the time dimension. We categorize algorithms according to whether or not they admit such parallelization and introduce a new, highly parallel weak‐constraint 4D‐Var algorithm based on a saddle‐point representation of the underlying optimization problem. The potential benefits of the new saddle‐point formulation are illustrated with a simple two‐level quasi‐geostrophic model.


  • Low rank updates in preconditioning the saddle point systems arising from data assimilation problems

    by M. Fisher, S. Gratton, S. Gürol, Y. Trémolet, X. Vasseur

    The numerical solution of saddle point systems has received a lot of attention over the past few years in a wide variety of applications such as constrained optimization, computational fluid dynamics and optimal control, to name a few. In this paper, we focus on the saddle point formulation of a large-scale variational data assimilation problem, where the computations involving the constraint blocks are supposed to be much more expensive than those related to the (1, 1) block of the saddle point matrix. New low-rank limited memory preconditioners exploiting the particular structure of the problem are proposed and analysed theoretically. Numerical experiments performed within the Object-Oriented Prediction System are presented to highlight the relevance of the proposed preconditioners.


  • Open Access

    B‐preconditioned minimization algorithms for variational data assimilation with the dual formulation

    by S. Gürol, A. T. Weaver, A. M. Moore, A. Piacentini, H. G. Arango, S. Gratton

    Variational data assimilation problems in meteorology and oceanography require the solution of a regularized nonlinear least‐squares problem. Practical solution algorithms are based on the incremental (truncated Gauss–Newton) approach, which involves the iterative solution of a sequence of linear least‐squares (quadratic minimization) sub‐problems. Each sub‐problem can be solved using a primal approach, where the minimization is performed in a space spanned by vectors of the size of the model control vector, or a dual approach, where the minimization is performed in a space spanned by vectors of the size of the observation vector. The dual formulation can be advantageous for two reasons. First, the dimension of the minimization problem with the dual formulation does not increase when additional control variables are considered, such as those accounting for model error in a weak‐constraint formulation. Second, whenever the dimension of observation space is significantly smaller than that of the model control space, the dual formulation can reduce both memory usage and computational cost.In this article, a new dual‐based algorithm called RestrictedB‐preconditioned Lanczos (RBLanczos) is introduced, whereBdenotes the background‐error covariance matrix. RBLanczos is the Lanczos formulation of the RestrictedB‐preconditioned Conjugate Gradient (RBCG) method. RBLanczos generates mathematically equivalent iterates to those of RBCG and the correspondingB‐preconditioned Conjugate Gradient and Lanczos algorithms used in the primal approach. All these algorithms can be implemented without the need for a square‐root factorization ofB. RBCG and RBLanczos, as well as the corresponding primal algorithms, are implemented in two operational ocean data assimilation systems and numerical results are presented. Practical diagnostic formulae for monitoring the convergence properties of the minimization are also presented.