This academic article presents a common fixed point theorem for two random operators using a random Mann iteration scheme. It proves that if a sequence defined by the random Mann iteration of two random operators converges, then the limit point is a common fixed point of the two operators. The paper defines relevant concepts such as random operators and random fixed points. It then presents the main theorem and proof that under a contractive condition, the limit of the random Mann iteration is a common fixed point. The proof uses properties of measurable mappings and the convergence of the iterative sequence.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AN ALPHA -CUT OPERATION IN A TRANSPORTATION PROBLEM USING SYMMETRIC HEXAGONAL...ijfls
In this paper we introduce a new operation on alpha cut for a symmetric hexagonal fuzzy numbers. We
considered a transportation problem where the fuzzy demand and supply are in symmetric hexagonal fuzzy
numbers and the minimum optimal cost is arrived .Transportation problems have various purposes in
logistics and supply process for reducing the transportation cost’s The advantages of the proposed alpha
cut operations over existing methods is simpler and computationally more efficient in day to day
applications.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AN ALPHA -CUT OPERATION IN A TRANSPORTATION PROBLEM USING SYMMETRIC HEXAGONAL...ijfls
In this paper we introduce a new operation on alpha cut for a symmetric hexagonal fuzzy numbers. We
considered a transportation problem where the fuzzy demand and supply are in symmetric hexagonal fuzzy
numbers and the minimum optimal cost is arrived .Transportation problems have various purposes in
logistics and supply process for reducing the transportation cost’s The advantages of the proposed alpha
cut operations over existing methods is simpler and computationally more efficient in day to day
applications.
Pattern-based classification of demographic sequencesDmitrii Ignatov
We have proposed prefix-based gapless sequential patterns for classification of demographic sequences. In comparison to black-box machine learning techniques, this one provides interpretable patterns suitable for treatment by professional demographers. As for the language, we have used Pattern Structures as an extension of Formal Concept Analysis for the case of complex data like sequences, graphs, intervals, etc.
Gaps between the theory and practice of large-scale matrix-based network comp...David Gleich
I discuss some runtimes for the personalized PageRank vector and how it relates to open questions in how we should tackle these network based measures via matrix computations.
AN ALPHA -CUT OPERATION IN A TRANSPORTATION PROBLEM USING SYMMETRIC HEXAGONAL...ijfls
In this paper we introduce a new operation on alpha cut for a symmetric hexagonal fuzzy numbers. We considered a transportation problem where the fuzzy demand and supply are in symmetric hexagonal fuzzy numbers and the minimum optimal cost is arrived .Transportation problems have various purposes in logistics and supply process for reducing the transportation cost’s The advantages of the proposed alpha
cut operations over existing methods is simpler and computationally more efficient in day to day applications.
Fast Algorithm for Computing the Discrete Hartley Transform of Type-IIijeei-iaes
The generalized discrete Hartley transforms (GDHTs) have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs) for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT) algorithm for the fast calculation of the GDHT of type-II (DHT-II) is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.
Seminar at IEEE Computational Intelligence Society, Singapore Chapter at School of Electrical and Electronic Engineering, NTU, Singapore, 20 February 2019
Comparative Analysis of Algorithms for Single Source Shortest Path ProblemCSCJournals
The single source shortest path problem is one of the most studied problem in algorithmic graph theory. Single Source Shortest Path is the problem in which we have to find shortest paths from a source vertex v to all other vertices in the graph. A number of algorithms have been proposed for this problem. Most of the algorithms for this problem have evolved around the Dijkstra’s algorithm. In this paper, we are going to do comparative analysis of some of the algorithms to solve this problem. The algorithms discussed in this paper are- Thorup’s algorithm, augmented shortest path, adjacent node algorithm, a heuristic genetic algorithm, an improved faster version of the Dijkstra’s algorithm and a graph partitioning based algorithm.
Some New Fixed Point Theorems on S Metric Spacesijtsrd
In this paper, we present some new type of contractive mappings and prove new fixed point theorems on S metric Spaces. J. Gayathri | Dr. K. Sathya "Some New Fixed Point Theorems on S-Metric Spaces" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30311.pdf Paper Url :https://www.ijtsrd.com/other-scientific-research-area/other/30311/some-new-fixed-point-theorems-on-smetric-spaces/j-gayathri
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberIJERA Editor
In this paper a general fuzzy maximal flow problem is discussed . A crisp maximal flow problem can be solved
in two methods : linear programming modeling and maximal flow algorithm . Here I tried to fuzzify the
maximal flow algorithm using octagonal fuzzy numbers introduced by S.U Malini and Felbin .C. kennedy [26].
By ranking the octagonal fuzzy numbers it is possible to compare them and using this we convert the fuzzy
valued maximal flow algorithm to a crisp valued algorithm . It is proved that a better solution is obtained when
it is solved using fuzzy octagonal number than when it is solved using trapezoidal fuzzy number . To illustrate
this a numerical example is solved and the obtained result is compared with the existing results . If there is no
uncertainty about the flow between source and sink then the proposed algorithm gives the same result as in crisp
maximal flow problems.
Pattern-based classification of demographic sequencesDmitrii Ignatov
We have proposed prefix-based gapless sequential patterns for classification of demographic sequences. In comparison to black-box machine learning techniques, this one provides interpretable patterns suitable for treatment by professional demographers. As for the language, we have used Pattern Structures as an extension of Formal Concept Analysis for the case of complex data like sequences, graphs, intervals, etc.
Gaps between the theory and practice of large-scale matrix-based network comp...David Gleich
I discuss some runtimes for the personalized PageRank vector and how it relates to open questions in how we should tackle these network based measures via matrix computations.
AN ALPHA -CUT OPERATION IN A TRANSPORTATION PROBLEM USING SYMMETRIC HEXAGONAL...ijfls
In this paper we introduce a new operation on alpha cut for a symmetric hexagonal fuzzy numbers. We considered a transportation problem where the fuzzy demand and supply are in symmetric hexagonal fuzzy numbers and the minimum optimal cost is arrived .Transportation problems have various purposes in logistics and supply process for reducing the transportation cost’s The advantages of the proposed alpha
cut operations over existing methods is simpler and computationally more efficient in day to day applications.
Fast Algorithm for Computing the Discrete Hartley Transform of Type-IIijeei-iaes
The generalized discrete Hartley transforms (GDHTs) have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs) for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT) algorithm for the fast calculation of the GDHT of type-II (DHT-II) is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.
Seminar at IEEE Computational Intelligence Society, Singapore Chapter at School of Electrical and Electronic Engineering, NTU, Singapore, 20 February 2019
Comparative Analysis of Algorithms for Single Source Shortest Path ProblemCSCJournals
The single source shortest path problem is one of the most studied problem in algorithmic graph theory. Single Source Shortest Path is the problem in which we have to find shortest paths from a source vertex v to all other vertices in the graph. A number of algorithms have been proposed for this problem. Most of the algorithms for this problem have evolved around the Dijkstra’s algorithm. In this paper, we are going to do comparative analysis of some of the algorithms to solve this problem. The algorithms discussed in this paper are- Thorup’s algorithm, augmented shortest path, adjacent node algorithm, a heuristic genetic algorithm, an improved faster version of the Dijkstra’s algorithm and a graph partitioning based algorithm.
Some New Fixed Point Theorems on S Metric Spacesijtsrd
In this paper, we present some new type of contractive mappings and prove new fixed point theorems on S metric Spaces. J. Gayathri | Dr. K. Sathya "Some New Fixed Point Theorems on S-Metric Spaces" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30311.pdf Paper Url :https://www.ijtsrd.com/other-scientific-research-area/other/30311/some-new-fixed-point-theorems-on-smetric-spaces/j-gayathri
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberIJERA Editor
In this paper a general fuzzy maximal flow problem is discussed . A crisp maximal flow problem can be solved
in two methods : linear programming modeling and maximal flow algorithm . Here I tried to fuzzify the
maximal flow algorithm using octagonal fuzzy numbers introduced by S.U Malini and Felbin .C. kennedy [26].
By ranking the octagonal fuzzy numbers it is possible to compare them and using this we convert the fuzzy
valued maximal flow algorithm to a crisp valued algorithm . It is proved that a better solution is obtained when
it is solved using fuzzy octagonal number than when it is solved using trapezoidal fuzzy number . To illustrate
this a numerical example is solved and the obtained result is compared with the existing results . If there is no
uncertainty about the flow between source and sink then the proposed algorithm gives the same result as in crisp
maximal flow problems.
Response Surface in Tensor Train format for Uncertainty QuantificationAlexander Litvinenko
We apply low-rank Tensor Train format to solve PDEs with uncertain coefficients. First, we approximate uncertain permeability coefficient in TT format, then the operator and then apply iterations to solve stochastic Galerkin system.
Existence of Solutions of Fractional Neutral Integrodifferential Equations wi...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Fixed Point Results for Weakly Compatible Mappings in Convex G-Metric Spaceinventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
I am Driss Fumio. I am a Multivariate Methods Assignment Expert at statisticsassignmentexperts.com. I hold a Master’s Degree in Statistics, from New Brunswick University, Canada. I have been helping students with their assignments for the past 14 years. I solve assignments related to Multivariate Methods. Visit statisticsassignmentexperts.com or email info@statisticsassignmentexperts.com. You can also call on +1 678 648 4277 for any assistance with Multivariate Methods Assignments.
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...mathsjournal
In the earlier work, Knuth present an algorithm to decrease the coefficient growth in the Euclidean algorithm of polynomials called subresultant algorithm. However, the output polynomials may have a small factor which can be removed. Then later, Brown of Bell Telephone Laboratories showed the subresultant in another way by adding a variant called 𝜏 and gave a way to compute the variant. Nevertheless, the way failed to determine every 𝜏 correctly.
In this paper, we will give a probabilistic algorithm to determine the variant 𝜏 correctly in most cases by adding a few steps instead of computing 𝑡(𝑥) when given 𝑓(𝑥) and𝑔(𝑥) ∈ ℤ[𝑥], where 𝑡(𝑥) satisfies that 𝑠(𝑥)𝑓(𝑥) + 𝑡(𝑥)𝑔(𝑥) = 𝑟(𝑥), here 𝑡(𝑥), 𝑠(𝑥) ∈ ℤ[𝑥]
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
In this work we discuss how to compute KLE with complexity O(k n log n), how to approximate large covariance matrices (in H-matrix format), how to use the Lanczos method.
Similar to A common fixed point theorem for two random operators using random mann iteration scheme (20)
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
A common fixed point theorem for two random operators using random mann iteration scheme
1. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications
263
A Common Fixed Point Theorem for Two Random Operators
using Random Mann Iteration Scheme
S. Saluja
Department of Mathematics, Government J. H. P. G. College Betul (MP) India-460001
Devkrishna Magarde
Department of Mathematics, Patel College of Science and Technology, Bhopal(MP) India-462044
Email:-devmagarde@gmail.com
Alkesh Kumar Dhakde
Department of Mathematics, IES College of Technology, Bhopal(MP) India-462044
Abstract: In this paper, we proved that if a random Mann iteration scheme is defined by two random operators
is convergent under some contractive inequality the limit point is a common fixed point of each of two random
operators in Banach space.
Keywords: Mann iteration, fixed point, measurable mappings, Banach space.
AMS Subject Classification: 47H10, 47H40.
1.Introduction and Preliminaries:
Kasahara [8] had shown that if an iterated sequence defined by using a continuous linear mapping is convergent
under certain assumption, then the limit point is a common fixed point of each of two non-linear mappings.
Ganguly [6] arrived at same conclusion by taking the same contractive condition and using the sequence of
Mann iteration [9].
It this note, it is proved that if a random Mann iteration scheme is defined by two operators is
convergent under some contractive inequality the limit point is a common fixed point of each of two random
operators in a Banach space.
The study of random fixed point has been an active area of contemporary research in mathematics.
Random iteration scheme has been elaborately discussed by Choudhury ([1], [2], [3], [4]). Looking to the
immense applications of iterative algorithms in signal processing and image reconstruction, it is essential to
venture upon random iteration.
We first review the following concepts, which are essential for our study.
Throughout this paper ( Ω, ∑ ) denotes a measurable space and X stands for a separable Banach space. C is a
nonempty subset of X .
A mapping :f Ω C→ is said to be measurable if ( ) ∑∈∩−
CBf 1
for every Borel subset B of X .
A mapping :F Ω ,CC →× is said to be a random operator, if ( ):., xF Ω C→ is measurable for every
Cx ∈ .
A measurable mapping :g Ω C→ is said to be a random fixed point of the random operator :F Ω
,CC →× if ( ) )()(, tgtgtF = for all ∈t Ω.
A random operator :F Ω CC →× is said to be continuous if, for fixed ∈t Ω, ( ) CCtF →:,. is
continuous.
Definition 1 (Random Mann Iteration scheme): Let :,TS Ω CC →× be two random operators on a
nonempty convex subset C of a separable Banach space X . Then the sequence { }nx of random Mann
iterates associates with TS or is defined as follows:
(1) Let :0x Ω C→ be any given measurable mapping.
(2) ( ) ( ))(,1)(1 txtScxctx nnnnn +−=+ for 0>n , ∈t Ω, or
(3) ( ) ( ))(,1)(1 txtTcxctx nnnnn +−=+ for 0>n , ∈t Ω,
where nc satisfies:
(4) 10 =c for 0=n
(5) 10 ≤< nc for 0>n
2. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications
264
(6) 0lim >=
∞→
hcn
n
2.Main Result:
Theorem 1: Let :,TS Ω ,CC →× where C is a nonempty closed convex subset of a separable Banach space
X , be two continuous random operators which satisfy the following inequality: for all Cyx ∈, and ∈t Ω,
( ) ( ) ( ) ( ){ }
( ) ( ){ }
( ){
( ) })()()(,)(
,)()()(,)(max
)(,)(,)(,)(max
)(,)(,)(,)(,)()(max,,(7)
tytxtytTty
tytxtxtStx
tytTtytxtStx
txtStytytTtxtytxytTxtS
−+−
−+−+
−−+
−−−≤−
γ
β
α
where 1and0,, <++≥ γβαγβα .
If the sequence { })(txn of random Mann iterates associated with TS or satisfying (1)-(6) converges, then it
converges to a common random fixed point of both TS and .
Proof: We may assume that the sequence { })(txn defined by (2) is pointwise convergent, that is, for all ∈t Ω,
(8) )(lim)( txtx n
n ∞→
=
Since X is a separable Banach space, for any continuous random operator
:A Ω ,CC →× and any measurable mapping :f Ω C→ , the mapping ( ))(,)( tftAtx = is measurable
mapping [7].
Since )(tx is measurable and C is convex, it follows that{ })(txn constructed in the random iteration from
(2)-(6) is a sequence of measurable mappings. Hence being limit of measurable mapping sequence is also
measurable. Now for ∈t Ω, from (2), (6) and (7) we obtain
( ) ( ))(,)()()()(,)( 11 txtTtxtxtxtxtTtx nn −+−≤− ++
( ) ( ) ( ))(,)(,)(1)()( 1 txtTtxtSctxctxtx nnnnn −+−+−≤ +
( ) ( )
( ) ( ))(,)(,
)(,)(1)()( 1
txtTtxtSc
txtTtxctxtx
nn
nnn
−+
−−+−≤ +
( ) ( ) ( )
[ ( ){
( )} ( ){
( )} ( ){
( ) }])()()(,)(,)()(
)(,)(max)(,)(
,)(,)(max)(,)(
,)(,)(,)()(max
)(,)(1)()()(,)()9( 1
txtxtxtTtxtxtx
txtStxtxtTtx
txtStxtxtStx
txtTtxtxtxc
txtTtxhtxtxtxtTtx
nn
nn
nnn
nnn
nn
−+−−
+−+−
−+−
−−+
−−+−≤− +
γ
β
α
Now ( )( ) ( ) )()()()(,)()(, 1 txtxtxctxtSctxtxtSc nnnnnnnnn −=−=− +
Implies that ( ) )()(
1
)()(, 1 txtx
c
txtxtS nn
n
nn −≤− +
This shows that for ∈t Ω, ( ) ∞→→− ntxtxtS nn as0)()(, and so
( ) ∞→→− ntxtxtS n as0)()(, as S is continuous random operator and x is a
measurable mapping. Consequently from (9) on taking limit as ∞→n we obtain
( ) ( ) ( ) ( ){ }[
( ){ } ( ){ }])(,)(,0max)(,)(,0max
0,)(,)(,0max)(,)(10)(,)(
txtTtxtxtTtx
txtTtxctxtTtxhtxtTtx n
−+−+
−+−−+≤−
γβ
α
3. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications
265
( ) ( ))(,)(1 txtTtxhhhh −+++−≤ γβα
implies that ( ) )()(, txtxtT = for all ∈t Ω ( )1sin <++ γβαce as T is continuous random operator and
x is measurable.
Therefore,
( ) ( ) ( ))(,)(,)()(, txtTtxtStxtxtS −=−
( ) ( ){ }
( ) ( ){ }
( ){
( ) })()()(,)(
,)()()(,)(max
)(,)(,)(,)(max
)(,)(,)(,)(,)()(max
txtxtxtTtx
txtxtxtStx
txtTtxtxtStx
txtStxtxtTtxtxtx
−+−
−+−+
−−+
−−−≤
γ
β
α
( ) ( ){ }
( ){ }
( ){
})()()()(
,)()()(,)(max
)()(,)(,)(max
)(,)(,)()(,)()(max)()(,
txtxtxtx
txtxtxtStx
txtxtxtStx
txtStxtxtxtxtxtxtxtS
−+−
−+−+
−−+
−−−≤−
γ
β
α
( ){ } ( ){ }
( ){ }0,)(,)(max
0,)(,)(max)(,)(,0,0max
txtStx
txtStxtxtStx
−+
−+−≤
γ
βα
( ) ( ))(,)( txtStx −++≤ γβα
Since 1<++ γβα implies that ( ) )()(, txtxtS = .
Uniquness:-Let )()(),( txtvtv ≠ is another common fixed point of S and T ,then, using (7), we have
( ) ( ){ }
( ) ( ){ }
( ){
( ) })()()(,)(
,)()()(,)(max
)(,)(,)(,)(max
)(,)(,)(,)(,)()(max)()(
tvtxtvtTtv
tvtxtxtStx
tvtTtvtxtStx
txtStvtvtTtxtvtxtvtx
−+−
−+−+
−−+
−−−≤−
γ
β
α
{ }
{ }
{
})()()()(
,)()()()(max
)()(,)()(max
)()(,)()(,)()(max
tvtxtvtv
tvtxtxtx
tvtvtxtx
txtvtvtxtvtx
−+−
−+−+
−−+
−−−≤
γ
β
α
)()()( tvtx −+≤ γα
1as)()( <+=⇒ γαtvtx
This complete the proof.
References:
[1] Choudhury B. S., Convergence of a random iteration scheme to a random fixed point, J. Appl. Math. Stoc.
Anal., 8(1995), 139-142.
[2] Choudhury B. S., Random Mann iteration scheme, Appl. Math. Lett., 16 (2003), 93-96.
[3] Choudhury B. S., Ray M., Convergence of an iteration leading to a solution of a random operator equation, J.
Appl. Math. Stoc. Anal., 12 (1999), 161-168.i
[4] Choudhury B. S., Upadhyay A., An iteration leading to a solution and fixed point of operators, Soochow J.
Math., 25 (1999), 394-400.
[5] Ciric Lj., Quasi-contractions in Banach space, Publ. Inst. Math., 21(35) (1977), 41-48.
4. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications
266
[6] Ganguly A. K., On common fixed point of two mappings, Mathematics Seminar Notes., 8 (1980), 343-345.
[7] Himmelberg C.J.,Measurable relations, Fund.Math.,LXXXVII (1975),53-71.
[8] Kasahara S., Fixed point iterations using linear mappings, Mathematics Seminar Notes., 6 (1978), 87-90.
[9] Rhoades B. E., Extensions of some fixed point theorems of Ciric, Maiti and Pal, Mathematics Seminar Notes.,
6 (1978), 41-46.
5. This academic article was published by The International Institute for Science,
Technology and Education (IISTE). The IISTE is a pioneer in the Open Access
Publishing service based in the U.S. and Europe. The aim of the institute is
Accelerating Global Knowledge Sharing.
More information about the publisher can be found in the IISTE’s homepage:
http://www.iiste.org
CALL FOR PAPERS
The IISTE is currently hosting more than 30 peer-reviewed academic journals and
collaborating with academic institutions around the world. There’s no deadline for
submission. Prospective authors of IISTE journals can find the submission
instruction on the following page: http://www.iiste.org/Journals/
The IISTE editorial team promises to the review and publish all the qualified
submissions in a fast manner. All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than
those inseparable from gaining access to the internet itself. Printed version of the
journals is also available upon request of readers and authors.
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar