ADAndrei Dumitrasc

Andrei Dumitrasc

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Andrei Dumitrasc has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Generalized Golub–Kahan Bidiagonalization for Nonsymmetric Saddle-Point Systems

    by Andrei Dumitrasc, Carola Kruse, Ulrich Rüde

    The generalized Golub–Kahan bidiagonalization has been used to solve saddle-point systems where the leading block is symmetric and positive definite. We extend this iterative method for the case where the symmetry condition no longer holds. We do so by relying on the known connection the algorithm has with the conjugate gradient method and following the line of reasoning that adapts the latter into the full orthogonalization method. We propose appropriate stopping criteria based on the residual and an estimate of the energy norm for the error associated with the primal variable. Numerical comparison with GMRES highlights the advantages of our proposed strategy regarding its low memory requirements and the associated implications.


  • Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems

    by Andrei Dumitrasc, Carola Kruse, Ulrich Rüde

    Deflation techniques are typically used to shift isolated clusters of small eigenvalues in order to obtain a tighter distribution and a smaller condition number. Such changes induce a positive effect in the convergence behavior of Krylov subspace methods, which are among the most popular iterative solvers for large sparse linear systems. We develop a deflation strategy for symmetric saddle point matrices by taking advantage of their underlying block structure. The vectors used for deflation come from an elliptic singular value decomposition relying on the generalized Golub–Kahan bidiagonalization process. The block targeted by deflation is the off-diagonal one since it features a problematic singular value distribution for certain applications. One example is the Stokes flow in elongated channels, where the off-diagonal block has several small, isolated singular values, depending on the length of the channel. Applying deflation to specific parts of the saddle point system is important when using solvers such as CRAIG, which operates on individual blocks rather than the whole system. The theory is developed by extending the existing framework for deflating square matrices before applying a Krylov subspace method such as MINRES. Numerical experiments confirm the merits of our strategy and lead to interesting questions about using approximate vectors for deflation.


  • Open Access

    Inexact inner–outer Golub–Kahan bidiagonalization method: A relaxation strategy

    by Vincent Darrigrand, Andrei Dumitrasc, Carola Kruse, Ulrich Rüde

    We study an inexact inner–outer generalized Golub–Kahan algorithm for the solution of saddle‐point problems with a two‐times‐two block structure. In each outer iteration, an inner system has to be solved which in theory has to be done exactly. Whenever the system is getting large, an inner exact solver is, however, no longer efficient or even feasible and iterative methods must be used. We focus this article on a numerical study showing the influence of the accuracy of an inner iterative solution on the accuracy of the solution of the block system. Emphasis is further given on reducing the computational cost, which is defined as the total number of inner iterations. We develop relaxation techniques intended to dynamically change the inner tolerance for each outer iteration to further minimize the total number of inner iterations. We illustrate our findings on a Stokes problem and validate them on a mixed formulation of the Poisson problem.


  • Open Access

    Block partitioning of sparse rectangular matrices

    by Andrei Dumitrasc, Philippe Leleux, Ulrich Rüde

    We present a means of reordering large, sparse rectangular matrices such that their nonzeros are closer to the diagonal. This enables a block‐partitioning which is useful in parallel contexts. We use the Reverse Cuthill‐McKee (RCM) algorithm on the adjacency matrix of the associated bipartite graph. The resulting, reordered matrix has a block bidiagonal structure.