Yunnandaphninines F and G,New C30 Alkaloids from Daphniphyllum yunnanense

Eight C₃₀ Daphniphyllum alkaloids, including two new ones, yunnandaphninines F and G ( 1 and 2 , resp.), were isolated from the leaves and stems of Daphniphyllum yunnanense. Their structures were elucidated on the basis of the spectroscopic data.     

Preinjective modules over pure semisimple rings

For a left pure semisimple ring R, it is shown that the local duality establishes a bijection between the preinjective left R-modules and the preprojective right R-modules, and any preinjective left R-module is the source of a left almost split morphism. Moreover, if there are no nonzero homomorphisms from preinjective modules to non-preinjective indecomposable modules in R-mod, the direct sum of all non-preinjective indecomposable direct summands of products of preinjective left R-modules is a finitely generated product-complete module. This generalizes a recent theorem of Angeleri Hügel [L. Angeleri Hügel, A key module over pure-semisimple hereditary rings, J. Algebra 307 (2007) 361-376] for hereditary rings.     

Convergence theory of extrapolated iterative methods for a certain class of non-symmetric linear systems

Summary A variety of iterative methods considered in [3] are applied to linear algebraic systems of the formAu=b, where the matrixA is consistently ordered [12] and the iteration matrix of the Jacobi method is skew-symmetric. The related theory of convergence is developed and the optimum values of the involved parameters for each considered scheme are determined. It reveals that under the aforementioned assumptions the Extrapolated Successive Underrelaxation method attains a rate of convergence which is clearly superior over the Successive Underrelaxation method [5] when the Jacobi iteration matrix is non-singular.     

Some mixing properties of time series models

Sufficient conditions are given for linear processes and ARMA processes to have the Gaswirth and Rubin mixing condition. The mixing rates are also determined.     

Three limit theorems for vacancy in multivariate coverage problems

Three limit theorems describing asymptotic distribution of vacancy in general multivariate coverage problems are proved, in which nk-dimensional spheres are distributed within a k-dimensional unit cube according to a density f. The first result (a central limit theorem) describes the case where the proportion of vacancy converges to a fixed constant lying between 0 and 1. The last two results treat the case where the proportion of vacancy tends to 1 as n → ∞. Results of this nature have hitherto been available only for restricted k and/or for f equal to the uniform density.     

Pointwise consistency of the hermite series density estimate

The Hermite series estimate of a density f?L_p, p > 1, convergessin the mean square to f (x) for almost all x? |R, ifN (n) → ∞ and N (n) / n² → ) as n → ∞, where N is the number of the Hermite functions in the estimate while n is the number of observations. Moreover, the mean square and weak consistency are equivalent. For m times differentiable densities, the mean squares convergence rate is O(n^?(2m?1)/2m). Results for complete convergence are also given.     

The L2-optimal cell width for the histogram

We give the value of the cell width which minimizes the integrated mean squared error of the histogram estimate of a multivariate density.     

A finite element lumped mass scheme for solving eigenvalue problems of circular arches

Summary This study is a continuation of a previous paper [4] in which the numerical results are given by using single precision arithmetic. In this paper, we show the numerical results which experess the sharper convergence properties than those of [4], by using double precision arithmetic.Dedicated to Prof. Masaya Yamaguti on the occasion of his 60th birthday     

Efficient implementation of Jacobi's diagonalization method on the DAP

Summary The DAP architecture brings into consideration the Jacobi method where several non-interacting rotations can be performed in parallel. However the design of the algorithm is crucial in a parallel environment. In this paper we shall consider two techniques specifically designed to reduce the organisation and the arithmetic components of the parallel Jacobi method.     

Forward error analysis of Gaussian elimination

Summary Part I of this work deals with the forward error analysis of Gaussian elimination for general linear algebraic systems. The error analysis is based on a linearization method which determines first order approximations of the absolute errors exactly. Superposition and cancellation of error effects, structure and sparsity of the coefficient matrices are completely taken into account by this method. The most important results of the paper are new condition numbers and associated optimal component-wise error and residual estimates for the solutions of linear algebraic systems under data perturbations and perturbations by rounding erros in the arithmetic floating-point operations. The estimates do not use vector or matrix norms. The relative data and rounding condition numbers as well as the associated backward and residual stability constants are scaling-invariant. The condition numbers can be computed approximately from the input data, the intermediate results, and the solution of the linear system. Numerical examples show that by these means realistic bounds of the errors and the residuals of approximate solutions can be obtained. Using the forward error analysis, also typical results of backward error analysis are deduced. Stability theorems and a priori error estimates for special classes of linear systems are proved in Part II of this work.