96 research outputs found

    Mesh adaptation on the sphere using optimal transport and the numerical solution of a Monge-Ampère type equation

    Get PDF
    An equation of Monge-Ampère type has, for the first time, been solved numerically on the surface of the sphere in order to generate optimally transported (OT) meshes, equidistributed with respect to a monitor function. Optimal transport generates meshes that keep the same connectivity as the original mesh, making them suitable for r-adaptive simulations, in which the equations of motion can be solved in a moving frame of reference in order to avoid mapping the solution between old and new meshes and to avoid load balancing problems on parallel computers. The semi-implicit solution of the Monge-Ampère type equation involves a new linearisation of the Hessian term, and exponential maps are used to map from old to new meshes on the sphere. The determinant of the Hessian is evaluated as the change in volume between old and new mesh cells, rather than using numerical approximations to the gradients. OT meshes are generated to compare with centroidal Voronoi tesselations on the sphere and are found to have advantages and disadvantages; OT equidistribution is more accurate, the number of iterations to convergence is independent of the mesh size, face skewness is reduced and the connectivity does not change. However anisotropy is higher and the OT meshes are non-orthogonal. It is shown that optimal transport on the sphere leads to meshes that do not tangle. However, tangling can be introduced by numerical errors in calculating the gradient of the mesh potential. Methods for alleviating this problem are explored. Finally, OT meshes are generated using observed precipitation as a monitor function, in order to demonstrate the potential power of the technique

    Monge-Ampère problems with non-quadratic cost function : application to freeform optics

    Get PDF

    Computation of double freeform optical surfaces using a Monge–Ampère solver: Application to beam shaping

    Get PDF
    In this article, we present a formulation for the design of double freeform lens surfaces to control the intensity distribution of a laser beam with plane wavefronts. Double freefrom surfaces are utilized to shape collimated beams. Two different layouts of the freeform lens optical system are introduced, i.e., a single lens with double freeform surfaces, and two separate lenses with two flat and two freeform surfaces. The freeform lens design problem can be formulated as a Monge–Ampère type differential equation with transport boundary condition, expressing conservation of energy combined with the law of refraction and the constraint imposed on the optical path length between source and target planes. Numerical solutions are computed using a generalized least-squares algorithm which is presented by Yadav et al. (2018). The algorithm is capable to compute two solutions of the Monge–Ampère boundary value problem, corresponding to either c-convex or c-concave freeform surfaces for both layouts. The freeform surfaces are validated for several numerical examples using a ray-tracer based on Quasi-Monte Carlo simulation.</p

    Discretization of the 3D Monge-Ampere operator, between Wide Stencils and Power Diagrams

    Get PDF
    We introduce a monotone (degenerate elliptic) discretization of the Monge-Ampere operator, on domains discretized on cartesian grids. The scheme is consistent provided the solution hessian condition number is uniformly bounded. Our approach enjoys the simplicity of the Wide Stencil method, but significantly improves its accuracy using ideas from discretizations of optimal transport based on power diagrams. We establish the global convergence of a damped Newton solver for the discrete system of equations. Numerical experiments, in three dimensions, illustrate the scheme efficiency

    Light in Power: A General and Parameter-free Algorithm for Caustic Design

    Get PDF
    We present in this paper a generic and parameter-free algorithm to efficiently build a wide variety of optical components, such as mirrors or lenses, that satisfy some light energy constraints. In all of our problems, one is given a collimated or point light source and a desired illumination after reflection or refraction and the goal is to design the geometry of a mirror or lens which transports exactly the light emitted by the source onto the target. We first propose a general framework and show that eight different optical component design problems amount to solving a light energy conservation equation that involves the computation of visibility diagrams. We then show that these diagrams all have the same structure and can be obtained by intersecting a 3D Power diagram with a planar or spherical domain. This allows us to propose an efficient and fully generic algorithm capable to solve these eight optical component design problems. The support of the prescribed target illumination can be a set of directions or a set of points located at a finite distance. Our solutions satisfy design constraints such as convexity or concavity. We show the effectiveness of our algorithm on simulated and fabricated examples

    Eigenvalue problems for fully nonlinear elliptic partial differential equations with transport boundary conditions

    Get PDF
    Fully nonlinear elliptic partial differential equations (PDEs) arise in a number of applications. From mathematical finance to astrophysics, there is a great deal of interest in solving them. Eigenvalue problems for fully nonlinear PDEs with transport boundary conditions are of particular interest as alternative formulations of PDEs that require data to satisfy a solvability condition, which may not be known explicitly or may be polluted by noisy data. Nevertheless, these have not yet been well-explored in the literature. In this dissertation, a convergence framework for numerically solving eigenvalue problems for fully nonlinear PDEs is introduced. In addition, existing two-dimensional methods for nonlinear equations are extended to handle transport boundary conditions and eigenvalue problems. Finally, new techniques are designed to enable appropriate discretization of a large range of fully nonlinear three-dimensional equations
    • …
    corecore