The aim of the present paper is to give two characterization theorems of Datko type for the nonuniform polynomial dichotomy concept with respect to invariant projection families and also with respect to strongly invariant projection families.
Datko type characterizations for nonuniform polynomial dichotomy
Boruga (Toma), Rovana and Megan, Mihail
Full PDF
carpathian_2021_37_1_45_51Additional Information
| Author(s) | Boruga (Toma), Rovana , Megan, Mihail |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2021.01.05 |
Recently posted
-
On the iterative scheme generating methods using mean-valued sequences
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition