复数四则运算学习谈

<正>对于复数的运算来说,涉及的有复数的加法、减法、乘法及乘方运算,对于复数的加法和减法,则与多项式化简中的合并同类项相似,即实部、虚部分别相加和相减;对于复数的乘法则与多项式的乘法是类似的,只是在运算的过程中把i2换成-1,然后把实部和虚部分别合并.要注意共轭复数的运算,对于复数的乘方,则适用指数幂的运算规律.对于复数的除法,是将分子分母都乘以分母的共轭复数,并     

基于双AR(p)模型的股价分析及其实证研究

在双AR(p)模型的基础上,选取了具有代表性的沪深300指数,并对其部分股市收盘价序列进行了平稳化处理,研究了近期中国股市的股价波动.在双.AR(p)模型严平稳条件下进行了模型诊断,最后通过动态预测得出双AR(p)模型可用于股价预测的结论.     

基于残差GM(1,1)模型的强(弱)化缓冲算子还原模型

残差GM(1,1)模型预测效果相对于GM(1,1)模型较好,但是其要求残差尾段符号一致的自身缺陷常常存在,在实际工作中难以运用,需要解决其自身缺陷,故本篇提出新的模型,即基于残差尾段的强(弱)化缓冲算子还原模型.在残差GM(1,1)模型的基础上,以残差尾段序列作为原始数据,判断其是否满足灰色建模条件,如满足,则直接建模;如不满足,需要对其进行序列算子强(弱)化处理,进行GM(1,1)建模,之后进行强(弱)化缓冲算子还原.以实例为证,最终结果表明强(弱)化缓冲算子还原模型的预测精度稍有提高,且解决了自身缺陷和允许序列不符合灰色建模(诱发缺陷)的情况出现.     

用改进的模糊AR(p)与指数平滑组合模型预测油田产油量

在模糊AR(p)与指数平滑组合预测模型的基础上,通过对传统指数平滑模型的分析,提出了动态平滑参数的概念,并由此建立了平滑权重对时间序列能够适应的新的指数平滑模型,较完整地解决了传统模型初值难以选取,平滑参数适应性差和系统预测偏差大等问题,从而较传统指数平滑模型有较高的预测精度.并将这两种模型结合起来构成新的改进的模糊AR(p)与指数平组合预测模型,并应用于预测油田产油量.应用实例证明,改进的模糊AR(p)与指数平滑组合预测模型具有更高的预测精度.从而表明该组合预测模型是一种非常有效的预测新方法.     

有理数的乘法运算策略几例

有理数乘法运算是继加法和减法运算后的又一种运算,也是有理数除法运算和乘方运算的基础,学好有理数乘法运算是学好有理数运算的关键,在进行有理数乘法运算时,要注意根据题目的特点,灵活选取合理的方法,才     

Pascal算子矩阵在组合恒等式中的应用

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

Pascal算子矩阵在组合恒等式中的应用(英文)

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

L-模糊自然数的乘法运算和幂运算

在L是完全分配格时,定义了L-模糊自然数的乘法运算和幂运算,研究了乘法运算、幂运算的交换律、结合律以及乘法对加法的分配律等性质。     

黄金价格(AU99.99)的季节性风险预测

选用了经典的AR(1)-EGARCH(1,1)模型和极大似然估计来获得黄金收益率的条件均值和条件方差的估计.接着,利用极值理论模拟了标准独立化以后的残差序列.最终预测了每个季度的VaR和CVaR,进而研究了黄金价格的季节性风险.     

灰色时序组合模型及其在地下水埋深预测中的应用

