نتایج جستجو برای: cartesian p_k
تعداد نتایج: 9743 فیلتر نتایج به سال:
Introduction: The recently introduced GRAPPA Operator Gridder (GROG) [1] has been shown to be useful for the regridding of fully-sampled non-Cartesian data. However, GROG can also be used to properly regrid undersampled non-Cartesian data, which cannot be performed with other common regridding schemes, such as the gold-standard convolution-based gridding [2]. GROG has the advantage that single ...
In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید