Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The constrained smoother for solving the saddle point system arising from the constrained minimization problem is a relaxation scheme such that the iteration remains in the constrained subspace. A multigrid method using constrained smoothers for saddle point systems is analyzed in this paper. Uniform convergence of two-level and W-cycle multigrid methods, with sufficient many smoothing steps and full regularity assumptions, are obtained for some stable finite element discretization of Stokes equations. For Braess-Sarazin smoother, a convergence theory using only partial regularity assumption is also developed.
['Long Chen']
I am writing a research paper on a idea Multigrid methods for saddle point systems using constrained smoothers
[{"from": "human", "value": "I am writing a research paper on a idea Multigrid methods for saddle point systems using constrained smoothers"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The constrained smoother for solving the saddle point system arising from the constrained minimization problem is a relaxation scheme such that the iteration remains in the constrained subspace. A multigrid method using constrained smoothers for saddle point systems is analyzed in this paper. Uniform convergence of two-level and W-cycle multigrid methods, with sufficient many smoothing steps and full regularity assumptions, are obtained for some stable finite element discretization of Stokes equations. For Braess-Sarazin smoother, a convergence theory using only partial regularity assumption is also developed."}]