地下水埋深的变化过程是一个复杂的非线性过程,这种具有复杂的非线性组合特征的序列,使用某一种模型进行预测,结果往往不理想.在分析了灰色GM(1,1)模型、灰色GM(1,1)周期性修正模型和时序AR(n)模型的优点和缺点基础上,提出了一种新的灰色时序组合预报模型.该方法利用了GM预测所需原始数据少、方法简单的优点,用周期修正方法反映其地下水位埋深周期性波动的特征,用AR(n)模型预报其地下水位埋深的随机变化.实例研究表明,这种方法方便简洁实用且预测结果接近于实际观测值,为其它地区的地下水位埋深和相关时间序列的分析研究提供参考与借鉴作用.     

Spectral Analysis of Differential Operators with Involution and Operator Groups

We study the spectral properties of differential operators with involution of the following two types: operators with involution multiplying the potential and operators with involution multiplying the derivative. The similar operator method is used to obtain a refined asymptotics of the eigenvalues and eigenvectors of such operators. These asymptotics are used to derive asymptotic formulas for the operator groups generated by the operators in question. These operator groups can be used to describe mild solutions of the corresponding mixed problems.     

Linear differential-algebraic equations perturbed by Volterra integral operators

We study linear inhomogeneous vector ordinary differential equations of arbitrary order in which the matrix multiplying the highest derivative of the unknown vector function is singular in the domain where the equations are defined. We also study perturbations (not necessarily small) of such equations, which are linear integro-differential equations with a Volterra operator. We obtain sufficient conditions for the solvability of such equations and give representations of their general solutions; solvability and uniqueness conditions are also given for initial value problems for such equations. The influence of small perturbations of the free term and the initial data on the solution is considered. A numerical method is suggested. The results of numerical experiments are given.     

Averaging of random walks and shift-invariant measures on a Hilbert space

We study random walks in a Hilbert space H and representations using them of solutions of the Cauchy problem for differential equations whose initial conditions are numerical functions on H. We construct a finitely additive analogue of the Lebesgue measure: a nonnegative finitely additive measure λ that is defined on a minimal subset ring of an infinite-dimensional Hilbert space H containing all infinite-dimensional rectangles with absolutely converging products of the side lengths and is invariant under shifts and rotations in H. We define the Hilbert space H of equivalence classes of complex-valued functions on H that are square integrable with respect to a shift-invariant measure λ. Using averaging of the shift operator in H over random vectors in H with a distribution given by a one-parameter semigroup (with respect to convolution) of Gaussian measures on H, we define a one-parameter semigroup of contracting self-adjoint transformations on H, whose generator is called the diffusion operator. We obtain a representation of solutions of the Cauchy problem for the Schrödinger equation whose Hamiltonian is the diffusion operator.     

非嵌套网格上的Morley元两水平加性Schwarz方法

1．引言设0是RZ中的有界多边形区域，其边界为Rfl．考虑下面的重调和Dirichlet问题：（1．1）的变分形式为：求。EHI（fi）使得对？／EL‘（m，问题（1．幻的唯一可解性可由冯（m上的M线性型的强制性和连续性以及La。Mlgram定理得出（of［4］）．令人一｛丸）是n的一个三角剖分，并且满足最小角条件，其中h是它的网格参数．设Vh为Money元空间［41．问题（1．2）的有限元离散问题为：求。eVh使得当有限元参数人很小时，这个方程组很大，而且矩阵A的条件数变得非常大，直接求解，存贮量及计算量都很大．如果B可逆，则方程组（1．4）等…     

Regularized additive operator-difference schemes

The construction of additive operator-difference (splitting) schemes for the approximate solution Cauchy problem for the first-order evolutionary equation is considered. Unconditionally stable additive schemes are constructed on the basis of the Samarskii regularization principle for operator-difference schemes. In the case of arbitrary multicomponent splitting, these schemes belong to the class of additive full approximation schemes. Regularized additive operator-difference schemes for evolutionary problems are constructed without the assumption that the regularizing operator and the operator of the problem are commutable. Regularized additive schemes with double multiplicative perturbation of the additive terms of the problem’s operator are proposed. The possibility of using factorized multicomponent splitting schemes, which can be used for the approximate solution of steadystate problems (finite difference relaxation schemes) are discussed. Some possibilities of extending the proposed regularized additive schemes to other problems are considered.     

