Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Note on Algebraic Multigrid Methods for the Discrete Weighted Laplacian
100
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In recent contributions, algebraic multigrid methods have been designed and studied from the viewpoint of the spectral complementarity. In this note we focus our efforts on specific applications and, more precisely, on large linear systems arising from the approximation of weighted Laplacian with various boundary conditions. We adapt the multigrid idea to this specific setting and we present and critically discuss a wide numerical experimentation showing the potentiality of the considered approach.
rate research
Read More
Based on current trends in computer architectures, faster compute speeds must come from increased parallelism rather than increased clock speeds, which are currently stagnate. This situation has created the well-known bottleneck for sequential time-integration, where each individual time-value (i.e., time-step) is computed sequentially. One approach to alleviate this and achieve parallelism in time is with multigrid. In this work, we consider multigrid-reduction-in-time (MGRIT), a multilevel method applied to the time dimension that computes multiple time-steps in parallel. Like all multigrid methods, MGRIT relies on the complementary relationship between relaxation on a fine-grid and a correction from the coarse grid to solve the problem. All current MGRIT implementations are based on unweighted-Jacobi relaxation; here we introduce the concept of weighted relaxation to MGRIT. We derive new convergence bounds for weighted relaxation, and use this analysis to guide the selection of relaxation weights. Numerical results then demonstrate that non-unitary relaxation weights consistently yield faster convergence rates and lower iteration counts for MGRIT when compared with unweighted relaxation. In most cases, weighted relaxation yields a 10%-20% saving in iterations. For A-stable integration schemes, results also illustrate that under-relaxation can restore convergence in some cases where unweighted relaxation is not convergent.
We propose some multigrid methods for solving the algebraic systems resulting from finite element approximations of space fractional partial differential equations (SFPDEs). It is shown that our multigrid methods are optimal, which means the convergence rates of the methods are independent of the mesh size and mesh level. Moreover, our theoretical analysis and convergence results do not require regularity assumptions of the model problems. Numerical results are given to support our theoretical findings.
Subspace recycling iterative methods and other subspace augmentation schemes are a successful extension to Krylov subspace methods in which a Krylov subspace is augmented with a fixed subspace spanned by vectors deemed to be helpful in accelerating convergence or conveying knowledge of the solution. Recently, a survey was published, in which a framework describing the vast majority of such methods was proposed [Soodhalter et al, GAMM-Mitt. 2020]. In many of these methods, the Krylov subspace is one generated by the system matrix composed with a projector that depends on the augmentation space. However, it is not a requirement that a projected Krylov subspace be used. There are augmentation methods built on using Krylov subspaces generated by the original system matrix, and these methods also fit into the general framework. In this note, we observe that one gains implementation benefits by considering such augmentation methods with unprojected Krylov subspaces in the general framework. We demonstrate this by applying the idea to the R$^3$GMRES method proposed in [Dong et al. ETNA 2014] to obtain a simplified implementation and to connect that algorithm to early augmentation schemes based on flexible preconditioning [Saad. SIMAX 1997].
The paper focuses on developing and studying efficient block preconditioners based on classical algebraic multigrid for the large-scale sparse linear systems arising from the fully coupled and implicitly cell-centered finite volume discretization of multi-group radiation diffusion equations, whose coefficient matrices can be rearranged into the $(G+2)times(G+2)$ block form, where $G$ is the number of energy groups. The preconditioning techniques are based on the monolithic classical algebraic multigrid method, physical-variable based coarsening two-level algorithm and two types of block Schur complement preconditioners. The classical algebraic multigrid is applied to solve the subsystems that arise in the last three block preconditioners. The coupling strength and diagonal dominance are further explored to improve performance. We use representative one-group and twenty-group linear systems from capsule implosion simulations to test the robustness, efficiency, strong and weak parallel scaling properties of the proposed methods. Numerical results demonstrate that block preconditioners lead to mesh- and problem-independent convergence, and scale well both algorithmically and in parallel.
The convergence rate of a multigrid method depends on the properties of the smoother and the so-called grid transfer operator. In this paper we define and analyze new grid transfer operators with a generic cutting size which are applicable for high order problems. We enlarge the class of available geometric grid transfer operators by relating the symbol analysis of the coarse grid correction with the approximation properties of univariate subdivision schemes. We show that the polynomial generation property and stability of a subdivision scheme are crucial for convergence and optimality of the corresponding multigrid method. We construct a new class of grid transfer operators from primal binary and ternary pseudo-spline symbols. Our numerical results illustrate the behavior of the new grid transfer operators.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
