Related papers: On the Recurrence Formula for Fixed Points of the …
Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
The following paper compares a consistent Newton-Raphson and fixed-point iteration based solution strategy for a variational multiscale finite element formulation for incompressible Navier-Stokes. The main contributions of this work include…
Necessary and sufficient conditions for the regularity of solutions of the functional equation appearing in the theory of classical orthogonal polynomials on lattices are stated. Moreover, the functional Rodrigues formula and a closed…
In this paper, considering a wider class of simulation functions some fixed point results for multivalued mappings in $\alpha$-complete metric spaces have been presented. Results obtained in this paper extend and generalize some well-known…
We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our…
This paper deals with the solving of variational inequality problem where the constrained set is given as the intersection of a number of fixed-point sets. To this end, we present an extrapolated sequential constraint method. At each…
We employ Schauder fixed-point Theorem to prove the existence of at least one positive continuous solution of the quadratic integral equation Moreover, the maximal and the minimal solutions of the last equation are also proved.
The most efficient known method for solving certain computational problems is to construct an iterated map whose fixed points are by design the problem's solution. Although the origins of this idea go back at least to Newton, the clearest…
We present a novel algorithm for calculating fix-points. The algorithm calculates fix-points of an endo-function f on a distributive lattice, by performing reachability computation a graph derived from the dual of f; this is in comparison…
We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or…
We investigate a family of integrals involving modified Bessel functions that arise in the context of neutrino scattering. Recursive formulas are derived for evaluating these integrals and their asymptotic expansions are computed. We prove…
In the paper a solution for equilibrium configurations of an elastic beam subject to three points bending is given in terms of Jacobi elliptical functions. General equations are derived and the domain of solution is established. Several…
The systematic approach to solving the recurrence relations for multi-loop integrals is described. In particular, the criteria of their reducibility is suggested.
To provide generalized solutions if a given problem admits no actual solution is an important task in mathematics and the natural sciences. It has a rich history dating back to the early 19th century when Carl Friedrich Gauss developed the…
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…
We propose and analyze an algorithm to approximate distribution functions and densities of perpetuities. Our algorithm refines an earlier approach based on iterating discretized versions of the fixed point equation that defines the…
In this work, we prove the existence of solutions for a tripled system of integral equations using some new results of fixed point theory associated with measure of noncompactness. These results extend some previous works in the literature,…
The classical Brouwer fixed point theorem states that in R^d every continuous function from a convex, compact set on itself has a fixed point. For an arbitrary probability space, let L^0 = L^0 (\Omega, A,P) be the set of random variables.…