Parameter choice by discrepancy principles for ill-posed problems leading to optimal convergence rates

Schock (Ref. 1) considered a general a posteriori parameter choice strategy for the Tikhonov regularization of the ill-posed operator equationTx=y which provides nearly the optimal rate of convergence if the minimal-norm least-squares solution belongs to the range of the operator (T ^* T) ^v , o<v1. Recently, Nair (Ref. 2) improved the result of Schock and also provided the optimal rate ifv=1. In this note, we further improve the result and show in particular that the optimal rate can be achieved for 1/2v1.The final version of this work was written while M. T. Nair was a Visiting Fellow at the Centre for Mathematics and Its Applications, Australian National University, Canberra, Australia. The work of S. George was supported by a Senior Research Fellowship from CSIR, India.     

Optimal error estimates of a locally one-dimensional method for the multidimensional heat equation

For the multidimensional heat equation in a parallelepiped, optimal error estimates inL ₂(Q) are derived. The error is of the order of +¦h¦² for any right-hand sidef L ₂(Q) and any initial function ; for appropriate classes of less regularf andu ₀, the error is of the order of ((+¦h¦² ), 1/2<1.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 185–197, August, 1996.     

A note on smoothed estimating functions

The kernel estimate of regression function in likelihood based models has been studied in Staniswalis (1989,J. Amer. Statist. Assoc.,84, 276–283). The notion of optimal estimation for the nonparametric kernel estimation of semimartingale intensity (t) is proposed. The goal is to arrive at a nonparametric estimate of ₀=(t ₀) for a fixed pointt ₀ [0, 1]. We consider the estimator that is a solution of the smoothed optimal estimating equation is the optimal estimating function as in Thavaneswaran and Thompson (1986,J. Appl. Probab.,23, 409–417).     

SOME BLENDING INTERPOLATION METHODS IN CAGD

Some of the blending interpolation methods (which) stated by a convex combination technique are presented. This includes C1 ,C2 blending triangular interpolanls and C1 -blending quadrilateral inter polanls for surfaces. The mentioned methods can be generalized to the construction of C" blending interpolants.     

A discrete method of optimal control based upon the cell state space concept

A discrete method of optimal control is proposed in this paper. The continuum state space of a system is discretized into a cell state space, and the cost function is discretized in a similar manner. Assuming intervalwise constant controls and using a finite set of admissible control levels (u) and a finite set of admissible time intervals (), the motion of the system under all possible interval controls (u, ) can then be expressed in terms of a family of cell-to-cell mappings. The proposed method extracts the optimal control results from these mappings by a systematic search, culminating in the construction of a discrete optimal control table.The possibility of expressing the optimal control results in the form of a control table seems to give this method a means to make systems real-time controllable.Dedicated to G. LeitmannThe material is based upon work supported by the National Science Foundation under Grant No. MEA-82-17471. The author is also indebted to Professor G. Leitmann for his many helpful comments.     

Computation of suboptimal randomized strategies for steering the random motion of a point under partial observation

Consider the random motion in the plane of a pointM, whose velocityv=(v ₁,v ₂) is perturbed by an ²-valued Gaussian white noise. Only noisy nonlinear observations taken on the point location (state) are available toM. The velocityv is of the formv(y)= _u (u ₁,u ₂) _y (du), wherey denotes the value of the observed signal,U is the range of the velocity, and, for eachy, _y is a probability measure on (U). Using the available observations, the pointM wishes to steer itself into a given target set by choosing a randomized strategy ={ _y :y ²}. Sufficient conditions on weak optimal randomized strategies are derived. An algorithm for computing weak suboptimal randomized strategies is suggested, and the strategies are computed for a variety of cases.This work was partially supported by a grant from Control Data.     

Optimal dynamic advertising policies for hereditary processes

In this paper, the Nerlove-Arrow model of optimal dynamic advertising policies is generalized by assuming a general probability distribution of the forgetting time, rather than the exponential one. A control problem with integrodifferential equations of motion is defined for which the transitory and steady-state properties of the optimal advertising policy are examined. The effects of assumptions like IHR-distributions and DHR-distributions, the existence of an upper bound for the forgetting time, etc., are explained. It is shown that there are two (in the case of an exponential distribution even three) different current-value adjoint functions associated with the problem, and relations between the two (three) are established. Also provided is a sensitivity analysis.Thanks are due to G. Feichtinger and S. Jorgensen for useful discussions.     

Melt‐state polymer chain dimensions as a function of temperature

The unperturbed chain dimensions (〈R²〉_o/M) of cis/trans‐1,4‐polyisoprene, a near‐atactic poly(methyl methacrylate), and atactic polyolefins were measured as a function of temperature in the melt state via small‐angle neutron scattering (SANS). The polyolefinic materials were derived from polydienes or polystyrene via hydrogenation or deuteration and represent structures not encountered commercially. The parent polymers were prepared via lithium‐based anionic polymerizations in cyclohexane with, in some cases, a polymer microstructure modifier present. The polyolefins retained the near‐monodisperse molecular weight distributions exhibited by the precursor materials. The melt SANS‐based chain dimension data allowed the evaluation of the temperature coefficients [dln 〈R²〉_o/dT(κ)] for these polymers. The evaluated polymers obeyed the packing length (p)‐based expressions of the plateau modulus, G = kT/np³ (MPa), and the entanglement molecular weight, M_e = ρN_anp³ (g mol^?1), where n_t denotes the number (～21) of entanglement strands in a cube with the dimensions of the reptation tube diameter (d_t) and ρ is the chain density. The product np³ is the displaced volume (V_e) of an entanglement that is also expressible as pd or kT/G. © 2002 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 40: 1768–1776, 2002     

Catalytic Enantioselective Reduction of Prochiral Ketones with Chiral Ferrocenyl Amino Alcohols

The asymmetric reduction of prochiral ketones was catalyzed by a class of recoverable and highly stable chiral ferrocenyl amino alcohols derived from natural amino acids to yield optically active secondary alcohols in high chemical yields and moderate to good enantiomeric excesses.     

Comparison by capillary SFC and SFC-MS of soxhlet and supercritical fluid extraction of hamster feces

Components of hamster feces ranging from low molecular weight fatty acids through the expected range of triglycerides have been eluted in a single SFC run with simultaneous pressure and temperature programming. Temperature programming from 140°C to 240°C was required to provide optimum conditions for separation of the fatty acids and to move the elution region of the sterol esters away from that of the triglycerides. Data from chemical ionization and electron impact mass spectrometry of compounds separated by SFC were used to confirm identities suggested by retention measurements and to provide tentative identities of unknown compounds. SFC with flame ionization detection was used to compare Soxhlet extraction, off-line supercritical fluid extraction (SFE), and on-line SFE of the feces. Although samples obtained by Soxhlet extraction and SFE produced very similar chromatograms, SFE required far less time and consumed much smaller quantities of organic solvent.