共查询到20条相似文献,搜索用时 500 毫秒
1.
2.
I. Albarreal M.C. Calzada J.L. Cruz E. Fernández-Cara J. Galo M. Marín 《Numerische Mathematik》2002,93(2):201-221
Summary. This paper is concerned with the analysis of the convergence and the derivation of error estimates for a parallel algorithm
which is used to solve the incompressible Navier-Stokes equations. As usual, the main idea is to split the main differential
operator; this allows to consider independently the two main difficulties, namely nonlinearity and incompressibility. The
results justify the observed accuracy of related numerical results.
Received April 20, 2001 / Revised version received May 21, 2001 / Published online March 8, 2002
RID="*"
ID="*" Partially supported by D.G.E.S. (Spain), Proyecto PB98–1134
RID="**"
ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986
RID="**"
ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986
RID="*"
ID="*" Partially supported by D.G.E.S. (Spain), Proyecto PB98–1134
RID="**"
ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986
RID="**"
ID="**" Partially supported by D.G.E.S. (Spain) Proyecto PB96–0986 相似文献
3.
Closed kernel systems of the coalition matrix turn out to correspond to cones of games on which the core correspondence is
additive and on which the related barycentric solution is additive, stable and continuous. Different perfect cones corresponding
to closed kernel systems are described.
Received: December 2001/Revised: July 2002
RID="*"
ID="*" This note contains the new results, which were presented by the first author in an invited lecture at the XIV Italian
Meeting on Game Theory and Applications in Ischia, July 2001. The lecture was dedicated to Irinel Dragan on the occasion of
his seventieth birthday. 相似文献
4.
5.
In this work we analyze the paper “Brimberg, J. (1995): The Fermat-Weber location problem revisited. Mathematical Programming 71, 71–76” which claims to close the question on the conjecture posed by Chandrasekaran and Tamir in 1989 on the convergence
of the Weiszfeld algorithm. Some counterexamples are shown to the proofs showed in Brimberg’s paper.
Received: January 1999 / Accepted: December 2001?Published online April 12, 2002
RID="*"
ID="*"Partially supported by PB/11/FS/97 of Fundación Séneca of the Comunidad Autónoma de la Región de Murcia
RID="**"
ID="**"Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica (I+I+D), project TIC2000-1750-C06-06
RID="*"
RID="**" 相似文献
6.
Sigal Leviatan 《International Journal of Game Theory》2003,31(3):383-410
The consistent value is an extension of the Shapley value to the class of games with non-transferable utility.? In this paper,
the consistent value will be characterized for market games with a continuum of players of two types. We will show that for
such games the consistent value need not belong to the core, and provide conditions under which there is equivalence between
the two concepts.
Received: October 1998
RID="*"
ID="*" This thesis was completed under the supervision of Professor Sergiu Hart, The Center for Rationality and Interactive
Decision Theory, Department of Mathematics, Department of Economics, The Hebrew University of Jerusalem. I would like to thank
Professor Hart for introducing me to this area of research, for his help and guidance, and, especially, for all his patience.? I
would also like to thank Michael Borns for improving the style, and an anonymous referee for helpful comments. 相似文献
7.
8.
This paper introduces an exact primal augmentation algorithm for solving general linear integer programs. The algorithm iteratively
substitutes one column in a tableau by other columns that correspond to irreducible solutions of certain linear diophantine
inequalities. We prove that various versions of our algorithm are finite. It is a major concern in this paper to show how
the subproblem of replacing a column can be accomplished effectively. An implementation of the presented algorithms is given.
Computational results for a number of hard 0/1 integer programs from the MIPLIB demonstrate the practical power of the method.
Received: April 23, 2001 / Accepted: May 2002
Published online: March 21, 2003
RID="*"
ID="*" Supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt.
RID="*"
ID="*" Supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt.
RID="*"
ID="*" Supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt.
RID="#"
ID="#"Supported by a Gerhard-Hess-Preis and grant WE 1462 of the Deutsche Forschungsgemeinschaft, and by the European DONET
program TMR ERB FMRX-CT98-0202.
Mathematics Subject Classification (1991): 90C10 相似文献
9.
10.
In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs,
and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the
independent domination number can be computed in polynomial time within several classes of graphs, e.g., the class of locally
well-dominated graphs.
Received: September 13, 2001 Final version received: May 17, 2002
RID="*"
ID="*" Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093)
RID="†"
ID="†" Supported by RUTCOR
RID="*"
ID="*" Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093)
05C75, 05C69
Acknowledgments. The authors thank the referees for valuable suggestions. 相似文献
11.
Sung Y. Song 《Graphs and Combinatorics》2002,18(3):655-665
Fusion relations between the association schemes obtained by direct product and wreath product are established via a study
of their matrix representations. The character table of the scheme obtained by the wreath product is described and some algebraic
properties of the products are derived.
Received: May 7, 1999 Final version received: September 24, 1999
RID="*"
ID="*" 1991 Mathematics Subject Classification. Primary 05E30; Secondary 05B99
RID="*"
ID="*" Supported in part by Com 2MaC-KOSEF, POSTECH, Korea
Acknowledgments. The author is indebted to an anonymous referee who provided the complete proof of Theorem 4.2. 相似文献
12.
We prove versions of the Dual Ramsey Theorem and the Dual Ellentuck Theorem for families of partitions which are defined
in terms of games.
Received: 8 July 1999 Published online: 19 December 2002
RID="*"
ID="*" The author wishes to thank the Swiss National Science Foundation for supporting him.
The authors thank the referee for helpful comments.
Mathematics Subject Classification (2000): 03E02, 05D10, 03E35
Key words or phrases: Dual Ramsey Theorem – Dual Ellentuck Theorem – Partitions – Games 相似文献
13.
Summary. We derive error bounds for bivariate spline interpolants which are calculated by minimizing certain natural energy norms.
Received March 28, 2000 / Revised version received June 23, 2000 / Published online March 8, 2002
RID="*"
ID="*" Supported by the National Science Foundation under grant DMS-9870187
RID="**"
ID="**" Supported by the National Science Foundation under grant DMS-9803340 and by the Army Research Office under grant DAAD-19-99-1-0160 相似文献
14.
Effects of uncertainties in the domain on the solution of Dirichlet boundary value problems 总被引:1,自引:0,他引:1
Summary. A domain with possibly non-Lipschitz boundary is defined as a limit of monotonically expanding or shrinking domains with
Lipschitz boundary. A uniquely solvable Dirichlet boundary value problem (DBVP) is defined on each of the Lipschitz domains
and the limit of these solutions is investigated. The limit function also solves a DBVP on the limit domain but the problem
can depend on the sequences of domains if the limit domain is unstable with respect to the DBVP. The core of the paper consists
in estimates of the difference between the respective solutions of the DBVP on two close domains, one of which is Lipschitz
and the other can be unstable. Estimates for starshaped as well as rather general domains are derived. Their numerical evaluation
is possible and can be done in different ways.
Received October 16, 2001 / Revised version received January 16, 2002 / Published online: April 17, 2002
RID="*"
ID="*" The research was funded partially by the National Science Foundation under the grants NSF–Czech Rep. INT-9724783 and
NSF DMS-9802367
RID="**"
ID="**" Support for Jan Chleboun coming from the Grant Agency of the Czech Republic through grant 201/98/0528 is appreciated 相似文献
15.
Sergei. S. Goncharov Valentina. S. Harizanov Julia. F. Knight Charles F. D. McCoy 《Archive for Mathematical Logic》2003,42(3):279-291
Let 𝒜 be a computable structure and let R be a new relation on its domain. We establish a necessary and sufficient condition for the existence of a copy ℬ of 𝒜 in
which the image of R (?R, resp.) is simple (immune, resp.) relative to ℬ. We also establish, under certain effectiveness conditions on 𝒜 and R, a necessary and sufficient condition for the existence of a computable copy ℬ of 𝒜 in which the image of R (?R, resp.) is simple (immune, resp.).
Received: 4 February 2001 Published online: 5 November 2002
RID="*"
ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899.
RID="*"
ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899.
RID="*"
ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899. 相似文献
16.
Imre Patyi 《Mathematische Annalen》2003,326(3):417-441
Let X be a complex Banach space with a countable unconditional basis, Ω⊂X pseudoconvex open, G a complex Banach Lie group. We show that a Runge–type approximation hypothesis on X, G (which we also prove for G a solvable Lie group) implies that any holomorphic cocycle on Ω with values in G can be resolved holomorphically if it can be resolved continuously.
Received: 1 March 2002 /
Published online: 28 March 2003
Mathematics Subject Classification (2000): 32L05, 32E30, 46G20
RID="*"
ID="*" Kedves Szímuskának.
RID="*"
ID="*" To my dear Wife. 相似文献
17.
18.
We show that every 4-representative graph embedding in the double torus contains a noncontractible cycle that separates the
surface into two pieces. As a special case, every triangulation of the double torus in which every noncontractible cycle has
length at least 4 has a noncontractible cycle that separates the surface into two pieces.
Received: May 22, 2001 Final version received: August 22, 2002
RID="*"
ID="*" Supported by NSF Grants Numbers DMS-9622780 and DMS-0070613
RID="†"
ID="†" Supported by NSF Grants Numbers DMS-9622780 and DMS-0070430 相似文献
19.
Dedicated to the memory of Paul Erdős
A graph is called -free if it contains no cycle of length four as an induced subgraph. We prove that if a -free graph has n vertices and at least edges then it has a complete subgraph of vertices, where depends only on . We also give estimates on and show that a similar result does not hold for H-free graphs––unless H is an induced subgraph of . The best value of is determined for chordal graphs.
Received October 25, 1999
RID="*"
ID="*" Supported by OTKA grant T029074.
RID="**"
ID="**" Supported by TKI grant stochastics@TUB and by OTKA grant T026203. 相似文献