Related papers: On the Recurrence Formula for Fixed Points of the …
The Douglas-Rachford reflection method is a general purpose algorithm useful for solving the feasibility problem of finding a point in the intersection of finitely many sets. In this chapter we demonstrate that applied to a specific…
We introduce an alternative approach for constrained mathematical programming problems. It rests on two main aspects: an efficient way to compute optimal solutions for unconstrained problems, and multipliers regarded as variables for a…
A three term recurrence relation is derived for a basis consisting of polynomials multiplied by sines and cosines with large, but fixed frequencies. A numerical method for computing the coefficients of the three term recurrence relation is…
Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…
The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite…
We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution.…
The theory of recursive functions is related in a well-known way to the notion of *least fixed points*, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the pure lambda-calculus…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
In this paper, we shall show that some coincidence point and common fixed point results for three or four mappings could easily be obtained from the corresponding fixed point results for two mappings.
The circumcentered-reflection method (CRM) has been recently proposed as a methodology for accelerating several algorithms for solving the Convex Feasibility Problem (CFP), equivalent to finding a common fixed-point of the orthogonal…
Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause…
In this paper, the notion of $\mathbb{C}$-simulation function is introduced and the existence and uniqueness of common fixed points of two self-mappings satisfying contractive conditions in the setting of complex valued metric spaces via…
We compute the large size limit of the moment formula derived in \cite{DHS} for the Hermitian Jacobi process at fixed time. Our computations rely on the polynomial division algorithm which allows to obtain cancellations similar to those…
The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…
In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results…
The famous J.C.P. Miller formula provides a recurrence algorithm for the composition $B_a \circ f$, where $B_a$ is the formal binomial series and $f$ is a formal power series, however it requires that $f$ has to be a nonunit. In this paper…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Recurrence problems are fundamental in dynamics, and for example, sizes of the set of points recurring infinitely often to a target have been studied extensively in many contexts. For example, the problem of finding the dimension for…
Existence and uniqueness of solutions for $\alpha\in\left( 2,3\right] $ order fractional differential equations with three point fractional boundary and integral conditions is discussed. The results are obtained by using standard fixed…
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…