Search

In this work, we discuss the controllability and observability behaviors of a non-homogeneous conformable fractional dynamical system (C-FDS) based on the conformable fractional exponential matrix (C-FEM) and fractional Grammian matrix (FGM). Moreover, the nice relationships between controllability, observability, and stability for non-homogeneous C-FDS are derived. To demonstrate the effectiveness of our obtained results, we present the general solutions (GSs), controllability, observabilities and stabilities to three attractive physical and engineering problems related to compatibility with conformable fractional electrical circuits (C-FECs). Finally, the fractional and classical behaviors of each problem have been covered, respectively, when α = 1 2 and α = 1 .

In some applications there arises the need of a spatially distributed description of a physical quantity inside a device coupled to a circuit. Then, the in-space discretised system of partial differential equations is coupled to the system of equations describing the circuit (Modified Nodal Analysis) which yields a system of Differential Algebraic Equations (DAEs). This paper deals with the differential index analysis of such coupled systems. For that, a new generalised inductance-like element is defined. The index of the DAEs obtained from a circuit containing such an element is then related to the topological characteristics of the circuit's underlying graph. Field/circuit coupling is performed when circuits are simulated containing elements described by Maxwell's equations. The index of such systems with two different types of magnetoquasistatic formulations (A* and T-$\Omega$) is then deduced by showing that the spatial discretisations in both cases lead to an inductance-like element.

In this paper, we define the notion of rigidity for linear electrical multiports and for matroid pairs. We show the parallel between the two and study the consequences of this parallel. We present applications to testing, using purely matroidal methods, whether a connection of rigid multiports yields a linear network with unique solution. We also indicate that rigidity can be regarded as the closest notion to duality that can be hoped for, when the spaces correspond to different physical constraints, such as topological and device characteristic. A multiport is an ordered pair $(\V^1_{AB},\A^2_{B}),$ where $\V^1_{AB}$ is the solution space on $A\uplus B$ of the Kirchhoff current and voltage equations of the graph of the multiport and $\A^2_{B}\equivd \alpha_B+\V^2_B$ is the device characteristic of the multiport, with $A$ corresponding to port voltages and currents and $B$ corresponding to internal voltages and currents. The pair $\{\V^1_{AB},\alpha_B+\V^2_{B}\}$ is said to be rigid iff it has a solution $(x_A,x_B)$ for every vector $\alpha_B$ and given a restriction $x_A$ of the solution, $x_B$ is unique. A matroid $\M_S$ on $S,$ is a family of `independent' sets with the property that maximal independent sets contained in any given subset of $S$ have the same cardinality. The pair $\{\M^1_{AB},\M^2_{B}\}$ is said to be rigid iff the two matroids have disjoint bases which cover $B.$ We show that the properties of rigid pairs of matroids closely parallel those of rigid multiports. We use the methods developed in the paper to show that a multiport with independent and controlled sources and positive or negative resistors, whose parameters can be taken to be algebraically independent over $\Q,$ is rigid, if certain simple topological conditions are satisfied by the device edges., Comment: keywords: Rigidity, multiports, matroids, implicit duality

In this paper we show how to compute port behaviour of multiports which have port equations of the general form $B v_P - Q i_P = s,$ which cannot even be put into the hybrid form, indeed may have number of equations ranging from $0$ to $2n,$ where $n$ is the number of ports. We do this through repeatedly solving with different source inputs, a larger network obtained by terminating the multiport by its adjoint through a gyrator. The method works for linear multiports which are consistent for arbitrary internal source values and further have the property that the port conditions uniquely determine internal conditions. We also present the most general version of maximum power transfer theorem possible. This version of the theorem states that `stationarity' (derivative zero condition) of power transfer occurs when the multiport is terminated by its adjoint, provided the resulting network has a solution. If this network does not have a solution there is no port condition for which stationarity holds. This theorem does not require that the multiport has a hybrid immittance matrix., Comment: {keyword} keywords: Basic circuits, Implicit duality, Thevenin, Maximum power. arXiv admin note: substantial text overlap with arXiv:2005.00838

We introduce a Green function and analogues of other related kernels for finite and infinite networks whose edge weights are complex-valued admittances with positive real part. We provide comparison results with the same kernels associated with corresponding reversible Markov chains, i.e., where the edge weights are positive. Under suitable conditions, these lead to comparison of series of matrix powers which express those kernels. We show that the notions of transience and recurrence extend by analytic continuation to the complex-weighted case even when the network is infinite. Thus, a variety of methods known for Markov chains extend to that setting.

Electric circuits are usually described by charge- and flux-oriented modified nodal analysis. In this paper, we derive models as port-Hamiltonian systems on several levels: overall systems, multiply coupled systems and systems within dynamic iteration procedures. To this end, we introduce new classes of port-Hamiltonian differential-algebraic equations. Thereby, we additionally allow for nonlinear dissipation on a subspace of the state space. Both, each subsystem and the overall system, possess a port-Hamiltonian structure. A structural analysis is performed for the new setups. Dynamic iteration schemes are investigated and we show that the Jacobi approach as well as an adapted Gauss-Seidel approach lead to port-Hamiltonian differential-algebraic equations., Comment: 33 pages, 1 figure

The transcritical bifurcation without parameters (TBWP) describes a stability change along a line of equilibria, resulting from the loss of normal hyperbolicity at a given point of such a line. Memristive circuits systematically yield manifolds of non-isolated equilibria, and in this paper we address a systematic characterization of the TBWP in circuits with a single memristor. To achieve this we develop two mathematical results of independent interest; the first one is an extension of the TBWP theorem to explicit ordinary differential equations (ODEs) in arbitrary dimension; the second result drives the characterization of this phenomenon to semiexplicit differential-algebraic equations (DAEs), which provide the appropriate framework for the analysis of circuit dynamics. In the circuit context the analysis is performed in graph-theoretic terms: in this setting, our first working scenario is restricted to passive problems (exception made of the bifurcating memristor), and in a second step some results are presented for the analysis of non-passive cases. The latter context is illustrated by means of a memristive neural network model.

This paper concerns with a compact network model combined with distributed models for semiconductor devices. For linear RLC networks containing distributed semiconductor devices, we construct a mathematical model that joins the differential-algebraic initial value problem for the electric circuit with multi-dimensional parabolic-elliptic boundary value problems for the devices. We prove an existence and uniqueness result, and the asymptotic behavior of this mixed initial boundary value problem of partial differential-algebraic equations.

The structural analysis, i.e., the investigation of the differential-algebraic nature, of circuits containing simple elements, i.e., resistances, inductances and capacitances is well established. However, nowadays circuits contain all sorts of elements, e.g. behavioral models or partial differential equations stemming from refined device modelling. This paper proposes the definition of generalized circuit elements which may for example contain additional internal degrees of freedom, such that those elements still behave structurally like resistances, inductances and capacitances. Several complex examples demonstrate the relevance of those definitions.

We consider nonlinear electrical circuits for which we derive a port-Hamiltonian formulation. After recalling a framework for nonlinear port-Hamiltonian systems, we model each circuit component as an individual port-Hamiltonian system. The overall circuit model is then derived by considering a port-Hamiltonian interconnection of the components. We further compare this modeling approach with standard formulations of nonlinear electrical circuits.

In this paper, we investigate few memristor-based analog circuits namely the phase shift oscillator, integrator, and differentiator which have been explored numerously using the traditional lumped components. We use LTspice-IV platform for simulation of the above-said circuits. The investigation resorts to the nonlinear dopant drift model of memristor and the window function portrayed in the literature for nonlinearity realization. The results of our investigations depict good agreement with the conventional lumped component based phase shift oscillator, integrator, and differentiator circuits. The results are evident to showcase the potential of the memristor as a promising candidate for the next generation analog circuits., Comment: 11 Pages, 9 Figures

This paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such tilings due to R.L. Brooks, C.A.B. Smith, A.H. Stone and W.T. Tutte uses direct-current circuits. The new approach of the paper is an application of alternating-current circuits. The following results are obtained: - a necessary condition for a rectangle to be tilable by rectangles of given shapes; - a criterion for a rectangle to be tilable by rectangles similar to it but not all homothetic to it; - a criterion for a generic polygon to be tilable by squares. These results generalize the ones of C. Freiling, R. Kenyon, M. Laczkovich, D. Rinne and G. Szekeres., Comment: In English and in Russian; 21 pages; 6 figures; minor improvement of exposition, Russian translation added

A simple discrete planar dynamical model for the ideal (logical) R-S flip-flop circuit is developed with an eye toward mimicking the dynamical behavior observed for actual physical realizations of this circuit. It is shown that the model exhibits most of the qualitative features ascribed to the R-S flip-flop circuit, such as an intrinsic instability associated with unit set and reset inputs, manifested in a chaotic sequence of output states that tend to oscillate among all possible output states, and the existence of periodic orbits of arbitrarily high period that depend on the various intrinsic system parameters. The investigation involves a combination of analytical methods from the modern theory of discrete dynamical systems, and numerical simulations that illustrate the dazzling array of dynamics that can be generated by the model. Validation of the discrete model is accomplished by comparison with certain Poincar\'e map like representations of the dynamics corresponding to three-dimensional differential equation models of electrical circuits that produce R-S flip-flop behavior., Comment: Accepted Feb 23, 2009

