线性齐次偏微分方程组吴特征列和 Janet 基的等价性

本文简单介绍了吴微分特征列和Janet基,利用线性齐次微分方程组既约化基的概念,证明了线性齐次偏微分方程组的正规化的吴微分特征列和正规化的、自约化的Janet基均是既约化基,从而由既约化基的唯一性,得到了它们的等价性定理。     

常系数非齐次线性微分方程特解的另一种求法

将常系数线性微分方程转化为一阶常系数线性微分方程组,并利用线性微分方程组的基解矩阵的性质和矩阵指数的性质以及非齐次线性微分方程组的常数变易公式,得到了常系数非齐次线性微分方程的积分形式的特解公式,并通过实例说明所得结论的有用性.     

零化多项式的一个应用

利用矩阵的零化多项式 ,给出计算标准基解矩阵 e At的一个公式 .利用向量关于矩阵的零化多项式 ,给出常系数齐次线性微分方程组初值问题的一个求解公式 .相应地 ,可以推出常系数齐次线性差分方程组在给定的初始条件下的一个求解公式 .     

用齐次化原理解线性非齐次微分方程

齐次化原理是求解线性非齐次偏微分方程的一种方法。本文利用这种方法求解线性非齐次常微分方程,并推导出解的一般公式。     

二阶线性微分方程的解法改进

本改进了二阶线性微分方程的朗期基解法，只要求出转化以后的一阶微分方程或二阶齐次线性微分方程的一个特解，即可求出二阶线性微分方程的通解。     

具非齐次线性部分的高阶非线性抛物型方程组初值问题的整体解

本文研究具有非齐次线性部分并且非线性部分不含低阶导数项的高阶非线性抛物型偏微分方程组小初值问题整体经典解的存在性     

线性非齐次微分方程（组）的算值解法

线性非齐次微分方程（组）的算值解法于桂珍（天津大学）根据线性非齐次微分方程（组）解的结构定理，线性非齐次微分方程（组）的通解等于对应的齐次方程（组）的通解加上非齐次方程（组）的一个特解。对于常系数线性方程（组）来说，当非齐次项为某些特殊形式时，可用待...     

Kadomtsev-Petviashvili方程的精确解

齐次平衡法是把非线性偏微分方程转换成带约束条件的线性偏微分方程的一种很好的方法 .本文在齐次平衡法的基础上具体讨论了KP方程的精确解 ,包括孤波解 ,一般的行波解 ,有理函数解和一种新类型的解 .     

具非齐次线性部分的高阶非线性抛物型方程组的初值问题

本文讨论线性部分为非齐次的高阶非线性抛物型偏微分方程组整体经典解的存在性，得到了这类问题对小初值而言存在整体经典解的一些充分条件．     

求高阶非齐次微分方程(组)特解的矩阵解法

给出了求一类高阶非齐次线性微分方程(组)特解的矩阵解法.即由对应齐次微分方程(组)的n个特解以及非齐次微分方程(组)的自由项构成某线性方程组的增广矩阵,并对该增广矩阵进行初等行变换,即可求得非齐次微分方程(组)特解的一种简便方法.     

诺特赋值环上Grbner基的性质

本文主要研究了诺特赋值环上多项式理想的Grbner基的性质.利用Buchberger算法,证明了约化Grbner基的存在性及当其首项系数为单位元时的唯一性.推广了极小Grbner基和约化Grbner基的概念.同时,我们给出了求极小Grbner基和约化Grbner基的算法.     

Some decision and counting problems of the Duquenne-Guigues basis of implications

Implications of a formal context obey Armstrong rules, which allows one to define a minimal (in the number of implications) implication basis, called Duquenne-Guigues basis or stem base in the literature. In this paper we show how implications are reduced to functional dependencies and prove that the problem of determining the size of the stem base is a #P-complete problem.     

Minimal condition for shortest vectors in lattices of low dimension

For a lattice, finding a nonzero shortest vector is computationally difficult in general. The problem becomes quite complicated even when the dimension of the lattice is five. There are two related notions of reduced bases, say, Minkowski-reduced basis and greedy-reduced basis. When the dimension becomes d = 5, there are greedy-reduced bases without achieving the first minimum while any Minkowski-reduced basis contains the shortest four linearly independent vectors. This suggests that the notion of Minkowski-reduced basis is somewhat strong and the notion of greedy-reduced basis is too weak for a basis to achieve the first minimum of the lattice. In this work, we investigate a more appropriate condition for a basis to achieve the first minimum for d = 5. We present a minimal sufficient condition, APG⁺, for a five dimensional lattice basis to achieve the first minimum in the sense that any proper subset of the required inequalities is not sufficient to achieve the first minimum.     

