نتایج جستجو برای: thomas algorithm

تعداد نتایج: 778555  

Journal: :Bulletin du Cancer 2018

Journal: :The Iowa Review 2016

Journal: :Proceedings of the Royal Society of Edinburgh 1882

Journal: :Journal of Neurotherapy 2011

Journal: :J. Comb. Theory, Ser. A 2009
Ben Young

Abstract. We verify a recent conjecture of Kenyon/Szendrői by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson–Thomas theory of a non-commutative resolution of the conifold singularity {x1x2 −x3x4 = 0} ⊂ C. The proof does not require algebraic geo...

Journal: :Math. Comput. 2011
Carsten Carstensen Hella Rabus

Various applications in fluid dynamics and computational continuum mechanics motivate the development of reliable and efficient adaptive algorithms for mixed finite element methods. In order to save degrees of freedom, not all but just a selection of finite element domains are refined. Hence the fundamental question of convergence as well as the question of optimality require new mathematical a...

2011
Zuliang Lu Z. Lu

In this paper, we study the adaptive mixed finite element methods and variational discretization for optimal control problems governed by nonlinear elliptic equations. The state and the co-state are discretized by the lowest order Raviart-Thomas mixed finite element spaces and the control is not discretized. Then we derive a posteriori error estimates both for the coupled state and the control ...

Journal: :J. Symb. Log. 2003
John Krueger

We strengthen a theorem of Gitik and Shelah [6] by showing that if κ is either weakly inaccessible or the successor of a singular cardinal and S is a stationary subset of κ such that NSκ S is saturated then κ \S is fat. Using this theorem we derive some results about the existence of fat stationary sets. We then strengthen some results due to Baumgartner and Taylor [2], showing in particular th...

Journal: :Des. Codes Cryptography 2007
Jennifer D. Key Fidele F. Ngwane

Existing bounds on the minimum weight d of the dual 7-ary code of a projective plane of order 49 show that this must be in the range of 75 < d < 99. We use combinatorial arguments to improve this range to 87 < d < 99, noting that the upper bound can be taken to be 91 if the plane has a Baer subplane, as in the desarguesian case. A brief survey of known results for the minimum weight of the dual...

Journal: :Int. J. Math. Mathematical Sciences 2007
Abdelfattah Haily H. Rahnaoui

In ring theory, the notion of annihilator is an important tool for studying the structures. Many characterizations and structure theorems can be derived by using this notion. On the other hand, certain classes of rings (e.g., Baer rings and Rickart rings) are defined by considering annihilators ideals. In the present work, we introduce a class of rings which is close to the class of Rickart rin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید