Related papers: Robust multigrid solvers for the biharmonic proble…
In this manuscript, we present a collective multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty, and develop a novel convergence…
We extend the softFEM idea to isogeometric analysis (IGA) to reduce the stiffness (consequently, the condition numbers) of the IGA discretized problem. We refer to the resulting approximation technique as softIGA. We obtain the resulting…
We give a new proof that compact infra-solvmanifolds with isomorphic fundamental groups are smoothly diffeomorphic. More generally, we prove rigidity results for manifolds which are constructed using affine actions of virtually polycyclic…
The multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared to…
Given a multigrid procedure for linear systems with coefficient matrices $A_n$, we discuss the optimality of a related multigrid procedure with the same smoother and the same projector, when applied to properly related algebraic problems…
This paper introduces a novel approach to algebraic multigrid methods for large systems of linear equations coming from finite element discretizations of certain elliptic second order partial differential equations. Based on a discrete…
As part of the development of a Poisson solver for the spectral element discretization used in the GeoFluid Object Workbench (GeoFLOW) code, we propose a solver for the linear system arising from a Gauss-Legendre-Lobatto global spectral…
We design and investigate a variety of multigrid solvers for high-order local discontinuous Galerkin methods applied to elliptic interface and multiphase Stokes problems. Using the template of a standard multigrid V-cycle, we consider a…
This paper presents an approach to generalize the concept of isogeometric analysis (IGA) by allowing different spaces for parameterization of the computational domain and for approximation of the solution field. The method inherits the main…
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…
The Isogeometric Analysis (IgA) of boundary value problems in complex domains often requires a decomposition of the computational domain into patches such that each of which can be parametrized by the so-called geometrical mapping. In this…
A method is presented to include irregular domain boundaries in a geometric multigrid solver. Dirichlet boundary conditions can be imposed on an irregular boundary defined by a level set function. Our implementation employs quadtree/octree…
Although Galerkin discretizations have been intensively employed in the IgA context, an efficient implementation requires special numerical quadrature rules when constructing the system of equations. To avoid this issue, isogeometric…
We propose a framework for solving partial differential equations (PDEs) motivated by isogeometric analysis (IGA) and local tensor-product splines. Instead of using a global basis for the solution space we use as generators the disjoint…
We present and analyze a new stable space-time Isogeometric Analysis (IgA) method for the numerical solution of parabolic evolution equations in fixed and moving spatial computational domains. The discrete bilinear form is elliptic on the…
In the present work, we study how to develop an efficient solver for the fast resolution of large and sparse linear systems that occur while discretizing elliptic partial differential equations using isogeometric analysis. Our new approach…
We consider large linear systems arising from the isogeometric discretization of the Poisson problem on a single-patch domain. The numerical solution of such systems is considered a challenging task, particularly when the degree of the…
In this paper, a fully aggregation-based algebraic multigrid strategy is developed for nonlinear contact problems of saddle point type using a mortar finite element approach. While the idea of extending multigrid methods to saddle point…
Four adaptations of the smoothed aggregation algebraic multigrid (SA-AMG) method are proposed with an eye towards improving the convergence and robustness of the solver in situations when the discretization matrix contains many weak…
Future e-mobility calls for efficient electrical machines. For different areas of operation, these machines have to satisfy certain desired properties that often depend on their design. Here we investigate the use of multipatch Isogeometric…