An algorithm for the efficient computation of the CUR decomposition is presented. The method is based on simple modifications to the classical truncated pivoted QR decomposition, which means that highly optimized library codes can be utilized for its implementation. Numerical experiments demonstrate advantageous performance compared to existing techniques for computing CUR factorizations.

Recommended by Wolfgang Kuehnel We introduce a new generalized contractive condition for four mappings in the framework of metric space. We give some common fixed point results for these mappings and we deduce a fixed point result for weakly compatible mappings satisfying a contractive condition of integral type.

In 2014, Zead Mustafa introduced $b_2$-metric spaces, as a generalization of both $2$-metric and $b$-metric spaces. Then new fixed point results for the classes of  rational Geraghty contractive mappings of type I,II and III in the setup of $b_2$-metric spaces are investigated. Then, we prove some fixed point theorems under various contractive conditions in partially ordered $b_2$-metric spaces...

Osteopathy in thalassemia is a very heterogeneous condition; severity depends on multiple factors, interacting through nonlinear mechanisms. Classic statistics have limitations when applied to the study of such highly complex relationships. Currently, an alternative approach of analysis is represented by the artificial neural networks (ANNs), powerful mathematical tools, increasingly applied to...

The existence of coincidence points and common fixed points for four mappings satisfying generalized contractive conditions without exploiting the notion of continuity of any map involved therein, in a TVS-valued cone metric space is proved. These results extend, unify and generalize several well known comparable results in the existing literature.

Let X, d be a complete metric space, and let T be a self-map of X. If T has a unique fixed point, which can be obtained as the limit of the sequence {pn}, where pn Tp0, p0 any point of X, then T is called a Picard operator see, e.g., 1 , and the iteration defined by {pn} is called Picard iteration. One of the most general contractive conditions for which a map T is a Picard operator is that of ...