Buchbesprechungen

Ohne Zusammenfassung

---

Book reviews

     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.     

3D-TOFSIMS characterization of black spots in polymer light emitting diodes

The occurrence and formation of black spots areas in PolyLED devices has been studied by time-of-flight SIMS (TOFSIMS). The composition, shape and position of the black spots is visualised by three-dimensional (3D)-TOFSIMS depth-profiling. It has been established that the formation of non-emissive spots is due to the growth of aluminium oxide clusters at the AlBa/polymer interface. Electron injection in the black spots is lost by the resulting local increase of the resistivity of the cathode.     

Timing and detuning studies of a synchronously pumped mode-locked dye laser

The timing relationship between a synchronously pumped mode-locked dye laser and its pump laser is explored experimentally and theoretically. The experimental data is in quantitative agreement with numerical solutions of a semiclassical model that includes no free parameters. The data also agrees qualitatively with an approximate, analytic distillation of this model which is presented here for the first time. Our study has a direct bearing on the jitter and the long term stability of these important ultrashort pulse lasers.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

An expedient route to diaza-spirocycles utilizing a sequential multicomponent α-aminoallylation/ring-closing metathesis strategy

A general method for the preparation of diaza-spirocycles is reported. This method used an olefin metathesis in order to construct the desired spirocyclic framework. Beginning with commercially available protected amino ketones, this strategy ultimately produced pharmacologically relevant diaza-scaffolds in an efficient and high-yielding process.     

Aspects of Generic Entanglement

We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the ``concentration of measure' phenomenon, meaning that on a large-probability set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number of qubits negligible compared to the size of the total system. Furthermore, such properties are generic. Similar phenomena are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization of the protocol for universal superdense coding of quantum states.