scholarly journals Companion matrices and their relations to Toeplitz and Hankel matrices

2015 ◽  
Vol 3 (1) ◽  
Author(s):  
Yousong Luo ◽  
Robin Hill

AbstractIn this paper we describe some properties of companion matrices and demonstrate some special patterns that arisewhen a Toeplitz or a Hankel matrix is multiplied by a related companion matrix.We present a necessary and sufficient condition, generalizing known results, for a matrix to be the transforming matrix for a similarity between a pair of companion matrices. A special case of our main result shows that a Toeplitz or a Hankel matrix can be extended using associated companion matrices, preserving the Toeplitz or Hankel structure respectively.

1981 ◽  
Vol 4 (3) ◽  
pp. 531-549 ◽  
Author(s):  
Miklós Szijártó

The correspondence between sequential program schemes and formal languages is well known (Blikle and Mazurkiewicz (1972), Engelfriet (1974)). The situation is more complicated in the case of parallel program schemes, and trace languages (Mazurkiewicz (1977)) have been introduced to describe them. We introduce the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. We investigate the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language.


2002 ◽  
Vol 30 (12) ◽  
pp. 761-770 ◽  
Author(s):  
Xiao-Xiong Gan ◽  
Nathaniel Knox

Given a formal power seriesg(x)=b0+b1x+b2x2+⋯and a nonunitf(x)=a1x+a2x2+⋯, it is well known that the composition ofgwithf,g(f(x)), is a formal power series. If the formal power seriesfabove is not a nonunit, that is, the constant term offis not zero, the existence of the compositiong(f(x))has been an open problem for many years. The recent development investigated the radius of convergence of a composed formal power series likefabove and obtained some very good results. This note gives a necessary and sufficient condition for the existence of the composition of some formal power series. By means of the theorems established in this note, the existence of the composition of a nonunit formal power series is a special case.


1988 ◽  
Vol 25 (3) ◽  
pp. 553-564 ◽  
Author(s):  
Jian Liu ◽  
Peter J. Brockwell

A sufficient condition is derived for the existence of a strictly stationary solution of the general bilinear time series equations. The condition is shown to reduce to the conditions of Pham and Tran (1981) and Bhaskara Rao et al. (1983) in the special cases which they consider. Under the condition specified, a solution is constructed which is shown to be causal, stationary and ergodic. It is moreover the unique causal solution and the unique stationary solution of the defining equations. In the special case when the defining equations contain no non-linear terms, our condition reduces to the well-known necessary and sufficient condition for existence of a causal stationary solution.


2005 ◽  
Vol 2005 (11) ◽  
pp. 1809-1818 ◽  
Author(s):  
Alan V. Lair

We show that the reaction-diffusion systemut=Δφ(u)+f(v),vt=Δψ(v)+g(u), with homogeneous Neumann boundary conditions, has a positive global solution onΩ×[0,∞)if and only if∫∞ds/f(F−1(G(s)))=∞(or, equivalently,∫∞ds/g(G−1(F(s)))=∞), whereF(s)=∫0sf(r)drandG(s)=∫0sg(r)dr. The domainΩ⊆ℝN(N≥1)is bounded with smooth boundary. The functionsφ,ψ,f, andgare nondecreasing, nonnegativeC([0,∞))functions satisfyingφ(s)ψ(s)f(s)g(s)>0fors>0andφ(0)=ψ(0)=0. Applied to the special casef(s)=spandg(s)=sq,p>0,q>0, our result proves that the system has a global solution if and only ifpq≤1.


10.37236/1116 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Guantao Chen ◽  
Joan P. Hutchinson ◽  
Ken Keating ◽  
Jian Shen

A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if there is a unobstructed, non-degenerate, vertical band of visibility between the corresponding bars. We generalize unit bar-visibility graphs to $[1,k]$-bar-visibility graphs by allowing the lengths of the bars to be between $1/k$ and $1$. We completely characterize these graphs for trees. We establish an algorithm with complexity $O(kn)$ to determine whether a tree with $n$ vertices has a $[1,k]$-bar-visibility representation. In the course of developing the algorithm, we study a special case of the knapsack problem: Partitioning a set of positive integers into two sets with sums as equal as possible. We give a necessary and sufficient condition for the existence of such a partition.


2001 ◽  
Vol 17 (6) ◽  
pp. 1143-1155
Author(s):  
Seiji Nabeya

In this paper a necessary and sufficient condition is obtained for two double Wiener integrals to be statistically independent, first in the case of symmetric and continuous kernels. It is also shown that, for more than two double Wiener integrals, pairwise independence implies mutual independence. After that, the continuity condition on the kernels is somewhat relaxed, and it is shown that Craig's (1943, Annals of Mathematical Statistics 14, 195–197) theorem on the independence of quadratic forms in normal variables is a special case of the result obtained for the case of discontinuous kernels.


2006 ◽  
Vol 978 ◽  
Author(s):  
Jerry Z. Yang

AbstractThe accuracy of the quasicontinuum method is studied by reformulating the summation rules in terms of reconstruction schemes for the local atomic environment of the representative atoms. The necessary and sufficient condition for uniform first order accuracy and consequently the elimination of the “ghost force” is formulated in terms of the reconstruction schemes.The quasi-nonlocal approach is discussed as a special case of this condition.Examples of reconstruction schemes that satisfy this condition are presented.Transition between atom-based and element-based summation rules are studied.


1969 ◽  
Vol 34 ◽  
pp. 89-104 ◽  
Author(s):  
Makiko Nisio

Let us consider a stochastically continuous, separable and measurable stationary Gaussian process X = {X(t), − ∞ < t < ∞} with mean zero and with the covariance function p(t) = EX(t + s)X(s). The conditions for continuity of paths have been studied by many authors from various viewpoints. For example, Dudley [3] studied from the viewpoint of ε-entropy and Kahane [5] showed the necessary and sufficient condition in some special case, using the rather neat method of Fourier series.


1988 ◽  
Vol 25 (03) ◽  
pp. 553-564 ◽  
Author(s):  
Jian Liu ◽  
Peter J. Brockwell

A sufficient condition is derived for the existence of a strictly stationary solution of the general bilinear time series equations. The condition is shown to reduce to the conditions of Pham and Tran (1981) and Bhaskara Rao et al. (1983) in the special cases which they consider. Under the condition specified, a solution is constructed which is shown to be causal, stationary and ergodic. It is moreover the unique causal solution and the unique stationary solution of the defining equations. In the special case when the defining equations contain no non-linear terms, our condition reduces to the well-known necessary and sufficient condition for existence of a causal stationary solution.


1982 ◽  
Vol 31 (3-4) ◽  
pp. 105-130 ◽  
Author(s):  
Nripes Kumar Mandal

The problem considered in this paper is that of estimating the maximal (minimal) point of a quadratic response surface. This problem was earlier considered by Chatterjee and Mandai (1981) where ‘deficiency of a design’ was used as a criterion for comparing different designs. Here we use the D-optimality crit rion in an extended sense and obtain designs under this criterion. Firstly, the design is obtained by an heuristic approach motivated by the symmetry of the problem. Finally, D-optimality is verified through a necessary and sufficient condition. The designs obtained are rotatable and are same as those for the deficiency criterion in a special case.


Sign in / Sign up

Export Citation Format

Share Document