Related papers: Grid Quality Measures for Iterative Convergence
A two-grid scheme based on mixed finite-element approximations to the incompressible Navier-Stokes equations is introduced and analyzed. In the first level the standard mixed finite-element approximation over a coarse mesh is computed. In…
The convergence of multigrid methods degrades significantly if a small number of low quality cells are present in a finite element mesh, and this can be a barrier to the efficient and robust application of multigrid on complicated geometric…
We consider two-grid mixed-finite element schemes for the spatial discretization of the incompressible Navier-Stokes equations. A standard mixed-finite element method is applied over the coarse grid to approximate the nonlinear…
In this paper, we review some grid quality metrics Robinson1987, Lo1989, Field2000, Knupp2001, Remacle2012 and define some new quality measures for quadrilateral elements. Usually, a maximum value of a quality measure corresponds to the…
This work primarily focuses on the study of three gradient reconstruction techniques applied to the calculation of viscous terms in a cell-centered, finite volume formulation for general unstructured grids. The work also addresses different…
In this work we exploit agglomeration based $h$-multigrid preconditioners to speed-up the iterative solution of discontinuous Galerkin discretizations of the Stokes and Navier-Stokes equations. As a distinctive feature $h$-coarsened mesh…
In this paper we present a numerical approach to solve the Navier-Stokes equations on moving domains with second-order accuracy. The space discretization is based on the ghost-point method, which falls under the category of unfitted…
It is well known that the choice of the iterative method is crucial in determining the speed of the converged solution. This article presents a detailed comparison between several iterative techniques for solving incmopressible…
A coarse grid correction (CGC) approach is proposed to enhance the efficiency of the matrix exponential and $\varphi$ matrix function evaluations. The approach is intended for iterative methods computing the matrix-vector products with…
In this paper, an error analysis of a three steps two level Galekin finite element method for the two dimensional transient Navier-Stokes equations is discussed. First of all, the problem is discretized in spatial direction by employing…
Many problems encountered in science and engineering can be formulated as estimating a low-rank object (e.g., matrices and tensors) from incomplete, and possibly corrupted, linear measurements. Through the lens of matrix and tensor…
We introduce and analyze a space-time least-squares method associated to the unsteady Navier-Stokes system. Weak solution in the two dimensional case and regular solution in the three dimensional case are considered. From any initial guess,…
Iteratively Re-weighted Least Squares (IRLS) is a method for solving minimization problems involving non-quadratic cost functions, perhaps non-convex and non-smooth, which however can be described as the infimum over a family of quadratic…
An immersed-boundary method for the incompressible Navier--Stokes equations is presented. It employs discrete forcing for a sharp discrimination of the solid-fluid interface, and achieves second-order accuracy, demonstrated in examples with…
In this paper we propose a new spatially high order accurate semi-implicit discontinuous Galerkin (DG) method for the solution of the two dimensional incompressible Navier-Stokes equations on staggered unstructured curved meshes. While the…
This paper presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles,…
In this work we prove that weak solutions constructed by a variational multiscale method are suitable in the sense of Scheffer. In order to prove this result, we consider a subgrid model that enforces orthogonality between subgrid and…
Gradient sampling (GS) has proved to be an effective methodology for the minimization of objective functions that may be nonconvex and/or nonsmooth. The most computationally expensive component of a contemporary GS method is the need to…
Under mild assumptions stochastic gradient methods asymptotically achieve an optimal rate of convergence if the arithmetic mean of all iterates is returned as an approximate optimal solution. However, in the absence of stochastic noise, the…
We present a new hybrid direct/iterative approach to the solution of a special class of saddle point matrices arising from the discretization of the steady incompressible Navier-Stokes equations on an Arakawa C-grid. The two-level method…