A form of prime focus corrector for the Gregory system is proposed that provides the sub-arcsecond field of view up to 3 in diameter for the spectral range 0.35 − 0.90 microns. The corrector includes five lenses made of same glass (fused silica is preferable). The distinctive feature of the corrector consists in dissimilar use of the central and edge zones of a front lens disposed in the exit p...

In several applications, semideenite programs with nonlinear equality constraints arise. We give two such examples to emphasize the importance of this class of problems. We then propose a new solution method that also applies to smooth nonconvex programs. The method combines ideas of a predictor corrector interior-point method, of the SQP method, and of trust region methods. In particular, we b...

In this paper we present an infeasible start path following predictor corrector method for semideenite linear programming problem. This method does not assume that the dual pair of semideenite programs have feasible solutions, and, in at most O(jlog((A;b;C))jn) iterations of the predictor corrector method, nds either an approximate solution to the dual pair or shows that there is no optimal sol...

The method of manufacturing and the results studies a lens corrector that converts spherical diverging front into plane one is intended for studying flat surfaces as part an interferometer with diffraction comparison wave described. A feature use aspherical convex surface maximum deviation ~ 200 μm from nearest sphere. first experimental are presented, indicating prospects using ion-beam proces...

This paper proposes a novel approach to spelling correction. It reranks the output of an existing spelling corrector, Aspell. A discriminative model (Ranking SVM) is employed to improve upon the initial ranking, using additional features as evidence. These features are derived from state-of-the-art techniques in spelling correction, including edit distance, letter-based n-gram, phonetic similar...

SDPA (SemiDe nite Programming Algorithm) is a C++ implementation of a Mehrotra-type primal-dual predictor-corrector interior-point method for solving the standard form semide nite program and its dual. We report numerical results of large scale problems to evaluate its performance, and investigate how major time-consuming parts of SDPA vary with the problem size, the number of constraints and t...

A class of explicit discontinuous Galerkin schemes is described which time approximation is based on a predictor corrector formulation. The approximation at the new time level is obtained in one step with use of the information from the direct neighbors only. This allows to introduce a local time-stepping for unsteady simulations with the property that every grid cell runs with its own optimal ...

In this article a primal-dual interior-point method for solving linear programs is proposed. A new approach for generating higher-order search directions, and a new method for an eecient higher-order subspace search along several search directions are the basis of the proposed extension. The subspace search is reduced to a linear program in several variables. The method using the simplest (two-...

We present a numerical approach for solving the free boundary problem for the Black-Scholes equation for pricing American style of floating strike Asian options. A fixed domain transformation of the free boundary problem into a parabolic equation defined on a fixed spatial domain is performed. As a result a nonlinear time-dependent term is involved in the resulting equation. Two new numerical a...

We present a highly robust second order accurate scheme for the Euler equations and the ideal MHD equations. The scheme is of predictor-corrector type, with a MUSCL scheme following as a special case. The crucial ingredients are an entropy stable approximate Riemann solver and a new spatial reconstruction that ensures positivity of mass density and pressure. For multidimensional MHD, a new disc...