三角级数在Burgers-KdV混合型方程中的应用

利用三角级数法将Burgers-KdV混合型方程转化为一组非线性代数方程,进而用待定系数法求解方程组,最后求出了Burgers-KdV混合型方程的精确解.     

无拉力Winkler地基上自由边矩形Reissner板的弯曲

本文提出了一种求解无拉力Winkler地基上自由边矩形Reissner板受任意载荷的弯曲问题的解析方法.通过适当设定满足可导条件的Fourier级数加补充项形式的挠度函数和剪力函数,把给定边界条件下的微分方程化成最简形式的无穷代数方程组.对于常规的Winkler地基,可直接求解;而对于无拉力Winkler地基,方程组为一组弱非线性代数方程组.使用迭代法容易得到解.     

模糊数在股本权证定价中的应用

采用Ukhov权证定价模型求解权证价值的过程中,需要求解一个非线性方程组．但是采用数值法得到的最优解与精确解往往有一定偏差．针对这个情况,本文采用模糊数刻画非线性方程组的解,得到不确定形式的股本权证定价模型,并给出一定可信度下权证的模糊价格区间．同时也给出了给定任意一个权证价格求其对应的可信度的优化算法．数值算例验证了该文方法的有效性．     

用改进的代数方法构造(2+1)维ZK-MEW方程的精确行波解

利用一种改进的统一代数方法将构造(2+1)维ZK MEW((2+1)-dimensionalZakharov-Kuznetsovmodifiedequalwidth)方程精确行波解的问题转化为求解一组非线性的代数方程组．再借助于符号计算系统Mathematica求解所得到的非线性代数方程组,最终获得了方程的多种形式的精确行波解．其中包括有理解,三角函数解,双曲函数解,双周期Jacobi椭圆函数解,双周期Weierstrass椭圆形式解等．并给出了部分解的图形.     

变系数李方程组的精确行波解

利用修正的简单方程法对变系数李方程组进行求解,给出了变系数李方程组的双曲函数形式的行波解,当参数取特殊值时,便可以得到该方程组的精确孤波解.     

Zakharov—Shabat反散射方程的不可约形式

对求孤子解的Z-S反散射方程组,给出了它的等价的不可约形式。在求N-孤子解时,Z-S方程组由2N个线性代数方程组成,求解手续就是计算一个2N×2N矩阵之逆。而本文所得的它的不可约形式,是由N个线性代数方程组成的,求解只需计算一个N×N矩阵之逆,从而使计算量大大缩小。文未给出求两孤子解和呼吸子解的实际的简单计算和结果。     

信号处理中一类非线性方程组的快速求解

在声纳和雷达信号处理中,需要求解一类维数可变的非线性方程组,这类方程组具有混合三角多项式方程组形式.由于该问题有很多解,且其对应的最小二乘问题有很多局部极小点,用牛顿法等传统的迭代法很难找到有物理意义的解.若把它化为多项式方程组,再用解多项式方程组的符号计算方法或现有的同伦方法求解,由于该问题规模太大而不能在规定的时间内求解,而当考虑的问题维数较大时,利用已有的方法甚至根本无法求解.综合利用我们提出的解混合三角多项式方程组的混合同伦方法和保对称的系数参数同伦方法,我们给出该类问题一种有效的求解方法.利用这种方法,可以达到实时求解的目的,满足实际问题的需要.     

一类多节对偶积分方程组正则化为超(强)奇异积分方程组求解法

基于Mellin变换法,首先方程组进行Mellin变换,然后,通过引入新的未知函数的Mellin变换代换原来未知函数的Mellin变换,使对偶积分方程组退耦正则化为超(强)奇异积分方程组．将未知函数分解并表示成未知函数和已知幂函数的乘积,幂指数(a_i,v_i)需使超(强)奇异积分方程组中的超(强)奇异积分,在端点(a_i,b_i)有界或可积奇异,求解超(强)奇异积分方程组可以使用有限部分积分式．将未知函数展成任意完备函数系(?)_n*(u)的级数,将超(强)奇异积分方程组,化成线性代数方程组,通过求解级数中的各项系数,由此给出对偶积分方程组的一般性解．并严格证明了对偶积分方程组和由它化成的超(强)奇异积分方程组的等价性,解的存在性和解的表示形式不唯一性．本文给出的理论解和解法,可供求解数学,物理,力学中的混合边值问题应用．     

