不可解方程

A complete boundary integral formulation for incompressible Navier Stokes equations with time discretization by operator splitting is developed by using the fundamental solutions of the Helmhotz operator equation with different orders.

利用不同阶次的Helmhotz算子方程的基本解，建立了时间离散不可压缩Navier－Stokes方程的完全边界积分表示式。

Let f be a solution of the higher order differential equation, a sufficient condition for f belonging to the weighted Dirichlet space D or to the Bergman space L, respectively, is obtained.

设f是高阶微分方程的解，得到了f分别属于加权Dirichlet空间D和Bergman空间L的一个充分条件，并得到了f是不可容许解的一个充分条件。

If you tried to solve the equations for the balloon's crazy flitter, its path would be nonlinear, therefore almost unsolvable, and therefore unforeseeable.

如果你试图用方程来解决气球那疯狂的飞舞运动，你会发现它的路径是非线性的，因此几乎是不可解的，这就导致了它的不可预测性。

Firstly, it's proved that the base of free monoid is unique, and that the equation of a base, a generating set and a irreducible generating set in the semigroup with length; Secondly, it's given the relation of a primitive word and a word of indecomposable--Let and is indecomposable, then is primitive ;And by using the length's method and chart,some properties of primitive word have been proved and the solutions of the equation , are discussed; Lastly, on the base of some proposition in Free monoids and Languages ,the proofs of some properties are improved by instruction. For example: Let be a primitive word over X, where .Then is a code. And let then if and only if {} is a code.

首先，讨论了含幺半群中基的基本性质及基与最小生成元集的联系，并给出了含幺半群中基、生成元集、不可约生成元集三者之间的关系；证明了在有唯一长度的半群S中，不可约生成元集、基、最小生成元集三者之间的等价关系；其次，讨论了字的组合与分解性，得出了字的本原性与不可分解性之间的关系---若为不可分解的，则一定是本原的，反之，不一定真；并运用图示法证明了字的可补性理论，讨论了方程，的可解性；在此基础上，用归纳法进一步证明了本原字与码的有关命题--若是X上的一个本原字，其中，则是一个码；若则当且仅当{}是一个码。

For the group representation, this paper improves the known method of determining the irreducibility. Instead of solving equations and checking every combination of the roots, we calculate the value of a polynomial.

对于自由群的表示，本文首先将不可约性的判别方法，由已有文献中解方程，并对方程的根作组合的方法，改进为直接计算某个多项式的值的方法，并进一步给出区分绝对不可约性和非绝对不可约性的判别准则。

For different polynomials g, if the characteristic polynomial of a n matrix A is irreducible, then we get some theorems to determine matrix equations g =A solvable; if it is reducible, then, to see n-dimension space vectors M over a field F as F-module, we use module theory to determine these equations solvable such that it is simpler and clearer to investigate these questions.

对于不同多项式g，当n阶矩阵A的特征多项式为不可约的，我们给出了矩阵方程g=A有解的判定定理；当A的特征多项式为可约的，把域F上的n维线性空间M作为由A导出的F -模，我们利用模论知识来决定矩阵方程g=A有解性，从而使这一问题变了简单，研究思路更加清晰。

Our analysis framework relies on the reflected Backward Stochastic Differential equation approach.We characterize the value functions of the noncallable bonds in terms of the reflected Backward Stochastic Differential equation,Then the relationship between the value function of convertible bonds and reflected backward stochastic differential equations with single reflect is built at the same time,and provide the optimal conversion strategy for bondholders.2:We get the value of non-callable convertible bonds by numerical methods.

探讨了可转换债券的最优停时价值与带反射边界倒向随机微分方程解的关系，在市场完备，公司价值只包括股权和可转债这两种权益等各种假定下，给出不可赎回可转换债券的价值函数，证明了不可赎回可转换债券的最优停时问题的解是存在的，同时给出了其最优的转换策略。2：通过数值方法求解不可赎回可转换债券的价值。

The third part of this paper aims to study the global solvability or nonsolvability of a semilinear parabolic equation with singular potential.

论文的第三部分是对带奇异项的半线性抛物方程的整体可解性和不可解性的研究。

In order to determine the solution set of the equation , by the means of meet-irreducible element and irredundant finite meet-decomposition, we first obtain the maximal solutions to the simple equation in the case that b has an irredundant finite meet-decomposition, and then consider the relation between the equation and the equation , based on this, we obtain the maximal solutions to the equation in the case that each element of the matrix B has an irredundant finite meet-decomposition and so determine its solution set completely.

为了确定方程的解集，本文利用交既约元与不可缩短的有限交分解等工具，同样地先求出简单形式的型矩阵方程的所有极大解，然后讨论方程与方程之间的关系，在此基础上，在B的每个元素均有不可缩短的有限交分解的情况下，求出了方程的所有极大解，从而完全确定了方程的解集。

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。