The author show that if A is a complex abelian Banach algebra with an identity, then the decomposability of T∈M(A),the set of all multipliers on A, implies that the corresponding multiplication operator T: M (A)→M (...The author show that if A is a complex abelian Banach algebra with an identity, then the decomposability of T∈M(A),the set of all multipliers on A, implies that the corresponding multiplication operator T: M (A)→M (A) is decompcoable, moreover, in the Hilbert algebras case the assumation that A is abelian and A has an identity can be released. Those results are partially answers to a question raised by K. B. Laursen and M. M. Neumann [5].展开更多
In this paper,we characterize the multipliers of generalized Bergman spaces A^p，q，α with 0＜p≤1, 0＜q, α<∞into some analytic function spaces and into sequence spaces,and show that the multipliers of A^p，q，...In this paper,we characterize the multipliers of generalized Bergman spaces A^p，q，α with 0＜p≤1, 0＜q, α<∞into some analytic function spaces and into sequence spaces,and show that the multipliers of A^p，q，α(0<p≤1,0<q, α<∞) into a given space are the same as those of A^p，α(0<p≤1, α>0) in almost every case considered. The corollaries on multipliers of the spaces A^p，q，α extend some related results.展开更多
In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two ...In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two stages. In the first stage the authors determine the unconstrained minimization and check its feasibility. The second stage, the authors explore the feasible region from initial point to another point until the authors get the optimal point by using Lagrange multiplier. A numerical example is included to support as illustration of the paper.展开更多
In this paper we consider the domain decomposition methods with mortar element Lagrange multipliers to two-dimensional elliptic problems.We shall construct a kind of simple preconditioners for the corresponding interf...In this paper we consider the domain decomposition methods with mortar element Lagrange multipliers to two-dimensional elliptic problems.We shall construct a kind of simple preconditioners for the corresponding interface equation.It will be shown that condition number of the preconditioned interface matrix is almost optimal.展开更多
In this paper we consider domain decomposition methods for three-dimensional elliptic problems with Lagrange multipliers, and construct a kind of simple preconditioner for the corresponding interface equation. It will...In this paper we consider domain decomposition methods for three-dimensional elliptic problems with Lagrange multipliers, and construct a kind of simple preconditioner for the corresponding interface equation. It will be shown that condition number of the resulting preconditioned interface matrix is almost optimal.展开更多
文摘The author show that if A is a complex abelian Banach algebra with an identity, then the decomposability of T∈M(A),the set of all multipliers on A, implies that the corresponding multiplication operator T: M (A)→M (A) is decompcoable, moreover, in the Hilbert algebras case the assumation that A is abelian and A has an identity can be released. Those results are partially answers to a question raised by K. B. Laursen and M. M. Neumann [5].
文摘In this paper,we characterize the multipliers of generalized Bergman spaces A^p，q，α with 0＜p≤1, 0＜q, α<∞into some analytic function spaces and into sequence spaces,and show that the multipliers of A^p，q，α(0<p≤1,0<q, α<∞) into a given space are the same as those of A^p，α(0<p≤1, α>0) in almost every case considered. The corollaries on multipliers of the spaces A^p，q，α extend some related results.
文摘In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two stages. In the first stage the authors determine the unconstrained minimization and check its feasibility. The second stage, the authors explore the feasible region from initial point to another point until the authors get the optimal point by using Lagrange multiplier. A numerical example is included to support as illustration of the paper.
基金This research is supported by Special Funds for Major State Basic Research Projects of China (G1999032804).
文摘In this paper we consider the domain decomposition methods with mortar element Lagrange multipliers to two-dimensional elliptic problems.We shall construct a kind of simple preconditioners for the corresponding interface equation.It will be shown that condition number of the preconditioned interface matrix is almost optimal.
基金This research is supported by the Special Funds for Major State Research Projects of China(G 1999032804)
文摘In this paper we consider domain decomposition methods for three-dimensional elliptic problems with Lagrange multipliers, and construct a kind of simple preconditioner for the corresponding interface equation. It will be shown that condition number of the resulting preconditioned interface matrix is almost optimal.
