1,293 research outputs found

    Convergence analysis of domain decomposition based time integrators for degenerate parabolic equations

    Full text link
    Domain decomposition based time integrators allow the usage of parallel and distributed hardware, making them well-suited for the temporal discretization of parabolic systems, in general, and degenerate parabolic problems, in particular. The latter is due to the degenerate equations' finite speed of propagation. In this study, a rigours convergence analysis is given for such integrators without assuming any restrictive regularity on the solutions or the domains. The analysis is conducted by first deriving a new variational framework for the domain decomposition, which is applicable to the two standard degenerate examples. That is, the pp-Laplace and the porous medium type vector fields. Secondly, the decomposed vector fields are restricted to the underlying pivot space and the time integration of the parabolic problem can then be interpreted as an operators splitting applied to a dissipative evolution equation. The convergence results then follow by employing elements of the approximation theory for nonlinear semigroups

    Phase field modeling and computer implementation: A review

    Full text link
    This paper presents an overview of the theories and computer implementation aspects of phase field models (PFM) of fracture. The advantage of PFM over discontinuous approaches to fracture is that PFM can elegantly simulate complicated fracture processes including fracture initiation, propagation, coalescence, and branching by using only a scalar field, the phase field. In addition, fracture is a natural outcome of the simulation and obtained through the solution of an additional differential equation related to the phase field. No extra fracture criteria are needed and an explicit representation of a crack surface as well as complex track crack procedures are avoided in PFM for fracture, which in turn dramatically facilitates the implementation. The PFM is thermodynamically consistent and can be easily extended to multi-physics problem by 'changing' the energy functional accordingly. Besides an overview of different PFMs, we also present comparative numerical benchmark examples to show the capability of PFMs

    High order spatial discretization for variational time implicit schemes: Wasserstein gradient flows and reaction-diffusion systems

    Full text link
    We design and compute first-order implicit-in-time variational schemes with high-order spatial discretization for initial value gradient flows in generalized optimal transport metric spaces. We first review some examples of gradient flows in generalized optimal transport spaces from the Onsager principle. We then use a one-step time relaxation optimization problem for time-implicit schemes, namely generalized Jordan-Kinderlehrer-Otto schemes. Their minimizing systems satisfy implicit-in-time schemes for initial value gradient flows with first-order time accuracy. We adopt the first-order optimization scheme ALG2 (Augmented Lagrangian method) and high-order finite element methods in spatial discretization to compute the one-step optimization problem. This allows us to derive the implicit-in-time update of initial value gradient flows iteratively. We remark that the iteration in ALG2 has a simple-to-implement point-wise update based on optimal transport and Onsager's activation functions. The proposed method is unconditionally stable for convex cases. Numerical examples are presented to demonstrate the effectiveness of the methods in two-dimensional PDEs, including Wasserstein gradient flows, Fisher--Kolmogorov-Petrovskii-Piskunov equation, and two and four species reversible reaction-diffusion systems

    Convergence of iterative methods based on Neumann series for composite materials: theory and practice

    Full text link
    Iterative Fast Fourier Transform methods are useful for calculating the fields in composite materials and their macroscopic response. By iterating back and forth until convergence, the differential constraints are satisfied in Fourier space, and the constitutive law in real space. The methods correspond to series expansions of appropriate operators and to series expansions for the effective tensor as a function of the component moduli. It is shown that the singularity structure of this function can shed much light on the convergence properties of the iterative Fast Fourier Transform methods. We look at a model example of a square array of conducting square inclusions for which there is an exact formula for the effective conductivity (Obnosov). Theoretically some of the methods converge when the inclusions have zero or even negative conductivity. However, the numerics do not always confirm this extended range of convergence and show that accuracy is lost after relatively few iterations. There is little point in iterating beyond this. Accuracy improves when the grid size is reduced, showing that the discrepancy is linked to the discretization. Finally, it is shown that none of the three iterative schemes investigated over-performs the others for all possible microstructures and all contrasts.Comment: 41 pages, 14 figures, 1 tabl

    A review of nonlinear FFT-based computational homogenization methods

    Get PDF
    Since their inception, computational homogenization methods based on the fast Fourier transform (FFT) have grown in popularity, establishing themselves as a powerful tool applicable to complex, digitized microstructures. At the same time, the understanding of the underlying principles has grown, in terms of both discretization schemes and solution methods, leading to improvements of the original approach and extending the applications. This article provides a condensed overview of results scattered throughout the literature and guides the reader to the current state of the art in nonlinear computational homogenization methods using the fast Fourier transform
    • …
    corecore