加细剖分样条函数空间的维数级数和基函数

在文[1]中,我们讨论了利用协调矩阵计算维数级数和基函数的Grobner基方法,本文考虑几种加细剖分样条函数空间的维数级数和基函数,给出了它们的表达式。 1 任意三角剖分的连续样条函数 任意三角剖分上连续样条函数空间的维数早已被确定。本节我们用Grobner基方法来计算其维数级数的发生函数和基函数。 设Δ是单连通区域D上的三角剖分,f_0~0(Δ)是Δ内点的个数,f_1~0(Δ)是内网线的个数,f_2~0(Δ)是三角形的个数,我们有     

n维复形上一类具有线性分式目标函数的规划问题

ｎ维复形上一类具有线性分式目标函数的规划问题郑汉鼎（山东大学教学系，济南２５０１Ｏ０）文献［１，２］已经研究了ｎ维复形上的规划问题，本文将讨论。维复形上具有线性分式目标函数的规划问题．问题Ⅰ给定一个ｎ维复形Ｋｎ和一个ｒ－１维边缘链，要找一个ｒ维链。使...     

布尔矩阵广义逆A－ω，A－d，A－ω

设Ａ是布尔矩阵，而矩阵Ｇ满足ＡＧＡ＝Ａ．（１）如果对所有Ａｘ＝ｙ的向量ｘ，ｙ．有ω（Ｇｙ）≤ω（ｘ）（＊）称Ｇ是Ａ的一个极小权ｇ－逆，表示为Ａ－ω．（２）如果对所有向量ｘ，ｙ，有ｄ（ＡＧｙ，ｙ）≤ｄ（Ａｘ，ｙ）（＊＊）称Ｇ是Ａ的最小距离ｇ－逆，表示为Ａ－ｄ．（３）如果（＊）和（＊＊）都成立，就称Ｇ是极小权最小距离ｇ－逆，表示为Ａ－ωｄ．本文研究这三类广义逆矩阵的最大逆的存在性及表示式．主要结果如下：假定对于矩阵Ａ．Ａ－ω，Ａ－ｄ，Ａ－ωｄ分别存在，那么．（１）存在最大Ａ－ω，当且仅当Ａ中设有两个相同的非零列，且最大Ａ－ω为Ａω＝［ＩＣＡＴ］Ｃ．（２）最大Ａ－ｄ存在，且为Ａｄ＝［ＡＴＡＣＡＴ＋ＡＴ（ＪＡＴ）Ｃ］Ｃ．（３）存在最大Ａ－ωｄ，当且仅当Ａ的所有非零列向量线性独立，且最大Ａ－ωｄ为Ａωｄ＝［ＡＴＡｃＡＴ＋ＡＴ（ＪＡＴ）ｃ＋（ＡＴＪ）ｃＡＴ］Ｃ．其中Ｊ为全１矩阵     

关于单位园周上阶梯函数的性质

Ｔ．Ｓｈｅｉｌ－Ｓｍａｌｌ［１］讨论了阶梯函数的Ｆｏｕｒｉｅｒ级数。本文对［１］中所涉及到一些阶梯函数的性质进行了详细讨论，并给出了详细证明。     

向量自激门限自回归（VSETAR）序列的遍历性

本文主要考虑二维自激门限自回归模型：Ｘ（ｔ）＝Ｉ［Ｘ（ｔ－１）∈Ｒｉ］ＡｉＸ（ｔ－１）＋ε（ｔ），其中Ａｉ（ｉ＝１，２，３，４）为２×２系数矩阵，｛ε（ｔ）｝为二维ｉ．ｉ．ｄ序列。我们得到｛Ｘ（ｔ）｝为遍历的四个充分条件。     

非一致椭圆型方程的广义Green函数

该文我们证明了一类齐次线性非一致椭圆型方程广义Ｇｒｅｅｎ函数的存在性和唯一性，并得到了广义Ｇｒｅｅｎ函数的一性性质，推广和发展了Ｇｒｕｔｅｒ，Ｍ．和Ｗｉｄｍａｎ，ｋ．ｏ［２］的相应结果，而且我们证明广义Ｇｒｅｅｎ函数唯一性的方法与［２］中的方法完全不同．     

W_2~m空间中样条插值算子与最佳逼近算子的一致性

由线性微分算子确定的样条是连接多项式样条与希氏空间中抽象算子样条的重要环节,对微分算子样条的研究,既可从更高的观点揭示和概括多项式样条,又可启示我们去发现抽象算子样条的一些新的理论和应用． Ｇｒｅｅｎ函数是研究微分算子样条的重要工具 ［１］,但在微分算子插值样条的计算及将样条用于数值分析中,再生核方法起着更重要的作用．文献［２］［３］给出了与二阶线性微分算子插值样条有关的再生核解析表达式;由此得到了二阶微分算子插值样条与空间Ｗ_２～１［ａ,ｂ］中最佳插值逼近算子的一致性;而且还利用再生核给出了Ｈｉ…     

Clifforrd分析中广义双正则函数的(线性)非线性边值问题

本文研究Ｃｌｉｆｏｒｄ分析中广义双正则函数的一个非线性边值问题：Ａ（ｔ１，ｔ２）Ｗ＋＋（ｔ１，ｔ２）＋Ｂ（ｔ１，ｔ２）Ｗ＋－（ｔ１，ｔ２）＋Ｃ（ｔ１，ｔ２）Ｗ－＋（ｔ１，ｔ２）＋Ｄ（ｔ１，ｔ２）Ｗ－－（ｔ１，ｔ２）＝ｇ（ｔ１，ｔ２）ｆｔ１，ｔ２，Ｗ＋＋（ｔ１，ｔ２），Ｗ＋－（ｔ１，ｔ２），Ｗ－＋（ｔ１，ｔ２），Ｗ－－（ｔ１，ｔ２）［］．先讨论解的积分表示式，再研究几个奇异算子，最后用Ｓｃｈａｕｄｅｒ不动点原理（压缩映射定理）证明了解的存在性（唯一性）．目前还没有见到其它国内外学者研究广义双正则函数的非线性边值问题．本文推广了Ｆ．Ｂｒａｃｋｓ，Ｗ．Ｐｉｎｃｋｅｔ［１０］，ＬｅＨｕａｎｇ Ｓｏｎ［１１］，Ｒ．Ｐ．ＧｉｌｂｅｒｔａｎｄＪ．Ｌ．Ｂｕｃｈｎａｎ［１５］和黄沙［１３］的工作     

巧用函数单调性解赛题

函数ｆ（ｘ）在区间［ａ,ｂ］上单调增加（或单调减少）,又ｃ、ｄ∈［ａ,ｂ］上,若ｆ（ｃ）＝ｆ（ａ）,则有ｃ＝ｄ．１　求代数式的值例１　已知ｘ、ｙ∈［－π４,π４］,ａ∈Ｒ,且　ｘ３＋ｓｉｎｘ－２ａ＝０４ｙ３＋ｓｉｎｙｃｏｓｙ＋ａ＝０则ｃｏｓ（ｘ＋２ｙ）＝　　．（１９９４年全国高中数学竞赛题）解　由已知条件,可得　　ｘ３＋ｓｉｎｘ＝２ａ（－２ｙ）３＋ｓｉｎ（－２ｙ）＝２ａ故可设函数ｆ（ｔ）＝ｔ３＋ｓｉｎｔ,则有ｆ（ｘ）＝ｆ（－２ｙ）＝２ａ．由于函数ｆ（ｔ）＝ｔ３＋ｓｉｎｔ,在［－π２,π２］上是单…     

GF（3）上多元多项式的化简

本文通过极性矩阵的递归表示，对ＧＦ（３）上多元多项式环进行了讨论，提出将变量经过线性变换，使多元多项式化简为乘积项数最少的新方法．该方法不需要进行矩阵运算，简便易行，并减少了计算复杂性，其结果改进了［１，２］的工作．     

On explicit basis of bivariate spline space

For a subdivision Δ of a region in d-dimensional Euclidean space, we consider computation of dimension and of basis function in spline space S _k ^r (Δ) consisting of all C piecewise polynomial functions over Δ of degree at most k. A computational scheme is presented for computing the dimension and bases of spline space S _k ^r (Δ). This scheme based on the Grobner basis algorithm and the smooth co-factor method for computing multivariate spline. For bivariate splines, explicit basis functions of S _k ^r (Δ) are obtained for any integer k and r when Δ is a cross-cut partition. The Project is partly supported by the Science and Technology New Star Plan of Beijing and Education Committee of Beijing.     

一种基于复杂性理论的装备作战仿真方法

采用什么样的计算机仿真方法来隐喻真实的作战系统是装备作战仿真研究的关键问题.从复杂性科学的研究角度,引入了复杂适应系统(CAS)理论及其技术体系,提炼了基于Agents/space的建模与仿真框架,说明了框架实现的关键技术——可计算模型、复杂性解决方案和仿真实现平台.进而利用该方法进行了典型装备作战仿真问题研究,包括:利用神经网络、三维连续空间可计算模型,并选用Mason平台实现了装甲装备战损规律仿真;利用三层元胞自动机、产生式系统可计算模型,并选用Repast平台实现了装备群对抗仿真.为基于复杂性理论开展装备作战仿真或具有类似特征问题的研究提供了一种新的试验途径.     

多尺度辛格式求解复杂介质波传问题

在哈密顿体系中引入小波分析,利用辛格式和紧支正交小波对波动方程的时、空间变量进行联合离散近似,构造了多尺度辛格式——MSS（Multiresolution Symplectic Scheme）．将地震波传播问题放在小波域哈密顿体系下的多尺度辛几何空间中进行分析,利用小波基与辛格式的特性,有效改善了计算效率,可解决波动力学长时模拟追踪的稳定性与逼真性．     

An efficient spectral method and rigorous error analysis based on dimension reduction scheme for fourth order problems

In this paper, we propose an effective spectral method based on dimension reduction scheme for fourth order problems in polar geometric domains. First, the original problem is decomposed into a series of one‐dimensional fourth order problems by polar coordinate transformation and the orthogonal properties of Fourier basis function. Then the weak form and the corresponding discrete scheme of each one‐dimensional fourth order problem are derived by introducing polar conditions and appropriate weighted Sobolev spaces. In addition, we define the projection operators in the weighted Sobolev space and give its approximation properties, and further prove the error estimation of each one‐dimensional fourth order problem. Finally, we provide some numerical examples, and the numerical results show the effectiveness of our algorithm and the correctness of the theoretical results.     

Stochastic model order reduction in randomly parametered linear dynamical systems

This study focuses on the development of reduced order models for stochastic analysis of complex large ordered linear dynamical systems with parametric uncertainties, with an aim to reduce the computational costs without compromising on the accuracy of the solution. Here, a twin approach to model order reduction is adopted. A reduction in the state space dimension is first achieved through system equivalent reduction expansion process which involves linear transformations that couple the effects of state space truncation in conjunction with normal mode approximations. These developments are subsequently extended to the stochastic case by projecting the uncertain parameters into the Hilbert subspace and obtaining a solution of the random eigenvalue problem using polynomial chaos expansion. Reduction in the stochastic dimension is achieved by retaining only the dominant stochastic modes in the basis space. The proposed developments enable building surrogate models for complex large ordered stochastically parametered dynamical systems which lead to accurate predictions at significantly reduced computational costs.     

A simple method for estimating the fractal dimension from digital images: The compression dimension

The fractal structure of real world objects is often analyzed using digital images. In this context, the compression fractal dimension is put forward. It provides a simple method for the direct estimation of the dimension of fractals stored as digital image files. The computational scheme can be implemented using readily available free software. Its simplicity also makes it very interesting for introductory elaborations of basic concepts of fractal geometry, complexity, and information theory. A test of the computational scheme using limited-quality images of well-defined fractal sets obtained from the Internet and free software has been performed. Also, a systematic evaluation of the proposed method using computer generated images of the Weierstrass cosine function shows an accuracy comparable to those of the methods most commonly used to estimate the dimension of fractal data sequences applied to the same test problem.     

An efficient computational method for the optimal control problem for the Burgers equation

Pointwise control of the viscous Burgers equation in one spatial dimension is studied with the objective of minimizing the distance between the final state function and target profile along with the energy of the control. An efficient computational method is proposed for solving such problems, which is based on special orthonormal functions that satisfy the associated boundary conditions. Employing these orthonormal functions as a basis of a modal expansion method, the solution space is limited to the smallest lower subspace that is sufficient to describe the original problem. Consequently, the Burgers equation is reduced to a set of a minimal number of ordinary nonlinear differential equations. Thus, by the modal expansion method, the optimal control of a distributed parameter system described by the Burgers equation is converted to the optimal control of lumped parameter dynamical systems in finite dimension. The time-variant control is approximated by a finite term of the Fourier series whose unknown coefficients and frequencies giving an optimal solution are sought, thereby converting the optimal control problem into a mathematical programming problem. The solution space obtained is based on control parameterization by using the Runge–Kutta method. The efficiency of the proposed method is examined using a numerical example for various target functions.     

Numerical Algorithm with Fourth-Order Spatial Accuracy for Solving the Time-Fractional Dual-Phase-Lagging Nanoscale Heat Conduction Equation

Nanoscale heat transfer cannot be described by the classical Fourier law due to the very small dimension, and therefore, analyzing heat transfer in nanoscale is of crucial importance for the design and operation of nano-devices and the optimization of thermal processing of nano-materials. Recently, time-fractional dual-phase-lagging (DPL) equations with temperature jump boundary conditions have showed promising for analyzing the heat conduction in nanoscale. This article proposes a numerical algorithm with high spatial accuracy for solving the time-fractional dual-phase-lagging nano-heat conduction equation with temperature jump boundary conditions. To this end, we first develop a fourth-order accurate and unconditionally stable compact finite difference scheme for solving this time-fractional DPL model. We then present a fast numerical solver based on the divide-and-conquer strategy for the obtained finite difference scheme in order to reduce the huge computational work and storage. Finally, the algorithm is tested by two examples to verify the accuracy of the scheme and computational speed. And we apply the numerical algorithm for predicting the temperature rise in a nano-scale silicon thin film. Numerical results confirm that the present difference scheme provides ${\rm min}\{2−α, 2−β\}$ order accuracy in time and fourth-order accuracy in space, which coincides with the theoretical analysis. Results indicate that the mentioned time-fractional DPL model could be a tool for investigating the thermal analysis in a simple nanoscale semiconductor silicon device by choosing the suitable fractional order of Caputo derivative and the parameters in the model.     

运动壁面槽道流动的直接数值模拟

采用谱方法,在曲线坐标系下对不可压缩Newton流体的N-S方程进行求解,采用定义在物理空间中的流动物理量以避免使用协变、逆变形式的控制方程．在计算空间采用Fourier-Chebyshev谱方法进行空间离散,时间推进采用高精度时间分裂法．为了减小时间分裂带来的误差,采用了高精度的压力边界条件．与其他求解协变、逆变形式控制方程的谱方法相比,该方法在保持谱精度的同时减小了计算量．首先通过静止波形壁面和行波壁面槽道湍流的直接数值模拟,对该数值方法进行了验证;其次,作为初步应用,利用该方法研究了槽道湍流中周期振动凹坑所产生的流动结构．     

A collocation method for high-frequency scattering by convex polygons

We consider the problem of scattering of a time-harmonic acoustic incident plane wave by a sound soft convex polygon. For standard boundary or finite element methods, with a piecewise polynomial approximation space, the computational cost required to achieve a prescribed level of accuracy grows linearly with respect to the frequency of the incident wave. Recently Chandler–Wilde and Langdon proposed a novel Galerkin boundary element method for this problem for which, by incorporating the products of plane wave basis functions with piecewise polynomials supported on a graded mesh into the approximation space, they were able to demonstrate that the number of degrees of freedom required to achieve a prescribed level of accuracy grows only logarithmically with respect to the frequency. Here we propose a related collocation method, using the same approximation space, for which we demonstrate via numerical experiments a convergence rate identical to that achieved with the Galerkin scheme, but with a substantially reduced computational cost.