scholarly journals Restrictive metric regularity and generalized differential calculus in Banach spaces

2004 ◽  
Vol 2004 (50) ◽  
pp. 2653-2680 ◽  
Author(s):  
Boris S. Mordukhovich ◽  
Bingwu Wang
Keyword(s):  
Banach Spaces ◽  
Differential Calculus ◽  
Metric Regularity ◽  
Sufficient Conditions ◽  
Normal Cones ◽  
First Order ◽  
Nonconvex Sets ◽  
Generalized Differential ◽  
Necessary And Sufficient ◽  
Generalized Differential Calculus

We consider nonlinear mappingsf:X→Ybetween Banach spaces and study the notion ofrestrictive metric regularityoffaround some pointx¯, that is, metric regularity offfromXinto the metric spaceE=f(X). Some sufficient as well as necessary and sufficient conditions for restrictive metric regularity are obtained, which particularly include an extension of the classical Lyusternik-Graves theorem in the case whenfis strictly differentiable atx¯but its strict derivative∇f(x¯)is not surjective. We develop applications of the results obtained and some other techniques in variational analysis to generalized differential calculus involving normal cones to nonsmooth and nonconvex sets, coderivatives of set-valued mappings, as well as first-order and second-order subdifferentials of extended real-valued functions.

scholarly journals Metric Subregularity for Subsmooth Generalized Constraint Equations in Banach Spaces

2012 ◽  
Vol 2012 ◽  
pp. 1-16
Author(s):  
He Qinghai ◽  
Yang Ji ◽  
Zhang Binbin
Keyword(s):  
Banach Spaces ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Normal Cones ◽  
Metric Subregularity ◽  
Constraint Equations ◽  
Asplund Spaces ◽  
Necessary And Sufficient ◽  
Generalized Constraint

This paper is devoted to metric subregularity of a kind of generalized constraint equations. In particular, in terms of coderivatives and normal cones, we provide some necessary and sufficient conditions for subsmooth generalized constraint equations to be metrically subregular and strongly metrically subregular in general Banach spaces and Asplund spaces, respectively.

Resolution systems and their applications I

1980 ◽  
Vol 3 (2) ◽  
pp. 235-268
Author(s):  
Ewa Orłowska
Keyword(s):  
Theorem Proving ◽  
Sufficient Conditions ◽  
Predicate Calculus ◽  
Resolution Method ◽  
First Order ◽  
Deductive Systems ◽  
Resolution System ◽  
Resolution Principle ◽  
Necessary And Sufficient ◽  
Classical Predicate

The central method employed today for theorem-proving is the resolution method introduced by J. A. Robinson in 1965 for the classical predicate calculus. Since then many improvements of the resolution method have been made. On the other hand, treatment of automated theorem-proving techniques for non-classical logics has been started, in connection with applications of these logics in computer science. In this paper a generalization of a notion of the resolution principle is introduced and discussed. A certain class of first order logics is considered and deductive systems of these logics with a resolution principle as an inference rule are investigated. The necessary and sufficient conditions for the so-called resolution completeness of such systems are given. A generalized Herbrand property for a logic is defined and its connections with the resolution-completeness are presented. A class of binary resolution systems is investigated and a kind of a normal form for derivations in such systems is given. On the ground of the methods developed the resolution system for the classical predicate calculus is described and the resolution systems for some non-classical logics are outlined. A method of program synthesis based on the resolution system for the classical predicate calculus is presented. A notion of a resolution-interpretability of a logic L in another logic L ′ is introduced. The method of resolution-interpretability consists in establishing a relation between formulas of the logic L and some sets of formulas of the logic L ′ with the intention of using the resolution system for L ′ to prove theorems of L. It is shown how the method of resolution-interpretability can be used to prove decidability of sets of unsatisfiable formulas of a given logic.

MAZUR–ULAM PROPERTY OF THE SUM OF TWO STRICTLY CONVEX BANACH SPACES

2015 ◽  
Vol 93 (3) ◽  
pp. 473-485 ◽  
Author(s):  
JIAN-ZE LI
Keyword(s):  
Banach Spaces ◽  
Equivalent Form ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Extension Problem ◽  
Isometric Extension ◽  
Strictly Convex ◽  
Necessary And Sufficient ◽  
Strictly Convex Banach Spaces ◽  
Equivalent Conditions

In this article, we study the Mazur–Ulam property of the sum of two strictly convex Banach spaces. We give an equivalent form of the isometric extension problem and two equivalent conditions to decide whether all strictly convex Banach spaces admit the Mazur–Ulam property. We also find necessary and sufficient conditions under which the $\ell ^{1}$-sum and the $\ell ^{\infty }$-sum of two strictly convex Banach spaces admit the Mazur–Ulam property.

System Properties of One-Dimensional Distributed Systems

1977 ◽  
Vol 99 (2) ◽  
pp. 85-90 ◽  
Author(s):  
L. S. Bonderson
Keyword(s):  
Distributed Systems ◽  
Sufficient Conditions ◽  
State Variables ◽  
One Dimensional ◽  
First Order ◽  
Lumped Element ◽  
Order Form ◽  
Power Product ◽  
System Properties ◽  
Necessary And Sufficient

