As a consequence, in the aforesaid reference a fixed point technique, which differs from the technique that we will introduce in the remainder of this section, was introduced to discuss the complexity of algorithms via the use of partial quasi-metrics, and not partial metrics, and a few aspects of language theory.
Continuously distributed population is represented on discrete fixed pivots as in the fixed pivot technique of Kumar and Ramkrishna [1996a. On the solution of population balance equation by discretization I. A fixed pivot technique.
It is compared to the fixed pivot technique proposed by Kumar and Ramkrishna (1996a. On the solution of population balance equations by discretization I. A fixed pivot technique. Chemical Engineering Science 51, 1311 1332).
Chemical Engineering Science 62, 4112 4125] to solve n-dimensional population balance equations (PBEs) with preservation of (n+1) instead of 2n properties required in direct extension of the 1-d fixed pivot technique of Kumar and Ramkrishna [1996a. On the solutions of population balance equation by discretization-I. A fixed pivot technique. Chemical Engineering Science 51, 1311 1332].
The fixed pivot method of Kumar and Ramkrishna [1996. On the solution of population balance equations by discretization I. A fixed pivot technique.
The scheme employed a fixed boundary technique, incorporated with the tangential elliptical force field to provide the best enclosure ability this allows the dots to be kept within the boundary points during the force regulation.
Using a fixed point technique, they showed the existence of positive solutions for problem (1.1).
A wide family of nonlocal associated boundary value problems is investigated by means of a fixed point technique.
The method chosen in this paper is a fixed point technique due to Avery and Peterson [28].
A common way of determining the desired intermediate solution of (E) would be by solving the integral equation (4.1) with the help of a fixed point technique.
Inspired by the impossibility of developing a fixed point technique for the asymptotic complexity analysis of algorithms based on the use of Theorem 3, we present a new fixed point technique that respects the spirit of the original Schellekens technique and whose foundation lies in the use of Theorems 4 and 9 in Section 2.
