矩阵多元多项式的带余除法及其应用

给出矩阵多元多项式的带余除法,从而用微分代数的观点,得到把一类微分方程(组)化为无穷维Hamilton系统的充要条件及其具体无穷维Hamilton系统形式。再把此方法和吴方法相结合获得构造一类微分方程(组)的通解的新方法。几个例子表明这些方法都很有效的。     

A new approach to Bezout equations derived from multivariate polynomial matrices and real entire functions

This paper focuses on Bezout equations derived from multivariate polynomial matrices in which relationships between one primary variable and other variables are described by real entire functions. We propose a method for obtaining a solution belonging to a set of multivariate rational function matrices in which all entries are real entire functions with respect to the primary variable. The proposed method is based on a new approach that overcomes the constraints and difficulties due to many variables by expanding a class of solutions to multivariate rational function matrices.     

一类矩阵多项式秩的恒等式

得到了一类矩阵多项式秩的恒等式,改进和推广了近期的一些结果.     

秩为1矩阵的性质及应用

给出了秩1矩阵的结构,讨论了这类矩阵在矩阵运算、对角化、标准型等方面的性质,推广和改进了文[1]的一些相关结果,并指出了它的若干应用,重点讨论了一类矩阵,得到了有关结论和方法.     

An error-free algorithm to solve a linear system of polynomial equations

The paper presents an error-free algorithm to solve a system of linear equations with polynomial coefficients. Modular arithmetic in residual polynomial class and in residual numeric class is employed. The algorithm is iterative and well suited for implementation for computers with vector operations and fast and error-free convolutors.     

Computational method based on Bernstein operational matrices for nonlinear Volterra-Fredholm-Hammerstein integral equations

In this paper, we present a method to solve nonlinear Volterra-Fredholm-Hammerstein integral equations in terms of Bernstein polynomials. Properties of these polynomials and operational matrix of integration together with the product operational matrix are first presented. These properties are then utilized to transform the integral equation to a matrix equation which corresponds to a system of nonlinear algebraic equations with unknown Bernstein coefficients. The method is computationally very simple and attractive and numerical examples illustrate the efficiency and accuracy of the method.     

一类矩阵多项式的秩特征

给出了一类矩阵多项式的秩特征定理及它的多种证法.     

Equation for a Product of Solutions of Two Different Schrödinger Equations

Under the assumption that potentials in two Schrödinger equations differ by a polynomial of degree k, we derive a (k+4)th-order equation for a function that is a product of solutions of these equations. Several examples of applications in physics are considered.     

Bezout equations over bivariate polynomial matrices related by an entire function

This study addresses Bezout equations over bivariate polynomial matrices, where the relationship between two variables is described by a real entire function. This paper proposes a solution method that makes optimal use of minor primeness to reduce such Bezout equations to simple equations over univariate scalar polynomials. The proposed solution method requires only matrix calculations, thus making it very useful, especially in the absence of modern computer algebra systems.     

Trilinear equations, Bell polynomials, and resonant solutions

A class of trilinear differential operators is introduced through a technique of assigning signs to derivatives and used to create trilinear differential equations. The resulting trilinear differential operators and equations are characterized by the Bell polynomials, and the superposition principle is applied to the construction of resonant solutions of exponential waves. Two illustrative examples are made by an algorithm using weights of dependent variables.     

Real valued iterative methods for solving complex symmetric linear systems

Complex valued systems of equations with a matrix R + 1S where R and S are real valued arise in many applications. A preconditioned iterative solution method is presented when R and S are symmetric positive semi‐definite and at least one of R, S is positive definite. The condition number of the preconditioned matrix is bounded above by 2, so only very few iterations are required. Applications when solving matrix polynomial equation systems, linear systems of ordinary differential equations, and using time‐stepping integration schemes based on Padé approximation for parabolic and hyperbolic problems are also discussed. Numerical comparisons show that the proposed real valued method is much faster than the iterative complex symmetric QMR method. Copyright © 2000 John Wiley & Sons, Ltd.     

两类循环分块矩阵及其有关算法

本文利用多项式矩阵最大右公因式，给出R-循环分块矩阵的和对称R-循环分块矩阵非奇异以及线性方程组反问题有唯一解的充要条件，进而得到它们求逆、线性方程组唯一解、线性方程组在循环分块矩阵中的反总问题求唯一解的算法。     

An iterative algorithm for solving a class of generalized coupled Sylvester-transpose matrix equations over bisymmetric or skew-anti-symmetric matrices

This paper presents an iterative algorithm to solve a class of generalized coupled Sylvester-transpose matrix equations over bisymmetric or skew-anti-symmetric matrices. When the matrix equations are consistent, the bisymmetric or skew-anti-symmetric solutions can be obtained within finite iteration steps in the absence of round-off errors for any initial bisymmetric or skew-anti-symmetric matrices by the proposed iterative algorithm. In addition, we can obtain the least norm solution by choosing the special initial matrices. Finally, numerical examples are given to demonstrate the iterative algorithm is quite efficient. The merit of our method is that it is easy to implement.     

Vector space of linearizations for the quadratic two-parameter matrix polynomial

Given a quadratic two-parameter matrix polynomial Q(λ,?μ), we develop a systematic approach to generating a vector space of linear two-parameter matrix polynomials. The purpose for constructing this vector space is that potential linearizations of Q(λ,?μ) lie in it. Then, we identify a set of linearizations and describe their constructions. Finally, we determine a class of linearizations for a quadratic two-parameter eigenvalue problem.     

On a class of iterative-difference equations

Solving the class of second order iterative-difference equations is a difficult problem, proposed as an open problem in Brillouët-Belluot [Aequationes Math. 61 (3) (2001), p. 304]. In this paper, we use three methods to approach such a class of equations, finding their affine solutions, proving the existence of their bounded continuous solutions and constructing their continuous and piecewise continuous solutions.     

A Space-Time Polynomial Collocation Method for Solving 3D Burgers Equations北大核心CSCD

Burgers方程是一类应用广泛的非线性偏微分方程,方程中的非线性项难以处理。该文提出一种新的时空多项式配点法——多项式特解法求解三维Burgers方程。求解过程分为两步:第一步,对三维Burgers方程中的线性导数项(包括时间导数项),求出相应的多项式特解。第二步,将求出的多项式特解作为基函数,对三维Burgers方程中剩余的非线性项进行迭代求解。与时空多项式函数作为基函数对三维Burgers方程进行直接求解相比,该算法简单易行,得到的近似解精度非常高,算法极其稳定,对于教学过程中提高学生的编程能力,加深对高维Burgers方程的理解能力以及Burgers方程的实际应用具有重要意义。