Iterative scheme for solving optimal transportation problems arising in reflector design (Q469852): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(9 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
Summary: We consider the geometric optics problem of finding a system of two reflectors that transform a spherical wavefront into a beam of parallel rays with prescribed intensity distribution. Using techniques from optimal transportation theory, it has been shown previously that this problem is equivalent to an infinite-dimensional linear programming (LP) problem. Here we investigate techniques for constructing the two reflectors numerically by considering the finite-dimensional LP problems which arise as approximations to the infinite-dimensional problem. A straightforward discretization has the disadvantage that the number of constraints increases rapidly with the mesh size, so only very coarse meshes are practical. To address this well-known issue we propose an iterative solution scheme. In each step, an LP problem is solved, where information from the previous iteration step is used to reduce the number of necessary constraints. As an illustration, we apply our proposed scheme to solve a problem with synthetic data, demonstrating that the method allows for much finer meshes than a simple discretization. We also give evidence that the scheme converges. There exists a growing literature for the application of optimal transportation theory to other beam shaping problems, and our proposed scheme is easy to adapt for these problems as well. | |||
Property / review text: Summary: We consider the geometric optics problem of finding a system of two reflectors that transform a spherical wavefront into a beam of parallel rays with prescribed intensity distribution. Using techniques from optimal transportation theory, it has been shown previously that this problem is equivalent to an infinite-dimensional linear programming (LP) problem. Here we investigate techniques for constructing the two reflectors numerically by considering the finite-dimensional LP problems which arise as approximations to the infinite-dimensional problem. A straightforward discretization has the disadvantage that the number of constraints increases rapidly with the mesh size, so only very coarse meshes are practical. To address this well-known issue we propose an iterative solution scheme. In each step, an LP problem is solved, where information from the previous iteration step is used to reduce the number of necessary constraints. As an illustration, we apply our proposed scheme to solve a problem with synthetic data, demonstrating that the method allows for much finer meshes than a simple discretization. We also give evidence that the scheme converges. There exists a growing literature for the application of optimal transportation theory to other beam shaping problems, and our proposed scheme is easy to adapt for these problems as well. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 78M25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B06 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6368314 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58997882 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Matlab / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Mosek / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: DistMesh / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001499476 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1110.3061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A rigorous analysis using optimal transport theory for a two-reflector design problem with a point source / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polar factorization and monotone rearrangement of vector‐valued functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871557 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4870788 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Transport / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optical design of two-reflector systems, the Monge-Kantorovich mass transfer problem and Fermat's principle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4812161 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the design of a reflector antenna. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Designing freeform lenses for intensity and phase control of coherent light with help from geometry and mass transport / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Numerical Method for the Solution of the $L_2$ Optimal Mass Transfer Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimal robust equidistribution method for two-dimensional grid adaptation based on Monge-Kantorovich optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spline element method for Monge-Ampère equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Robust, multidimensional mesh-motion based on Monge-Kantorovich equidistribution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two Numerical Methods for the elliptic Monge-Ampère equation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast finite difference solvers for singular solutions of the elliptic Monge-Ampère equation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Monge-Ampère equation: various forms and numerical solution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the numerical solution of the equation \(\frac{\partial ^ 2z\partial ^ 2z}{\partial x^ 2\partial y^ 2}-(\frac{\partial ^ 2z}{\partial x\partial y})^ 2=f\) and its discretizations. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Mixed Formulation of the Monge-Kantorovich Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical and analytical results for the transportation problem of Monge-Kantorovich / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the design of a reflector antenna / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An encyclopaedia of cubature formulas. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Simple Mesh Generator in MATLAB / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:20, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iterative scheme for solving optimal transportation problems arising in reflector design |
scientific article |
Statements
Iterative scheme for solving optimal transportation problems arising in reflector design (English)
0 references
11 November 2014
0 references
Summary: We consider the geometric optics problem of finding a system of two reflectors that transform a spherical wavefront into a beam of parallel rays with prescribed intensity distribution. Using techniques from optimal transportation theory, it has been shown previously that this problem is equivalent to an infinite-dimensional linear programming (LP) problem. Here we investigate techniques for constructing the two reflectors numerically by considering the finite-dimensional LP problems which arise as approximations to the infinite-dimensional problem. A straightforward discretization has the disadvantage that the number of constraints increases rapidly with the mesh size, so only very coarse meshes are practical. To address this well-known issue we propose an iterative solution scheme. In each step, an LP problem is solved, where information from the previous iteration step is used to reduce the number of necessary constraints. As an illustration, we apply our proposed scheme to solve a problem with synthetic data, demonstrating that the method allows for much finer meshes than a simple discretization. We also give evidence that the scheme converges. There exists a growing literature for the application of optimal transportation theory to other beam shaping problems, and our proposed scheme is easy to adapt for these problems as well.
0 references
0 references
0 references
0 references
0 references
0 references
0 references