Refine
Language
- English (5)
Keywords
- Cahn-Larche system (1)
- Schur-Newton multigrid (1)
- a posteriori error estimation (1)
- adaptive finite elements (1)
- finite elements (1)
- multigrid (1)
- phase field (1)
- phase separation (1)
- phase transitions (1)
- stability (1)
We present a new inexact nonsmooth Newton method for the solution
of convex minimization problems with piecewise smooth, pointwise
nonlinearities. The algorithm consists of a nonlinear smoothing
step on the fine level and a linear coarse correction.
Suitable postprocessing guarantees global convergence
even in the case of a single multigrid step for each linear subproblem.
Numerical examples show that the overall efficiency
is comparable to multigrid for similar linear problems.
{We suggest hierarchical a posteriori error estimators for time-discretized
Allen-Cahn and Cahn-Hilliard equations with logarithmic potential and investigate
their robustness numerically.
We observe that the associated effectivity ratios seem to saturate for decreasing mesh size
and are almost independent of the temperature.
We consider anisotropic Allen--Cahn equations with interfacial energy
induced by an anisotropic surface energy density $\gamma$.
Assuming that $\gamma$
is positive, positively homogeneous of degree one,
strictly convex in tangential directions to the unit sphere,
and sufficiently smooth, we show stability of
various time discretizations. In particular,
we consider a fully implicit and a linearized time discretization
of the interfacial energy combined with implicit
and semi-implicit time discretizations
of the double-well potential. In the semi-implicit variant,
concave terms are taken explicitly.
The arising discrete spatial problems are solved by
globally convergent truncated nonsmooth Newton multigrid methods.
Numerical experiments show the accuracy of the different
discretizations.
We also illustrate that pinch-off under anisotropic
mean curvature flow is no longer frame invariant,
but depends on the orientation of the initial configuration.
We introduce nonsmooth Schur-Newton methods for the solution of the nonlinear discrete saddle-point problems arising from discretized vector-valued Cahn-Hilliard equations with logarithmic and obstacle potentials. The discrete problems are obtained by semi-implicit discretization in time and a first order finite element discretization in space. We incorporate the linear constraints that enforce solutions to stay on the Gibbs simplex using Lagrangian multipliers and prove existence of these multipliers under the assumption of a non-trivial initial condition for the order parameters.
Coarsening in solder alloys is a widely accepted indicator for
possible failure of joints in electronic devices.
Based on the well-established Cahn--Larch\'e model
with logarithmic chemical energy density (see, e.g., Dreyer and Mueller 2001),
we present a numerical environment for the efficient
and reliable simulation of coarsening in binary alloys.
Main features are adaptive mesh refinement based on hierarchical error estimates,
fast and reliable algebraic solution by multigrid and Schur--Newton multigrid methods,
and the quantification of the coarsening speed by the temporal growth of mean phase radii.
We provide a detailed description and a numerical assessment of the algorithm and its different components,
together with a practical application to a eutectic AgCu brazing alloy.