The fixed point and Mann iterative of a kind of higher order singular Teodorescu operator

2015 ◽  
Vol 60 (12) ◽  
pp. 1658-1667 ◽  
Author(s):  
He-Ju Yang ◽  
Xiang-Hui Zhao
Keyword(s):  
Fixed Point ◽  
Higher Order

scholarly journals A Study of Nonlinear Boundary Value Problem

2021 ◽  
Author(s):  
Noureddine Bouteraa ◽  
Habib Djourdem
Keyword(s):  
Differential Equation ◽  
Fixed Point ◽  
Fixed Point Theorem ◽  
Iterative Method ◽  
Boundary Value Problem ◽  
Higher Order ◽  
Nonlinear Boundary Value Problem ◽  
Point Boundary ◽  
Error Estimations ◽  
Fractional Differential

In this chapter, firstly we apply the iterative method to establish the existence of the positive solution for a type of nonlinear singular higher-order fractional differential equation with fractional multi-point boundary conditions. Explicit iterative sequences are given to approximate the solutions and the error estimations are also given. Secondly, we cover the multi-valued case of our problem. We investigate it for nonconvex compact valued multifunctions via a fixed point theorem for multivalued maps due to Covitz and Nadler. Two illustrative examples are presented at the end to illustrate the validity of our results.

scholarly journals Equivalence of two fixed-point semantics for definitional higher-order logic programs

2017 ◽  
Vol 668 ◽  
pp. 27-42 ◽  
Author(s):  
Angelos Charalambidis ◽  
Panos Rondogiannis ◽  
Ioanna Symeonidou
Keyword(s):  
Fixed Point ◽  
Higher Order ◽  
Order Logic ◽  
Logic Programs ◽  
Higher Order Logic ◽  
Fixed Point Semantics

scholarly journals An EKF-Based Fixed-Point Iterative Filter for Nonlinear Systems

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1893
Author(s):  
Feng ◽  
Feng ◽  
Wen
Keyword(s):  
Fixed Point ◽  
Kalman Filter ◽  
Nonlinear Systems ◽  
Iterative Method ◽  
Taylor Series ◽  
Nonlinear Filtering ◽  
Higher Order ◽  
Point Function ◽  
State Estimate ◽  
Linearized System

In this paper, a fixed-point iterative filter developed from the classical extended Kalman filter (EKF) was proposed for general nonlinear systems. As a nonlinear filter developed from EKF, the state estimate was obtained by applying the Kalman filter to the linearized system by discarding the higher-order Taylor series items of the original nonlinear system. In order to reduce the influence of the discarded higher-order Taylor series items and improve the filtering accuracy of the obtained state estimate of the steady-state EKF, a fixed-point function was solved though a nested iterative method, which resulted in a fixed-point iterative filter. The convergence of the fixed-point function is also discussed, which provided the existing conditions of the fixed-point iterative filter. Then, Steffensen’s iterative method is presented to accelerate the solution of the fixed-point function. The final simulation is provided to illustrate the feasibility and the effectiveness of the proposed nonlinear filtering method.

scholarly journals Higher Order of Convergence with Multivalued Contraction Mappings

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Jia-Bao Liu ◽  
Asma Rashid Butt ◽  
Shahzad Nadeem ◽  
Shahbaz Ali ◽  
Muhammad Shoaib
Keyword(s):  
Fixed Point ◽  
Contraction Mapping ◽  
Order Of Convergence ◽  
Higher Order ◽  
Gauge Function ◽  
Multivalued Mappings ◽  
Contraction Mappings ◽  
Multivalued Contraction ◽  
Integral Inclusion

In this paper, we establish some theorems of fixed point on multivalued mappings satisfying contraction mapping by using gauge function. Furthermore, we use Q - and R -order of convergence. Our main results extend many previous existing results in the literature. Consequently, to substantiate the validity of proposed method, we give its application in integral inclusion.

scholarly journals Bounded Fixed Point Iteration

1991 ◽  
Vol 20 (359) ◽  
Author(s):  
Hanne Riis Nielson ◽  
Flemming Nielson
Keyword(s):  
Fixed Point ◽  
Abstract Interpretation ◽  
Higher Order ◽  
Monotone Functions ◽  
Additive Functions ◽  
Fixed Point Iteration ◽  
Exponential Bound ◽  
Strictness Analysis ◽  
Long Chains

In the context of abstract interpretation for languages without higher-order features we study the number of times a functional need to be unfolded in order to give the least fixed point. For the cases of total or monotone functions we obtain an exponential bound and in the case of strict and additive (or distributive) functions we obtain a quadratic bound. These bounds are shown to be tight in that sufficiently long chains of functions can be shown to exist. Specializing the case of strict and additive functions to functionals of a form that would correspond to iterative programs we show that a linear bound is tight. This is related to several analyses studied in the literature (including strictness analysis).

scholarly journals General Higher-Order Lipschitz Mappings

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Joseph Frank Gordon
Keyword(s):  
Banach Space ◽  
Fixed Point ◽  
Fixed Point Theorem ◽  
Nonexpansive Mappings ◽  
Higher Order ◽  
Fixed Point Property ◽  
Point Property ◽  
New Class ◽  
Lipschitz Mappings ◽  
Approximate Fixed Point Property

In this paper, we introduce a new class of mappings and investigate their fixed point property. In the first direction, we prove a fixed point theorem for general higher-order contraction mappings in a given metric space and finally prove an approximate fixed point property for general higher-order nonexpansive mappings in a Banach space.

scholarly journals Existence of nonoscillatory solutions of higher order neutral differential equations

Filomat ◽  
2016 ◽  
Vol 30 (8) ◽  
pp. 2147-2153 ◽  
Author(s):  
T. Candan
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Differential Equations ◽  
Point Theorem ◽  
Sufficient Conditions ◽  
Higher Order ◽  
Nonoscillatory Solutions ◽  
Deviating Arguments ◽  
Neutral Differential Equations ◽  
Distributed Deviating Arguments

This article is concerned with nonoscillatory solutions of higher order nonlinear neutral differential equations with deviating and distributed deviating arguments. By using Knaster-Tarski fixed point theorem, new sufficient conditions are established. Illustrative example is given to show applicability of results.

Return to Reason

2019 ◽  
pp. 226-245 ◽  
Author(s):  
Michael G. Titelbaum
Keyword(s):  
Fixed Point ◽  
Higher Order ◽  
Peer Disagreement ◽  
First Order ◽  
Doxastic Justification ◽  
Right Reason ◽  
Higher Order Evidence

This chapter discusses responses to the author’s “Rationality’s Fixed Point (or: In Defense of Right Reason).” Among other things, the chapter: explains how the author understands rationality; explains why akrasia is irrational; intuitively overviews the argument from the Akratic Principle to the Fixed Point Thesis; explains why you can’t avoid this argument by distinguishing the rational from the reasonable, ideal rationality from everyday rationality, or substantive from structural norms; responds to the suggestion that misleading higher-order evidence creates rational dilemmas; explains why the Fixed Point Thesis doesn’t assume objectivist or externalist notions of rationality; dismisses complaints about agents who aren’t able to “figure out” what’s rational; then responds to an objection that peer disagreement undermines doxastic justification. Finally, the chapter modifies the author’s steadfast position on peer disagreement to take into account cases in which peer disagreement rationally affects an agent’s first-order opinions without affecting higher-order ones.

Sign in / Sign up

Export Citation Format

Share Document