Related papers: Fast multilevel solvers for a class of discrete fo…
Coupled nonlinear system of reaction-diffusion equations describing multi-component (species) interactions with heterogeneous coefficients is considered. Finite volume method based approximation for the space is used to construct…
This paper deals with balanced domain decomposition by constraints (BDDC) method for solving large-scale linear systems of algebraic equations arising from the space-time finite element discretization of parabolic initial-boundary value…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
We propose a high-order finite element method for linear fourth-order elliptic problems that is both nodally bound-preserving and mass-conservative, based on a variational inequality formulation. The method admits an equivalent strictly…
This work presents a multigrid preconditioned high order immersed finite difference solver to accurately and efficiently solve the Poisson equation on complex 2D and 3D domains. The solver employs a low order Shortley-Weller multigrid…
Due to the wide separation of time scales in geophysical fluid dynamics, semi-implicit time integrators are commonly used in operational atmospheric forecast models. They guarantee the stable treatment of fast (acoustic and gravity) waves,…
The construction of robust solvers for linear systems obtained from the discretization of partial differential equations using Isogeometric Analysis is challenging since the condition number of the system matrix not only grows with the…
We propose consistent locally stabilized, conforming finite element schemes on completely unstructured simplicial space-time meshes for the numerical solution of non-autonomous parabolic evolution problems under the assumption of maximal…
In this work, we propose a robust and easily implemented algebraic multigrid method as a stand-alone solver or a preconditioner in Krylov subspace methods for solving either symmetric and positive definite or saddle point linear systems of…
We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…
Constructing fast numerical solvers for partial differential equations (PDEs) is crucial for many scientific disciplines. A leading technique for solving large-scale PDEs is using multigrid methods. At the core of a multigrid solver is the…
We study a multigrid method for solving large linear systems of equations with tensor product structure. Such systems are obtained from stochastic finite element discretization of stochastic partial differential equations such as the…
This paper introduces a preconditioned method designed to comprehensively address the saddle point system with the aim of improving convergence efficiency. In the preprocessor construction phase, a technical approach for solving the…
The paper introduces the sweeping preconditioner, which is highly efficient for iterative solutions of the variable coefficient Helmholtz equation including very high frequency problems. The first central idea of this novel approach is to…
Isogeometric Analysis is a high-order discretization method for boundary value problems that uses a number of degrees of freedom which is as small as for a low-order method. Standard isogeometric discretizations require a global…
We present a polynomial preconditioner for solving large systems of linear equations. The polynomial is derived from the minimum residual polynomial (the GMRES polynomial) and is more straightforward to compute and implement than many…
We develop a new spatial semidiscrete multiscale method based upon the edge multiscale methods to solve semilinear parabolic problems with heterogeneous coefficients and smooth initial data. This method allows for a cheap spatial…
The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an…
In this paper we propose a new class of preconditioners for the isogeometric discretization of the Stokes system. Their application involves the solution of a Sylvester-like equation, which can be done efficiently thanks to the Fast…
This paper introduces a discretization-accurate stopping criterion of symmetric iterative methods for solving systems of algebraic equations resulting from the finite element approximation. The stopping criterion consists of the evaluations…