Explicit Fixed-Point Computation of Nonlinear Delay-Free Loop Filter Networks

2018 ◽  
Vol 26 (10) ◽  
pp. 1884-1896 ◽  
Author(s):  
Federico Fontana ◽  
Enrico Bozzo
Keyword(s):  
Fixed Point ◽  
Loop Filter ◽  
Fixed Point Computation ◽  
Nonlinear Delay

scholarly journals Periodic Solutions in Shifts for a Nonlinear Dynamic Equation on Time Scales

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Erbil Çetin ◽  
F. Serap Topal
Keyword(s):  
Periodic Solution ◽  
Fixed Point ◽  
Fixed Point Theorem ◽  
Time Scales ◽  
Difference Equations ◽  
Dynamic Equation ◽  
Time Scale ◽  
Dynamic Equations ◽  
Nonlinear Dynamic Equation ◽  
Nonlinear Delay

Let be a periodic time scale in shifts . We use a fixed point theorem due to Krasnosel'skiĭ to show that nonlinear delay in dynamic equations of the form , has a periodic solution in shifts . We extend and unify periodic differential, difference, -difference, and -difference equations and more by a new periodicity concept on time scales.

Using Digitised X-Ray Powder Diffraction Scans as Input for a New Pc-At Search/Match Program

1987 ◽  
Vol 31 ◽  
pp. 423-430 ◽  
Author(s):  
P. Caussin ◽  
J. Nusinovici ◽  
D.W. Beard
Keyword(s):  
Fixed Point ◽  
Data Base ◽  
Powder Diffraction ◽  
Phase Identification ◽  
Interactive Graphics ◽  
List Type ◽  
Fast Method ◽  
X Ray ◽  
Fixed Point Computation ◽  
Peak Location

AbstractA Search/Matcti program lias 'beea written for the IBM PC AT computer that is capable of -using "background - subtracted, digitized 2-ray powder diffraction scans as inputs in addition to the d/I data traditionally used. This novel procedure has proved especially effective when numerous unresolved lines are present in the pattern. The method is also less demanding of data quality thaii the peak location programs. The program may he extended to searching & data "base of digitized standard patterns.The program, has several parameters that can- "be adjusted, including chemistry. The results from the Johnson/Vand list type of output are directly accessible to the interactive graphics program. This gives the diffraction!st a fast method for verifying the phase identification. Because of the speed of fixed point computation techniques, the 52,791 pattern file can be scanned in about 90 seconds.This paper will illustrate the utility of the program.

scholarly journals Derivation tree analysis for accelerated fixed-point computation

2011 ◽  
Vol 412 (28) ◽  
pp. 3226-3241 ◽  
Author(s):  
Javier Esparza ◽  
Stefan Kiefer ◽  
Michael Luttenberger
Keyword(s):  
Fixed Point ◽  
Derivation Tree ◽  
Tree Analysis ◽  
Fixed Point Computation

scholarly journals Iterative Schemes for Fixed Point Computation of Nonexpansive Mappings

2012 ◽  
Vol 2012 ◽  
pp. 1-12
Author(s):  
Rudong Chen
Keyword(s):  
Fixed Point ◽  
Fixed Points ◽  
Nonexpansive Mappings ◽  
Infinite Family ◽  
Common Fixed Points ◽  
Minimum Norm ◽  
Practical Applications ◽  
Fixed Point Computation ◽  
The Common ◽  
Special Case

Fixed point (especially, the minimum norm fixed point) computation is an interesting topic due to its practical applications in natural science. The purpose of the paper is devoted to finding the common fixed points of an infinite family of nonexpansive mappings. We introduce an iterative algorithm and prove that suggested scheme converges strongly to the common fixed points of an infinite family of nonexpansive mappings under some mild conditions. As a special case, we can find the minimum norm common fixed point of an infinite family of nonexpansive mappings.

scholarly journals An existence theorem for nonlinear delay differential equations

1989 ◽  
Vol 2 (2) ◽  
pp. 85-89
Author(s):  
Krishnan Balachandran
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Differential Equations ◽  
Existence Theorem ◽  
Delay Differential Equations ◽  
Measure Of Noncompactness ◽  
Existence Of Solutions ◽  
Nonlinear Delay Differential Equations ◽  
Delay Differential ◽  
Nonlinear Delay

In this paper we prove a theorem on the existence of solutions of nonlinear delay differential equations, with implicit derivatives. The result is established using the measure of noncompactness of a set and Darbo's fixed point theorem.

Sign in / Sign up

Export Citation Format

Share Document