Rearrangement Free Method for Hardy-Littlewood-Sobolev Inequalities on $\mathbb{S}^n$

For conformal Hardy-Littlewood-Sobolev(HLS) inequalities [22] and reversed conformal HLS inequalities [8] on $\mathbb{S}^n,$ a new proof is given for the attainability of their sharp constants. Classical methods used in [22] and [8] depends on rearrangement inequalities. Here, we use the subcritical approach to construct the extremal sequence and circumvent the blow-up phenomenon by renormalization method. The merit of the method is that it does not rely on rearrangement inequalities.     

Impulsive systems with hybrid delayed impulses: Input-to-state stability

This paper investigates input-to-state stability (ISS) and integral-input-to-state stability (iISS) of nonlinear impulsive systems with hybrid delayed impulses. Based on Lyapunov method, some sufficient conditions ensuring ISS and iISS of impulsive systems are obtained, where the time derivative of Lyapunov function is indefinite, and the hybrid effects of delayed impulses are also fully considered. It is shown that the impulsive system is ISS provided that the combined action of time delay existing in impulses, continuous dynamic, and the cumulative strength of hybrid impulses satisfies some conditions, even if the hybrid delayed impulses play a destabilizing effect on ISS. Examples and their simulations are presented to illustrate the applicability of the proposed results.     

Exact SOR convergence regions for a general class ofp-cyclic matrices

Linear systems whose associated block Jacobi iteration matrixB is weakly cyclic generated by the cyclic permutation = (₁,₂,..., _p ) in the spirit of Li and Varga are considered. Regions of convergence for the corresponding blockp-cyclic SOR method are derived and the exact convergence domains for real spectra, (B ^p ), of the same sign are obtained. Moreover, analytical expressions for two special cases forp = 5 are given and numerical results are presented confirming the theory developed. The tools used for this work are mainly from complex analysis and extensive use of (asteroidal) hypocycloids in the complex plane is made to produce our results.This work was supported in part by AFOSR grant F49620-92-J-0069 and NSF grant 9202536-CCR.     

A universal constant for the convergence of Newton's method and an application to the classical homotopy method

We give a new theorem concerning the convergence of Newton's method to compute an approximate zero of a system of equations. In this result, the constanth ₀=0.162434... appears, which plays a fundamental role in the localization of good initial points for the Newton iteration. We apply it to the determination of an appropriate discretization of the time interval in the classical homotopy method.     

Multistep methods for differential algebraic equations

Multistep methods for the differential/algebraic equations (DAEs) in the form of

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.     

X-ray emission spectroscopy with EPMA applied to high Tc Superconductors using new spectrometer crystals

The High Temperature Superconductors are characterized by a very anisotropical structure and by typical arrangements of Cu- and O-atoms within CuO₂-planes. In studying the electronic structure of these compounds there is a strong demand for high resolution valence band spectroscopy. Using an electron probe microanalyzer we study the X-ray emission of O-K_ga and Cu-L emerging from polycrystalline YBa₂Cu₃O₇ and Tl₂Ba₂Ca₂Cu₃O₁₀. The O-K emission band is analyzed using a chlinochlore crystal in (001) orientation (2d = 28.4 Å). For the Cu-L emission band we use a beryl crystal in (10¯10) orientation (2d = 15.9 Å). Furthermore, orientation dependent X-ray emission spectroscopy of single-crystalline YBa₂Cu₃O₇ and Tl₂Ba₂Ca₁Cu₂O₈ specimens was performed. We present the partial O-K spectra which represent the O-2p ( = x, y, z) electronic densities of states of the valence band and compare them with calculated data.     

Kinetic-catalytic determination of osmium by fluorescence quenching with salicylfluorone and hydrogen peroxide

A highly sensitive and selective fluorescence-quenching kinetic method is proposed for the determination of trace osmium(IV), based on the catalytic effect of osmium(IV) on the salicylfluorone (_ex = 510 nm, _em = 535 nm)-H₂O₂ system at pH 9.3–9.6. Using the fixed time method, osmium(IV) in the range 0.008–0.6 ng/ml can be determined. The detection limit is 0.006 ng/ml. Over thirty anions and cations, including other platinum metal ions, do not interfere, even when present in large excess. The method has been applied successfully for the determination of osmium in a series of synthetic mixtures and refined ore with relative standard deviations of 2–6%.     

On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds

We consider a new algorithm, an interior-reflective Newton approach, for the problem of minimizing a smooth nonlinear function of many variables, subject to upper and/or lower bounds on some of the variables. This approach generatesstrictly feasible iterates by using a new affine scaling transformation and following piecewise linear paths (reflection paths). The interior-reflective approach does not require identification of an activity set. In this paper we establish that the interior-reflective Newton approach is globally and quadratically convergent. Moreover, we develop a specific example of interior-reflective Newton methods which can be used for large-scale and sparse problems.Research partially supported by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under grant DE-FG02-86ER25013.A000, and in part by NSF, AFOSR, and ONR through grant DMS-8920550, and by the Advanced Computing Research Institute, a unit of the Cornell Theory Center which receives major funding from the National Science Foundation and IBM Corporation, with additional support from New York State and members of its Corporate Research Institute.Corresponding author.     

Fastiterative methods for least squares estimations

Least squares estimations have been used extensively in many applications, e.g. system identification and signal prediction. When the stochastic process is stationary, the least squares estimators can be found by solving a Toeplitz or near-Toeplitz matrix system depending on the knowledge of the data statistics. In this paper, we employ the preconditioned conjugate gradient method with circulant preconditioners to solve such systems. Our proposed circulant preconditioners are derived from the spectral property of the given stationary process. In the case where the spectral density functions() of the process is known, we prove that ifs() is a positive continuous function, then the spectrum of the preconditioned system will be clustered around 1 and the method converges superlinearly. However, if the statistics of the process is unknown, then we prove that with probability 1, the spectrum of the preconditioned system is still clustered around 1 provided that large data samples are taken. For finite impulse response (FIR) system identification problems, our numerical results show that annth order least squares estimator can usually be obtained inO(n logn) operations whenO(n) data samples are used. Finally, we remark that our algorithm can be modified to suit the applications of recursive least squares computations with the proper use of sliding window method arising in signal processing applications.Research supported in part by HKRGC grant no. 221600070, ONR contract no. N00014-90-J-1695 and DOE grant no. DE-FG03-87ER25037.