An approach to solving systems of equations by projecting the problem from a fine scale representation onto a coarser one. A coarse representation generally has fewer unknowns, making it faster to solve than the original problem. The coarse solution can then be projected back onto the finer ...

learn more… | top users | synonyms

2
votes
2answers
70 views

Infinite Function Value on Dirichlet Boundary

I have been working on a multigrid solution to a non-homogeneous Dirichlet boundary value problem. However, the function goes to infinity on the boundary. This causes numerical overflow errors to be ...
0
votes
2answers
85 views

How to determine the number of c points in algebraic multi grid

I am trying to write an algebraic multi-grid solver (in c++). At a given level I determine which nodes are c-points and which nodes are f-points (where the total number of c and f points equals the ...
8
votes
2answers
730 views

Is the Thomas algorithm the fastest way to solve a symmetric diagonally dominant sparse tridiagonal linear system

I am wondering if the Thomas algorithm is the fastest way (provably?) to solve a symmetric diagonally dominate sparse tridiagonal system in terms of algorithmic complexity (not looking for ...
4
votes
1answer
124 views

Multigrid stops converging when more grid levels are used

I'm having a problem with multigrid code I wrote. If I solve Laplace's equation in 2D and use more than 5 grid levels, the V-cycles stop converging after a few cycles (see below, convergence factor > ...
0
votes
1answer
141 views

What libraries provide an implementation of multigrid?

I am working on numerical method of Multigrid. What's the available implementation(solver) (actually used in scientific computation) of multigrid method?
3
votes
1answer
150 views

Linear Algebra / Numerical Solution Of Matrix With Nullspace

I have a question relating to linear algebra. We have a fluid solver that solves the poisson equation for pressures. When there are areas of the domain that are entirely enclosed by Neumann ...
3
votes
2answers
197 views

Full Multigrid Performance for Poisson's equation using Higher Order Compact scheme as a Gauss Seidel smoother

I have a question regarding the FMG (Full Multi Grid) performance while computing Poisson's equation using Higher Order Compact discretization. I am using a sixth order compact scheme to discretize ...
5
votes
0answers
76 views

Full Multigrid Prolongation Operator

I am looking into full multigrid, FMG, and several sources, including these slides, that a lot of people are referring to, state that the prolongation operator used in FMG the first time you visit a ...
8
votes
3answers
179 views

FAS-multigrid slower than linear defect correction?

I have implemented a V-Cycle multigrid solver using both a linear defect correction (LDC) and full approximation scheme (FAS). My problem is the following: Using LDC the residual is reduced by a ...
5
votes
1answer
104 views

How to perform multigrid technique when relaxation methods don't converge?

It is well known that, when a system of linear equations is obtained from discretization of partial differential equation, the solution process can be accelerate significantly by multigrid technique. ...
3
votes
1answer
80 views

explicitly forming coarse matrices with polynomial smoothing AMG

I've been reading about the algebraic multigrid algorithm and came across polynomial smoothers in this paper. It's my understanding that usually the coarse-level matrices $A_H = I_h^HA_hI_H^h$ are ...
0
votes
1answer
44 views

Clarification on interpolation equalities given by Briggs

Briggs, "A Multigrid Tutorial" (pg. 35) has the following expressed as 2-D interpolation: \begin{align*} v^h_{2i,2j} &= v_{i,j}^{2h}\\ v^h_{2i+1,2j} &= 0.5\cdot(v_{i,j}^{2h} + ...
2
votes
1answer
277 views

Prolongation/Restriction Operator in Multigrid

In Multigrid, using Poisson's equation, does the equality below always hold regardless of what type of boundary conditions you use? $$ R= c\cdot I^T, \text{ for some constant }c $$ where $R$ and $I$ ...
5
votes
1answer
114 views

Periodic BC for Multigrid in MD

I know that this question might be very specific and maybe nobody will know the answer, but this is probably the only community where I could find an answer: So, as part of my master's project, I am ...
4
votes
2answers
152 views

I'm having trouble debugging multigrid. What to do?

I've spent far too much time coding and debugging multigrid. While I clearly can't post all of my code as it would be silly to ask someone to go through all that code, is there anything I should pay ...
3
votes
1answer
256 views

restriction and interpolation in multigrid method

I need detailed explanation of the formula below A2=I1*A1*I2 I suppose this formula computes matrix A2 on a coarse grid and here A1 is original matrix on fine ...
10
votes
3answers
586 views

multigrid method to solve PDE

I need simple explanation of the Multigrid Method or some literature about this. I am familiar with iterational methods including BiCGStab,CG,GS,Jacobi and preconditioning, but I am a beginner with ...
2
votes
1answer
425 views

Full Multigrid convergence is too slow. What could possibly be causing it?

I've coded full multigrid in Matlab and it doesn't seem to be converging fast enough. When I increase the number of grids or the number of iterations, it converges to the analytical solution. But FMG ...
10
votes
1answer
310 views

How exactly does the *full* multigrid algorithm run?

So I understand (or at least I believe I do) how a V-cycle runs. I've written in Matlab the 1-D, recursive version of a V-cycle. However, when I ran my code for FMG, my solution wasn't converging. I ...
5
votes
2answers
266 views

How to use grid sizes that are not powers of two in Geometric Multigrid

I am trying to solving a poisson equation in structured grid with Geometric Multigrid method. However, when coarsening the fine grid, I simply double the grid spacing at each successive level. That ...
6
votes
1answer
152 views

Question about the smoothing operators in multigrid methods for nonlinear PDEs

Suppose we are dealing with a nonlinear problem, say $$ A u := L u + G(u) = f $$ the nonlinearity of the operator $A$ is the polynomial type, ie, $L$ is a linear operator, and $G(u) = u^k$, or ...
6
votes
4answers
2k views

Algebraic Multigrid Code

I would like to understand more details about the implementation of Algebraic Multigrid Methods (AMG). I have been reading "A Multigrid Tutorial", which is quite good and explain all the details of ...
10
votes
1answer
489 views

Can a Krylov subspace method be used as a smoother for multigrid?

As far as I am aware, multigrid solvers use iterative smoothers such as Jacobi, Gauss-Seidel, and SOR to dampen the error at various frequencies. Could a Krylov subspace method (like conjugate ...
8
votes
3answers
1k views

How to construct a prolongation and restriction operator for an algebraic multigrid solver?

I am trying to solve a linear system of equations that is sparse, but lacks any kind of banded structure. I have heard that there is a way to extend the principles of a multigrid solver for implicit ...
8
votes
1answer
599 views

How can one parallelize a multigrid method for solving a linear system of equations?

As I understand it, the multigrid method solves a linear system by solving a coarser version of the same problem (there by eliminating low frequency error) then projecting back to the fine grid to ...
9
votes
5answers
1k views

What is the advantage of multigrid over domain decomposition preconditioners, and vice versa?

This is mostly aimed for elliptic PDEs over convex domains, so that I can get a good overview of the two methods.
15
votes
2answers
755 views

Which libraries have good high-level support for multigrid?

I'm planning to use multigrid to calulate some eigenvalues and vectors, and I noticed PETSc has high-level support for multigrid. The PETSc documentation says that this part of PETSc should not be ...
8
votes
3answers
193 views

In what application cases are additive preconditioning schemes superior to multiplicative ones?

In both domain decomposition (DD) and multigrid (MG) methods, one may compose the application of the block updates or coarse corrections as either additive or multiplicative. For pointwise solvers, ...
6
votes
1answer
141 views

Is multigrid useful for finding all eigenvalues and eigenvectors of a differential equation, or only the lowest eigenvalues?

I've been considering using a multigrid method to calculate the eigenvalues of a particular PDE. I know that multigrid is extremely good at finding the least eigenvalues and their associated ...
11
votes
1answer
272 views

Is there a multigrid algorithm that solves Neumann problems and has a convergence rate independent of the number of levels?

Multigrid methods usually solve Dirichlet problems on levels (e.g. point Jacobi or Gauss-Seidel). When using continuous finite element methods, it is much less expensive to assemble small Neumann ...