Related papers: Multigrid in H(div) on Axisymmetric Domains

We present an iterative scheme, reminiscent of the Multigrid method, to solve large boundary value problems with Probabilistic Domain Decomposition (PDD). In it, increasingly accurate approximations to the solution are used as control…

In this paper we consider spaces of bivariate splines of bi-degree (m, n) with maximal order of smoothness over domains associated to a two-dimensional grid. We define admissible classes of domains for which suitable combinatorial technique…

The present work develops hybrid multigrid methods for high-order discontinuous Galerkin discretizations of elliptic problems. Fast matrix-free operator evaluation on tensor product elements is used to devise a computationally efficient PDE…

In this paper, we propose two novel Robin-type domain decomposition methods based on the two-grid techniques for the coupled Stokes-Darcy system. Our schemes firstly adopt the existing Robin-type domain decomposition algorithm to obtain the…

This contribution presents a hierarchical multigrid approach for the solution of large-scale finite cell problems on both uniform grids and multi-level hp-discretizations. The proposed scheme leverages the hierarchical nature of the basis…

In this paper we propose a distributed dual gradient algorithm for minimizing linearly constrained separable convex problems and analyze its rate of convergence. In particular, we prove that under the assumption of strong convexity and…

In many modern data sets, High dimension low sample size (HDLSS) data is prevalent in many fields of studies. There has been an increased focus recently on using machine learning and statistical methods to mine valuable information out of…

We prove polynomial-time solvability of a large class of clustering problems where a weighted set of items has to be partitioned into clusters with respect to some balancing constraints. The data points are weighted with respect to…

We present a new multigrid solver that is suitable for the Dirac operator in the presence of disordered gauge fields. The key behind the success of the algorithm is an adaptive projection onto the coarse grids that preserves the near null…

Standard H2 optimal control of networked dynamic systems tend to become unscalable with network size. Structural constraints can be imposed on the design to counteract this problem albeit at the risk of making the solution non-convex. In…

We construct multigrid methods for an elliptic distributed optimal control problem that are robust with respect to a regularization parameter. We prove the uniform convergence of the $W$-cycle algorithm and demonstrate the performance of…

A multigrid framework is described for multiphysics applications. The framework allows one to construct, adapt, and tailor a monolithic multigrid methodology to different linear systems coming from discretized partial differential…

In this work we extend the shifted Laplacian approach to the elastic Helmholtz equation. The shifted Laplacian multigrid method is a common preconditioning approach for the discretized acoustic Helmholtz equation. In some cases, like…

In the past decades, a remarkable amount of research has been carried out regarding fast solvers for large linear systems resulting from various discretizations of fractional differential equations (FDEs). In the current work, we focus on…

In this paper, we present a robust and efficient multigrid solver based on an exponential-fitting discretization for 2D H(curl) convection-diffusion problems. By leveraging an exponential identity, we characterize the kernel of H(curl)…

In this work, an efficient blackbox-type multigrid method is proposed for solving multipoint flux approximations of the Darcy problem on logically rectangular grids. The approach is based on a cell-centered multigrid algorithm, which…

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

In recent publications, the author and his coworkers have shown robust approximation error estimates for B-splines of maximum smoothness and have proposed multigrid methods based on them. These methods allow to solve the linear system…

Numerical simulation of incompressible viscous flow, in particular in three space dimensions, continues to remain a challenging task. Space-time finite element methods feature the natural construction of higher order discretization schemes.…

Many tasks in geometry processing are modeled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh.…