关于多元Gauss—Weierstrass算子的一致逼近

本文利用一类 K—泛函和光滑模的等价性给出了二元 Gauss—weierstrass 算子在一致逼近意义的正定理、逆空理和特征性。     

Function approximation for incompletely specified regression models

This report extends earlier work by Brailovsky on regression theory and methodology, giving particular emphasis to function approximation for incompletely specified models. The interest here is with situations where the form of the regression relation is not known in advance. We discuss several difficulties that arise in using local approximation and linear regression methods, and propose ways to overcome these problems. To aid the data analyst in developing a suitable model, an illustrative table is derived for determining the number of initial explanatory functions justifiable for a given prespecified confidence level. The general approach formulated here is illustrated with an application to medical data. Relevance to classification and possible extensions are discussed.     

An improved multidisciplinary feasible method using DACE approximation approach

1.INTRODUCTION Themultidisciplinarydesignoptimization(MDO)is anapproachwhichimprovesandspeedsupthedesign process,andlowersthedesigncostofcomplexand coupledengineeringsystems[1,2],Themainfactor thatresultsinthecomplexityofMDOistheinterdis ciplinarycoupling.Thegeneralstrategytohandlethe couplingisdecompositionofthecomplexsysteminto sub systems,eachpertainingtothephysicalphe nomenonorcomponent,andtop systemwhichpre servesthecouplingsbetweenthesub systems.How ever,algorithmsbasedondecomposi…     

基于泛函网络的多维函数逼近理论及学习算法

提出一种多维函数逼近的泛函网络逼近方法,设计了一类用于函数逼近的可分离泛函网络,给出了基于泛函网络的函数逼近学习算法。而泛函网络的参数通过解方程组得到,它们能逼近给定函数到预定的精度。仿真结果表明,这种逼近方法简单可行,具有较快的收敛速度和良好的逼近性能。     

一种新的用于群组排序的最小平方逼近法

本文将文献[1,2]所给的最小平方逼近法推广应用于层次分析法中的群决策排序。文中对由多个判断决策者给出的多个不同的判断矩阵,提出通过求解群组判断矩阵最小平方偏差的方法得出判断矩阵的最佳排序和理想综合判断矩阵;通过对群组判断矩阵进行一致性讨论,据此又给出了一种用于群组判断矩阵排序的最小加权平方逼近法。理论分析和应用实例表明,应用最小平方逼近法和最小加权平方逼近法对群组判断矩阵进行排序是可行的和有效的。     

下层为多目标的两人两层决策问题的模型及优化方法

本文针对上层为单目标,下层为多目标的两人两层决策问题,建立了它的数学模型和决策机制,然后将其转化为单层的非凸优化问题。采用外部逼近算法求解此非凸优化问题的全局最优解,这为两层决策问题提供了一种求解的途径,同时为该类问题的决策支持系统的研究是有意义的。     

ADAPTIVE STOCHASTIC APPROXIMATION FOR MEASUREMENT WITH CORRELATED NOISE

A multidimensional adaptive stochastic approximation procedure trun-cated at randomly varying bounds is studied for the regression function observedwith correlated noise.The algorithm is proved to be asymptotically efficient.Theresult of the paper generalizes the one shown in[1]for the observation noise be-ing i.i.d.random vectors and under other restrictive conditions imposed on theregression function.     

基于信号重构的一种系统仿真方法

本文根据信号重构的思想，提出了一种系统仿真方法。该方法是对时域矩阵仿真方法的扩展，即保留了时域矩阵方法快速性的特点，又提高了仿真精度。文中还对该方法的截断误差做出了估计，并证明了该方法的收敛性。最后，通过仿真例子说明了该方法的有效性。     

Higher-order principal component pursuit via tensor approximation and convex optimization

Recovering the low-rank structure of data matrix from sparse errors arises in the principal component pursuit （PCP）. This paper exploits the higher-order generalization of matrix recovery, named higher-order principal component pursuit （HOPCP）, since it is critical in multi-way data analysis. Unlike the convexification （nuclear norm） for matrix rank function, the tensorial nuclear norm is stil an open problem. While existing preliminary works on the tensor completion field provide a viable way to indicate the low complexity estimate of tensor, therefore, the paper focuses on the low multi-linear rank tensor and adopt its convex relaxation to formulate the convex optimization model of HOPCP. The paper further propose two algorithms for HOPCP based on alternative minimization scheme： the augmented Lagrangian alternating direction method （ALADM） and its truncated higher-order singular value decomposition （ALADM-THOSVD） version. The former can obtain a high accuracy solution while the latter is more efficient to handle the computationally intractable problems. Experimental results on both synthetic data and real magnetic resonance imaging data show the applicability of our algorithms in high-dimensional tensor data processing.     

Bernstein-Kantorovich算子线性组合同时逼近的点态估计

借助于Ditzian-Totik光滑模ωψλr(f,t)(0≤λ≤1)给出了Bernstein-Kantorovich算子线性组合同时逼近的点态估计.