2,450 research outputs found

    Two semi-Lagrangian fast methods for Hamilton-Jacobi-Bellman equations

    Full text link
    In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton-Jacobi-Bellman (HJB) equations and we compare the results with an accelerated version of the Fast Sweeping Method (FSM). We find that FIM can be indeed used to solve HJB equations with no relevant modifications with respect to the original algorithm proposed for the eikonal equation, and that it overcomes FSM in many cases. Observing the evolution of the active list of nodes for FIM, we recover another numerical validation of the arguments recently discussed in [Cacace et al., SISC 36 (2014), A570-A587] about the impossibility of creating local single-pass methods for HJB equations

    Finite-Element Discretization of Static Hamilton-Jacobi Equations Based on a Local Variational Principle

    Full text link
    We propose a linear finite-element discretization of Dirichlet problems for static Hamilton-Jacobi equations on unstructured triangulations. The discretization is based on simplified localized Dirichlet problems that are solved by a local variational principle. It generalizes several approaches known in the literature and allows for a simple and transparent convergence theory. In this paper the resulting system of nonlinear equations is solved by an adaptive Gauss-Seidel iteration that is easily implemented and quite effective as a couple of numerical experiments show.Comment: 19 page

    A level-set method for the evolution of cells and tissue during curvature-controlled growth

    Full text link
    Most biological tissues grow by the synthesis of new material close to the tissue's interface, where spatial interactions can exert strong geometric influences on the local rate of growth. These geometric influences may be mechanistic, or cell behavioural in nature. The control of geometry on tissue growth has been evidenced in many in-vivo and in-vitro experiments, including bone remodelling, wound healing, and tissue engineering scaffolds. In this paper, we propose a generalisation of a mathematical model that captures the mechanistic influence of curvature on the joint evolution of cell density and tissue shape during tissue growth. This generalisation allows us to simulate abrupt topological changes such as tissue fragmentation and tissue fusion, as well as three dimensional cases, through a level-set-based method. The level-set method developed introduces another Eulerian field than the level-set function. This additional field represents the surface density of tissue synthesising cells, anticipated at future locations of the interface. Numerical tests performed with this level-set-based method show that numerical conservation of cells is a good indicator of simulation accuracy, particularly when cusps develop in the tissue's interface. We apply this new model to several situations of curvature-controlled tissue evolutions that include fragmentation and fusion.Comment: 15 pages, 10 figures, 3 supplementary figure

    Numerical Simulation of Grain Boundary Grooving By Level Set Method

    Full text link
    A numerical investigation of grain-boundary grooving by means of a Level Set method is carried out. An idealized polygranular interconnect which consists of grains separated by parallel grain boundaries aligned normal to the average orientation of the surface is considered. The surface diffusion is the only physical mechanism assumed. The surface diffusion is driven by surface curvature gradients, and a fixed surface slope and zero atomic flux are assumed at the groove root. The corresponding mathematical system is an initial boundary value problem for a two-dimensional Hamilton-Jacobi type equation. The results obtained are in good agreement with both Mullins' analytical "small slope" solution of the linearized problem (W.W. Mullins, 1957) (for the case of an isolated grain boundary) and with solution for the periodic array of grain boundaries (S.A. Hackney, 1988).Comment: Submitted to the Journal of Computational Physics (19 pages, 8 Postscript figures, 3 tables, 29 references

    Free boundary problems describing two-dimensional pulse recycling and motion in semiconductors

    Full text link
    An asymptotic analysis of the Gunn effect in two-dimensional samples of bulk n-GaAs with circular contacts is presented. A moving pulse far from contacts is approximated by a moving free boundary separating regions where the electric potential solves a Laplace equation with subsidiary boundary conditions. The dynamical condition for the motion of the free boundary is a Hamilton-Jacobi equation. We obtain the exact solution of the free boundary problem (FBP) in simple one-dimensional and axisymmetric geometries. The solution of the FBP is obtained numerically in the general case and compared with the numerical solution of the full system of equations. The agreement is excellent so that the FBP can be adopted as the basis for an asymptotic study of the multi-dimensional Gunn effect.Comment: 19 pages, 9 figures, Revtex. To appear in Phys. Rev.

    Feedback control on the velocity field and source term of a normal flow equation

    Get PDF
    open4openA. Alessandri; P. Bagnerini; M. Gaggero; A. RossiAlessandri, A.; Bagnerini, P.; Gaggero, M.; Rossi, A

    A Topology-Preserving Level Set Method for Shape Optimization

    Full text link
    The classical level set method, which represents the boundary of the unknown geometry as the zero-level set of a function, has been shown to be very effective in solving shape optimization problems. The present work addresses the issue of using a level set representation when there are simple geometrical and topological constraints. We propose a logarithmic barrier penalty which acts to enforce the constraints, leading to an approximate solution to shape design problems.Comment: 10 pages, 4 figure

    An Efficient Algorithm for Automatic Structure Optimization in X-ray Standing-Wave Experiments

    Full text link
    X-ray standing-wave photoemission experiments involving multilayered samples are emerging as unique probes of the buried interfaces that are ubiquitous in current device and materials research. Such data require for their analysis a structure optimization process comparing experiment to theory that is not straightforward. In this work, we present a new computer program for optimizing the analysis of standing-wave data, called SWOPT, that automates this trial-and-error optimization process. The program includes an algorithm that has been developed for computationally expensive problems: so-called black-box simulation optimizations. It also includes a more efficient version of the Yang X-ray Optics Program (YXRO) [Yang, S.-H., Gray, A.X., Kaiser, A.M., Mun, B.S., Sell, B.C., Kortright, J.B., Fadley, C.S., J. Appl. Phys. 113, 1 (2013)] which is about an order of magnitude faster than the original version. Human interaction is not required during optimization. We tested our optimization algorithm on real and hypothetical problems and show that it finds better solutions significantly faster than a random search approach. The total optimization time ranges, depending on the sample structure, from minutes to a few hours on a modern laptop computer, and can be up to 100x faster than a corresponding manual optimization. These speeds make the SWOPT program a valuable tool for realtime analyses of data during synchrotron experiments
    corecore