System Properties of One-Dimensional Distributed Systems

1977 ◽  
Vol 99 (2) ◽  
pp. 85-90 ◽  
Author(s):  
L. S. Bonderson

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.

1980 ◽  
Vol 3 (2) ◽  
pp. 235-268
Author(s):  
Ewa Orłowska

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.


2002 ◽  
Vol 12 (04) ◽  
pp. 709-737 ◽  
Author(s):  
A. BARBÉ ◽  
F. VON HAESELER

We generalize the concept of one-dimensional decimation invariant sequences, i.e. sequences which are invariant under a specific rescaling, to dimension N. After discussing the elementary properties of decimation-invariant sequences, we focus our interest on their periodicity. Necessary and sufficient conditions for the existence of periodic decimation invariant sequences are presented.


2017 ◽  
Vol 54 (3) ◽  
pp. 963-969 ◽  
Author(s):  
Vadim Arkin ◽  
Alexander Slastnikov

Abstract We study a problem when the optimal stopping for a one-dimensional diffusion process is generated by a threshold strategy. Namely, we give necessary and sufficient conditions (on the diffusion process and the payoff function) under which a stopping set has a threshold structure.


Author(s):  
T. Kaczorek

Positive fractional continuous-time linear systems with singular pencils A method for checking the positivity and finding the solution to the positive fractional descriptor continuous-time linear systems with singular pencils is proposed. The method is based on elementary row and column operations of the fractional descriptor systems to equivalent standard systems with some algebraic constraints on state variables and inputs. Necessary and sufficient conditions for the positivity of the fractional descriptor systems are established.


2021 ◽  
Vol 5 (2) ◽  
pp. 442-446
Author(s):  
Muhammad Abdullahi ◽  
Hamisu Musa

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


Analysis ◽  
2019 ◽  
Vol 39 (3) ◽  
pp. 97-105 ◽  
Author(s):  
Sandra Pinelas ◽  
Shyam S. Santra

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.


Sign in / Sign up

Export Citation Format

Share Document