相关论文: Comparisons of Some Iterative Algorithms for Biot …
An inherent regularization strategy and block Schur complement preconditioning are studied for linear poroelasticity problems discretized using the lowest-order weak Galerkin FEM in space and the implicit Euler scheme in time. At each time…
We shall propose and analyze some new preconditioners for the saddle-point systems arising from the edge element discretization of the time-harmonic Maxwell equations in three dimensions. We will first consider the saddle-point systems with…
This paper investigates the iterates $\hbb^1,\dots,\hbb^T$ obtained from iterative algorithms in high-dimensional linear regression problems, in the regime where the feature dimension $p$ is comparable with the sample size $n$, i.e., $p…
We consider a new splitting based on the Sherman-Morrison-Woodbury formula, which is particularly effective with iterative methods for the numerical solution of large linear systems. These systems involve matrices that are perturbations of…
We propose, analyze, and test a proximal-gradient method for solving regularized optimization problems with general constraints. The method employs a decomposition strategy to compute trial steps and uses a merit function to determine step…
The generalized Biot-Brinkman equations describe the displacement, pressures and fluxes in an elastic medium permeated by multiple viscous fluid networks and can be used to study complex poromechanical interactions in geophysics, biophysics…
In this paper, we propose a preconditioner based on the shift-splitting method for generalized saddle point problems with nonsymmetric positive definite (1,1)-block and symmetric positive semidefinite $(2,2)$-block. The proposed…
The method of generalized modeling has been applied successfully in many different contexts, particularly in ecology and systems biology. It can be used to analyze the stability and bifurcations of steady-state solutions. Although many…
In this paper we examine iterative methods for solving the forward ($A{\bf x}={\bf b}$) and adjoint ($A^{T}{\bf y}={\bf g}$) systems of linear equations used to approximate the scattering amplitude, defined by ${\bf g}^{T}{\bf x}={\bf…
We consider a Fictitious Domain formulation of an elliptic partial differential equation and approximate the resulting saddle-point system using an inexact preconditioned Uzawa iterative algorithm. Each iteration entails the approximation…
In this paper, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior point method, blended with the proximal method of multipliers,…
Although the Kadanoff-Baym equations are typically solved using time-stepping methods, iterative global-in-time solvers offer potential algorithmic advantages, particularly when combined with compressed representations of two-time objects.…
We consider a saddle point formulation for a sixth order partial differential equation and its finite element approximation, for two sets of boundary conditions. We follow the Ciarlet-Raviart formulation for the biharmonic problem to…
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…
Scalable Gaussian process (GP) inference is essential for sequential decision-making tasks, yet improving GP scalability remains a challenging problem with many open avenues of research. This paper focuses on iterative GPs, where iterative…
In this work we analyze an optimized artificial fixed-stress iteration scheme for the numerical approximation of the Biot system modelling fluid flow in deformable porous media. The iteration is based on a prescribed constant artificial…
Compatible finite element discretisations for the atmospheric equations of motion have recently attracted considerable interest. Semi-implicit timestepping methods require the repeated solution of a large saddle-point system of linear…
This paper concentrates on a priori error estimates of two fully discrete coupled schemes for Biot's consolidation model based on the three-field formulation introduced by Oyarzua et al. (SIAM Journal on Numerical Analysis, 2016). The…
This paper considers the numerical solution of generalized Sylvester matrix equations, which arise in many scientific and engineering applications but remain challenging to solve efficiently, particularly when the coefficient matrices are…
We study acceleration and preconditioning strategies for a class of Douglas-Rachford methods aiming at the solution of convex-concave saddle-point problems associated with Fenchel-Rockafellar duality. While the basic iteration converges…