A macroscopic cable equation, which describes the passive linear ("electrotonic") response of a myelinated axon, was previously derived from a segmented cable equation using Keller's two-space homogenization method [Basser, PJ, Med. and Biol. Comput., 1993, Vol. 31, pp. S87-S92]. Here we use the space and length constants of this averaged cable equation to predict classical scaling laws that go...

Traditional techniques for determining the root loci were developed by Evans. Given the characteristic equation {1 + ( ) ( ) = 0}, Evans root locus method requires the magnitude of ( ) ( ) to be equal to minus one and is well established for determining the pole locations as the system gains are changed. In this paper, nontraditional techniques for developing the root loci of control systems ar...

Currently used stability criteria for linear sampled-data systems refer to the standard linear difference equation form of the system model. This paper presents a stability criterion based on the argument increment rule modified for the delta operator form of the sampled-data model. For the asymptotic stability of this system form it is necessary and sufficient that the roots of the appropriate...

‎In this study‎, ‎properties of spectral characteristic are investigated for‎ ‎singular Sturm-Liouville operators in the case where an eigen‎ ‎parameter not only appears in the differential equation but is‎ ‎also linearly contained in the jump conditions‎. ‎Also Weyl function‎ ‎for considering operator has been defined and the theorems which‎ ‎related to uniqueness of solution of inverse proble...

In this paper, we present an isomorphism between the ring of general polynomials over a division algebra D with center F and the group ring of the free monoid with [D : F ] variables over D. Using this isomorphism, we define the characteristic polynomial of any matrix over any division algebra, i.e., a general polynomial with one variable over the algebra whose roots are precisely the left eige...

This paper is a review of results on computational methods of linear algebra over commutative domains. Methods for the following problems are examined: solution of systems of linear equations, computation of determinants, computation of adjoint and inverse matrices, computation of the characteristic polynomial of a matrix.

We introduce a new class of “random” subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We provide necessary and sufficient conditions of solvability of systems of linear equations within every WM subset of N. We also provide a proof of solvability of partition-regular systems (Rado’s systems) within every WM su...

This paper makes a contribution to differential elimination and more precisely to the problem of computing a representation of the radical differential ideal generated by a system of differential equations (ordinary or partial). The approach we use here involves characteristic set techniques;‡ these were introduced by J. F. Ritt, the founder of differential algebra. The basic idea is to write t...

In this paper, we present an isomorphism between the ring of general polynomials over a division algebra D with center F and the group ring of the free monoid with [D : F ] variables over D. Using this isomorphism, we define the characteristic polynomial of any matrix over any division algebra, i.e., a general polynomial with one variable over the algebra whose roots are precisely the left eige...

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine approximation concerning sums of S-units, we show that for simple LRS (those whose characteristic polynomial has no repeated roots) the Ultimate Positivity Problem is de...