12,849 research outputs found
An interval-matrix branch-and-bound algorithm for bounding eigenvalues
We present and explore the behaviour of a branch-and-bound algorithm for calculating valid bounds on the k-th largest eigenvalue of a symmetric interval matrix. Branching on the interval elements of the matrix takes place in conjunction with the application of Rohn’s method (an interval extension of Weyl’s theorem) in order to obtain valid outer bounds on the eigenvalues. Inner bounds are obtained with the use of two local search methods. The algorithm has the theoretical property that it provides bounds to any arbitrary precision > 0 (assuming infinite precision arithmetic) within finite time. In contrast with existing methods, bounds for each individual eigenvalue can be obtained even if its range overlaps with the ranges of other eigenvalues. Performance analysis is carried out through nine examples. In the first example, a comparison of the efficiency of the two local search methods is reported using 4,000 randomly generated matrices. The eigenvalue bounding algorithm is then applied to five randomly generated matrices with overlapping eigenvalue ranges. Valid and sharp bounds are indeed identified given a sufficient number of iterations. Furthermore, most of the range reduction takes place in the first few steps of the algorithm so that significant benefits can be derived without full convergence. Finally, in the last three examples, the potential of the algorithm for use in algorithms to identify index-1 saddle points of nonlinear functions is demonstrated
Solving large sparse eigenvalue problems on supercomputers
An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed
An inverse Sturm-Liouville problem with a fractional derivative
In this paper, we numerically investigate an inverse problem of recovering
the potential term in a fractional Sturm-Liouville problem from one spectrum.
The qualitative behaviors of the eigenvalues and eigenfunctions are discussed,
and numerical reconstructions of the potential with a Newton method from finite
spectral data are presented. Surprisingly, it allows very satisfactory
reconstructions for both smooth and discontinuous potentials, provided that the
order of fractional derivative is sufficiently away from 2.Comment: 16 pages, 6 figures, accepted for publication in Journal of
Computational Physic
Spectral-based Propagation Schemes for Time-Dependent Quantum Systems with Application to Carbon Nanotubes
Effective modeling and numerical spectral-based propagation schemes are
proposed for addressing the challenges in time-dependent quantum simulations of
systems ranging from atoms, molecules, and nanostructures to emerging
nanoelectronic devices. While time-dependent Hamiltonian problems can be
formally solved by propagating the solutions along tiny simulation time steps,
a direct numerical treatment is often considered too computationally demanding.
In this paper, however, we propose to go beyond these limitations by
introducing high-performance numerical propagation schemes to compute the
solution of the time-ordered evolution operator. In addition to the direct
Hamiltonian diagonalizations that can be efficiently performed using the new
eigenvalue solver FEAST, we have designed a Gaussian propagation scheme and a
basis transformed propagation scheme (BTPS) which allow to reduce considerably
the simulation times needed by time intervals. It is outlined that BTPS offers
the best computational efficiency allowing new perspectives in time-dependent
simulations. Finally, these numerical schemes are applied to study the AC
response of a (5,5) carbon nanotube within a 3D real-space mesh framework
An efficient Fredholm method for calculation of highly excited states of billiards
A numerically efficient Fredholm formulation of the billiard problem is
presented. The standard solution in the framework of the boundary integral
method in terms of a search for roots of a secular determinant is reviewed
first. We next reformulate the singularity condition in terms of a flow in the
space of an auxiliary one-parameter family of eigenproblems and argue that the
eigenvalues and eigenfunctions are analytic functions within a certain domain.
Based on this analytic behavior we present a numerical algorithm to compute a
range of billiard eigenvalues and associated eigenvectors by only two
diagonalizations.Comment: 15 pages, 10 figures; included systematic study of accuracy with 2
new figures, movie to Fig. 4,
http://www.quantumchaos.de/Media/0703030media.av
- …