Implicit QR algorithms for palindromic and even eigenvalue problems

In the spirit of the Hamiltonian QR algorithm and other bidirectional chasing algorithms, a structure-preserving variant of the implicit QR algorithm for palindromic eigenvalue problems is proposed. This new palindromic QR algorithm is strongly backward stable and requires less operations than the standard QZ algorithm, but is restricted to matrix classes where a preliminary reduction to structured Hessenberg form can be performed. By an extension of the implicit Q theorem, the palindromic QR algorithm is shown to be equivalent to a previously developed explicit version. Also, the classical convergence theory for the QR algorithm can be extended to prove local quadratic convergence. We briefly demonstrate how even eigenvalue problems can be addressed by similar techniques. D. S. Watkins partly supported by Deutsche Forschungsgemeinschaft through Matheon, the DFG Research Center Mathematics for key technologies in Berlin.     

关于反中心对称矩阵的某些性质探讨

利用反中心对称矩阵的定义以及翻转矩阵等技巧,给出了反中心对称矩阵的伴随矩阵、特征值及特征向量的一些新结论.     

Connected signed graphs of fixed order,size, and number of negative edges with maximal index

In this paper we focus on connected signed graphs of fixed number of vertices, positive edges and negative edges that maximize the largest eigenvalue (also called the index) of their adjacency matrix. In the first step we determine these signed graphs in the set of signed generalized theta graphs. Concerning the general case, we use the eigenvector techniques for getting some structural properties of resulting signed graphs. In particular, we prove that positive edges induce nested split subgraphs, while negative edges induce double nested signed subgraphs. We observe that our concept can be applied when considering balancedness of signed graphs (the property that is extensively studied in both mathematical and non-mathematical context).     

Systematic Study of Selected Diagonalization Methods for Configuration Interaction Matrices

Several modifications to the Davidson algorithm are systematically explored to establish their performance for an assortment of configuration interaction (CI) computations. The combination of a generalized Davidson method, a periodic two‐vector subspace collapse, and a blocked Davidson approach for multiple roots is determined to retain the convergence characteristics of the full subspace method. This approach permits the efficient computation of wave functions for large‐scale CI matrices by eliminating the need to ever store more than three expansion vectors ( b _i) and associated matrix‐vector products ( σ _i), thereby dramatically reducing the I/O requirements relative to the full subspace scheme. The minimal‐storage, single‐vector method of Olsen is found to be a reasonable alternative for obtaining energies of well‐behaved systems to within μE_h accuracy, although it typically requires around 50% more iterations and at times is too inefficient to yield high accuracy (ca. 10^?10 E_h) for very large CI problems. Several approximations to the diagonal elements of the CI Hamiltonian matrix are found to allow simple on‐the‐fly computation of the preconditioning matrix, to maintain the spin symmetry of the determinant‐based wave function, and to preserve the convergence characteristics of the diagonalization procedure. © 2001 John Wiley & Sons, Inc. J Comput Chem 22: 1574–1589, 2001     

Could one single dichotomous noise cause resonant activation for exit time over potential barrier？

This paper studies the mean first passage time （or exit time, or escape time） over the non-fluctuating potential harrier for a system driven only by a dichotomous noise. It finds that the dichotomous noise can make the particles escape over the potential barrier, in some circumstances; but in other circumstances, it can not. In the case that the particles escape over the potential harrier, a resonant activation phenomenon for the mean first passage time over the potential barrier is obtained.     

An M/M/1 Driven Fluid Queue – Continued Fraction Approach

This paper presents complete solutions of the stationary distributions of buffer occupancy and buffer content of a fluid queue driven by an M/M/1 queue. We assume a general boundary condition when compared to the model discussed in Virtamo and Norros [Queueing Systems 16 (1994) 373–386] and Adan and Resing [Queueing Systems 22 (1996) 171–174]. We achieve the required solutions by transforming the underlying system of differential equations using Laplace transforms to a system of difference equations leading to a continued fraction. This continued fraction helps us to find complete solutions. We also obtain the buffer content distribution for this fluid model using the method of Sericola and Tuffin [Queueing Systems 31 (1999) 253–264].     

An improved Hardy-Sobolev inequality and its application

For , a bounded domain, and for , we improve the Hardy-Sobolev inequality by adding a term with a singular weight of the type . We show that this weight function is optimal in the sense that the inequality fails for any other weight function more singular than this one. Moreover, we show that a series of finite terms can be added to improve the Hardy-Sobolev inequality, which answers a question of Brezis-Vazquez. Finally, we use this result to analyze the behaviour of the first eigenvalue of the operator as increases to for .

     

Accurate computation of the smallest eigenvalue of a diagonally dominant -matrix

If each off-diagonal entry and the sum of each row of a diagonally dominant -matrix are known to certain relative accuracy, then its smallest eigenvalue and the entries of its inverse are known to the same order relative accuracy independent of any condition numbers. In this paper, we devise algorithms that compute these quantities with relative errors in the magnitude of the machine precision. Rounding error analysis and numerical examples are presented to demonstrate the numerical behaviour of the algorithms.

     

Complex Hyperspherical Equations, Nodal-Partitioning, and First-Excited-State Theorems in ℝ n

Three problems related to the spherical quantum billiard in are considered. In the first, a compact form of the hyperspherical equations leads to their complex contracted representation. Employing these contracted equations, a proof is given of Courant's nodal-symmetry intersection theorem for diagonal eigenstates of spherical-like quantum billiards in . The second topic addresses the first-excited-state theorem for the spherical quantum billiard in . Wavefunctions for this system are given by the product form, ( )Z _q+()Y ⁽ⁿ⁾ , where is dimensionless displacement, is angular-momentum number, qis an integer function of dimension, Z() is either a spherical Bessel function (nodd) or a Bessel function of the first kind (neven) and represents (n– 1) independent angular components. Generalized spherical harmonics are written . It is found that the first excited state (i.e., the second eigenstate of the Laplacian) for the spherical quantum billiard in is n-fold degenerate and a first excited state for this quantum billiard exists which contains a nodal bisecting hypersurface of mirror symmetry. These findings establish the first-excited-state theorem for the spherical quantum billiard in . In a third study, an expression is derived for the dimension of the th irreducible representation (irrep) of the rotation group O(n) in by enumerating independent degenerate product eigenstates of the Laplacian.