Empirical Gramian-based spatial basis functions for model reduction of nonlinear distributed parameter systems

Correct selection of spatial basis functions is crucial for model reduction for nonlinear distributed parameter systems in engineering applications. To construct appropriate reduced models, modelling accuracy and computational costs must be balanced. In this paper, empirical Gramian-based spatial basis functions were proposed for model reduction of nonlinear distributed parameter systems. Empirical Gramians can be computed by generalizing linear Gramians onto nonlinear systems, which results in calculations that only require standard matrix operations. Associated model reduction is described under the framework of Galerkin projection. In this study, two numerical examples were used to evaluate the efficacy of the proposed approach. Lower-order reduced models were achieved with the required modelling accuracy compared to linear Gramian-based combined spatial basis function- and spectral eigenfunction-based methods.     

A Reduced Basis Approach for Some Weakly Stochastic Multiscale Problems

In this paper,a multiscale problem arising in material science is considered.The problem involves a random coefficient which is assumed to be a perturbation of a deterministic coefficient,in a sense made precisely in the body of the text.The homogenized limit is then computed by using a perturbation approach.This computation requires repeatedly solving a corrector-like equation for various configurations of the material.For this purpose,the reduced basis approach is employed and adapted to the specific context.The authors perform numerical tests that demonstrate the efficiency of the approach.     

Continuity of the null space basis and constrained optimization

Many constrained optimization algorithms use a basis for the null space of the matrix of constraint gradients. Recently, methods have been proposed that enable this null space basis to vary continuously as a function of the iterates in a neighborhood of the solution. This paper reports results from topology showing that, in general, there is no continuous function that generates the null space basis of all full rank rectangular matrices of a fixed size. Thus constrained optimization algorithms cannot assume an everywhere continuous null space basis. We also give some indication of where these discontinuities must occur. We then propose an alternative implementation of a class of constrained optimization algorithms that uses approximations to the reduced Hessian of the Lagrangian but is independent of the choice of null space basis. This approach obviates the need for a continuously varying null space basis.Research supported by NSF grant MCS 81-15475 and DCR-8403483Research supported by ARO contracts DAAG 29-81-K-0108 and DAAG 29-84-K-0140     

三次数域的整基和幂元整基

如何有效地找出数域的整基，是人们长期思考的问题.本文给出了求三次数域的整基的一个简单方法.此外，人们还对数域是否存在幂元整基的问题感兴趣.二次域和分圆域均存在幂元整基，而对于三次数域情形，则尚不清楚.本文给出了三次数域存在幂元整基的充要条件，从而对于三次数域情形给出了完整的答案.     

On the Restricted Order of Asymptotic Bases of Order Two

The restricted order of an asymptotic basis A is the least integer h, if it exists, such that every sufficiently large integer is the sum of h or fewer distinct elements of A. We show that any asymptotic basis of order 2 has a restricted order at most equal to 4. We also provide an example of an additive basis of order 2 whose restricted order is 4.To Jean-Louis Nicolas2000 Mathematics Subject Classification: Primary—11B13     

An explicit basis for the admissible inference rules in the Gödel-Löb logic <Emphasis Type="Italic">GL</Emphasis>

We describe an explicit basis for the admissible inference rules in the Gödel-Löb logic. The basis consists of a sequence of inference rules in infinitely many variables. Inference rules in the reduced form play an important role in this study. Alongside a basis for the admissible rules we obtain a basis for the quasi-identities of the countable rank free algebra in the Gödel-Löb logic.     

Hilbert 空间中的广义正交基

广义正交基是Hilbert 空间中正交基的一个自然推广. 本文首先给出一个广义正交基存在的较弱的充要条件; 然后研究广义正交基的性质, 特别地, 得到广义正交基版本的一些有关正交基的经典性质, 如广义正交基的Bessel 等式和不等式等. 作为广义正交基的一个应用, 本文给出广义Riesz 基的一些新刻画. 最后本文讨论广义框架的冗余问题.