Corrigendum to “Homogenization of elliptic problems involving interfaces and singular data” [Nonlinear Anal. 189 (2019) 111562]

2021 ◽  
Vol 203 ◽  
pp. 112192
Author(s):  
M. Amar ◽  
I. de Bonis ◽  
G. Riey
2019 ◽  
Vol 189 ◽  
pp. 111562 ◽  
Author(s):  
Micol Amar ◽  
Ida De Bonis ◽  
Giuseppe Riey

Author(s):  
Mykhajlo Klymash ◽  
Olena Hordiichuk — Bublivska ◽  
Ihor Tchaikovskyi ◽  
Oksana Urikova

In this article investigated the features of processing large arrays of information for distributed systems. A method of singular data decomposition is used to reduce the amount of data processed, eliminating redundancy. Dependencies of com­putational efficiency on distributed systems were obtained using the MPI messa­ging protocol and MapReduce node interaction software model. Were analyzed the effici­ency of the application of each technology for the processing of different sizes of data: Non — distributed systems are inefficient for large volumes of information due to low computing performance. It is proposed to use distributed systems that use the method of singular data decomposition, which will reduce the amount of information processed. The study of systems using the MPI protocol and MapReduce model obtained the dependence of the duration calculations time on the number of processes, which testify to the expediency of using distributed computing when processing large data sets. It is also found that distributed systems using MapReduce model work much more efficiently than MPI, especially with large amounts of data. MPI makes it possible to perform calculations more efficiently for small amounts of information. When increased the data sets, advisable to use the Map Reduce model.


2017 ◽  
Vol 37 (1) ◽  
pp. 9-20
Author(s):  
Manoj Kumar ◽  
Serkan Araci

Samet et. al. (Nonlinear Anal. 75, 2012, 2154-2165) introduced the concept of alpha-psi-contractive type mappings in metric spaces. In 2013, Alghamdi et. al. [2] introduced the concept of G-β--contractive type mappings in G-metric spaces. Our aim is to introduce new concept of generalized G-η-χ-contractive pair of mappings. Further, we study some fixed point theorems for such mappings in complete G-metric spaces. As an application, we further establish common fixed point theorems for G-metric spaces for cyclic contractive mappings.


2018 ◽  
Vol 40 (1) ◽  
pp. 405-421 ◽  
Author(s):  
N Chatterjee ◽  
U S Fjordholm

Abstract We derive and study a Lax–Friedrichs-type finite volume method for a large class of nonlocal continuity equations in multiple dimensions. We prove that the method converges weakly to the measure-valued solution and converges strongly if the initial data is of bounded variation. Several numerical examples for the kinetic Kuramoto equation are provided, demonstrating that the method works well for both regular and singular data.


Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 118
Author(s):  
Jelena Vujaković ◽  
Eugen Ljajko ◽  
Mirjana Pavlović ◽  
Stojan Radenović

One of the main goals of this paper is to obtain new contractive conditions using the method of a strictly increasing mapping F:(0,+∞)→(−∞,+∞). According to the recently obtained results, this was possible (Wardowski’s method) only if two more properties (F2) and (F3) were used instead of the aforementioned strictly increasing (F1). Using only the fact that the function F is strictly increasing, we came to new families of contractive conditions that have not been found in the existing literature so far. Assuming that α(u,v)=1 for every u and v from metric space Ξ, we obtain some contractive conditions that can be found in the research of Rhoades (Trans. Amer. Math. Soc. 1977, 222) and Collaco and Silva (Nonlinear Anal. TMA 1997). Results of the paper significantly improve, complement, unify, generalize and enrich several results known in the current literature. In addition, we give examples with results in line with the ones we obtained.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
B. Borsos ◽  
János Karátson

Abstract The goal of this paper is to present various types of iterative solvers: gradient iteration, Newton’s method and a quasi-Newton method, for the finite element solution of elliptic problems arising in Gao type beam models (a geometrical type of nonlinearity, with respect to the Euler–Bernoulli hypothesis). Robust behaviour, i.e., convergence independently of the mesh parameters, is proved for these methods, and they are also tested with numerical experiments.


Sign in / Sign up

Export Citation Format

Share Document