We develop a discrete network approximation to effective conductivity of high contrast, highly packed particulate composites with nonlinear constituent relations. The key tool is the perforated medium approach, which provides a simple mathematical justification of the discrete network approximation by variational techniques.

Let $X$ be a dimensional finite lattice (not necessary distributive) and let $F$ be a mapping from $X$ to $X$. Here we introduce a new notion of neighbours of an element of $X$ and prove that if all the neighbours of each element of $X$ are in $X$ and there is no negative circuit in the interaction graph of $F$, then $F$ has a fixed point.

A polynomial P in n complex variables is said to have the "half-plane property" (or Hurwitz property) if it is nonvanishing whenever all the variables lie in the open right half-plane. Such polynomials arise in combinatorics, reliability theory, electrical circuit theory and statistical mechanics. A particularly important case is when the polynomial is homogeneous and multiaffine: then it is the (weighted) generating polynomial of an r-uniform set system. We prove that the support (set of nonzero coefficients) of a homogeneous multiaffine polynomial with the half-plane property is necessarily the set of bases of a matroid. Conversely, we ask: For which matroids M does the basis generating polynomial P_{B(M)} have the half-plane property? Not all matroids have the half-plane property, but we find large classes that do: all sixth-root-of-unity matroids, and a subclass of transversal (or cotransversal) matroids that we call "nice". Furthermore, the class of matroids with the half-plane property is closed under minors, duality, direct sums, 2-sums, series and parallel connection, full-rank matroid union, and some special cases of principal truncation, principal extension, principal cotruncation and principal coextension. Our positive results depend on two distinct (and apparently unrelated) methods for constructing polynomials with the half-plane property: a determinant construction (exploiting "energy" arguments), and a permanent construction (exploiting the Heilmann-Lieb theorem on matching polynomials). We conclude with a list of open questions., Comment: LaTeX2e, 111 pages. Submission includes Mathematica programs niceprincipal.m and nicetransversal.m Version 2 corrects a small error at the beginning of Appendix B, and makes a few small improvements elsewhere. To appear in Advances in Applied Mathematics

This paper studies the concept of power dissipation in infinite graphs and fractals associated with passive linear networks consisting of non-dissipative elements. In particular, we analyze the so-called Feynman-Sierpinski ladder, a fractal AC circuit motivated by Feynman's infinite ladder, that exhibits power dissipation and wave propagation for some frequencies. Power dissipation in this circuit is obtained as a limit of quadratic forms, and the corresponding power dissipation measure associated with harmonic potentials is constructed. The latter measure is proved to be continuous and singular with respect to an appropriate Hausdorff measure defined on the fractal dust of nodes of the network., Comment: 21 pages, 8 figures

The use of reverse time chaos allows the realization of hardware chaotic systems that can operate at speeds equivalent to existing state of the art while requiring significantly less complex circuitry. Matched filter decoding is possible for the reverse time system since it exhibits a closed form solution formed partially by a linear basis pulse. Coefficients have been calculated and are used to realize the matched filter digitally as a finite impulse response filter. Numerical simulations confirm that this correctly implements a matched filter that can be used for detection of the chaotic signal. In addition, the direct form of the filter has been implemented in hardware description language and demonstrates performance in agreement with numerical results., 9 pages, 17 figures

We here specialize the well known Positive Real Lemma (also known as the Kalman-Yakubovich-Popov Lemma) to complex matrix-valued rational functions, (i) generalized positive even and (ii) odd. On the way we characterize the (non) minimality of realization of arbitrary systems through (i) the corresponding state matrix and (ii) moving the poles by applying static output feedback. We then explore the application of static output feedback to both generalized positive even and to odd functions.

In this paper, by way of three examples - a fourth order low pass active RC filter, a rudimentary BJT amplifier, and an LC ladder - we show, how the algebraic capabilities of modern computer algebra systems can, or in the last example, might be brought to use in the task of designing analog circuits., Comment: V1: documentclass IEEEtran, 7 pages, 6 figures. Re-release of the printed version, with some minor typographical errors corrected

The order of the set of equivalent resistances, A(n) of n equal resistors combined in series and in parallel has been traditionally addressed computationally, for n up to 22. For larger n there have been constraints of computer memory. Here, we present an analytical approach using the Farey sequence with Fibonacci numbers as its argument. The approximate formula, A(n) ~ 2.55^n, obtained from the computational data up to n = 22 is consistent with the strict upper bound, A(n) ~ 2.618^n, presented here. It is further shown that the Farey sequence approach, developed for the A(n) is applicable to configurations other than the series and/or parallel, namely the bridge circuits and non-planar circuits. Expressions describing set theoretic relations among the sets A(n) are presented in detail. For completeness, programs to generate the various integer sequences occurring in this study, using the symbolic computer language MATHEMATCA, are also presented., Comment: 37 Pages in MS Word, 6 Figures, 19 Integer Sequences, 3 Tables, and 9 Programs in MATHEMATICA. http://SameenAhmedKhan.webs.com/

