Sparse matrix–vector multiplication (SpMV) is one of the most important kernels in high-performance computing (HPC), yet SpMV normally suffers from ill performance on many devices. Due to performance, requires special care store and tune for a given device. Moreover, HPC facing heterogeneous hardware containing multiple different compute units, e.g., many-core CPUs GPUs. Therefore, an emerging ...

Abstract Erdős [7] proved that the Continuum Hypothesis (CH) is equivalent to existence of an uncountable family $\mathcal {F}$ (real or complex) analytic functions, such $\big \{ f(x) \ : f \in \mathcal {F} \big \}$ countable for every x . We strengthen Erdős’ result by proving CH what we call sparse systems functions. use construct, assuming CH, equivalence relation $\sim $ on $\mathbb {R}$ a...

Abstract This chapter considers the LU factorization of a general nonsymmetric nonsingular sparse matrix A . In practice, numerical pivoting for stability and/or ordering to limit fill-in in factors is often needed and computed then permuted PAQ Pivoting discussed Chapter 7 algorithms 8

PURPOSE To improve the accuracy and the robustness of the segmentation in living donor liver transplantation (LDLT) surgery planning system, the authors present a new segmentation framework that addresses challenges induced by the complex shape variations of patients' livers with cancer. It is designed to achieve the accurate and robust segmentation of hepatic parenchyma, portal veins, hepatic ...