谱表示

<正> Stone M.对Hilbert空间中一个具有简单谱的自伴算子建立了谱表示定理,即有实轴上的有限Borel测度μ,使得同构于L~2(μ),同时变A为乘以自变量λ的算子.Jauch等([2])讨论了一列交换的自伴算子完全集谱表示定理,但要求一个关于测度绝对连续性的假定.此外,依据约化理论([3])可知,如果A是可分Hilbert空间的自伴     

Construction of splitting schemes based on transition operator approximation

The stability analysis of approximate solutions to unsteady problems for partial differential equations is usually based on the use of the canonical form of operator-difference schemes. Another possibility widely used in the analysis of methods for solving Cauchy problems for systems of ordinary differential equations is associated with the estimation of the norm of the transition operator from the current time level to a new one. The stability of operator-difference schemes for a first-order model operator-differential equation is discussed. Primary attention is given to the construction of additive schemes (splitting schemes) based on approximations of the transition operator. Specifically, classical factorized schemes, componentwise splitting schemes, and regularized operator-difference schemes are related to the use of a certain multiplicative transition operator. Additive averaged operator-difference schemes are based on an additive representation of the transition operator. The construction of second-order splitting schemes in time is discussed. Inhomogeneous additive operator-difference schemes are constructed in which various types of transition operators are used for individual splitting operators.     

B-Bounded semigroups and applications

Summary We study a new one-parameter family of linear bounded operators Y(t), tO which is uniquely defined by a linear operator A, not necessarily bounded, and by a linear bounded operator B. The definition of Y(t), t 0 given in Section 2 was suggested by a particle transport problem with multiplying boundary conditions.     

Multiplicative Correction of a Matrix on a Sequence of Subspaces. I: Basic Algorithms and Theory for General Unsymmetric Matrices

The paper considers the problem of a guaranteed improvement of matrix properties by preconditioning. An algorithm for constructing the so-called correcting operators, differing from the identity matrix by a small-rank term, is suggested. A correcting operator improves the matrix action on a subspace of small dimension and provides the possibility of controlling its action on the complementary subspace. In the algorithm suggested, correcting operators are computed by using the operation of multiplying the original matrix by a vector. The resulting preconditioner is a composition of basic correctors. Its nonsingularity is established in the general unsymmetric and indefinite case, and estimates enabling one to predict the convergence properties of the corresponding iterative algorithm are obtained. In order to reduce the arithmetic and memory costs, it is suggested to replace correcting operators by their approximations. Estimates for the resulting deterioration of the preconditioning quality are presented. Bibliography: 3 titles.     

Power average operators of trapezoidal intuitionistic fuzzy numbers and application to multi-attribute group decision making

Trapezoidal intuitionistic fuzzy numbers (TrIFNs) is a special intuitionistic fuzzy set on a real number set. TrIFNs are useful to deal with ill-known quantities in decision data and decision making problems themselves. The focus of this paper is on multi-attribute group decision making (MAGDM) problems in which the attribute values are expressed with TrIFNs, which are solved by developing a new decision method based on power average operators of TrIFNs. The new operation laws for TrIFNs are given. From a viewpoint of Hausdorff metric, the Hamming and Euclidean distances between TrIFNs are defined. Hereby the power average operator of real numbers is extended to four kinds of power average operators of TrIFNs, involving the power average operator of TrIFNs, the weighted power average operator of TrIFNs, the power ordered weighted average operator of TrIFNs, and the power hybrid average operator of TrIFNs. In the proposed group decision method, the individual overall evaluation values of alternatives are generated by using the power average operator of TrIFNs. Applying the hybrid average operator of TrIFNs, the individual overall evaluation values of alternatives are then integrated into the collective ones, which are used to rank the alternatives. The example analysis shows the practicality and effectiveness of the proposed method.