用改进的代数方法构造(2+1)维ZK-MEW方程的精确行波解

利用一种改进的统一代数方法将构造(2+1)维ZK-MEW((2+1)-dimensional Zakharov-Kuznetsov modified equal width)方程精确行波解的问题转化为求解一组非线性的代数方程组。再借助于符号计算系统Mathematica求解所得到的非线性代数方程组,最终获得了方程的多种形式的精确行波解。其中包括有理解,三角函数解,双曲函数解,双周期Jacobi椭圆函数解,双周期Weierstrass椭圆形式解等。并给出了部分解的图形。     

一类线性方程组的解的公式

本文在[1]的基础上,引进了递差方阵 D,给出了 Vandermonde 型阵 V_m 的逆阵的显示式,从而得到了方程组(1),(1′)的可供直接计算用的用三角阵表示的解的公式.此外,还得到了包括[2]的化(1′)为三角形方程组的结果.     

On implicit systems of differential equations

This article considers implicit systems of differential equations. The implicit systems that are considered are given by polynomial relations on the coordinates of the indeterminate function and the coordinates of the time derivative of the indeterminate function. For such implicit systems of differential equations, we are concerned with computing algebraic constraints such that on the algebraic variety determined by the constraint equations the original implicit system of differential equations has an explicit representation. Our approach is algebraic. Although there have been a number of articles that approach implicit differential equations algebraically, all such approaches have relied heavily on linear algebra. The approach of this article is different, we have no linearity requirements at all, instead we rely on algebraic geometry. In particular, we use birational mappings to produce an explicit system. The methods developed in this article are easily implemented using various computer algebra systems.     

Sine‐cosine wavelet method for fractional oscillator equations

Purpose In this article, a novel computational method is introduced for solving the fractional nonlinear oscillator differential equations on the semi‐infinite domain. The purpose of the proposed method is to get better and more accurate results. Design/methodology/approach The proposed method is the combination of the sine‐cosine wavelets and Picard technique. The operational matrices of fractional‐order integration for sine‐cosine wavelets are derived and constructed. Picard technique is used to convert the fractional nonlinear oscillator equations into a sequence of discrete fractional linear differential equations. Operational matrices of sine‐cosine wavelets are utilized to transformed the obtained sequence of discrete equations into the systems of algebraic equations and the solutions of algebraic systems lead to the solution of fractional nonlinear oscillator equations. Findings The convergence and supporting analysis of the method are investigated. The operational matrices contains many zero entries, which lead to the high efficiency of the method, and reasonable accuracy is achieved even with less number of collocation points. Our results are in good agreement with exact solutions and more accurate as compared with homotopy perturbation method, variational iteration method, and Adomian decomposition method. Originality/value Many engineers can utilize the presented method for solving their nonlinear fractional models.     

Parametric continuation of the solitary traveling pulse solution in the reaction-diffusion system using the Newton-Krylov method

The matrix-free Newton-Krylov method that uses the GMRES algorithm (an iterative algorithm for solving systems of linear algebraic equations) is used for the parametric continuation of the solitary traveling pulse solution in a three-component reaction-diffusion system. Using the results of integration on a short time interval, we replace the original system of nonlinear algebraic equations by another system that has more convenient (from the viewpoint of the spectral properties of the GMRES algorithm) Jacobi matrix. The proposed parametric continuation proved to be efficient for large-scale problems, and it made it possible to thoroughly examine the dependence of localized solutions on a parameter of the model.     

Real zeros of the zero-dimensional parametric piecewise algebraic variety

The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems containing strict inequalities. With the regular decomposition of semi-algebraic systems and the partial cylindrical algebraic decomposition method, we give a method to compute the supremum of the number of torsion-free real zeros of a given zero-dimensional parametric piecewise algebraic variety, and to get distributions of the number of real zeros in every n-dimensional cell when the number reaches the supremum. This method also produces corresponding necessary and sufficient conditions for reaching the supremum and its distributions. We also present an algorithm to produce a necessary and sufficient condition for a given zero-dimensional parametric piecewise algebraic variety to have a given number of distinct torsion-free real zeros in every n-cell in the n-complex. This work was supported by National Natural Science Foundation of China (Grant Nos. 10271022, 60373093, 60533060), the Natural Science Foundation of Zhejiang Province (Grant No. Y7080068) and the Foundation of Department of Education of Zhejiang Province (Grant Nos. 20070628 and Y200802999)     

Asymptotically normal estimates of solutions of systems of linear algebraic equations. II

For the regularized solutions of systems of linear algebraic equations we find statistical estimates with respect to observations over the coefficient matrix of the system of equations. Under certain conditions it is proved that these estimates are asymptotically normal.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 7, pp. 900–907, July, 1990.     

Finite-difference methods for solving loaded parabolic equations

Loaded partial differential equations are solved numerically. For illustrative purposes, a boundary value problem for a parabolic equation with various point loads is considered. By applying difference approximations, the problems are reduced to systems of algebraic equations of special structure, which are solved using a parametric representation involving solutions of auxiliary linear systems with tridiagonal matrices. Numerical results are presented and analyzed.     

Parallel algorithms for Gröbner-basis construction

The problem of the Gröbner-basis construction is important both from the theoretical and applied points of view. As examples of applications of Gröbner bases, one can mention the consistency problem for systems of nonlinear algebraic equations and the determination of the number of solutions to a system of nonlinear algebraic equations. The Gröbner bases are actively used in the constructive theory of polynomial ideals and at the preliminary stage of numerical solution of systems of nonlinear algebraic equations. Unfortunately, many real examples cannot be processed due to the high computational complexity of known algorithms for computing the Gröbner bases. However, the efficiency of the standard basis construction can be significantly increased in practice. In this paper, we analyze the known algorithms for constructing the standard bases and consider some methods for increasing their efficiency. We describe a technique for estimating the efficiency of paralleling the algorithms and present some estimates.     

Counting solutions of polynomial systems via iterated fibrations

The paper introduces a new polynomial to count the solutions of a system of polynomial equations and inequations over an algebraically closed field of characteristic zero based on the triangular decomposition algorithm by J. M. Thomas of the nineteen-thirties. In the special case of projective varieties examples indicate that it is a finer invariant than the Hilbert polynomial. Received: 8 March 2008; Revised: 12 August 2008     

Solving triangular algebraic systems by means of simultaneous iterations

Our aim in this paper is to extend a variant of the Weierstrass method for the simultaneous computation of the solutions of a triangular algebraic system of equations. The appropriate tools are the symmetric functions of the roots of a polynomial. Using these symmetric functions we give another equivalent formulation for the search of all the roots of a triangular algebraic system. Using the latter formulation our method consists in solving a more simple system (where partial degrees of all the equations do not exceed 1) by Newton’s method. The quadratic convergence of our method is an immediate consequence of Newton’s method and need not be proved explicitly. This revised version was published online in June 2006 with corrections to the Cover Date.     

On solving composite power polynomial equations

It is well known that a system of power polynomial equations can be reduced to a single-variable polynomial equation by exploiting the so-called Newton's identities. In this work, by further exploring Newton's identities, we discover a binomial decomposition rule for composite elementary symmetric polynomials. Utilizing this decomposition rule, we solve three types of systems of composite power polynomial equations by converting each type to single-variable polynomial equations that can be solved easily. For each type of system, we discuss potential applications and characterize the number of nontrivial solutions (up to permutations) and the complexity of our proposed algorithmic solution.