Reversible computing is a concept reflecting physical reversibility. Until now several reversible systems have been investigated. In a series of papers Kenichi Morita defines the rotary element RE, that is a reversible logic element. By reversibility, he understands that 'every computation process can be traced backward uniquely from the end to the start. In other words, they are backward deterministic systems'. He shows that any reversible Turing machine can be realized as a circuit composed of RE's only. Our purpose in this paper is to use the asynchronous systems theory and the real time for the modeling of the ideal rotary element, Comment: presented at the 12-th Symposium of Mathematics and its Applications, "Politehnica" University of Timisoara, Timisoara, 2009

Analyzing one example of LC circuit in [8], show its Lagrange problem only have other type critical points except for minimum type and maximum type under many circumstances. One novel variational principle is established instead of Pontryagin maximum principle or other extremal principles to be suitable for all types of critical points in nonlinear LC circuits. The generalized Euler-Lagrange equation of new form is derived. The canonical Hamiltonian systems of description are also obtained under the Legendre transformation, instead of the generalized type of Hamiltonian systems. This approach is not only very simple in theory but also convenient in applications and applicable for nonlinear LC circuits with arbitrary topology and other additional integral constraints.

Being inspired by phasor analysis in linear circuit theory, and its algebraic counterpart - the AC-(operational)-calculus for sinusoids developed by W. Marten and W. Mathis - we define a complex structure on several spaces of real-valued elementary functions. This is used to algebraize inhomogeneous linear ordinary differential equations with inhomogenities stemming from these spaces. Thus we deduce an effective method to calculate particular solutions of these ODEs in a purely algebraic way., Comment: V1: documentclass IEEEtran, 6 pages, 1 figure. Re-release of the printed version, with some minor typographical errors corrected

An anomaly in electrical circuit theory is the disappearance of some of the energy when two capacitors, one charged and the other uncharged, are connected together through resistanceless wires. Nonstandard analysis shows that, when the wires are taken to have infinitesimally small but nonzero resistance, the energy dissipated in the wires equals that substantial amount of enregy that had disappeared, and that all but an infinitesimal amount of this dissipation occurs during an infinitesimal initial time period., Comment: 8 pages, 2 figures

A prior work (see Chapter 8 of the book, ``Graphs and Networks: Transfinite and Nonstandard,'' Birkhauser-Boston, Cambridge, Mass., USA, 2004) examined the propagation of an electromagnetic wave on a transfinite transmission line, transfinite in the sense that infinitely many one-way infinite transmission lines are connected in cascade. That there are infinitely many such one-way infinite lines results in the wave propagating without ever reflecting at some discontinuity. The present work examines the cascade where the cascade terminates after only finitely many one-way infinite transmission lines, with the result that reflected waves are now produced at both the far end as well as at the initial end of the transfinite transmission line. The question of whether the reflected waves are infini tesimal or appreciable and whether they sum to an infinitesimal or appreciable amount are resolved for both distortionless and lossless lines. Finally, the generalizations to higher ranks of transfiniteness is briefly summarized., Comment: 16 pages, 3 figures

In Chapter 8 of the Book, ``Graphs and Networks: Transfinite and Nonstandard'' (published by Birkhauser-Boston in 2004), nonstandard versions of transfinite graphs and of electrical networks having such graphs were defined and examined but only for the first two ranks, 0 and 1, of transfiniteness. In the present work, these results are extended to higher ranks of transfinteness. Such is done in detail for the natural-number ranks and also for the first transfinite ordinal rank. Results for still higher ranks of transfiniteness can be established in much the same way. Once the transfinite graphs of higher ranks are established, theorems concerning the existence of hyperreal operating points and the satisfaction of Kirchhoff's laws in nonstandard networks of higher ranks can be proven just as they are for nonstandard networks of the first rank., Comment: 8 pages, 0 figures

The paper studies some important properties of the asynchronous (=timed) automata: the delay-insensitivity, the hazard-freedom, the semi-modularity and the technical condition of good running. Time is discrete.

In an alternating-current network, each edge has a complex "conductance" with positive real part. The response map is the linear map from the vector of voltages at a subset of "boundary nodes" to the vector of currents flowing into the network through these nodes. We prove that the known necessary conditions for these response maps are sufficient, and we construct an appropriate alternating-current network for a given response map., Comment: 6 pages, 1 figure

In this paper an algorithm of a calculation of an inconnectivity probability for planar weighted graphs with high reliable edges is constructed on a base of asymptotic formulas and of a transition to a dual graph. Mathematics Subject Classication: 60K10, 94C05