2007
DOI: 10.1364/ao.46.008385
|View full text |Cite
|
Sign up to set email alerts
|

Network search method in the design of extreme ultraviolet lithographic objectives

Abstract: The merit function space of mirror system for extreme ultraviolet (EUV) lithography is studied. Local minima situated in the multidimensional optical merit function space are connected via links that contain saddle points and form a network. We present networks for EUV lithographic objective designs and discuss how these networks change when control parameters, such as aperture and field, are varied, and constraints are used to limit the variation domain of the variables. A good solution in a network, obtained… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
18
0

Year Published

2008
2008
2015
2015

Publication Types

Select...
5
3

Relationship

6
2

Authors

Journals

citations
Cited by 17 publications
(18 citation statements)
references
References 20 publications
0
18
0
Order By: Relevance
“…the 2nd curvature as variable, then during computation we temporarily have 2 c c c = ± Δ and 3 c c = which then violates the paraxial constraint. However, the violation of the paraxial constraint during the computation of the derivative can be avoided by performing at the same time a compensating change of the curvature of the reference surface 1 c c c = ± Δ that restores K tot .…”
Section: Saddle-point Constructionmentioning
confidence: 99%
“…the 2nd curvature as variable, then during computation we temporarily have 2 c c c = ± Δ and 3 c c = which then violates the paraxial constraint. However, the violation of the paraxial constraint during the computation of the derivative can be avoided by performing at the same time a compensating change of the curvature of the reference surface 1 c c c = ± Δ that restores K tot .…”
Section: Saddle-point Constructionmentioning
confidence: 99%
“…2͒ The saddle points are therefore special points on the boundary between the basins of attraction that correspond to the two adjacent local minima. 16 ͑The basin of attraction is the set of starting points that, after local optimization, lead to the same minimum.͒ As has been shown earlier, 11,15 if a local minimum is known, new local minima can be found by detecting Morse index 1 saddle points in the vicinity of the known minimum and then by optimizing the configurations on the other side of these saddle points. A drawback of this method is that detecting Morse index 1 saddle points without a priori information about them is computationally more expensive than finding local minima.…”
Section: Introductionmentioning
confidence: 99%
“…[10][11][12][13][14][15] Minima, saddle points, and maxima are all critical points, i.e., the gradient of the merit function vanishes at these points. An important property of ͑nondegenerate͒ critical points is the so-called Morse index.…”
Section: Introductionmentioning
confidence: 99%
“…points where the merit function gradient vanishes) can be very useful as an intermediate step in the process of finding good lens designs. Saddle-point detection (SPD) is a thorough search method that works without any a-priori knowledge for most optimization problems with continuous variables 1,2,3 . The algorithm looks at every known local minimum for index-1 saddle-points around it, and for each detected saddle-point it finds a new minimum on the other side of the "saddle".…”
Section: Introductionmentioning
confidence: 99%