Driven linear modes: Analytical solutions for finite discrete systems

We have obtained exact analytical expressions in closed form, for the linear modes excited in finite and discrete systems that are driven by a spatially homogeneous alternating field. Those modes are extended for frequencies within the linear frequency band while they are either end-localized or end-avoided for frequencies outside the linear frequency band. The analytical solutions are resonant at particular frequencies, which compose the frequency dispersion relation of the finite system.     

Inverses and eigenpairs of tridiagonal Toeplitz matrix with opposite-bordered rows

In this paper, tridiagonal Toeplitz matrix (type I, type II) with opposite-bordered rows are introduced. Main attention is paid to calculate the determinants, the inverses and the eigenpairs of these matrices. Specifically, the determinants of an $n\times n$ tridiagonal Toeplitz matrix with opposite-bordered rows can be explicitly expressed by using the $(n-1)$th Fibonacci number, the inversion of the tridiagonal Toeplitz matrix with opposite-bordered rows can also be explicitly expressed by using the Fibonacci numbers and unknown entries from the new matrix. Besides, we give the expression of eigenvalues and eigenvectors of the tridiagonal Toeplitz matrix with opposite-bordered rows. In addition, some algorithms are presented based on these theoretical results. Numerical results show that the new algorithms have much better computing efficiency than some existing algorithms studied recently.     

Minimum Permanents of Tridiagonal Doubly Stochastic Matrices

We determine the minimum permanents and minimizing matrices of the tridiagonal doubly stochastic matrices and of certain doubly stochastic matrices with prescribed zero entries.     

Generating Birth and Death Processes

Associated with an ordered sequence of an even number 2N of positive real numbers is a birth and death process (BDP) on {0, 1, 2,…, N} having these real numbers as its birth and death rates. We generate another birth and death process from this BDP on {0, 1, 2,…, 2N}. This can be further iterated. We illustrate with an example from tan(kz). In BDP, the decay parameter, viz., the largest non-zero eigenvalue is important in the study of convergence to stationarity. In this article, the smallest eigenvalue is found to be useful.     

Sharp tridiagonal pairs

Let denote a field and let V denote a vector space over with finite positive dimension. We consider a pair of -linear transformations A:V→V and A^*:V→V that satisfies the following conditions: (i) each of A,A^* is diagonalizable; (ii) there exists an ordering of the eigenspaces of A such that A^*V_iV_i-1+V_i+V_i+1 for 0id, where V_-1=0 and V_d+1=0; (iii) there exists an ordering of the eigenspaces of A^* such that for 0iδ, where and ; (iv) there is no subspace W of V such that AWW, A^*WW, W≠0, W≠V. We call such a pair a tridiagonal pair on V. It is known that d=δ and for 0id the dimensions of coincide. We say the pair A,A^* is sharp whenever dimV₀=1. A conjecture of Tatsuro Ito and the second author states that if is algebraically closed then A,A^* is sharp. In order to better understand and eventually prove the conjecture, in this paper we begin a systematic study of the sharp tridiagonal pairs. Our results are summarized as follows. Assuming A,A^* is sharp and using the data we define a finite sequence of scalars called the parameter array. We display some equations that show the geometric significance of the parameter array. We show how the parameter array is affected if Φ is replaced by or or . We prove that if the isomorphism class of Φ is determined by the parameter array then there exists a nondegenerate symmetric bilinear form , on V such that Au,v=u,Av and A^*u,v=u,A^*v for all u,vV.     

J-matrix method of scattering in one dimension: The nonrelativistic theory

We formulate a theory of nonrelativistic scattering in one dimension based on the J-matrix method. The scattering potential is assumed to have a finite range such that it is well represented by its matrix elements in a finite subset of a basis that supports a tridiagonal matrix representation for the reference wave operator. Contrary to our expectation, the 1D formulation reveals a rich and highly nontrivial structure compared to the 3D formulation. Examples are given to demonstrate the utility and accuracy of the method. It is hoped that this formulation constitutes a viable alternative to the classical treatment of 1D scattering problem and that it will help unveil new and interesting applications.     

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method.