نتایج جستجو برای: lowest order constrained method
تعداد نتایج: 2473416 فیلتر نتایج به سال:
We address the numerical solution of linear systems arising from hybrid discretizations second-order elliptic partial differential equations. Such hinge on a set degrees freedom (DoFs), respectively, defined in cells and faces, which naturally gives rise to global system Assuming that cell unknowns are only locally coupled, they can be efficiently eliminated system, leaving face resulting Schur...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید