On a quadrature formula of Micchelli and Rivlin

Micchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of precision for the Fourier-Chebyshev coefficients A_n(f), which is based on the divided differences of f′ at the zeros of the Chebyshev polynomial T_n(x). We give here a simple approach to questions of this type, which applies to the coefficients in arbitrary orthogonal expansion of f. As an auxiliary result we obtain a new interpolation formula and a new representation of the Turán quadrature formula.     

A generalization of the Erlang formula of traffic engineering

Calls arrive at a switch, where they are assigned to any one of the available idle outgoing links. A call is blocked if all the links are busy. A call assigned to an idle link may be immediately lost with a probability which depends on the link. For exponential holding times and an arbitrary arrival process we show that the conditional distribution of the time to reach the blocked state from any state, given the sequence of arrivals, is independent of the policy used to route the calls. Thus the law of overflow traffic is independent of the assignment policy. An explicit formula for the stationary probability that an arriving call sees the node blocked is given for Poisson arrivals. We also give a simple asymptotic formula in this case.Work on this paper was done while the author was at Bellcore and at Berkeley.     

1α,2α-次甲基氯地孕酮醋酸酯合成方法的改进

本文报道了合成1α,2α-次甲基氯地孕酮醋酸酯5的改良法,即以17α-羟基黄体酮1为原料,用节杆菌和NBS-碳酸钙代替了有毒试剂四氯苯醌和二氯二氰苯醌脱氢,制得基关键中间体△~(1,4,6)-化合物3。从3经五步反应即得目的物5。     

An alternative approach to nonlinear filtering

The structure of a nonlinear filter with observation process having continuous and discontinuous components is considered. The approach is based on the so-called “Bayes” formula for conditional expectations. “Fubini” type theorems for stochastic integrals are given and used to obtain the representations of an optimal estimate and of the conditional likelihood ratio. A linear unnormalized filtering equation for controlled system process is derived.     

A remark on the tail probability of a distribution

Let {X_n}_n≥1 be a sequence of independent and identically distributed random variables. For each integer n ≥ 1 and positive constants r, t, and ?, let S_n = Σ_j=1ⁿX_j and $\text{E{N}{}_{\mathrm{\infty }}\text{(r, t, ?)} = Σ}{}_{\mathrm{n=1}}{}^{\mathrm{\infty }}\text{n}{}^{\mathrm{r?2}}\text{P{|S}{}_{\mathrm{n}}\text{| > ?n}{}^{\mathrm{<mtext>r</mtext><mtext>t</mtext>}}\text{}}$. In this paper, we prove that (1) lim_?→0+?^α(r?1)E{N_∞(r, t, ?)} = K(r, t) if E(X₁) = 0, Var(X₁) = 1, and E(| X₁ |^t) < ∞, where 2 ≤ t < 2r ≤ 2t, $\text{K(r, t) =}\text{{2}{}^{\mathrm{<mtext>\alpha (r?1)</mtext><mtext>2</mtext>}}\text{Γ(}\text{(1 + α(r ? 1))}\text{2}\text{)}}\text{{(r ? 1) Γ(}\text{1}\text{2}\text{)}}$, and $\text{α =}\text{2t}\text{(2r ? t)}$; (2) $\text{lim}{}_{\mathrm{?\to 0+}}\text{G(t, ?)}\text{H(t, ?)}\text{= 0}$ if 2 < t < 4, E(X₁) = 0, Var(X₁) > 0, and E(|X₁|^t) < ∞, where G(t, ?) = E{N_∞(t, t, ?)} = Σ_n=1^∞n^t?2P{| S_n | > ?n} → ∞ as ? → 0+ and $\text{H(t, ?) = E{N}{}_{\mathrm{\infty }}\text{(t, t, ?)} = Σ}{}_{\mathrm{n=1}}{}^{\mathrm{\infty }}\text{n}{}^{\mathrm{t?2}}\text{P{| S}{}_{\mathrm{n}}\text{| > ?n}{}^{\mathrm{<mtext>2</mtext><mtext>t</mtext>}}\text{} → ∞}\text{as}\text{? → 0+}$, i.e., H(t, ?) goes to infinity much faster than G(t, ?) as ? → 0+ if 2 < t < 4, E(X₁) = 0, Var(X₁) > 0, and E(| X₁ |^t) < ∞. Our results provide us with a much better and deeper understanding of the tail probability of a distribution.     

The Combinatorial Quantum Cohomology Ring of <Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">B</Emphasis>

A purely combinatorial construction of the quantum cohomology ring of the generalized flag manifold is presented. We show that the ring we construct is commutative, associative and satisfies the usual grading condition. By using results of our previous papers [12, 13], we obtain a presentation of this ring in terms of generators and relations, and formulas for quantum Giambelli polynomials. We show that these polynomials satisfy a certain orthogonality property, which—for G = SL_n( )—was proved previously in the paper [5].     

Boundary behavior of Gleason''''s problem in hyperbolic harmonic Bergman spaces

Necessary and sufficient conditions are obtained for the boundedness of Berezin transformation on Lebesgue space Lp(B, dVβ) in the real unit ball B in Rn. As an application, we prove that Gleason type problem is solvable in hyperbolic harmonic Bergman spaces. Furthermore we investigate the boundary behavior of the solutions of Gleason type problem.     

Efficient algorithms for the matrix cosine and sine

Several improvements are made to an algorithm of Higham and Smith for computing the matrix cosine. The original algorithm scales the matrix by a power of 2 to bring the ∞-norm to 1 or less, evaluates the [8/8] Padé approximant, then uses the double-angle formula cos (2A)=2cos ²A−I to recover the cosine of the original matrix. The first improvement is to phrase truncation error bounds in terms of ‖A²‖^1/2 instead of the (no smaller and potentially much larger quantity) ‖A‖. The second is to choose the degree of the Padé approximant to minimize the computational cost subject to achieving a desired truncation error. A third improvement is to use an absolute, rather than relative, error criterion in the choice of Padé approximant; this allows the use of higher degree approximants without worsening an a priori error bound. Our theory and experiments show that each of these modifications brings a reduction in computational cost. Moreover, because the modifications tend to reduce the number of double-angle steps they usually result in a more accurate computed cosine in floating point arithmetic. We also derive an algorithm for computing both cos (A) and sin (A), by adapting the ideas developed for the cosine and intertwining the cosine and sine double angle recurrences. AMS subject classification 65F30 Numerical Analysis Report 461, Manchester Centre for Computational Mathematics, February 2005. Gareth I. Hargreaves: This work was supported by an Engineering and Physical Sciences Research Council Ph.D. Studentship. Nicholas J. Higham: This work was supported by Engineering and Physical Sciences Research Council grant GR/T08739 and by a Royal Society–Wolfson Research Merit Award.     

Algebraic polynomials with non-identical random coefficients

There are many known asymptotic estimates for the expected number of real zeros of a random algebraic polynomial The coefficients are mostly assumed to be independent identical normal random variables with mean zero and variance unity. In this case, for all sufficiently large, the above expected value is shown to be . Also, it is known that if the have non-identical variance , then the expected number of real zeros increases to . It is, therefore, natural to assume that for other classes of distributions of the coefficients in which the variance of the coefficients is picked at the middle term, we would also expect a greater number of zeros than . In this work for two different choices of variance for the coefficients we show that this is not the case. Although we show asymptotically that there is some increase in the number of real zeros, they still remain . In fact, so far the case of is the only case that can significantly increase the expected number of real zeros.

     

Composition operators on Banach function spaces

We study the boundedness and the compactness of composition operators on some Banach function spaces such as absolutely continuous Banach function spaces on a -finite measure space, Lorentz function spaces on a -finite measure space and rearrangement invariant spaces on a resonant measure space. In addition, we study some properties of the spectra of a composition operator on the general Banach function spaces.