Applied Inverse Problems in Optics

info:eu-repo/semantics/published

Linear inverse problems with discrete data: II. Stability and regularization

For pt.I. see ibid. vol.1, p.301 (1985). In the first part of this work a general definition of an inverse problem with discrete data has been given and an analysis in terms of singular systems has been performed. The problem of the numerical stability of the solution, which in that paper was only briefly discussed, is the main topic of this second part. When the condition number of the problem is too large, a small error on the data can produce an extremely large error on the generalised solution, which therefore has no physical meaning. The authors review most of the methods which have been developed for overcoming this difficulty, including numerical filtering, Tikhonov regularisation, iterative methods, the Backus-Gilbert method and so on. Regularisation methods for the stable approximation of generalised solutions obtained through minimisation of suitable seminorms (C-generalised solutions), such as the method of Phillips (1962), are also considered.

SVD for linear inverse problems

info:eu-repo/semantics/published

A new inversion procedure for confocal scanning microscopy and other bandlimited signal processing problems

We find a simple analytic expression for the inverse of an infinite matrix related to the problem of data reduction in confocal scanning microscopy and other band-limited signal processing problems. Potential applications of this result to practical problems are outlined. The matrix arises from a sampling expansion approach to the integral equation.

Stability Problems in Inverse Diffraction

Inverse diffraction consists in determining the field distribution on a boundary surface from the knowledge of the distribution on a surface situated within the domain where the wave propagates. This problem is a good example for illustrating the use of least-squares methods (also called regularization methods) for solving linear ill-posed inverse problem. We focus on obtaining error bounds For regularized solutions and show that the stability of the restored field far from the boundary surface is quite satisfactory: the error is proportional to ∊(ðŗ‚ ≃ 1) ,ðŗœ being the error in the data (Hölder continuity). However, the error in the restored field on the boundary surface is only proportional to an inverse power of │In∊│ (logarithmic continuity). Such a poor continuity implies some limitations on the resolution which is achievable in practice. In this case, the resolution limit is seen to be about half of the wavelength. Copyright © 1981 by The Institute of Electrical and Electronics Engineers, Inc.

Superresolution in linear inverse problems

info:eu-repo/semantics/published

Graphical representation and generalization in sequences problems

In this paper we present different ways used by Secondary students to generalize when they try to solve problems involving sequences. 359 Spanish students solved generalization problems in a written test. These problems were posed through particular terms expressed in different representations. We present examples that illustrate different ways of achieving various types of generalization and how students express generalization. We identify graphical representation of generalization as a useful tool of getting other ways of expressing generalization, and we analyze its connection with other ways of expressing it.

Shop scheduling problems under precedence constraints

The paper considers a scheduling model that generalizes the well-known open shop, flow shop, and job shop models. For that model, called the super shop, we study the complexity of finding a time-optimal schedule in both preemptive and non-preemptive cases assuming that precedence constraints are imposed over the set of jobs. Two types of precedence rela-tions are considered. Most of the arising problems are proved to be NP-hard, while for some of them polynomial-time algorithms are presented.

An application of quasi-Newton methods for the numerical solution of interface problems

Quasi-Newton methods are applied to solve interface problems which arise from domain decomposition methods. These interface problems are usually sparse systems of linear or nonlinear equations. We are interested in applying these methods to systems of linear equations where we are not able or willing to calculate the Jacobian matrices as well as to systems of nonlinear equations resulting from nonlinear elliptic problems in the context of domain decomposition. Suitability for parallel implementation of these algorithms on coarse-grained parallel computers is discussed.

Heuristics for short route job shop scheduling problems

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each problem, we define a class of heuristic schedules in which certain subsets of operations are kept as blocks on the corresponding machines. We show that for each problem the value of the makespan of the best schedule in that class cannot be less than 3/2 times the optimal value, and present algorithms that guarantee a worst-case ratio of 3/2.

Shop-scheduling problems with fixed and non-fixed machine orders of the jobs

The paper deals with the determination of an optimal schedule for the so-called mixed shop problem when the makespan has to be minimized. In such a problem, some jobs have fixed machine orders (as in the job-shop), while the operations of the other jobs may be processed in arbitrary order (as in the open-shop). We prove binary NP-hardness of the preemptive problem with three machines and three jobs (two jobs have fixed machine orders and one may have an arbitrary machine order). We answer all other remaining open questions on the complexity status of mixed-shop problems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms.

Complexity of mixed shop scheduling problems: A survey

We survey recent results on the computational complexity of mixed shop scheduling problems. In a mixed shop, some jobs have fixed machine orders (as in the job shop), while the operations of the other jobs may be processed in arbitrary order (as in the open shop). The main attention is devoted to establishing the boundary between polynomially solvable and NP-hard problems. When the number of operations per job is unlimited, we focus on problems with a fixed number of jobs.