The system properties of passivity, losslessness, and reciprocity are defined and their necessary and sufficient conditions are derived for a class of linear one-dimensional multipower distributed systems. The utilization of power product pairs as state variables and the representation of the dynamics in first-order form allows results completely analogous to those for lumped-element systems.

scholarly journals Free Product C* -algebras Associated with Graphs, Free Differentials, and Laws of Loops

2017 ◽  
Vol 69 (3) ◽  
pp. 548-578 ◽  
Author(s):  
Michael Hartglass
Keyword(s):  
Differential Calculus ◽  
Von Neumann Algebras ◽  
Sufficient Conditions ◽  
Weighted Graph ◽  
Positive Cone ◽  
Von Neumann ◽  
Planar Algebras ◽  
C Algebra ◽  
C Algebras ◽  
Necessary And Sufficient

AbstractWe study a canonical C* -algebra, 𝒮(Г,μ), that arises from a weighted graph (Г,μ), speci fic cases of which were previously studied in the context of planar algebras. We discuss necessary and sufficient conditions of the weighting that ensure simplicity and uniqueness of trace of 𝒮(Г,μ), and study the structure of its positive cone. We then study the *-algebra,𝒜, generated by the generators of 𝒮(Г,μ), and use a free differential calculus and techniques of Charlesworth and Shlyakhtenko as well as Mai, Speicher, and Weber to show that certain “loop” elements have no atoms in their spectral measure. After modifying techniques of Shlyakhtenko and Skoufranis to show that self adjoint elements x ∊ Mn(𝒜) have algebraic Cauchy transform, we explore some applications to eigenvalues of polynomials inWishart matrices and to diagrammatic elements in von Neumann algebras initially considered by Guionnet, Jones, and Shlyakhtenko.

ORDER AND CONVERGENCE OF THE ENHANCED 3-POINT FULLY IMPLICIT SUPER CLASS OF BLOCK BACKWARD DIFFERENTIATION FORMULA FOR SOLVING INITIAL VALUE PROBLEM

2021 ◽  
Vol 5 (2) ◽  
pp. 442-446
Author(s):  
Muhammad Abdullahi ◽  
Hamisu Musa
Keyword(s):  
Initial Value Problem ◽  
Initial Value Problems ◽  
Sufficient Conditions ◽  
Initial Value ◽  
Differentiation Formula ◽  
Stiff Initial Value Problems ◽  
First Order ◽  
Backward Differentiation Formula ◽  
Fully Implicit ◽  
Necessary And Sufficient

This paper studied an enhanced 3-point fully implicit super class of block backward differentiation formula for solving stiff initial value problems developed by Abdullahi & Musa and go further to established the necessary and sufficient conditions for the convergence of the method. The method is zero stable, A-stable and it is of order 5. The method is found to be suitable for solving first order stiff initial value problems

Necessary and sufficient conditions for oscillation of nonlinear first-order forced differential equations with several delays of neutral type

Analysis ◽  
2019 ◽  
Vol 39 (3) ◽  
pp. 97-105 ◽  
Author(s):  
Sandra Pinelas ◽  
Shyam S. Santra
Keyword(s):  
Differential Equations ◽  
Neutral Type ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
First Order ◽  
Several Delays ◽  
Necessary And Sufficient ◽  
T Tau ◽  
First Order Differential Equations

AbstractIn this work, necessary and sufficient conditions are obtained such that every solution of nonlinear neutral first-order differential equations with several delays of the form\bigl{(}x(t)+r(t)x(t-\tau)\bigr{)}^{\prime}+\sum_{i=1}^{m}\phi_{i}(t)H\bigl{(}% x(t-\sigma_{i})\bigr{)}=f(t)is oscillatory or tends to zero as {t\rightarrow\infty.} This problem is considered in various ranges of the neutral coefficient r. Finally, some illustrating examples are presented to show that feasibility and effectiveness of main results.

scholarly journals Oscillatory and Asymptotic Behavior of a First-Order Neutral Equation of Discrete Type with Variable Several Delay under Δ Sign

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Radhanath Rath ◽  
Chittaranjan Behera
Keyword(s):  
Difference Operator ◽  
Sufficient Conditions ◽  
Neutral Equation ◽  
Delay Difference Equation ◽  
Neutral Delay ◽  
First Order ◽  
Forward Difference ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Delay Difference

We obtain necessary and sufficient conditions so that every solution of neutral delay difference equation Δyn-∑j=1kpnjyn-mj+qnG(yσ(n))=fn oscillates or tends to zero as n→∞, where {qn} and {fn} are real sequences and G∈C(R,R), xG(x)>0, and m1,m2,…,mk are positive integers. Here Δ is the forward difference operator given by Δxn=xn+1-xn, and {σn} is an increasing unbounded sequences with σn≤n. This paper complements, improves, and generalizes some past and recent results.

Sign in / Sign up

Export Citation Format

Share Document