Related papers: On computing fixpoints in well-structured regular …
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
We introduce a new type of mappings in metric spaces which are three-point analogue of the well-known Kannan type mappings and call them generalized Kannan type mappings. It is shown that in general case such mappings are discontinuous but…
This paper considers a large class of linear operator equations, including linear boundary value problems for partial differential equations, and treats them as linear recovery problems for objects from their data. Well-posedness of the…
We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…
In this paper, we propose a new general and stable fixed-point approach to compute the resolvents of the composition of a set-valued maximal monotone operator with a linear bounded mapping. Weak, strong and linear convergence of the…
In this paper we indicate a way to generalize a series of fixed point results in the framework of b-metric spaces and we exemplify it by extending Nadler's contraction principle for set-valued functions (see Multi-valued contraction…
The aim of this paper is to present some fixed point theorems for generalized contractions by altering distance functions in a complete cone metric spaces endowed with a partial order. We also generalize fixed point theorems of J. Harjani,…
Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density…
We prove fixed points results for sandpiles starting with arbitrary initial conditions. We give an effective algorithm for computing such fixed points, and we refine it in the particular case of SPM.
This article deals with the error estimates for numerical approximations of the entropy solutions of coupled systems of nonlocal hyperbolic conservation laws. The systems can be strongly coupled through the nonlocal coefficient present in…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…
We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…
We prove globally-in-time existence of solution for a problem coupling the linear Lam\'e system and the quasi-linear Stokes equation. A solution of this global coupled problem is viewed as the fixed point of some non-linear operator $T$. We…
Computer programs may go wrong due to exceptional behaviors, out-of-bound array accesses, or simply coding errors. Thus, they cannot be blindly trusted. Scientific computing programs make no exception in that respect, and even bring…
Networked discrete dynamical systems are often used to model the spread of contagions and decision-making by agents in coordination games. Fixed points of such dynamical systems represent configurations to which the system converges. In the…
Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…
Convergence of Extremum Seeking (ES) algorithms has been established in the limit of small gains. Using averaging theory and contraction analysis, we propose a framework for computing explicit bounds on the departure of the ES scheme from…
In this paper, we consider the CQ projection method and the shrinking projection method given by a finite family of nonexpansive mappings of the unit sphere of a real Hilbert space, and prove strong convergence theorems to common fixed…
In this article, we present some fixed point theorems in partially ordered G-metric space using the concept of $(\psi,\phi)$- weak contraction which extend many existing fixed point theorems in such space. We also give some examples to show…