Designing Illumination Lenses and Mirrors by the Numerical Solution of Monge-Amp\`ere Equations

We consider the inverse refractor and the inverse reflector problem. The task is to design a free-form lens or a free-form mirror that, when illuminated by a point light source, produces a given illumination pattern on a target. Both problems can be modeled by strongly nonlinear second-order partial differential equations of Monge-Amp\`ere type. In [Math. Models Methods Appl. Sci. 25 (2015), pp. 803--837, DOI: 10.1142/S0218202515500190] the authors have proposed a B-spline collocation method which has been applied to the inverse reflector problem. Now this approach is extended to the inverse refractor problem. We explain in depth the collocation method and how to handle boundary conditions and constraints. The paper concludes with numerical results of refracting and reflecting optical surfaces and their verification via ray tracing.Comment: 16 pages, 6 figures, 2 tables; Keywords: Inverse refractor problem, inverse reflector problem, elliptic Monge-Amp\`ere equation, B-spline collocation method, Picard-type iteration; OCIS: 000.4430, 080.1753, 080.4225, 080.4228, 080.4298, 100.3190. Minor revision: two typos have been corrected and copyright note has been adde

Solving the Klein-Gordon equation using Fourier spectral methods: A benchmark test for computer performance

The cubic Klein-Gordon equation is a simple but non-trivial partial differential equation whose numerical solution has the main building blocks required for the solution of many other partial differential equations. In this study, the library 2DECOMP&FFT is used in a Fourier spectral scheme to solve the Klein-Gordon equation and strong scaling of the code is examined on thirteen different machines for a problem size of 512^3. The results are useful in assessing likely performance of other parallel fast Fourier transform based programs for solving partial differential equations. The problem is chosen to be large enough to solve on a workstation, yet also of interest to solve quickly on a supercomputer, in particular for parametric studies. Unlike other high performance computing benchmarks, for this problem size, the time to solution will not be improved by simply building a bigger supercomputer.Comment: 10 page

An approximating method for the stabilizing solution of the Hamilton-Jacobi equation for integrable systems using Hamiltonian perturbation theory

In this report, a method for approximating the stabilizing solution of the Hamilton-Jacobi equation for integrable systems is proposed using symplectic geometry and a Hamiltonian perturbation technique. Using the fact that the Hamiltonian lifted system of an integrable system is also integrable, the Hamiltonian system (canonical equation) that is derived from the theory of 1-st order partial differential equations is considered as an integrable Hamiltonian system with a perturbation caused by control. Assuming that the approximating Riccati equation from the Hamilton-Jacobi equation at the origin has a stabilizing solution, we construct approximating behaviors of the Hamiltonian flows on a stable Lagrangian submanifold, from which an approximation to the stabilizing solution is obtained