有限元模型综述——各类模型的力学背景及其有关数学问题

本文首先从广义变分原理出发用统一观点阐述了有限元的各种模型以及与之相关的数学问题.然后,利用广义伽略金方法阐述了近年得到迅速发展的加权余量法,特别介绍了由之导出的广义有限元模型的示例.     

Theory of Grobner Basesin Semigroup Algebra k[A]

TheoryofGr6bnerbasesinpolynomialalgebrak[X]isthemostfundamentalcomputationaltheoryincompilationalalgebraicgeometyll--5].Nevertheless,efficienciesofthealgorithmsofGrobnerbasesareverylowlybecauseofspecialpropertyofsymboliccomputation.Algorithmsinsemigr...     

半群代数中理想FA良序基的构造

讨论了在半群代数k[A]中,如何利用Gause-Jordan消元法去构造半群代数的理想的良序基,进而得到理想的良性基-Groedner-基。     

利用半群代数中良序基构造解稀疏多项式方程组特征值方法

本文利用半群代数k[A]中良序基,构造了求稀疏多项式方程组解的特征值矩阵,并给出了可以构造方阵的条件.     

The Supremum and Infimum of the Set of Fuzzy Numbers and Its Application

In 1986,Goetschel and Voxman represented a fuzzy number by two usualfunctions,which promote further development of the theory and application of fuzzynumbers.For example,we can embbed the fuzzy number space E~1 into a concreteBanach space by using this representation theorem(see[2—4]).     

RESEARCH ANNOUNCEMENTS——The Construction of Eigenvalue Problem Equivalent to Multivariate Polynomial System and the Groebner Basis

In this paper we will show that one cau build up a joint eigenvalue problem eq-uivalent to the. given system. By this way, finding the solutions of the given systemis equivalent to finding all eigenvalues and eigenvectors of one matrix or matrix pen-cil. For the special case that the system has finite isolated solutions, we can obtainall solutions through computing the eigenvalues and eigenvectors of a matrix whichcan Le obtained by Gauss-Jordan elimination. Furthermore, we also find that one canget Groebner Basis for the ideal geuerated by the given system iu this way. For any polynomial f(x)∈K[x_1,x_2,…,x_n],f(x) can be written as     

THE EIGENVALUE PROBLEM EQUIVALENT TO MULTIVARIATE POLYNOMIAL SYSTEM

In this paper, the authors proved that finding all solutions of a given multivariate polynomial system is equivalent to solving a relative joint eigenvalue problem(Theorem 1) and in some cases one can find all solutions of the given system from the eigenvalues and vectors of one matrix or matrix pencil (Theorem 2). Especially the situation that the ideal generated by the given system is 0-dimensional is discussed.     

A New Interior Path Following Method for Nonconvex Nonlinear Programming

Consider the following nonlinear programming problem:where f, gi's are sufficiently smooth functions in R~n. LetIt is well known that if x~*∈Ω is a solution of (1) then there exists λ~*=(λ_I~*,…,λ_m~*)∈R~m such that(x~*,λ~*) is a solution of the K-K-T system     

解约束序列极大极小问题的凝聚同伦方法

Consider the constrained sequential max-min problem (CSMMP):