Abstract Recent advances in deep neural networks have achieved higher accuracy with more complex models. Nevertheless, they require much longer training time. To reduce the time, methods using quantized weight, activation, and gradient been proposed. Neural network calculation by integer format improves energy efficiency of hardware for learning Therefore, fixed point However, narrow data repre...

*Correspondence: [email protected] 1Department of Quantitative Methods for Economics and Business, University of Granada, Granada, Spain Full list of author information is available at the end of the article Abstract Very recently, Roldán-López-de-Hierro and Shahzad introduced the notion of R-contractions as an extension of several notions given by different researchers (for instance, R-contractio...

In the present paper, we prove some fixed point theorems by using non-decreasing mapping \(\kappa :\mathbb{R}^+\to \mathbb{R}^+\) known as altering distance function or control function, in context of \(S\)-metric space. Further, explore property \(P\) for these contractive mappings.

In this paper, we introduce the concept of generalized quasi-contractions in the setting of cone $b$-metric spaces over Banach algebras. By omitting the  assumption of normality we establish common fixed point theorems for the generalized quasi-contractions  with the spectral radius $r(lambda)$ of the quasi-contractive constant vector $lambda$ satisfying $r(lambda)in [0,frac{1}{s})$  in the set...

begin{abstract} in this paper, we prove some strong and weak convergence of three step random iterative scheme with errors to common random fixed points of three asymptotically nonexpansive nonself random mappings in a real uniformly convex separable banach space. end{abstract}

Given a set S of n > 2 points in the plane (in general position), we show how to compute in O(n) time, a triangle T with maximum (or minimum) area enclosing S among all enclosing triangles with fixed perimeter P and one fixed angle ω. We show that a similar approach can be used to compute a triangle T with maximum (or minimum) perimeter enclosing S among all enclosing triangles with fixed area ...

0 gi(t, s)[Pi(s, u1(s), u2(s), · · · , un(s)) + Qi(s, u1(s), u2(s), · · · , un(s))]ds, t ∈ [0, T ], 1 ≤ i ≤ n where T > 0 is fixed and the nonlinearities Pi(t, u1, u2, · · · , un) can be singular at t = 0 and uj = 0 where j ∈ {1, 2, · · · , n}. Criteria are offered for the existence of fixed-sign solutions (u∗1, u ∗ 2, · · · , u ∗ n) to the system of Volterra integral equations, i.e., θiu ∗ i (...