Final report on the Copper Mountain conference on multigrid methods

The Copper Mountain Conference on Multigrid Methods was held on April 6-11, 1997. It took the same format used in the previous Copper Mountain Conferences on Multigrid Method conferences. Over 87 mathematicians from all over the world attended the meeting. 56 half-hour talks on current research topics were presented. Talks with similar content were organized into sessions. Session topics included: fluids; domain decomposition; iterative methods; basics; adaptive methods; non-linear filtering; CFD; applications; transport; algebraic solvers; supercomputing; and student paper winners

Seventh Copper Mountain Conference on Multigrid Methods

The Seventh Copper Mountain Conference on Multigrid Methods was held on 2-7 Apr. 1995 at Copper Mountain, Colorado. This book is a collection of many of the papers presented at the conference and so represents the conference proceedings. NASA Langley graciously provided printing of this document so that all of the papers could be presented in a single forum. Each paper was reviewed by a member of the conference organizing committee under the coordination of the editors. The multigrid discipline continues to expand and mature, as is evident from these proceedings. The vibrancy in this field is amply expressed in these important papers, and the collection shows its rapid trend to further diversity and depth

hphp-adaptation driven by polynomial-degree-robust a posteriori error estimates for elliptic problems

International audienceWe devise and study experimentally adaptive strategies driven by a posteriori error estimates to select automatically both the space mesh and the polynomial degree in the numerical approximation of diffusion equations in two space dimensions. The adaptation is based on equilibrated flux estimates. These estimates are presented here for inhomogeneous Dirichlet and Neumann boundary conditions, for spatially-varying polynomial degree, and for mixed rectangular-triangular grids possibly containing hanging nodes. They deliver a global error upper bound with constant one and, up to data oscillation, error lower bounds on element patches with a generic constant only dependent on the mesh regularity and with a computable bound. We numerically asses the estimates and several hp-adaptive strategies using the interior penalty discontinuous Galerkin method. Asymptotic exactness is observed for all the symmetric, nonsymmetric (odd degrees), and incomplete variants on non-nested unstructured triangular grids for a smooth solution and uniform refinement. Exponential convergence rates are reported on nonmatching triangular grids for the incomplete version on several benchmarks with a singular solution and adaptive refinement

Lectures on Computational Numerical Analysis of Partial Differential Equations

From Chapter 1: The purpose of these lectures is to present a set of straightforward numerical methods with applicability to essentially any problem associated with a partial differential equation (PDE) or system of PDEs independent of type, spatial dimension or form of nonlinearity.https://uknowledge.uky.edu/me_textbooks/1002/thumbnail.jp

The Sixth Copper Mountain Conference on Multigrid Methods, part 1

The Sixth Copper Mountain Conference on Multigrid Methods was held on 4-9 Apr. 1993, at Copper Mountain, CO. This book is a collection of many of the papers presented at the conference and as such represents the conference proceedings. NASA LaRC graciously provided printing of this document so that all of the papers could be presented in a single forum. Each paper was reviewed by a member of the conference organizing committee under the coordination of the editors. The multigrid discipline continues to expand and mature, as is evident from these proceedings. The vibrancy in this field is amply expressed in these important papers, and the collection clearly shows its rapid trend to further diversity and depth

Positivity-preserving, energy stable numerical schemes for the Cahn-Hilliard equation with logarithmic potential

We present and analyze finite difference numerical schemes for the Allen Cahn/Cahn-Hilliard equation with a logarithmic Flory Huggins energy potential. Both the first order and second order accurate temporal algorithms are considered. In the first order scheme, we treat the nonlinear logarithmic terms and the surface diffusion term implicitly, and update the linear expansive term and the mobility explicitly. We provide a theoretical justification that, this numerical algorithm has a unique solution such that the positivity is always preserved for the logarithmic arguments. In particular, our analysis reveals a subtle fact: the singular nature of the logarithmic term around the values of $-1$ and 1 prevents the numerical solution reaching these singular values, so that the numerical scheme is always well-defined as long as the numerical solution stays similarly bounded at the previous time step. Furthermore, an unconditional energy stability of the numerical scheme is derived, without any restriction for the time step size. The unique solvability and the positivity-preserving property for the second order scheme are proved using similar ideas, in which the singular nature of the logarithmic term plays an essential role. For both the first and second order accurate schemes, we are able to derive an optimal rate convergence analysis, which gives the full order error estimate. The case with a non-constant mobility is analyzed as well. We also describe a practical and efficient multigrid solver for the proposed numerical schemes, and present some numerical results, which demonstrate the robustness of the numerical schemes

Linearly Preconditioned Nonlinear Solvers for Phase Field Equations Involving p-Laplacian Terms

Phase field models are usually constructed to model certain interfacial dynamics. Numerical simulations of phase-field models require long time accuracy, stability and therefore it is necessary to develop efficient and highly accurate numerical methods. In particular, the unconditionally energy stable , unconditionally solvable, and accurate schemes and fast solvers are desirable. In this thesis, We describe and analyze preconditioned steepest descent (PSD) solvers for fourth and sixth-order nonlinear elliptic equations that include p-Laplacian terms on periodic domains in 2 and 3 dimensions. Such nonlinear elliptic equations often arise from time discretization of parabolic equations that model various biological and physical phenomena, in particular, liquid crystals, thin film epitaxial growth and phase transformations. The analyses of the schemes involve the characterization of the strictly convex energies associated with the equations. We first give a general framework for PSD in Hilbert spaces. Based on certain reasonable assumptions of the linear pre-conditioner, a geometric convergence rate is shown for the nonlinear PSD iteration. We then apply the general theory to the fourth and sixth-order problems of interest, making use of Sobolev embedding and regularity results to confirm the appropriateness of our pre-conditioners for the regularized p-Lapacian problems. The results include a sharper theoretical convergence result for p-Laplacian systems compared to what may be found in existing works. We demonstrate rigorously how to apply the theory in the finite dimensional setting using finite difference discretization methods. Based on the PSD framework, we also proposed two efficient and practical Preconditioned Nonlinear Conjugate Gradient (PNCG) solvers. The main idea of the preconditioned solvers is to use a linearized version of the nonlinear operator as a metric for choosing the initial search direction. And the hybrid conjugate directions as the following search direction. In order to make the proposed solvers and scheme much more practical, we also investigate an adaptive time stepping strategy for time dependent problems. Numerical simulations for some important physical application problems – including thin film epitaxy with slope selection, the square phase field crystal model and functionalized Cahn-Hilliard equation – are carried out to verify the efficiency of the schemes and solvers