Related papers: Comparisons of Some Iterative Algorithms for Biot …
We derive novel, fast, and parameter-robust preconditioned iterative methods for steady and time-dependent Navier--Stokes control problems. Our approach may be applied to time-dependent problems which are discretized using backward Euler or…
In this article, we discuss several classes of Uzawa smoothers for the application in multigrid methods in the context of saddle point problems. Beside commonly used variants, such as the inexact and block factorization version, we also…
In this article, we propose and study a stochastic and relaxed preconditioned Douglas--Rachford splitting method to solve saddle-point problems that have separable dual variables. We prove the almost sure convergence of the iteration…
An open problem that arises when using modern iterative linear solvers, such as the preconditioned conjugate gradient (PCG) method or Generalized Minimum RESidual method (GMRES) is how to choose the residual tolerance in the linear solver…
An H(div) conforming finite element method for solving the linear Biot equations is analyzed. Formulations for the standard mixed method are combined with formulation of interior penalty discontinuous Galerkin method to obtain a consistent…
We consider the generalized successive overrelaxation (GSOR) method for solving a class of block three-by-three saddle-point problems. Based on the necessary and sufficient conditions for all roots of a real cubic polynomial to have modulus…
We propose a preconditioner to accelerate the convergence of the GMRES iterative method for solving the system of linear equations obtained from discretize-then-optimize approach applied to optimal control problems constrained by a partial…
This paper focuses on the efficient numerical algorithms of a three-field Biot's consolidation model. The approach begins with the introduction of innovative monolithic and global-in-time iterative decoupled algorithms, which incorporate…
The goal of this work is to construct and study hybrid and multiplicative two-level overlapping Schwarz algorithms with standard coarse spaces for the almost incompressible linear elasticity and Stokes systems, discretized by mixed finite…
Recently, in (M. Masoudi, D.K. Salkuyeh, An extension of positive-definite and skew-Hermitian splitting method for preconditioning of generalized saddle point problems, Computers \& Mathematics with Application,…
In this research, to solve the large indefinite least squares problem, we firstly transform its normal equation into a sparse block three-by-three linear systems, then use GMRES method with an accelerated preconditioner to solve it. The…
In this work we are interested in effectively solving the quasi-static, linear Biot model for poromechanics. We consider the fixed-stress splitting scheme, which is a popular method for iteratively solving Biot's equations. It is well-known…
We present a scalability study of Golub-Kahan bidiagonalization for the parallel iterative solution of symmetric indefinite linear systems with a 2x2 block structure. The algorithms have been implemented within the parallel numerical…
We introduce a stress/total-pressure formulation for poroelasticity that includes the coupling with steady nonlinear diffusion modified by stress. The nonlinear problem is written in mixed-primal form, coupling a perturbed twofold…
In this paper, a class of new preconditioners based on matrix splitting are presented for generalized saddle-point linear systems, which can be viewed as further modified improvements of some recently published preconditioners. Moreover, we…
Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra…
We propose a neural network framework for solving stationary linear transport equations with inflow boundary conditions. The method represents the solution using a neural network and imposes the boundary condition via a Lagrange multiplier,…
Finite element discretization of Stokes problems can result in singular, inconsistent saddle point linear algebraic systems. This inconsistency can cause many iterative methods to fail to converge. In this work, we consider the lowest-order…
This paper presents an auto-stabilized weak Galerkin (WG) finite element method for the Biot's consolidation model within the classical displacement-pressure two-field formulation. Unlike traditional WG approaches, the proposed scheme…
In this paper, we introduce a multilevel algorithm for approximating variational formulations of symmetric saddle point systems. The algorithm is based on availability of families of stable finite element pairs and on the availability of…