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...

Abstract—In graph theory, different types of products of two graphs had been studied, e.g., Cartesian product, Tensor product, Strong product, etc. In this paper we generalize the concept of Cartesian product of graphs.We define 2 Cartesian product and more generally r Cartesian product of two graphs. We study these product mainly for path graphs. We also discuss connectedness of the new graph.

‎ in the present article‎, ‎we study some categorical properties of the category {$bf‎ cpo_{sep}$-$s$} of all {separately strict $s$-cpo's}; cpo's equipped with‎ a compatible right action of a separately strict cpo-monoid $s$ which is‎ strict continuous in each component‎. ‎in particular‎, we show that this category is reflective and coreflective in the‎ category of $s$-cpo's‎, ‎find the free a...