Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.     

等重复数据的非等距正交多项式回归

本文给出了一种等重复数据情形下的非等距正交多项式回归模型。     

Cross-validation and the smoothing of orthogonal series density estimators

We describe a class of smoothed orthogonal series density estimates, including the classical sequential-series introduced by [6], Soviet Math. Dokl. 3 1559–1562) and [16], Ann. Math. Statist. 38 1261–1265), and [23], Ann. Statist 9 146–156) two-parameter smoothing. The Bowman-Rudemo method of least-squares cross-validation (1982, Manchester-Sheffield School of Probability and Statistics Research Report 84/AWB/1; 1984, Biometrika 71 353–360; [14], Scand. J. Statist. 9 65–78), is suggested as a practical way of choosing smoothing parameters automatically. Using techniques of [18], Ann. Statist. 12 1285–1297), that method is shown to perform asymptotically optimally in the case of cosine and Hermite series estimators. The same argument may be used for other types of series.     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.     

Visualisation and analysis of large-scale vortex structures in three-dimensional turbulent lid-driven cavity flow

In this paper, large eddy simulation (LES) of a three-dimensional turbulent lid-driven cavity (LDC) flow at Re = 10,000 has been performed using the multiple relaxation time lattice Boltzmann method. A Smagorinsky eddy viscosity model was used to represent the sub-grid scale stresses with appropriate wall damping. The prediction for the flow field was first validated by comparing the velocity profiles with previous experimental and LES studies, and then subsequently used to investigate the large-scale three-dimensional vortical structures in the LDC flow. The instantaneous three-dimensional coherent structures inside the cavity were visualised using the second invariant (Q), Δ criterion, λ₂ criterion, swirling strength (λ_ci) and streamwise vorticity. The vortex structures obtained using the different criteria in general agree well with each other. However, a cleaner visualisation of the large vortex structures was achieved with the λ_ci criterion and also when the visualisation is based on the vortex identification criteria expressed in terms of the swirling strength parameters. A major objective of the study was to perform a three-dimensional proper orthogonal decomposition (POD) on the fluctuating velocity fields. The higher energy POD modes efficiently extracted the large-scale vortical structures within the flow which were then visualised with the swirling strength criterion. Reconstruction of the instantaneous fluctuating velocity field using a finite number of POD modes indicated that the large-scale vortex structures did effectively approximate the large-scale motion. However, such a reduced order reconstruction of the flow based on the large-scale vortical structures was clearly not as effective in predicting the small-scale details of the fluctuating velocity field which relate to the turbulent transport.     

确定性矩阵可分离压缩成像

针对可分离压缩传感使用的可分离随机正交矩阵在处理大尺度图像等高维信号感知时难度太大或成本过高的问题,引入确定性测量矩阵,提出确定性矩阵可分离压缩传感,可将如托普利兹矩阵及循环矩阵等具有确定性结构的矩阵作为可分离压缩传感的左、右可分离矩阵.该方案可以降低独立元素的数目,从而显著降低前端物理实现的难度与成本.数值模拟实验分别评估了该方法在不同采样率及不同图像尺寸下的压缩重建性能,结果表明该方法在独立元素非常少的情形下得到与原随机正交矩阵相近的重建质量,证明了其可行性.     

基于数字相干叠加的相干光正交频分复用系统中光纤非线性容忍性研究

光正交频分复用系统中的光纤非线性效应制约着系统进一步的扩容. 针对此问题, 提出一种数字相干叠加的方法, 用于提高相干光正交频分复用系统对光纤非线性的容忍性. 仿真中, 5通道的波分复用下偏振复用相干光正交频分复用系统的每个通道传输四进制正交振幅调制映射的71.53 Gbit/s信号在光纤中传输400 km. 首先, 通道间隔为25 GHz, 与传统相干光正交频分复用系统相比, 色散补偿前后, 使用数字相干叠加的相干光正交频分复用系统的信噪比分别提升了6.02 dB和9.05 dB, 最佳入纤光功率均增大了2 dB; 其次, 通道间隔为50 GHz, 色散补偿前后, 信噪比分别提升了4.9 dB和8.75 dB. 通过理论推导及仿真, 验证了所提方法能有效消除相干光正交频分复用系统的一阶非线性失真, 进而提高系统对光纤非线性的容忍性.     

Confidence intervals and ellipsoids for estimable functions and estimable vectors in models with orthogonal block structure

Sub-models of mixed linear models are considered. The independence of these sub-models leads to sufficient statistics for the parameters relevant for their densities. Using pivot variables, confidence regions are obtained as well hypothesis testing for variance components, estimable functions, and estimable vectors. In addition, to compare the estimators and the models, we present the histograms with the empirical joint densities for positive and negative parts of the estimators. The figures, for the two-dimensional charts, contain the corresponding UMVUE and are all unimodal with the UMVUE near the mode. The nearness of the estimators and the modes validates the presented methodology and allows the safe use of induced densities. A numerical example applied to real data is presented.     

A numerical technique based on B-spline for a class of time-fractional diffusion equation

This paper presents an efficient numerical technique for solving a class of time-fractional diffusion equation. The time-fractional derivative is described in the Caputo form. The L1 scheme is used for discretization of Caputo fractional derivative and a collocation approach based on sextic B-spline basis function is employed for discretization of space variable. The unconditional stability of the fully-discrete scheme is analyzed. Two numerical examples are considered to demonstrate the accuracy and applicability of our scheme. The proposed scheme is shown to be sixth order accuracy with respect to space variable and (2 − α)-th order accuracy with respect to time variable, where α is the order of temporal fractional derivative. The numerical results obtained are compared with other existing numerical methods to justify the advantage of present method. The CPU time for the proposed scheme is provided.     

A multistep collocation method for solving advection equations with delay

Advection equations with delay are appeared in the modeling of the dynamics of structured cell populations. In this article, we construct an efficient two-dimensional multistep collocation method for the numerical solution of a class of advection equations with delay. Equations with aftereffect and equations with both aftereffect and retardation of a state variable are considered. Computability of the algorithm and convergence properties of the proposed numerical method are analyzed for solutions in appropriate Sobolev spaces, and it is shown that the proposed scheme enjoys the spectral accuracy. Numerical examples are given and comparison with other existing methods in the literature is made to demonstrate the efficiency, superiority and high accuracy of the presented method.