Structure preserving parallel algorithms for solving the Bethe–Salpeter eigenvalue problem

DOE PAGES

Shao, Meiyue; da Jornada, Felipe H.; Yang, Chao; ...

2015-10-02

The Bethe–Salpeter eigenvalue problem is a dense structured eigenvalue problem arising from discretized Bethe–Salpeter equation in the context of computing exciton energies and states. A computational challenge is that at least half of the eigenvalues and the associated eigenvectors are desired in practice. In this paper, we establish the equivalence between Bethe–Salpeter eigenvalue problems and real Hamiltonian eigenvalue problems. Based on theoretical analysis, structure preserving algorithms for a class of Bethe–Salpeter eigenvalue problems are proposed. We also show that for this class of problems all eigenvalues obtained from the Tamm–Dancoff approximation are overestimated. In order to solve large scale problemsmore » of practical interest, we discuss parallel implementations of our algorithms targeting distributed memory systems. Finally, several numerical examples are presented to demonstrate the efficiency and accuracy of our algorithms.« less

Generalized Eigenvalues for pairs on heritian matrices

NASA Technical Reports Server (NTRS)

Rublein, George

1988-01-01

A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.

Eigenvalue and eigenvector sensitivity and approximate analysis for repeated eigenvalue problems

NASA Technical Reports Server (NTRS)

Hou, Gene J. W.; Kenny, Sean P.

1991-01-01

A set of computationally efficient equations for eigenvalue and eigenvector sensitivity analysis are derived, and a method for eigenvalue and eigenvector approximate analysis in the presence of repeated eigenvalues is presented. The method developed for approximate analysis involves a reparamaterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations of changes in both the eigenvalues and eigenvectors associated with the repeated eigenvalue problem. Examples are given to demonstrate the application of such equations for sensitivity and approximate analysis.

The ELPA library: scalable parallel eigenvalue solutions for electronic structure theory and computational science.

PubMed

Marek, A; Blum, V; Johanni, R; Havu, V; Lang, B; Auckenthaler, T; Heinecke, A; Bungartz, H-J; Lederer, H

2014-05-28

Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic structure theory and many other areas of computational science. The computational effort formally scales as O(N(3)) with the size of the investigated problem, N (e.g. the electron count in electronic structure theory), and thus often defines the system size limit that practical calculations cannot overcome. In many cases, more than just a small fraction of the possible eigenvalue/eigenvector pairs is needed, so that iterative solution strategies that focus only on a few eigenvalues become ineffective. Likewise, it is not always desirable or practical to circumvent the eigenvalue solution entirely. We here review some current developments regarding dense eigenvalue solvers and then focus on the Eigenvalue soLvers for Petascale Applications (ELPA) library, which facilitates the efficient algebraic solution of symmetric and Hermitian eigenvalue problems for dense matrices that have real-valued and complex-valued matrix entries, respectively, on parallel computer platforms. ELPA addresses standard as well as generalized eigenvalue problems, relying on the well documented matrix layout of the Scalable Linear Algebra PACKage (ScaLAPACK) library but replacing all actual parallel solution steps with subroutines of its own. For these steps, ELPA significantly outperforms the corresponding ScaLAPACK routines and proprietary libraries that implement the ScaLAPACK interface (e.g. Intel's MKL). The most time-critical step is the reduction of the matrix to tridiagonal form and the corresponding backtransformation of the eigenvectors. ELPA offers both a one-step tridiagonalization (successive Householder transformations) and a two-step transformation that is more efficient especially towards larger matrices and larger numbers of CPU cores. ELPA is based on the MPI standard, with an early hybrid MPI-OpenMPI implementation available as well. Scalability beyond 10,000 CPU cores for problem sizes arising in the field of electronic structure theory is demonstrated for current high-performance computer architectures such as Cray or Intel/Infiniband. For a matrix of dimension 260,000, scalability up to 295,000 CPU cores has been shown on BlueGene/P.

Computing the full spectrum of large sparse palindromic quadratic eigenvalue problems arising from surface Green's function calculations

NASA Astrophysics Data System (ADS)

Huang, Tsung-Ming; Lin, Wen-Wei; Tian, Heng; Chen, Guan-Hua

2018-03-01

Full spectrum of a large sparse ⊤-palindromic quadratic eigenvalue problem (⊤-PQEP) is considered arguably for the first time in this article. Such a problem is posed by calculation of surface Green's functions (SGFs) of mesoscopic transistors with a tremendous non-periodic cross-section. For this problem, general purpose eigensolvers are not efficient, nor is advisable to resort to the decimation method etc. to obtain the Wiener-Hopf factorization. After reviewing some rigorous understanding of SGF calculation from the perspective of ⊤-PQEP and nonlinear matrix equation, we present our new approach to this problem. In a nutshell, the unit disk where the spectrum of interest lies is broken down adaptively into pieces small enough that they each can be locally tackled by the generalized ⊤-skew-Hamiltonian implicitly restarted shift-and-invert Arnoldi (G⊤SHIRA) algorithm with suitable shifts and other parameters, and the eigenvalues missed by this divide-and-conquer strategy can be recovered thanks to the accurate estimation provided by our newly developed scheme. Notably the novel non-equivalence deflation is proposed to avoid as much as possible duplication of nearby known eigenvalues when a new shift of G⊤SHIRA is determined. We demonstrate our new approach by calculating the SGF of a realistic nanowire whose unit cell is described by a matrix of size 4000 × 4000 at the density functional tight binding level, corresponding to a 8 × 8nm2 cross-section. We believe that quantum transport simulation of realistic nano-devices in the mesoscopic regime will greatly benefit from this work.

Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations

NASA Technical Reports Server (NTRS)

Sorensen, Danny C.

1996-01-01

Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.

Transmission eigenvalues

NASA Astrophysics Data System (ADS)

Cakoni, Fioralba; Haddar, Houssem

2013-10-01

In inverse scattering theory, transmission eigenvalues can be seen as the extension of the notion of resonant frequencies for impenetrable objects to the case of penetrable dielectrics. The transmission eigenvalue problem is a relatively late arrival to the spectral theory of partial differential equations. Its first appearance was in 1986 in a paper by Kirsch who was investigating the denseness of far-field patterns for scattering solutions of the Helmholtz equation or, in more modern terminology, the injectivity of the far-field operator [1]. The paper of Kirsch was soon followed by a more systematic study by Colton and Monk in the context of developing the dual space method for solving the inverse scattering problem for acoustic waves in an inhomogeneous medium [2]. In this paper they showed that for a spherically stratified media transmission eigenvalues existed and formed a discrete set. Numerical examples were also given showing that in principle transmission eigenvalues could be determined from the far-field data. This first period of interest in transmission eigenvalues was concluded with papers by Colton et al in 1989 [3] and Rynne and Sleeman in 1991 [4] showing that for an inhomogeneous medium (not necessarily spherically stratified) transmission eigenvalues, if they existed, formed a discrete set. For the next seventeen years transmission eigenvalues were ignored. This was mainly due to the fact that, with the introduction of various sampling methods to determine the shape of an inhomogeneous medium from far-field data, transmission eigenvalues were something to be avoided and hence the fact that transmission eigenvalues formed at most a discrete set was deemed to be sufficient. In addition, questions related to the existence of transmission eigenvalues or the structure of associated eigenvectors were recognized as being particularly difficult due to the nonlinearity of the eigenvalue problem and the special structure of the associated transmission eigenvalue problem. The need to answer these questions became important after a series of papers by Cakoni et al [5], and Cakoni et al [6] suggesting that these transmission eigenvalues could be used to obtain qualitative information about the material properties of the scattering object from far-field data. The first answer to the existence of transmission eigenvalues in the general case was given in 2008 when Päivärinta and Sylvester showed the existence of transmission eigenvalues for the index of refraction sufficiently large [7] followed in 2010 by the paper of Cakoni et al who removed the size restriction on the index of refraction [8]. More importantly, in the latter it was shown that transmission eigenvalues yielded qualitative information on the material properties of the scattering object and Cakoni et al established in [9] that transmission eigenvalues could be determined from the Tikhonov regularized solution of the far-field equation. Since the appearance of these papers there has been an explosion of interest in the transmission eigenvalue problem (we refer the reader to our recent survey paper [10] for a detailed account of the developments in this field up to 2012) and the papers in this special issue are representative of the myriad directions that this research has taken. Indeed, we are happy to see that many open theoretical and numerical questions raised in [10] have been answered (totally or partially) in the contributions of this special issue: the existence of transmission eigenvalues with minimal assumptions on the contrast, the numerical evaluation of transmission eigenvalues, the inverse spectral problem, applications to non-destructive testing, etc. In addition to these topics, many other new investigations and research directions have been proposed as we shall see in the brief content summary below. A number of papers in this special issue are concerned with the question of existence of transmission eigenvalues and the structure of the associated transmission eigenfunctions. The three papers by respectively Robbiano [11], Blasten and Päivärinta [12], and Lakshtanov and Vainberg [13] provide new complementary results on the existence of transmission eigenvalues for the scalar problem under weak assumptions on the (possibly complex valued) refractive index that mainly stipulates that the contrast does not change sign on the boundary. It is interesting here to see three different new methods to obtain these results. On the other hand, the paper by Bonnet-Ben Dhia and Chesnel [14] addresses the Fredholm properties of the interior transmission problem when the contrast changes sign on the boundary, exhibiting cases where this property fails. Using more standard approaches, the existence and structure of transmission eigenvalues are analyzed in the paper by Delbary [15] for the case of frequency dependent materials in the context of Maxwell's equations, whereas the paper by Vesalainen [16] initiates the study of the transmission eigenvalue problem in unbounded domains by considering the transmission eigenvalues for Schrödinger equation with non-compactly supported potential. The paper by Monk and Selgas [17] addresses the case where the dielectric is mounted on a perfect conductor and provides some numerical examples of the localization of associated eigenvalues using the linear sampling method. A series of papers then addresses the question of localization of transmission eigenvalues and the associated inverse spectral problem for spherically stratified media. More specifically, the paper by Colton and Leung [18] provides new results on complex transmission eigenvalues and a new proof for uniqueness of a solution to the inverse spectral problem, whereas the paper by Sylvester [19] provides sharp results on how to locate all the transmission eigenvalues associated with angular independent eigenfunctions when the index of refraction is constant. The paper by Gintides and Pallikarakis [20] investigates an iterative least square method to identify the spherically stratified index of refraction from transmission eigenvalues. On the characterization of transmission eigenvalues in terms of far-field measurements, a promising new result is obtained by Kirsch and Lechleiter [21] showing how one can identify the transmission eigenvalues using the eigenvalues of the scattering operator which are available in terms of measured scattering data. In the paper by Kleefeld [22], an accurate method for computing transmission eigenvalues based on a surface integral formulation of the interior transmission problem and numerical methods for nonlinear eigenvalue problems is proposed and numerically validated for the scalar problem in three dimensions. On the other hand, the paper by Sun and Xu [23] investigates the computation of transmission eigenvalues for Maxwell's equations using a standard iterative method associated with a variational formulation of the interior transmission problem with an emphasis on the effect of anisotropy on transmission eigenvalues. From the perspective of using transmission eigenvalues in non-destructive testing, the paper by Cakoni and Moskow [24] investigates the asymptotic behavior of transmission eigenvalues with respect to small inhomogeneities. The paper by Nakamura and Wang [25] investigates the linear sampling method for the time dependent heat equation and analyses the interior transmission problem associated with this equation. Finally, in the paper by Finch and Hickmann [26], the spectrum of the interior transmission problem is related to the unique determination of the acoustic properties of a body in thermoacoustic imaging. We hope that this collection of papers will stimulate further research in the rapidly growing area of transmission eigenvalues and inverse scattering theory.

Approximate analysis for repeated eigenvalue problems with applications to controls-structure integrated design

NASA Technical Reports Server (NTRS)

Kenny, Sean P.; Hou, Gene J. W.

1994-01-01

A method for eigenvalue and eigenvector approximate analysis for the case of repeated eigenvalues with distinct first derivatives is presented. The approximate analysis method developed involves a reparameterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations to changes in the eigenvalues and the eigenvectors associated with the repeated eigenvalue problem. This work also presents a numerical technique that facilitates the definition of an eigenvector derivative for the case of repeated eigenvalues with repeated eigenvalue derivatives (of all orders). Examples are given which demonstrate the application of such equations for sensitivity and approximate analysis. Emphasis is placed on the application of sensitivity analysis to large-scale structural and controls-structures optimization problems.

Solution of an eigenvalue problem for the Laplace operator on a spherical surface. M.S. Thesis - Maryland Univ.

NASA Technical Reports Server (NTRS)

Walden, H.

1974-01-01

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (also referred to as the membrane eigenvalue problem for the vibration equation) on the unit spherical surface are developed. Two specific types of spherical surface domains are considered: (1) the interior of a spherical triangle, i.e., the region bounded by arcs of three great circles, and (2) the exterior of a great circle arc extending for less than pi radians on the sphere (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is derived. The symmetric (generally five-point) finite difference equations that develop are written in matrix form and then solved by the iterative method of point successive overrelaxation. Upon convergence of this iterative method, the fundamental eigenvalue is approximated by iteration utilizing the power method as applied to the finite Rayleigh quotient.

The asymptotic spectra of banded Toeplitz and quasi-Toeplitz matrices

NASA Technical Reports Server (NTRS)

Beam, Richard M.; Warming, Robert F.

1991-01-01

Toeplitz matrices occur in many mathematical, as well as, scientific and engineering investigations. This paper considers the spectra of banded Toeplitz and quasi-Toeplitz matrices with emphasis on non-normal matrices of arbitrarily large order and relatively small bandwidth. These are the type of matrices that appear in the investigation of stability and convergence of difference approximations to partial differential equations. Quasi-Toeplitz matrices are the result of non-Dirichlet boundary conditions for the difference approximations. The eigenvalue problem for a banded Toeplitz or quasi-Toeplitz matrix of large order is, in general, analytically intractable and (for non-normal matrices) numerically unreliable. An asymptotic (matrix order approaches infinity) approach partitions the eigenvalue analysis of a quasi-Toeplitz matrix into two parts, namely the analysis for the boundary condition independent spectrum and the analysis for the boundary condition dependent spectrum. The boundary condition independent spectrum is the same as the pure Toeplitz matrix spectrum. Algorithms for computing both parts of the spectrum are presented. Examples are used to demonstrate the utility of the algorithms, to present some interesting spectra, and to point out some of the numerical difficulties encountered when conventional matrix eigenvalue routines are employed for non-normal matrices of large order. The analysis for the Toeplitz spectrum also leads to a diagonal similarity transformation that improves conventional numerical eigenvalue computations. Finally, the algorithm for the asymptotic spectrum is extended to the Toeplitz generalized eigenvalue problem which occurs, for example, in the stability of Pade type difference approximations to differential equations.

A systematic linear space approach to solving partially described inverse eigenvalue problems

NASA Astrophysics Data System (ADS)

Hu, Sau-Lon James; Li, Haujun

2008-06-01

Most applications of the inverse eigenvalue problem (IEP), which concerns the reconstruction of a matrix from prescribed spectral data, are associated with special classes of structured matrices. Solving the IEP requires one to satisfy both the spectral constraint and the structural constraint. If the spectral constraint consists of only one or few prescribed eigenpairs, this kind of inverse problem has been referred to as the partially described inverse eigenvalue problem (PDIEP). This paper develops an efficient, general and systematic approach to solve the PDIEP. Basically, the approach, applicable to various structured matrices, converts the PDIEP into an ordinary inverse problem that is formulated as a set of simultaneous linear equations. While solving simultaneous linear equations for model parameters, the singular value decomposition method is applied. Because of the conversion to an ordinary inverse problem, other constraints associated with the model parameters can be easily incorporated into the solution procedure. The detailed derivation and numerical examples to implement the newly developed approach to symmetric Toeplitz and quadratic pencil (including mass, damping and stiffness matrices of a linear dynamic system) PDIEPs are presented. Excellent numerical results for both kinds of problem are achieved under the situations that have either unique or infinitely many solutions.

Survey of methods for calculating sensitivity of general eigenproblems

NASA Technical Reports Server (NTRS)

Murthy, Durbha V.; Haftka, Raphael T.

1987-01-01

A survey of methods for sensitivity analysis of the algebraic eigenvalue problem for non-Hermitian matrices is presented. In addition, a modification of one method based on a better normalizing condition is proposed. Methods are classified as Direct or Adjoint and are evaluated for efficiency. Operation counts are presented in terms of matrix size, number of design variables and number of eigenvalues and eigenvectors of interest. The effect of the sparsity of the matrix and its derivatives is also considered, and typical solution times are given. General guidelines are established for the selection of the most efficient method.

On the solution of two-point linear differential eigenvalue problems. [numerical technique with application to Orr-Sommerfeld equation

NASA Technical Reports Server (NTRS)

Antar, B. N.

1976-01-01

A numerical technique is presented for locating the eigenvalues of two point linear differential eigenvalue problems. The technique is designed to search for complex eigenvalues belonging to complex operators. With this method, any domain of the complex eigenvalue plane could be scanned and the eigenvalues within it, if any, located. For an application of the method, the eigenvalues of the Orr-Sommerfeld equation of the plane Poiseuille flow are determined within a specified portion of the c-plane. The eigenvalues for alpha = 1 and R = 10,000 are tabulated and compared for accuracy with existing solutions.

Eigenvalues of the Wentzell-Laplace operator and of the fourth order Steklov problems

NASA Astrophysics Data System (ADS)

Xia, Changyu; Wang, Qiaoling

2018-05-01

We prove a sharp upper bound and a lower bound for the first nonzero eigenvalue of the Wentzell-Laplace operator on compact manifolds with boundary and an isoperimetric inequality for the same eigenvalue in the case where the manifold is a bounded domain in a Euclidean space. We study some fourth order Steklov problems and obtain isoperimetric upper bound for the first eigenvalue of them. We also find all the eigenvalues and eigenfunctions for two kind of fourth order Steklov problems on a Euclidean ball.

Bethe-Salpeter Eigenvalue Solver Package (BSEPACK) v0.1

DOE Office of Scientific and Technical Information (OSTI.GOV)

SHAO, MEIYEU; YANG, CHAO

2017-04-25

The BSEPACK contains a set of subroutines for solving the Bethe-Salpeter Eigenvalue (BSE) problem. This type of problem arises in this study of optical excitation of nanoscale materials. The BSE problem is a structured non-Hermitian eigenvalue problem. The BSEPACK software can be used to compute all or subset of eigenpairs of a BSE Hamiltonian. It can also be used to compute the optical absorption spectrum without computing BSE eigenvalues and eigenvectors explicitly. The package makes use of the ScaLAPACK, LAPACK and BLAS.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bai, Zhaojun; Yang, Chao

What is common among electronic structure calculation, design of MEMS devices, vibrational analysis of high speed railways, and simulation of the electromagnetic field of a particle accelerator? The answer: they all require solving large scale nonlinear eigenvalue problems. In fact, these are just a handful of examples in which solving nonlinear eigenvalue problems accurately and efficiently is becoming increasingly important. Recognizing the importance of this class of problems, an invited minisymposium dedicated to nonlinear eigenvalue problems was held at the 2005 SIAM Annual Meeting. The purpose of the minisymposium was to bring together numerical analysts and application scientists to showcasemore » some of the cutting edge results from both communities and to discuss the challenges they are still facing. The minisymposium consisted of eight talks divided into two sessions. The first three talks focused on a type of nonlinear eigenvalue problem arising from electronic structure calculations. In this type of problem, the matrix Hamiltonian H depends, in a non-trivial way, on the set of eigenvectors X to be computed. The invariant subspace spanned by these eigenvectors also minimizes a total energy function that is highly nonlinear with respect to X on a manifold defined by a set of orthonormality constraints. In other applications, the nonlinearity of the matrix eigenvalue problem is restricted to the dependency of the matrix on the eigenvalues to be computed. These problems are often called polynomial or rational eigenvalue problems In the second session, Christian Mehl from Technical University of Berlin described numerical techniques for solving a special type of polynomial eigenvalue problem arising from vibration analysis of rail tracks excited by high-speed trains.« less

A Problem-Centered Approach to Canonical Matrix Forms

ERIC Educational Resources Information Center

Sylvestre, Jeremy

2014-01-01

This article outlines a problem-centered approach to the topic of canonical matrix forms in a second linear algebra course. In this approach, abstract theory, including such topics as eigenvalues, generalized eigenspaces, invariant subspaces, independent subspaces, nilpotency, and cyclic spaces, is developed in response to the patterns discovered…

Applying nonlinear diffusion acceleration to the neutron transport k-Eigenvalue problem with anisotropic scattering

DOE PAGES

Willert, Jeffrey; Park, H.; Taitano, William

2015-11-01

High-order/low-order (or moment-based acceleration) algorithms have been used to significantly accelerate the solution to the neutron transport k-eigenvalue problem over the past several years. Recently, the nonlinear diffusion acceleration algorithm has been extended to solve fixed-source problems with anisotropic scattering sources. In this paper, we demonstrate that we can extend this algorithm to k-eigenvalue problems in which the scattering source is anisotropic and a significant acceleration can be achieved. Lastly, we demonstrate that the low-order, diffusion-like eigenvalue problem can be solved efficiently using a technique known as nonlinear elimination.

A Decentralized Eigenvalue Computation Method for Spectrum Sensing Based on Average Consensus

NASA Astrophysics Data System (ADS)

Mohammadi, Jafar; Limmer, Steffen; Stańczak, Sławomir

2016-07-01

This paper considers eigenvalue estimation for the decentralized inference problem for spectrum sensing. We propose a decentralized eigenvalue computation algorithm based on the power method, which is referred to as generalized power method GPM; it is capable of estimating the eigenvalues of a given covariance matrix under certain conditions. Furthermore, we have developed a decentralized implementation of GPM by splitting the iterative operations into local and global computation tasks. The global tasks require data exchange to be performed among the nodes. For this task, we apply an average consensus algorithm to efficiently perform the global computations. As a special case, we consider a structured graph that is a tree with clusters of nodes at its leaves. For an accelerated distributed implementation, we propose to use computation over multiple access channel (CoMAC) as a building block of the algorithm. Numerical simulations are provided to illustrate the performance of the two algorithms.

Eigenvalue statistics for the sum of two complex Wishart matrices

NASA Astrophysics Data System (ADS)

Kumar, Santosh

2014-09-01

The sum of independent Wishart matrices, taken from distributions with unequal covariance matrices, plays a crucial role in multivariate statistics, and has applications in the fields of quantitative finance and telecommunication. However, analytical results concerning the corresponding eigenvalue statistics have remained unavailable, even for the sum of two Wishart matrices. This can be attributed to the complicated and rotationally noninvariant nature of the matrix distribution that makes extracting the information about eigenvalues a nontrivial task. Using a generalization of the Harish-Chandra-Itzykson-Zuber integral, we find exact solution to this problem for the complex Wishart case when one of the covariance matrices is proportional to the identity matrix, while the other is arbitrary. We derive exact and compact expressions for the joint probability density and marginal density of eigenvalues. The analytical results are compared with numerical simulations and we find perfect agreement.

A divide and conquer approach to the nonsymmetric eigenvalue problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jessup, E.R.

1991-01-01

Serial computation combined with high communication costs on distributed-memory multiprocessors make parallel implementations of the QR method for the nonsymmetric eigenvalue problem inefficient. This paper introduces an alternative algorithm for the nonsymmetric tridiagonal eigenvalue problem based on rank two tearing and updating of the matrix. The parallelism of this divide and conquer approach stems from independent solution of the updating problems. 11 refs.

Eigenvalue problems for Beltrami fields arising in a three-dimensional toroidal magnetohydrodynamic equilibrium problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hudson, S. R.; Hole, M. J.; Dewar, R. L.

2007-05-15

A generalized energy principle for finite-pressure, toroidal magnetohydrodynamic (MHD) equilibria in general three-dimensional configurations is proposed. The full set of ideal-MHD constraints is applied only on a discrete set of toroidal magnetic surfaces (invariant tori), which act as barriers against leakage of magnetic flux, helicity, and pressure through chaotic field-line transport. It is argued that a necessary condition for such invariant tori to exist is that they have fixed, irrational rotational transforms. In the toroidal domains bounded by these surfaces, full Taylor relaxation is assumed, thus leading to Beltrami fields {nabla}xB={lambda}B, where {lambda} is constant within each domain. Two distinctmore » eigenvalue problems for {lambda} arise in this formulation, depending on whether fluxes and helicity are fixed, or boundary rotational transforms. These are studied in cylindrical geometry and in a three-dimensional toroidal region of annular cross section. In the latter case, an application of a residue criterion is used to determine the threshold for connected chaos.« less

Convergence of the Light-Front Coupled-Cluster Method in Scalar Yukawa Theory

NASA Astrophysics Data System (ADS)

Usselman, Austin

We use Fock-state expansions and the Light-Front Coupled-Cluster (LFCC) method to study mass eigenvalue problems in quantum field theory. Specifically, we study convergence of the method in scalar Yukawa theory. In this theory, a single charged particle is surrounded by a cloud of neutral particles. The charged particle can create or annihilate neutral particles, causing the n-particle state to depend on the n + 1 and n - 1-particle state. Fock state expansion leads to an infinite set of coupled equations where truncation is required. The wave functions for the particle states are expanded in a basis of symmetric polynomials and a generalized eigenvalue problem is solved for the mass eigenvalue. The mass eigenvalue problem is solved for multiple values for the coupling strength while the number of particle states and polynomial basis order are increased. Convergence of the mass eigenvalue solutions is then obtained. Three mass ratios between the charged particle and neutral particles were studied. This includes a massive charged particle, equal masses and massive neutral particles. Relative probability between states can also be explored for more detailed understanding of the process of convergence with respect to the number of Fock sectors. The reliance on higher order particle states depended on how large the mass of the charge particle was. The higher the mass of the charged particle, the more the system depended on higher order particle states. The LFCC method solves this same mass eigenvalue problem using an exponential operator. This exponential operator can then be truncated instead to form a finite system of equations that can be solved using a built in system solver provided in most computational environments, such as MatLab and Mathematica. First approximation in the LFCC method allows for only one particle to be created by the new operator and proved to be not powerful enough to match the Fock state expansion. The second order approximation allowed one and two particles to be created by the new operator and converged to the Fock state expansion results. This showed the LFCC method to be a reliable replacement method for solving quantum field theory problems.

Computation of eigenpairs of Ax = lambda Bx for vibrations of spinning deformable bodies

NASA Technical Reports Server (NTRS)

Utku, S.; Clemente, J. L. M.

1984-01-01

It is shown that, when linear theory is used, the general eigenvalue problem related with the free vibrations of spinning deformable bodies is of the type AX = lambda Bx, where A is Hermitian, and B is real positive definite. Since the order n of the matrices may be large, and A and B are banded or block banded, due to the economics of the numerical solution, one is interested in obtaining only those eigenvalues which fall within the frequency band of interest of the problem. The paper extends the well known method of bisections and iteration of R to the n power to n dimensional complex spaces, i.e., to C to the n power, so that it can be applied to the present problem.

Fast Eigensolver for Computing 3D Earth's Normal Modes

NASA Astrophysics Data System (ADS)

Shi, J.; De Hoop, M. V.; Li, R.; Xi, Y.; Saad, Y.

2017-12-01

We present a novel parallel computational approach to compute Earth's normal modes. We discretize Earth via an unstructured tetrahedral mesh and apply the continuous Galerkin finite element method to the elasto-gravitational system. To resolve the eigenvalue pollution issue, following the analysis separating the seismic point spectrum, we utilize explicitly a representation of the displacement for describing the oscillations of the non-seismic modes in the fluid outer core. Effectively, we separate out the essential spectrum which is naturally related to the Brunt-Väisälä frequency. We introduce two Lanczos approaches with polynomial and rational filtering for solving this generalized eigenvalue problem in prescribed intervals. The polynomial filtering technique only accesses the matrix pair through matrix-vector products and is an ideal candidate for solving three-dimensional large-scale eigenvalue problems. The matrix-free scheme allows us to deal with fluid separation and self-gravitation in an efficient way, while the standard shift-and-invert method typically needs an explicit shifted matrix and its factorization. The rational filtering method converges much faster than the standard shift-and-invert procedure when computing all the eigenvalues inside an interval. Both two Lanczos approaches solve for the internal eigenvalues extremely accurately, comparing with the standard eigensolver. In our computational experiments, we compare our results with the radial earth model benchmark, and visualize the normal modes using vector plots to illustrate the properties of the displacements in different modes.

Asymptotic analysis on a pseudo-Hermitian Riemann-zeta Hamiltonian

NASA Astrophysics Data System (ADS)

Bender, Carl M.; Brody, Dorje C.

2018-04-01

The differential-equation eigenvalue problem associated with a recently-introduced Hamiltonian, whose eigenvalues correspond to the zeros of the Riemann zeta function, is analyzed using Fourier and WKB analysis. The Fourier analysis leads to a challenging open problem concerning the formulation of the eigenvalue problem in the momentum space. The WKB analysis gives the exact asymptotic behavior of the eigenfunction.

Shape sensitivity analysis of flutter response of a laminated wing

NASA Technical Reports Server (NTRS)

Bergen, Fred D.; Kapania, Rakesh K.

1988-01-01

A method is presented for calculating the shape sensitivity of a wing aeroelastic response with respect to changes in geometric shape. Yates' modified strip method is used in conjunction with Giles' equivalent plate analysis to predict the flutter speed, frequency, and reduced frequency of the wing. Three methods are used to calculate the sensitivity of the eigenvalue. The first method is purely a finite difference calculation of the eigenvalue derivative directly from the solution of the flutter problem corresponding to the two different values of the shape parameters. The second method uses an analytic expression for the eigenvalue sensitivities of a general complex matrix, where the derivatives of the aerodynamic, mass, and stiffness matrices are computed using a finite difference approximation. The third method also uses an analytic expression for the eigenvalue sensitivities, but the aerodynamic matrix is computed analytically. All three methods are found to be in good agreement with each other. The sensitivities of the eigenvalues were used to predict the flutter speed, frequency, and reduced frequency. These approximations were found to be in good agreement with those obtained using a complete reanalysis.

A discourse on sensitivity analysis for discretely-modeled structures

NASA Technical Reports Server (NTRS)

Adelman, Howard M.; Haftka, Raphael T.

1991-01-01

A descriptive review is presented of the most recent methods for performing sensitivity analysis of the structural behavior of discretely-modeled systems. The methods are generally but not exclusively aimed at finite element modeled structures. Topics included are: selections of finite difference step sizes; special consideration for finite difference sensitivity of iteratively-solved response problems; first and second derivatives of static structural response; sensitivity of stresses; nonlinear static response sensitivity; eigenvalue and eigenvector sensitivities for both distinct and repeated eigenvalues; and sensitivity of transient response for both linear and nonlinear structural response.

An extended basis inexact shift-invert Lanczos for the efficient solution of large-scale generalized eigenproblems

NASA Astrophysics Data System (ADS)

Rewieński, M.; Lamecki, A.; Mrozowski, M.

2013-09-01

This paper proposes a technique, based on the Inexact Shift-Invert Lanczos (ISIL) method with Inexact Jacobi Orthogonal Component Correction (IJOCC) refinement, and a preconditioned conjugate-gradient (PCG) linear solver with multilevel preconditioner, for finding several eigenvalues for generalized symmetric eigenproblems. Several eigenvalues are found by constructing (with the ISIL process) an extended projection basis. Presented results of numerical experiments confirm the technique can be effectively applied to challenging, large-scale problems characterized by very dense spectra, such as resonant cavities with spatial dimensions which are large with respect to wavelengths of the resonating electromagnetic fields. It is also shown that the proposed scheme based on inexact linear solves delivers superior performance, as compared to methods which rely on exact linear solves, indicating tremendous potential of the 'inexact solve' concept. Finally, the scheme which generates an extended projection basis is found to provide a cost-efficient alternative to classical deflation schemes when several eigenvalues are computed.

Calculation of transmission probability by solving an eigenvalue problem

NASA Astrophysics Data System (ADS)

Bubin, Sergiy; Varga, Kálmán

2010-11-01

The electron transmission probability in nanodevices is calculated by solving an eigenvalue problem. The eigenvalues are the transmission probabilities and the number of nonzero eigenvalues is equal to the number of open quantum transmission eigenchannels. The number of open eigenchannels is typically a few dozen at most, thus the computational cost amounts to the calculation of a few outer eigenvalues of a complex Hermitian matrix (the transmission matrix). The method is implemented on a real space grid basis providing an alternative to localized atomic orbital based quantum transport calculations. Numerical examples are presented to illustrate the efficiency of the method.

Gaussian quadrature for multiple orthogonal polynomials

NASA Astrophysics Data System (ADS)

Coussement, Jonathan; van Assche, Walter

2005-06-01

We study multiple orthogonal polynomials of type I and type II, which have orthogonality conditions with respect to r measures. These polynomials are connected by their recurrence relation of order r+1. First we show a relation with the eigenvalue problem of a banded lower Hessenberg matrix Ln, containing the recurrence coefficients. As a consequence, we easily find that the multiple orthogonal polynomials of type I and type II satisfy a generalized Christoffel-Darboux identity. Furthermore, we explain the notion of multiple Gaussian quadrature (for proper multi-indices), which is an extension of the theory of Gaussian quadrature for orthogonal polynomials and was introduced by Borges. In particular, we show that the quadrature points and quadrature weights can be expressed in terms of the eigenvalue problem of Ln.

EvArnoldi: A New Algorithm for Large-Scale Eigenvalue Problems.

PubMed

Tal-Ezer, Hillel

2016-05-19

Eigenvalues and eigenvectors are an essential theme in numerical linear algebra. Their study is mainly motivated by their high importance in a wide range of applications. Knowledge of eigenvalues is essential in quantum molecular science. Solutions of the Schrödinger equation for the electrons composing the molecule are the basis of electronic structure theory. Electronic eigenvalues compose the potential energy surfaces for nuclear motion. The eigenvectors allow calculation of diople transition matrix elements, the core of spectroscopy. The vibrational dynamics molecule also requires knowledge of the eigenvalues of the vibrational Hamiltonian. Typically in these problems, the dimension of Hilbert space is huge. Practically, only a small subset of eigenvalues is required. In this paper, we present a highly efficient algorithm, named EvArnoldi, for solving the large-scale eigenvalues problem. The algorithm, in its basic formulation, is mathematically equivalent to ARPACK ( Sorensen , D. C. Implicitly Restarted Arnoldi/Lanczos Methods for Large Scale Eigenvalue Calculations ; Springer , 1997 ; Lehoucq , R. B. ; Sorensen , D. C. SIAM Journal on Matrix Analysis and Applications 1996 , 17 , 789 ; Calvetti , D. ; Reichel , L. ; Sorensen , D. C. Electronic Transactions on Numerical Analysis 1994 , 2 , 21 ) (or Eigs of Matlab) but significantly simpler.

Optical reflection from planetary surfaces as an operator-eigenvalue problem

USGS Publications Warehouse

Wildey, R.L.

1986-01-01

The understanding of quantum mechanical phenomena has come to rely heavily on theory framed in terms of operators and their eigenvalue equations. This paper investigates the utility of that technique as related to the reciprocity principle in diffuse reflection. The reciprocity operator is shown to be unitary and Hermitian; hence, its eigenvectors form a complete orthonormal basis. The relevant eigenvalue is found to be infinitely degenerate. A superposition of the eigenfunctions found from solution by separation of variables is inadequate to form a general solution that can be fitted to a one-dimensional boundary condition, because the difficulty of resolving the reciprocity operator into a superposition of independent one-dimensional operators has yet to be overcome. A particular lunar application in the form of a failed prediction of limb-darkening of the full Moon from brightness versus phase illustrates this problem. A general solution is derived which fully exploits the determinative powers of the reciprocity operator as an unresolved two-dimensional operator. However, a solution based on a sum of one-dimensional operators, if possible, would be much more powerful. A close association is found between the reciprocity operator and the particle-exchange operator of quantum mechanics, which may indicate the direction for further successful exploitation of the approach based on the operational calculus. ?? 1986 D. Reidel Publishing Company.

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

NASA Astrophysics Data System (ADS)

Vecharynski, Eugene; Brabec, Jiri; Shao, Meiyue; Govind, Niranjan; Yang, Chao

2017-12-01

We present two efficient iterative algorithms for solving the linear response eigenvalue problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into an eigenvalue problem that involves the product of two matrices M and K. We show that, because MK is self-adjoint with respect to the inner product induced by the matrix K, this product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. We show that the other component of the eigenvector can be easily recovered in an inexpensive postprocessing procedure. As a result, the algorithms we present here become more efficient than existing methods that try to approximate both components of the eigenvectors simultaneously. In particular, our numerical experiments demonstrate that the new algorithms presented here consistently outperform the existing state-of-the-art Davidson type solvers by a factor of two in both solution time and storage.

Multigrid method for stability problems

NASA Technical Reports Server (NTRS)

Ta'asan, Shlomo

1988-01-01

The problem of calculating the stability of steady state solutions of differential equations is addressed. Leading eigenvalues of large matrices that arise from discretization are calculated, and an efficient multigrid method for solving these problems is presented. The resulting grid functions are used as initial approximations for appropriate eigenvalue problems. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a nonstandard way in which the right-hand side of the coarse grid equations involves unknown parameters to be solved on the coarse grid. This leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem are presented which demonstrate the effectiveness of the method.

An accurate method for solving a class of fractional Sturm-Liouville eigenvalue problems

NASA Astrophysics Data System (ADS)

Kashkari, Bothayna S. H.; Syam, Muhammed I.

2018-06-01

This article is devoted to both theoretical and numerical study of the eigenvalues of nonsingular fractional second-order Sturm-Liouville problem. In this paper, we implement a fractional-order Legendre Tau method to approximate the eigenvalues. This method transforms the Sturm-Liouville problem to a sparse nonsingular linear system which is solved using the continuation method. Theoretical results for the considered problem are provided and proved. Numerical results are presented to show the efficiency of the proposed method.

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vecharynski, Eugene; Brabec, Jiri; Shao, Meiyue

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-innermore » product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.« less

Finite-difference solution of the compressible stability eigenvalue problem

NASA Technical Reports Server (NTRS)

Malik, M. R.

1982-01-01

A compressible stability analysis computer code is developed. The code uses a matrix finite difference method for local eigenvalue solution when a good guess for the eigenvalue is available and is significantly more computationally efficient than the commonly used initial value approach. The local eigenvalue search procedure also results in eigenfunctions and, at little extra work, group velocities. A globally convergent eigenvalue procedure is also developed which may be used when no guess for the eigenvalue is available. The global problem is formulated in such a way that no unstable spurious modes appear so that the method is suitable for use in a black box stability code. Sample stability calculations are presented for the boundary layer profiles of a Laminar Flow Control (LFC) swept wing.

A robust multilevel simultaneous eigenvalue solver

NASA Technical Reports Server (NTRS)

Costiner, Sorin; Taasan, Shlomo

1993-01-01

Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.

Normalized modes at selected points without normalization

NASA Astrophysics Data System (ADS)

Kausel, Eduardo

2018-04-01

As every textbook on linear algebra demonstrates, the eigenvectors for the general eigenvalue problem | K - λM | = 0 involving two real, symmetric, positive definite matrices K , M satisfy some well-defined orthogonality conditions. Equally well-known is the fact that those eigenvectors can be normalized so that their modal mass μ =ϕT Mϕ is unity: it suffices to divide each unscaled mode by the square root of the modal mass. Thus, the normalization is the result of an explicit calculation applied to the modes after they were obtained by some means. However, we show herein that the normalized modes are not merely convenient forms of scaling, but that they are actually intrinsic properties of the pair of matrices K , M, that is, the matrices already "know" about normalization even before the modes have been obtained. This means that we can obtain individual components of the normalized modes directly from the eigenvalue problem, and without needing to obtain either all of the modes or for that matter, any one complete mode. These results are achieved by means of the residue theorem of operational calculus, a finding that is rather remarkable inasmuch as the residues themselves do not make use of any orthogonality conditions or normalization in the first place. It appears that this obscure property connecting the general eigenvalue problem of modal analysis with the residue theorem of operational calculus may have been overlooked up until now, but which has in turn interesting theoretical implications.Á

The nonconforming virtual element method for eigenvalue problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gardini, Francesca; Manzini, Gianmarco; Vacca, Giuseppe

We analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allow to treat in the same formulation the two- and three-dimensional case.We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the L 2-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problems. The proposed schemes provide a correct approximation of the spectrum and we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numericalmore » tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.« less

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

NASA Technical Reports Server (NTRS)

Yedavalli, R. K.

1992-01-01

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis. Final Report

NASA Technical Reports Server (NTRS)

Thompson, P. M.

1980-01-01

Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalue and the directional derivatives of closed loop eigenvectors. An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties. An algorithm is presented that can be used to select a feedback gain matrix for the linear state feedback problem which produces a specified asymptotic eigenstructure. Another algorithm is given to compute the asymptotic eigenstructure properties inherent in a given set of quadratic weights. Finally, it is shown that optimal root loci for nongeneric problems can be approximated by generic ones in the nonasymptotic region.

Evaluation of the eigenvalue method in the solution of transient heat conduction problems

NASA Astrophysics Data System (ADS)

Landry, D. W.

1985-01-01

The eigenvalue method is evaluated to determine the advantages and disadvantages of the method as compared to fully explicit, fully implicit, and Crank-Nicolson methods. Time comparisons and accuracy comparisons are made in an effort to rank the eigenvalue method in relation to the comparison schemes. The eigenvalue method is used to solve the parabolic heat equation in multidimensions with transient temperatures. Extensions into three dimensions are made to determine the method's feasibility in handling large geometry problems requiring great numbers of internal mesh points. The eigenvalue method proves to be slightly better in accuracy than the comparison routines because of an exact treatment, as opposed to a numerical approximation, of the time derivative in the heat equation. It has the potential of being a very powerful routine in solving long transient type problems. The method is not well suited to finely meshed grid arrays or large regions because of the time and memory requirements necessary for calculating large sets of eigenvalues and eigenvectors.

Siewert solutions of transcendental equations, generalized Lambert functions and physical applications

NASA Astrophysics Data System (ADS)

Barsan, Victor

2018-05-01

Several classes of transcendental equations, mainly eigenvalue equations associated to non-relativistic quantum mechanical problems, are analyzed. Siewert's systematic approach of such equations is discussed from the perspective of the new results recently obtained in the theory of generalized Lambert functions and of algebraic approximations of various special or elementary functions. Combining exact and approximate analytical methods, quite precise analytical outputs are obtained for apparently untractable problems. The results can be applied in quantum and classical mechanics, magnetism, elasticity, solar energy conversion, etc.

FEAST fundamental framework for electronic structure calculations: Reformulation and solution of the muffin-tin problem

NASA Astrophysics Data System (ADS)

Levin, Alan R.; Zhang, Deyin; Polizzi, Eric

2012-11-01

In a recent article Polizzi (2009) [15], the FEAST algorithm has been presented as a general purpose eigenvalue solver which is ideally suited for addressing the numerical challenges in electronic structure calculations. Here, FEAST is presented beyond the “black-box” solver as a fundamental modeling framework which can naturally address the original numerical complexity of the electronic structure problem as formulated by Slater in 1937 [3]. The non-linear eigenvalue problem arising from the muffin-tin decomposition of the real-space domain is first derived and then reformulated to be solved exactly within the FEAST framework. This new framework is presented as a fundamental and practical solution for performing both accurate and scalable electronic structure calculations, bypassing the various issues of using traditional approaches such as linearization and pseudopotential techniques. A finite element implementation of this FEAST framework along with simulation results for various molecular systems is also presented and discussed.

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vecharynski, Eugene; Brabec, Jiri; Shao, Meiyue

Within this paper, we present two efficient iterative algorithms for solving the linear response eigenvalue problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into an eigenvalue problem that involves the product of two matrices M and K. We show that, because MK is self-adjoint with respect to the inner product induced by the matrix K, this product eigenvalue problem can be solved efficiently by amore » modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. Additionally, the solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. We show that the other component of the eigenvector can be easily recovered in an inexpensive postprocessing procedure. As a result, the algorithms we present here become more efficient than existing methods that try to approximate both components of the eigenvectors simultaneously. In particular, our numerical experiments demonstrate that the new algorithms presented here consistently outperform the existing state-of-the-art Davidson type solvers by a factor of two in both solution time and storage.« less

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vecharynski, Eugene; Brabec, Jiri; Shao, Meiyue

In this article, we present two efficient iterative algorithms for solving the linear response eigenvalue problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into an eigenvalue problem that involves the product of two matrices M and K. We show that, because MK is self-adjoint with respect to the inner product induced by the matrix K, this product eigenvalue problem can be solved efficiently by amore » modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. We show that the other component of the eigenvector can be easily recovered in an inexpensive postprocessing procedure. As a result, the algorithms we present here become more efficient than existing methods that try to approximate both components of the eigenvectors simultaneously. In particular, our numerical experiments demonstrate that the new algorithms presented here consistently outperform the existing state-of-the-art Davidson type solvers by a factor of two in both solution time and storage.« less

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

DOE PAGES

Vecharynski, Eugene; Brabec, Jiri; Shao, Meiyue; ...

2017-12-01

In this article, we present two efficient iterative algorithms for solving the linear response eigenvalue problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into an eigenvalue problem that involves the product of two matrices M and K. We show that, because MK is self-adjoint with respect to the inner product induced by the matrix K, this product eigenvalue problem can be solved efficiently by amore » modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. We show that the other component of the eigenvector can be easily recovered in an inexpensive postprocessing procedure. As a result, the algorithms we present here become more efficient than existing methods that try to approximate both components of the eigenvectors simultaneously. In particular, our numerical experiments demonstrate that the new algorithms presented here consistently outperform the existing state-of-the-art Davidson type solvers by a factor of two in both solution time and storage.« less

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

DOE PAGES

Vecharynski, Eugene; Brabec, Jiri; Shao, Meiyue; ...

2017-08-24

Within this paper, we present two efficient iterative algorithms for solving the linear response eigenvalue problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into an eigenvalue problem that involves the product of two matrices M and K. We show that, because MK is self-adjoint with respect to the inner product induced by the matrix K, this product eigenvalue problem can be solved efficiently by amore » modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. Additionally, the solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. We show that the other component of the eigenvector can be easily recovered in an inexpensive postprocessing procedure. As a result, the algorithms we present here become more efficient than existing methods that try to approximate both components of the eigenvectors simultaneously. In particular, our numerical experiments demonstrate that the new algorithms presented here consistently outperform the existing state-of-the-art Davidson type solvers by a factor of two in both solution time and storage.« less

A spectral approach for the stability analysis of turbulent open-channel flows over granular beds

NASA Astrophysics Data System (ADS)

Camporeale, C.; Canuto, C.; Ridolfi, L.

2012-01-01

A novel Orr-Sommerfeld-like equation for gravity-driven turbulent open-channel flows over a granular erodible bed is here derived, and the linear stability analysis is developed. The whole spectrum of eigenvalues and eigenvectors of the complete generalized eigenvalue problem is computed and analyzed. The fourth-order eigenvalue problem presents singular non-polynomial coefficients with non-homogenous Robin-type boundary conditions that involve first and second derivatives. Furthermore, the Exner condition is imposed at an internal point. We propose a numerical discretization of spectral type based on a single-domain Galerkin scheme. In order to manage the presence of singular coefficients, some properties of Jacobi polynomials have been carefully blended with numerical integration of Gauss-Legendre type. The results show a positive agreement with the classical experimental data and allow one to relate the different types of instability to such parameters as the Froude number, wavenumber, and the roughness scale. The eigenfunctions allow two types of boundary layers to be distinguished, scaling, respectively, with the roughness height and the saltation layer for the bedload sediment transport.

Physics, stability, and dynamics of supply networks

NASA Astrophysics Data System (ADS)

Helbing, Dirk; Lämmer, Stefan; Seidel, Thomas; Šeba, Pétr; Płatkowski, Tadeusz

2004-12-01

We show how to treat supply networks as physical transport problems governed by balance equations and equations for the adaptation of production speeds. Although the nonlinear behavior is different, the linearized set of coupled differential equations is formally related to those of mechanical or electrical oscillator networks. Supply networks possess interesting features due to their complex topology and directed links. We derive analytical conditions for absolute and convective instabilities. The empirically observed “bullwhip effect” in supply chains is explained as a form of convective instability based on resonance effects. Moreover, it is generalized to arbitrary supply networks. Their related eigenvalues are usually complex, depending on the network structure (even without loops). Therefore, their generic behavior is characterized by damped or growing oscillations. We also show that regular distribution networks possess two negative eigenvalues only, but perturbations generate a spectrum of complex eigenvalues.

Iterative Methods for Elliptic Problems and the Discovery of ’q’.

DTIC Science & Technology

1984-07-01

K = M’IlN LN 12 is a nonnegative irreducible matrix. Hence the Perron - Frobenius theory [19] tells us that there is exactly one eigenvalue A with W = p...earlier, the Perron - Frobenius theory implies that p is itself an eigenvalue. However, as we have said, in this instance the eigenvalue problem (l.12a

Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis

NASA Technical Reports Server (NTRS)

Thompson, P. M.

1979-01-01

Results are given on the relationships between closed loop eigenstructures, state feedback gain matrices of the linear state feedback problem, and quadratic weights of the linear quadratic regulator. Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used for the first time to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalues and the directional derivatives of closed loop eigenvectors (with respect to a scalar multiplying the feedback gain matrix or the quadratic control weight). An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, sufficient conditions to be in it are given, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties.

Eigensensitivity analysis of rotating clamped uniform beams with the asymptotic numerical method

NASA Astrophysics Data System (ADS)

Bekhoucha, F.; Rechak, S.; Cadou, J. M.

2016-12-01

In this paper, free vibrations of a rotating clamped Euler-Bernoulli beams with uniform cross section are studied using continuation method, namely asymptotic numerical method. The governing equations of motion are derived using Lagrange's method. The kinetic and strain energy expression are derived from Rayleigh-Ritz method using a set of hybrid variables and based on a linear deflection assumption. The derived equations are transformed in two eigenvalue problems, where the first is a linear gyroscopic eigenvalue problem and presents the coupled lagging and stretch motions through gyroscopic terms. While the second is standard eigenvalue problem and corresponds to the flapping motion. Those two eigenvalue problems are transformed into two functionals treated by continuation method, the Asymptotic Numerical Method. New method proposed for the solution of the linear gyroscopic system based on an augmented system, which transforms the original problem to a standard form with real symmetric matrices. By using some techniques to resolve these singular problems by the continuation method, evolution curves of the natural frequencies against dimensionless angular velocity are determined. At high angular velocity, some singular points, due to the linear elastic assumption, are computed. Numerical tests of convergence are conducted and the obtained results are compared to the exact values. Results obtained by continuation are compared to those computed with discrete eigenvalue problem.

Semi-analytical Karhunen-Loeve representation of irregular waves based on the prolate spheroidal wave functions

NASA Astrophysics Data System (ADS)

Lee, Gibbeum; Cho, Yeunwoo

2018-01-01

A new semi-analytical approach is presented to solving the matrix eigenvalue problem or the integral equation in Karhunen-Loeve (K-L) representation of random data such as irregular ocean waves. Instead of direct numerical approach to this matrix eigenvalue problem, which may suffer from the computational inaccuracy for big data, a pair of integral and differential equations are considered, which are related to the so-called prolate spheroidal wave functions (PSWF). First, the PSWF is expressed as a summation of a small number of the analytical Legendre functions. After substituting them into the PSWF differential equation, a much smaller size matrix eigenvalue problem is obtained than the direct numerical K-L matrix eigenvalue problem. By solving this with a minimal numerical effort, the PSWF and the associated eigenvalue of the PSWF differential equation are obtained. Then, the eigenvalue of the PSWF integral equation is analytically expressed by the functional values of the PSWF and the eigenvalues obtained in the PSWF differential equation. Finally, the analytically expressed PSWFs and the eigenvalues in the PWSF integral equation are used to form the kernel matrix in the K-L integral equation for the representation of exemplary wave data such as ordinary irregular waves. It is found that, with the same accuracy, the required memory size of the present method is smaller than that of the direct numerical K-L representation and the computation time of the present method is shorter than that of the semi-analytical method based on the sinusoidal functions.

The Cr dependence problem of eigenvalues of the Laplace operator on domains in the plane

NASA Astrophysics Data System (ADS)

Haddad, Julian; Montenegro, Marcos

2018-03-01

The Cr dependence problem of multiple Dirichlet eigenvalues on domains is discussed for elliptic operators by regarding C r + 1-smooth one-parameter families of C1 perturbations of domains in Rn. As applications of our main theorem (Theorem 1), we provide a fairly complete description for all eigenvalues of the Laplace operator on disks and squares in R2 and also for its second eigenvalue on balls in Rn for any n ≥ 3. The central tool used in our proof is a degenerate implicit function theorem on Banach spaces (Theorem 2) of independent interest.

Computing eigenfunctions and eigenvalues of boundary-value problems with the orthogonal spectral renormalization method

NASA Astrophysics Data System (ADS)

Cartarius, Holger; Musslimani, Ziad H.; Schwarz, Lukas; Wunner, Günter

2018-03-01

The spectral renormalization method was introduced in 2005 as an effective way to compute ground states of nonlinear Schrödinger and Gross-Pitaevskii type equations. In this paper, we introduce an orthogonal spectral renormalization (OSR) method to compute ground and excited states (and their respective eigenvalues) of linear and nonlinear eigenvalue problems. The implementation of the algorithm follows four simple steps: (i) reformulate the underlying eigenvalue problem as a fixed-point equation, (ii) introduce a renormalization factor that controls the convergence properties of the iteration, (iii) perform a Gram-Schmidt orthogonalization process in order to prevent the iteration from converging to an unwanted mode, and (iv) compute the solution sought using a fixed-point iteration. The advantages of the OSR scheme over other known methods (such as Newton's and self-consistency) are (i) it allows the flexibility to choose large varieties of initial guesses without diverging, (ii) it is easy to implement especially at higher dimensions, and (iii) it can easily handle problems with complex and random potentials. The OSR method is implemented on benchmark Hermitian linear and nonlinear eigenvalue problems as well as linear and nonlinear non-Hermitian PT -symmetric models.

Computation of free oscillations of the earth

USGS Publications Warehouse

Buland, Raymond P.; Gilbert, F.

1984-01-01

Although free oscillations of the Earth may be computed by many different methods, numerous practical considerations have led us to use a Rayleigh-Ritz formulation with piecewise cubic Hermite spline basis functions. By treating the resulting banded matrix equation as a generalized algebraic eigenvalue problem, we are able to achieve great accuracy and generality and a high degree of automation at a reasonable cost. ?? 1984.

Analysis techniques for multivariate root loci. [a tool in linear control systems

NASA Technical Reports Server (NTRS)

Thompson, P. M.; Stein, G.; Laub, A. J.

1980-01-01

Analysis and techniques are developed for the multivariable root locus and the multivariable optimal root locus. The generalized eigenvalue problem is used to compute angles and sensitivities for both types of loci, and an algorithm is presented that determines the asymptotic properties of the optimal root locus.

Extension of the tridiagonal reduction (FEER) method for complex eigenvalue problems in NASTRAN

NASA Technical Reports Server (NTRS)

Newman, M.; Mann, F. I.

1978-01-01

As in the case of real eigenvalue analysis, the eigensolutions closest to a selected point in the eigenspectrum were extracted from a reduced, symmetric, tridiagonal eigenmatrix whose order was much lower than that of the full size problem. The reduction process was effected automatically, and thus avoided the arbitrary lumping of masses and other physical quantities at selected grid points. The statement of the algebraic eigenvalue problem admitted mass, damping, and stiffness matrices which were unrestricted in character, i.e., they might be real, symmetric or nonsymmetric, singular or nonsingular.

Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems

NASA Technical Reports Server (NTRS)

Johnson, Duane

1996-01-01

Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.

Calculation of normal modes of the closed waveguides in general vector case

NASA Astrophysics Data System (ADS)

Malykh, M. D.; Sevastianov, L. A.; Tiutiunnik, A. A.

2018-04-01

The article is devoted to the calculation of normal modes of the closed waveguides with an arbitrary filling ɛ, μ in the system of computer algebra Sage. Maxwell equations in the cylinder are reduced to the system of two bounded Helmholtz equations, the notion of weak solution of this system is given and then this system is investigated as a system of ordinary differential equations. The normal modes of this system are an eigenvectors of a matrix pencil. We suggest to calculate the matrix elements approximately and to truncate the matrix by usual way but further to solve the truncated eigenvalue problem exactly in the field of algebraic numbers. This approach allows to keep the symmetry of the initial problem and in particular the multiplicity of the eigenvalues. In the work would be presented some results of calculations.

Subspace Iteration Method for Complex Eigenvalue Problems with Nonsymmetric Matrices in Aeroelastic System

NASA Technical Reports Server (NTRS)

Pak, Chan-gi; Lung, Shun-fat

2009-01-01

Modern airplane design is a multidisciplinary task which combines several disciplines such as structures, aerodynamics, flight controls, and sometimes heat transfer. Historically, analytical and experimental investigations concerning the interaction of the elastic airframe with aerodynamic and in retia loads have been conducted during the design phase to determine the existence of aeroelastic instabilities, so called flutter .With the advent and increased usage of flight control systems, there is also a likelihood of instabilities caused by the interaction of the flight control system and the aeroelastic response of the airplane, known as aeroservoelastic instabilities. An in -house code MPASES (Ref. 1), modified from PASES (Ref. 2), is a general purpose digital computer program for the analysis of the closed-loop stability problem. This program used subroutines given in the International Mathematical and Statistical Library (IMSL) (Ref. 3) to compute all of the real and/or complex conjugate pairs of eigenvalues of the Hessenberg matrix. For high fidelity configuration, these aeroelastic system matrices are large and compute all eigenvalues will be time consuming. A subspace iteration method (Ref. 4) for complex eigenvalues problems with nonsymmetric matrices has been formulated and incorporated into the modified program for aeroservoelastic stability (MPASES code). Subspace iteration method only solve for the lowest p eigenvalues and corresponding eigenvectors for aeroelastic and aeroservoelastic analysis. In general, the selection of p is ranging from 10 for wing flutter analysis to 50 for an entire aircraft flutter analysis. The application of this newly incorporated code is an experiment known as the Aerostructures Test Wing (ATW) which was designed by the National Aeronautic and Space Administration (NASA) Dryden Flight Research Center, Edwards, California to research aeroelastic instabilities. Specifically, this experiment was used to study an instability known as flutter. ATW was a small-scale airplane wing comprised of an airfoil and wing tip boom. This wing was formulated based on a NACA-65A004 airfoil shape with a 3.28 aspect ratio. The wing had a span of 18 inch with root chord length of 13.2 inch and tip chord length of 8.7 inch. The total area of this wing was 197 square inch. The wing tip boom was a 1 inch diameter hollow tube of length 21.5 inch. The total weight of the wing was 2.66 lbs.

A multilevel finite element method for Fredholm integral eigenvalue problems

NASA Astrophysics Data System (ADS)

Xie, Hehu; Zhou, Tao

2015-12-01

In this work, we proposed a multigrid finite element (MFE) method for solving the Fredholm integral eigenvalue problems. The main motivation for such studies is to compute the Karhunen-Loève expansions of random fields, which play an important role in the applications of uncertainty quantification. In our MFE framework, solving the eigenvalue problem is converted to doing a series of integral iterations and eigenvalue solving in the coarsest mesh. Then, any existing efficient integration scheme can be used for the associated integration process. The error estimates are provided, and the computational complexity is analyzed. It is noticed that the total computational work of our method is comparable with a single integration step in the finest mesh. Several numerical experiments are presented to validate the efficiency of the proposed numerical method.

A proposed method for enhanced eigen-pair extraction using finite element methods: Theory and application

NASA Technical Reports Server (NTRS)

Jara-Almonte, J.; Mitchell, L. D.

1988-01-01

The paper covers two distinct parts: theory and application. The goal of this work was the reduction of model size with an increase in eigenvalue/vector accuracy. This method is ideal for the condensation of large truss- or beam-type structures. The theoretical approach involves the conversion of a continuum transfer matrix beam element into an 'Exact' dynamic stiffness element. This formulation is implemented in a finite element environment. This results in the need to solve a transcendental eigenvalue problem. Once the eigenvalue is determined the eigenvectors can be reconstructed with any desired spatial precision. No discretization limitations are imposed on the reconstruction. The results of such a combined finite element and transfer matrix formulation is a much smaller FEM eigenvalue problem. This formulation has the ability to extract higher eigenvalues as easily and as accurately as lower eigenvalues. Moreover, one can extract many more eigenvalues/vectors from the model than the number of degrees of freedom in the FEM formulation. Typically, the number of eigenvalues accurately extractable via the 'Exact' element method are at least 8 times the number of degrees of freedom. In contrast, the FEM usually extracts one accurate (within 5 percent) eigenvalue for each 3-4 degrees of freedom. The 'Exact' element results in a 20-30 improvement in the number of accurately extractable eigenvalues and eigenvectors.

An Eigenvalue Analysis of finite-difference approximations for hyperbolic IBVPs

NASA Technical Reports Server (NTRS)

Warming, Robert F.; Beam, Richard M.

1989-01-01

The eigenvalue spectrum associated with a linear finite-difference approximation plays a crucial role in the stability analysis and in the actual computational performance of the discrete approximation. The eigenvalue spectrum associated with the Lax-Wendroff scheme applied to a model hyperbolic equation was investigated. For an initial-boundary-value problem (IBVP) on a finite domain, the eigenvalue or normal mode analysis is analytically intractable. A study of auxiliary problems (Dirichlet and quarter-plane) leads to asymptotic estimates of the eigenvalue spectrum and to an identification of individual modes as either benign or unstable. The asymptotic analysis establishes an intuitive as well as quantitative connection between the algebraic tests in the theory of Gustafsson, Kreiss, and Sundstrom and Lax-Richtmyer L(sub 2) stability on a finite domain.

Complex eigenvalue extraction in NASTRAN by the tridiagonal reduction (FEER) method

NASA Technical Reports Server (NTRS)

Newman, M.; Mann, F. I.

1977-01-01

An extension of the Tridiagonal Reduction (FEER) method to complex eigenvalue analysis in NASTRAN is described. As in the case of real eigenvalue analysis, the eigensolutions closest to a selected point in the eigenspectrum are extracted from a reduced, symmetric, tridiagonal eigenmatrix whose order is much lower than that of the full size problem. The reduction process is effected automatically, and thus avoids the arbitrary lumping of masses and other physical quantities at selected grid points. The statement of the algebraic eigenvalue problem admits mass, damping and stiffness matrices which are unrestricted in character, i.e., they may be real, complex, symmetric or unsymmetric, singular or non-singular.

Convergence analysis of two-node CMFD method for two-group neutron diffusion eigenvalue problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jeong, Yongjin; Park, Jinsu; Lee, Hyun Chul

2015-12-01

In this paper, the nonlinear coarse-mesh finite difference method with two-node local problem (CMFD2N) is proven to be unconditionally stable for neutron diffusion eigenvalue problems. The explicit current correction factor (CCF) is derived based on the two-node analytic nodal method (ANM2N), and a Fourier stability analysis is applied to the linearized algorithm. It is shown that the analytic convergence rate obtained by the Fourier analysis compares very well with the numerically measured convergence rate. It is also shown that the theoretical convergence rate is only governed by the converged second harmonic buckling and the mesh size. It is also notedmore » that the convergence rate of the CCF of the CMFD2N algorithm is dependent on the mesh size, but not on the total problem size. This is contrary to expectation for eigenvalue problem. The novel points of this paper are the analytical derivation of the convergence rate of the CMFD2N algorithm for eigenvalue problem, and the convergence analysis based on the analytic derivations.« less

Asymptotic theory of a slender rotating beam with end masses.

NASA Technical Reports Server (NTRS)

Whitman, A. M.; Abel, J. M.

1972-01-01

The method of matched asymptotic expansions is employed to solve the singular perturbation problem of the vibrations of a rotating beam of small flexural rigidity with concentrated end masses. The problem is complicated by the appearance of the eigenvalue in the boundary conditions. Eigenfunctions and eigenvalues are developed as power series in the perturbation parameter beta to the 1/2 power, and results are given for mode shapes and eigenvalues through terms of the order of beta.

Solution of the symmetric eigenproblem AX=lambda BX by delayed division

NASA Technical Reports Server (NTRS)

Thurston, G. A.; Bains, N. J. C.

1986-01-01

Delayed division is an iterative method for solving the linear eigenvalue problem AX = lambda BX for a limited number of small eigenvalues and their corresponding eigenvectors. The distinctive feature of the method is the reduction of the problem to an approximate triangular form by systematically dropping quadratic terms in the eigenvalue lambda. The report describes the pivoting strategy in the reduction and the method for preserving symmetry in submatrices at each reduction step. Along with the approximate triangular reduction, the report extends some techniques used in the method of inverse subspace iteration. Examples are included for problems of varying complexity.

Aeroelastic analysis of a troposkien-type wind turbine blade

NASA Technical Reports Server (NTRS)

Nitzsche, F.

1981-01-01

The linear aeroelastic equations for one curved blade of a vertical axis wind turbine in state vector form are presented. The method is based on a simple integrating matrix scheme together with the transfer matrix idea. The method is proposed as a convenient way of solving the associated eigenvalue problem for general support conditions.

Diagonally Implicit Runge-Kutta Methods for Ordinary Differential Equations. A Review

NASA Technical Reports Server (NTRS)

Kennedy, Christopher A.; Carpenter, Mark H.

2016-01-01

A review of diagonally implicit Runge-Kutta (DIRK) methods applied to rst-order ordinary di erential equations (ODEs) is undertaken. The goal of this review is to summarize the characteristics, assess the potential, and then design several nearly optimal, general purpose, DIRK-type methods. Over 20 important aspects of DIRKtype methods are reviewed. A design study is then conducted on DIRK-type methods having from two to seven implicit stages. From this, 15 schemes are selected for general purpose application. Testing of the 15 chosen methods is done on three singular perturbation problems. Based on the review of method characteristics, these methods focus on having a stage order of two, sti accuracy, L-stability, high quality embedded and dense-output methods, small magnitudes of the algebraic stability matrix eigenvalues, small values of aii, and small or vanishing values of the internal stability function for large eigenvalues of the Jacobian. Among the 15 new methods, ESDIRK4(3)6L[2]SA is recommended as a good default method for solving sti problems at moderate error tolerances.

CAVE3: A general transient heat transfer computer code utilizing eigenvectors and eigenvalues

NASA Technical Reports Server (NTRS)

Palmieri, J. V.; Rathjen, K. A.

1978-01-01

The method of solution is a hybrid analytical numerical technique which utilizes eigenvalues and eigenvectors. The method is inherently stable, permitting large time steps even with the best of conductors with the finest of mesh sizes which can provide a factor of five reduction in machine time compared to conventional explicit finite difference methods when structures with small time constants are analyzed over long time periods. This code will find utility in analyzing hypersonic missile and aircraft structures which fall naturally into this class. The code is a completely general one in that problems involving any geometry, boundary conditions and materials can be analyzed. This is made possible by requiring the user to establish the thermal network conductances between nodes. Dynamic storage allocation is used to minimize core storage requirements. This report is primarily a user's manual for CAVE3 code. Input and output formats are presented and explained. Sample problems are included which illustrate the usage of the code as well as establish the validity and accuracy of the method.

Recent advances in computational-analytical integral transforms for convection-diffusion problems

NASA Astrophysics Data System (ADS)

Cotta, R. M.; Naveira-Cotta, C. P.; Knupp, D. C.; Zotin, J. L. Z.; Pontes, P. C.; Almeida, A. P.

2017-10-01

An unifying overview of the Generalized Integral Transform Technique (GITT) as a computational-analytical approach for solving convection-diffusion problems is presented. This work is aimed at bringing together some of the most recent developments on both accuracy and convergence improvements on this well-established hybrid numerical-analytical methodology for partial differential equations. Special emphasis is given to novel algorithm implementations, all directly connected to enhancing the eigenfunction expansion basis, such as a single domain reformulation strategy for handling complex geometries, an integral balance scheme in dealing with multiscale problems, the adoption of convective eigenvalue problems in formulations with significant convection effects, and the direct integral transformation of nonlinear convection-diffusion problems based on nonlinear eigenvalue problems. Then, selected examples are presented that illustrate the improvement achieved in each class of extension, in terms of convergence acceleration and accuracy gain, which are related to conjugated heat transfer in complex or multiscale microchannel-substrate geometries, multidimensional Burgers equation model, and diffusive metal extraction through polymeric hollow fiber membranes. Numerical results are reported for each application and, where appropriate, critically compared against the traditional GITT scheme without convergence enhancement schemes and commercial or dedicated purely numerical approaches.

Multigrid method for stability problems

NASA Technical Reports Server (NTRS)

Taasan, Shlomo

1988-01-01

The problem of calculating the stability of steady state solutions of differential equations is treated. Leading eigenvalues (i.e., having maximal real part) of large matrices that arise from discretization are to be calculated. An efficient multigrid method for solving these problems is presented. The method begins by obtaining an initial approximation for the dominant subspace on a coarse level using a damped Jacobi relaxation. This proceeds until enough accuracy for the dominant subspace has been obtained. The resulting grid functions are then used as an initial approximation for appropriate eigenvalue problems. These problems are being solved first on coarse levels, followed by refinement until a desired accuracy for the eigenvalues has been achieved. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a non-standard way in which the right hand side of the coarse grid equations involves unknown parameters to be solved for on the coarse grid. This in particular leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem demonstrate the effectiveness of the method proposed. Using an FMG algorithm a solution to the level of discretization errors is obtained in just a few work units (less than 10), where a work unit is the work involved in one Jacobi relization on the finest level.

Computing singularities of perturbation series

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kvaal, Simen; Jarlebring, Elias; Michiels, Wim

2011-03-15

Many properties of current ab initio approaches to the quantum many-body problem, both perturbational and otherwise, are related to the singularity structure of the Rayleigh-Schroedinger perturbation series. A numerical procedure is presented that in principle computes the complete set of singularities, including the dominant singularity which limits the radius of convergence. The method approximates the singularities as eigenvalues of a certain generalized eigenvalue equation which is solved using iterative techniques. It relies on computation of the action of the Hamiltonian matrix on a vector and does not rely on the terms in the perturbation series. The method can be usefulmore » for studying perturbation series of typical systems of moderate size, for fundamental development of resummation schemes, and for understanding the structure of singularities for typical systems. Some illustrative model problems are studied, including a helium-like model with {delta}-function interactions for which Moeller-Plesset perturbation theory is considered and the radius of convergence found.« less

Cucheb: A GPU implementation of the filtered Lanczos procedure

NASA Astrophysics Data System (ADS)

Aurentz, Jared L.; Kalantzis, Vassilis; Saad, Yousef

2017-11-01

This paper describes the software package Cucheb, a GPU implementation of the filtered Lanczos procedure for the solution of large sparse symmetric eigenvalue problems. The filtered Lanczos procedure uses a carefully chosen polynomial spectral transformation to accelerate convergence of the Lanczos method when computing eigenvalues within a desired interval. This method has proven particularly effective for eigenvalue problems that arise in electronic structure calculations and density functional theory. We compare our implementation against an equivalent CPU implementation and show that using the GPU can reduce the computation time by more than a factor of 10. Program Summary Program title: Cucheb Program Files doi:http://dx.doi.org/10.17632/rjr9tzchmh.1 Licensing provisions: MIT Programming language: CUDA C/C++ Nature of problem: Electronic structure calculations require the computation of all eigenvalue-eigenvector pairs of a symmetric matrix that lie inside a user-defined real interval. Solution method: To compute all the eigenvalues within a given interval a polynomial spectral transformation is constructed that maps the desired eigenvalues of the original matrix to the exterior of the spectrum of the transformed matrix. The Lanczos method is then used to compute the desired eigenvectors of the transformed matrix, which are then used to recover the desired eigenvalues of the original matrix. The bulk of the operations are executed in parallel using a graphics processing unit (GPU). Runtime: Variable, depending on the number of eigenvalues sought and the size and sparsity of the matrix. Additional comments: Cucheb is compatible with CUDA Toolkit v7.0 or greater.

Non-linear eigensolver-based alternative to traditional SCF methods

NASA Astrophysics Data System (ADS)

Gavin, B.; Polizzi, E.

2013-05-01

The self-consistent procedure in electronic structure calculations is revisited using a highly efficient and robust algorithm for solving the non-linear eigenvector problem, i.e., H({ψ})ψ = Eψ. This new scheme is derived from a generalization of the FEAST eigenvalue algorithm to account for the non-linearity of the Hamiltonian with the occupied eigenvectors. Using a series of numerical examples and the density functional theory-Kohn/Sham model, it will be shown that our approach can outperform the traditional SCF mixing-scheme techniques by providing a higher converge rate, convergence to the correct solution regardless of the choice of the initial guess, and a significant reduction of the eigenvalue solve time in simulations.

An Extremal Eigenvalue Problem for a Two-Phase Conductor in a Ball

DOE Office of Scientific and Technical Information (OSTI.GOV)

Conca, Carlos; Mahadevan, Rajesh; Sanz, Leon

2009-10-15

The pioneering works of Murat and Tartar (Topics in the mathematical modeling of composite materials. PNLDE 31. Birkhaeuser, Basel, 1997) go a long way in showing, in general, that problems of optimal design may not admit solutions if microstructural designs are excluded from consideration. Therefore, assuming, tactilely, that the problem of minimizing the first eigenvalue of a two-phase conducting material with the conducting phases to be distributed in a fixed proportion in a given domain has no true solution in general domains, Cox and Lipton only study conditions for an optimal microstructural design (Cox and Lipton in Arch. Ration. Mech.more » Anal. 136:101-117, 1996). Although, the problem in one dimension has a solution (cf. Krein in AMS Transl. Ser. 2(1):163-187, 1955) and, in higher dimensions, the problem set in a ball can be deduced to have a radially symmetric solution (cf. Alvino et al. in Nonlinear Anal. TMA 13(2):185-220, 1989), these existence results have been regarded so far as being exceptional owing to complete symmetry. It is still not clear why the same problem in domains with partial symmetry should fail to have a solution which does not develop microstructure and respecting the symmetry of the domain. We hope to revive interest in this question by giving a new proof of the result in a ball using a simpler symmetrization result from Alvino and Trombetti (J. Math. Anal. Appl. 94:328-337, 1983)« less

A method to stabilize linear systems using eigenvalue gradient information

NASA Technical Reports Server (NTRS)

Wieseman, C. D.

1985-01-01

Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.

Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures: A paradigm in three dimensions

PubMed Central

Ovtchinnikov, Evgueni E.; Xanthis, Leonidas S.

2000-01-01

We present a methodology for the efficient numerical solution of eigenvalue problems of full three-dimensional elasticity for thin elastic structures, such as shells, plates and rods of arbitrary geometry, discretized by the finite element method. Such problems are solved by iterative methods, which, however, are known to suffer from slow convergence or even convergence failure, when the thickness is small. In this paper we show an effective way of resolving this difficulty by invoking a special preconditioning technique associated with the effective dimensional reduction algorithm (EDRA). As an example, we present an algorithm for computing the minimal eigenvalue of a thin elastic plate and we show both theoretically and numerically that it is robust with respect to both the thickness and discretization parameters, i.e. the convergence does not deteriorate with diminishing thickness or mesh refinement. This robustness is sine qua non for the efficient computation of large-scale eigenvalue problems for thin elastic structures. PMID:10655469

Simultaneous multigrid techniques for nonlinear eigenvalue problems: Solutions of the nonlinear Schrödinger-Poisson eigenvalue problem in two and three dimensions

NASA Astrophysics Data System (ADS)

Costiner, Sorin; Ta'asan, Shlomo

1995-07-01

Algorithms for nonlinear eigenvalue problems (EP's) often require solving self-consistently a large number of EP's. Convergence difficulties may occur if the solution is not sought in an appropriate region, if global constraints have to be satisfied, or if close or equal eigenvalues are present. Multigrid (MG) algorithms for nonlinear problems and for EP's obtained from discretizations of partial differential EP have often been shown to be more efficient than single level algorithms. This paper presents MG techniques and a MG algorithm for nonlinear Schrödinger Poisson EP's. The algorithm overcomes the above mentioned difficulties combining the following techniques: a MG simultaneous treatment of the eigenvectors and nonlinearity, and with the global constrains; MG stable subspace continuation techniques for the treatment of nonlinearity; and a MG projection coupled with backrotations for separation of solutions. These techniques keep the solutions in an appropriate region, where the algorithm converges fast, and reduce the large number of self-consistent iterations to only a few or one MG simultaneous iteration. The MG projection makes it possible to efficiently overcome difficulties related to clusters of close and equal eigenvalues. Computational examples for the nonlinear Schrödinger-Poisson EP in two and three dimensions, presenting special computational difficulties that are due to the nonlinearity and to the equal and closely clustered eigenvalues are demonstrated. For these cases, the algorithm requires O(qN) operations for the calculation of q eigenvectors of size N and for the corresponding eigenvalues. One MG simultaneous cycle per fine level was performed. The total computational cost is equivalent to only a few Gauss-Seidel relaxations per eigenvector. An asymptotic convergence rate of 0.15 per MG cycle is attained.

On a local solvability and stability of the inverse transmission eigenvalue problem

NASA Astrophysics Data System (ADS)

Bondarenko, Natalia; Buterin, Sergey

2017-11-01

We prove a local solvability and stability of the inverse transmission eigenvalue problem posed by McLaughlin and Polyakov (1994 J. Diff. Equ. 107 351-82). In particular, this result establishes the minimality of the data used therein. The proof is constructive.

Methods, Software and Tools for Three Numerical Applications. Final report

DOE Office of Scientific and Technical Information (OSTI.GOV)

E. R. Jessup

2000-03-01

This is a report of the results of the authors work supported by DOE contract DE-FG03-97ER25325. They proposed to study three numerical problems. They are: (1) the extension of the PMESC parallel programming library; (2) the development of algorithms and software for certain generalized eigenvalue and singular value (SVD) problems, and (3) the application of techniques of linear algebra to an information retrieval technique known as latent semantic indexing (LSI).

Matrix with Prescribed Eigenvectors

ERIC Educational Resources Information Center

Ahmad, Faiz

2011-01-01

It is a routine matter for undergraduates to find eigenvalues and eigenvectors of a given matrix. But the converse problem of finding a matrix with prescribed eigenvalues and eigenvectors is rarely discussed in elementary texts on linear algebra. This problem is related to the "spectral" decomposition of a matrix and has important technical…

Multigrid techniques for nonlinear eigenvalue probems: Solutions of a nonlinear Schroedinger eigenvalue problem in 2D and 3D

NASA Technical Reports Server (NTRS)

Costiner, Sorin; Taasan, Shlomo

1994-01-01

This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.

NASA Astrophysics Data System (ADS)

2018-05-01

Eigenvalues and eigenvectors, together, constitute the eigenstructure of the system. The design of vibrating systems aimed at satisfying specifications on eigenvalues and eigenvectors, which is commonly known as eigenstructure assignment, has drawn increasing interest over the recent years. The most natural mathematical framework for such problems is constituted by the inverse eigenproblems, which consist in the determination of the system model that features a desired set of eigenvalues and eigenvectors. Although such a problem is intrinsically challenging, several solutions have been proposed in the literature. The approaches to eigenstructure assignment can be basically divided into passive control and active control.

Eigenfunctions and Eigenvalues for a Scalar Riemann-Hilbert Problem Associated to Inverse Scattering

NASA Astrophysics Data System (ADS)

Pelinovsky, Dmitry E.; Sulem, Catherine

A complete set of eigenfunctions is introduced within the Riemann-Hilbert formalism for spectral problems associated to some solvable nonlinear evolution equations. In particular, we consider the time-independent and time-dependent Schrödinger problems which are related to the KdV and KPI equations possessing solitons and lumps, respectively. Non-standard scalar products, orthogonality and completeness relations are derived for these problems. The complete set of eigenfunctions is used for perturbation theory and bifurcation analysis of eigenvalues supported by the potentials under perturbations. We classify two different types of bifurcations of new eigenvalues and analyze their characteristic features. One type corresponds to thresholdless generation of solitons in the KdV equation, while the other predicts a threshold for generation of lumps in the KPI equation.

Generalized vector calculus on convex domain

NASA Astrophysics Data System (ADS)

Agrawal, Om P.; Xu, Yufeng

2015-06-01

In this paper, we apply recently proposed generalized integral and differential operators to develop generalized vector calculus and generalized variational calculus for problems defined over a convex domain. In particular, we present some generalization of Green's and Gauss divergence theorems involving some new operators, and apply these theorems to generalized variational calculus. For fractional power kernels, the formulation leads to fractional vector calculus and fractional variational calculus for problems defined over a convex domain. In special cases, when certain parameters take integer values, we obtain formulations for integer order problems. Two examples are presented to demonstrate applications of the generalized variational calculus which utilize the generalized vector calculus developed in the paper. The first example leads to a generalized partial differential equation and the second example leads to a generalized eigenvalue problem, both in two dimensional convex domains. We solve the generalized partial differential equation by using polynomial approximation. A special case of the second example is a generalized isoperimetric problem. We find an approximate solution to this problem. Many physical problems containing integer order integrals and derivatives are defined over arbitrary domains. We speculate that future problems containing fractional and generalized integrals and derivatives in fractional mechanics will be defined over arbitrary domains, and therefore, a general variational calculus incorporating a general vector calculus will be needed for these problems. This research is our first attempt in that direction.

Numerical analysis of spectral properties of coupled oscillator Schroedinger operators. I - Single and double well anharmonic oscillators

NASA Technical Reports Server (NTRS)

Isaacson, D.; Isaacson, E. L.; Paes-Leme, P. J.; Marchesin, D.

1981-01-01

Several methods for computing many eigenvalues and eigenfunctions of a single anharmonic oscillator Schroedinger operator whose potential may have one or two minima are described. One of the methods requires the solution of an ill-conditioned generalized eigenvalue problem. This method has the virtue of using a bounded amount of work to achieve a given accuracy in both the single and double well regions. Rigorous bounds are given, and it is proved that the approximations converge faster than any inverse power of the size of the matrices needed to compute them. The results of computations for the g:phi(4):1 theory are presented. These results indicate that the methods actually converge exponentially fast.

Nonunitary and unitary approach to Eigenvalue problem of Boson operators and squeezed coherent states

NASA Technical Reports Server (NTRS)

Wunsche, A.

1993-01-01

The eigenvalue problem of the operator a + zeta(boson creation operator) is solved for arbitrarily complex zeta by applying a nonunitary operator to the vacuum state. This nonunitary approach is compared with the unitary approach leading for the absolute value of zeta less than 1 to squeezed coherent states.

Localization of the eigenvalues of linear integral equations with applications to linear ordinary differential equations.

NASA Technical Reports Server (NTRS)

Sloss, J. M.; Kranzler, S. K.

1972-01-01

The equivalence of a considered integral equation form with an infinite system of linear equations is proved, and the localization of the eigenvalues of the infinite system is expressed. Error estimates are derived, and the problems of finding upper bounds and lower bounds for the eigenvalues are solved simultaneously.

Accelerating molecular property calculations with nonorthonormal Krylov space methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Furche, Filipp; Krull, Brandon T.; Nguyen, Brian D.

Here, we formulate Krylov space methods for large eigenvalue problems and linear equation systems that take advantage of decreasing residual norms to reduce the cost of matrix-vector multiplication. The residuals are used as subspace basis without prior orthonormalization, which leads to generalized eigenvalue problems or linear equation systems on the Krylov space. These nonorthonormal Krylov space (nKs) algorithms are favorable for large matrices with irregular sparsity patterns whose elements are computed on the fly, because fewer operations are necessary as the residual norm decreases as compared to the conventional method, while errors in the desired eigenpairs and solution vectors remainmore » small. We consider real symmetric and symplectic eigenvalue problems as well as linear equation systems and Sylvester equations as they appear in configuration interaction and response theory. The nKs method can be implemented in existing electronic structure codes with minor modifications and yields speed-ups of 1.2-1.8 in typical time-dependent Hartree-Fock and density functional applications without accuracy loss. The algorithm can compute entire linear subspaces simultaneously which benefits electronic spectra and force constant calculations requiring many eigenpairs or solution vectors. The nKs approach is related to difference density methods in electronic ground state calculations, and particularly efficient for integral direct computations of exchange-type contractions. By combination with resolution-of-the-identity methods for Coulomb contractions, three- to fivefold speed-ups of hybrid time-dependent density functional excited state and response calculations are achieved.« less

Accelerating molecular property calculations with nonorthonormal Krylov space methods

DOE PAGES

Furche, Filipp; Krull, Brandon T.; Nguyen, Brian D.; ...

2016-05-03

Here, we formulate Krylov space methods for large eigenvalue problems and linear equation systems that take advantage of decreasing residual norms to reduce the cost of matrix-vector multiplication. The residuals are used as subspace basis without prior orthonormalization, which leads to generalized eigenvalue problems or linear equation systems on the Krylov space. These nonorthonormal Krylov space (nKs) algorithms are favorable for large matrices with irregular sparsity patterns whose elements are computed on the fly, because fewer operations are necessary as the residual norm decreases as compared to the conventional method, while errors in the desired eigenpairs and solution vectors remainmore » small. We consider real symmetric and symplectic eigenvalue problems as well as linear equation systems and Sylvester equations as they appear in configuration interaction and response theory. The nKs method can be implemented in existing electronic structure codes with minor modifications and yields speed-ups of 1.2-1.8 in typical time-dependent Hartree-Fock and density functional applications without accuracy loss. The algorithm can compute entire linear subspaces simultaneously which benefits electronic spectra and force constant calculations requiring many eigenpairs or solution vectors. The nKs approach is related to difference density methods in electronic ground state calculations, and particularly efficient for integral direct computations of exchange-type contractions. By combination with resolution-of-the-identity methods for Coulomb contractions, three- to fivefold speed-ups of hybrid time-dependent density functional excited state and response calculations are achieved.« less

The eigenvalue problem in phase space.

PubMed

Cohen, Leon

2018-06-30

We formulate the standard quantum mechanical eigenvalue problem in quantum phase space. The equation obtained involves the c-function that corresponds to the quantum operator. We use the Wigner distribution for the phase space function. We argue that the phase space eigenvalue equation obtained has, in addition to the proper solutions, improper solutions. That is, solutions for which no wave function exists which could generate the distribution. We discuss the conditions for ascertaining whether a position momentum function is a proper phase space distribution. We call these conditions psi-representability conditions, and show that if these conditions are imposed, one extracts the correct phase space eigenfunctions. We also derive the phase space eigenvalue equation for arbitrary phase space distributions functions. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Modal interaction in linear dynamic systems near degenerate modes

NASA Technical Reports Server (NTRS)

Afolabi, D.

1991-01-01

In various problems in structural dynamics, the eigenvalues of a linear system depend on a characteristic parameter of the system. Under certain conditions, two eigenvalues of the system approach each other as the characteristic parameter is varied, leading to modal interaction. In a system with conservative coupling, the two eigenvalues eventually repel each other, leading to the curve veering effect. In a system with nonconservative coupling, the eigenvalues continue to attract each other, eventually colliding, leading to eigenvalue degeneracy. Modal interaction is studied in linear systems with conservative and nonconservative coupling using singularity theory, sometimes known as catastrophe theory. The main result is this: eigenvalue degeneracy is a cause of instability; in systems with conservative coupling, it induces only geometric instability, whereas in systems with nonconservative coupling, eigenvalue degeneracy induces both geometric and elastic instability. Illustrative examples of mechanical systems are given.

An extension of the QZ algorithm for solving the generalized matrix eigenvalue problem

NASA Technical Reports Server (NTRS)

Ward, R. C.

1973-01-01

This algorithm is an extension of Moler and Stewart's QZ algorithm with some added features for saving time and operations. Also, some additional properties of the QR algorithm which were not practical to implement in the QZ algorithm can be generalized with the combination shift QZ algorithm. Numerous test cases are presented to give practical application tests for algorithm. Based on results, this algorithm should be preferred over existing algorithms which attempt to solve the class of generalized eigenproblems where both matrices are singular or nearly singular.

Multitasking the Davidson algorithm for the large, sparse eigenvalue problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Umar, V.M.; Fischer, C.F.

1989-01-01

The authors report how the Davidson algorithm, developed for handling the eigenvalue problem for large and sparse matrices arising in quantum chemistry, was modified for use in atomic structure calculations. To date these calculations have used traditional eigenvalue methods, which limit the range of feasible calculations because of their excessive memory requirements and unsatisfactory performance attributed to time-consuming and costly processing of zero valued elements. The replacement of a traditional matrix eigenvalue method by the Davidson algorithm reduced these limitations. Significant speedup was found, which varied with the size of the underlying problem and its sparsity. Furthermore, the range ofmore » matrix sizes that can be manipulated efficiently was expended by more than one order or magnitude. On the CRAY X-MP the code was vectorized and the importance of gather/scatter analyzed. A parallelized version of the algorithm obtained an additional 35% reduction in execution time. Speedup due to vectorization and concurrency was also measured on the Alliant FX/8.« less

A new localization set for generalized eigenvalues.

PubMed

Gao, Jing; Li, Chaoqian

2017-01-01

A new localization set for generalized eigenvalues is obtained. It is shown that the new set is tighter than that in (Numer. Linear Algebra Appl. 16:883-898, 2009). Numerical examples are given to verify the corresponding results.

An inclusive SUSY approach to position dependent mass systems

NASA Astrophysics Data System (ADS)

Karthiga, S.; Chithiika Ruby, V.; Senthilvelan, M.

2018-06-01

The supersymmetry (SUSY) formalism for a position dependent mass problem with a more general ordering is yet to be formulated. In this paper, we present an unified SUSY approach for PDM problems of any ordering. Highlighting all non-Hermitian Hamiltonians of PDM problems are of quasi-Hermitian nature, the SUSY operators of these problems are constructed using similarity transformation. The methodology that we propose here is applicable for even more general cases where the kinetic energy term is represented by linear combination of infinite number of possible orderings. We illustrate the method with an example, namely Mathews-Lakshmanan (ML) oscillator. Our results show that the latter system is shape invariant for all possible orderings. We derive eigenvalues and eigenvectors of this nonlinear oscillator for all possible orderings including Hermitian and non-Hermitian ones.

Inflationary dynamics for matrix eigenvalue problems

PubMed Central

Heller, Eric J.; Kaplan, Lev; Pollmann, Frank

2008-01-01

Many fields of science and engineering require finding eigenvalues and eigenvectors of large matrices. The solutions can represent oscillatory modes of a bridge, a violin, the disposition of electrons around an atom or molecule, the acoustic modes of a concert hall, or hundreds of other physical quantities. Often only the few eigenpairs with the lowest or highest frequency (extremal solutions) are needed. Methods that have been developed over the past 60 years to solve such problems include the Lanczos algorithm, Jacobi–Davidson techniques, and the conjugate gradient method. Here, we present a way to solve the extremal eigenvalue/eigenvector problem, turning it into a nonlinear classical mechanical system with a modified Lagrangian constraint. The constraint induces exponential inflationary growth of the desired extremal solutions. PMID:18511564

nu-TRLan User Guide Version 1.0: A High-Performance Software Package for Large-Scale Harmitian Eigenvalue Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yamazaki, Ichitaro; Wu, Kesheng; Simon, Horst

2008-10-27

The original software package TRLan, [TRLan User Guide], page 24, implements the thick restart Lanczos method, [Wu and Simon 2001], page 24, for computing eigenvalues {lambda} and their corresponding eigenvectors v of a symmetric matrix A: Av = {lambda}v. Its effectiveness in computing the exterior eigenvalues of a large matrix has been demonstrated, [LBNL-42982], page 24. However, its performance strongly depends on the user-specified dimension of a projection subspace. If the dimension is too small, TRLan suffers from slow convergence. If it is too large, the computational and memory costs become expensive. Therefore, to balance the solution convergence and costs,more » users must select an appropriate subspace dimension for each eigenvalue problem at hand. To free users from this difficult task, nu-TRLan, [LNBL-1059E], page 23, adjusts the subspace dimension at every restart such that optimal performance in solving the eigenvalue problem is automatically obtained. This document provides a user guide to the nu-TRLan software package. The original TRLan software package was implemented in Fortran 90 to solve symmetric eigenvalue problems using static projection subspace dimensions. nu-TRLan was developed in C and extended to solve Hermitian eigenvalue problems. It can be invoked using either a static or an adaptive subspace dimension. In order to simplify its use for TRLan users, nu-TRLan has interfaces and features similar to those of TRLan: (1) Solver parameters are stored in a single data structure called trl-info, Chapter 4 [trl-info structure], page 7. (2) Most of the numerical computations are performed by BLAS, [BLAS], page 23, and LAPACK, [LAPACK], page 23, subroutines, which allow nu-TRLan to achieve optimized performance across a wide range of platforms. (3) To solve eigenvalue problems on distributed memory systems, the message passing interface (MPI), [MPI forum], page 23, is used. The rest of this document is organized as follows. In Chapter 2 [Installation], page 2, we provide an installation guide of the nu-TRLan software package. In Chapter 3 [Example], page 3, we present a simple nu-TRLan example program. In Chapter 4 [trl-info structure], page 7, and Chapter 5 [trlan subroutine], page 14, we describe the solver parameters and interfaces in detail. In Chapter 6 [Solver parameters], page 21, we discuss the selection of the user-specified parameters. In Chapter 7 [Contact information], page 22, we give the acknowledgements and contact information of the authors. In Chapter 8 [References], page 23, we list reference to related works.« less

Compressed modes for variational problems in mathematics and physics

PubMed Central

Ozoliņš, Vidvuds; Lai, Rongjie; Caflisch, Russel; Osher, Stanley

2013-01-01

This article describes a general formalism for obtaining spatially localized (“sparse”) solutions to a class of problems in mathematical physics, which can be recast as variational optimization problems, such as the important case of Schrödinger’s equation in quantum mechanics. Sparsity is achieved by adding an regularization term to the variational principle, which is shown to yield solutions with compact support (“compressed modes”). Linear combinations of these modes approximate the eigenvalue spectrum and eigenfunctions in a systematically improvable manner, and the localization properties of compressed modes make them an attractive choice for use with efficient numerical algorithms that scale linearly with the problem size. PMID:24170861

Compressed modes for variational problems in mathematics and physics.

PubMed

Ozolins, Vidvuds; Lai, Rongjie; Caflisch, Russel; Osher, Stanley

2013-11-12

This article describes a general formalism for obtaining spatially localized ("sparse") solutions to a class of problems in mathematical physics, which can be recast as variational optimization problems, such as the important case of Schrödinger's equation in quantum mechanics. Sparsity is achieved by adding an regularization term to the variational principle, which is shown to yield solutions with compact support ("compressed modes"). Linear combinations of these modes approximate the eigenvalue spectrum and eigenfunctions in a systematically improvable manner, and the localization properties of compressed modes make them an attractive choice for use with efficient numerical algorithms that scale linearly with the problem size.

Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods

NASA Technical Reports Server (NTRS)

Sidi, Avram

1992-01-01

Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.

A few shape optimization results for a biharmonic Steklov problem

NASA Astrophysics Data System (ADS)

Buoso, Davide; Provenzano, Luigi

2015-09-01

We derive the equation of a free vibrating thin plate whose mass is concentrated at the boundary, namely a Steklov problem for the biharmonic operator. We provide Hadamard-type formulas for the shape derivatives of the corresponding eigenvalues and prove that balls are critical domains under volume constraint. Finally, we prove an isoperimetric inequality for the first positive eigenvalue.

Level repulsion and band sorting in phononic crystals

NASA Astrophysics Data System (ADS)

Lu, Yan; Srivastava, Ankit

2018-02-01

In this paper we consider the problem of avoided crossings (level repulsion) in phononic crystals and suggest a computationally efficient strategy to distinguish them from normal cross points. This process is essential for the correct sorting of the phononic bands and, subsequently, for the accurate determination of mode continuation, group velocities, and emergent properties which depend on them such as thermal conductivity. Through explicit phononic calculations using generalized Rayleigh quotient, we identify exact locations of exceptional points in the complex wavenumber domain which results in level repulsion in the real domain. We show that in the vicinity of the exceptional point the relevant phononic eigenvalue surfaces resemble the surfaces of a 2 by 2 parameter-dependent matrix. Along a closed loop encircling the exceptional point we show that the phononic eigenvalues are exchanged, just as they are for the 2 by 2 matrix case. However, the behavior of the associated eigenvectors is shown to be more complex in the phononic case. Along a closed loop around an exceptional point, we show that the eigenvectors can flip signs multiple times unlike a 2 by 2 matrix where the flip of sign occurs only once. Finally, we exploit these eigenvector sign flips around exceptional points to propose a simple and efficient method of distinguishing them from normal crosses and of correctly sorting the band-structure. Our proposed method is roughly an order-of-magnitude faster than the zoom-in method and correctly identifies > 96% of the cases considered. Both its speed and accuracy can be further improved and we suggest some ways of achieving this. Our method is general and, as such, would be directly applicable to other eigenvalue problems where the eigenspectrum needs to be correctly sorted.

Eigenvalue routines in NASTRAN: A comparison with the Block Lanczos method

NASA Technical Reports Server (NTRS)

Tischler, V. A.; Venkayya, Vipperla B.

1993-01-01

The NASA STRuctural ANalysis (NASTRAN) program is one of the most extensively used engineering applications software in the world. It contains a wealth of matrix operations and numerical solution techniques, and they were used to construct efficient eigenvalue routines. The purpose of this paper is to examine the current eigenvalue routines in NASTRAN and to make efficiency comparisons with a more recent implementation of the Block Lanczos algorithm by Boeing Computer Services (BCS). This eigenvalue routine is now available in the BCS mathematics library as well as in several commercial versions of NASTRAN. In addition, CRAY maintains a modified version of this routine on their network. Several example problems, with a varying number of degrees of freedom, were selected primarily for efficiency bench-marking. Accuracy is not an issue, because they all gave comparable results. The Block Lanczos algorithm was found to be extremely efficient, in particular, for very large size problems.

Group theoretical approach to the Dirac operator on S 2

NASA Astrophysics Data System (ADS)

Gutiérrez, Sergio; Huet, Idrish

2018-04-01

In this revision we outline the group theoretical approach to formulate and solve the eigenvalue problem of the Dirac operator on the round 2-sphere conceived as the right coset S 2 = SU(2)/U(1). Starting from general symmetry considerations we illustrate the formulation of the Dirac operator through left action or right action differential operators, whose properties on a right coset are quite different. The construction of the spinor space and the solution of the spectral problem using group theoretical methods is also presented.

Approximation of eigenvalues of some differential equations by zeros of orthogonal polynomials

NASA Astrophysics Data System (ADS)

Volkmer, Hans

2008-04-01

Sequences of polynomials, orthogonal with respect to signed measures, are associated with a class of differential equations including the Mathieu, Lame and Whittaker-Hill equation. It is shown that the zeros of pn form sequences which converge to the eigenvalues of the corresponding differential equations. Moreover, interlacing properties of the zeros of pn are found. Applications to the numerical treatment of eigenvalue problems are given.

The tunneling effect for a class of difference operators

NASA Astrophysics Data System (ADS)

Klein, Markus; Rosenberger, Elke

We analyze a general class of self-adjoint difference operators H𝜀 = T𝜀 + V𝜀 on ℓ2((𝜀ℤ)d), where V𝜀 is a multi-well potential and 𝜀 is a small parameter. We give a coherent review of our results on tunneling up to new sharp results on the level of complete asymptotic expansions (see [30-35]).Our emphasis is on general ideas and strategy, possibly of interest for a broader range of readers, and less on detailed mathematical proofs. The wells are decoupled by introducing certain Dirichlet operators on regions containing only one potential well. Then the eigenvalue problem for the Hamiltonian H𝜀 is treated as a small perturbation of these comparison problems. After constructing a Finslerian distance d induced by H𝜀, we show that Dirichlet eigenfunctions decay exponentially with a rate controlled by this distance to the well. It follows with microlocal techniques that the first n eigenvalues of H𝜀 converge to the first n eigenvalues of the direct sum of harmonic oscillators on ℝd located at several wells. In a neighborhood of one well, we construct formal asymptotic expansions of WKB-type for eigenfunctions associated with the low-lying eigenvalues of H𝜀. These are obtained from eigenfunctions or quasimodes for the operator H𝜀, acting on L2(ℝd), via restriction to the lattice (𝜀ℤ)d. Tunneling is then described by a certain interaction matrix, similar to the analysis for the Schrödinger operator (see [22]), the remainder is exponentially small and roughly quadratic compared with the interaction matrix. We give weighted ℓ2-estimates for the difference of eigenfunctions of Dirichlet-operators in neighborhoods of the different wells and the associated WKB-expansions at the wells. In the last step, we derive full asymptotic expansions for interactions between two “wells” (minima) of the potential energy, in particular for the discrete tunneling effect. Here we essentially use analysis on phase space, complexified in the momentum variable. These results are as sharp as the classical results for the Schrödinger operator in [22].

Ultrarelativistic bound states in the spherical well

DOE Office of Scientific and Technical Information (OSTI.GOV)

Żaba, Mariusz; Garbaczewski, Piotr

2016-07-15

We address an eigenvalue problem for the ultrarelativistic (Cauchy) operator (−Δ){sup 1/2}, whose action is restricted to functions that vanish beyond the interior of a unit sphere in three spatial dimensions. We provide high accuracy spectral data for lowest eigenvalues and eigenfunctions of this infinite spherical well problem. Our focus is on radial and orbital shapes of eigenfunctions. The spectrum consists of an ordered set of strictly positive eigenvalues which naturally splits into non-overlapping, orbitally labelled E{sub (k,l)} series. For each orbital label l = 0, 1, 2, …, the label k = 1, 2, … enumerates consecutive lth seriesmore » eigenvalues. Each of them is 2l + 1-degenerate. The l = 0 eigenvalues series E{sub (k,0)} are identical with the set of even labeled eigenvalues for the d = 1 Cauchy well: E{sub (k,0)}(d = 3) = E{sub 2k}(d = 1). Likewise, the eigenfunctions ψ{sub (k,0)}(d = 3) and ψ{sub 2k}(d = 1) show affinity. We have identified the generic functional form of eigenfunctions of the spherical well which appear to be composed of a product of a solid harmonic and of a suitable purely radial function. The method to evaluate (approximately) the latter has been found to follow the universal pattern which effectively allows to skip all, sometimes involved, intermediate calculations (those were in usage, while computing the eigenvalues for l ≤ 3).« less

Reliable use of determinants to solve nonlinear structural eigenvalue problems efficiently

NASA Technical Reports Server (NTRS)

Williams, F. W.; Kennedy, D.

1988-01-01

The analytical derivation, numerical implementation, and performance of a multiple-determinant parabolic interpolation method (MDPIM) for use in solving transcendental eigenvalue (critical buckling or undamped free vibration) problems in structural mechanics are presented. The overall bounding, eigenvalue-separation, qualified parabolic interpolation, accuracy-confirmation, and convergence-recovery stages of the MDPIM are described in detail, and the numbers of iterations required to solve sample plane-frame problems using the MDPIM are compared with those for a conventional bisection method and for the Newtonian method of Simpson (1984) in extensive tables. The MDPIM is shown to use 31 percent less computation time than bisection when accuracy of 0.0001 is required, but 62 percent less when accuracy of 10 to the -8th is required; the time savings over the Newtonian method are about 10 percent.

A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems

DOE PAGES

Li, Ruipeng; Xi, Yuanzhe; Vecharynski, Eugene; ...

2016-08-16

Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywhere in the spectrum. This paper describes a technique for tackling this problem by combining a thick-restart version of the Lanczos algorithm with deflation ("locking'') and a new type of polynomial filter obtained from a least-squares technique. Furthermore, the resulting algorithm can be utilized in a “spectrum-slicing” approach whereby a very large number of eigenvalues and associated eigenvectors of the matrix are computed by extracting eigenpairs located in different subintervals independently from onemore » another.« less

Initial values for the integration scheme to compute the eigenvalues for propagation in ducts

NASA Technical Reports Server (NTRS)

Eversman, W.

1977-01-01

A scheme for the calculation of eigenvalues in the problem of acoustic propagation in a two-dimensional duct is described. The computation method involves changing the coupled transcendental nonlinear algebraic equations into an initial value problem involving a nonlinear ordinary differential equation. The simplest approach is to use as initial values the hardwall eigenvalues and to integrate away from these values as the admittance varies from zero to its actual value with a linear variation. The approach leads to a powerful root finding routine capable of computing the transverse and axial wave numbers for two-dimensional ducts for any frequency, lining, admittance and Mach number without requiring initial guesses or starting points.

Guided waves dispersion equations for orthotropic multilayered pipes solved using standard finite elements code.

PubMed

Predoi, Mihai Valentin

2014-09-01

The dispersion curves for hollow multilayered cylinders are prerequisites in any practical guided waves application on such structures. The equations for homogeneous isotropic materials have been established more than 120 years ago. The difficulties in finding numerical solutions to analytic expressions remain considerable, especially if the materials are orthotropic visco-elastic as in the composites used for pipes in the last decades. Among other numerical techniques, the semi-analytical finite elements method has proven its capability of solving this problem. Two possibilities exist to model a finite elements eigenvalue problem: a two-dimensional cross-section model of the pipe or a radial segment model, intersecting the layers between the inner and the outer radius of the pipe. The last possibility is here adopted and distinct differential problems are deduced for longitudinal L(0,n), torsional T(0,n) and flexural F(m,n) modes. Eigenvalue problems are deduced for the three modes classes, offering explicit forms of each coefficient for the matrices used in an available general purpose finite elements code. Comparisons with existing solutions for pipes filled with non-linear viscoelastic fluid or visco-elastic coatings as well as for a fully orthotropic hollow cylinder are all proving the reliability and ease of use of this method. Copyright © 2014 Elsevier B.V. All rights reserved.

Conditions for Symmetries in the Buckle Patterns of Laminated-Composite Plates

NASA Technical Reports Server (NTRS)

Nemeth, Michael P.

2012-01-01

Conditions for the existence of certain symmetries to exist in the buckle patterns of symmetrically laminated composite plates are presented. The plates considered have a general planform with cutouts, variable thickness and stiffnesses, and general support and loading conditions. The symmetry analysis is based on enforcing invariance of the corresponding eigenvalue problem for a group of coordinate transformations associated with buckle patterns commonly exhibited by symmetrically laminated plates. The buckle-pattern symmetries examined include a central point of inversion symmetry, one plane of reflective symmetry, and two planes of reflective symmetry.

A case against a divide and conquer approach to the nonsymmetric eigenvalue problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jessup, E.R.

1991-12-01

Divide and conquer techniques based on rank-one updating have proven fast, accurate, and efficient in parallel for the real symmetric tridiagonal and unitary eigenvalue problems and for the bidiagonal singular value problem. Although the divide and conquer mechanism can also be adapted to the real nonsymmetric eigenproblem in a straightforward way, most of the desirable characteristics of the other algorithms are lost. In this paper, we examine the problems of accuracy and efficiency that can stand in the way of a nonsymmetric divide and conquer eigensolver based on low-rank updating. 31 refs., 2 figs.

Crossover ensembles of random matrices and skew-orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kumar, Santosh, E-mail: skumar.physics@gmail.com; Pandey, Akhilesh, E-mail: ap0700@mail.jnu.ac.in

2011-08-15

Highlights: > We study crossover ensembles of Jacobi family of random matrices. > We consider correlations for orthogonal-unitary and symplectic-unitary crossovers. > We use the method of skew-orthogonal polynomials and quaternion determinants. > We prove universality of spectral correlations in crossover ensembles. > We discuss applications to quantum conductance and communication theory problems. - Abstract: In a recent paper (S. Kumar, A. Pandey, Phys. Rev. E, 79, 2009, p. 026211) we considered Jacobi family (including Laguerre and Gaussian cases) of random matrix ensembles and reported exact solutions of crossover problems involving time-reversal symmetry breaking. In the present paper we givemore » details of the work. We start with Dyson's Brownian motion description of random matrix ensembles and obtain universal hierarchic relations among the unfolded correlation functions. For arbitrary dimensions we derive the joint probability density (jpd) of eigenvalues for all transitions leading to unitary ensembles as equilibrium ensembles. We focus on the orthogonal-unitary and symplectic-unitary crossovers and give generic expressions for jpd of eigenvalues, two-point kernels and n-level correlation functions. This involves generalization of the theory of skew-orthogonal polynomials to crossover ensembles. We also consider crossovers in the circular ensembles to show the generality of our method. In the large dimensionality limit, correlations in spectra with arbitrary initial density are shown to be universal when expressed in terms of a rescaled symmetry breaking parameter. Applications of our crossover results to communication theory and quantum conductance problems are also briefly discussed.« less

Almost analytical Karhunen-Loeve representation of irregular waves based on the prolate spheroidal wave functions

NASA Astrophysics Data System (ADS)

Lee, Gibbeum; Cho, Yeunwoo

2017-11-01

We present an almost analytical new approach to solving the matrix eigenvalue problem or the integral equation in Karhunen-Loeve (K-L) representation of random data such as irregular ocean waves. Instead of solving this matrix eigenvalue problem purely numerically, which may suffer from the computational inaccuracy for big data, first, we consider a pair of integral and differential equations, which are related to the so-called prolate spheroidal wave functions (PSWF). For the PSWF differential equation, the pair of the eigenvectors (PSWF) and eigenvalues can be obtained from a relatively small number of analytical Legendre functions. Then, the eigenvalues in the PSWF integral equation are expressed in terms of functional values of the PSWF and the eigenvalues of the PSWF differential equation. Finally, the analytically expressed PSWFs and the eigenvalues in the PWSF integral equation are used to form the kernel matrix in the K-L integral equation for the representation of exemplary wave data; ordinary irregular waves and rogue waves. We found that the present almost analytical method is better than the conventional data-independent Fourier representation and, also, the conventional direct numerical K-L representation in terms of both accuracy and computational cost. This work was supported by the National Research Foundation of Korea (NRF). (NRF-2017R1D1A1B03028299).

Principal Eigenvalue Minimization for an Elliptic Problem with Indefinite Weight and Robin Boundary Conditions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hintermueller, M., E-mail: hint@math.hu-berlin.de; Kao, C.-Y., E-mail: Ckao@claremontmckenna.edu; Laurain, A., E-mail: laurain@math.hu-berlin.de

2012-02-15

This paper focuses on the study of a linear eigenvalue problem with indefinite weight and Robin type boundary conditions. We investigate the minimization of the positive principal eigenvalue under the constraint that the absolute value of the weight is bounded and the total weight is a fixed negative constant. Biologically, this minimization problem is motivated by the question of determining the optimal spatial arrangement of favorable and unfavorable regions for a species to survive. For rectangular domains with Neumann boundary condition, it is known that there exists a threshold value such that if the total weight is below this thresholdmore » value then the optimal favorable region is like a section of a disk at one of the four corners; otherwise, the optimal favorable region is a strip attached to the shorter side of the rectangle. Here, we investigate the same problem with mixed Robin-Neumann type boundary conditions and study how this boundary condition affects the optimal spatial arrangement.« less

Applications of elliptic operator theory to the isotropic interior transmission eigenvalue problem

NASA Astrophysics Data System (ADS)

Lakshtanov, E.; Vainberg, B.

2013-10-01

The paper concerns the isotropic interior transmission eigenvalue (ITE) problem. This problem is not elliptic, but we show that, using the Dirichlet-to-Neumann map, it can be reduced to an elliptic one. This leads to the discreteness of the spectrum as well as to certain results on a possible location of the transmission eigenvalues. If the index of refraction \\sqrt{n(x)} is real, then we obtain a result on the existence of infinitely many positive ITEs and the Weyl-type lower bound on its counting function. All the results are obtained under the assumption that n(x) - 1 does not vanish at the boundary of the obstacle or it vanishes identically, but its normal derivative does not vanish at the boundary. We consider the classical transmission problem as well as the case when the inhomogeneous medium contains an obstacle. Some results on the discreteness and localization of the spectrum are obtained for complex valued n(x).

Expendable launch vehicle studies

NASA Technical Reports Server (NTRS)

Bainum, Peter M.; Reiss, Robert

1995-01-01

Analytical support studies of expendable launch vehicles concentrate on the stability of the dynamics during launch especially during or near the region of maximum dynamic pressure. The in-plane dynamic equations of a generic launch vehicle with multiple flexible bending and fuel sloshing modes are developed and linearized. The information from LeRC about the grids, masses, and modes is incorporated into the model. The eigenvalues of the plant are analyzed for several modeling factors: utilizing diagonal mass matrix, uniform beam assumption, inclusion of aerodynamics, and the interaction between the aerodynamics and the flexible bending motion. Preliminary PID, LQR, and LQG control designs with sensor and actuator dynamics for this system and simulations are also conducted. The initial analysis for comparison of PD (proportional-derivative) and full state feedback LQR Linear quadratic regulator) shows that the split weighted LQR controller has better performance than that of the PD. In order to meet both the performance and robustness requirements, the H(sub infinity) robust controller for the expendable launch vehicle is developed. The simulation indicates that both the performance and robustness of the H(sub infinity) controller are better than that for the PID and LQG controllers. The modelling and analysis support studies team has continued development of methodology, using eigensensitivity analysis, to solve three classes of discrete eigenvalue equations. In the first class, the matrix elements are non-linear functions of the eigenvector. All non-linear periodic motion can be cast in this form. Here the eigenvector is comprised of the coefficients of complete basis functions spanning the response space and the eigenvalue is the frequency. The second class of eigenvalue problems studied is the quadratic eigenvalue problem. Solutions for linear viscously damped structures or viscoelastic structures can be reduced to this form. Particular attention is paid to Maxwell and Kelvin models. The third class of problems consists of linear eigenvalue problems in which the elements of the mass and stiffness matrices are stochastic. dynamic structural response for which the parameters are given by probabilistic distribution functions, rather than deterministic values, can be cast in this form. Solutions for several problems in each class will be presented.

Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states

DOE Office of Scientific and Technical Information (OSTI.GOV)

McClean, Jarrod R.; Kimchi-Schwartz, Mollie E.; Carter, Jonathan

Using quantum devices supported by classical computational resources is a promising approach to quantum-enabled computation. One powerful example of such a hybrid quantum-classical approach optimized for classically intractable eigenvalue problems is the variational quantum eigensolver, built to utilize quantum resources for the solution of eigenvalue problems and optimizations with minimal coherence time requirements by leveraging classical computational resources. These algorithms have been placed as leaders among the candidates for the first to achieve supremacy over classical computation. Here, we provide evidence for the conjecture that variational approaches can automatically suppress even nonsystematic decoherence errors by introducing an exactly solvable channelmore » model of variational state preparation. Moreover, we develop a more general hierarchy of measurement and classical computation that allows one to obtain increasingly accurate solutions by leveraging additional measurements and classical resources. In conclusion, we demonstrate numerically on a sample electronic system that this method both allows for the accurate determination of excited electronic states as well as reduces the impact of decoherence, without using any additional quantum coherence time or formal error-correction codes.« less

Crossflow effects on the growth rate of inviscid Goertler vortices in a hypersonic boundary layer

NASA Technical Reports Server (NTRS)

Fu, Yibin; Hall, Philip

1992-01-01

The effects of crossflow on the growth rate of inviscid Goertler vortices in a hypersonic boundary layer with pressure gradient are studied. Attention is focused on the inviscid mode trapped in the temperature adjustment layer; this mode has greater growth rate than any other mode. The eigenvalue problem which governs the relationship between the growth rate, the crossflow amplitude, and the wavenumber is solved numerically, and the results are then used to clarify the effects of crossflow on the growth rate of inviscid Goertler vortices. It is shown that crossflow effects on Goertler vortices are fundamentally different for incompressible and hypersonic flows. The neutral mode eigenvalue problem is found to have an exact solution, and as a by-product, we have also found the exact solution to a neutral mode eigenvalue problem which was formulated, but unsolved before, by Bassom and Hall (1991).

Deterministically estimated fission source distributions for Monte Carlo k-eigenvalue problems

DOE PAGES

Biondo, Elliott D.; Davidson, Gregory G.; Pandya, Tara M.; ...

2018-04-30

The standard Monte Carlo (MC) k-eigenvalue algorithm involves iteratively converging the fission source distribution using a series of potentially time-consuming inactive cycles before quantities of interest can be tallied. One strategy for reducing the computational time requirements of these inactive cycles is the Sourcerer method, in which a deterministic eigenvalue calculation is performed to obtain an improved initial guess for the fission source distribution. This method has been implemented in the Exnihilo software suite within SCALE using the SPNSPN or SNSN solvers in Denovo and the Shift MC code. The efficacy of this method is assessed with different Denovo solutionmore » parameters for a series of typical k-eigenvalue problems including small criticality benchmarks, full-core reactors, and a fuel cask. Here it is found that, in most cases, when a large number of histories per cycle are required to obtain a detailed flux distribution, the Sourcerer method can be used to reduce the computational time requirements of the inactive cycles.« less

Deterministically estimated fission source distributions for Monte Carlo k-eigenvalue problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Biondo, Elliott D.; Davidson, Gregory G.; Pandya, Tara M.

The standard Monte Carlo (MC) k-eigenvalue algorithm involves iteratively converging the fission source distribution using a series of potentially time-consuming inactive cycles before quantities of interest can be tallied. One strategy for reducing the computational time requirements of these inactive cycles is the Sourcerer method, in which a deterministic eigenvalue calculation is performed to obtain an improved initial guess for the fission source distribution. This method has been implemented in the Exnihilo software suite within SCALE using the SPNSPN or SNSN solvers in Denovo and the Shift MC code. The efficacy of this method is assessed with different Denovo solutionmore » parameters for a series of typical k-eigenvalue problems including small criticality benchmarks, full-core reactors, and a fuel cask. Here it is found that, in most cases, when a large number of histories per cycle are required to obtain a detailed flux distribution, the Sourcerer method can be used to reduce the computational time requirements of the inactive cycles.« less

Towards spectral geometric methods for Euclidean quantum gravity

NASA Astrophysics Data System (ADS)

Panine, Mikhail; Kempf, Achim

2016-04-01

The unification of general relativity with quantum theory will also require a coming together of the two quite different mathematical languages of general relativity and quantum theory, i.e., of differential geometry and functional analysis, respectively. Of particular interest in this regard is the field of spectral geometry, which studies to which extent the shape of a Riemannian manifold is describable in terms of the spectra of differential operators defined on the manifold. Spectral geometry is hard because it is highly nonlinear, but linearized spectral geometry, i.e., the task to determine small shape changes from small spectral changes, is much more tractable and may be iterated to approximate the full problem. Here, we generalize this approach, allowing, in particular, nonequal finite numbers of shape and spectral degrees of freedom. This allows us to study how well the shape degrees of freedom are encoded in the eigenvalues. We apply this strategy numerically to a class of planar domains and find that the reconstruction of small shape changes from small spectral changes is possible if enough eigenvalues are used. While isospectral nonisometric shapes are known to exist, we find evidence that generically shaped isospectral nonisometric shapes, if existing, are exceedingly rare.

The behaviour of resonances in Hecke triangular billiards under deformation

NASA Astrophysics Data System (ADS)

Howard, P. J.; O'Mahony, P. F.

2007-08-01

The right-hand boundary of Artin's billiard on the Poincaré half-plane is continuously deformed to generate a class of chaotic billiards which includes fundamental domains of the Hecke groups Γ(2, n) at certain values of the deformation parameter. The quantum scattering problem in these open chaotic billiards is described and the distributions of both real and imaginary parts of the resonant eigenvalues are investigated. The transitions to arithmetic chaos in the cases n ∈ {4, 6} are closely examined and the explicit analytic form for the scattering matrix is given together with the Fourier coefficients for the scattered wavefunction. The n = 4 and 6 cases have an additional set of regular equally spaced resonances compared to Artin's billiard (n = 3). For a general deformation, a numerical procedure is presented which generates the resonance eigenvalues and the evolution of the eigenvalues is followed as the boundary is varied continuously which leads to dramatic changes in their distribution. For deformations away from the non-generic arithmetic cases, including that of the tiling Hecke triangular billiard n = 5, the distributions of the positions and widths of the resonances are consistent with the predictions of a random matrix theory.

Using an iterative eigensolver to compute vibrational energies with phase-spaced localized basis functions.

PubMed

Brown, James; Carrington, Tucker

2015-07-28

Although phase-space localized Gaussians are themselves poor basis functions, they can be used to effectively contract a discrete variable representation basis [A. Shimshovitz and D. J. Tannor, Phys. Rev. Lett. 109, 070402 (2012)]. This works despite the fact that elements of the Hamiltonian and overlap matrices labelled by discarded Gaussians are not small. By formulating the matrix problem as a regular (i.e., not a generalized) matrix eigenvalue problem, we show that it is possible to use an iterative eigensolver to compute vibrational energy levels in the Gaussian basis.

Properties of natural frequencies and harmonic bending vibrations of a rod at one end of which is concentrated inertial load

NASA Astrophysics Data System (ADS)

Aliyev, Ziyatkhan S.; Guliyeva, Sevinc B.

2017-11-01

In this paper we consider a spectral problem that describes the bending vibrations of a homogeneous rod, in cross-sections of which the longitudinal force acts, the left end of which is fixed and on the right end an inertial mass is concentrated. We give a general characteristic of the location of the eigenvalues on the real axis, we study the structure of root spaces and oscillation properties of eigenfunctions, we investigate the basic properties in the space Lp, 1 < p < ∞, of the system of eigenfunctions of this problem.

A robust bi-orthogonal/dynamically-orthogonal method using the covariance pseudo-inverse with application to stochastic flow problems

NASA Astrophysics Data System (ADS)

Babaee, Hessam; Choi, Minseok; Sapsis, Themistoklis P.; Karniadakis, George Em

2017-09-01

We develop a new robust methodology for the stochastic Navier-Stokes equations based on the dynamically-orthogonal (DO) and bi-orthogonal (BO) methods [1-3]. Both approaches are variants of a generalized Karhunen-Loève (KL) expansion in which both the stochastic coefficients and the spatial basis evolve according to system dynamics, hence, capturing the low-dimensional structure of the solution. The DO and BO formulations are mathematically equivalent [3], but they exhibit computationally complimentary properties. Specifically, the BO formulation may fail due to crossing of the eigenvalues of the covariance matrix, while both BO and DO become unstable when there is a high condition number of the covariance matrix or zero eigenvalues. To this end, we combine the two methods into a robust hybrid framework and in addition we employ a pseudo-inverse technique to invert the covariance matrix. The robustness of the proposed method stems from addressing the following issues in the DO/BO formulation: (i) eigenvalue crossing: we resolve the issue of eigenvalue crossing in the BO formulation by switching to the DO near eigenvalue crossing using the equivalence theorem and switching back to BO when the distance between eigenvalues is larger than a threshold value; (ii) ill-conditioned covariance matrix: we utilize a pseudo-inverse strategy to invert the covariance matrix; (iii) adaptivity: we utilize an adaptive strategy to add/remove modes to resolve the covariance matrix up to a threshold value. In particular, we introduce a soft-threshold criterion to allow the system to adapt to the newly added/removed mode and therefore avoid repetitive and unnecessary mode addition/removal. When the total variance approaches zero, we show that the DO/BO formulation becomes equivalent to the evolution equation of the Optimally Time-Dependent modes [4]. We demonstrate the capability of the proposed methodology with several numerical examples, namely (i) stochastic Burgers equation: we analyze the performance of the method in the presence of eigenvalue crossing and zero eigenvalues; (ii) stochastic Kovasznay flow: we examine the method in the presence of a singular covariance matrix; and (iii) we examine the adaptivity of the method for an incompressible flow over a cylinder where for large stochastic forcing thirteen DO/BO modes are active.

Energy levels of one-dimensional systems satisfying the minimal length uncertainty relation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bernardo, Reginald Christian S., E-mail: rcbernardo@nip.upd.edu.ph; Esguerra, Jose Perico H., E-mail: jesguerra@nip.upd.edu.ph

2016-10-15

The standard approach to calculating the energy levels for quantum systems satisfying the minimal length uncertainty relation is to solve an eigenvalue problem involving a fourth- or higher-order differential equation in quasiposition space. It is shown that the problem can be reformulated so that the energy levels of these systems can be obtained by solving only a second-order quasiposition eigenvalue equation. Through this formulation the energy levels are calculated for the following potentials: particle in a box, harmonic oscillator, Pöschl–Teller well, Gaussian well, and double-Gaussian well. For the particle in a box, the second-order quasiposition eigenvalue equation is a second-ordermore » differential equation with constant coefficients. For the harmonic oscillator, Pöschl–Teller well, Gaussian well, and double-Gaussian well, a method that involves using Wronskians has been used to solve the second-order quasiposition eigenvalue equation. It is observed for all of these quantum systems that the introduction of a nonzero minimal length uncertainty induces a positive shift in the energy levels. It is shown that the calculation of energy levels in systems satisfying the minimal length uncertainty relation is not limited to a small number of problems like particle in a box and the harmonic oscillator but can be extended to a wider class of problems involving potentials such as the Pöschl–Teller and Gaussian wells.« less

A comparison of matrix methods for calculating eigenvalues in acoustically lined ducts

NASA Technical Reports Server (NTRS)

Watson, W.; Lansing, D. L.

1976-01-01

Three approximate methods - finite differences, weighted residuals, and finite elements - were used to solve the eigenvalue problem which arises in finding the acoustic modes and propagation constants in an absorptively lined two-dimensional duct without airflow. The matrix equations derived for each of these methods were solved for the eigenvalues corresponding to various values of wall impedance. Two matrix orders, 20 x 20 and 40 x 40, were used. The cases considered included values of wall admittance for which exact eigenvalues were known and for which several nearly equal roots were present. Ten of the lower order eigenvalues obtained from the three approximate methods were compared with solutions calculated from the exact characteristic equation in order to make an assessment of the relative accuracy and reliability of the three methods. The best results were given by the finite element method using a cubic polynomial. Excellent accuracy was consistently obtained, even for nearly equal eigenvalues, by using a 20 x 20 order matrix.

IONIZATION EQUILIBRIUM TIMESCALES IN COLLISIONAL PLASMAS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Smith, Randall K.; Hughes, John P., E-mail: rsmith@cfa.harvard.ed, E-mail: jph@physics.rutgers.ed

2010-07-20

Astrophysical shocks or bursts from a photoionizing source can disturb the typical collisional plasma found in galactic interstellar media or the intergalactic medium. The spectrum emitted by this plasma contains diagnostics that have been used to determine the time since the disturbing event, although this determination becomes uncertain as the elements in the plasma return to ionization equilibrium. A general solution for the equilibrium timescale for each element arises from the elegant eigenvector method of solution to the problem of a non-equilibrium plasma described by Masai and Hughes and Helfand. In general, the ionization evolution of an element Z inmore » a constant electron temperature plasma is given by a coupled set of Z + 1 first-order differential equations. However, they can be recast as Z uncoupled first-order differential equations using an eigenvector basis for the system. The solution is then Z separate exponential functions, with the time constants given by the eigenvalues of the rate matrix. The smallest of these eigenvalues gives the scale of the slowest return to equilibrium independent of the initial conditions, while conversely the largest eigenvalue is the scale of the fastest change in the ion population. These results hold for an ionizing plasma, a recombining plasma, or even a plasma with random initial conditions, and will allow users of these diagnostics to determine directly if their best-fit result significantly limits the timescale since a disturbance or is so close to equilibrium as to include an arbitrarily long time.« less

Goal-based h-adaptivity of the 1-D diamond difference discrete ordinate method

NASA Astrophysics Data System (ADS)

Jeffers, R. S.; Kópházi, J.; Eaton, M. D.; Févotte, F.; Hülsemann, F.; Ragusa, J.

2017-04-01

The quantity of interest (QoI) associated with a solution of a partial differential equation (PDE) is not, in general, the solution itself, but a functional of the solution. Dual weighted residual (DWR) error estimators are one way of providing an estimate of the error in the QoI resulting from the discretisation of the PDE. This paper aims to provide an estimate of the error in the QoI due to the spatial discretisation, where the discretisation scheme being used is the diamond difference (DD) method in space and discrete ordinate (SN) method in angle. The QoI are reaction rates in detectors and the value of the eigenvalue (Keff) for 1-D fixed source and eigenvalue (Keff criticality) neutron transport problems respectively. Local values of the DWR over individual cells are used as error indicators for goal-based mesh refinement, which aims to give an optimal mesh for a given QoI.

The Schrodinger Eigenvalue March

ERIC Educational Resources Information Center

Tannous, C.; Langlois, J.

2011-01-01

A simple numerical method for the determination of Schrodinger equation eigenvalues is introduced. It is based on a marching process that starts from an arbitrary point, proceeds in two opposite directions simultaneously and stops after a tolerance criterion is met. The method is applied to solving several 1D potential problems including symmetric…

On the Directional Dependence and Null Space Freedom in Uncertainty Bound Identification

NASA Technical Reports Server (NTRS)

Lim, K. B.; Giesy, D. P.

1997-01-01

In previous work, the determination of uncertainty models via minimum norm model validation is based on a single set of input and output measurement data. Since uncertainty bounds at each frequency is directionally dependent for multivariable systems, this will lead to optimistic uncertainty levels. In addition, the design freedom in the uncertainty model has not been utilized to further reduce uncertainty levels. The above issues are addressed by formulating a min- max problem. An analytical solution to the min-max problem is given to within a generalized eigenvalue problem, thus avoiding a direct numerical approach. This result will lead to less conservative and more realistic uncertainty models for use in robust control.

Multilayer neural networks for reduced-rank approximation.

PubMed

Diamantaras, K I; Kung, S Y

1994-01-01

This paper is developed in two parts. First, the authors formulate the solution to the general reduced-rank linear approximation problem relaxing the invertibility assumption of the input autocorrelation matrix used by previous authors. The authors' treatment unifies linear regression, Wiener filtering, full rank approximation, auto-association networks, SVD and principal component analysis (PCA) as special cases. The authors' analysis also shows that two-layer linear neural networks with reduced number of hidden units, trained with the least-squares error criterion, produce weights that correspond to the generalized singular value decomposition of the input-teacher cross-correlation matrix and the input data matrix. As a corollary the linear two-layer backpropagation model with reduced hidden layer extracts an arbitrary linear combination of the generalized singular vector components. Second, the authors investigate artificial neural network models for the solution of the related generalized eigenvalue problem. By introducing and utilizing the extended concept of deflation (originally proposed for the standard eigenvalue problem) the authors are able to find that a sequential version of linear BP can extract the exact generalized eigenvector components. The advantage of this approach is that it's easier to update the model structure by adding one more unit or pruning one or more units when the application requires it. An alternative approach for extracting the exact components is to use a set of lateral connections among the hidden units trained in such a way as to enforce orthogonality among the upper- and lower-layer weights. The authors call this the lateral orthogonalization network (LON) and show via theoretical analysis-and verify via simulation-that the network extracts the desired components. The advantage of the LON-based model is that it can be applied in a parallel fashion so that the components are extracted concurrently. Finally, the authors show the application of their results to the solution of the identification problem of systems whose excitation has a non-invertible autocorrelation matrix. Previous identification methods usually rely on the invertibility assumption of the input autocorrelation, therefore they can not be applied to this case.

Convergence to Diagonal Form of Block Jacobi-type Processes

NASA Astrophysics Data System (ADS)

Hari, Vjeran

2008-09-01

The main result of recent research on convergence to diagonal form of block Jacobi-type processes is presented. For this purpose, all notions needed to describe the result are introduced. In particular, elementary block transformation matrices, simple and non-simple algorithms, block pivot strategies together with the appropriate equivalence relations are defined. The general block Jacobi-type process considered here can be specialized to take the form of almost any known Jacobi-type method for solving the ordinary or the generalized matrix eigenvalue and singular value problems. The assumptions used in the result are satisfied by many concrete methods.

The cutoff phenomenon in finite Markov chains.

PubMed Central

Diaconis, P

1996-01-01

Natural mixing processes modeled by Markov chains often show a sharp cutoff in their convergence to long-time behavior. This paper presents problems where the cutoff can be proved (card shuffling, the Ehrenfests' urn). It shows that chains with polynomial growth (drunkard's walk) do not show cutoffs. The best general understanding of such cutoffs (high multiplicity of second eigenvalues due to symmetry) is explored. Examples are given where the symmetry is broken but the cutoff phenomenon persists. PMID:11607633

Dynamic Eigenvalue Problem of Concrete Slab Road Surface

NASA Astrophysics Data System (ADS)

Pawlak, Urszula; Szczecina, Michał

2017-10-01

The paper presents an analysis of the dynamic eigenvalue problem of concrete slab road surface. A sample concrete slab was modelled using Autodesk Robot Structural Analysis software and calculated with Finite Element Method. The slab was set on a one-parameter elastic subsoil, for which the modulus of elasticity was separately calculated. The eigen frequencies and eigenvectors (as maximal vertical nodal displacements) were presented. On the basis of the results of calculations, some basic recommendations for designers of concrete road surfaces were offered.

Density-matrix-based algorithm for solving eigenvalue problems

NASA Astrophysics Data System (ADS)

Polizzi, Eric

2009-03-01

A fast and stable numerical algorithm for solving the symmetric eigenvalue problem is presented. The technique deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other Davidson-Jacobi techniques and takes its inspiration from the contour integration and density-matrix representation in quantum mechanics. It will be shown that this algorithm—named FEAST—exhibits high efficiency, robustness, accuracy, and scalability on parallel architectures. Examples from electronic structure calculations of carbon nanotubes are presented, and numerical performances and capabilities are discussed.

Eigenvalue Problems.

DTIC Science & Technology

1987-06-01

Vibration of an Elastic Bar We are interested in studying the small, longitudinal vibra- tions of a longitudinally loaded, elastically supported, elastic...u 2 + + 2u O(( m,Q Uk .(J- MO In the study of eigenvalue problems, central use will be made of Rellich’s theorem (cf. Agmon [19651), which states...H , where a > 0. Sufficient conditions for (4.2) - (4.4) to hold were given in Section 3; cf. (3.15) -(3.17). For the study of (4.1) it is useful to

A nonlinear eigenvalue problem for self-similar spherical force-free magnetic fields

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lerche, I.; Low, B. C.

2014-10-15

An axisymmetric force-free magnetic field B(r, θ) in spherical coordinates is defined by a function r sin θB{sub φ}=Q(A) relating its azimuthal component to its poloidal flux-function A. The power law r sin θB{sub φ}=aA|A|{sup 1/n}, n a positive constant, admits separable fields with A=(A{sub n}(θ))/(r{sup n}) , posing a nonlinear boundary-value problem for the constant parameter a as an eigenvalue and A{sub n}(θ) as its eigenfunction [B. C. Low and Y. Q Lou, Astrophys. J. 352, 343 (1990)]. A complete analysis is presented of the eigenvalue spectrum for a given n, providing a unified understanding of the eigenfunctions and the physical relationship betweenmore » the field's degree of multi-polarity and rate of radial decay via the parameter n. These force-free fields, self-similar on spheres of constant r, have basic astrophysical applications. As explicit solutions they have, over the years, served as standard benchmarks for testing 3D numerical codes developed to compute general force-free fields in the solar corona. The study presented includes a set of illustrative multipolar field solutions to address the magnetohydrodynamics (MHD) issues underlying the observation that the solar corona has a statistical preference for negative and positive magnetic helicities in its northern and southern hemispheres, respectively; a hemispherical effect, unchanging as the Sun's global field reverses polarity in successive eleven-year cycles. Generalizing these force-free fields to the separable form B=(H(θ,φ))/(r{sup n+2}) promises field solutions of even richer topological varieties but allowing for φ-dependence greatly complicates the governing equations that have remained intractable. The axisymmetric results obtained are discussed in relation to this generalization and the Parker Magnetostatic Theorem. The axisymmetric solutions are mathematically related to a family of 3D time-dependent ideal MHD solutions for a polytropic fluid of index γ = 4/3 as discussed in the Appendix.« less

Properties of networks with partially structured and partially random connectivity

NASA Astrophysics Data System (ADS)

Ahmadian, Yashar; Fumarola, Francesco; Miller, Kenneth D.

2015-01-01

Networks studied in many disciplines, including neuroscience and mathematical biology, have connectivity that may be stochastic about some underlying mean connectivity represented by a non-normal matrix. Furthermore, the stochasticity may not be independent and identically distributed (iid) across elements of the connectivity matrix. More generally, the problem of understanding the behavior of stochastic matrices with nontrivial mean structure and correlations arises in many settings. We address this by characterizing large random N ×N matrices of the form A =M +L J R , where M ,L , and R are arbitrary deterministic matrices and J is a random matrix of zero-mean iid elements. M can be non-normal, and L and R allow correlations that have separable dependence on row and column indices. We first provide a general formula for the eigenvalue density of A . For A non-normal, the eigenvalues do not suffice to specify the dynamics induced by A , so we also provide general formulas for the transient evolution of the magnitude of activity and frequency power spectrum in an N -dimensional linear dynamical system with a coupling matrix given by A . These quantities can also be thought of as characterizing the stability and the magnitude of the linear response of a nonlinear network to small perturbations about a fixed point. We derive these formulas and work them out analytically for some examples of M ,L , and R motivated by neurobiological models. We also argue that the persistence as N →∞ of a finite number of randomly distributed outlying eigenvalues outside the support of the eigenvalue density of A , as previously observed, arises in regions of the complex plane Ω where there are nonzero singular values of L-1(z 1 -M ) R-1 (for z ∈Ω ) that vanish as N →∞ . When such singular values do not exist and L and R are equal to the identity, there is a correspondence in the normalized Frobenius norm (but not in the operator norm) between the support of the spectrum of A for J of norm σ and the σ pseudospectrum of M .

Krylov subspace methods - Theory, algorithms, and applications

NASA Technical Reports Server (NTRS)

Sad, Youcef

1990-01-01

Projection methods based on Krylov subspaces for solving various types of scientific problems are reviewed. The main idea of this class of methods when applied to a linear system Ax = b, is to generate in some manner an approximate solution to the original problem from the so-called Krylov subspace span. Thus, the original problem of size N is approximated by one of dimension m, typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now becoming popular for solving nonlinear equations. The main ideas in Krylov subspace methods are shown and their use in solving linear systems, eigenvalue problems, parabolic partial differential equations, Liapunov matrix equations, and nonlinear system of equations are discussed.

Root finding in the complex plane for seismo-acoustic propagation scenarios with Green's function solutions.

PubMed

McCollom, Brittany A; Collis, Jon M

2014-09-01

A normal mode solution to the ocean acoustic problem of the Pekeris waveguide with an elastic bottom using a Green's function formulation for a compressional wave point source is considered. Analytic solutions to these types of waveguide propagation problems are strongly dependent on the eigenvalues of the problem; these eigenvalues represent horizontal wavenumbers, corresponding to propagating modes of energy. The eigenvalues arise as singularities in the inverse Hankel transform integral and are specified by roots to a characteristic equation. These roots manifest themselves as poles in the inverse transform integral and can be both subtle and difficult to determine. Following methods previously developed [S. Ivansson et al., J. Sound Vib. 161 (1993)], a root finding routine has been implemented using the argument principle. Using the roots to the characteristic equation in the Green's function formulation, full-field solutions are calculated for scenarios where an acoustic source lies in either the water column or elastic half space. Solutions are benchmarked against laboratory data and existing numerical solutions.

A comparative study of history-based versus vectorized Monte Carlo methods in the GPU/CUDA environment for a simple neutron eigenvalue problem

NASA Astrophysics Data System (ADS)

Liu, Tianyu; Du, Xining; Ji, Wei; Xu, X. George; Brown, Forrest B.

2014-06-01

For nuclear reactor analysis such as the neutron eigenvalue calculations, the time consuming Monte Carlo (MC) simulations can be accelerated by using graphics processing units (GPUs). However, traditional MC methods are often history-based, and their performance on GPUs is affected significantly by the thread divergence problem. In this paper we describe the development of a newly designed event-based vectorized MC algorithm for solving the neutron eigenvalue problem. The code was implemented using NVIDIA's Compute Unified Device Architecture (CUDA), and tested on a NVIDIA Tesla M2090 GPU card. We found that although the vectorized MC algorithm greatly reduces the occurrence of thread divergence thus enhancing the warp execution efficiency, the overall simulation speed is roughly ten times slower than the history-based MC code on GPUs. Profiling results suggest that the slow speed is probably due to the memory access latency caused by the large amount of global memory transactions. Possible solutions to improve the code efficiency are discussed.

Extension of modified power method to two-dimensional problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Peng; Ulsan National Institute of Science and Technology, 50 UNIST-gil, Ulsan 44919; Lee, Hyunsuk

2016-09-01

In this study, the generalized modified power method was extended to two-dimensional problems. A direct application of the method to two-dimensional problems was shown to be unstable when the number of requested eigenmodes is larger than a certain problem dependent number. The root cause of this instability has been identified as the degeneracy of the transfer matrix. In order to resolve this instability, the number of sub-regions for the transfer matrix was increased to be larger than the number of requested eigenmodes; and a new transfer matrix was introduced accordingly which can be calculated by the least square method. Themore » stability of the new method has been successfully demonstrated with a neutron diffusion eigenvalue problem and the 2D C5G7 benchmark problem. - Graphical abstract:.« less

Comparison of scalar measures used in magnetic resonance diffusion tensor imaging.

PubMed

Bahn, M M

1999-07-01

The tensors derived from diffusion tensor imaging describe complex diffusion in tissues. However, it is difficult to compare tensors directly or to produce images that contain all of the information of the tensor. Therefore, it is convenient to produce scalar measures that extract desired aspects of the tensor. These measures map the three-dimensional eigenvalues of the diffusion tensor into scalar values. The measures impose an order on eigenvalue space. Many invariant scalar measures have been introduced in the literature. In the present manuscript, a general approach for producing invariant scalar measures is introduced. Because it is often difficult to determine in clinical practice which of the many measures is best to apply to a given situation, two formalisms are introduced for the presentation, definition, and comparison of measures applied to eigenvalues: (1) normalized eigenvalue space, and (2) parametric eigenvalue transformation plots. All of the anisotropy information contained in the three eigenvalues can be retained and displayed in a two-dimensional plot, the normalized eigenvalue plot. An example is given of how to determine the best measure to use for a given situation by superimposing isometric contour lines from various anisotropy measures on plots of actual measured eigenvalue data points. Parametric eigenvalue transformation plots allow comparison of how different measures impose order on normalized eigenvalue space to determine whether the measures are equivalent and how the measures differ. These formalisms facilitate the comparison of scalar invariant measures for diffusion tensor imaging. Normalized eigenvalue space allows presentation of eigenvalue anisotropy information. Copyright 1999 Academic Press.

A uniform object-oriented solution to the eigenvalue problem for real symmetric and Hermitian matrices

NASA Astrophysics Data System (ADS)

Castro, María Eugenia; Díaz, Javier; Muñoz-Caro, Camelia; Niño, Alfonso

2011-09-01

We present a system of classes, SHMatrix, to deal in a unified way with the computation of eigenvalues and eigenvectors in real symmetric and Hermitian matrices. Thus, two descendant classes, one for the real symmetric and other for the Hermitian cases, override the abstract methods defined in a base class. The use of the inheritance relationship and polymorphism allows handling objects of any descendant class using a single reference of the base class. The system of classes is intended to be the core element of more sophisticated methods to deal with large eigenvalue problems, as those arising in the variational treatment of realistic quantum mechanical problems. The present system of classes allows computing a subset of all the possible eigenvalues and, optionally, the corresponding eigenvectors. Comparison with well established solutions for analogous eigenvalue problems, as those included in LAPACK, shows that the present solution is competitive against them. Program summaryProgram title: SHMatrix Catalogue identifier: AEHZ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHZ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 2616 No. of bytes in distributed program, including test data, etc.: 127 312 Distribution format: tar.gz Programming language: Standard ANSI C++. Computer: PCs and workstations. Operating system: Linux, Windows. Classification: 4.8. Nature of problem: The treatment of problems involving eigensystems is a central topic in the quantum mechanical field. Here, the use of the variational approach leads to the computation of eigenvalues and eigenvectors of real symmetric and Hermitian Hamiltonian matrices. Realistic models with several degrees of freedom leads to large (sometimes very large) matrices. Different techniques, such as divide and conquer, can be used to factorize the matrices in order to apply a parallel computing approach. However, it is still interesting to have a core procedure able to tackle the computation of eigenvalues and eigenvectors once the matrix has been factorized to pieces of enough small size. Several available software packages, such as LAPACK, tackled this problem under the traditional imperative programming paradigm. In order to ease the modelling of complex quantum mechanical models it could be interesting to apply an object-oriented approach to the treatment of the eigenproblem. This approach offers the advantage of a single, uniform treatment for the real symmetric and Hermitian cases. Solution method: To reach the above goals, we have developed a system of classes: SHMatrix. SHMatrix is composed by an abstract base class and two descendant classes, one for real symmetric matrices and the other for the Hermitian case. The object-oriented characteristics of inheritance and polymorphism allows handling both cases using a single reference of the base class. The basic computing strategy applied in SHMatrix allows computing subsets of eigenvalues and (optionally) eigenvectors. The tests performed show that SHMatrix is competitive, and more efficient for large matrices, than the equivalent routines of the LAPACK package. Running time: The examples included in the distribution take only a couple of seconds to run.

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

NASA Technical Reports Server (NTRS)

Fischer, Bernd; Freund, Roland W.

1992-01-01

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Computation of canonical correlation and best predictable aspect of future for time series

NASA Technical Reports Server (NTRS)

Pourahmadi, Mohsen; Miamee, A. G.

1989-01-01

The canonical correlation between the (infinite) past and future of a stationary time series is shown to be the limit of the canonical correlation between the (infinite) past and (finite) future, and computation of the latter is reduced to a (generalized) eigenvalue problem involving (finite) matrices. This provides a convenient and essentially, finite-dimensional algorithm for computing canonical correlations and components of a time series. An upper bound is conjectured for the largest canonical correlation.

Bunch-Kaufman factorization for real symmetric indefinite banded matrices

NASA Technical Reports Server (NTRS)

Jones, Mark T.; Patrick, Merrell L.

1989-01-01

The Bunch-Kaufman algorithm for factoring symmetric indefinite matrices was rejected for banded matrices because it destroys the banded structure of the matrix. Herein, it is shown that for a subclass of real symmetric matrices which arise in solving the generalized eigenvalue problem using Lanczos's method, the Bunch-Kaufman algorithm does not result in major destruction of the bandwidth. Space time complexities of the algorithm are given and used to show that the Bunch-Kaufman algorithm is a significant improvement over LU factorization.

Edge connectivity and the spectral gap of combinatorial and quantum graphs

NASA Astrophysics Data System (ADS)

Berkolaiko, Gregory; Kennedy, James B.; Kurasov, Pavel; Mugnolo, Delio

2017-09-01

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of Laplacians on combinatorial and quantum graph in terms of the edge connectivity, i.e. the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds corresponds to a well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and Lévy. All proofs are general enough to yield corresponding estimates for the p-Laplacian and allow us to identify the minimizers. Based on the Betti number of the graph, we also derive upper and lower bounds on all eigenvalues which are ‘asymptotically correct’, i.e. agree with the Weyl asymptotics for the eigenvalues of the quantum graph. In particular, the lower bounds improve the bounds of Friedlander on any given graph for all but finitely many eigenvalues, while the upper bounds improve recent results of Ariturk. Our estimates are also used to derive bounds on the eigenvalues of the normalized Laplacian matrix that improve known bounds of spectral graph theory.

Random pure states: Quantifying bipartite entanglement beyond the linear statistics.

PubMed

Vivo, Pierpaolo; Pato, Mauricio P; Oshanin, Gleb

2016-05-01

We analyze the properties of entangled random pure states of a quantum system partitioned into two smaller subsystems of dimensions N and M. Framing the problem in terms of random matrices with a fixed-trace constraint, we establish, for arbitrary N≤M, a general relation between the n-point densities and the cross moments of the eigenvalues of the reduced density matrix, i.e., the so-called Schmidt eigenvalues, and the analogous functionals of the eigenvalues of the Wishart-Laguerre ensemble of the random matrix theory. This allows us to derive explicit expressions for two-level densities, and also an exact expression for the variance of von Neumann entropy at finite N,M. Then, we focus on the moments E{K^{a}} of the Schmidt number K, the reciprocal of the purity. This is a random variable supported on [1,N], which quantifies the number of degrees of freedom effectively contributing to the entanglement. We derive a wealth of analytical results for E{K^{a}} for N=2 and 3 and arbitrary M, and also for square N=M systems by spotting for the latter a connection with the probability P(x_{min}^{GUE}≥sqrt[2N]ξ) that the smallest eigenvalue x_{min}^{GUE} of an N×N matrix belonging to the Gaussian unitary ensemble is larger than sqrt[2N]ξ. As a by-product, we present an exact asymptotic expansion for P(x_{min}^{GUE}≥sqrt[2N]ξ) for finite N as ξ→∞. Our results are corroborated by numerical simulations whenever possible, with excellent agreement.

Lasing eigenvalue problems: the electromagnetic modelling of microlasers

NASA Astrophysics Data System (ADS)

Benson, Trevor; Nosich, Alexander; Smotrova, Elena; Balaban, Mikhail; Sewell, Phillip

2007-02-01

Comprehensive microcavity laser models should account for several physical mechanisms, e.g. carrier transport, heating and optical confinement, coupled by non-linear effects. Nevertheless, considerable useful information can still be obtained if all non-electromagnetic effects are neglected, often within an additional effective-index reduction to an equivalent 2D problem, and the optical modes viewed as solutions of Maxwell's equations. Integral equation (IE) formulations have many advantages over numerical techniques such as FDTD for the study of such microcavity laser problems. The most notable advantages of an IE approach are computational efficiency, the correct description of cavity boundaries without stair-step errors, and the direct solution of an eigenvalue problem rather than the spectral analysis of a transient signal. Boundary IE (BIE) formulations are more economic that volume IE (VIE) ones, because of their lower dimensionality, but they are only applicable to the constant cavity refractive index case. The Muller BIE, being free of 'defect' frequencies and having smooth or integrable kernels, provides a reliable tool for the modal analysis of microcavities. Whilst such an approach can readily identify complex-valued natural frequencies and Q-factors, the lasing condition is not addressed directly. We have thus suggested using a Muller BIE approach to solve a lasing eigenvalue problem (LEP), i.e. a linear eigenvalue solution in the form of two real-valued numbers (lasing wavelength and threshold information) when macroscopic gain is introduced into the cavity material within an active region. Such an approach yields clear insight into the lasing thresholds of individual cavities with uniform and non-uniform gain, cavities coupled as photonic molecules and cavities equipped with one or more quantum dots.

Optimal exponential synchronization of general chaotic delayed neural networks: an LMI approach.

PubMed

Liu, Meiqin

2009-09-01

This paper investigates the optimal exponential synchronization problem of general chaotic neural networks with or without time delays by virtue of Lyapunov-Krasovskii stability theory and the linear matrix inequality (LMI) technique. This general model, which is the interconnection of a linear delayed dynamic system and a bounded static nonlinear operator, covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks (CNNs), bidirectional associative memory (BAM) networks, and recurrent multilayer perceptrons (RMLPs) with or without delays. Using the drive-response concept, time-delay feedback controllers are designed to synchronize two identical chaotic neural networks as quickly as possible. The control design equations are shown to be a generalized eigenvalue problem (GEVP) which can be easily solved by various convex optimization algorithms to determine the optimal control law and the optimal exponential synchronization rate. Detailed comparisons with existing results are made and numerical simulations are carried out to demonstrate the effectiveness of the established synchronization laws.

On the behavior of the leading eigenvalue of Eigen's evolutionary matrices.

PubMed

Semenov, Yuri S; Bratus, Alexander S; Novozhilov, Artem S

2014-12-01

We study general properties of the leading eigenvalue w¯(q) of Eigen's evolutionary matrices depending on the replication fidelity q. This is a linear algebra problem that has various applications in theoretical biology, including such diverse fields as the origin of life, evolution of cancer progression, and virus evolution. We present the exact expressions for w¯(q),w¯(')(q),w¯('')(q) for q = 0, 0.5, 1 and prove that the absolute minimum of w¯(q), which always exists, belongs to the interval (0, 0.5]. For the specific case of a single peaked landscape we also find lower and upper bounds on w¯(q), which are used to estimate the critical mutation rate, after which the distribution of the types of individuals in the population becomes almost uniform. This estimate is used as a starting point to conjecture another estimate, valid for any fitness landscape, and which is checked by numerical calculations. The last estimate stresses the fact that the inverse dependence of the critical mutation rate on the sequence length is not a generally valid fact. Copyright © 2014 Elsevier Inc. All rights reserved.

Best dispersal strategies in spatially heterogeneous environments: optimization of the principal eigenvalue for indefinite fractional Neumann problems.

PubMed

Pellacci, Benedetta; Verzini, Gianmaria

2018-05-01

We study the positive principal eigenvalue of a weighted problem associated with the Neumann spectral fractional Laplacian. This analysis is related to the investigation of the survival threshold in population dynamics. Our main result concerns the optimization of such threshold with respect to the fractional order [Formula: see text], the case [Formula: see text] corresponding to the standard Neumann Laplacian: when the habitat is not too fragmented, the principal positive eigenvalue can not have local minima for [Formula: see text]. As a consequence, the best strategy for survival is either following the diffusion with [Formula: see text] (i.e. Brownian diffusion), or with the lowest possible s (i.e. diffusion allowing long jumps), depending on the size of the domain. In addition, we show that analogous results hold for the standard fractional Laplacian in [Formula: see text], in periodic environments.

A variational eigenvalue solver on a photonic quantum processor

PubMed Central

Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alán; O’Brien, Jeremy L.

2014-01-01

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+. The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. PMID:25055053

Eigenvalue Solvers for Modeling Nuclear Reactors on Leadership Class Machines

DOE PAGES

Slaybaugh, R. N.; Ramirez-Zweiger, M.; Pandya, Tara; ...

2018-02-20

In this paper, three complementary methods have been implemented in the code Denovo that accelerate neutral particle transport calculations with methods that use leadership-class computers fully and effectively: a multigroup block (MG) Krylov solver, a Rayleigh quotient iteration (RQI) eigenvalue solver, and a multigrid in energy (MGE) preconditioner. The MG Krylov solver converges more quickly than Gauss Seidel and enables energy decomposition such that Denovo can scale to hundreds of thousands of cores. RQI should converge in fewer iterations than power iteration (PI) for large and challenging problems. RQI creates shifted systems that would not be tractable without the MGmore » Krylov solver. It also creates ill-conditioned matrices. The MGE preconditioner reduces iteration count significantly when used with RQI and takes advantage of the new energy decomposition such that it can scale efficiently. Each individual method has been described before, but this is the first time they have been demonstrated to work together effectively. The combination of solvers enables the RQI eigenvalue solver to work better than the other available solvers for large reactors problems on leadership-class machines. Using these methods together, RQI converged in fewer iterations and in less time than PI for a full pressurized water reactor core. These solvers also performed better than an Arnoldi eigenvalue solver for a reactor benchmark problem when energy decomposition is needed. The MG Krylov, MGE preconditioner, and RQI solver combination also scales well in energy. Finally, this solver set is a strong choice for very large and challenging problems.« less

Eigenvalue Solvers for Modeling Nuclear Reactors on Leadership Class Machines

DOE Office of Scientific and Technical Information (OSTI.GOV)

Slaybaugh, R. N.; Ramirez-Zweiger, M.; Pandya, Tara

In this paper, three complementary methods have been implemented in the code Denovo that accelerate neutral particle transport calculations with methods that use leadership-class computers fully and effectively: a multigroup block (MG) Krylov solver, a Rayleigh quotient iteration (RQI) eigenvalue solver, and a multigrid in energy (MGE) preconditioner. The MG Krylov solver converges more quickly than Gauss Seidel and enables energy decomposition such that Denovo can scale to hundreds of thousands of cores. RQI should converge in fewer iterations than power iteration (PI) for large and challenging problems. RQI creates shifted systems that would not be tractable without the MGmore » Krylov solver. It also creates ill-conditioned matrices. The MGE preconditioner reduces iteration count significantly when used with RQI and takes advantage of the new energy decomposition such that it can scale efficiently. Each individual method has been described before, but this is the first time they have been demonstrated to work together effectively. The combination of solvers enables the RQI eigenvalue solver to work better than the other available solvers for large reactors problems on leadership-class machines. Using these methods together, RQI converged in fewer iterations and in less time than PI for a full pressurized water reactor core. These solvers also performed better than an Arnoldi eigenvalue solver for a reactor benchmark problem when energy decomposition is needed. The MG Krylov, MGE preconditioner, and RQI solver combination also scales well in energy. Finally, this solver set is a strong choice for very large and challenging problems.« less

Global stability analysis of axisymmetric boundary layer over a circular cylinder

NASA Astrophysics Data System (ADS)

Bhoraniya, Ramesh; Vinod, Narayanan

2018-05-01

This paper presents a linear global stability analysis of the incompressible axisymmetric boundary layer on a circular cylinder. The base flow is parallel to the axis of the cylinder at inflow boundary. The pressure gradient is zero in the streamwise direction. The base flow velocity profile is fully non-parallel and non-similar in nature. The boundary layer grows continuously in the spatial directions. Linearized Navier-Stokes (LNS) equations are derived for the disturbance flow quantities in the cylindrical polar coordinates. The LNS equations along with homogeneous boundary conditions forms a generalized eigenvalues problem. Since the base flow is axisymmetric, the disturbances are periodic in azimuthal direction. Chebyshev spectral collocation method and Arnoldi's iterative algorithm is used for the solution of the general eigenvalues problem. The global temporal modes are computed for the range of Reynolds numbers and different azimuthal wave numbers. The largest imaginary part of the computed eigenmodes is negative, and hence, the flow is temporally stable. The spatial structure of the eigenmodes shows that the disturbance amplitudes grow in size and magnitude while they are moving towards downstream. The global modes of axisymmetric boundary layer are more stable than that of 2D flat-plate boundary layer at low Reynolds number. However, at higher Reynolds number they approach 2D flat-plate boundary layer. Thus, the damping effect of transverse curvature is significant at low Reynolds number. The wave-like nature of the disturbance amplitudes is found in the streamwise direction for the least stable eigenmodes.

Using parallel banded linear system solvers in generalized eigenvalue problems

NASA Technical Reports Server (NTRS)

Zhang, Hong; Moss, William F.

1993-01-01

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

Fully Parallel MHD Stability Analysis Tool

NASA Astrophysics Data System (ADS)

Svidzinski, Vladimir; Galkin, Sergei; Kim, Jin-Soo; Liu, Yueqiang

2014-10-01

Progress on full parallelization of the plasma stability code MARS will be reported. MARS calculates eigenmodes in 2D axisymmetric toroidal equilibria in MHD-kinetic plasma models. It is a powerful tool for studying MHD and MHD-kinetic instabilities and it is widely used by fusion community. Parallel version of MARS is intended for simulations on local parallel clusters. It will be an efficient tool for simulation of MHD instabilities with low, intermediate and high toroidal mode numbers within both fluid and kinetic plasma models, already implemented in MARS. Parallelization of the code includes parallelization of the construction of the matrix for the eigenvalue problem and parallelization of the inverse iterations algorithm, implemented in MARS for the solution of the formulated eigenvalue problem. Construction of the matrix is parallelized by distributing the load among processors assigned to different magnetic surfaces. Parallelization of the solution of the eigenvalue problem is made by repeating steps of the present MARS algorithm using parallel libraries and procedures. Initial results of the code parallelization will be reported. Work is supported by the U.S. DOE SBIR program.

Efficient parallel resolution of the simplified transport equations in mixed-dual formulation

NASA Astrophysics Data System (ADS)

Barrault, M.; Lathuilière, B.; Ramet, P.; Roman, J.

2011-03-01

A reactivity computation consists of computing the highest eigenvalue of a generalized eigenvalue problem, for which an inverse power algorithm is commonly used. Very fine modelizations are difficult to treat for our sequential solver, based on the simplified transport equations, in terms of memory consumption and computational time. A first implementation of a Lagrangian based domain decomposition method brings to a poor parallel efficiency because of an increase in the power iterations [1]. In order to obtain a high parallel efficiency, we improve the parallelization scheme by changing the location of the loop over the subdomains in the overall algorithm and by benefiting from the characteristics of the Raviart-Thomas finite element. The new parallel algorithm still allows us to locally adapt the numerical scheme (mesh, finite element order). However, it can be significantly optimized for the matching grid case. The good behavior of the new parallelization scheme is demonstrated for the matching grid case on several hundreds of nodes for computations based on a pin-by-pin discretization.

CCOMP: An efficient algorithm for complex roots computation of determinantal equations

NASA Astrophysics Data System (ADS)

Zouros, Grigorios P.

2018-01-01

In this paper a free Python algorithm, entitled CCOMP (Complex roots COMPutation), is developed for the efficient computation of complex roots of determinantal equations inside a prescribed complex domain. The key to the method presented is the efficient determination of the candidate points inside the domain which, in their close neighborhood, a complex root may lie. Once these points are detected, the algorithm proceeds to a two-dimensional minimization problem with respect to the minimum modulus eigenvalue of the system matrix. In the core of CCOMP exist three sub-algorithms whose tasks are the efficient estimation of the minimum modulus eigenvalues of the system matrix inside the prescribed domain, the efficient computation of candidate points which guarantee the existence of minima, and finally, the computation of minima via bound constrained minimization algorithms. Theoretical results and heuristics support the development and the performance of the algorithm, which is discussed in detail. CCOMP supports general complex matrices, and its efficiency, applicability and validity is demonstrated to a variety of microwave applications.

Multiple eigenmodes of the Rayleigh-Taylor instability observed for a fluid interface with smoothly varying density

NASA Astrophysics Data System (ADS)

Yu, C. X.; Xue, C.; Liu, J.; Hu, X. Y.; Liu, Y. Y.; Ye, W. H.; Wang, L. F.; Wu, J. F.; Fan, Z. F.

2018-01-01

In this article, multiple eigen-systems including linear growth rates and eigen-functions have been discovered for the Rayleigh-Taylor instability (RTI) by numerically solving the Sturm-Liouville eigen-value problem in the case of two-dimensional plane geometry. The system called the first mode has the maximal linear growth rate and is just extensively studied in literature. Higher modes have smaller eigen-values, but possess multi-peak eigen-functions which bring on multiple pairs of vortices in the vorticity field. A general fitting expression for the first four eigen-modes is presented. Direct numerical simulations show that high modes lead to appearances of multi-layered spike-bubble pairs, and lots of secondary spikes and bubbles are also generated due to the interactions between internal spikes and bubbles. The present work has potential applications in many research and engineering areas, e.g., in reducing the RTI growth during capsule implosions in inertial confinement fusion.

The construction of partner potential from the general potential anharmonic in D-dimensional Schrodinger system

NASA Astrophysics Data System (ADS)

Suparmi; Cari, C.; Wea, K. N.; Wahyulianti

2018-03-01

The Schrodinger equation is the fundamental equation in quantum physics. The characteristic of the particle in physics potential field can be explained by using the Schrodinger equation. In this study, the solution of 4 dimensional Schrodinger equation for the anharmonic potential and the anharmonic partner potential have done. The method that used to solve the Schrodinger equation was the ansatz wave method, while to construction the partner potential was the supersymmetric method. The construction of partner potential used to explain the experiment result that cannot be explained by the original potential. The eigenvalue for anharmonic potential and the anharmonic partner potential have the same characteristic. Every increase of quantum orbital number the eigenvalue getting smaller. This result corresponds to Bohrn’s atomic theory that the eigenvalue is inversely proportional to the atomic shell. But the eigenvalue for the anharmonic partner potential higher than the eigenvalue for the anharmonic original potential.

Unreliable Retrial Queues in a Random Environment

DTIC Science & Technology

2007-09-01

equivalent to the stochasticity of the matrix Ĝ. It is generally known from Perron - Frobenius theory that a given square ma- trix M is stochastic if and...only if its maximum positive eigenvalue (i.e., its Perron eigenvalue) sp(M) is equal to unity. A simple analytical condition that guarantees the

Obtaining eigensolutions for multiple frequency ranges in a single NASTRAN execution

NASA Technical Reports Server (NTRS)

Pamidi, P. R.; Brown, W. K.

1990-01-01

A novel and general procedure for obtaining eigenvalues and eigenvectors for multiple frequency ranges in a single NASTRAN execution is presented. The scheme is applicable to normal modes analyzes employing the FEER and Inverse Power methods of eigenvalue extraction. The procedure is illustrated by examples.

Stability investigations of airfoil flow by global analysis

NASA Technical Reports Server (NTRS)

Morzynski, Marek; Thiele, Frank

1992-01-01

As the result of global, non-parallel flow stability analysis the single value of the disturbance growth-rate and respective frequency is obtained. This complex value characterizes the stability of the whole flow configuration and is not referred to any particular flow pattern. The global analysis assures that all the flow elements (wake, boundary and shear layer) are taken into account. The physical phenomena connected with the wake instability are properly reproduced by the global analysis. This enhances the investigations of instability of any 2-D flows, including ones in which the boundary layer instability effects are known to be of dominating importance. Assuming fully 2-D disturbance form, the global linear stability problem is formulated. The system of partial differential equations is solved for the eigenvalues and eigenvectors. The equations, written in the pure stream function formulation, are discretized via FDM using a curvilinear coordinate system. The complex eigenvalues and corresponding eigenvectors are evaluated by an iterative method. The investigations performed for various Reynolds numbers emphasize that the wake instability develops into the Karman vortex street. This phenomenon is shown to be connected with the first mode obtained from the non-parallel flow stability analysis. The higher modes are reflecting different physical phenomena as for example Tollmien-Schlichting waves, originating in the boundary layer and having the tendency to emerge as instabilities for the growing Reynolds number. The investigations are carried out for a circular cylinder, oblong ellipsis and airfoil. It is shown that the onset of the wake instability, the waves in the boundary layer, the shear layer instability are different solutions of the same eigenvalue problem, formulated using the non-parallel theory. The analysis offers large potential possibilities as the generalization of methods used till now for the stability analysis.

The Guderley problem revisited

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ramsey, Scott D; Kamm, James R; Bolstad, John H

2009-01-01

The self-similar converging-diverging shock wave problem introduced by Guderley in 1942 has been the source of numerous investigations since its publication. In this paper, we review the simplifications and group invariance properties that lead to a self-similar formulation of this problem from the compressible flow equations for a polytropic gas. The complete solution to the self-similar problem reduces to two coupled nonlinear eigenvalue problems: the eigenvalue of the first is the so-called similarity exponent for the converging flow, and that of the second is a trajectory multiplier for the diverging regime. We provide a clear exposition concerning the reflected shockmore » configuration. Additionally, we introduce a new approximation for the similarity exponent, which we compare with other estimates and numerically computed values. Lastly, we use the Guderley problem as the basis of a quantitative verification analysis of a cell-centered, finite volume, Eulerian compressible flow algorithm.« less

Two-dimensional integrating matrices on rectangular grids. [solving differential equations associated with rotating structures

NASA Technical Reports Server (NTRS)

Lakin, W. D.

1981-01-01

The use of integrating matrices in solving differential equations associated with rotating beam configurations is examined. In vibration problems, by expressing the equations of motion of the beam in matrix notation, utilizing the integrating matrix as an operator, and applying the boundary conditions, the spatial dependence is removed from the governing partial differential equations and the resulting ordinary differential equations can be cast into standard eigenvalue form. Integrating matrices are derived based on two dimensional rectangular grids with arbitrary grid spacings allowed in one direction. The derivation of higher dimensional integrating matrices is the initial step in the generalization of the integrating matrix methodology to vibration and stability problems involving plates and shells.

Developments in boundary element methods - 2

NASA Astrophysics Data System (ADS)

Banerjee, P. K.; Shaw, R. P.

This book is a continuation of the effort to demonstrate the power and versatility of boundary element methods which began in Volume 1 of this series. While Volume 1 was designed to introduce the reader to a selected range of problems in engineering for which the method has been shown to be efficient, the present volume has been restricted to time-dependent problems in engineering. Boundary element formulation for melting and solidification problems in considered along with transient flow through porous elastic media, applications of boundary element methods to problems of water waves, and problems of general viscous flow. Attention is given to time-dependent inelastic deformation of metals by boundary element methods, the determination of eigenvalues by boundary element methods, transient stress analysis of tunnels and caverns of arbitrary shape due to traveling waves, an analysis of hydrodynamic loads by boundary element methods, and acoustic emissions from submerged structures.

(Quasi)-convexification of Barta's (multi-extrema) bounding theorem: Inf_x\\big(\\ssty\\frac{H\\Phi(x)}{\\Phi(x)} \\big) \\le E_gr \\le Sup_x \\big(\\ssty\\frac{H\\Phi(x)}{\\Phi(x)} \\big)

NASA Astrophysics Data System (ADS)

Handy, C. R.

2006-03-01

There has been renewed interest in the exploitation of Barta's configuration space theorem (BCST) (Barta 1937 C. R. Acad. Sci. Paris 204 472) which bounds the ground-state energy, Inf_x\\big({{H\\Phi(x)}\\over {\\Phi(x)}} \\big ) \\leq E_gr \\leq Sup_x \\big({{H\\Phi(x)}\\over {\\Phi(x)}}\\big) , by using any Φ lying within the space of positive, bounded, and sufficiently smooth functions, {\\cal C} . Mouchet's (Mouchet 2005 J. Phys. A: Math. Gen. 38 1039) BCST analysis is based on gradient optimization (GO). However, it overlooks significant difficulties: (i) appearance of multi-extrema; (ii) inefficiency of GO for stiff (singular perturbation/strong coupling) problems; (iii) the nonexistence of a systematic procedure for arbitrarily improving the bounds within {\\cal C} . These deficiencies can be corrected by transforming BCST into a moments' representation equivalent, and exploiting a generalization of the eigenvalue moment method (EMM), within the context of the well-known generalized eigenvalue problem (GEP), as developed here. EMM is an alternative eigenenergy bounding, variational procedure, overlooked by Mouchet, which also exploits the positivity of the desired physical solution. Furthermore, it is applicable to Hermitian and non-Hermitian systems with complex-number quantization parameters (Handy and Bessis 1985 Phys. Rev. Lett. 55 931, Handy et al 1988 Phys. Rev. Lett. 60 253, Handy 2001 J. Phys. A: Math. Gen. 34 5065, Handy et al 2002 J. Phys. A: Math. Gen. 35 6359). Our analysis exploits various quasi-convexity/concavity theorems common to the GEP representation. We outline the general theory, and present some illustrative examples.

Robust L1-norm two-dimensional linear discriminant analysis.

PubMed

Li, Chun-Na; Shao, Yuan-Hai; Deng, Nai-Yang

2015-05-01

In this paper, we propose an L1-norm two-dimensional linear discriminant analysis (L1-2DLDA) with robust performance. Different from the conventional two-dimensional linear discriminant analysis with L2-norm (L2-2DLDA), where the optimization problem is transferred to a generalized eigenvalue problem, the optimization problem in our L1-2DLDA is solved by a simple justifiable iterative technique, and its convergence is guaranteed. Compared with L2-2DLDA, our L1-2DLDA is more robust to outliers and noises since the L1-norm is used. This is supported by our preliminary experiments on toy example and face datasets, which show the improvement of our L1-2DLDA over L2-2DLDA. Copyright © 2015 Elsevier Ltd. All rights reserved.

Projection methods for the numerical solution of Markov chain models

NASA Technical Reports Server (NTRS)

Saad, Youcef

1989-01-01

Projection methods for computing stationary probability distributions for Markov chain models are presented. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of methods based on this principle is that of Krylov subspace methods which utilize subspaces of the form span(v,av,...,A(exp m-1)v). These methods are effective in solving linear systems and eigenvalue problems (Lanczos, Arnoldi,...) as well as nonlinear equations. They can be combined with more traditional iterative methods such as successive overrelaxation, symmetric successive overrelaxation, or with incomplete factorization methods to enhance convergence.

Asymptotic Representation for the Eigenvalues of a Non-selfadjoint Operator Governing the Dynamics of an Energy Harvesting Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shubov, Marianna A., E-mail: marianna.shubov@gmail.com

2016-06-15

We consider a well known model of a piezoelectric energy harvester. The harvester is designed as a beam with a piezoceramic layer attached to its top face (unimorph configuration). A pair of thin perfectly conductive electrodes is covering the top and the bottom faces of the piezoceramic layer. These electrodes are connected to a resistive load. The model is governed by a system consisting of two equations. The first of them is the equation of the Euler–Bernoulli model for the transverse vibrations of the beam and the second one represents the Kirchhoff’s law for the electric circuit. Both equations aremore » coupled due to the direct and converse piezoelectric effects. The boundary conditions for the beam equations are of clamped-free type. We represent the system as a single operator evolution equation in a Hilbert space. The dynamics generator of this system is a non-selfadjoint operator with compact resolvent. Our main result is an explicit asymptotic formula for the eigenvalues of this generator, i.e., we perform the modal analysis for electrically loaded (not short-circuit) system. We show that the spectrum splits into an infinite sequence of stable eigenvalues that approaches a vertical line in the left half plane and possibly of a finite number of unstable eigenvalues. This paper is the first in a series of three works. In the second one we will prove that the generalized eigenvectors of the dynamics generator form a Riesz basis (and, moreover, a Bari basis) in the energy space. In the third paper we will apply the results of the first two to control problems for this model.« less

A numerical method for systems of conservation laws of mixed type admitting hyperbolic flux splitting

NASA Technical Reports Server (NTRS)

Shu, Chi-Wang

1992-01-01

The present treatment of elliptic regions via hyperbolic flux-splitting and high order methods proposes a flux splitting in which the corresponding Jacobians have real and positive/negative eigenvalues. While resembling the flux splitting used in hyperbolic systems, the present generalization of such splitting to elliptic regions allows the handling of mixed-type systems in a unified and heuristically stable fashion. The van der Waals fluid-dynamics equation is used. Convergence with good resolution to weak solutions for various Riemann problems are observed.

Exact solutions for the selection-mutation equilibrium in the Crow-Kimura evolutionary model.

PubMed

Semenov, Yuri S; Novozhilov, Artem S

2015-08-01

We reformulate the eigenvalue problem for the selection-mutation equilibrium distribution in the case of a haploid asexually reproduced population in the form of an equation for an unknown probability generating function of this distribution. The special form of this equation in the infinite sequence limit allows us to obtain analytically the steady state distributions for a number of particular cases of the fitness landscape. The general approach is illustrated by examples; theoretical findings are compared with numerical calculations. Copyright © 2015. Published by Elsevier Inc.

Tube wave signatures in cylindrically layered poroelastic media computed with spectral method

NASA Astrophysics Data System (ADS)

Karpfinger, Florian; Gurevich, Boris; Valero, Henri-Pierre; Bakulin, Andrey; Sinha, Bikash

2010-11-01

This paper describes a new algorithm based on the spectral method for the computation of Stoneley wave dispersion and attenuation propagating in cylindrical structures composed of fluid, elastic and poroelastic layers. The spectral method is a numerical method which requires discretization of the structure along the radial axis using Chebyshev points. To approximate the differential operators of the underlying differential equations, we use spectral differentiation matrices. After discretizing equations of motion along the radial direction, we can solve the problem as a generalized algebraic eigenvalue problem. For a given frequency, calculated eigenvalues correspond to the wavenumbers of different modes. The advantage of this approach is that it can very efficiently analyse structures with complicated radial layering composed of different fluid, solid and poroelastic layers. This work summarizes the fundamental equations, followed by an outline of how they are implemented in the numerical spectral schema. The interface boundary conditions are then explained for fluid/porous, elastic/porous and porous interfaces. Finally, we discuss three examples from borehole acoustics. The first model is a fluid-filled borehole surrounded by a poroelastic formation. The second considers an additional elastic layer sandwiched between the borehole and the formation, and finally a model with radially increasing permeability is considered.

Fast Solution in Sparse LDA for Binary Classification

NASA Technical Reports Server (NTRS)

Moghaddam, Baback

2010-01-01

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic form along with the inherent sequential nature of greedy search itself. Together this enables the use of highly-efficient partitioned-matrix-inverse techniques that result in large speedups of computation in both the forward-selection and backward-elimination stages of greedy algorithms in general.

Eigensolver for a Sparse, Large Hermitian Matrix

NASA Technical Reports Server (NTRS)

Tisdale, E. Robert; Oyafuso, Fabiano; Klimeck, Gerhard; Brown, R. Chris

2003-01-01

A parallel-processing computer program finds a few eigenvalues in a sparse Hermitian matrix that contains as many as 100 million diagonal elements. This program finds the eigenvalues faster, using less memory, than do other, comparable eigensolver programs. This program implements a Lanczos algorithm in the American National Standards Institute/ International Organization for Standardization (ANSI/ISO) C computing language, using the Message Passing Interface (MPI) standard to complement an eigensolver in PARPACK. [PARPACK (Parallel Arnoldi Package) is an extension, to parallel-processing computer architectures, of ARPACK (Arnoldi Package), which is a collection of Fortran 77 subroutines that solve large-scale eigenvalue problems.] The eigensolver runs on Beowulf clusters of computers at the Jet Propulsion Laboratory (JPL).

On the cross-stream spectral method for the Orr-Sommerfeld equation

NASA Technical Reports Server (NTRS)

Zorumski, William E.; Hodge, Steven L.

1993-01-01

Cross-stream models are defined as solutions to the Orr-Sommerfeld equation which are propagating normal to the flow direction. These models are utilized as a basis for a Hilbert space to approximate the spectrum of the Orr-Sommerfeld equation with plane Poiseuille flow. The cross-stream basis leads to a standard eigenvalue problem for the frequencies of Poiseuille flow instability waves. The coefficient matrix in the eigenvalue problem is shown to be the sum of a real matrix and a negative-imaginary diagonal matrix which represents the frequencies of the cross-stream modes. The real coefficient matrix is shown to approach a Toeplitz matrix when the row and column indices are large. The Toeplitz matrix is diagonally dominant, and the diagonal elements vary inversely in magnitude with diagonal position. The Poiseuille flow eigenvalues are shown to lie within Gersgorin disks with radii bounded by the product of the average flow speed and the axial wavenumber. It is shown that the eigenvalues approach the Gersgorin disk centers when the mode index is large, so that the method may be used to compute spectra with an essentially unlimited number of elements. When the mode index is large, the real part of the eigenvalue is the product of the axial wavenumber and the average flow speed, and the imaginary part of the eigen value is identical to the corresponding cross-stream mode frequency. The cross-stream method is numerically well-conditioned in comparison to Chebyshev based methods, providing equivalent accuracy for small mode indices and superior accuracy for large indices.

Coherent mode decomposition using mixed Wigner functions of Hermite-Gaussian beams.

PubMed

Tanaka, Takashi

2017-04-15

A new method of coherent mode decomposition (CMD) is proposed that is based on a Wigner-function representation of Hermite-Gaussian beams. In contrast to the well-known method using the cross spectral density (CSD), it directly determines the mode functions and their weights without solving the eigenvalue problem. This facilitates the CMD of partially coherent light whose Wigner functions (and thus CSDs) are not separable, in which case the conventional CMD requires solving an eigenvalue problem with a large matrix and thus is numerically formidable. An example is shown regarding the CMD of synchrotron radiation, one of the most important applications of the proposed method.

Numerical methods for the unsymmetric tridiagonal eigenvalue problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jessup, E.R.

1996-12-31

This report summarizes the results of our project {open_quotes}Numerical Methods for the Unsymmetric Tridiagonal Eigenvalue Problem{close_quotes}. It was funded by both by a DOE grant (No. DE-FG02-92ER25122, 6/1/92-5/31/94, $100,000) and by an NSF Research Initiation Award (No. CCR-9109785, 7/1/91-6/30/93, $46,564.) The publications resulting from that project during the DOE funding period are listed below. Two other journal papers and two other conference papers were produced during the NSF funding period. Most of the listed conference papers are early or partial versions of the listed journal papers.

A nonperturbative light-front coupled-cluster method

NASA Astrophysics Data System (ADS)

Hiller, J. R.

2012-10-01

The nonperturbative Hamiltonian eigenvalue problem for bound states of a quantum field theory is formulated in terms of Dirac's light-front coordinates and then approximated by the exponential-operator technique of the many-body coupled-cluster method. This approximation eliminates any need for the usual approximation of Fock-space truncation. Instead, the exponentiated operator is truncated, and the terms retained are determined by a set of nonlinear integral equations. These equations are solved simultaneously with an effective eigenvalue problem in the valence sector, where the number of constituents is small. Matrix elements can be calculated, with extensions of techniques from standard coupled-cluster theory, to obtain form factors and other observables.

Capabilities of Fully Parallelized MHD Stability Code MARS

NASA Astrophysics Data System (ADS)

Svidzinski, Vladimir; Galkin, Sergei; Kim, Jin-Soo; Liu, Yueqiang

2016-10-01

Results of full parallelization of the plasma stability code MARS will be reported. MARS calculates eigenmodes in 2D axisymmetric toroidal equilibria in MHD-kinetic plasma models. Parallel version of MARS, named PMARS, has been recently developed at FAR-TECH. Parallelized MARS is an efficient tool for simulation of MHD instabilities with low, intermediate and high toroidal mode numbers within both fluid and kinetic plasma models, implemented in MARS. Parallelization of the code included parallelization of the construction of the matrix for the eigenvalue problem and parallelization of the inverse vector iterations algorithm, implemented in MARS for the solution of the formulated eigenvalue problem. Construction of the matrix is parallelized by distributing the load among processors assigned to different magnetic surfaces. Parallelization of the solution of the eigenvalue problem is made by repeating steps of the MARS algorithm using parallel libraries and procedures. Parallelized MARS is capable of calculating eigenmodes with significantly increased spatial resolution: up to 5,000 adapted radial grid points with up to 500 poloidal harmonics. Such resolution is sufficient for simulation of kink, tearing and peeling-ballooning instabilities with physically relevant parameters. Work is supported by the U.S. DOE SBIR program.

Fully Parallel MHD Stability Analysis Tool

NASA Astrophysics Data System (ADS)

Svidzinski, Vladimir; Galkin, Sergei; Kim, Jin-Soo; Liu, Yueqiang

2015-11-01

Progress on full parallelization of the plasma stability code MARS will be reported. MARS calculates eigenmodes in 2D axisymmetric toroidal equilibria in MHD-kinetic plasma models. It is a powerful tool for studying MHD and MHD-kinetic instabilities and it is widely used by fusion community. Parallel version of MARS is intended for simulations on local parallel clusters. It will be an efficient tool for simulation of MHD instabilities with low, intermediate and high toroidal mode numbers within both fluid and kinetic plasma models, already implemented in MARS. Parallelization of the code includes parallelization of the construction of the matrix for the eigenvalue problem and parallelization of the inverse iterations algorithm, implemented in MARS for the solution of the formulated eigenvalue problem. Construction of the matrix is parallelized by distributing the load among processors assigned to different magnetic surfaces. Parallelization of the solution of the eigenvalue problem is made by repeating steps of the present MARS algorithm using parallel libraries and procedures. Results of MARS parallelization and of the development of a new fix boundary equilibrium code adapted for MARS input will be reported. Work is supported by the U.S. DOE SBIR program.

Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brabec, Jiri; Lin, Lin; Shao, Meiyue

We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the product form. In contrast to existing algorithms, the new algorithms are based on reformulating the original non-Hermitian eigenvalue problem as a product eigenvalue problem and the observation that the product eigenvalue problem is self-adjoint with respect to an appropriately chosen inner product. This allows a simple symmetric Lanczos algorithm to be used to compute the desired absorption spectrum. The use of a symmetric Lanczos algorithm only requires halfmore » of the memory compared with the nonsymmetric variant of the Lanczos algorithm. The symmetric Lanczos algorithm is also numerically more stable than the nonsymmetric version. The KPM algorithm is also presented as a low-memory alternative to the Lanczos approach, but the algorithm may require more matrix-vector multiplications in practice. We discuss the pros and cons of these methods in terms of their accuracy as well as their computational and storage cost. Applications to a set of small and medium-sized molecules are also presented.« less

Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT

DOE PAGES

Brabec, Jiri; Lin, Lin; Shao, Meiyue; ...

2015-10-06

We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the product form. In contrast to existing algorithms, the new algorithms are based on reformulating the original non-Hermitian eigenvalue problem as a product eigenvalue problem and the observation that the product eigenvalue problem is self-adjoint with respect to an appropriately chosen inner product. This allows a simple symmetric Lanczos algorithm to be used to compute the desired absorption spectrum. The use of a symmetric Lanczos algorithm only requires halfmore » of the memory compared with the nonsymmetric variant of the Lanczos algorithm. The symmetric Lanczos algorithm is also numerically more stable than the nonsymmetric version. The KPM algorithm is also presented as a low-memory alternative to the Lanczos approach, but the algorithm may require more matrix-vector multiplications in practice. We discuss the pros and cons of these methods in terms of their accuracy as well as their computational and storage cost. Applications to a set of small and medium-sized molecules are also presented.« less

Programmable Calculator Use in Undergraduate Dynamics, Vibrations, and Elementary Structures Courses.

ERIC Educational Resources Information Center

Cutchins, M. A.

1982-01-01

Presents programmable calculator solutions to selected problems, including area moments of inertia and principal values, the 2-D principal stress problem, C.G. and pitch inertia computations, 3-D eigenvalue problems, 3 DOF vibrations, and a complex flutter determinant. (SK)

M-matrices with prescribed elementary divisors

NASA Astrophysics Data System (ADS)

Soto, Ricardo L.; Díaz, Roberto C.; Salas, Mario; Rojo, Oscar

2017-09-01

A real matrix A is said to be an M-matrix if it is of the form A=α I-B, where B is a nonnegative matrix with Perron eigenvalue ρ (B), and α ≥slant ρ (B) . This paper provides sufficient conditions for the existence and construction of an M-matrix A with prescribed elementary divisors, which are the characteristic polynomials of the Jordan blocks of the Jordan canonical form of A. This inverse problem on M-matrices has not been treated until now. We solve the inverse elementary divisors problem for diagonalizable M-matrices and the symmetric generalized doubly stochastic inverse M-matrix problem for lists of real numbers and for lists of complex numbers of the form Λ =\\{λ 1, a+/- bi, \\ldots, a+/- bi\\} . The constructive nature of our results allows for the computation of a solution matrix. The paper also discusses an application of M-matrices to a capacity problem in wireless communications.

A sequential linear optimization approach for controller design

NASA Technical Reports Server (NTRS)

Horta, L. G.; Juang, J.-N.; Junkins, J. L.

1985-01-01

A linear optimization approach with a simple real arithmetic algorithm is presented for reliable controller design and vibration suppression of flexible structures. Using first order sensitivity of the system eigenvalues with respect to the design parameters in conjunction with a continuation procedure, the method converts a nonlinear optimization problem into a maximization problem with linear inequality constraints. The method of linear programming is then applied to solve the converted linear optimization problem. The general efficiency of the linear programming approach allows the method to handle structural optimization problems with a large number of inequality constraints on the design vector. The method is demonstrated using a truss beam finite element model for the optimal sizing and placement of active/passive-structural members for damping augmentation. Results using both the sequential linear optimization approach and nonlinear optimization are presented and compared. The insensitivity to initial conditions of the linear optimization approach is also demonstrated.

Workshop report on large-scale matrix diagonalization methods in chemistry theory institute

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bischof, C.H.; Shepard, R.L.; Huss-Lederman, S.

The Large-Scale Matrix Diagonalization Methods in Chemistry theory institute brought together 41 computational chemists and numerical analysts. The goal was to understand the needs of the computational chemistry community in problems that utilize matrix diagonalization techniques. This was accomplished by reviewing the current state of the art and looking toward future directions in matrix diagonalization techniques. This institute occurred about 20 years after a related meeting of similar size. During those 20 years the Davidson method continued to dominate the problem of finding a few extremal eigenvalues for many computational chemistry problems. Work on non-diagonally dominant and non-Hermitian problems asmore » well as parallel computing has also brought new methods to bear. The changes and similarities in problems and methods over the past two decades offered an interesting viewpoint for the success in this area. One important area covered by the talks was overviews of the source and nature of the chemistry problems. The numerical analysts were uniformly grateful for the efforts to convey a better understanding of the problems and issues faced in computational chemistry. An important outcome was an understanding of the wide range of eigenproblems encountered in computational chemistry. The workshop covered problems involving self- consistent-field (SCF), configuration interaction (CI), intramolecular vibrational relaxation (IVR), and scattering problems. In atomic structure calculations using the Hartree-Fock method (SCF), the symmetric matrices can range from order hundreds to thousands. These matrices often include large clusters of eigenvalues which can be as much as 25% of the spectrum. However, if Cl methods are also used, the matrix size can be between 10{sup 4} and 10{sup 9} where only one or a few extremal eigenvalues and eigenvectors are needed. Working with very large matrices has lead to the development of« less

Generalized Bloch theorem and topological characterization

NASA Astrophysics Data System (ADS)

Dobardžić, E.; Dimitrijević, M.; Milovanović, M. V.

2015-03-01

The Bloch theorem enables reduction of the eigenvalue problem of the single-particle Hamiltonian that commutes with the translational group. Based on a group theory analysis we present a generalization of the Bloch theorem that incorporates all additional symmetries of a crystal. The generalized Bloch theorem constrains the form of the Hamiltonian which becomes manifestly invariant under additional symmetries. In the case of isotropic interactions the generalized Bloch theorem gives a unique Hamiltonian. This Hamiltonian coincides with the Hamiltonian in the periodic gauge. In the case of anisotropic interactions the generalized Bloch theorem allows a family of Hamiltonians. Due to the continuity argument we expect that even in this case the Hamiltonian in the periodic gauge defines observables, such as Berry curvature, in the inverse space. For both cases we present examples and demonstrate that the average of the Berry curvatures of all possible Hamiltonians in the Bloch gauge is the Berry curvature in the periodic gauge.

Periodically driven ergodic and many-body localized quantum systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ponte, Pedro; Department of Physics and Astronomy, University of Waterloo, ON N2L 3G1; Chandran, Anushya

2015-02-15

We study dynamics of isolated quantum many-body systems whose Hamiltonian is switched between two different operators periodically in time. The eigenvalue problem of the associated Floquet operator maps onto an effective hopping problem. Using the effective model, we establish conditions on the spectral properties of the two Hamiltonians for the system to localize in energy space. We find that ergodic systems always delocalize in energy space and heat up to infinite temperature, for both local and global driving. In contrast, many-body localized systems with quenched disorder remain localized at finite energy. We support our conclusions by numerical simulations of disorderedmore » spin chains. We argue that our results hold for general driving protocols, and discuss their experimental implications.« less

Boundary Concentration for Eigenvalue Problems Related to the Onset of Superconductivity

NASA Astrophysics Data System (ADS)

del Pino, Manuel; Felmer, Patricio L.; Sternberg, Peter

We examine the asymptotic behavior of the eigenvalue μ(h) and corresponding eigenfunction associated with the variational problem in the regime h>>1. Here A is any vector field with curl equal to 1. The problem arises within the Ginzburg-Landau model for superconductivity with the function μ(h) yielding the relationship between the critical temperature vs. applied magnetic field strength in the transition from normal to superconducting state in a thin mesoscopic sample with cross-section Ω 2. We first carry out a rigorous analysis of the associated problem on a half-plane and then rigorously justify some of the formal arguments of [BS], obtaining an expansion for μ while also proving that the first eigenfunction decays to zero somewhere along the sample boundary when Ω is not a disc. For interior decay, we demonstrate that the rate is exponential.

A new method for multi-bit and qudit transfer based on commensurate waveguide arrays

NASA Astrophysics Data System (ADS)

Petrovic, J.; Veerman, J. J. P.

2018-05-01

The faithful state transfer is an important requirement in the construction of classical and quantum computers. While the high-speed transfer is realized by optical-fibre interconnects, its implementation in integrated optical circuits is affected by cross-talk. The cross-talk between densely packed optical waveguides limits the transfer fidelity and distorts the signal in each channel, thus severely impeding the parallel transfer of states such as classical registers, multiple qubits and qudits. Here, we leverage on the suitably engineered cross-talk between waveguides to achieve the parallel transfer on optical chip. Waveguide coupling coefficients are designed to yield commensurate eigenvalues of the array and hence, periodic revivals of the input state. While, in general, polynomially complex, the inverse eigenvalue problem permits analytic solutions for small number of waveguides. We present exact solutions for arrays of up to nine waveguides and use them to design realistic buses for multi-(qu)bit and qudit transfer. Advantages and limitations of the proposed solution are discussed in the context of available fabrication techniques.

Asymptotic Behaviour of the Ground State of Singularly Perturbed Elliptic Equations

NASA Astrophysics Data System (ADS)

Piatnitski, Andrey L.

The ground state of a singularly perturbed nonselfadjoint elliptic operator defined on a smooth compact Riemannian manifold with metric aij(x)=(aij(x))-1, is studied. We investigate the limiting behaviour of the first eigenvalue of this operator as μ goes to zero, and find the logarithmic asymptotics of the first eigenfunction everywhere on the manifold. The results are formulated in terms of auxiliary variational problems on the manifold. This approach also allows to study the general singularly perturbed second order elliptic operator on a bounded domain in Rn.

Viscoelastic stability in a single-screw channel flow

NASA Astrophysics Data System (ADS)

Agbessi, Y.; Bu, L. X.; Béreaux, Y.; Charmeau, J.-Y.

2018-05-01

In this work, we perform a linear stability analysis on pressure and drag flows of an Upper Convected Maxwell viscoelastic fluid. We use the well-recognised method of expanding the disturbances in Chebyschev polynomials and solve the resulting generalized eigenvalues problem with a collocation spectra method. Both the level of elasticity and the back-pressure vary. In a second stage, recent analytic solutions of viscoelastic fluid flows in slowly varying sections [1] are used to extend this stability analysis to flows in a compression or in a diverging section of a single screw channel, for example a wave mixing screw.

Aircraft model prototypes which have specified handling-quality time histories

NASA Technical Reports Server (NTRS)

Johnson, S. H.

1978-01-01

Several techniques for obtaining linear constant-coefficient airplane models from specified handling-quality time histories are discussed. The pseudodata method solves the basic problem, yields specified eigenvalues, and accommodates state-variable transfer-function zero suppression. The algebraic equations to be solved are bilinear, at worst. The disadvantages are reduced generality and no assurance that the resulting model will be airplane like in detail. The method is fully illustrated for a fourth-order stability-axis small motion model with three lateral handling quality time histories specified. The FORTRAN program which obtains and verifies the model is included and fully documented.

Metal-coated magnetic nanoparticles in an optically active medium: A nonreciprocal metamaterial

NASA Astrophysics Data System (ADS)

Christofi, Aristi; Stefanou, Nikolaos

2018-03-01

We report on the optical response of a nonreciprocal bianisotropic metamaterial, consisting of spherical, metal-coated magnetic nanoparticles embedded in an optically active medium, thus combining gyrotropy, plasmonic resonances, and chirality in a versatile design. The corresponding effective medium is deduced by an appropriate two-step generalized Maxwell-Garnett homogenization scheme. The associated photonic band structure and transmission spectra are obtained through a six-vector formulation of Maxwell equations, which provides an efficient framework for general bianisotropic structures going beyond existing approaches that involve cumbersome nonlinear eigenvalue problems. Our results, analyzed and discussed in the light of group theory, provide evidence that the proposed metamaterial exhibits some remarkable frequency-tunable properties, such as strong, plasmon-enhanced nonreciprocal polarization azimuth rotation and magnetochiral dichroism.

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

NASA Technical Reports Server (NTRS)

Mielke, R. R.; Tung, L. J.; Carraway, P. I., III

1984-01-01

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The full state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system rmain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

NASA Technical Reports Server (NTRS)

Mielke, R. R.; Tung, L. J.; Carraway, P. I., III

1985-01-01

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The fulll state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system remain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

Eigenvalues of Random Matrices with Isotropic Gaussian Noise and the Design of Diffusion Tensor Imaging Experiments.

PubMed

Gasbarra, Dario; Pajevic, Sinisa; Basser, Peter J

2017-01-01

Tensor-valued and matrix-valued measurements of different physical properties are increasingly available in material sciences and medical imaging applications. The eigenvalues and eigenvectors of such multivariate data provide novel and unique information, but at the cost of requiring a more complex statistical analysis. In this work we derive the distributions of eigenvalues and eigenvectors in the special but important case of m×m symmetric random matrices, D , observed with isotropic matrix-variate Gaussian noise. The properties of these distributions depend strongly on the symmetries of the mean tensor/matrix, D̄ . When D̄ has repeated eigenvalues, the eigenvalues of D are not asymptotically Gaussian, and repulsion is observed between the eigenvalues corresponding to the same D̄ eigenspaces. We apply these results to diffusion tensor imaging (DTI), with m = 3, addressing an important problem of detecting the symmetries of the diffusion tensor, and seeking an experimental design that could potentially yield an isotropic Gaussian distribution. In the 3-dimensional case, when the mean tensor is spherically symmetric and the noise is Gaussian and isotropic, the asymptotic distribution of the first three eigenvalue central moment statistics is simple and can be used to test for isotropy. In order to apply such tests, we use quadrature rules of order t ≥ 4 with constant weights on the unit sphere to design a DTI-experiment with the property that isotropy of the underlying true tensor implies isotropy of the Fisher information. We also explain the potential implications of the methods using simulated DTI data with a Rician noise model.

Eigenvalues of Random Matrices with Isotropic Gaussian Noise and the Design of Diffusion Tensor Imaging Experiments*

PubMed Central

Gasbarra, Dario; Pajevic, Sinisa; Basser, Peter J.

2017-01-01

Tensor-valued and matrix-valued measurements of different physical properties are increasingly available in material sciences and medical imaging applications. The eigenvalues and eigenvectors of such multivariate data provide novel and unique information, but at the cost of requiring a more complex statistical analysis. In this work we derive the distributions of eigenvalues and eigenvectors in the special but important case of m×m symmetric random matrices, D, observed with isotropic matrix-variate Gaussian noise. The properties of these distributions depend strongly on the symmetries of the mean tensor/matrix, D̄. When D̄ has repeated eigenvalues, the eigenvalues of D are not asymptotically Gaussian, and repulsion is observed between the eigenvalues corresponding to the same D̄ eigenspaces. We apply these results to diffusion tensor imaging (DTI), with m = 3, addressing an important problem of detecting the symmetries of the diffusion tensor, and seeking an experimental design that could potentially yield an isotropic Gaussian distribution. In the 3-dimensional case, when the mean tensor is spherically symmetric and the noise is Gaussian and isotropic, the asymptotic distribution of the first three eigenvalue central moment statistics is simple and can be used to test for isotropy. In order to apply such tests, we use quadrature rules of order t ≥ 4 with constant weights on the unit sphere to design a DTI-experiment with the property that isotropy of the underlying true tensor implies isotropy of the Fisher information. We also explain the potential implications of the methods using simulated DTI data with a Rician noise model. PMID:28989561

Development of a Three-Dimensional PSE Code for Compressible Flows: Stability of Three-Dimensional Compressible Boundary Layers

NASA Technical Reports Server (NTRS)

Balakumar, P.; Jeyasingham, Samarasingham

1999-01-01

A program is developed to investigate the linear stability of three-dimensional compressible boundary layer flows over bodies of revolutions. The problem is formulated as a two dimensional (2D) eigenvalue problem incorporating the meanflow variations in the normal and azimuthal directions. Normal mode solutions are sought in the whole plane rather than in a line normal to the wall as is done in the classical one dimensional (1D) stability theory. The stability characteristics of a supersonic boundary layer over a sharp cone with 50 half-angle at 2 degrees angle of attack is investigated. The 1D eigenvalue computations showed that the most amplified disturbances occur around x(sub 2) = 90 degrees and the azimuthal mode number for the most amplified disturbances range between m = -30 to -40. The frequencies of the most amplified waves are smaller in the middle region where the crossflow dominates the instability than the most amplified frequencies near the windward and leeward planes. The 2D eigenvalue computations showed that due to the variations in the azimuthal direction, the eigenmodes are clustered into isolated confined regions. For some eigenvalues, the eigenfunctions are clustered in two regions. Due to the nonparallel effect in the azimuthal direction, the eigenmodes are clustered into isolated confined regions. For some eigenvalues, the eigenfunctions are clustered in two regions. Due to the nonparallel effect in the azimuthal direction, the most amplified disturbances are shifted to 120 degrees compared to 90 degrees for the parallel theory. It is also observed that the nonparallel amplification rates are smaller than that is obtained from the parallel theory.

Sensitivity analysis for large-scale problems

NASA Technical Reports Server (NTRS)

Noor, Ahmed K.; Whitworth, Sandra L.

1987-01-01

The development of efficient techniques for calculating sensitivity derivatives is studied. The objective is to present a computational procedure for calculating sensitivity derivatives as part of performing structural reanalysis for large-scale problems. The scope is limited to framed type structures. Both linear static analysis and free-vibration eigenvalue problems are considered.

The Spectral Web of stationary plasma equilibria. I. General theory

NASA Astrophysics Data System (ADS)

Goedbloed, J. P.

2018-03-01

A new approach to computing the complex spectrum of magnetohydrodynamic waves and instabilities of moving plasmas is presented. It is based on the concept of the Spectral Web, exploiting the self-adjointness of the generalized Frieman-Rotenberg force operator, G, and the Doppler-Coriolis gradient operator parallel to the velocity, U. The problem is solved with an open boundary, where the complementary energy Wcom represents the amount of energy to be delivered to or extracted from the system to maintain a harmonic time-dependence. The eigenvalues are connected by a system of curves in the complex ω-plane, the solution path and the conjugate path (where Wcom is real or imaginary) which together constitute the Spectral Web, having a characteristic geometry that has to be clarified yet, but that has a deep physical significance. It is obtained by straightforward contour plotting of the two paths. The complex eigenvalues, within a specified rectangle of the complex ω-plane, are found by fast, reliable, and accurate iterations. Real and complex oscillation theorems, replacing the familiar tool of counting nodes of eigenfunctions, provide an associated mechanism of mode tracking along the two paths. The Spectral Web method is generalized to toroidal systems and extended to include a resistive wall by accounting for the dissipation in such a wall. It is applied in an accompanying Paper II [J. P. Goedbloed, Phys. Plasmas 25, 032110 (2018).] to a multitude of the basic fundamental instabilities operating in cylindrical plasmas.

The wasteland of random supergravities

NASA Astrophysics Data System (ADS)

Marsh, David; McAllister, Liam; Wrase, Timm

2012-03-01

We show that in a general {N} = {1} supergravity with N ≫ 1 scalar fields, an exponentially small fraction of the de Sitter critical points are metastable vacua. Taking the superpotential and Kähler potential to be random functions, we construct a random matrix model for the Hessian matrix, which is well-approximated by the sum of a Wigner matrix and two Wishart matrices. We compute the eigenvalue spectrum analytically from the free convolution of the constituent spectra and find that in typical configurations, a significant fraction of the eigenvalues are negative. Building on the Tracy-Widom law governing fluctuations of extreme eigenvalues, we determine the probability P of a large fluctuation in which all the eigenvalues become positive. Strong eigenvalue repulsion makes this extremely unlikely: we find P ∝ exp(- c N p ), with c, p being constants. For generic critical points we find p ≈ 1 .5, while for approximately-supersymmetric critical points, p ≈ 1 .3. Our results have significant implications for the counting of de Sitter vacua in string theory, but the number of vacua remains vast.

Solving large sparse eigenvalue problems on supercomputers

NASA Technical Reports Server (NTRS)

Philippe, Bernard; Saad, Youcef

1988-01-01

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.

Electrical impedance tomography in anisotropic media with known eigenvectors

NASA Astrophysics Data System (ADS)

Abascal, Juan-Felipe P. J.; Lionheart, William R. B.; Arridge, Simon R.; Schweiger, Martin; Atkinson, David; Holder, David S.

2011-06-01

Electrical impedance tomography is an imaging method, with which volumetric images of conductivity are produced by injecting electrical current and measuring boundary voltages. It has the potential to become a portable non-invasive medical imaging technique. Until now, most implementations have neglected anisotropy even though human tissues like bone, muscle and brain white matter are markedly anisotropic. The recovery of an anisotropic conductivity tensor is uniquely determined by boundary measurements only up to a diffeomorphism that fixes the boundary. Nevertheless, uniqueness can be restored by providing information about the diffeomorphism. There are uniqueness results for two constraints: one eigenvalue and a multiple scalar of a general tensor. A useable constraint for medical applications is when the eigenvectors of the underlying tissue are known, which can be approximated from MRI or estimated from DT-MRI, although the eigenvalues are unknown. However there is no known theoretical result guaranteeing uniqueness for this constraint. In fact, only a few previous inversion studies have attempted to recover one or more eigenvalues assuming certain symmetries while ignoring nonuniqueness. In this work, the aim was to undertake a numerical study of the feasibility of the recovery of a piecewise linear finite element conductivity tensor in anisotropic media with known eigenvectors from the complete boundary data. The work suggests that uniqueness holds for this constraint, in addition to proposing a methodology for the incorporation of this prior for general conductivity tensors. This was carried out by performing an analysis of the Jacobian rank and by reconstructing four conductivity distributions: two diagonal tensors whose eigenvalues were linear and sinusoidal functions, and two general tensors whose eigenvectors resembled physiological tissue, one with eigenvectors spherically orientated like a spherical layered structure, and a sample of DT-MRI data of brain white matter. The Jacobian with respect to three eigenvalues was full-rank and it was possible to recover three eigenvalues for the four simulated distributions. This encourages further theoretical study of the uniqueness for this constraint and supports the use of this as a relevant usable method for medical applications.

Rich structure in the correlation matrix spectra in non-equilibrium steady states

NASA Astrophysics Data System (ADS)

Biswas, Soham; Leyvraz, Francois; Monroy Castillero, Paulino; Seligman, Thomas H.

2017-01-01

It has been shown that, if a model displays long-range (power-law) spatial correlations, its equal-time correlation matrix will also have a power law tail in the distribution of its high-lying eigenvalues. The purpose of this paper is to show that the converse is generally incorrect: a power-law tail in the high-lying eigenvalues of the correlation matrix may exist even in the absence of equal-time power law correlations in the initial model. We may therefore view the study of the eigenvalue distribution of the correlation matrix as a more powerful tool than the study of spatial Correlations, one which may in fact uncover structure, that would otherwise not be apparent. Specifically, we show that in the Totally Asymmetric Simple Exclusion Process, whereas there are no clearly visible correlations in the steady state, the eigenvalues of its correlation matrix exhibit a rich structure which we describe in detail.

Rich structure in the correlation matrix spectra in non-equilibrium steady states.

PubMed

Biswas, Soham; Leyvraz, Francois; Monroy Castillero, Paulino; Seligman, Thomas H

2017-01-17

It has been shown that, if a model displays long-range (power-law) spatial correlations, its equal-time correlation matrix will also have a power law tail in the distribution of its high-lying eigenvalues. The purpose of this paper is to show that the converse is generally incorrect: a power-law tail in the high-lying eigenvalues of the correlation matrix may exist even in the absence of equal-time power law correlations in the initial model. We may therefore view the study of the eigenvalue distribution of the correlation matrix as a more powerful tool than the study of spatial Correlations, one which may in fact uncover structure, that would otherwise not be apparent. Specifically, we show that in the Totally Asymmetric Simple Exclusion Process, whereas there are no clearly visible correlations in the steady state, the eigenvalues of its correlation matrix exhibit a rich structure which we describe in detail.

Complex band structures of transition metal dichalcogenide monolayers with spin-orbit coupling effects

NASA Astrophysics Data System (ADS)

Szczęśniak, Dominik; Ennaoui, Ahmed; Ahzi, Saïd

2016-09-01

Recently, the transition metal dichalcogenides have attracted renewed attention due to the potential use of their low-dimensional forms in both nano- and opto-electronics. In such applications, the electronic and transport properties of monolayer transition metal dichalcogenides play a pivotal role. The present paper provides a new insight into these essential properties by studying the complex band structures of popular transition metal dichalcogenide monolayers (MX 2, where M  =  Mo, W; X  =  S, Se, Te) while including spin-orbit coupling effects. The conducted symmetry-based tight-binding calculations show that the analytical continuation from the real band structures to the complex momentum space leads to nonlinear generalized eigenvalue problems. Herein an efficient method for solving such a class of nonlinear problems is presented and yields a complete set of physically relevant eigenvalues. Solutions obtained by this method are characterized and classified into propagating and evanescent states, where the latter states manifest not only monotonic but also oscillatory decay character. It is observed that some of the oscillatory evanescent states create characteristic complex loops at the direct band gap of MX 2 monolayers, where electrons can directly tunnel between the band gap edges. To describe these tunneling currents, decay behavior of electronic states in the forbidden energy region is elucidated and their importance within the ballistic transport regime is briefly discussed.

On the Wigner law in dilute random matrices

NASA Astrophysics Data System (ADS)

Khorunzhy, A.; Rodgers, G. J.

1998-12-01

We consider ensembles of N × N symmetric matrices whose entries are weakly dependent random variables. We show that random dilution can change the limiting eigenvalue distribution of such matrices. We prove that under general and natural conditions the normalised eigenvalue counting function coincides with the semicircle (Wigner) distribution in the limit N → ∞. This can be explained by the observation that dilution (or more generally, random modulation) eliminates the weak dependence (or correlations) between random matrix entries. It also supports our earlier conjecture that the Wigner distribution is stable to random dilution and modulation.

A Well-Tempered Hybrid Method for Solving Challenging Time-Dependent Density Functional Theory (TDDFT) Systems.

PubMed

Kasper, Joseph M; Williams-Young, David B; Vecharynski, Eugene; Yang, Chao; Li, Xiaosong

2018-04-10

The time-dependent Hartree-Fock (TDHF) and time-dependent density functional theory (TDDFT) equations allow one to probe electronic resonances of a system quickly and inexpensively. However, the iterative solution of the eigenvalue problem can be challenging or impossible to converge, using standard methods such as the Davidson algorithm for spectrally dense regions in the interior of the spectrum, as are common in X-ray absorption spectroscopy (XAS). More robust solvers, such as the generalized preconditioned locally harmonic residual (GPLHR) method, can alleviate this problem, but at the expense of higher average computational cost. A hybrid method is proposed which adapts to the problem in order to maximize computational performance while providing the superior convergence of GPLHR. In addition, a modification to the GPLHR algorithm is proposed to adaptively choose the shift parameter to enforce a convergence of states above a predefined energy threshold.

Optical systolic solutions of linear algebraic equations

NASA Technical Reports Server (NTRS)

Neuman, C. P.; Casasent, D.

1984-01-01

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Numerical solution of quadratic matrix equations for free vibration analysis of structures

NASA Technical Reports Server (NTRS)

Gupta, K. K.

1975-01-01

This paper is concerned with the efficient and accurate solution of the eigenvalue problem represented by quadratic matrix equations. Such matrix forms are obtained in connection with the free vibration analysis of structures, discretized by finite 'dynamic' elements, resulting in frequency-dependent stiffness and inertia matrices. The paper presents a new numerical solution procedure of the quadratic matrix equations, based on a combined Sturm sequence and inverse iteration technique enabling economical and accurate determination of a few required eigenvalues and associated vectors. An alternative procedure based on a simultaneous iteration procedure is also described when only the first few modes are the usual requirement. The employment of finite dynamic elements in conjunction with the presently developed eigenvalue routines results in a most significant economy in the dynamic analysis of structures.

Compressed modes for variational problems in mathematical physics and compactly supported multiresolution basis for the Laplace operator

NASA Astrophysics Data System (ADS)

Ozolins, Vidvuds; Lai, Rongjie; Caflisch, Russel; Osher, Stanley

2014-03-01

We will describe a general formalism for obtaining spatially localized (``sparse'') solutions to a class of problems in mathematical physics, which can be recast as variational optimization problems, such as the important case of Schrödinger's equation in quantum mechanics. Sparsity is achieved by adding an L1 regularization term to the variational principle, which is shown to yield solutions with compact support (``compressed modes''). Linear combinations of these modes approximate the eigenvalue spectrum and eigenfunctions in a systematically improvable manner, and the localization properties of compressed modes make them an attractive choice for use with efficient numerical algorithms that scale linearly with the problem size. In addition, we introduce an L1 regularized variational framework for developing a spatially localized basis, compressed plane waves (CPWs), that spans the eigenspace of a differential operator, for instance, the Laplace operator. Our approach generalizes the concept of plane waves to an orthogonal real-space basis with multiresolution capabilities. Supported by NSF Award DMR-1106024 (VO), DOE Contract No. DE-FG02-05ER25710 (RC) and ONR Grant No. N00014-11-1-719 (SO).

Solution of Inverse Kinematics for 6R Robot Manipulators With Offset Wrist Based on Geometric Algebra.

PubMed

Fu, Zhongtao; Yang, Wenyu; Yang, Zhen

2013-08-01

In this paper, we present an efficient method based on geometric algebra for computing the solutions to the inverse kinematics problem (IKP) of the 6R robot manipulators with offset wrist. Due to the fact that there exist some difficulties to solve the inverse kinematics problem when the kinematics equations are complex, highly nonlinear, coupled and multiple solutions in terms of these robot manipulators stated mathematically, we apply the theory of Geometric Algebra to the kinematic modeling of 6R robot manipulators simply and generate closed-form kinematics equations, reformulate the problem as a generalized eigenvalue problem with symbolic elimination technique, and then yield 16 solutions. Finally, a spray painting robot, which conforms to the type of robot manipulators, is used as an example of implementation for the effectiveness and real-time of this method. The experimental results show that this method has a large advantage over the classical methods on geometric intuition, computation and real-time, and can be directly extended to all serial robot manipulators and completely automatized, which provides a new tool on the analysis and application of general robot manipulators.

On functional determinants of matrix differential operators with multiple zero modes

NASA Astrophysics Data System (ADS)

Falco, G. M.; Fedorenko, Andrei A.; Gruzberg, Ilya A.

2017-12-01

We generalize the method of computing functional determinants with a single excluded zero eigenvalue developed by McKane and Tarlie to differential operators with multiple zero eigenvalues. We derive general formulas for such functional determinants of r× r matrix second order differential operators O with 0 < n ≤slant 2r linearly independent zero modes. We separately discuss the cases of the homogeneous Dirichlet boundary conditions, when the number of zero modes cannot exceed r, and the case of twisted boundary conditions, including the periodic and anti-periodic ones, when the number of zero modes is bounded above by 2r. In all cases the determinants with excluded zero eigenvalues can be expressed only in terms of the n zero modes and other r-n or 2r-n (depending on the boundary conditions) solutions of the homogeneous equation O h=0 , in the spirit of Gel’fand-Yaglom approach. In instanton calculations, the contribution of the zero modes is taken into account by introducing the so-called collective coordinates. We show that there is a remarkable cancellation of a factor (involving scalar products of zero modes) between the Jacobian of the transformation to the collective coordinates and the functional fluctuation determinant with excluded zero eigenvalues. This cancellation drastically simplifies instanton calculations when one uses our formulas.

A differentiable reformulation for E-optimal design of experiments in nonlinear dynamic biosystems.

PubMed

Telen, Dries; Van Riet, Nick; Logist, Flip; Van Impe, Jan

2015-06-01

Informative experiments are highly valuable for estimating parameters in nonlinear dynamic bioprocesses. Techniques for optimal experiment design ensure the systematic design of such informative experiments. The E-criterion which can be used as objective function in optimal experiment design requires the maximization of the smallest eigenvalue of the Fisher information matrix. However, one problem with the minimal eigenvalue function is that it can be nondifferentiable. In addition, no closed form expression exists for the computation of eigenvalues of a matrix larger than a 4 by 4 one. As eigenvalues are normally computed with iterative methods, state-of-the-art optimal control solvers are not able to exploit automatic differentiation to compute the derivatives with respect to the decision variables. In the current paper a reformulation strategy from the field of convex optimization is suggested to circumvent these difficulties. This reformulation requires the inclusion of a matrix inequality constraint involving positive semidefiniteness. In this paper, this positive semidefiniteness constraint is imposed via Sylverster's criterion. As a result the maximization of the minimum eigenvalue function can be formulated in standard optimal control solvers through the addition of nonlinear constraints. The presented methodology is successfully illustrated with a case study from the field of predictive microbiology. Copyright © 2015. Published by Elsevier Inc.

Ambient Vibration Testing for Story Stiffness Estimation of a Heritage Timber Building

PubMed Central

Min, Kyung-Won; Kim, Junhee; Park, Sung-Ah; Park, Chan-Soo

2013-01-01

This paper investigates dynamic characteristics of a historic wooden structure by ambient vibration testing, presenting a novel estimation methodology of story stiffness for the purpose of vibration-based structural health monitoring. As for the ambient vibration testing, measured structural responses are analyzed by two output-only system identification methods (i.e., frequency domain decomposition and stochastic subspace identification) to estimate modal parameters. The proposed methodology of story stiffness is estimation based on an eigenvalue problem derived from a vibratory rigid body model. Using the identified natural frequencies, the eigenvalue problem is efficiently solved and uniquely yields story stiffness. It is noteworthy that application of the proposed methodology is not necessarily confined to the wooden structure exampled in the paper. PMID:24227999

DOE Office of Scientific and Technical Information (OSTI.GOV)

Layton, E.; Huang, Y.; Chu, S.

We show that cyclic quantum evolution can be realized and the Aharonov-Anandan (AA) geometric phase can be determined for any spin-{ital j} system driven by periodic fields. Two methods are extended for the study of this problem: the generalized spin-coherent-state technique and the Floquet quasienergy approach. Using the former approach, we have developed a {ital generalized} Bloch-sphere model and presented a SU(2) Lie-group formulation of the AA geometric phase in the spin-coherent state. We show that the AA phase is equal to {ital j} times the solid angle enclosed by the trajectory traced out by the tip of a generalizedmore » Bloch vector. General analytic formulas are obtained for the Bloch vector trajectory and the AA geometric phase in terms of external physical parameters. In addition to these findings, we have also approached the same problem from an alternative but complementary point of view without recourse to the concept of coherent-state terminology. Here we first determine the Floquet quasienergy eigenvalues and eigenvectors for the spin-{ital j} system driven by periodic fields. This in turn allows the construction of the time-evolution propagator, the total wave function, and the AA geometric phase in a more general fashion.« less

Unstable optical resonator loss calculations using the prony method.

PubMed

Siegman, A E; Miller, H Y

1970-12-01

The eigenvalues for all the significant low-order resonant modes of an unstable optical resonator with circular mirrors are computed using an eigenvalue method called the Prony method. A general equivalence relation is also given, by means of which one can obtain the design parameters for a single-ended unstable resonator of the type usually employed in practical lasers, from the calculated or tabulated values for an equivalent symmetric or double-ended unstable resonator.

On the acceleration of charged particles at relativistic shock fronts

NASA Technical Reports Server (NTRS)

Kirk, J. G.; Schneider, P.

1987-01-01

The diffusive acceleration of highly relativistic particles at a shock is reconsidered. Using the same physical assumptions as Blandford and Ostriker (1978), but dropping the restriction to nonrelativistic shock velocities, the authors find approximate solutions of the particle kinetic equation by generalizing the diffusion approximation to higher order terms in the anisotropy of the particle distribution. The general solution of the transport equation on either side of the shock is constructed, which involves the solution of an eigenvalue problem. By matching the two solutions at the shock, the spectral index of the resulting power law is found by taking into account a sufficiently large number of eigenfunctions. Low-order truncation corresponds to the standard diffusion approximation and to a somewhat more general method described by Peacock (1981). In addition to the energy spectrum, the method yields the angular distribution of the particles and its spatial dependence.

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

NASA Technical Reports Server (NTRS)

Shroff, Gautam

1989-01-01

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Studying relaxation phenomena via effective master equations

NASA Astrophysics Data System (ADS)

Chan, David; Wan, Jones T. K.; Chu, L. L.; Yu, K. W.

2000-04-01

The real-time dynamics of various relaxation phenomena can be conveniently formulated by a master equation with the enumeration of transition rates between given classes of conformations. To study the relaxation time towards equilibrium, it suffices to solve for the second largest eigenvalue of the resulting eigenvalue equation. Generally speaking, there is no analytic solution for the dynamic equation. Mean-field approaches generally yield misleading results while the presumably exact Monte-Carlo methods require prohibitive time steps in most real systems. In this work, we propose an exact decimation procedure for reducing the number of conformations significantly, while there is no loss of information, i.e., the reduced (or effective) equation is an exact transformed version of the original one. However, we have to pay the price: the initial Markovianity of the evolution equation is lost and the reduced equation contains memory terms in the transition rates. Since the transformed equation has significantly reduced number of degrees of freedom, the systems can readily be diagonalized by iterative means, to obtain the exact second largest eigenvalue and hence the relaxation time. The decimation method has been applied to various relaxation equations with generally desirable results. The advantages and limitations of the method will be discussed.

Spectral collocation for multiparameter eigenvalue problems arising from separable boundary value problems

NASA Astrophysics Data System (ADS)

Plestenjak, Bor; Gheorghiu, Călin I.; Hochstenbach, Michiel E.

2015-10-01

In numerous science and engineering applications a partial differential equation has to be solved on some fairly regular domain that allows the use of the method of separation of variables. In several orthogonal coordinate systems separation of variables applied to the Helmholtz, Laplace, or Schrödinger equation leads to a multiparameter eigenvalue problem (MEP); important cases include Mathieu's system, Lamé's system, and a system of spheroidal wave functions. Although multiparameter approaches are exploited occasionally to solve such equations numerically, MEPs remain less well known, and the variety of available numerical methods is not wide. The classical approach of discretizing the equations using standard finite differences leads to algebraic MEPs with large matrices, which are difficult to solve efficiently. The aim of this paper is to change this perspective. We show that by combining spectral collocation methods and new efficient numerical methods for algebraic MEPs it is possible to solve such problems both very efficiently and accurately. We improve on several previous results available in the literature, and also present a MATLAB toolbox for solving a wide range of problems.

Inverse resonance scattering for Jacobi operators

NASA Astrophysics Data System (ADS)

Korotyaev, E. L.

2011-12-01

The Jacobi operator ( Jf) n = a n-1 f n-1 + a n f n+1 + b n f n on ℤ with real finitely supported sequences ( a n - 1) n∈ℤ and ( b n ) n∈ℤ is considered. The inverse problem for two mappings (including their characterization): ( a n , b n , n ∈ ℤ) → {the zeros of the reflection coefficient} and ( a n , b n , n ∈ ℤ) → {the eigenvalues and the resonances} is solved. All Jacobi operators with the same eigenvalues and resonances are also described.

On Fluctuations of Eigenvalues of Random Band Matrices

NASA Astrophysics Data System (ADS)

Shcherbina, M.

2015-10-01

We consider the fluctuations of linear eigenvalue statistics of random band matrices whose entries have the form with i.i.d. possessing the th moment, where the function u has a finite support , so that M has only nonzero diagonals. The parameter b (called the bandwidth) is assumed to grow with n in a way such that . Without any additional assumptions on the growth of b we prove CLT for linear eigenvalue statistics for a rather wide class of test functions. Thus we improve and generalize the results of the previous papers (Jana et al., arXiv:1412.2445; Li et al. Random Matrices 2:04, 2013), where CLT was proven under the assumption . Moreover, we develop a method which allows to prove automatically the CLT for linear eigenvalue statistics of the smooth test functions for almost all classical models of random matrix theory: deformed Wigner and sample covariance matrices, sparse matrices, diluted random matrices, matrices with heavy tales etc.

Higher-order adaptive finite-element methods for Kohn–Sham density functional theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Motamarri, P.; Nowak, M.R.; Leiter, K.

2013-11-15

We present an efficient computational approach to perform real-space electronic structure calculations using an adaptive higher-order finite-element discretization of Kohn–Sham density-functional theory (DFT). To this end, we develop an a priori mesh-adaption technique to construct a close to optimal finite-element discretization of the problem. We further propose an efficient solution strategy for solving the discrete eigenvalue problem by using spectral finite-elements in conjunction with Gauss–Lobatto quadrature, and a Chebyshev acceleration technique for computing the occupied eigenspace. The proposed approach has been observed to provide a staggering 100–200-fold computational advantage over the solution of a generalized eigenvalue problem. Using the proposedmore » solution procedure, we investigate the computational efficiency afforded by higher-order finite-element discretizations of the Kohn–Sham DFT problem. Our studies suggest that staggering computational savings—of the order of 1000-fold—relative to linear finite-elements can be realized, for both all-electron and local pseudopotential calculations, by using higher-order finite-element discretizations. On all the benchmark systems studied, we observe diminishing returns in computational savings beyond the sixth-order for accuracies commensurate with chemical accuracy, suggesting that the hexic spectral-element may be an optimal choice for the finite-element discretization of the Kohn–Sham DFT problem. A comparative study of the computational efficiency of the proposed higher-order finite-element discretizations suggests that the performance of finite-element basis is competing with the plane-wave discretization for non-periodic local pseudopotential calculations, and compares to the Gaussian basis for all-electron calculations to within an order of magnitude. Further, we demonstrate the capability of the proposed approach to compute the electronic structure of a metallic system containing 1688 atoms using modest computational resources, and good scalability of the present implementation up to 192 processors.« less

Distorting general relativity: gravity's rainbow and f(R) theories at work

DOE Office of Scientific and Technical Information (OSTI.GOV)

Garattini, Remo, E-mail: Remo.Garattini@unibg.it

2013-06-01

We compute the Zero Point Energy in a spherically symmetric background combining the high energy distortion of Gravity's Rainbow with the modification induced by a f(R) theory. Here f(R) is a generic analytic function of the Ricci curvature scalar R in 4D and in 3D. The explicit calculation is performed for a Schwarzschild metric. Due to the spherically symmetric property of the Schwarzschild metric we can compare the effects of the modification induced by a f(R) theory in 4D and in 3D. We find that the final effect of the combined theory is to have finite quantities that shift themore » Zero Point Energy. In this context we setup a Sturm-Liouville problem with the cosmological constant considered as the associated eigenvalue. The eigenvalue equation is a reformulation of the Wheeler-DeWitt equation which is analyzed by means of a variational approach based on gaussian trial functionals. With the help of a canonical decomposition, we find that the relevant contribution to one loop is given by the graviton quantum fluctuations around the given background. A final discussion on the connection of our result with the observed cosmological constant is also reported.« less

Asymptotics for the Fredholm determinant of the sine kernel on a union of intervals

NASA Astrophysics Data System (ADS)

Widom, Harold

1995-07-01

In the bulk scaling limit of the Gaussian Unitary Ensemble of hermitian matrices the probability that an interval of length s contains no eigenvalues is the Fredholm determinant of the sine kernel{sin (x - y)}/{π (x - y)} over this interval. A formal asymptotic expansion for the determinant as s tends to infinity was obtained by Dyson. In this paper we replace a single interval of length s by sJ, where J is a union of m intervals and present a proof of the asymptotics up to second order. The logarithmic derivative with respect to s of the determinant equals a constant (expressible in terms of hyperelliptic integrals) times s, plus a bounded oscillatory function of s (zero if m=1, periodic if m=2, and in general expressible in terms of the solution of a Jacobi inversion problem), plus o(1). Also determined are the asymptotics of the trace of the resolvent operator, which is the ratio in the same model of the probability that the set contains exactly one eigenvalue to the probability that it contains none. The proofs use ideas from orthogonal polynomial theory.

Stability of streamwise vortices

NASA Technical Reports Server (NTRS)

Khorrami, M. K.; Grosch, C. E.; Ash, R. L.

1987-01-01

A brief overview of some theoretical and computational studies of the stability of streamwise vortices is given. The local induction model and classical hydrodynamic vortex stability theories are discussed in some detail. The importance of the three-dimensionality of the mean velocity profile to the results of stability calculations is discussed briefly. The mean velocity profile is provided by employing the similarity solution of Donaldson and Sullivan. The global method of Bridges and Morris was chosen for the spatial stability calculations for the nonlinear eigenvalue problem. In order to test the numerical method, a second order accurate central difference scheme was used to obtain the coefficient matrices. It was shown that a second order finite difference method lacks the required accuracy for global eigenvalue calculations. Finally the problem was formulated using spectral methods and a truncated Chebyshev series.

Local CC2 response method based on the Laplace transform: analytic energy gradients for ground and excited states.

PubMed

Ledermüller, Katrin; Schütz, Martin

2014-04-28

A multistate local CC2 response method for the calculation of analytic energy gradients with respect to nuclear displacements is presented for ground and electronically excited states. The gradient enables the search for equilibrium geometries of extended molecular systems. Laplace transform is used to partition the eigenvalue problem in order to obtain an effective singles eigenvalue problem and adaptive, state-specific local approximations. This leads to an approximation in the energy Lagrangian, which however is shown (by comparison with the corresponding gradient method without Laplace transform) to be of no concern for geometry optimizations. The accuracy of the local approximation is tested and the efficiency of the new code is demonstrated by application calculations devoted to a photocatalytic decarboxylation process of present interest.

On Instability of Geostrophic Current with Linear Vertical Shear at Length Scales of Interleaving

NASA Astrophysics Data System (ADS)

Kuzmina, N. P.; Skorokhodov, S. L.; Zhurbas, N. V.; Lyzhkov, D. A.

2018-01-01

The instability of long-wave disturbances of a geostrophic current with linear velocity shear is studied with allowance for the diffusion of buoyancy. A detailed derivation of the model problem in dimensionless variables is presented, which is used for analyzing the dynamics of disturbances in a vertically bounded layer and for describing the formation of large-scale intrusions in the Arctic basin. The problem is solved numerically based on a high-precision method developed for solving fourth-order differential equations. It is established that there is an eigenvalue in the spectrum of eigenvalues that corresponds to unstable (growing with time) disturbances, which are characterized by a phase velocity exceeding the maximum velocity of the geostrophic flow. A discussion is presented to explain some features of the instability.

Graph theory approach to the eigenvalue problem of large space structures

NASA Technical Reports Server (NTRS)

Reddy, A. S. S. R.; Bainum, P. M.

1981-01-01

Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

Modal expansions for infrasound propagation and their implications for ground-to-ground propagation.

PubMed

Waxler, Roger; Assink, Jelle; Velea, Doru

2017-02-01

The use of expansions in vertical eigenmodes for long range infrasound propagation modeling in the effective sound speed approximation is investigated. The question of convergence of such expansions is related to the maximum elevation angles that are required. Including atmospheric attenuation leads to a non-self-adjoint vertical eigenvalue problem. The use of leading order perturbation theory for the modal attenuation is compared to the results of numerical solutions to the non-self-adjoint eigenvalue problem and conditions under which the perturbative result is expected to be valid are obtained. Modal expansions are obtained in the frequency domain; broadband signals must be modeled through Fourier reconstruction. Such broadband signal reconstruction is investigated and the relation between bandwidth, wavetrain duration, and frequency sampling is discussed.

Effects of rotation and magnetic field on the onset of convective instability in a liquid layer due to buoyancy and surface tension

NASA Technical Reports Server (NTRS)

Sarma, G. S. R.

1982-01-01

Thermocapillary stability characteristics of a horizontal liquid layer heated from below rotating about a vertical axis and subjected to a uniform vertical magnetic field are analyzed under a variety of thermal and electromagnetic boundary conditions. Results based on analytical solutions to the pertinent eigenvalue problems are discussed in the light of earlier work on special cases of the more general problem considered here to show in particular the effects of the heat transfer, nonzero curvature and gravity waves at the two-fluid interface. Although the expected stabilizing action of the Coriolis and Lorentz force fields in this configuration are in evidence the optimal choice of an appropriate range for the relevant parameters is shown to be critically dependent on the interfacial effects mentioned above.

Study of modal coupling procedures for the shuttle: A matrix method for damping synthesis

NASA Technical Reports Server (NTRS)

Hasselman, T. K.

1972-01-01

The damping method was applied successfully to real structures as well as analytical models. It depends on the ability to determine an appropriate modal damping matrix for each substructure. In the past, modal damping matrices were assumed diagonal for lack of being able to determine the coupling terms which are significant in the general case of nonproportional damping. This problem was overcome by formulating the damped equations of motion as a linear perturbation of the undamped equations for light structural damping. Damped modes are defined as complex vectors derived from the complex frequency response vectors of each substructure and are obtained directly from sinusoidal vibration tests. The damped modes are used to compute first order approximations to the modal damping matrices. The perturbation approach avoids ever having to solve a complex eigenvalue problem.

Some Results on Proper Eigenvalues and Eigenvectors with Applications to Scaling.

ERIC Educational Resources Information Center

McDonald, Roderick P.; And Others

1979-01-01

Problems in avoiding the singularity problem in analyzing matrices for optimal scaling are addressed. Conditions are given under which the stationary points and values of a ratio of quadratic forms in two singular matrices can be obtained by a series of simple matrix operations. (Author/JKS)

Attractors in complex networks

NASA Astrophysics Data System (ADS)

Rodrigues, Alexandre A. P.

2017-10-01

In the framework of the generalized Lotka-Volterra model, solutions representing multispecies sequential competition can be predictable with high probability. In this paper, we show that it occurs because the corresponding "heteroclinic channel" forms part of an attractor. We prove that, generically, in an attracting heteroclinic network involving a finite number of hyperbolic and non-resonant saddle-equilibria whose linearization has only real eigenvalues, the connections corresponding to the most positive expanding eigenvalues form part of an attractor (observable in numerical simulations).

Attractors in complex networks.

PubMed

Rodrigues, Alexandre A P

2017-10-01

In the framework of the generalized Lotka-Volterra model, solutions representing multispecies sequential competition can be predictable with high probability. In this paper, we show that it occurs because the corresponding "heteroclinic channel" forms part of an attractor. We prove that, generically, in an attracting heteroclinic network involving a finite number of hyperbolic and non-resonant saddle-equilibria whose linearization has only real eigenvalues, the connections corresponding to the most positive expanding eigenvalues form part of an attractor (observable in numerical simulations).

Comparison of eigensolvers for symmetric band matrices.

PubMed

Moldaschl, Michael; Gansterer, Wilfried N

2014-09-15

We compare different algorithms for computing eigenvalues and eigenvectors of a symmetric band matrix across a wide range of synthetic test problems. Of particular interest is a comparison of state-of-the-art tridiagonalization-based methods as implemented in Lapack or Plasma on the one hand, and the block divide-and-conquer (BD&C) algorithm as well as the block twisted factorization (BTF) method on the other hand. The BD&C algorithm does not require tridiagonalization of the original band matrix at all, and the current version of the BTF method tridiagonalizes the original band matrix only for computing the eigenvalues. Avoiding the tridiagonalization process sidesteps the cost of backtransformation of the eigenvectors. Beyond that, we discovered another disadvantage of the backtransformation process for band matrices: In several scenarios, a lot of gradual underflow is observed in the (optional) accumulation of the transformation matrix and in the (obligatory) backtransformation step. According to the IEEE 754 standard for floating-point arithmetic, this implies many operations with subnormal (denormalized) numbers, which causes severe slowdowns compared to the other algorithms without backtransformation of the eigenvectors. We illustrate that in these cases the performance of existing methods from Lapack and Plasma reaches a competitive level only if subnormal numbers are disabled (and thus the IEEE standard is violated). Overall, our performance studies illustrate that if the problem size is large enough relative to the bandwidth, BD&C tends to achieve the highest performance of all methods if the spectrum to be computed is clustered. For test problems with well separated eigenvalues, the BTF method tends to become the fastest algorithm with growing problem size.

Acoustic modes in fluid networks

NASA Technical Reports Server (NTRS)

Michalopoulos, C. D.; Clark, Robert W., Jr.; Doiron, Harold H.

1992-01-01

Pressure and flow rate eigenvalue problems for one-dimensional flow of a fluid in a network of pipes are derived from the familiar transmission line equations. These equations are linearized by assuming small velocity and pressure oscillations about mean flow conditions. It is shown that the flow rate eigenvalues are the same as the pressure eigenvalues and the relationship between line pressure modes and flow rate modes is established. A volume at the end of each branch is employed which allows any combination of boundary conditions, from open to closed, to be used. The Jacobi iterative method is used to compute undamped natural frequencies and associated pressure/flow modes. Several numerical examples are presented which include acoustic modes for the Helium Supply System of the Space Shuttle Orbiter Main Propulsion System. It should be noted that the method presented herein can be applied to any one-dimensional acoustic system involving an arbitrary number of branches.

The eigenvalue spectrum of the Orr-Sommerfeld problem

NASA Technical Reports Server (NTRS)

Antar, B. N.

1976-01-01

A numerical investigation of the temporal eigenvalue spectrum of the ORR-Sommerfeld equation is presented. Two flow profiles are studied, the plane Poiseuille flow profile and the Blasius boundary layer (parallel): flow profile. In both cases a portion of the complex c-plane bounded by 0 less than or equal to CR sub r 1 and -1 less than or equal to ci sub i 0 is searched and the eigenvalues within it are identified. The spectra for the plane Poiseuille flow at alpha = 1.0 and R = 100, 1000, 6000, and 10000 are determined and compared with existing results where possible. The spectrum for the Blasius boundary layer flow at alpha = 0.308 and R = 998 was found to be infinite and discrete. Other spectra for the Blasius boundary layer at various Reynolds numbers seem to confirm this result. The eigenmodes belonging to these spectra were located and discussed.

A Few New 2+1-Dimensional Nonlinear Dynamics and the Representation of Riemann Curvature Tensors

NASA Astrophysics Data System (ADS)

Wang, Yan; Zhang, Yufeng; Zhang, Xiangzhi

2016-09-01

We first introduced a linear stationary equation with a quadratic operator in ∂x and ∂y, then a linear evolution equation is given by N-order polynomials of eigenfunctions. As applications, by taking N=2, we derived a (2+1)-dimensional generalized linear heat equation with two constant parameters associative with a symmetric space. When taking N=3, a pair of generalized Kadomtsev-Petviashvili equations with the same eigenvalues with the case of N=2 are generated. Similarly, a second-order flow associative with a homogeneous space is derived from the integrability condition of the two linear equations, which is a (2+1)-dimensional hyperbolic equation. When N=3, the third second flow associative with the homogeneous space is generated, which is a pair of new generalized Kadomtsev-Petviashvili equations. Finally, as an application of a Hermitian symmetric space, we established a pair of spectral problems to obtain a new (2+1)-dimensional generalized Schrödinger equation, which is expressed by the Riemann curvature tensors.

ELSI: A unified software interface for Kohn–Sham electronic structure solvers

DOE PAGES

Yu, Victor Wen-zhe; Corsetti, Fabiano; Garcia, Alberto; ...

2017-09-15

Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aimsmore » to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. As a result, comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.« less

ELSI: A unified software interface for Kohn-Sham electronic structure solvers

NASA Astrophysics Data System (ADS)

Yu, Victor Wen-zhe; Corsetti, Fabiano; García, Alberto; Huhn, William P.; Jacquelin, Mathias; Jia, Weile; Lange, Björn; Lin, Lin; Lu, Jianfeng; Mi, Wenhui; Seifitokaldani, Ali; Vázquez-Mayagoitia, Álvaro; Yang, Chao; Yang, Haizhao; Blum, Volker

2018-01-01

Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aims to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. Comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.

ELSI: A unified software interface for Kohn–Sham electronic structure solvers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yu, Victor Wen-zhe; Corsetti, Fabiano; Garcia, Alberto

Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aimsmore » to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. As a result, comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.« less

Large space structure damping design

NASA Technical Reports Server (NTRS)

Pilkey, W. D.; Haviland, J. K.

1983-01-01

Several FORTRAN subroutines and programs were developed which compute complex eigenvalues of a damped system using different approaches, and which rescale mode shapes to unit generalized mass and make rigid bodies orthogonal to each other. An analytical proof of a Minimum Constrained Frequency Criterion (MCFC) for a single damper is presented. A method to minimize the effect of control spill-over for large space structures is proposed. The characteristic equation of an undamped system with a generalized control law is derived using reanalysis theory. This equation can be implemented in computer programs for efficient eigenvalue analysis or control quasi synthesis. Methods to control vibrations in large space structure are reviewed and analyzed. The resulting prototype, using electromagnetic actuator, is described.

The inviscid axisymmetric stability of the supersonic flow along a circular cylinder

NASA Technical Reports Server (NTRS)

Duck, Peter W.

1990-01-01

The supersonic flow past a thin straight circular cylinder is investigated. The associated boundary-layer flow (i.e. the velocity and temperature field) is computed; the asymptotic, far downstream solution is obtained, and compared with the full numerical results. The inviscid, linear, axisymmetric (temporal) stability of this boundary layer is also studied. A so-called 'doubly generalized' inflexion condition is derived, which is a condition for the existence of so-called 'subsonic' neutral modes. The eigenvalue problem (for the complex wavespeed) is computed for two free-stream Mach numbers (2.8 and 3.8), and this reveals that curvature has a profound effect on the stability of the flow. The first unstable inviscid mode is seen to disappear rapidly as curvature is introduced, while the second (and generally the most important) mode suffers a substantially reduced amplification rate.

The inviscid axisymmetric stability of the supersonic flow along a circular cylinder

NASA Technical Reports Server (NTRS)

Duck, Peter W.

1989-01-01

The supersonic flow past a thin straight circular cylinder is investigated. The associated boundary layer flow (i.e., the velocity and temperature field) is computed; the asymptotic, far downstream solution is obtained, and compared with the full numerical results. The inviscid, linear, axisymmetric (temporal) stability of this boundary layer is also studied. A so called doubly generalized inflexion condition is derived, which is a condition for the existence of so called subsonic neutral modes. The eigenvalue problem (for the complex wavespeed) is computed for two freestream Mach numbers (2.8 and 3.8), and this reveals that curvature has a profound effect on the stability of the flow. The first unstable inviscid mode is seen to rapidly disappear as curvature is introduced, while the second (and generally the most important) mode suffers a substantially reduced amplification rate.

Implicit treatment of diffusion terms in lower-upper algorithms

NASA Technical Reports Server (NTRS)

Shih, T. I.-P.; Steinthorsson, E.; Chyu, W. J.

1993-01-01

A method is presented which allows diffusion terms to be treated implicitly in the lower-upper (LU) algorithm (which is a commonly used method for solving 'compressible' Euler and Navier-Stokes equations) so that the algorithm's good stability properties will not be impaired. The new method generalizes the concept of LU factorization from that associated with the sign of eigenvalues to that associated with backward- and forward-difference operators without regard to eigenvalues. The method is verified in a turbulent boundary layer study.

Evaluation of RAPID for a UNF cask benchmark problem

NASA Astrophysics Data System (ADS)

Mascolino, Valerio; Haghighat, Alireza; Roskoff, Nathan J.

2017-09-01

This paper examines the accuracy and performance of the RAPID (Real-time Analysis for Particle transport and In-situ Detection) code system for the simulation of a used nuclear fuel (UNF) cask. RAPID is capable of determining eigenvalue, subcritical multiplication, and pin-wise, axially-dependent fission density throughout a UNF cask. We study the source convergence based on the analysis of the different parameters used in an eigenvalue calculation in the MCNP Monte Carlo code. For this study, we consider a single assembly surrounded by absorbing plates with reflective boundary conditions. Based on the best combination of eigenvalue parameters, a reference MCNP solution for the single assembly is obtained. RAPID results are in excellent agreement with the reference MCNP solutions, while requiring significantly less computation time (i.e., minutes vs. days). A similar set of eigenvalue parameters is used to obtain a reference MCNP solution for the whole UNF cask. Because of time limitation, the MCNP results near the cask boundaries have significant uncertainties. Except for these, the RAPID results are in excellent agreement with the MCNP predictions, and its computation time is significantly lower, 35 second on 1 core versus 9.5 days on 16 cores.

Closed-form eigensolutions of nonviscously, nonproportionally damped systems based on continuous damping sensitivity

NASA Astrophysics Data System (ADS)

Lázaro, Mario

2018-01-01

In this paper, nonviscous, nonproportional, vibrating structures are considered. Nonviscously damped systems are characterized by dissipative mechanisms which depend on the history of the response velocities via hereditary kernel functions. Solutions of the free motion equation lead to a nonlinear eigenvalue problem involving mass, stiffness and damping matrices. Viscoelasticity leads to a frequency dependence of this latter. In this work, a novel closed-form expression to estimate complex eigenvalues is derived. The key point is to consider the damping model as perturbed by a continuous fictitious parameter. Assuming then the eigensolutions as function of this parameter, the computation of the eigenvalues sensitivity leads to an ordinary differential equation, from whose solution arises the proposed analytical formula. The resulting expression explicitly depends on the viscoelasticity (frequency derivatives of the damping function), the nonproportionality (influence of the modal damping matrix off-diagonal terms). Eigenvectors are obtained using existing methods requiring only the corresponding eigenvalue. The method is validated using a numerical example which compares proposed with exact ones and with those determined from the linear first order approximation in terms of the damping matrix. Frequency response functions are also plotted showing that the proposed approach is valid even for moderately or highly damped systems.

Rational approximations from power series of vector-valued meromorphic functions

NASA Technical Reports Server (NTRS)

Sidi, Avram

1992-01-01

Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.

Predicting breast cancer using an expression values weighted clinical classifier.

PubMed

Thomas, Minta; De Brabanter, Kris; Suykens, Johan A K; De Moor, Bart

2014-12-31

Clinical data, such as patient history, laboratory analysis, ultrasound parameters-which are the basis of day-to-day clinical decision support-are often used to guide the clinical management of cancer in the presence of microarray data. Several data fusion techniques are available to integrate genomics or proteomics data, but only a few studies have created a single prediction model using both gene expression and clinical data. These studies often remain inconclusive regarding an obtained improvement in prediction performance. To improve clinical management, these data should be fully exploited. This requires efficient algorithms to integrate these data sets and design a final classifier. LS-SVM classifiers and generalized eigenvalue/singular value decompositions are successfully used in many bioinformatics applications for prediction tasks. While bringing up the benefits of these two techniques, we propose a machine learning approach, a weighted LS-SVM classifier to integrate two data sources: microarray and clinical parameters. We compared and evaluated the proposed methods on five breast cancer case studies. Compared to LS-SVM classifier on individual data sets, generalized eigenvalue decomposition (GEVD) and kernel GEVD, the proposed weighted LS-SVM classifier offers good prediction performance, in terms of test area under ROC Curve (AUC), on all breast cancer case studies. Thus a clinical classifier weighted with microarray data set results in significantly improved diagnosis, prognosis and prediction responses to therapy. The proposed model has been shown as a promising mathematical framework in both data fusion and non-linear classification problems.

A general MHD formulation for plasmas with flow and resistive walls

DOE Office of Scientific and Technical Information (OSTI.GOV)

Guazzotto, L.; Freidberg, J. P.; Betti, R.

2006-11-30

Toroidal rotation, either induced by means of neutral beams (e.g. in NSTX and DIII-D) or appearing spontaneously (e.g. in Alcator C-Mod, JET and Tore Supra) is routinely observed in modem tokamak experiments. Poloidal rotation is also commonly observed, in particular in the edge region of the plasma. Plasma rotation has a major effect on plasma stability. Flow and flow shear stabilize external modes such as the resistive wall mode (as observed e.g. in DIII-D), suppress turbulence when the flow shear is large enough, and also have a significant influence on the stability and nonlinear evolution of the internal kink andmore » ballooning modes. Flow shear can in particular have both a stabilizing (by breaking up unstable structures) and destabilizing (through the Kelvin-Helmoltz mechanism) effect. A self-consistent analysis of the effect of rotation requires the use of numerical tools. In this work, we present a general eigenvalue formulation based on a variational principle stability analysis, including arbitrary (both toroidal and poloidal) plasma rotation and a thin resistive wall of arbitrary shape and resistivity. It is shown that the problem can always be reduced to a classic eigenvalue formulation of the kind i{omega}A double underbar {center_dot} {zeta}-vector = B double underbar {center_dot} {zeta}-vector, where {zeta}-vector is the unknown eigenvector related to the plasma displacement, and {omega} the (complex) evolution frequency of the perturbation. The formulation is well suited for a finite element analysis.« less

Coupled radial Schrödinger equations written as Dirac-type equations: application to an amplitude-phase approach

NASA Astrophysics Data System (ADS)

Thylwe, Karl-Erik; McCabe, Patrick

2012-04-01

The classical amplitude-phase method due to Milne, Wilson, Young and Wheeler in the 1930s is known to be a powerful computational tool for determining phase shifts and energy eigenvalues in cases where a sufficiently slowly varying amplitude function can be found. The key for the efficient computations is that the original single-state radial Schrödinger equation is transformed to a nonlinear equation, the Milne equation. Such an equation has solutions that may or may not oscillate, depending on boundary conditions, which then requires a robust recipe for locating the (optimal) ‘almost constant’ solutions for its use in the method. For scattering problems the solutions of the amplitude equations always approach constants as the radial distance r tends to infinity, and there is no problem locating the ‘optimal’ amplitude functions from a low-order semiclassical approximation. In the present work, the amplitude-phase approach is generalized to two coupled Schrödinger equations similar to an earlier generalization to radial Dirac equations. The original scalar amplitude then becomes a vector quantity, and the original Milne equation is generalized accordingly. Numerical applications to resonant electron-atom scattering are illustrated.

The Effect of Stochastic Perturbation of Fuel Distribution on the Criticality of a One Speed Reactor and the Development of Multi-Material Multinomial Line Statistics

NASA Technical Reports Server (NTRS)

Jahshan, S. N.; Singleterry, R. C.

2001-01-01

The effect of random fuel redistribution on the eigenvalue of a one-speed reactor is investigated. An ensemble of such reactors that are identical to a homogeneous reference critical reactor except for the fissile isotope density distribution is constructed such that it meets a set of well-posed redistribution requirements. The average eigenvalue, , is evaluated when the total fissile loading per ensemble element, or realization, is conserved. The perturbation is proven to increase the reactor criticality on average when it is uniformly distributed. The various causes of the change in reactivity, and their relative effects are identified and ranked. From this, a path towards identifying the causes. and relative effects of reactivity fluctuations for the energy dependent problem is pointed to. The perturbation method of using multinomial distributions for representing the perturbed reactor is developed. This method has some advantages that can be of use in other stochastic problems. Finally, some of the features of this perturbation problem are related to other techniques that have been used for addressing similar problems.

Continuous-energy eigenvalue sensitivity coefficient calculations in TSUNAMI-3D

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perfetti, C. M.; Rearden, B. T.

2013-07-01

Two methods for calculating eigenvalue sensitivity coefficients in continuous-energy Monte Carlo applications were implemented in the KENO code within the SCALE code package. The methods were used to calculate sensitivity coefficients for several test problems and produced sensitivity coefficients that agreed well with both reference sensitivities and multigroup TSUNAMI-3D sensitivity coefficients. The newly developed CLUTCH method was observed to produce sensitivity coefficients with high figures of merit and a low memory footprint, and both continuous-energy sensitivity methods met or exceeded the accuracy of the multigroup TSUNAMI-3D calculations. (authors)

A Riemann solver for RANS

NASA Astrophysics Data System (ADS)

Chuvakhov, P. V.

2014-01-01

An exact expression for a system of both eigenvalues and right/left eigenvectors of a Jacobian matrix for a convective two-equation differential closure RANS operator split along a curvilinear coordinate is derived. It is shown by examples of numerical modeling of supersonic flows over a flat plate and a compression corner with separation that application of the exact system of eigenvalues and eigenvectors to the Roe approach for approximate solution of the Riemann problem gives rise to an increase in the convergence rate, better stability and higher accuracy of a steady-state solution in comparison with those in the case of an approximate system.

COSAL: A black-box compressible stability analysis code for transition prediction in three-dimensional boundary layers

NASA Technical Reports Server (NTRS)

Malik, M. R.

1982-01-01

A fast computer code COSAL for transition prediction in three dimensional boundary layers using compressible stability analysis is described. The compressible stability eigenvalue problem is solved using a finite difference method, and the code is a black box in the sense that no guess of the eigenvalue is required from the user. Several optimization procedures were incorporated into COSAL to calculate integrated growth rates (N factor) for transition correlation for swept and tapered laminar flow control wings using the well known e to the Nth power method. A user's guide to the program is provided.

Sensitivity analysis of hydrodynamic stability operators

NASA Technical Reports Server (NTRS)

Schmid, Peter J.; Henningson, Dan S.; Khorrami, Mehdi R.; Malik, Mujeeb R.

1992-01-01

The eigenvalue sensitivity for hydrodynamic stability operators is investigated. Classical matrix perturbation techniques as well as the concept of epsilon-pseudoeigenvalues are applied to show that parts of the spectrum are highly sensitive to small perturbations. Applications are drawn from incompressible plane Couette, trailing line vortex flow and compressible Blasius boundary layer flow. Parametric studies indicate a monotonically increasing effect of the Reynolds number on the sensitivity. The phenomenon of eigenvalue sensitivity is due to the non-normality of the operators and their discrete matrix analogs and may be associated with large transient growth of the corresponding initial value problem.

Development of a SCALE Tool for Continuous-Energy Eigenvalue Sensitivity Coefficient Calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perfetti, Christopher M; Rearden, Bradley T

2013-01-01

Two methods for calculating eigenvalue sensitivity coefficients in continuous-energy Monte Carlo applications were implemented in the KENO code within the SCALE code package. The methods were used to calculate sensitivity coefficients for several criticality safety problems and produced sensitivity coefficients that agreed well with both reference sensitivities and multigroup TSUNAMI-3D sensitivity coefficients. The newly developed CLUTCH method was observed to produce sensitivity coefficients with high figures of merit and low memory requirements, and both continuous-energy sensitivity methods met or exceeded the accuracy of the multigroup TSUNAMI-3D calculations.

Quantization with maximally degenerate Poisson brackets: the harmonic oscillator!

NASA Astrophysics Data System (ADS)

Nutku, Yavuz

2003-07-01

Nambu's construction of multi-linear brackets for super-integrable systems can be thought of as degenerate Poisson brackets with a maximal set of Casimirs in their kernel. By introducing privileged coordinates in phase space these degenerate Poisson brackets are brought to the form of Heisenberg's equations. We propose a definition for constructing quantum operators for classical functions, which enables us to turn the maximally degenerate Poisson brackets into operators. They pose a set of eigenvalue problems for a new state vector. The requirement of the single-valuedness of this eigenfunction leads to quantization. The example of the harmonic oscillator is used to illustrate this general procedure for quantizing a class of maximally super-integrable systems.

Constrained multibody system dynamics: An automated approach

NASA Technical Reports Server (NTRS)

Kamman, J. W.; Huston, R. L.

1982-01-01

The governing equations for constrained multibody systems are formulated in a manner suitable for their automated, numerical development and solution. The closed loop problem of multibody chain systems is addressed. The governing equations are developed by modifying dynamical equations obtained from Lagrange's form of d'Alembert's principle. The modifications is based upon a solution of the constraint equations obtained through a zero eigenvalues theorem, is a contraction of the dynamical equations. For a system with n-generalized coordinates and m-constraint equations, the coefficients in the constraint equations may be viewed as constraint vectors in n-dimensional space. In this setting the system itself is free to move in the n-m directions which are orthogonal to the constraint vectors.

Vibration properties of and power harvested by a system of electromagnetic vibration energy harvesters that have electrical dynamics

NASA Astrophysics Data System (ADS)

Cooley, Christopher G.

2017-09-01

This study investigates the vibration and dynamic response of a system of coupled electromagnetic vibration energy harvesting devices that each consist of a proof mass, elastic structure, electromagnetic generator, and energy harvesting circuit with inductance, resistance, and capacitance. The governing equations for the coupled electromechanical system are derived using Newtonian mechanics and Kirchhoff circuit laws for an arbitrary number of these subsystems. The equations are cast in matrix operator form to expose the device's vibration properties. The device's complex-valued eigenvalues and eigenvectors are related to physical characteristics of its vibration. Because the electrical circuit has dynamics, these devices have more natural frequencies than typical electromagnetic vibration energy harvesters that have purely resistive circuits. Closed-form expressions for the steady state dynamic response and average power harvested are derived for devices with a single subsystem. Example numerical results for single and double subsystem devices show that the natural frequencies and vibration modes obtained from the eigenvalue problem agree with the resonance locations and response amplitudes obtained independently from forced response calculations. This agreement demonstrates the usefulness of solving eigenvalue problems for these devices. The average power harvested by the device differs substantially at each resonance. Devices with multiple subsystems have multiple modes where large amounts of power are harvested.

Eigenvector dynamics: General theory and some applications

NASA Astrophysics Data System (ADS)

Allez, Romain; Bouchaud, Jean-Philippe

2012-10-01

We propose a general framework to study the stability of the subspace spanned by P consecutive eigenvectors of a generic symmetric matrix H0 when a small perturbation is added. This problem is relevant in various contexts, including quantum dissipation (H0 is then the Hamiltonian) and financial risk control (in which case H0 is the assets' return covariance matrix). We argue that the problem can be formulated in terms of the singular values of an overlap matrix, which allows one to define an overlap distance. We specialize our results for the case of a Gaussian orthogonal H0, for which the full spectrum of singular values can be explicitly computed. We also consider the case when H0 is a covariance matrix and illustrate the usefulness of our results using financial data. The special case where the top eigenvalue is much larger than all the other ones can be investigated in full detail. In particular, the dynamics of the angle made by the top eigenvector and its true direction defines an interesting class of random processes.

Some problems in applications of the linear variational method

NASA Astrophysics Data System (ADS)

Pupyshev, Vladimir I.; Montgomery, H. E.

2015-09-01

The linear variational method is a standard computational method in quantum mechanics and quantum chemistry. As taught in most classes, the general guidance is to include as many basis functions as practical in the variational wave function. However, if it is desired to study the patterns of energy change accompanying the change of system parameters such as the shape and strength of the potential energy, the problem becomes more complicated. We use one-dimensional systems with a particle in a rectangular or in a harmonic potential confined in an infinite rectangular box to illustrate situations where a variational calculation can give incorrect results. These situations result when the energy of the lowest eigenvalue is strongly dependent on the parameters that describe the shape and strength of the potential. The numerical examples described in this work are provided as cautionary notes for practitioners of numerical variational calculations.

More insights into early brain development through statistical analyses of eigen-structural elements of diffusion tensor imaging using multivariate adaptive regression splines

PubMed Central

Chen, Yasheng; Zhu, Hongtu; An, Hongyu; Armao, Diane; Shen, Dinggang; Gilmore, John H.; Lin, Weili

2013-01-01

The aim of this study was to characterize the maturational changes of the three eigenvalues (λ1 ≥ λ2 ≥ λ3) of diffusion tensor imaging (DTI) during early postnatal life for more insights into early brain development. In order to overcome the limitations of using presumed growth trajectories for regression analysis, we employed Multivariate Adaptive Regression Splines (MARS) to derive data-driven growth trajectories for the three eigenvalues. We further employed Generalized Estimating Equations (GEE) to carry out statistical inferences on the growth trajectories obtained with MARS. With a total of 71 longitudinal datasets acquired from 29 healthy, full-term pediatric subjects, we found that the growth velocities of the three eigenvalues were highly correlated, but significantly different from each other. This paradox suggested the existence of mechanisms coordinating the maturations of the three eigenvalues even though different physiological origins may be responsible for their temporal evolutions. Furthermore, our results revealed the limitations of using the average of λ2 and λ3 as the radial diffusivity in interpreting DTI findings during early brain development because these two eigenvalues had significantly different growth velocities even in central white matter. In addition, based upon the three eigenvalues, we have documented the growth trajectory differences between central and peripheral white matter, between anterior and posterior limbs of internal capsule, and between inferior and superior longitudinal fasciculus. Taken together, we have demonstrated that more insights into early brain maturation can be gained through analyzing eigen-structural elements of DTI. PMID:23455648

On the linear stability of blood flow through model capillary networks.

PubMed

Davis, Jeffrey M

2014-12-01

Under the approximation that blood behaves as a continuum, a numerical implementation is presented to analyze the linear stability of capillary blood flow through model tree and honeycomb networks that are based on the microvascular structures of biological tissues. The tree network is comprised of a cascade of diverging bifurcations, in which a parent vessel bifurcates into two descendent vessels, while the honeycomb network also contains converging bifurcations, in which two parent vessels merge into one descendent vessel. At diverging bifurcations, a cell partitioning law is required to account for the nonuniform distribution of red blood cells as a function of the flow rate of blood into each descendent vessel. A linearization of the governing equations produces a system of delay differential equations involving the discharge hematocrit entering each network vessel and leads to a nonlinear eigenvalue problem. All eigenvalues in a specified region of the complex plane are captured using a transformation based on contour integrals to construct a linear eigenvalue problem with identical eigenvalues, which are then determined using a standard QR algorithm. The predicted value of the dimensionless exponent in the cell partitioning law at the instability threshold corresponds to a supercritical Hopf bifurcation in numerical simulations of the equations governing unsteady blood flow. Excellent agreement is found between the predictions of the linear stability analysis and nonlinear simulations. The relaxation of the assumption of plug flow made in previous stability analyses typically has a small, quantitative effect on the stability results that depends on the specific network structure. This implementation of the stability analysis can be applied to large networks with arbitrary structure provided only that the connectivity among the network segments is known.

Numerical methods in Markov chain modeling

NASA Technical Reports Server (NTRS)

Philippe, Bernard; Saad, Youcef; Stewart, William J.

1989-01-01

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Fast Kalman Filter for Random Walk Forecast model

NASA Astrophysics Data System (ADS)

Saibaba, A.; Kitanidis, P. K.

2013-12-01

Kalman filtering is a fundamental tool in statistical time series analysis to understand the dynamics of large systems for which limited, noisy observations are available. However, standard implementations of the Kalman filter are prohibitive because they require O(N^2) in memory and O(N^3) in computational cost, where N is the dimension of the state variable. In this work, we focus our attention on the Random walk forecast model which assumes the state transition matrix to be the identity matrix. This model is frequently adopted when the data is acquired at a timescale that is faster than the dynamics of the state variables and there is considerable uncertainty as to the physics governing the state evolution. We derive an efficient representation for the a priori and a posteriori estimate covariance matrices as a weighted sum of two contributions - the process noise covariance matrix and a low rank term which contains eigenvectors from a generalized eigenvalue problem, which combines information from the noise covariance matrix and the data. We describe an efficient algorithm to update the weights of the above terms and the computation of eigenmodes of the generalized eigenvalue problem (GEP). The resulting algorithm for the Kalman filter with Random walk forecast model scales as O(N) or O(N log N), both in memory and computational cost. This opens up the possibility of real-time adaptive experimental design and optimal control in systems of much larger dimension than was previously feasible. For a small number of measurements (~ 300 - 400), this procedure can be made numerically exact. However, as the number of measurements increase, for several choices of measurement operators and noise covariance matrices, the spectrum of the (GEP) decays rapidly and we are justified in only retaining the dominant eigenmodes. We discuss tradeoffs between accuracy and computational cost. The resulting algorithms are applied to an example application from ray-based travel time tomography.

Issac, Jason Cherian ses in transonic flow

NASA Technical Reports Server (NTRS)

Issac, Jason Cherion; Kapania, Rakesh K.

1993-01-01

Flutter analysis of a two degree of freedom airfoil in compressible flow is performed using a state-space representation of the unsteady aerodynamic behavior. Indicial response functions are used to represent the normal force and moment response of the airfoil. The structural equations of motion of the airfoil with bending and torsional degrees of freedom are coupled to the unsteady air loads and the aeroelastic system so modelled is solved as an eigenvalue problem to determine the stability. The aeroelastic equations are also directly integrated with respect to time and the time-domain results compared with the results from the eigenanalysis. A good agreement is obtained. The derivatives of the flutter speed obtained from the eigenanalysis are calculated with respect to the mass and stiffness parameters by both analytical and finite-difference methods for various transonic Mach numbers. The experience gained from the two degree of freedom model is applied to study the sensitivity of the flutter response of a wing with respect to various shape parameters. The parameters being considered are as follows: (1) aspect ratio; (2) surface area of the wing; (3) taper ratio; and (4) sweep. The wing deflections are represented by Chebyshev polynomials. The compressible aerodynamic state-space model used for the airfoil section is extended to represent the unsteady aerodynamic forces on a generally laminated tapered skewed wing. The aeroelastic equations are solved as an eigenvalue problem to determine the flutter speed of the wing. The derivatives of the flutter speed with respect to the shape parameters are calculated by both analytical and finite difference methods.

Study of a mixed dispersal population dynamics model

DOE PAGES

Chugunova, Marina; Jadamba, Baasansuren; Kao, Chiu -Yen; ...

2016-08-27

In this study, we consider a mixed dispersal model with periodic and Dirichlet boundary conditions and its corresponding linear eigenvalue problem. This model describes the time evolution of a population which disperses both locally and non-locally. We investigate how long time dynamics depend on the parameter values. Furthermore, we study the minimization of the principal eigenvalue under the constraints that the resource function is bounded from above and below, and with a fixed total integral. Biologically, this minimization problem is motivated by the question of determining the optimal spatial arrangement of favorable and unfavorable regions for the species to diemore » out more slowly or survive more easily. Our numerical simulations indicate that the optimal favorable region tends to be a simply-connected domain. Numerous results are shown to demonstrate various scenarios of optimal favorable regions for periodic and Dirichlet boundary conditions.« less

Numerical solution of the nonlinear Schrodinger equation by feedforward neural networks

NASA Astrophysics Data System (ADS)

Shirvany, Yazdan; Hayati, Mohsen; Moradian, Rostam

2008-12-01

We present a method to solve boundary value problems using artificial neural networks (ANN). A trial solution of the differential equation is written as a feed-forward neural network containing adjustable parameters (the weights and biases). From the differential equation and its boundary conditions we prepare the energy function which is used in the back-propagation method with momentum term to update the network parameters. We improved energy function of ANN which is derived from Schrodinger equation and the boundary conditions. With this improvement of energy function we can use unsupervised training method in the ANN for solving the equation. Unsupervised training aims to minimize a non-negative energy function. We used the ANN method to solve Schrodinger equation for few quantum systems. Eigenfunctions and energy eigenvalues are calculated. Our numerical results are in agreement with their corresponding analytical solution and show the efficiency of ANN method for solving eigenvalue problems.

A new method for determining acoustic-liner admittance in a rectangular duct with grazing flow from experimental data

NASA Technical Reports Server (NTRS)

Watson, W. R.

1984-01-01

A method is developed for determining acoustic liner admittance in a rectangular duct with grazing flow. The axial propagation constant, cross mode order, and mean flow profile is measured. These measured data are then input into an analytical program which determines the unknown admittance value. The analytical program is based upon a finite element discretization of the acoustic field and a reposing of the unknown admittance value as a linear eigenvalue problem on the admittance value. Gaussian elimination is employed to solve this eigenvalue problem. The method used is extendable to grazing flows with boundary layers in both transverse directions of an impedance tube (or duct). Predicted admittance values are compared both with exact values that can be obtained for uniform mean flow profiles and with those from a Runge Kutta integration technique for cases involving a one dimensional boundary layer.

Pressure distribution under flexible polishing tools. II - Cylindrical (conical) optics

NASA Astrophysics Data System (ADS)

Mehta, Pravin K.

1990-10-01

A previously developed eigenvalue model is extended to determine polishing pressure distribution by rectangular tools with unequal stiffness in two directions on cylindrical optics. Tool misfit is divided into two simplified one-dimensional problems and one simplified two-dimensional problem. Tools with nonuniform cross-sections are treated with a new one-dimensional eigenvalue algorithm, permitting evaluation of tool designs where the edge is more flexible than the interior. This maintains edge pressure variations within acceptable parameters. Finite element modeling is employed to resolve upper bounds, which handle pressure changes in the two-dimensional misfit element. Paraboloids and hyperboloids from the NASA AXAF system are treated with the AXAFPOD software for this method, and are verified with NASTRAN finite element analyses. The maximum deviation from the one-dimensional azimuthal pressure variation is predicted to be 10 percent and 20 percent for paraboloids and hyperboloids, respectively.

Sparse Covariance Matrix Estimation With Eigenvalue Constraints

PubMed Central

LIU, Han; WANG, Lie; ZHAO, Tuo

2014-01-01

We propose a new approach for estimating high-dimensional, positive-definite covariance matrices. Our method extends the generalized thresholding operator by adding an explicit eigenvalue constraint. The estimated covariance matrix simultaneously achieves sparsity and positive definiteness. The estimator is rate optimal in the minimax sense and we develop an efficient iterative soft-thresholding and projection algorithm based on the alternating direction method of multipliers. Empirically, we conduct thorough numerical experiments on simulated datasets as well as real data examples to illustrate the usefulness of our method. Supplementary materials for the article are available online. PMID:25620866

Parallel and Portable Monte Carlo Particle Transport

NASA Astrophysics Data System (ADS)

Lee, S. R.; Cummings, J. C.; Nolen, S. D.; Keen, N. D.

1997-08-01

We have developed a multi-group, Monte Carlo neutron transport code in C++ using object-oriented methods and the Parallel Object-Oriented Methods and Applications (POOMA) class library. This transport code, called MC++, currently computes k and α eigenvalues of the neutron transport equation on a rectilinear computational mesh. It is portable to and runs in parallel on a wide variety of platforms, including MPPs, clustered SMPs, and individual workstations. It contains appropriate classes and abstractions for particle transport and, through the use of POOMA, for portable parallelism. Current capabilities are discussed, along with physics and performance results for several test problems on a variety of hardware, including all three Accelerated Strategic Computing Initiative (ASCI) platforms. Current parallel performance indicates the ability to compute α-eigenvalues in seconds or minutes rather than days or weeks. Current and future work on the implementation of a general transport physics framework (TPF) is also described. This TPF employs modern C++ programming techniques to provide simplified user interfaces, generic STL-style programming, and compile-time performance optimization. Physics capabilities of the TPF will be extended to include continuous energy treatments, implicit Monte Carlo algorithms, and a variety of convergence acceleration techniques such as importance combing.

Eigenmodes of Ducted Flows With Radially-Dependent Axial and Swirl Velocity Components

NASA Technical Reports Server (NTRS)

Kousen, Kenneth A.

1999-01-01

This report characterizes the sets of small disturbances possible in cylindrical and annular ducts with mean flow whose axial and tangential components vary arbitrarily with radius. The linearized equations of motion are presented and discussed, and then exponential forms for the axial, circumferential, and time dependencies of any unsteady disturbances are assumed. The resultant equations form a generalized eigenvalue problem, the solution of which yields the axial wavenumbers and radial mode shapes of the unsteady disturbances. Two numerical discretizations are applied to the system of equations: (1) a spectral collocation technique based on Chebyshev polynomial expansions on the Gauss-Lobatto points, and (2) second and fourth order finite differences on uniform grids. The discretized equations are solved using a standard eigensystem package employing the QR algorithm. The eigenvalues fall into two primary categories: a discrete set (analogous to the acoustic modes found in uniform mean flows) and a continuous band (analogous to convected disturbances in uniform mean flows) where the phase velocities of the disturbances correspond to the local mean flow velocities. Sample mode shapes and eigensystem distributions are presented for both sheared axial and swirling flows. The physics of swirling flows is examined with reference to hydrodynamic stability and completeness of the eigensystem expansions. The effect of assuming exponential dependence in the axial direction is discussed.

Conservation laws with coinciding smooth solutions but different conserved variables

NASA Astrophysics Data System (ADS)

Colombo, Rinaldo M.; Guerra, Graziano

2018-04-01

Consider two hyperbolic systems of conservation laws in one space dimension with the same eigenvalues and (right) eigenvectors. We prove that solutions to Cauchy problems with the same initial data differ at third order in the total variation of the initial datum. As a first application, relying on the classical Glimm-Lax result (Glimm and Lax in Decay of solutions of systems of nonlinear hyperbolic conservation laws. Memoirs of the American Mathematical Society, No. 101. American Mathematical Society, Providence, 1970), we obtain estimates improving those in Saint-Raymond (Arch Ration Mech Anal 155(3):171-199, 2000) on the distance between solutions to the isentropic and non-isentropic inviscid compressible Euler equations, under general equations of state. Further applications are to the general scalar case, where rather precise estimates are obtained, to an approximation by Di Perna of the p-system and to a traffic model.

Application of matrix singular value properties for evaluating gain and phase margins of multiloop systems. [stability margins for wing flutter suppression and drone lateral attitude control

NASA Technical Reports Server (NTRS)

Mukhopadhyay, V.; Newsom, J. R.

1982-01-01

A stability margin evaluation method in terms of simultaneous gain and phase changes in all loops of a multiloop system is presented. A universal gain-phase margin evaluation diagram is constructed by generalizing an existing method using matrix singular value properties. Using this diagram and computing the minimum singular value of the system return difference matrix over the operating frequency range, regions of guaranteed stability margins can be obtained. Singular values are computed for a wing flutter suppression and a drone lateral attitude control problem. The numerical results indicate that this method predicts quite conservative stability margins. In the second example if the eigenvalue magnitude is used instead of the singular value, as a measure of nearness to singularity, more realistic stability margins are obtained. However, this relaxed measure generally cannot guarantee global stability.

Generating a New Higher-Dimensional Coupled Integrable Dispersionless System: Algebraic Structures, Bäcklund Transformation and Hidden Structural Symmetries

NASA Astrophysics Data System (ADS)

Souleymanou, Abbagari; Thomas, B. Bouetou; Timoleon, C. Kofane

2013-08-01

The prolongation structure methodologies of Wahlquist—Estabrook [H.D. Wahlquist and F.B. Estabrook, J. Math. Phys. 16 (1975) 1] for nonlinear differential equations are applied to a more general set of coupled integrable dispersionless system. Based on the obtained prolongation structure, a Lie-Algebra valued connection of a closed ideal of exterior differential forms related to the above system is constructed. A Lie-Algebra representation of some hidden structural symmetries of the previous system, its Bäcklund transformation using the Riccati form of the linear eigenvalue problem and their general corresponding Lax-representation are derived. In the wake of the previous results, we extend the above prolongation scheme to higher-dimensional systems from which a new (2 + 1)-dimensional coupled integrable dispersionless system is unveiled along with its inverse scattering formulation, which applications are straightforward in nonlinear optics where additional propagating dimension deserves some attention.

The generalized DMPK equation revisited: towards a systematic derivation

NASA Astrophysics Data System (ADS)

Douglas, Andrew; Markoš, Peter; Muttalib, K. A.

2014-03-01

The generalized Dorokov-Mello-Pereyra-Kumar (DMPK) equation has recently been used to obtain a family of very broad and highly asymmetric conductance distributions for three-dimensional disordered conductors. However, there are two major criticisms of the derivation of the generalized DMPK equation: (1) certain eigenvector correlations were neglected based on qualitative arguments that cannot be valid for all strengths of disorder, and (2) the repulsion between two closely spaced eigenvalues were not rigorously governed by symmetry considerations. In this work we show that it is possible to address both criticisms by including the eigenvalue and eigenvector correlations in a systematic and controlled way. It turns out that the added correlations determine the evolution of the Jacobian, without affecting the evaluation of the conductance distributions. They also guarantee the symmetry requirements. In addition, we obtain an exact relationship between the eigenvectors and the Lyapunov exponents leading to a sum rule for the latter at all disorder strengths.

Volatility and correlation-based systemic risk measures in the US market

NASA Astrophysics Data System (ADS)

Civitarese, Jamil

2016-10-01

This paper deals with the problem of how to use simple systemic risk measures to assess portfolio risk characteristics. Using three simple examples taken from previous literature, one based on raw and partial correlations, another based on the eigenvalue decomposition of the covariance matrix and the last one based on an eigenvalue entropy, a Granger-causation analysis revealed some of them are not always a good measure of risk in the S&P 500 and in the VIX. The measures selected do not Granger-cause the VIX index in all windows selected; therefore, in the sense of risk as volatility, the indicators are not always suitable. Nevertheless, their results towards returns are similar to previous works that accept them. A deeper analysis has shown that any symmetric measure based on eigenvalue decomposition of correlation matrices, however, is not useful as a measure of "correlation" risk. The empirical counterpart analysis of this proposition stated that negative correlations are usually small and, therefore, do not heavily distort the behavior of the indicator.

Construction, classification and parametrization of complex Hadamard matrices

NASA Astrophysics Data System (ADS)

Szöllősi, Ferenc

To improve the design of nuclear systems, high-fidelity neutron fluxes are required. Leadership-class machines provide platforms on which very large problems can be solved. Computing such fluxes efficiently requires numerical methods with good convergence properties and algorithms that can scale to hundreds of thousands of cores. Many 3-D deterministic transport codes are decomposable in space and angle only, limiting them to tens of thousands of cores. Most codes rely on methods such as Gauss Seidel for fixed source problems and power iteration for eigenvalue problems, which can be slow to converge for challenging problems like those with highly scattering materials or high dominance ratios. Three methods have been added to the 3-D SN transport code Denovo that are designed to improve convergence and enable the full use of cutting-edge computers. The first is a multigroup Krylov solver that converges more quickly than Gauss Seidel and parallelizes the code in energy such that Denovo can use hundreds of thousand of cores effectively. The second is Rayleigh quotient iteration (RQI), an old method applied in a new context. This eigenvalue solver finds the dominant eigenvalue in a mathematically optimal way and should converge in fewer iterations than power iteration. RQI creates energy-block-dense equations that the new Krylov solver treats efficiently. However, RQI can have convergence problems because it creates poorly conditioned systems. This can be overcome with preconditioning. The third method is a multigrid-in-energy preconditioner. The preconditioner takes advantage of the new energy decomposition because the grids are in energy rather than space or angle. The preconditioner greatly reduces iteration count for many problem types and scales well in energy. It also allows RQI to be successful for problems it could not solve otherwise. The methods added to Denovo accomplish the goals of this work. They converge in fewer iterations than traditional methods and enable the use of hundreds of thousands of cores. Each method can be used individually, with the multigroup Krylov solver and multigrid-in-energy preconditioner being particularly successful on their own. The largest benefit, though, comes from using these methods in concert.

Experience with Free Bodies

NASA Technical Reports Server (NTRS)

Butler, T. G.

1985-01-01

Some of the problems that confront an analyst in free body modeling, to satisfy rigid body conditions are discussed and with some remedies for these problems are presented. The problems of detecting these culprits at various levels within the analysis are examined. A new method within NASTRAN for checking the model for defects very early in the analysis without requiring the analyst to bear the expense of an eigenvalue analysis before discovering these defects is outlined.

Dynamic Restarting Schemes for Eigenvalue Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Kesheng; Simon, Horst D.

1999-03-10

In studies of restarted Davidson method, a dynamic thick-restart scheme was found to be excellent in improving the overall effectiveness of the eigen value method. This paper extends the study of the dynamic thick-restart scheme to the Lanczos method for symmetric eigen value problems and systematically explore a range of heuristics and strategies. We conduct a series of numerical tests to determine their relative strength and weakness on a class of electronic structure calculation problems.

Diffusion with Varying Drag; the Runaway Problem.

NASA Astrophysics Data System (ADS)

Rollins, David Kenneth

We study the motion of electrons in an ionized plasma of electrons and ions in an external electric field. A probability distribution function describes the electron motion and is a solution of a Fokker-Planck equation. In zero field, the solution approaches an equilibrium Maxwellian. For arbitrarily small field, electrons overcome the diffusive effects and are freely accelerated by the field. This is the electron runaway phenomenon. We treat the electric field as a small perturbation. We consider various diffusion coefficients for the one dimensional problem and determine the runaway current as a function of the field strength. Diffusion coefficients, non-zero on a finite interval are examined. Some non-trivial cases of these can be solved exactly in terms of known special functions. The more realistic case where the diffusion coefficient decays with velocity are then considered. To determine the runaway current, the equivalent Schrodinger eigenvalue problem is analysed. The smallest eigenvalue is shown to be equal to the runaway current. Using asymptotic matching a solution can be constructed which is then used to evaluate the runaway current. The runaway current is exponentially small as a function of field strength. This method is used to extract results from the three dimensional problem.

SCALE 6.2 Continuous-Energy TSUNAMI-3D Capabilities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perfetti, Christopher M; Rearden, Bradley T

2015-01-01

The TSUNAMI (Tools for Sensitivity and UNcertainty Analysis Methodology Implementation) capabilities within the SCALE code system make use of sensitivity coefficients for an extensive number of criticality safety applications, such as quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different systems, quantifying computational biases, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved ease of use and fidelity and the desire to extend TSUNAMI analysis to advanced applications have motivated the development of a SCALE 6.2 module for calculating sensitivity coefficients using three-dimensional (3D) continuous-energy (CE) Montemore » Carlo methods: CE TSUNAMI-3D. This paper provides an overview of the theory, implementation, and capabilities of the CE TSUNAMI-3D sensitivity analysis methods. CE TSUNAMI contains two methods for calculating sensitivity coefficients in eigenvalue sensitivity applications: (1) the Iterated Fission Probability (IFP) method and (2) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method. This work also presents the GEneralized Adjoint Response in Monte Carlo method (GEAR-MC), a first-of-its-kind approach for calculating adjoint-weighted, generalized response sensitivity coefficients—such as flux responses or reaction rate ratios—in CE Monte Carlo applications. The accuracy and efficiency of the CE TSUNAMI-3D eigenvalue sensitivity methods are assessed from a user perspective in a companion publication, and the accuracy and features of the CE TSUNAMI-3D GEAR-MC methods are detailed in this paper.« less

Emerging spectra of singular correlation matrices under small power-map deformations

NASA Astrophysics Data System (ADS)

Vinayak; Schäfer, Rudi; Seligman, Thomas H.

2013-09-01

Correlation matrices are a standard tool in the analysis of the time evolution of complex systems in general and financial markets in particular. Yet most analysis assume stationarity of the underlying time series. This tends to be an assumption of varying and often dubious validity. The validity of the assumption improves as shorter time series are used. If many time series are used, this implies an analysis of highly singular correlation matrices. We attack this problem by using the so-called power map, which was introduced to reduce noise. Its nonlinearity breaks the degeneracy of the zero eigenvalues and we analyze the sensitivity of the so-emerging spectra to correlations. This sensitivity will be demonstrated for uncorrelated and correlated Wishart ensembles.

Emerging spectra of singular correlation matrices under small power-map deformations.

PubMed

Vinayak; Schäfer, Rudi; Seligman, Thomas H

2013-09-01

Correlation matrices are a standard tool in the analysis of the time evolution of complex systems in general and financial markets in particular. Yet most analysis assume stationarity of the underlying time series. This tends to be an assumption of varying and often dubious validity. The validity of the assumption improves as shorter time series are used. If many time series are used, this implies an analysis of highly singular correlation matrices. We attack this problem by using the so-called power map, which was introduced to reduce noise. Its nonlinearity breaks the degeneracy of the zero eigenvalues and we analyze the sensitivity of the so-emerging spectra to correlations. This sensitivity will be demonstrated for uncorrelated and correlated Wishart ensembles.

Comment on “Approximate solutions of the Dirac equation for the Rosen-Morse potential including the spin-orbit centrifugal term” [J. Math. Phys. 51, 023525 (2010)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ghoumaid, A.; Benamira, F.; Guechi, L.

2016-02-15

It is shown that the application of the Nikiforov-Uvarov method by Ikhdair for solving the Dirac equation with the radial Rosen-Morse potential plus the spin-orbit centrifugal term is inadequate because the required conditions are not satisfied. The energy spectra given is incorrect and the wave functions are not physically acceptable. We clarify the problem and prove that the spinor wave functions are expressed in terms of the generalized hypergeometric functions {sub 2}F{sub 1}(a, b, c; z). The energy eigenvalues for the bound states are given by the solution of a transcendental equation involving the hypergeometric function.

Reduction of Free Edge Peeling Stress of Laminated Composites Using Active Piezoelectric Layers

PubMed Central

Huang, Bin; Kim, Heung Soo

2014-01-01

An analytical approach is proposed in the reduction of free edge peeling stresses of laminated composites using active piezoelectric layers. The approach is the extended Kantorovich method which is an iterative method. Multiterms of trial function are employed and governing equations are derived by taking the principle of complementary virtual work. The solutions are obtained by solving a generalized eigenvalue problem. By this approach, the stresses automatically satisfy not only the traction-free boundary conditions, but also the free edge boundary conditions. Through the iteration processes, the free edge stresses converge very quickly. It is found that the peeling stresses generated by mechanical loadings are significantly reduced by applying a proper electric field to the piezoelectric actuators. PMID:25025088

The use of an analytic Hamiltonian matrix for solving the hydrogenic atom

NASA Astrophysics Data System (ADS)

Bhatti, Mohammad

2001-10-01

The non-relativistic Hamiltonian corresponding to the Shrodinger equation is converted into analytic Hamiltonian matrix using the kth order B-splines functions. The Galerkin method is applied to the solution of the Shrodinger equation for bound states of hydrogen-like systems. The program Mathematica is used to create analytic matrix elements and exact integration is performed over the knot-sequence of B-splines and the resulting generalized eigenvalue problem is solved on a specified numerical grid. The complete basis set and the energy spectrum is obtained for the coulomb potential for hydrogenic systems with Z less than 100 with B-splines of order eight. Another application is given to test the Thomas-Reiche-Kuhn sum rule for the hydrogenic systems.

Cascade flutter analysis with transient response aerodynamics

NASA Technical Reports Server (NTRS)

Bakhle, Milind A.; Mahajan, Aparajit J.; Keith, Theo G., Jr.; Stefko, George L.

1991-01-01

Two methods for calculating linear frequency domain aerodynamic coefficients from a time marching Full Potential cascade solver are developed and verified. In the first method, the Influence Coefficient, solutions to elemental problems are superposed to obtain the solutions for a cascade in which all blades are vibrating with a constant interblade phase angle. The elemental problem consists of a single blade in the cascade oscillating while the other blades remain stationary. In the second method, the Pulse Response, the response to the transient motion of a blade is used to calculate influence coefficients. This is done by calculating the Fourier Transforms of the blade motion and the response. Both methods are validated by comparison with the Harmonic Oscillation method and give accurate results. The aerodynamic coefficients obtained from these methods are used for frequency domain flutter calculations involving a typical section blade structural model. An eigenvalue problem is solved for each interblade phase angle mode and the eigenvalues are used to determine aeroelastic stability. Flutter calculations are performed for two examples over a range of subsonic Mach numbers.

Solution of the Fokker-Planck equation with a logarithmic potential and mixed eigenvalue spectrum

NASA Astrophysics Data System (ADS)

Guarnieri, F.; Moon, W.; Wettlaufer, J. S.

2017-09-01

Motivated by a problem in climate dynamics, we investigate the solution of a Bessel-like process with a negative constant drift, described by a Fokker-Planck equation with a potential V (x ) =-[b ln(x ) +a x ] , for b >0 and a <0 . The problem belongs to a family of Fokker-Planck equations with logarithmic potentials closely related to the Bessel process that has been extensively studied for its applications in physics, biology, and finance. The Bessel-like process we consider can be solved by seeking solutions through an expansion into a complete set of eigenfunctions. The associated imaginary-time Schrödinger equation exhibits a mix of discrete and continuous eigenvalue spectra, corresponding to the quantum Coulomb potential describing the bound states of the hydrogen atom. We present a technique to evaluate the normalization factor of the continuous spectrum of eigenfunctions that relies solely upon their asymptotic behavior. We demonstrate the technique by solving the Brownian motion problem and the Bessel process both with a constant negative drift. We conclude with a comparison to other analytical methods and with numerical solutions.

A fixed energy fixed angle inverse scattering in interior transmission problem

NASA Astrophysics Data System (ADS)

Chen, Lung-Hui

2017-06-01

We study the inverse acoustic scattering problem in mathematical physics. The problem is to recover the index of refraction in an inhomogeneous medium by measuring the scattered wave fields in the far field. We transform the problem to the interior transmission problem in the study of the Helmholtz equation. We find an inverse uniqueness on the scatterer with a knowledge of a fixed interior transmission eigenvalue. By examining the solution in a series of spherical harmonics in the far field, we can determine uniquely the perturbation source for the radially symmetric perturbations.

Quantized discrete space oscillators

NASA Technical Reports Server (NTRS)

Uzes, C. A.; Kapuscik, Edward

1993-01-01

A quasi-canonical sequence of finite dimensional quantizations was found which has canonical quantization as its limit. In order to demonstrate its practical utility and its numerical convergence, this formalism is applied to the eigenvalue and 'eigenfunction' problem of several harmonic and anharmonic oscillators.

A general approach to regularizing inverse problems with regional data using Slepian wavelets

NASA Astrophysics Data System (ADS)

Michel, Volker; Simons, Frederik J.

2017-12-01

Slepian functions are orthogonal function systems that live on subdomains (for example, geographical regions on the Earth’s surface, or bandlimited portions of the entire spectrum). They have been firmly established as a useful tool for the synthesis and analysis of localized (concentrated or confined) signals, and for the modeling and inversion of noise-contaminated data that are only regionally available or only of regional interest. In this paper, we consider a general abstract setup for inverse problems represented by a linear and compact operator between Hilbert spaces with a known singular-value decomposition (svd). In practice, such an svd is often only given for the case of a global expansion of the data (e.g. on the whole sphere) but not for regional data distributions. We show that, in either case, Slepian functions (associated to an arbitrarily prescribed region and the given compact operator) can be determined and applied to construct a regularization for the ill-posed regional inverse problem. Moreover, we describe an algorithm for constructing the Slepian basis via an algebraic eigenvalue problem. The obtained Slepian functions can be used to derive an svd for the combination of the regionalizing projection and the compact operator. As a result, standard regularization techniques relying on a known svd become applicable also to those inverse problems where the data are regionally given only. In particular, wavelet-based multiscale techniques can be used. An example for the latter case is elaborated theoretically and tested on two synthetic numerical examples.

Generalised quasiprobability distribution for Hermite polynomial squeezed states

NASA Astrophysics Data System (ADS)

Datta, Sunil; D'Souza, Richard

1996-02-01

Generalized quasiprobability distributions (QPD) for Hermite polynomial states are presented. These states are solutions of an eigenvalue equation which is quadratic in creation and annihilation operators. Analytical expressions for the QPD are presented for some special cases of the eigenvalues. For large squeezing these analytical expressions for the QPD take the form of a finite series in even Hermite functions. These expressions very transparently exhibit the transition between, P, Q and W functions corresponding to the change of the s-parameter of the QPD. Further, they clearly show the two-photon nature of the processes involved in the generation of these states.

The Coulomb problem on a 3-sphere and Heun polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bellucci, Stefano; Yeghikyan, Vahagn; Yerevan State University, Alex-Manoogian st. 1, 00025 Yerevan

2013-08-15

The paper studies the quantum mechanical Coulomb problem on a 3-sphere. We present a special parametrization of the ellipto-spheroidal coordinate system suitable for the separation of variables. After quantization we get the explicit form of the spectrum and present an algebraic equation for the eigenvalues of the Runge-Lentz vector. We also present the wave functions expressed via Heun polynomials.

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

NASA Technical Reports Server (NTRS)

Swarztrauber, Paul N.

1989-01-01

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.

Instability of the cored barotropic disc: the linear eigenvalue formulation

NASA Astrophysics Data System (ADS)

Polyachenko, E. V.

2018-05-01

Gaseous rotating razor-thin discs are a testing ground for theories of spiral structure that try to explain appearance and diversity of disc galaxy patterns. These patterns are believed to arise spontaneously under the action of gravitational instability, but calculations of its characteristics in the gas are mostly obscured. The paper suggests a new method for finding the spiral patterns based on an expansion of small amplitude perturbations over Lagrange polynomials in small radial elements. The final matrix equation is extracted from the original hydrodynamical equations without the use of an approximate theory and has a form of the linear algebraic eigenvalue problem. The method is applied to a galactic model with the cored exponential density profile.

Comptonization in Ultra-Strong Magnetic Fields: Numerical Solution to the Radiative Transfer Problem

NASA Technical Reports Server (NTRS)

Ceccobello, C.; Farinelli, R.; Titarchuk, L.

2014-01-01

We consider the radiative transfer problem in a plane-parallel slab of thermal electrons in the presence of an ultra-strong magnetic field (B approximately greater than B(sub c) approx. = 4.4 x 10(exp 13) G). Under these conditions, the magnetic field behaves like a birefringent medium for the propagating photons, and the electromagnetic radiation is split into two polarization modes, ordinary and extraordinary, that have different cross-sections. When the optical depth of the slab is large, the ordinary-mode photons are strongly Comptonized and the photon field is dominated by an isotropic component. Aims. The radiative transfer problem in strong magnetic fields presents many mathematical issues and analytical or numerical solutions can be obtained only under some given approximations. We investigate this problem both from the analytical and numerical point of view, provide a test of the previous analytical estimates, and extend these results with numerical techniques. Methods. We consider here the case of low temperature black-body photons propagating in a sub-relativistic temperature plasma, which allows us to deal with a semi-Fokker-Planck approximation of the radiative transfer equation. The problem can then be treated with the variable separation method, and we use a numerical technique to find solutions to the eigenvalue problem in the case of a singular kernel of the space operator. The singularity of the space kernel is the result of the strong angular dependence of the electron cross-section in the presence of a strong magnetic field. Results. We provide the numerical solution obtained for eigenvalues and eigenfunctions of the space operator, and the emerging Comptonization spectrum of the ordinary-mode photons for any eigenvalue of the space equation and for energies significantly lesser than the cyclotron energy, which is on the order of MeV for the intensity of the magnetic field here considered. Conclusions. We derived the specific intensity of the ordinary photons, under the approximation of large angle and large optical depth. These assumptions allow the equation to be treated using a diffusion-like approximation.

A simple method for finding explicit analytic transition densities of diffusion processes with general diploid selection.

PubMed

Song, Yun S; Steinrücken, Matthias

2012-03-01

The transition density function of the Wright-Fisher diffusion describes the evolution of population-wide allele frequencies over time. This function has important practical applications in population genetics, but finding an explicit formula under a general diploid selection model has remained a difficult open problem. In this article, we develop a new computational method to tackle this classic problem. Specifically, our method explicitly finds the eigenvalues and eigenfunctions of the diffusion generator associated with the Wright-Fisher diffusion with recurrent mutation and arbitrary diploid selection, thus allowing one to obtain an accurate spectral representation of the transition density function. Simplicity is one of the appealing features of our approach. Although our derivation involves somewhat advanced mathematical concepts, the resulting algorithm is quite simple and efficient, only involving standard linear algebra. Furthermore, unlike previous approaches based on perturbation, which is applicable only when the population-scaled selection coefficient is small, our method is nonperturbative and is valid for a broad range of parameter values. As a by-product of our work, we obtain the rate of convergence to the stationary distribution under mutation-selection balance.

A Simple Method for Finding Explicit Analytic Transition Densities of Diffusion Processes with General Diploid Selection

PubMed Central

Song, Yun S.; Steinrücken, Matthias

2012-01-01

The transition density function of the Wright–Fisher diffusion describes the evolution of population-wide allele frequencies over time. This function has important practical applications in population genetics, but finding an explicit formula under a general diploid selection model has remained a difficult open problem. In this article, we develop a new computational method to tackle this classic problem. Specifically, our method explicitly finds the eigenvalues and eigenfunctions of the diffusion generator associated with the Wright–Fisher diffusion with recurrent mutation and arbitrary diploid selection, thus allowing one to obtain an accurate spectral representation of the transition density function. Simplicity is one of the appealing features of our approach. Although our derivation involves somewhat advanced mathematical concepts, the resulting algorithm is quite simple and efficient, only involving standard linear algebra. Furthermore, unlike previous approaches based on perturbation, which is applicable only when the population-scaled selection coefficient is small, our method is nonperturbative and is valid for a broad range of parameter values. As a by-product of our work, we obtain the rate of convergence to the stationary distribution under mutation–selection balance. PMID:22209899

Numerical modelling of thin-walled Z-columns made of general laminates subjected to uniform shortening

NASA Astrophysics Data System (ADS)

Teter, Andrzej; Kolakowski, Zbigniew

2018-01-01

The numerical modelling of a plate structure was performed with the finite element method and a one-mode approach based on Koiter's method. The first order approximation of Koiter's method enables one to solve the eigenvalue problem. The second order approximation describes post-buckling equilibrium paths. In the finite element analysis, the Lanczos method was used to solve the linear problem of buckling. Simulations of the non-linear problem were performed with the Newton-Raphson method. Detailed calculations were carried out for a short Z-column made of general laminates. Configurations of laminated layers were non-symmetric. Due to possibilities of its application, the general laminate is very interesting. The length of the samples was chosen to obtain the lowest value of local buckling load. The amplitude of initial imperfections was 10% of the wall thickness. Thin-walled structures were simply supported on both ends. The numerical results were verified in experimental tests. A strain-gauge technique was applied. A static compression test was performed on a universal testing machine and a special grip, which consisted of two rigid steel plates and clamping sleeves, was used. Specimens were obtained with an autoclave technique. Tests were performed at a constant velocity of the cross-bar equal to 2 mm/min. The compressive load was less than 150% of the bifurcation load. Additionally, soft and thin pads were used to reduce inaccuracy of the sample ends.

A study of the response of nonlinear springs

NASA Technical Reports Server (NTRS)

Hyer, M. W.; Knott, T. W.; Johnson, E. R.

1991-01-01

The various phases to developing a methodology for studying the response of a spring-reinforced arch subjected to a point load are discussed. The arch is simply supported at its ends with both the spring and the point load assumed to be at midspan. The spring is present to off-set the typical snap through behavior normally associated with arches, and to provide a structure that responds with constant resistance over a finite displacement. The various phases discussed consist of the following: (1) development of the closed-form solution for the shallow arch case; (2) development of a finite difference analysis to study (shallow) arches; and (3) development of a finite element analysis for studying more general shallow and nonshallow arches. The two numerical analyses rely on a continuation scheme to move the solution past limit points, and to move onto bifurcated paths, both characteristics being common to the arch problem. An eigenvalue method is used for a continuation scheme. The finite difference analysis is based on a mixed formulation (force and displacement variables) of the governing equations. The governing equations for the mixed formulation are in first order form, making the finite difference implementation convenient. However, the mixed formulation is not well-suited for the eigenvalue continuation scheme. This provided the motivation for the displacement based finite element analysis. Both the finite difference and the finite element analyses are compared with the closed form shallow arch solution. Agreement is excellent, except for the potential problems with the finite difference analysis and the continuation scheme. Agreement between the finite element analysis and another investigator's numerical analysis for deep arches is also good.

Solvability of a fourth-order boundary value problem with periodic boundary conditions II

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gupta, Chaitan P.

1991-01-01

Lemore » t f : [ 0 , 1 ] × R 4 → R be a function satisfying Caratheodory's conditions and e ( x ) ∈ L 1 [ 0 , 1 ] . This paper is concerned with the solvability of the fourth-order fully quasilinear boundary value problem d 4 u d x 4 + f ( x , u ( x ) , u ′ ( x ) , u ″ ( x ) , u ‴ ( x ) ) = e ( x ) ,    0 < x < 1 , with u ( 0 ) − u ( 1 ) = u ′ ( 0 ) − u ′ ( 1 ) = u ″ ( 0 ) - u ″ ( 1 ) = u ‴ ( 0 ) - u ‴ ( 1 ) = 0 . This problem was studied earlier by the author in the special case when f was of the form f ( x , u ( x ) ) , i.e., independent of u ′ ( x ) , u ″ ( x ) , u ‴ ( x ) . It turns out that the earlier methods do not apply in this general case. The conditions need to be related to both of the linear eigenvalue problems d 4 u d x 4 = λ 4 u and d 4 u d x 4 = − λ 2 d 2 u d x 2 with periodic boundary conditions.« less

Analytical development of disturbed matrix eigenvalue problem applied to mixed convection stability analysis in Darcy media

NASA Astrophysics Data System (ADS)

Hamed, Haikel Ben; Bennacer, Rachid

2008-08-01

This work consists in evaluating algebraically and numerically the influence of a disturbance on the spectral values of a diagonalizable matrix. Thus, two approaches will be possible; to use the theorem of disturbances of a matrix depending on a parameter, due to Lidskii and primarily based on the structure of Jordan of the no disturbed matrix. The second approach consists in factorizing the matrix system, and then carrying out a numerical calculation of the roots of the disturbances matrix characteristic polynomial. This problem can be a standard model in the equations of the continuous media mechanics. During this work, we chose to use the second approach and in order to illustrate the application, we choose the Rayleigh-Bénard problem in Darcy media, disturbed by a filtering through flow. The matrix form of the problem is calculated starting from a linear stability analysis by a finite elements method. We show that it is possible to break up the general phenomenon into other elementary ones described respectively by a disturbed matrix and a disturbance. A good agreement between the two methods was seen. To cite this article: H.B. Hamed, R. Bennacer, C. R. Mecanique 336 (2008).

Bifurcating fronts for the Taylor-Couette problem in infinite cylinders

NASA Astrophysics Data System (ADS)

Hărăguş-Courcelle, M.; Schneider, G.

We show the existence of bifurcating fronts for the weakly unstable Taylor-Couette problem in an infinite cylinder. These fronts connect a stationary bifurcating pattern, here the Taylor vortices, with the trivial ground state, here the Couette flow. In order to show the existence result we improve a method which was already used in establishing the existence of bifurcating fronts for the Swift-Hohenberg equation by Collet and Eckmann, 1986, and by Eckmann and Wayne, 1991. The existence proof is based on spatial dynamics and center manifold theory. One of the difficulties in applying center manifold theory comes from an infinite number of eigenvalues on the imaginary axis for vanishing bifurcation parameter. But nevertheless, a finite dimensional reduction is possible, since the eigenvalues leave the imaginary axis with different velocities, if the bifurcation parameter is increased. In contrast to previous work we have to use normalform methods and a non-standard cut-off function to obtain a center manifold which is large enough to contain the bifurcating fronts.

Learning SVM in Kreĭn Spaces.

PubMed

Loosli, Gaelle; Canu, Stephane; Ong, Cheng Soon

2016-06-01

This paper presents a theoretical foundation for an SVM solver in Kreĭn spaces. Up to now, all methods are based either on the matrix correction, or on non-convex minimization, or on feature-space embedding. Here we justify and evaluate a solution that uses the original (indefinite) similarity measure, in the original Kreĭn space. This solution is the result of a stabilization procedure. We establish the correspondence between the stabilization problem (which has to be solved) and a classical SVM based on minimization (which is easy to solve). We provide simple equations to go from one to the other (in both directions). This link between stabilization and minimization problems is the key to obtain a solution in the original Kreĭn space. Using KSVM, one can solve SVM with usually troublesome kernels (large negative eigenvalues or large numbers of negative eigenvalues). We show experiments showing that our algorithm KSVM outperforms all previously proposed approaches to deal with indefinite matrices in SVM-like kernel methods.

A High Frequency Model of Cascade Noise

NASA Technical Reports Server (NTRS)

Envia, Edmane

1998-01-01

Closed form asymptotic expressions for computing high frequency noise generated by an annular cascade in an infinite duct containing a uniform flow are presented. There are two new elements in this work. First, the annular duct mode representation does not rely on the often-used Bessel function expansion resulting in simpler expressions for both the radial eigenvalues and eigenfunctions of the duct. In particular, the new representation provides an explicit approximate formula for the radial eigenvalues obviating the need for solutions of the transcendental annular duct eigenvalue equation. Also, the radial eigenfunctions are represented in terms of exponentials eliminating the numerical problems associated with generating the Bessel functions on a computer. The second new element is the construction of an unsteady response model for an annular cascade. The new construction satisfies the boundary conditions on both the cascade and duct walls simultaneously adding a new level of realism to the noise calculations. Preliminary results which demonstrate the effectiveness of the new elements are presented. A discussion of the utility of the asymptotic formulas for calculating cascade discrete tone as well as broadband noise is also included.

On the calculation of resonances by analytic continuation of eigenvalues from the stabilization graph

NASA Astrophysics Data System (ADS)

Haritan, Idan; Moiseyev, Nimrod

2017-07-01

Resonances play a major role in a large variety of fields in physics and chemistry. Accordingly, there is a growing interest in methods designed to calculate them. Recently, Landau et al. proposed a new approach to analytically dilate a single eigenvalue from the stabilization graph into the complex plane. This approach, termed Resonances Via Padé (RVP), utilizes the Padé approximant and is based on a unique analysis of the stabilization graph. Yet, analytic continuation of eigenvalues from the stabilization graph into the complex plane is not a new idea. In 1975, Jordan suggested an analytic continuation method based on the branch point structure of the stabilization graph. The method was later modified by McCurdy and McNutt, and it is still being used today. We refer to this method as the Truncated Characteristic Polynomial (TCP) method. In this manuscript, we perform an in-depth comparison between the RVP and the TCP methods. We demonstrate that while both methods are important and complementary, the advantage of one method over the other is problem-dependent. Illustrative examples are provided in the manuscript.

A novel scatter-matrix eigenvalues-based total variation (SMETV) regularization for medical image restoration

NASA Astrophysics Data System (ADS)

Huang, Zhenghua; Zhang, Tianxu; Deng, Lihua; Fang, Hao; Li, Qian

2015-12-01

Total variation(TV) based on regularization has been proven as a popular and effective model for image restoration, because of its ability of edge preserved. However, as the TV favors a piece-wise constant solution, the processing results in the flat regions of the image are easily produced "staircase effects", and the amplitude of the edges will be underestimated; the underlying cause of the problem is that the regularization parameter can not be changeable with spatial local information of image. In this paper, we propose a novel Scatter-matrix eigenvalues-based TV(SMETV) regularization with image blind restoration algorithm for deblurring medical images. The spatial information in different image regions is incorporated into regularization by using the edge indicator called difference eigenvalue to distinguish edges from flat areas. The proposed algorithm can effectively reduce the noise in flat regions as well as preserve the edge and detailed information. Moreover, it becomes more robust with the change of the regularization parameter. Extensive experiments demonstrate that the proposed approach produces results superior to most methods in both visual image quality and quantitative measures.

State space approach to mixed boundary value problems.

NASA Technical Reports Server (NTRS)

Chen, C. F.; Chen, M. M.

1973-01-01

A state-space procedure for the formulation and solution of mixed boundary value problems is established. This procedure is a natural extension of the method used in initial value problems; however, certain special theorems and rules must be developed. The scope of the applications of the approach includes beam, arch, and axisymmetric shell problems in structural analysis, boundary layer problems in fluid mechanics, and eigenvalue problems for deformable bodies. Many classical methods in these fields developed by Holzer, Prohl, Myklestad, Thomson, Love-Meissner, and others can be either simplified or unified under new light shed by the state-variable approach. A beam problem is included as an illustration.

Krein signature for instability of PT-symmetric states

NASA Astrophysics Data System (ADS)

Chernyavsky, Alexander; Pelinovsky, Dmitry E.

2018-05-01

Krein quantity is introduced for isolated neutrally stable eigenvalues associated with the stationary states in the PT-symmetric nonlinear Schrödinger equation. Krein quantity is real and nonzero for simple eigenvalues but it vanishes if two simple eigenvalues coalesce into a defective eigenvalue. A necessary condition for bifurcation of unstable eigenvalues from the defective eigenvalue is proved. This condition requires the two simple eigenvalues before the coalescence point to have opposite Krein signatures. The theory is illustrated with several numerical examples motivated by recent publications in physics literature.

The Performance Analysis Based on SAR Sample Covariance Matrix

PubMed Central

Erten, Esra

2012-01-01

Multi-channel systems appear in several fields of application in science. In the Synthetic Aperture Radar (SAR) context, multi-channel systems may refer to different domains, as multi-polarization, multi-interferometric or multi-temporal data, or even a combination of them. Due to the inherent speckle phenomenon present in SAR images, the statistical description of the data is almost mandatory for its utilization. The complex images acquired over natural media present in general zero-mean circular Gaussian characteristics. In this case, second order statistics as the multi-channel covariance matrix fully describe the data. For practical situations however, the covariance matrix has to be estimated using a limited number of samples, and this sample covariance matrix follow the complex Wishart distribution. In this context, the eigendecomposition of the multi-channel covariance matrix has been shown in different areas of high relevance regarding the physical properties of the imaged scene. Specifically, the maximum eigenvalue of the covariance matrix has been frequently used in different applications as target or change detection, estimation of the dominant scattering mechanism in polarimetric data, moving target indication, etc. In this paper, the statistical behavior of the maximum eigenvalue derived from the eigendecomposition of the sample multi-channel covariance matrix in terms of multi-channel SAR images is simplified for SAR community. Validation is performed against simulated data and examples of estimation and detection problems using the analytical expressions are as well given. PMID:22736976

An imprecise probability approach for squeal instability analysis based on evidence theory

NASA Astrophysics Data System (ADS)

Lü, Hui; Shangguan, Wen-Bin; Yu, Dejie

2017-01-01

An imprecise probability approach based on evidence theory is proposed for squeal instability analysis of uncertain disc brakes in this paper. First, the squeal instability of the finite element (FE) model of a disc brake is investigated and its dominant unstable eigenvalue is detected by running two typical numerical simulations, i.e., complex eigenvalue analysis (CEA) and transient dynamical analysis. Next, the uncertainty mainly caused by contact and friction is taken into account and some key parameters of the brake are described as uncertain parameters. All these uncertain parameters are usually involved with imprecise data such as incomplete information and conflict information. Finally, a squeal instability analysis model considering imprecise uncertainty is established by integrating evidence theory, Taylor expansion, subinterval analysis and surrogate model. In the proposed analysis model, the uncertain parameters with imprecise data are treated as evidence variables, and the belief measure and plausibility measure are employed to evaluate system squeal instability. The effectiveness of the proposed approach is demonstrated by numerical examples and some interesting observations and conclusions are summarized from the analyses and discussions. The proposed approach is generally limited to the squeal problems without too many investigated parameters. It can be considered as a potential method for squeal instability analysis, which will act as the first step to reduce squeal noise of uncertain brakes with imprecise information.

Control theory and splines, applied to signature storage

NASA Technical Reports Server (NTRS)

Enqvist, Per

1994-01-01

In this report the problem we are going to study is the interpolation of a set of points in the plane with the use of control theory. We will discover how different systems generate different kinds of splines, cubic and exponential, and investigate the effect that the different systems have on the tracking problems. Actually we will see that the important parameters will be the two eigenvalues of the control matrix.

Pechukas-Yukawa approach to the evolution of the quantum state of a parametrically perturbed system

NASA Astrophysics Data System (ADS)

Qureshi, Mumnuna A.; Zhong, Johnny; Qureshi, Zihad; Mason, Peter; Betouras, Joseph J.; Zagoskin, Alexandre M.

2018-03-01

We consider the evolution of the quantum states of a Hamiltonian that is parametrically perturbed via a term proportional to the adiabatic parameter λ (t ) . Starting with the Pechukas-Yukawa mapping of the energy eigenvalue evolution in a generalized Calogero-Sutherland model of a one-dimensional classical gas, we consider the adiabatic approximation with two different expansions of the quantum state in powers of d λ /d t and compare them with a direct numerical simulation. We show that one of these expansions (Magnus series) is especially convenient for the description of nonadiabatic evolution of the system. Applying the expansion to the exact cover 3-satisfiability problem, we obtain the occupation dynamics, which provides insight into the population of states and sources of decoherence in a quantum system.

Swimming of a sphere in a viscous incompressible fluid with inertia

NASA Astrophysics Data System (ADS)

Felderhof, B. U.; Jones, R. B.

2017-08-01

The swimming of a sphere immersed in a viscous incompressible fluid with inertia is studied for surface modulations of small amplitude on the basis of the Navier-Stokes equations. The mean swimming velocity and the mean rate of dissipation are expressed as quadratic forms in term of the surface displacements. With a choice of a basis set of modes the quadratic forms correspond to two Hermitian matrices. Optimization of the mean swimming velocity for given rate of dissipation requires the solution of a generalized eigenvalue problem involving the two matrices. It is found for surface modulations of low multipole order that the optimal swimming efficiency depends in intricate fashion on a dimensionless scale number involving the radius of the sphere, the period of the cycle, and the kinematic viscosity of the fluid.

Statistical properties of color-signal spaces.

PubMed

Lenz, Reiner; Bui, Thanh Hai

2005-05-01

In applications of principal component analysis (PCA) it has often been observed that the eigenvector with the largest eigenvalue has only nonnegative entries when the vectors of the underlying stochastic process have only nonnegative values. This has been used to show that the coordinate vectors in PCA are all located in a cone. We prove that the nonnegativity of the first eigenvector follows from the Perron-Frobenius (and Krein-Rutman theory). Experiments show also that for stochastic processes with nonnegative signals the mean vector is often very similar to the first eigenvector. This is not true in general, but we first give a heuristical explanation why we can expect such a similarity. We then derive a connection between the dominance of the first eigenvalue and the similarity between the mean and the first eigenvector and show how to check the relative size of the first eigenvalue without actually computing it. In the last part of the paper we discuss the implication of theoretical results for multispectral color processing.

Statistical properties of color-signal spaces

NASA Astrophysics Data System (ADS)

Lenz, Reiner; Hai Bui, Thanh

2005-05-01

In applications of principal component analysis (PCA) it has often been observed that the eigenvector with the largest eigenvalue has only nonnegative entries when the vectors of the underlying stochastic process have only nonnegative values. This has been used to show that the coordinate vectors in PCA are all located in a cone. We prove that the nonnegativity of the first eigenvector follows from the Perron-Frobenius (and Krein-Rutman theory). Experiments show also that for stochastic processes with nonnegative signals the mean vector is often very similar to the first eigenvector. This is not true in general, but we first give a heuristical explanation why we can expect such a similarity. We then derive a connection between the dominance of the first eigenvalue and the similarity between the mean and the first eigenvector and show how to check the relative size of the first eigenvalue without actually computing it. In the last part of the paper we discuss the implication of theoretical results for multispectral color processing.

Monte Carlo criticality source convergence in a loosely coupled fuel storage system.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Blomquist, R. N.; Gelbard, E. M.

2003-06-10

The fission source convergence of a very loosely coupled array of 36 fuel subassemblies with slightly non-symmetric reflection is studied. The fission source converges very slowly from a uniform guess to the fundamental mode in which about 40% of the fissions occur in one corner subassembly. Eigenvalue and fission source estimates are analyzed using a set of statistical tests similar to those used in MCNP, including the ''drift-in-mean'' test and a new drift-in-mean test using a linear fit to the cumulative estimate drift, the Shapiro-Wilk test for normality, the relative error test, and the ''1/N'' test. The normality test doesmore » not detect a drifting eigenvalue or fission source. Applied to eigenvalue estimates, the other tests generally fail to detect an unconverged solution, but they are sometimes effective when evaluating fission source distributions. None of the test provides completely reliable indication of convergence, although they can detect nonconvergence.« less

World currency exchange rate cross-correlations

NASA Astrophysics Data System (ADS)

Droå¼dż, S.; Górski, A. Z.; Kwapień, J.

2007-08-01

World currency network constitutes one of the most complex structures that is associated with the contemporary civilization. On a way towards quantifying its characteristics we study the cross correlations in changes of the daily foreign exchange rates within the basket of 60 currencies in the period December 1998 May 2005. Such a dynamics turns out to predominantly involve one outstanding eigenvalue of the correlation matrix. The magnitude of this eigenvalue depends however crucially on which currency is used as a base currency for the remaining ones. Most prominent it looks from the perspective of a peripheral currency. This largest eigenvalue is seen to systematically decrease and thus the structure of correlations becomes more heterogeneous, when more significant currencies are used as reference. An extreme case in this later respect is the USD in the period considered. Besides providing further insight into subtle nature of complexity, these observations point to a formal procedure that in general can be used for practical purposes of measuring the relative currencies significance on various time horizons.

Proposition for sensorless self-excitation by a piezoelectric device

NASA Astrophysics Data System (ADS)

Tanaka, Y.; Kokubun, Y.; Yabuno, H.

2018-04-01

In this paper, we propose a method to realize self-excitation in an oscillator actuated by a piezoelectric device without a sensor. In general, the positive feedback associated with the oscillator velocity causes the self-excitation. Instead of measuring the velocity with a sensor, we utilize the electro-mechanical coupling effect in the oscillator and piezoelectric device. We drive the piezoelectric device with a current proportional to the linear combination of the voltage across the terminals of the piezoelectric device and its differential voltage signal. Then, the oscillator with the piezoelectric device behaves like a third-order system, which has three eigenvalues. The self-excitation can be realized because appropriate feedback gains can set two of the eigenvalues to be conjugate complex roots with a positive real part and the other eigenvalue to be a negative real root. To confirm the validity of the proposed method, we experimentally demonstrated the sensorless self-excitation and, as an application example, carried out mass sensing in a sensorless self-excited macrocantilever.

Efficient eigenvalue determination for arbitrary Pauli products based on generalized spin-spin interactions

NASA Astrophysics Data System (ADS)

Leibfried, D.; Wineland, D. J.

2018-03-01

Effective spin-spin interactions between ? qubits enable the determination of the eigenvalue of an arbitrary Pauli product of dimension N with a constant, small number of multi-qubit gates that is independent of N and encodes the eigenvalue in the measurement basis states of an extra ancilla qubit. Such interactions are available whenever qubits can be coupled to a shared harmonic oscillator, a situation that can be realized in many physical qubit implementations. For example, suitable interactions have already been realized for up to 14 qubits in ion traps. It should be possible to implement stabilizer codes for quantum error correction with a constant number of multi-qubit gates, in contrast to typical constructions with a number of two-qubit gates that increases as a function of N. The special case of finding the parity of N qubits only requires a small number of operations that is independent of N. This compares favorably to algorithms for computing the parity on conventional machines, which implies a genuine quantum advantage.

Accounting for Sampling Error in Genetic Eigenvalues Using Random Matrix Theory.

PubMed

Sztepanacz, Jacqueline L; Blows, Mark W

2017-07-01

The distribution of genetic variance in multivariate phenotypes is characterized by the empirical spectral distribution of the eigenvalues of the genetic covariance matrix. Empirical estimates of genetic eigenvalues from random effects linear models are known to be overdispersed by sampling error, where large eigenvalues are biased upward, and small eigenvalues are biased downward. The overdispersion of the leading eigenvalues of sample covariance matrices have been demonstrated to conform to the Tracy-Widom (TW) distribution. Here we show that genetic eigenvalues estimated using restricted maximum likelihood (REML) in a multivariate random effects model with an unconstrained genetic covariance structure will also conform to the TW distribution after empirical scaling and centering. However, where estimation procedures using either REML or MCMC impose boundary constraints, the resulting genetic eigenvalues tend not be TW distributed. We show how using confidence intervals from sampling distributions of genetic eigenvalues without reference to the TW distribution is insufficient protection against mistaking sampling error as genetic variance, particularly when eigenvalues are small. By scaling such sampling distributions to the appropriate TW distribution, the critical value of the TW statistic can be used to determine if the magnitude of a genetic eigenvalue exceeds the sampling error for each eigenvalue in the spectral distribution of a given genetic covariance matrix. Copyright © 2017 by the Genetics Society of America.

On Browne's Solution for Oblique Procrustes Rotation

ERIC Educational Resources Information Center

Cramer, Elliot M.

1974-01-01

A form of Browne's (1967) solution of finding a least squares fit to a specified factor structure is given which does not involve solution of an eigenvalue problem. It suggests the possible existence of a singularity, and a simple modification of Browne's computational procedure is proposed. (Author/RC)

Analytical solution for the advection-dispersion transport equation in layered media

USDA-ARS?s Scientific Manuscript database

The advection-dispersion transport equation with first-order decay was solved analytically for multi-layered media using the classic integral transform technique (CITT). The solution procedure used an associated non-self-adjoint advection-diffusion eigenvalue problem that had the same form and coef...

Solving Differential Equations Using Modified Picard Iteration

ERIC Educational Resources Information Center

Robin, W. A.

2010-01-01

Many classes of differential equations are shown to be open to solution through a method involving a combination of a direct integration approach with suitably modified Picard iterative procedures. The classes of differential equations considered include typical initial value, boundary value and eigenvalue problems arising in physics and…

Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses.

PubMed

Zhang, Wenbing; Tang, Yang; Huang, Tingwen; Kurths, Jurgen

In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems. Ph.D. Thesis - Massachusetts Inst. of Technology, Aug. 1991

NASA Technical Reports Server (NTRS)

Nachtigal, Noel M.

1991-01-01

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Protein normal-mode dynamics: trypsin inhibitor, crambin, ribonuclease and lysozyme.

PubMed

Levitt, M; Sander, C; Stern, P S

1985-02-05

We have developed a new method for modelling protein dynamics using normal-mode analysis in internal co-ordinates. This method, normal-mode dynamics, is particularly well suited for modelling collective motion, makes possible direct visualization of biologically interesting modes, and is complementary to the more time-consuming simulation of molecular dynamics trajectories. The essential assumption and limitation of normal-mode analysis is that the molecular potential energy varies quadratically. Our study starts with energy minimization of the X-ray co-ordinates with respect to the single-bond torsion angles. The main technical task is the calculation of second derivative matrices of kinetic and potential energy with respect to the torsion angle co-ordinates. These enter into a generalized eigenvalue problem, and the final eigenvalues and eigenvectors provide a complete description of the motion in the basic 0.1 to 10 picosecond range. Thermodynamic averages of amplitudes, fluctuations and correlations can be calculated efficiently using analytical formulae. The general method presented here is applied to four proteins, trypsin inhibitor, crambin, ribonuclease and lysozyme. When the resulting atomic motion is visualized by computer graphics, it is clear that the motion of each protein is collective with all atoms participating in each mode. The slow modes, with frequencies of below 10 cm-1 (a period of 3 ps), are the most interesting in that the motion in these modes is segmental. The root-mean-square atomic fluctuations, which are dominated by a few slow modes, agree well with experimental temperature factors (B values). The normal-mode dynamics of these four proteins have many features in common, although in the larger molecules, lysozyme and ribonuclease, there is low frequency domain motion about the active site.

A parametric method for determining the number of signals in narrow-band direction finding

NASA Astrophysics Data System (ADS)

Wu, Qiang; Fuhrmann, Daniel R.

1991-08-01

A novel and more accurate method to determine the number of signals in the multisource direction finding problem is developed. The information-theoretic criteria of Yin and Krishnaiah (1988) are applied to a set of quantities which are evaluated from the log-likelihood function. Based on proven asymptotic properties of the maximum likelihood estimation, these quantities have the properties required by the criteria. Since the information-theoretic criteria use these quantities instead of the eigenvalues of the estimated correlation matrix, this approach possesses the advantage of not requiring a subjective threshold, and also provides higher performance than when eigenvalues are used. Simulation results are presented and compared to those obtained from the nonparametric method given by Wax and Kailath (1985).

Spectral properties of the massless relativistic quartic oscillator

NASA Astrophysics Data System (ADS)

Durugo, Samuel O.; Lőrinczi, József

2018-03-01

An explicit solution of the spectral problem of the non-local Schrödinger operator obtained as the sum of the square root of the Laplacian and a quartic potential in one dimension is presented. The eigenvalues are obtained as zeroes of special functions related to the fourth order Airy function, and closed formulae for the Fourier transform of the eigenfunctions are derived. These representations allow to derive further spectral properties such as estimates of spectral gaps, heat trace and the asymptotic distribution of eigenvalues, as well as a detailed analysis of the eigenfunctions. A subtle spectral effect is observed which manifests in an exponentially tight approximation of the spectrum by the zeroes of the dominating term in the Fourier representation of the eigenfunctions and its derivative.

Computationally efficient finite-difference modal method for the solution of Maxwell's equations.

PubMed

Semenikhin, Igor; Zanuccoli, Mauro

2013-12-01

In this work, a new implementation of the finite-difference (FD) modal method (FDMM) based on an iterative approach to calculate the eigenvalues and corresponding eigenfunctions of the Helmholtz equation is presented. Two relevant enhancements that significantly increase the speed and accuracy of the method are introduced. First of all, the solution of the complete eigenvalue problem is avoided in favor of finding only the meaningful part of eigenmodes by using iterative methods. Second, a multigrid algorithm and Richardson extrapolation are implemented. Simultaneous use of these techniques leads to an enhancement in terms of accuracy, which allows a simple method such as the FDMM with a typical three-point difference scheme to be significantly competitive with an analytical modal method.

The Generalized Uncertainty Principle and Harmonic Interaction in Three Spatial Dimensions

NASA Astrophysics Data System (ADS)

Hassanabadi, H.; Hooshmand, P.; Zarrinkamar, S.

2015-01-01

In three spatial dimensions, the generalized uncertainty principle is considered under an isotropic harmonic oscillator interaction in both non-relativistic and relativistic regions. By using novel transformations and separations of variables, the exact analytical solution of energy eigenvalues as well as the wave functions is obtained. Time evolution of the non-relativistic region is also reported.

Three-body Coulomb systems using generalized angular-momentum S states

NASA Technical Reports Server (NTRS)

Whitten, R. C.; Sims, J. S.

1974-01-01

An expansion of the three-body Coulomb potential in generalized angular-momentum eigenfunctions developed earlier by one of the authors is used to compute energy eigenvalues and eigenfunctions of bound S states of three-body Coulomb systems. The results for He, H(-), e(-)e(+)e(-), and pmu(-)p are compared with the results of other computational approaches.

Double layers without current

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perkins, F.W.; Sun, Y.C.

1980-11-01

The steady-state solution of the nonlinear Vlasov-Poisson equations is reduced to a nonlinear eigenvalue problem for the case of double-layer (potential drop) boundary conditions. Solutions with no relative electron-ion drifts are found. The kinetic stability is discussed. Suggestions for creating these states in experiments and computer simulations are offered.

On Dynamics of Spinning Structures

NASA Technical Reports Server (NTRS)

Gupta, K. K.; Ibrahim, A.

2012-01-01

This paper provides details of developments pertaining to vibration analysis of gyroscopic systems, that involves a finite element structural discretization followed by the solution of the resulting matrix eigenvalue problem by a progressive, accelerated simultaneous iteration technique. Thus Coriolis, centrifugal and geometrical stiffness matrices are derived for shell and line elements, followed by the eigensolution details as well as solution of representative problems that demonstrates the efficacy of the currently developed numerical procedures and tools.

Polynomial modal analysis of slanted lamellar gratings.

PubMed

Granet, Gérard; Randriamihaja, Manjakavola Honore; Raniriharinosy, Karyl

2017-06-01

The problem of diffraction by slanted lamellar dielectric and metallic gratings in classical mounting is formulated as an eigenvalue eigenvector problem. The numerical solution is obtained by using the moment method with Legendre polynomials as expansion and test functions, which allows us to enforce in an exact manner the boundary conditions which determine the eigensolutions. Our method is successfully validated by comparison with other methods including in the case of highly slanted gratings.

The Shock and Vibration Digest, Volume 18, Number 3

DTIC Science & Technology

1986-03-01

Linear Distributed Parameter Des., Proc. Intl. Symp., 11th ONR Naval Struc. Systems by Shifted Legendre Polynomial Func- Mech. Symp., Tucson, AZ, pp...University, Atlanta, Georgia nonlinear problems with elementary algebra . It J. Sound Vib., 102 (2), pp 247-257 (Sept 22, uses i = -1, the Pascal’s...eigenvalues specified. The optimal avoid failure due to resonance under the action control problem of a linear distributed parameter 0School of Mechanical

The three-body problem with short-range interactions

NASA Astrophysics Data System (ADS)

Nielsen, E.; Fedorov, D. V.; Jensen, A. S.; Garrido, E.

2001-06-01

The quantum mechanical three-body problem is studied for general short-range interactions. We work in coordinate space to facilitate accurate computations of weakly bound and spatially extended systems. Hyperspherical coordinates are used in both the interpretation and as an integral part of the numerical method. Universal properties and model independence are discussed throughout the report. We present an overview of the hyperspherical adiabatic Faddeev equations. The wave function is expanded on hyperspherical angular eigenfunctions which in turn are found numerically using the Faddeev equations. We generalize the formalism to any dimension of space d greater or equal to two. We present two numerical techniques for solving the Faddeev equations on the hypersphere. These techniques are effective for short and intermediate/large distances including use for hard core repulsive potentials. We study the asymptotic limit of large hyperradius and derive the analytic behaviour of the angular eigenvalues and eigenfunctions. We discuss four applications of the general method. We first analyze the Efimov and Thomas effects for arbitrary angular momenta and for arbitrary dimensions d. Second we apply the method to extract the general behaviour of weakly bound three-body systems in two dimensions. Third we illustrate the method in three dimensions by structure computations of Borromean halo nuclei, the hypertriton and helium molecules. Fourth we investigate in three dimensions three-body continuum properties of Borromean halo nuclei and recombination reactions of helium atoms as an example of direct relevance for the stability of Bose-Einstein condensates.

Computing Evans functions numerically via boundary-value problems

NASA Astrophysics Data System (ADS)

Barker, Blake; Nguyen, Rose; Sandstede, Björn; Ventura, Nathaniel; Wahl, Colin

2018-03-01

The Evans function has been used extensively to study spectral stability of travelling-wave solutions in spatially extended partial differential equations. To compute Evans functions numerically, several shooting methods have been developed. In this paper, an alternative scheme for the numerical computation of Evans functions is presented that relies on an appropriate boundary-value problem formulation. Convergence of the algorithm is proved, and several examples, including the computation of eigenvalues for a multi-dimensional problem, are given. The main advantage of the scheme proposed here compared with earlier methods is that the scheme is linear and scalable to large problems.

Cluster structure in the correlation coefficient matrix can be characterized by abnormal eigenvalues

NASA Astrophysics Data System (ADS)

Nie, Chun-Xiao

2018-02-01

In a large number of previous studies, the researchers found that some of the eigenvalues of the financial correlation matrix were greater than the predicted values of the random matrix theory (RMT). Here, we call these eigenvalues as abnormal eigenvalues. In order to reveal the hidden meaning of these abnormal eigenvalues, we study the toy model with cluster structure and find that these eigenvalues are related to the cluster structure of the correlation coefficient matrix. In this paper, model-based experiments show that in most cases, the number of abnormal eigenvalues of the correlation matrix is equal to the number of clusters. In addition, empirical studies show that the sum of the abnormal eigenvalues is related to the clarity of the cluster structure and is negatively correlated with the correlation dimension.

Computer Solution of the Schrodinger Equation--Two Useful Programs.

ERIC Educational Resources Information Center

Evans, D. E.

1980-01-01

Describes a general purpose algorithm which enables one to calculate the allowed energy eigenvalues for an arbitrary potential. Results of a calculation where a centrifugal potential is added to the hydrogenic Coulomb potential are discussed. (Author/HM)

Approximate bound-state solutions of the Dirac equation for the generalized yukawa potential plus the generalized tensor interaction

NASA Astrophysics Data System (ADS)

Ikot, Akpan N.; Maghsoodi, Elham; Hassanabadi, Hassan; Obu, Joseph A.

2014-05-01

In this paper, we obtain the approximate analytical bound-state solutions of the Dirac particle with the generalized Yukawa potential within the framework of spin and pseudospin symmetries for the arbitrary к state with a generalized tensor interaction. The generalized parametric Nikiforov-Uvarov method is used to obtain the energy eigenvalues and the corresponding wave functions in closed form. We also report some numerical results and present figures to show the effect of the tensor interaction.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Venkatesan, R.C., E-mail: ravi@systemsresearchcorp.com; Plastino, A., E-mail: plastino@fisica.unlp.edu.ar

The (i) reciprocity relations for the relative Fisher information (RFI, hereafter) and (ii) a generalized RFI–Euler theorem are self-consistently derived from the Hellmann–Feynman theorem. These new reciprocity relations generalize the RFI–Euler theorem and constitute the basis for building up a mathematical Legendre transform structure (LTS, hereafter), akin to that of thermodynamics, that underlies the RFI scenario. This demonstrates the possibility of translating the entire mathematical structure of thermodynamics into a RFI-based theoretical framework. Virial theorems play a prominent role in this endeavor, as a Schrödinger-like equation can be associated to the RFI. Lagrange multipliers are determined invoking the RFI–LTS linkmore » and the quantum mechanical virial theorem. An appropriate ansatz allows for the inference of probability density functions (pdf’s, hereafter) and energy-eigenvalues of the above mentioned Schrödinger-like equation. The energy-eigenvalues obtained here via inference are benchmarked against established theoretical and numerical results. A principled theoretical basis to reconstruct the RFI-framework from the FIM framework is established. Numerical examples for exemplary cases are provided. - Highlights: • Legendre transform structure for the RFI is obtained with the Hellmann–Feynman theorem. • Inference of the energy-eigenvalues of the SWE-like equation for the RFI is accomplished. • Basis for reconstruction of the RFI framework from the FIM-case is established. • Substantial qualitative and quantitative distinctions with prior studies are discussed.« less

Uncovering the Internal Structure of the Indian Financial Market: Large Cross-correlation Behavior in the NSE

NASA Astrophysics Data System (ADS)

Sinha, Sitabhra; Pan, Raj Kumar

The cross-correlations between price fluctuations of 201 frequently traded stocks in the National Stock Exchange (NSE) of India are analyzed in this paper. We use daily closing prices for the period 1996-2006, which coincides with the period of rapid transformation of the market following liberalization. The eigenvalue distribution of the cross-correlation matrix, C, of NSE is found to be similar to that of developed markets, such as the New York Stock Exchange (NYSE): the majority of eigenvalues fall within the bounds expected for a random matrix constructed from mutually uncorrelated time series. Of the few largest eigenvalues that deviate from the bulk, the largest is identified with market-wide movements. The intermediate eigenvalues that occur between the largest and the bulk have been associated in NYSE with specific business sectors with strong intra-group interactions. However, in the Indian market, these deviating eigenvalues are comparatively very few and lie much closer to the bulk. We propose that this is because of the relative lack of distinct sector identity in the market, with the movement of stocks dominantly influenced by the overall market trend. This is shown by explicit construction of the interaction network in the market, first by generating the minimum spanning tree from the unfiltered correlation matrix, and later, using an improved method of generating the graph after filtering out the market mode and random effects from the data. Both methods show, compared to developed markets, the relative absence of clusters of co-moving stocks that belong to the same business sector. This is consistent with the general belief that emerging markets tend to be more correlated than developed markets.

Solving the transport equation with quadratic finite elements: Theory and applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ferguson, J.M.

1997-12-31

At the 4th Joint Conference on Computational Mathematics, the author presented a paper introducing a new quadratic finite element scheme (QFEM) for solving the transport equation. In the ensuing year the author has obtained considerable experience in the application of this method, including solution of eigenvalue problems, transmission problems, and solution of the adjoint form of the equation as well as the usual forward solution. He will present detailed results, and will also discuss other refinements of his transport codes, particularly for 3-dimensional problems on rectilinear and non-rectilinear grids.

On Statistics of Bi-Orthogonal Eigenvectors in Real and Complex Ginibre Ensembles: Combining Partial Schur Decomposition with Supersymmetry

NASA Astrophysics Data System (ADS)

Fyodorov, Yan V.

2018-06-01

We suggest a method of studying the joint probability density (JPD) of an eigenvalue and the associated `non-orthogonality overlap factor' (also known as the `eigenvalue condition number') of the left and right eigenvectors for non-selfadjoint Gaussian random matrices of size {N× N} . First we derive the general finite N expression for the JPD of a real eigenvalue {λ} and the associated non-orthogonality factor in the real Ginibre ensemble, and then analyze its `bulk' and `edge' scaling limits. The ensuing distribution is maximally heavy-tailed, so that all integer moments beyond normalization are divergent. A similar calculation for a complex eigenvalue z and the associated non-orthogonality factor in the complex Ginibre ensemble is presented as well and yields a distribution with the finite first moment. Its `bulk' scaling limit yields a distribution whose first moment reproduces the well-known result of Chalker and Mehlig (Phys Rev Lett 81(16):3367-3370, 1998), and we provide the `edge' scaling distribution for this case as well. Our method involves evaluating the ensemble average of products and ratios of integer and half-integer powers of characteristic polynomials for Ginibre matrices, which we perform in the framework of a supersymmetry approach. Our paper complements recent studies by Bourgade and Dubach (The distribution of overlaps between eigenvectors of Ginibre matrices, 2018. arXiv:1801.01219).

Propagation and scattering of acoustic-vorticity waves in annular swirling flows

NASA Astrophysics Data System (ADS)

Golubev, Vladimir Viktorovich

1997-08-01

The dissertation presents a fundamental extension of unsteady aerodynamic theory developed to predict fluctuating forces on aircraft structural components. These excitations may result from a variety of upstream flow non-uniformities such as atmospheric turbulence, airframe tip vortices and wakes, engine inlet distortions and secondary flows. In the frame of reference of a downstream aircraft component, an upstream flow non- uniformity appears as a propagating vorticity wave (a gust). Classical treatment of gust interaction problems developed for uniform, potential upstream mean flows is based on the fact that it is possible to consider separately incident or scattered acoustic, entropic and vortical modes of unsteady flow motion. A purely vortical gust remains 'frozen' as it convects with the flow. The coupling between different unsteady components may occur only at the surface of a solid structure, or in the close vicinity of a lifting body. The classical approach, however, is not justified for an aircraft engine system where the internal turbomachinery flow is non-uniform and non-potential as it exhibits a strong swirling motion. In such a flow, acting centrifugal and Coriolis forces couple the various unsteady modes which thus can no longer be determined independently of each other. The new developed theory follows the decomposition of unsteady velocity field into vortical and potential components. In spite of the modal coupling, this decomposition elucidates the physical phenomena associated with unsteady swirling motion by indicating the degree of interaction between the various modes. It paves the way for generalizing the classical definition of a gust for vortical swirling flows. The concept of a generalized gust is developed based on the eigenmode pseudospectral analysis of the coupled equations of unsteady swirling motion. This analysis reveals two distinct regions of eigenvalues corresponding to pressure-dominated nearly-sonic and vorticity- dominated nearly-convected eigenmodes. A compact discrete spectrum of nearly-convected eigenvalues clusters with infinitely increasing density approaching an accumulation convected critical layer. The generalized gust is then identified with the nearly-convected eigenspectrum and formulated in terms of a non-amplifying nearly-convected wave and an instability wave growing in the critical layer. Based on the generalized gust model, a boundary-value problem of unsteady three-dimensional acoustic-vorticity waves propagating in a vortical swirling flow and impinging on a turbomachinery blading is formulated and solved numerically. A set of benchmark results reveals a significant effect of swirling flow motion on aerodynamic and acoustic response of the annular cascade.

The discrete hungry Lotka Volterra system and a new algorithm for computing matrix eigenvalues

NASA Astrophysics Data System (ADS)

Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa

2009-01-01

The discrete hungry Lotka-Volterra (dhLV) system is a generalization of the discrete Lotka-Volterra (dLV) system which stands for a prey-predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix.

Neural network approach for the calculation of potential coefficients in quantum mechanics

NASA Astrophysics Data System (ADS)

Ossandón, Sebastián; Reyes, Camilo; Cumsille, Patricio; Reyes, Carlos M.

2017-05-01

A numerical method based on artificial neural networks is used to solve the inverse Schrödinger equation for a multi-parameter class of potentials. First, the finite element method was used to solve repeatedly the direct problem for different parametrizations of the chosen potential function. Then, using the attainable eigenvalues as a training set of the direct radial basis neural network a map of new eigenvalues was obtained. This relationship was later inverted and refined by training an inverse radial basis neural network, allowing the calculation of the unknown parameters and therefore estimating the potential function. Three numerical examples are presented in order to prove the effectiveness of the method. The results show that the method proposed has the advantage to use less computational resources without a significant accuracy loss.

Resonance Extraction from the Finite Volume

DOE Office of Scientific and Technical Information (OSTI.GOV)

Doring, Michael; Molina Peralta, Raquel

2016-06-01

The spectrum of excited hadrons becomes accessible in simulations of Quantum Chromodynamics on the lattice. Extensions of Lüscher's method allow to address multi-channel scattering problems using moving frames or modified boundary conditions to obtain more eigenvalues in finite volume. As these are at different energies, interpolations are needed to relate different eigenvalues and to help determine the amplitude. Expanding the T- or the K-matrix locally provides a controlled scheme by removing the known non-analyticities of thresholds. This can be stabilized by using Chiral Perturbation Theory. Different examples to determine resonance pole parameters and to disentangle resonances from thresholds are dis-more » cussed, like the scalar meson f0(980) and the excited baryons N(1535)1/2^- and Lambda(1405)1/2^-.« less

Quantum mechanics on space with SU(2) fuzziness

NASA Astrophysics Data System (ADS)

Fatollahi, Amir H.; Shariati, Ahmad; Khorrami, Mohammad

2009-04-01

Quantum mechanics of models is considered which are constructed in spaces with Lie algebra type commutation relations between spatial coordinates. The case is specialized to that of the group SU(2), for which the formulation of the problem via the Euler parameterization is also presented. SU(2)-invariant systems are discussed, and the corresponding eigenvalue problem for the Hamiltonian is reduced to an ordinary differential equation, as is the case with such models on commutative spaces.

Comments on numerical solution of boundary value problems of the Laplace equation and calculation of eigenvalues by the grid method

NASA Technical Reports Server (NTRS)

Lyusternik, L. A.

1980-01-01

The mathematics involved in numerically solving for the plane boundary value of the Laplace equation by the grid method is developed. The approximate solution of a boundary value problem for the domain of the Laplace equation by the grid method consists of finding u at the grid corner which satisfies the equation at the internal corners (u=Du) and certain boundary value conditions at the boundary corners.

Acoustic-Liner Admittance in a Duct

NASA Technical Reports Server (NTRS)

Watson, W. R.

1986-01-01

Method calculates admittance from easily obtainable values. New method for calculating acoustic-liner admittance in rectangular duct with grazing flow based on finite-element discretization of acoustic field and reposing of unknown admittance value as linear eigenvalue problem on admittance value. Problem solved by Gaussian elimination. Unlike existing methods, present method extendable to mean flows with two-dimensional boundary layers as well. In presence of shear, results of method compared well with results of Runge-Kutta integration technique.

Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

NASA Technical Reports Server (NTRS)

Ito, K.; Teglas, R.

1984-01-01

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

NASA Technical Reports Server (NTRS)

Ito, Kazufumi; Teglas, Russell

1987-01-01

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

An eigenvalue approach to quantum plasmonics based on a self-consistent hydrodynamics method

NASA Astrophysics Data System (ADS)

Ding, Kun; Chan, C. T.

2018-02-01

Plasmonics has attracted much attention not only because it has useful properties such as strong field enhancement, but also because it reveals the quantum nature of matter. To handle quantum plasmonics effects, ab initio packages or empirical Feibelman d-parameters have been used to explore the quantum correction of plasmonic resonances. However, most of these methods are formulated within the quasi-static framework. The self-consistent hydrodynamics model offers a reliable approach to study quantum plasmonics because it can incorporate the quantum effect of the electron gas into classical electrodynamics in a consistent manner. Instead of the standard scattering method, we formulate the self-consistent hydrodynamics method as an eigenvalue problem to study quantum plasmonics with electrons and photons treated on the same footing. We find that the eigenvalue approach must involve a global operator, which originates from the energy functional of the electron gas. This manifests the intrinsic nonlocality of the response of quantum plasmonic resonances. Our model gives the analytical forms of quantum corrections to plasmonic modes, incorporating quantum electron spill-out effects and electrodynamical retardation. We apply our method to study the quantum surface plasmon polariton for a single flat interface.

Eigensolutions of nonviscously damped systems based on the fixed-point iteration

NASA Astrophysics Data System (ADS)

Lázaro, Mario

2018-03-01

In this paper, nonviscous, nonproportional, symmetric vibrating structures are considered. Nonviscously damped systems present dissipative forces depending on the time history of the response via kernel hereditary functions. Solutions of the free motion equation leads to a nonlinear eigenvalue problem involving mass, stiffness and damping matrices, this latter as dependent on frequency. Viscous damping can be considered as a particular case, involving damping forces as function of the instantaneous velocity of the degrees of freedom. In this work, a new numerical procedure to compute eigensolutions is proposed. The method is based on the construction of certain recursive functions which, under a iterative scheme, allow to reach eigenvalues and eigenvectors simultaneously and avoiding computation of eigensensitivities. Eigenvalues can be read then as fixed-points of those functions. A deep analysis of the convergence is carried out, focusing specially on relating the convergence conditions and error-decay rate to the damping model features, such as the nonproportionality and the viscoelasticity. The method is validated using two 6 degrees of freedom numerical examples involving both nonviscous and viscous damping and a continuous system with a local nonviscous damper. The convergence and the sequences behavior are in agreement with the results foreseen by the theory.

Correlation between use time of machine and decline curve for emerging enterprise information systems

NASA Astrophysics Data System (ADS)

Chang, Yao-Chung; Lai, Chin-Feng; Chuang, Chi-Cheng; Hou, Cheng-Yu

2018-04-01

With the progress of science and technology, more and more machines are adpot to help human life better and more convenient. When the machines have been used for a longer period of time so that the machine components are getting old, the amount of power comsumption will increase and easily cause the machine to overheat. This also causes a waste of invisible resources. If the Internet of Everything (IoE) technologies are able to be applied into the enterprise information systems for monitoring the machines use time, it can not only make energy can be effectively used, but aslo create a safer living environment. To solve the above problem, the correlation predict model is established to collect the data of power consumption converted into power eigenvalues. This study takes the power eigenvalue as the independent variable and use time as the dependent variable in order to establish the decline curve. Ultimately, the scoring and estimation modules are employed to seek the best power eigenvalue as the independent variable. To predict use time, the correlation is discussed between the use time and the decline curve to improve the entire behavioural analysis of the facilitate recognition of the use time of machines.

Unifying perspective: Solitary traveling waves as discrete breathers in Hamiltonian lattices and energy criteria for their stability

NASA Astrophysics Data System (ADS)

Cuevas-Maraver, Jesús; Kevrekidis, Panayotis G.; Vainchtein, Anna; Xu, Haitao

2017-09-01

In this work, we provide two complementary perspectives for the (spectral) stability of solitary traveling waves in Hamiltonian nonlinear dynamical lattices, of which the Fermi-Pasta-Ulam and the Toda lattice are prototypical examples. One is as an eigenvalue problem for a stationary solution in a cotraveling frame, while the other is as a periodic orbit modulo shifts. We connect the eigenvalues of the former with the Floquet multipliers of the latter and using this formulation derive an energy-based spectral stability criterion. It states that a sufficient (but not necessary) condition for a change in the wave stability occurs when the functional dependence of the energy (Hamiltonian) H of the model on the wave velocity c changes its monotonicity. Moreover, near the critical velocity where the change of stability occurs, we provide an explicit leading-order computation of the unstable eigenvalues, based on the second derivative of the Hamiltonian H''(c0) evaluated at the critical velocity c0. We corroborate this conclusion with a series of analytically and numerically tractable examples and discuss its parallels with a recent energy-based criterion for the stability of discrete breathers.

A new method of passive modifications for partial frequency assignment of general structures

NASA Astrophysics Data System (ADS)

Belotti, Roberto; Ouyang, Huajiang; Richiedei, Dario

2018-01-01

The assignment of a subset of natural frequencies to vibrating systems can be conveniently achieved by means of suitable structural modifications. It has been observed that such an approach usually leads to the undesired change of the unassigned natural frequencies, which is a phenomenon known as frequency spill-over. Such an issue has been dealt with in the literature only in simple specific cases. In this paper, a new and general method is proposed that aims to assign a subset of natural frequencies with low spill-over. The optimal structural modifications are determined through a three-step procedure that considers both the prescribed eigenvalues and the feasibility constraints, assuring that the obtained solution is physically realizable. The proposed method is therefore applicable to very general vibrating systems, such as those obtained through the finite element method. The numerical difficulties that may occur as a result of employing the method are also carefully addressed. Finally, the capabilities of the method are validated in three test-cases in which both lumped and distributed parameters are modified to obtain the desired eigenvalues.

Exceptional points of resonant states on a periodic slab

NASA Astrophysics Data System (ADS)

Abdrabou, Amgad; Lu, Ya Yan

2018-06-01

A special kind of degeneracy, known as exceptional points (EPs), for resonant states on a dielectric periodic slab are investigated. Due to their unique properties, EPs have found important applications in lasing, sensing, unidirectional operations, etc. In general, EPs may appear in non-Hermitian eigenvalue problems, including those related to -parity-time-symmetric systems and those for open dielectric structures (due to the existence of radiation loss). In this paper, we study EPs on a simple periodic structure: a slab with a periodic array of gaps. By using an efficient numerical method, we calculate the EPs and study their dependence on geometric parameters. Analytic results are obtained for the limit as the periodic slab approaches a uniform one. Our work provides a simple platform for further studies concerning EPs on dielectric periodic structures, their unusual properties, and applications.

Free Vibration Study of Anti-Symmetric Angle-Ply Laminated Plates under Clamped Boundary Conditions

NASA Astrophysics Data System (ADS)

Viswanathan, K. K.; Karthik, K.; Sanyasiraju, Y. V. S. S.; Aziz, Z. A.

2016-11-01

Two type of numerical approach namely, Radial Basis Function and Spline approximation, used to analyse the free vibration of anti-symmetric angle-ply laminated plates under clamped boundary conditions. The equations of motion are derived using YNS theory under first order shear deformation. By assuming the solution in separable form, coupled differential equations obtained in term of mid-plane displacement and rotational functions. The coupled differential is then approximated using Spline function and radial basis function to obtain the generalize eigenvalue problem and parametric studies are made to investigate the effect of aspect ratio, length-to-thickness ratio, number of layers, fibre orientation and material properties with respect to the frequency parameter. Some results are compared with the existing literature and other new results are given in tables and graphs.

Efficient swimming of an assembly of rigid spheres at low Reynolds number.

PubMed

Felderhof, B U

2015-08-01

The swimming of an assembly of rigid spheres immersed in a viscous fluid of infinite extent is studied in low-Reynolds-number hydrodynamics. The instantaneous swimming velocity and rate of dissipation are expressed in terms of the time-dependent displacements of sphere centers about their collective motion. For small-amplitude swimming with periodically oscillating displacements, optimization of the mean swimming speed at given mean power leads to an eigenvalue problem involving a velocity matrix and a power matrix. The corresponding optimal stroke permits generalization to large-amplitude motion in a model of spheres with harmonic interactions and corresponding actuating forces. The method allows straightforward calculation of the swimming performance of structures modeled as assemblies of interacting rigid spheres. A model of three collinear spheres with motion along the common axis is studied as an example.

Fast noise level estimation algorithm based on principal component analysis transform and nonlinear rectification

NASA Astrophysics Data System (ADS)

Xu, Shaoping; Zeng, Xiaoxia; Jiang, Yinnan; Tang, Yiling

2018-01-01

We proposed a noniterative principal component analysis (PCA)-based noise level estimation (NLE) algorithm that addresses the problem of estimating the noise level with a two-step scheme. First, we randomly extracted a number of raw patches from a given noisy image and took the smallest eigenvalue of the covariance matrix of the raw patches as the preliminary estimation of the noise level. Next, the final estimation was directly obtained with a nonlinear mapping (rectification) function that was trained on some representative noisy images corrupted with different known noise levels. Compared with the state-of-art NLE algorithms, the experiment results show that the proposed NLE algorithm can reliably infer the noise level and has robust performance over a wide range of image contents and noise levels, showing a good compromise between speed and accuracy in general.

The inviscid stability of supersonic flow past heated or cooled axisymmetric bodies

NASA Technical Reports Server (NTRS)

Shaw, Stephen J.; Duck, Peter W.

1992-01-01

The inviscid, linear, nonaxisymmetric, temporal stability of the boundary layer associated with the supersonic flow past axisymmetric bodies (with particular emphasis on long thin, straight circular cylinders), subject to heated or cooled wall conditions is investigated. The eigenvalue problem is computed in some detail for a particular Mach number or 3.8, revealing that the effect of curvature and the choice of wall conditions both have a significant effect on the stability of the flow. Both the asymptotic, large azimuthal wavenumber solution and the asymptotic, far downstream solution are obtained for the stability analysis and compared with numerical results. Additionally, asymptotic analyses valid for large radii of curvature with cooled/heated wall conditions are presented. In general, important differences were found to exist between the wall temperature conditions imposed and the adiabatic wall conditions considered previously.

The inviscid stability of supersonic flow past heated or cooled axisymmetric bodies

NASA Technical Reports Server (NTRS)

Shaw, Stephen J.; Duck, Peter W.

1990-01-01

The inviscid, linear, nonaxisymmetric, temporal stability of the boundary layer associated with the supersonic flow past axisymmetric bodies (with particular emphasis on long thin, straight circular cylinders), subject to heated or cooled wall conditions is investigated. The eigenvalue problem is computed in some detail for a particular Mach number or 3.8, revealing that the effect of curvature and the choice of wall conditions both have a significant effect on the stability of the flow. Both the asymptotic, large azimuthal wavenumber solution and the asymptotic, far downstream solution are obtained for the stability analysis and compared with numerical results. Additionally, asymptotic analyses valid for large radii of curvature with cooled/heated wall conditions, are presented. In general, important differences were found to exist between the wall temperature conditions imposed and the adiabatic wall conditions considered previously.

Non-perturbative background field calculations

NASA Astrophysics Data System (ADS)

Stephens, C. R.

1988-01-01

New methods are developed for calculating one loop functional determinants in quantum field theory. Instead of relying on a calculation of all the eigenvalues of the small fluctuation equation, these techniques exploit the ability of the proper time formalism to reformulate an infinite dimensional field theoretic problem into a finite dimensional covariant quantum mechanical analog, thereby allowing powerful tools such as the method of Jacobi fields to be used advantageously in a field theory setting. More generally the methods developed herein should be extremely valuable when calculating quantum processes in non-constant background fields, offering a utilitarian alternative to the two standard methods of calculation—perturbation theory in the background field or taking the background field into account exactly. The formalism developed also allows for the approximate calculation of covariances of partial differential equations from a knowledge of the solutions of a homogeneous ordinary differential equation.

Overview of Krylov subspace methods with applications to control problems

NASA Technical Reports Server (NTRS)

Saad, Youcef

1989-01-01

An overview of projection methods based on Krylov subspaces are given with emphasis on their application to solving matrix equations that arise in control problems. The main idea of Krylov subspace methods is to generate a basis of the Krylov subspace Span and seek an approximate solution the the original problem from this subspace. Thus, the original matrix problem of size N is approximated by one of dimension m typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now just becoming popular for solving nonlinear equations. It is shown how they can be used to solve partial pole placement problems, Sylvester's equation, and Lyapunov's equation.

Classical Trajectories and Quantum Spectra

NASA Technical Reports Server (NTRS)

Mielnik, Bogdan; Reyes, Marco A.

1996-01-01

A classical model of the Schrodinger's wave packet is considered. The problem of finding the energy levels corresponds to a classical manipulation game. It leads to an approximate but non-perturbative method of finding the eigenvalues, exploring the bifurcations of classical trajectories. The role of squeezing turns out decisive in the generation of the discrete spectra.

Homogenization of Winkler-Steklov spectral conditions in three-dimensional linear elasticity

NASA Astrophysics Data System (ADS)

Gómez, D.; Nazarov, S. A.; Pérez, M. E.

2018-04-01

We consider a homogenization Winkler-Steklov spectral problem that consists of the elasticity equations for a three-dimensional homogeneous anisotropic elastic body which has a plane part of the surface subject to alternating boundary conditions on small regions periodically placed along the plane. These conditions are of the Dirichlet type and of the Winkler-Steklov type, the latter containing the spectral parameter. The rest of the boundary of the body is fixed, and the period and size of the regions, where the spectral parameter arises, are of order ɛ . For fixed ɛ , the problem has a discrete spectrum, and we address the asymptotic behavior of the eigenvalues {β _k^ɛ }_{k=1}^{∞} as ɛ → 0. We show that β _k^ɛ =O(ɛ ^{-1}) for each fixed k, and we observe a common limit point for all the rescaled eigenvalues ɛ β _k^ɛ while we make it evident that, although the periodicity of the structure only affects the boundary conditions, a band-gap structure of the spectrum is inherited asymptotically. Also, we provide the asymptotic behavior for certain "groups" of eigenmodes.

The cosmological constant as an eigenvalue of a Sturm-Liouville problem

NASA Astrophysics Data System (ADS)

Astashenok, Artyom V.; Elizalde, Emilio; Yurov, Artyom V.

2014-01-01

It is observed that one of Einstein-Friedmann's equations has formally the aspect of a Sturm-Liouville problem, and that the cosmological constant, Λ, plays thereby the role of spectral parameter (what hints to its connection with the Casimir effect). The subsequent formulation of appropriate boundary conditions leads to a set of admissible values for Λ, considered as eigenvalues of the corresponding linear operator. Simplest boundary conditions are assumed, namely that the eigenfunctions belong to L 2 space, with the result that, when all energy conditions are satisfied, they yield a discrete spectrum for Λ>0 and a continuous one for Λ<0. A very interesting situation is seen to occur when the discrete spectrum contains only one point: then, there is the possibility to obtain appropriate cosmological conditions without invoking the anthropic principle. This possibility is shown to be realized in cyclic cosmological models, provided the potential of the matter field is similar to the potential of the scalar field. The dynamics of the universe in this case contains a sudden future singularity.

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pieper, Andreas; Kreutzer, Moritz; Alvermann, Andreas, E-mail: alvermann@physik.uni-greifswald.de

2016-11-15

We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need formore » matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.« less

Predicting the stability of a compressible periodic parallel jet flow

NASA Technical Reports Server (NTRS)

Miles, Jeffrey H.

1996-01-01

It is known that mixing enhancement in compressible free shear layer flows with high convective Mach numbers is difficult. One design strategy to get around this is to use multiple nozzles. Extrapolating this design concept in a one dimensional manner, one arrives at an array of parallel rectangular nozzles where the smaller dimension is omega and the longer dimension, b, is taken to be infinite. In this paper, the feasibility of predicting the stability of this type of compressible periodic parallel jet flow is discussed. The problem is treated using Floquet-Bloch theory. Numerical solutions to this eigenvalue problem are presented. For the case presented, the interjet spacing, s, was selected so that s/omega =2.23. Typical plots of the eigenvalue and stability curves are presented. Results obtained for a range of convective Mach numbers from 3 to 5 show growth rates omega(sub i)=kc(sub i)/2 range from 0.25 to 0.29. These results indicate that coherent two-dimensional structures can occur without difficulty in multiple parallel periodic jet nozzles and that shear layer mixing should occur with this type of nozzle design.

Calculation and measurement of radiation corrections for plasmon resonances in nanoparticles

NASA Astrophysics Data System (ADS)

Hung, L.; Lee, S. Y.; McGovern, O.; Rabin, O.; Mayergoyz, I.

2013-08-01

The problem of plasmon resonances in metallic nanoparticles can be formulated as an eigenvalue problem under the condition that the wavelengths of the incident radiation are much larger than the particle dimensions. As the nanoparticle size increases, the quasistatic condition is no longer valid. For this reason, the accuracy of the electrostatic approximation may be compromised and appropriate radiation corrections for the calculation of resonance permittivities and resonance wavelengths are needed. In this paper, we present the radiation corrections in the framework of the eigenvalue method for plasmon mode analysis and demonstrate that the computational results accurately match analytical solutions (for nanospheres) and experimental data (for nanorings and nanocubes). We also demonstrate that the optical spectra of silver nanocube suspensions can be fully assigned to dipole-type resonance modes when radiation corrections are introduced. Finally, our method is used to predict the resonance wavelengths for face-to-face silver nanocube dimers on glass substrates. These results may be useful for the indirect measurements of the gaps in the dimers from extinction cross-section observations.

Large computer simulations on elastic networks: Small eigenvalues and eigenvalue spectra of the Kirchhoff matrix

NASA Astrophysics Data System (ADS)

Shy, L. Y.; Eichinger, B. E.

1989-05-01

Computer simulations of the formation of trifunctional and tetrafunctional polydimethyl-siloxane networks that are crosslinked by condensation of telechelic chains with multifunctional crosslinking agents have been carried out on systems containing up to 1.05×106 chains. Eigenvalue spectra of Kirchhoff matrices for these networks have been evaluated at two levels of approximation: (1) inclusion of all midchain modes, and (2) suppression of midchain modes. By use of the recursion method of Haydock and Nex, we have been able to effectively diagonalize matrices with 730 498 rows and columns without actually constructing matrices of this size. The small eigenvalues have been computed by use of the Lanczos algorithm. We demonstrate the following results: (1) The smallest eigenvalues (with chain modes suppressed) vary as μ-2/3 for sufficiently large μ, where μ is the number of junctions in the network; (2) the eigenvalue spectra of the Kirchhoff matrices are well described by McKay's theory for random regular graphs in the range of the larger eigenvalues, but there are significant departures in the region of small eigenvalues where computed spectra have many more small eigenvalues than random regular graphs; (3) the smallest eigenvalues vary as n-1.78 where n is the number of Rouse beads in the chains that comprise the network. Computations are done for both monodisperse and polydisperse chain length distributions. Large eigenvalues associated with localized motion of the junctions are found as predicted by theory. The relationship between the small eigenvalues and the equilibrium modulus of elasticity is discussed, as is the relationship between viscoelasticity and the band edge of the spectrum.

Generalized Preconditioned Locally Harmonic Residual Eigensolver (GPLHR) v0.1

DOE Office of Scientific and Technical Information (OSTI.GOV)

VECHARYNSKI, EUGENE; YANG, CHAO

The software contains a MATLAB implementation of the Generalized Preconditioned Locally Harmonic Residual (GPLHR) method for solving standard and generalized non-Hermitian eigenproblems. The method is particularly useful for computing a subset of eigenvalues, and their eigen- or Schur vectors, closest to a given shift. The proposed method is based on block iterations and can take advantage of a preconditioner if it is available. It does not need to perform exact shift-and-invert transformation. Standard and generalized eigenproblems are handled in a unified framework.

Truncated Linear Statistics Associated with the Eigenvalues of Random Matrices II. Partial Sums over Proper Time Delays for Chaotic Quantum Dots

NASA Astrophysics Data System (ADS)

Grabsch, Aurélien; Majumdar, Satya N.; Texier, Christophe

2017-06-01

Invariant ensembles of random matrices are characterized by the distribution of their eigenvalues \\{λ _1,\\ldots ,λ _N\\}. We study the distribution of truncated linear statistics of the form \\tilde{L}=\\sum _{i=1}^p f(λ _i) with p

JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices

NASA Astrophysics Data System (ADS)

Bollhöfer, Matthias; Notay, Yvan

2007-12-01

A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closest to some specified target, which may be in the interior of the spectrum. The underlying algorithm combines the Jacobi-Davidson method with efficient multilevel incomplete LU (ILU) preconditioning. Key features are modest memory requirements and robust convergence to accurate solutions. Parameters needed for incomplete LU preconditioning are automatically computed and may be updated at run time depending on the convergence pattern. The software is easy to use by non-experts and its top level routines are written in FORTRAN 77. Its potentialities are demonstrated on a few applications taken from computational physics. Program summaryProgram title: JADAMILU Catalogue identifier: ADZT_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADZT_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 101 359 No. of bytes in distributed program, including test data, etc.: 7 493 144 Distribution format: tar.gz Programming language: Fortran 77 Computer: Intel or AMD with g77 and pgf; Intel EM64T or Itanium with ifort; AMD Opteron with g77, pgf and ifort; Power (IBM) with xlf90. Operating system: Linux, AIX RAM: problem dependent Word size: real:8; integer: 4 or 8, according to user's choice Classification: 4.8 Nature of problem: Any physical problem requiring the computation of a few eigenvalues of a symmetric matrix. Solution method: Jacobi-Davidson combined with multilevel ILU preconditioning. Additional comments: We supply binaries rather than source code because JADAMILU uses the following external packages: MC64. This software is copyrighted software and not freely available. COPYRIGHT (c) 1999 Council for the Central Laboratory of the Research Councils. AMD. Copyright (c) 2004-2006 by Timothy A. Davis, Patrick R. Amestoy, and Iain S. Duff. Source code is distributed by the authors under the GNU LGPL licence. BLAS. The reference BLAS is a freely-available software package. It is available from netlib via anonymous ftp and the World Wide Web. LAPACK. The complete LAPACK package or individual routines from LAPACK are freely available on netlib and can be obtained via the World Wide Web or anonymous ftp. For maximal benefit to the community, we added the sources we are proprietary of to the tar.gz file submitted for inclusion in the CPC library. However, as explained in the README file, users willing to compile the code instead of using binaries should first obtain the sources for the external packages mentioned above (email and/or web addresses are provided). Running time: Problem dependent; the test examples provided with the code only take a few seconds to run; timing results for large scale problems are given in Section 5.

COMPPAP - COMPOSITE PLATE BUCKLING ANALYSIS PROGRAM (IBM PC VERSION)

NASA Technical Reports Server (NTRS)

Smith, J. P.

1994-01-01

The Composite Plate Buckling Analysis Program (COMPPAP) was written to help engineers determine buckling loads of orthotropic (or isotropic) irregularly shaped plates without requiring hand calculations from design curves or extensive finite element modeling. COMPPAP is a one element finite element program that utilizes high-order displacement functions. The high order of the displacement functions enables the user to produce results more accurate than traditional h-finite elements. This program uses these high-order displacement functions to perform a plane stress analysis of a general plate followed by a buckling calculation based on the stresses found in the plane stress solution. The current version assumes a flat plate (constant thickness) subject to a constant edge load (normal or shear) on one or more edges. COMPPAP uses the power method to find the eigenvalues of the buckling problem. The power method provides an efficient solution when only one eigenvalue is desired. Once the eigenvalue is found, the eigenvector, which corresponds to the plate buckling mode shape, results as a by-product. A positive feature of the power method is that the dominant eigenvalue is the first found, which is this case is the plate buckling load. The reported eigenvalue expresses a load factor to induce plate buckling. COMPPAP is written in ANSI FORTRAN 77. Two machine versions are available from COSMIC: a PC version (MSC-22428), which is for IBM PC 386 series and higher computers and compatibles running MS-DOS; and a UNIX version (MSC-22286). The distribution medium for both machine versions includes source code for both single and double precision versions of COMPPAP. The PC version includes source code which has been optimized for implementation within DOS memory constraints as well as sample executables for both the single and double precision versions of COMPPAP. The double precision versions of COMPPAP have been successfully implemented on an IBM PC 386 compatible running MS-DOS, a Sun4 series computer running SunOS, an HP-9000 series computer running HP-UX, and a CRAY X-MP series computer running UNICOS. COMPPAP requires 1Mb of RAM and the BLAS and LINPACK math libraries, which are included on the distribution medium. The COMPPAP documentation provides instructions for using the commercial post-processing package PATRAN for graphical interpretation of COMPPAP output. The UNIX version includes two electronic versions of the documentation: one in LaTex format and one in PostScript format. The standard distribution medium for the PC version (MSC-22428) is a 5.25 inch 1.2Mb MS-DOS format diskette. The standard distribution medium for the UNIX version (MSC-22286) is a .25 inch streaming magnetic tape cartridge (Sun QIC-24) in UNIX tar format. For the UNIX version, alternate distribution media and formats are available upon request. COMPPAP was developed in 1992.

COMPPAP - COMPOSITE PLATE BUCKLING ANALYSIS PROGRAM (UNIX VERSION)

NASA Technical Reports Server (NTRS)

Smith, J. P.

1994-01-01

The Composite Plate Buckling Analysis Program (COMPPAP) was written to help engineers determine buckling loads of orthotropic (or isotropic) irregularly shaped plates without requiring hand calculations from design curves or extensive finite element modeling. COMPPAP is a one element finite element program that utilizes high-order displacement functions. The high order of the displacement functions enables the user to produce results more accurate than traditional h-finite elements. This program uses these high-order displacement functions to perform a plane stress analysis of a general plate followed by a buckling calculation based on the stresses found in the plane stress solution. The current version assumes a flat plate (constant thickness) subject to a constant edge load (normal or shear) on one or more edges. COMPPAP uses the power method to find the eigenvalues of the buckling problem. The power method provides an efficient solution when only one eigenvalue is desired. Once the eigenvalue is found, the eigenvector, which corresponds to the plate buckling mode shape, results as a by-product. A positive feature of the power method is that the dominant eigenvalue is the first found, which is this case is the plate buckling load. The reported eigenvalue expresses a load factor to induce plate buckling. COMPPAP is written in ANSI FORTRAN 77. Two machine versions are available from COSMIC: a PC version (MSC-22428), which is for IBM PC 386 series and higher computers and compatibles running MS-DOS; and a UNIX version (MSC-22286). The distribution medium for both machine versions includes source code for both single and double precision versions of COMPPAP. The PC version includes source code which has been optimized for implementation within DOS memory constraints as well as sample executables for both the single and double precision versions of COMPPAP. The double precision versions of COMPPAP have been successfully implemented on an IBM PC 386 compatible running MS-DOS, a Sun4 series computer running SunOS, an HP-9000 series computer running HP-UX, and a CRAY X-MP series computer running UNICOS. COMPPAP requires 1Mb of RAM and the BLAS and LINPACK math libraries, which are included on the distribution medium. The COMPPAP documentation provides instructions for using the commercial post-processing package PATRAN for graphical interpretation of COMPPAP output. The UNIX version includes two electronic versions of the documentation: one in LaTex format and one in PostScript format. The standard distribution medium for the PC version (MSC-22428) is a 5.25 inch 1.2Mb MS-DOS format diskette. The standard distribution medium for the UNIX version (MSC-22286) is a .25 inch streaming magnetic tape cartridge (Sun QIC-24) in UNIX tar format. For the UNIX version, alternate distribution media and formats are available upon request. COMPPAP was developed in 1992.

Renovation of the fixing and loading factors of the beam by the spectral data of free flexural vibrations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Akhymbek, Meiram Erkanatuly; Yessirkegenov, Nurgissa Amankeldiuly; Sadybekov, Makhmud Abdysametovich

2015-09-18

In the current paper, the problem of bending vibrations of a beam in which the binding on the right end is unknown and not available for visual inspection is studied. The main objective is to study an inverse problem: find additional unknown boundary conditions by additional spectral data, i.e., the conditions of fixing the right end of the rod. In this work, unlike many other works, as such additional conditions we choose the first natural frequencies (eigenvalues) of two new problems corresponding to the problem of bending vibrations of a beam with loads of different weights at the central point.

VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

1975-10-01

The computer code block VENTURE, designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P$sub 1$) in up to three- dimensional geometry is described. A variety of types of problems may be solved: the usual eigenvalue problem, a direct criticality search on the buckling, on a reciprocal velocity absorber (prompt mode), or on nuclide concentrations, or an indirect criticality search on nuclide concentrations, or on dimensions. First- order perturbation analysis capability is available at the macroscopic cross section level. (auth)

Introduction to Numerical Methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schoonover, Joseph A.

2016-06-14

These are slides for a lecture for the Parallel Computing Summer Research Internship at the National Security Education Center. This gives an introduction to numerical methods. Repetitive algorithms are used to obtain approximate solutions to mathematical problems, using sorting, searching, root finding, optimization, interpolation, extrapolation, least squares regresion, Eigenvalue problems, ordinary differential equations, and partial differential equations. Many equations are shown. Discretizations allow us to approximate solutions to mathematical models of physical systems using a repetitive algorithm and introduce errors that can lead to numerical instabilities if we are not careful.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kalugin, A. V., E-mail: Kalugin-AV@nrcki.ru; Tebin, V. V.

The specific features of calculation of the effective multiplication factor using the Monte Carlo method for weakly coupled and non-asymptotic multiplying systems are discussed. Particular examples are considered and practical recommendations on detection and Monte Carlo calculation of systems typical in numerical substantiation of nuclear safety for VVER fuel management problems are given. In particular, the problems of the choice of parameters for the batch mode and the method for normalization of the neutron batch, as well as finding and interpretation of the eigenvalue spectrum for the integral fission matrix, are discussed.

Identification of spatially-localized initial conditions via sparse PCA

NASA Astrophysics Data System (ADS)

Dwivedi, Anubhav; Jovanovic, Mihailo

2017-11-01

Principal Component Analysis involves maximization of a quadratic form subject to a quadratic constraint on the initial flow perturbations and it is routinely used to identify the most energetic flow structures. For general flow configurations, principal components can be efficiently computed via power iteration of the forward and adjoint governing equations. However, the resulting flow structures typically have a large spatial support leading to a question of physical realizability. To obtain spatially-localized structures, we modify the quadratic constraint on the initial condition to include a convex combination with an additional regularization term which promotes sparsity in the physical domain. We formulate this constrained optimization problem as a nonlinear eigenvalue problem and employ an inverse power-iteration-based method to solve it. The resulting solution is guaranteed to converge to a nonlinear eigenvector which becomes increasingly localized as our emphasis on sparsity increases. We use several fluids examples to demonstrate that our method indeed identifies the most energetic initial perturbations that are spatially compact. This work was supported by Office of Naval Research through Grant Number N00014-15-1-2522.

A spectral analysis of the domain decomposed Monte Carlo method for linear systems

DOE PAGES

Slattery, Stuart R.; Evans, Thomas M.; Wilson, Paul P. H.

2015-09-08

The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear oper- ator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approxi- mation and the mean chord approximation are applied to estimate the leakagemore » frac- tion of random walks from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem in numerical experiments to test the models for symmetric operators with spectral qualities similar to light water reactor problems. We find, in general, the derived approximations show good agreement with random walk lengths and leakage fractions computed by the numerical experiments.« less

Segmentation of large periapical lesions toward dental computer-aided diagnosis in cone-beam CT scans

NASA Astrophysics Data System (ADS)

Rysavy, Steven; Flores, Arturo; Enciso, Reyes; Okada, Kazunori

2008-03-01

This paper presents an experimental study for assessing the applicability of general-purpose 3D segmentation algorithms for analyzing dental periapical lesions in cone-beam computed tomography (CBCT) scans. In the field of Endodontics, clinical studies have been unable to determine if a periapical granuloma can heal with non-surgical methods. Addressing this issue, Simon et al. recently proposed a diagnostic technique which non-invasively classifies target lesions using CBCT. Manual segmentation exploited in their study, however, is too time consuming and unreliable for real world adoption. On the other hand, many technically advanced algorithms have been proposed to address segmentation problems in various biomedical and non-biomedical contexts, but they have not yet been applied to the field of dentistry. Presented in this paper is a novel application of such segmentation algorithms to the clinically-significant dental problem. This study evaluates three state-of-the-art graph-based algorithms: a normalized cut algorithm based on a generalized eigen-value problem, a graph cut algorithm implementing energy minimization techniques, and a random walks algorithm derived from discrete electrical potential theory. In this paper, we extend the original 2D formulation of the above algorithms to segment 3D images directly and apply the resulting algorithms to the dental CBCT images. We experimentally evaluate quality of the segmentation results for 3D CBCT images, as well as their 2D cross sections. The benefits and pitfalls of each algorithm are highlighted.

Global Optimality of the Successive Maxbet Algorithm.

ERIC Educational Resources Information Center

Hanafi, Mohamed; ten Berge, Jos M. F.

2003-01-01

It is known that the Maxbet algorithm, which is an alternative to the method of generalized canonical correlation analysis and Procrustes analysis, may converge to local maxima. Discusses an eigenvalue criterion that is sufficient, but not necessary, for global optimality of the successive Maxbet algorithm. (SLD)

Development of a generalized perturbation theory method for sensitivity analysis using continuous-energy Monte Carlo methods

DOE PAGES

Perfetti, Christopher M.; Rearden, Bradley T.

2016-03-01

The sensitivity and uncertainty analysis tools of the ORNL SCALE nuclear modeling and simulation code system that have been developed over the last decade have proven indispensable for numerous application and design studies for nuclear criticality safety and reactor physics. SCALE contains tools for analyzing the uncertainty in the eigenvalue of critical systems, but cannot quantify uncertainty in important neutronic parameters such as multigroup cross sections, fuel fission rates, activation rates, and neutron fluence rates with realistic three-dimensional Monte Carlo simulations. A more complete understanding of the sources of uncertainty in these design-limiting parameters could lead to improvements in processmore » optimization, reactor safety, and help inform regulators when setting operational safety margins. A novel approach for calculating eigenvalue sensitivity coefficients, known as the CLUTCH method, was recently explored as academic research and has been found to accurately and rapidly calculate sensitivity coefficients in criticality safety applications. The work presented here describes a new method, known as the GEAR-MC method, which extends the CLUTCH theory for calculating eigenvalue sensitivity coefficients to enable sensitivity coefficient calculations and uncertainty analysis for a generalized set of neutronic responses using high-fidelity continuous-energy Monte Carlo calculations. Here, several criticality safety systems were examined to demonstrate proof of principle for the GEAR-MC method, and GEAR-MC was seen to produce response sensitivity coefficients that agreed well with reference direct perturbation sensitivity coefficients.« less

Rapid solution of large-scale systems of equations

NASA Technical Reports Server (NTRS)

Storaasli, Olaf O.

1994-01-01

The analysis and design of complex aerospace structures requires the rapid solution of large systems of linear and nonlinear equations, eigenvalue extraction for buckling, vibration and flutter modes, structural optimization and design sensitivity calculation. Computers with multiple processors and vector capabilities can offer substantial computational advantages over traditional scalar computer for these analyses. These computers fall into two categories: shared memory computers and distributed memory computers. This presentation covers general-purpose, highly efficient algorithms for generation/assembly or element matrices, solution of systems of linear and nonlinear equations, eigenvalue and design sensitivity analysis and optimization. All algorithms are coded in FORTRAN for shared memory computers and many are adapted to distributed memory computers. The capability and numerical performance of these algorithms will be addressed.

Eigenvalue Contributon Estimator for Sensitivity Calculations with TSUNAMI-3D

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rearden, Bradley T; Williams, Mark L

2007-01-01

Since the release of the Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) codes in SCALE [1], the use of sensitivity and uncertainty analysis techniques for criticality safety applications has greatly increased within the user community. In general, sensitivity and uncertainty analysis is transitioning from a technique used only by specialists to a practical tool in routine use. With the desire to use the tool more routinely comes the need to improve the solution methodology to reduce the input and computational burden on the user. This paper reviews the current solution methodology of the Monte Carlo eigenvalue sensitivity analysismore » sequence TSUNAMI-3D, describes an alternative approach, and presents results from both methodologies.« less

Parallel Symmetric Eigenvalue Problem Solvers

DTIC Science & Technology

2015-05-01

get research, tutoring, and mentoring experience as an undergraduate. Last but not least, I thank my family for their love and support. v TABLE OF...32 4.6.2 Choice of the Ritz shifts . . . . . . . . . . . . . . . . . . . . 37 4.7 Relationship between...pencil. I will conclude with a discussion of the relationship between Trace- Min and simultaneous iteration. If both methods solve the linear systems

On r-circulant matrices with Fibonacci and Lucas numbers having arithmetic indices

NASA Astrophysics Data System (ADS)

Bueno, Aldous Cesar F.

2017-11-01

We investigate r-circulant matrices whose entries are Fibonacci and Lucas numbers having arithmetic indices. We then solve for the eigenvalues, determinant, Euclidean norm and the bounds for the spectral norm of the matrices. We also present some special cases and some results on identities and divisibility. Lastly, we present an open problem.

Numerical implementation of complex orthogonalization, parallel transport on Stiefel bundles, and analyticity

NASA Astrophysics Data System (ADS)

Avitabile, Daniele; Bridges, Thomas J.

2010-06-01

Numerical integration of complex linear systems of ODEs depending analytically on an eigenvalue parameter are considered. Complex orthogonalization, which is required to stabilize the numerical integration, results in non-analytic systems. It is shown that properties of eigenvalues are still efficiently recoverable by extracting information from a non-analytic characteristic function. The orthonormal systems are constructed using the geometry of Stiefel bundles. Different forms of continuous orthogonalization in the literature are shown to correspond to different choices of connection one-form on the Stiefel bundle. For the numerical integration, Gauss-Legendre Runge-Kutta algorithms are the principal choice for preserving orthogonality, and performance results are shown for a range of GLRK methods. The theory and methods are tested by application to example boundary value problems including the Orr-Sommerfeld equation in hydrodynamic stability.

Witnessing eigenstates for quantum simulation of Hamiltonian spectra

PubMed Central

Santagati, Raffaele; Wang, Jianwei; Gentile, Antonio A.; Paesani, Stefano; Wiebe, Nathan; McClean, Jarrod R.; Morley-Short, Sam; Shadbolt, Peter J.; Bonneau, Damien; Silverstone, Joshua W.; Tew, David P.; Zhou, Xiaoqi; O’Brien, Jeremy L.; Thompson, Mark G.

2018-01-01

The efficient calculation of Hamiltonian spectra, a problem often intractable on classical machines, can find application in many fields, from physics to chemistry. We introduce the concept of an “eigenstate witness” and, through it, provide a new quantum approach that combines variational methods and phase estimation to approximate eigenvalues for both ground and excited states. This protocol is experimentally verified on a programmable silicon quantum photonic chip, a mass-manufacturable platform, which embeds entangled state generation, arbitrary controlled unitary operations, and projective measurements. Both ground and excited states are experimentally found with fidelities >99%, and their eigenvalues are estimated with 32 bits of precision. We also investigate and discuss the scalability of the approach and study its performance through numerical simulations of more complex Hamiltonians. This result shows promising progress toward quantum chemistry on quantum computers. PMID:29387796

Use of SCALE Continuous-Energy Monte Carlo Tools for Eigenvalue Sensitivity Coefficient Calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perfetti, Christopher M; Rearden, Bradley T

2013-01-01

The TSUNAMI code within the SCALE code system makes use of eigenvalue sensitivity coefficients for an extensive number of criticality safety applications, such as quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different critical systems, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved fidelity and the desire to extend TSUNAMI analysis to advanced applications has motivated the development of a methodology for calculating sensitivity coefficients in continuous-energy (CE) Monte Carlo applications. The CLUTCH and Iterated Fission Probability (IFP) eigenvalue sensitivity methods were recently implemented in themore » CE KENO framework to generate the capability for TSUNAMI-3D to perform eigenvalue sensitivity calculations in continuous-energy applications. This work explores the improvements in accuracy that can be gained in eigenvalue and eigenvalue sensitivity calculations through the use of the SCALE CE KENO and CE TSUNAMI continuous-energy Monte Carlo tools as compared to multigroup tools. The CE KENO and CE TSUNAMI tools were used to analyze two difficult models of critical benchmarks, and produced eigenvalue and eigenvalue sensitivity coefficient results that showed a marked improvement in accuracy. The CLUTCH sensitivity method in particular excelled in terms of efficiency and computational memory requirements.« less

On the estimation of the worst-case implant-induced RF-heating in multi-channel MRI.

PubMed

Córcoles, Juan; Zastrow, Earl; Kuster, Niels

2017-06-21

The increasing use of multiple radiofrequency (RF) transmit channels in magnetic resonance imaging (MRI) systems makes it necessary to rigorously assess the risk of RF-induced heating. This risk is especially aggravated with inclusions of medical implants within the body. The worst-case RF-heating scenario is achieved when the local tissue deposition in the at-risk region (generally in the vicinity of the implant electrodes) reaches its maximum value while MRI exposure is compliant with predefined general specific absorption rate (SAR) limits or power requirements. This work first reviews the common approach to estimate the worst-case RF-induced heating in multi-channel MRI environment, based on the maximization of the ratio of two Hermitian forms by solving a generalized eigenvalue problem. It is then shown that the common approach is not rigorous and may lead to an underestimation of the worst-case RF-heating scenario when there is a large number of RF transmit channels and there exist multiple SAR or power constraints to be satisfied. Finally, this work derives a rigorous SAR-based formulation to estimate a preferable worst-case scenario, which is solved by casting a semidefinite programming relaxation of this original non-convex problem, whose solution closely approximates the true worst-case including all SAR constraints. Numerical results for 2, 4, 8, 16, and 32 RF channels in a 3T-MRI volume coil for a patient with a deep-brain stimulator under a head imaging exposure are provided as illustrative examples.

On the estimation of the worst-case implant-induced RF-heating in multi-channel MRI

NASA Astrophysics Data System (ADS)

Córcoles, Juan; Zastrow, Earl; Kuster, Niels

2017-06-01

The increasing use of multiple radiofrequency (RF) transmit channels in magnetic resonance imaging (MRI) systems makes it necessary to rigorously assess the risk of RF-induced heating. This risk is especially aggravated with inclusions of medical implants within the body. The worst-case RF-heating scenario is achieved when the local tissue deposition in the at-risk region (generally in the vicinity of the implant electrodes) reaches its maximum value while MRI exposure is compliant with predefined general specific absorption rate (SAR) limits or power requirements. This work first reviews the common approach to estimate the worst-case RF-induced heating in multi-channel MRI environment, based on the maximization of the ratio of two Hermitian forms by solving a generalized eigenvalue problem. It is then shown that the common approach is not rigorous and may lead to an underestimation of the worst-case RF-heating scenario when there is a large number of RF transmit channels and there exist multiple SAR or power constraints to be satisfied. Finally, this work derives a rigorous SAR-based formulation to estimate a preferable worst-case scenario, which is solved by casting a semidefinite programming relaxation of this original non-convex problem, whose solution closely approximates the true worst-case including all SAR constraints. Numerical results for 2, 4, 8, 16, and 32 RF channels in a 3T-MRI volume coil for a patient with a deep-brain stimulator under a head imaging exposure are provided as illustrative examples.

Quantum properties of double kicked systems with classical translational invariance in momentum

NASA Astrophysics Data System (ADS)

Dana, Itzhack

2015-01-01

Double kicked rotors (DKRs) appear to be the simplest nonintegrable Hamiltonian systems featuring classical translational symmetry in phase space (i.e., in angular momentum) for an infinite set of values (the rational ones) of a parameter η . The experimental realization of quantum DKRs by atom-optics methods motivates the study of the double kicked particle (DKP). The latter reduces, at any fixed value of the conserved quasimomentum β ℏ , to a generalized DKR, the "β -DKR ." We determine general quantum properties of β -DKRs and DKPs for arbitrary rational η . The quasienergy problem of β -DKRs is shown to be equivalent to the energy eigenvalue problem of a finite strip of coupled lattice chains. Exact connections are then obtained between quasienergy spectra of β -DKRs for all β in a generically infinite set. The general conditions of quantum resonance for β -DKRs are shown to be the simultaneous rationality of η ,β , and a scaled Planck constant ℏS. For rational ℏS and generic values of β , the quasienergy spectrum is found to have a staggered-ladder structure. Other spectral structures, resembling Hofstadter butterflies, are also found. Finally, we show the existence of particular DKP wave-packets whose quantum dynamics is free, i.e., the evolution frequencies of expectation values in these wave-packets are independent of the nonintegrability. All the results for rational ℏS exhibit unique number-theoretical features involving η ,ℏS, and β .

A study of the control problem of the shoot side environment delivery system of a closed crop growth research chamber

NASA Technical Reports Server (NTRS)

Blackwell, C. C.; Blackwell, A. L.

1992-01-01

The details of our initial study of the control problem of the crop shoot environment of a hypothetical closed crop growth research chamber (CGRC) are presented in this report. The configuration of the CGRC is hypothetical because neither a physical subject nor a design existed at the time the study began, a circumstance which is typical of large scale systems control studies. The basis of the control study is a mathematical model which was judged to adequately mimic the relevant dynamics of the system components considered necessary to provide acceptable realism in the representation. Control of pressure, temperature, and flow rate of the crop shoot environment, along with its oxygen, carbon dioxide, and water concentration is addressed. To account for mass exchange, the group of plants is represented in the model by a source of oxygen, a source of water vapor, and a sink for carbon dioxide. In terms of the thermal energy exchange, the group of plants is represented by a surface with an appropriate temperature. Most of the primitive equations about an experimental operating condition and a state variable representation which was extracted from the linearized equations are presented. Next, we present the results of a real Jordan decomposition and the repositioning of an undesirable eigenvalue via full state feedback. The state variable representation of the modeling system is of the nineteenth order and reflects the eleven control variables and eight system disturbances. Five real eigenvalues are very near zero, with one at zero, three having small magnitude positive values, and one having a small magnitude negative value. A Singular Value Decomposition analysis indicates that these non-zero eigenvalues are not results of numerical error.

Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation

NASA Astrophysics Data System (ADS)

Benner, Peter; Dolgov, Sergey; Khoromskaia, Venera; Khoromskij, Boris N.

2017-04-01

In this paper, we propose and study two approaches to approximate the solution of the Bethe-Salpeter equation (BSE) by using structured iterative eigenvalue solvers. Both approaches are based on the reduced basis method and low-rank factorizations of the generating matrices. We also propose to represent the static screen interaction part in the BSE matrix by a small active sub-block, with a size balancing the storage for rank-structured representations of other matrix blocks. We demonstrate by various numerical tests that the combination of the diagonal plus low-rank plus reduced-block approximation exhibits higher precision with low numerical cost, providing as well a distinct two-sided error estimate for the smallest eigenvalues of the Bethe-Salpeter operator. The complexity is reduced to O (Nb2) in the size of the atomic orbitals basis set, Nb, instead of the practically intractable O (Nb6) scaling for the direct diagonalization. In the second approach, we apply the quantized-TT (QTT) tensor representation to both, the long eigenvectors and the column vectors in the rank-structured BSE matrix blocks, and combine this with the ALS-type iteration in block QTT format. The QTT-rank of the matrix entities possesses almost the same magnitude as the number of occupied orbitals in the molecular systems, No

Positron kinetics in an idealized PET environment

PubMed Central

Robson, R. E.; Brunger, M. J.; Buckman, S. J.; Garcia, G.; Petrović, Z. Lj.; White, R. D.

2015-01-01

The kinetic theory of non-relativistic positrons in an idealized positron emission tomography PET environment is developed by solving the Boltzmann equation, allowing for coherent and incoherent elastic, inelastic, ionizing and annihilating collisions through positronium formation. An analytic expression is obtained for the positronium formation rate, as a function of distance from a spherical source, in terms of the solutions of the general kinetic eigenvalue problem. Numerical estimates of the positron range - a fundamental limitation on the accuracy of PET, are given for positrons in a model of liquid water, a surrogate for human tissue. Comparisons are made with the ‘gas-phase’ assumption used in current models in which coherent scattering is suppressed. Our results show that this assumption leads to an error of the order of a factor of approximately 2, emphasizing the need to accurately account for the structure of the medium in PET simulations. PMID:26246002

Vibration and Control of Flexible Rotor Supported by Magnetic Bearings

NASA Technical Reports Server (NTRS)

Nonami, Kenzou

1988-01-01

Active vibration control of flexible rotors supported by magnetic bearings is discussed. Using a finite-element method for a mathematical model of the flexible rotor, the eigenvalue problem is formulated taking into account the interaction between a mechanical system of the flexible rotor and an electrical system of the magnetic bearings and the controller. However, for the sake of simplicity, gyroscopic effects are disregarded. It is possible to adapt this formulation to a general flexible rotor-magnetic bearing system. Controllability with and without collocation sensors and actuators located at the same distance along the rotor axis is discussed for the higher order flexible modes of the test rig. In conclusion, it is proposed that it is necessary to add new active control loops for the higher flexible modes even in the case of collocation. Then it is possible to stabilize for the case of uncollocation by means of this method.

Quantification of topological changes of vorticity contours in two-dimensional Navier-Stokes flow.

PubMed

Ohkitani, Koji; Al Sulti, Fayeza

2010-06-01

A characterization of reconnection of vorticity contours is made by direct numerical simulations of the two-dimensional Navier-Stokes flow at a relatively low Reynolds number. We identify all the critical points of the vorticity field and classify them by solving an eigenvalue problem of its Hessian matrix on the basis of critical-point theory. The numbers of hyperbolic (saddles) and elliptic (minima and maxima) points are confirmed to satisfy Euler's index theorem numerically. Time evolution of these indices is studied for a simple initial condition. Generally speaking, we have found that the indices are found to decrease in number with time. This result is discussed in connection with related works on streamline topology, in particular, the relationship between stagnation points and the dissipation. Associated elementary procedures in physical space, the merging of vortices, are studied in detail for a number of snapshots. A similar analysis is also done using the stream function.

Extraordinary-mode refractive-index change produced by the linear electro-optic effect in LiNbO3 and reverse-poled LiNbO3

NASA Astrophysics Data System (ADS)

Boyd, Joseph T.; Servizzi, Anthony J.; Sriram, S.; Kingsley, Stuart A.

1995-07-01

To examine aspects of an integrated photonic electric-field sensor, we calculate electro-optically induced refractive-index change in regular and reverse-poled LiNbO3. Specifically, for y-propagating extraordinary modes, we determine how index change depends on electric-field magnitude and direction. To accomplish this, changes in index-ellipsoid shape and orientation are found by the use of a numerical eigenvalue procedure to diagonalize the impermeability tensor; then, refractive index is calculated by the use of a vector reference-frame transformation and a small perturbation approximation. A general formula is inferred from calculations for specific field directions. Electro-optic coefficients for reverse-poled LiNbO3 are obtained by application of a tensor reference-frame transformation to those of LiNbO3. The index-calculation procedure has utility beyond the problem that is considered.

Experimental quantum compressed sensing for a seven-qubit system

PubMed Central

Riofrío, C. A.; Gross, D.; Flammia, S. T.; Monz, T.; Nigg, D.; Blatt, R.; Eisert, J.

2017-01-01

Well-controlled quantum devices with their increasing system size face a new roadblock hindering further development of quantum technologies. The effort of quantum tomography—the reconstruction of states and processes of a quantum device—scales unfavourably: state-of-the-art systems can no longer be characterized. Quantum compressed sensing mitigates this problem by reconstructing states from incomplete data. Here we present an experimental implementation of compressed tomography of a seven-qubit system—a topological colour code prepared in a trapped ion architecture. We are in the highly incomplete—127 Pauli basis measurement settings—and highly noisy—100 repetitions each—regime. Originally, compressed sensing was advocated for states with few non-zero eigenvalues. We argue that low-rank estimates are appropriate in general since statistical noise enables reliable reconstruction of only the leading eigenvectors. The remaining eigenvectors behave consistently with a random-matrix model that carries no information about the true state. PMID:28513587

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

NASA Technical Reports Server (NTRS)

Dongarra, Jack (Editor); Messina, Paul (Editor); Sorensen, Danny C. (Editor); Voigt, Robert G. (Editor)

1990-01-01

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Convergence of discrete Aubry–Mather model in the continuous limit

NASA Astrophysics Data System (ADS)

Su, Xifeng; Thieullen, Philippe

2018-05-01

We develop two approximation schemes for solving the cell equation and the discounted cell equation using Aubry–Mather–Fathi theory. The Hamiltonian is supposed to be Tonelli, time-independent and periodic in space. By Legendre transform it is equivalent to find a fixed point of some nonlinear operator, called Lax-Oleinik operator, which may be discounted or not. By discretizing in time, we are led to solve an additive eigenvalue problem involving a discrete Lax–Oleinik operator. We show how to approximate the effective Hamiltonian and some weak KAM solutions by letting the time step in the discrete model tend to zero. We also obtain a selected discrete weak KAM solution as in Davini et al (2016 Invent. Math. 206 29–55), and show that it converges to a particular solution of the cell equation. In order to unify the two settings, continuous and discrete, we develop a more general formalism of the short-range interactions.

On the time-reversal symmetry in pseudo-Hermitian systems

NASA Astrophysics Data System (ADS)

Choutri, B.; Cherbal, O.; Ighezou, F. Z.; Trifonov, D. A.

2014-11-01

In a recent paper [M. Sato, K. Hasebe, K. Esaki, and M. Kohmoto, Prog. Theor. Phys. 127, 937 (2012)] Sato and his collaborators established a generalization of the Kramers degeneracy structure to pseudo-Hermitian Hamiltonian systems, admitting even time-reversal symmetry, T2=1. This extension is achieved using the mathematical structure of split-quaternions instead of quaternions, usually adopted in the case of Hermitian Hamiltonians with odd time-reversal symmetry, T2=-1. Here we find that the metric operator for the pseudo-Hermitian Hamiltonian H that allows the realization of the generalized Kramers degeneracy is necessarily indefinite. We show that such H with real spectrum also possesses odd antilinear symmetry induced from the existing odd time-reversal symmetry of its Hermitian counterpart h, so that the generalized Kramers degeneracy of H is in fact crypto-Hermitian Kramers degeneracy. We study in greater detail a new example of the pseudo-Hermitian split-quaternionic four-level Hamiltonian system, which admits an indefinite metric operator and time-reversal symmetry and, as a consequence, a generalized Kramers degeneracy structure. We provide a complete solution of the eigenvalue problem, construct pseudo-Hermitian ladder operators closing the normal and abnormal pseudo-fermionic algebras, and show that this system fulfills a crypto-Hermitian degeneracy.

A pair natural orbital based implementation of CCSD excitation energies within the framework of linear response theory

NASA Astrophysics Data System (ADS)

Frank, Marius S.; Hättig, Christof

2018-04-01

We present a pair natural orbital (PNO)-based implementation of coupled cluster singles and doubles (CCSD) excitation energies that builds upon the previously proposed state-specific PNO approach to the excited state eigenvalue problem. We construct the excited state PNOs for each state separately in a truncated orbital specific virtual basis and use a local density-fitting approximation to achieve an at most quadratic scaling of the computational costs for the PNO construction. The earlier reported excited state PNO construction is generalized such that a smooth convergence of the results for charge transfer states is ensured for general coupled cluster methods. We investigate the accuracy of our implementation by applying it to a large and diverse test set comprising 153 singlet excitations in organic molecules. Already moderate PNO thresholds yield mean absolute errors below 0.01 eV. The performance of the implementation is investigated through the calculations on alkene chains and reveals an at most cubic cost-scaling for the CCSD iterations with the system size.

A modal aeroelastic analysis scheme for turbomachinery blading. M.S. Thesis - Case Western Reserve Univ. Final Report

NASA Technical Reports Server (NTRS)

Smith, Todd E.

1991-01-01

An aeroelastic analysis is developed which has general application to all types of axial-flow turbomachinery blades. The approach is based on linear modal analysis, where the blade's dynamic response is represented as a linear combination of contributions from each of its in-vacuum free vibrational modes. A compressible linearized unsteady potential theory is used to model the flow over the oscillating blades. The two-dimensional unsteady flow is evaluated along several stacked axisymmetric strips along the span of the airfoil. The unsteady pressures at the blade surface are integrated to result in the generalized force acting on the blade due to simple harmonic motions. The unsteady aerodynamic forces are coupled to the blade normal modes in the frequency domain using modal analysis. An iterative eigenvalue problem is solved to determine the stability of the blade when the unsteady aerodynamic forces are included in the analysis. The approach is demonstrated by applying it to a high-energy subsonic turbine blade from a rocket engine turbopump power turbine. The results indicate that this turbine could undergo flutter in an edgewise mode of vibration.

Magnetodynamic stability of a fluid cylinder under the Lundquist force-free magnetic field

NASA Astrophysics Data System (ADS)

Radwan, Ahmed E.; Halawa, Mohamed A.

1990-04-01

The magnetodynamic (in)stability of a conducting fluid cylinder subject to the capillarity and electromagnetic forces has been developed. The cylinder is pervaded by a uniform magnetic field but embedded in the Lundquist force-free varying field that allows for flowing a current surrounding the fluid. A general eigenvalue relation is derived based on a study of the equilibrium and perturbed states. The stability criterion is discussed analytically in general terms. The surface tension is destabilizing for small axisymmetric mode and stable for all others. The principle of the exchange of stability is allowed for the present problem due to the non-uniform behavior of the force-free field. Each of the axial and transverse force-free fields separately exerts a stabilizing influence in the most dangerous mode but the combined contribution of them is strongly destabilizing. Whether the model is acted upon the electromagnetic force (with the Lundquist field) the stability restrictions or/and the capillarity force are identified. Several reported works can be recovered as limiting cases with appropriate simplifications.

Parallel solution of the symmetric tridiagonal eigenproblem. Research report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jessup, E.R.

1989-10-01

This thesis discusses methods for computing all eigenvalues and eigenvectors of a symmetric tridiagonal matrix on a distributed-memory Multiple Instruction, Multiple Data multiprocessor. Only those techniques having the potential for both high numerical accuracy and significant large-grained parallelism are investigated. These include the QL method or Cuppen's divide and conquer method based on rank-one updating to compute both eigenvalues and eigenvectors, bisection to determine eigenvalues and inverse iteration to compute eigenvectors. To begin, the methods are compared with respect to computation time, communication time, parallel speed up, and accuracy. Experiments on an IPSC hypercube multiprocessor reveal that Cuppen's method ismore » the most accurate approach, but bisection with inverse iteration is the fastest and most parallel. Because the accuracy of the latter combination is determined by the quality of the computed eigenvectors, the factors influencing the accuracy of inverse iteration are examined. This includes, in part, statistical analysis of the effect of a starting vector with random components. These results are used to develop an implementation of inverse iteration producing eigenvectors with lower residual error and better orthogonality than those generated by the EISPACK routine TINVIT. This thesis concludes with adaptions of methods for the symmetric tridiagonal eigenproblem to the related problem of computing the singular value decomposition (SVD) of a bidiagonal matrix.« less

Parallel solution of the symmetric tridiagonal eigenproblem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jessup, E.R.

1989-01-01

This thesis discusses methods for computing all eigenvalues and eigenvectors of a symmetric tridiagonal matrix on a distributed memory MIMD multiprocessor. Only those techniques having the potential for both high numerical accuracy and significant large-grained parallelism are investigated. These include the QL method or Cuppen's divide and conquer method based on rank-one updating to compute both eigenvalues and eigenvectors, bisection to determine eigenvalues, and inverse iteration to compute eigenvectors. To begin, the methods are compared with respect to computation time, communication time, parallel speedup, and accuracy. Experiments on an iPSC hyper-cube multiprocessor reveal that Cuppen's method is the most accuratemore » approach, but bisection with inverse iteration is the fastest and most parallel. Because the accuracy of the latter combination is determined by the quality of the computed eigenvectors, the factors influencing the accuracy of inverse iteration are examined. This includes, in part, statistical analysis of the effects of a starting vector with random components. These results are used to develop an implementation of inverse iteration producing eigenvectors with lower residual error and better orthogonality than those generated by the EISPACK routine TINVIT. This thesis concludes with adaptations of methods for the symmetric tridiagonal eigenproblem to the related problem of computing the singular value decomposition (SVD) of a bidiagonal matrix.« less

Liquid-gas phase transitions and C K symmetry in quantum field theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nishimura, Hiromichi; Ogilvie, Michael C.; Pangeni, Kamal

A general field-theoretic framework for the treatment of liquid-gas phase transitions is developed. Starting from a fundamental four-dimensional field theory at nonzero temperature and density, an effective three-dimensional field theory is derived. The effective field theory has a sign problem at finite density. Although finite density explicitly breaks charge conjugation C , there remains a symmetry under C K , where K is complex conjugation. Here, we consider four models: relativistic fermions, nonrelativistic fermions, static fermions and classical particles. The interactions are via an attractive potential due to scalar field exchange and a repulsive potential due to massive vector exchange.more » The field-theoretic representation of the partition function is closely related to the equivalence of the sine-Gordon field theory with a classical gas. The thermodynamic behavior is extracted from C K -symmetric complex saddle points of the effective field theory at tree level. In the cases of nonrelativistic fermions and classical particles, we find complex saddle point solutions but no first-order transitions, and neither model has a ground state at tree level. The relativistic and static fermions show a liquid-gas transition at tree level in the effective field theory. The liquid-gas transition, when it occurs, manifests as a first-order line at low temperature and high density, terminated by a critical end point. The mass matrix controlling the behavior of correlation functions is obtained from fluctuations around the saddle points. Due to the C K symmetry of the models, the eigenvalues of the mass matrix are not always real but can be complex. This then leads to the existence of disorder lines, which mark the boundaries where the eigenvalues go from purely real to complex. The regions where the mass matrix eigenvalues are complex are associated with the critical line. In the case of static fermions, a powerful duality between particles and holes allows for the analytic determination of both the critical line and the disorder lines. Depending on the values of the parameters, either zero, one, or two disorder lines are found. Our numerical results for relativistic fermions give a very similar picture.« less

Liquid-gas phase transitions and C K symmetry in quantum field theories

DOE PAGES

Nishimura, Hiromichi; Ogilvie, Michael C.; Pangeni, Kamal

2017-04-04

A general field-theoretic framework for the treatment of liquid-gas phase transitions is developed. Starting from a fundamental four-dimensional field theory at nonzero temperature and density, an effective three-dimensional field theory is derived. The effective field theory has a sign problem at finite density. Although finite density explicitly breaks charge conjugation C , there remains a symmetry under C K , where K is complex conjugation. Here, we consider four models: relativistic fermions, nonrelativistic fermions, static fermions and classical particles. The interactions are via an attractive potential due to scalar field exchange and a repulsive potential due to massive vector exchange.more » The field-theoretic representation of the partition function is closely related to the equivalence of the sine-Gordon field theory with a classical gas. The thermodynamic behavior is extracted from C K -symmetric complex saddle points of the effective field theory at tree level. In the cases of nonrelativistic fermions and classical particles, we find complex saddle point solutions but no first-order transitions, and neither model has a ground state at tree level. The relativistic and static fermions show a liquid-gas transition at tree level in the effective field theory. The liquid-gas transition, when it occurs, manifests as a first-order line at low temperature and high density, terminated by a critical end point. The mass matrix controlling the behavior of correlation functions is obtained from fluctuations around the saddle points. Due to the C K symmetry of the models, the eigenvalues of the mass matrix are not always real but can be complex. This then leads to the existence of disorder lines, which mark the boundaries where the eigenvalues go from purely real to complex. The regions where the mass matrix eigenvalues are complex are associated with the critical line. In the case of static fermions, a powerful duality between particles and holes allows for the analytic determination of both the critical line and the disorder lines. Depending on the values of the parameters, either zero, one, or two disorder lines are found. Our numerical results for relativistic fermions give a very similar picture.« less

Resonant-state expansion for open optical systems: generalization to magnetic, chiral, and bi-anisotropic materials

NASA Astrophysics Data System (ADS)

Muljarov, E. A.; Weiss, T.

2018-05-01

The resonant-state expansion, a recently developed powerful method in electrodynamics, is generalized here for open optical systems containing magnetic, chiral, or bi-anisotropic materials. It is shown that the key matrix eigenvalue equation of the method remains the same, but the matrix elements of the perturbation now contain variations of the permittivity, permeability, and bi-anisotropy tensors. A general normalization of resonant states in terms of the electric and magnetic fields is presented.

Experimental Validation of Model Updating and Damage Detection via Eigenvalue Sensitivity Methods with Artificial Boundary Conditions

DTIC Science & Technology

2017-09-01

VALIDATION OF MODEL UPDATING AND DAMAGE DETECTION VIA EIGENVALUE SENSITIVITY METHODS WITH ARTIFICIAL BOUNDARY CONDITIONS by Matthew D. Bouwense...VALIDATION OF MODEL UPDATING AND DAMAGE DETECTION VIA EIGENVALUE SENSITIVITY METHODS WITH ARTIFICIAL BOUNDARY CONDITIONS 5. FUNDING NUMBERS 6. AUTHOR...unlimited. EXPERIMENTAL VALIDATION OF MODEL UPDATING AND DAMAGE DETECTION VIA EIGENVALUE SENSITIVITY METHODS WITH ARTIFICIAL BOUNDARY

Type I and Type II Error Rates and Overall Accuracy of the Revised Parallel Analysis Method for Determining the Number of Factors

ERIC Educational Resources Information Center

Green, Samuel B.; Thompson, Marilyn S.; Levy, Roy; Lo, Wen-Juo

2015-01-01

Traditional parallel analysis (T-PA) estimates the number of factors by sequentially comparing sample eigenvalues with eigenvalues for randomly generated data. Revised parallel analysis (R-PA) sequentially compares the "k"th eigenvalue for sample data to the "k"th eigenvalue for generated data sets, conditioned on"k"-…

Exploratory factor analysis of the Oral Health Impact Profile.

PubMed

John, M T; Reissmann, D R; Feuerstahler, L; Waller, N; Baba, K; Larsson, P; Celebić, A; Szabo, G; Rener-Sitar, K

2014-09-01

Although oral health-related quality of life (OHRQoL) as measured by the Oral Health Impact Profile (OHIP) is thought to be multidimensional, the nature of these dimensions is not known. The aim of this report was to explore the dimensionality of the OHIP using the Dimensions of OHRQoL (DOQ) Project, an international study of general population subjects and prosthodontic patients. Using the project's Learning Sample (n = 5173), we conducted an exploratory factor analysis on the 46 OHIP items not specifically referring to dentures for 5146 subjects with sufficiently complete data. The first eigenvalue (27·0) of the polychoric correlation matrix was more than ten times larger than the second eigenvalue (2·6), suggesting the presence of a dominant, higher-order general factor. Follow-up analyses with Horn's parallel analysis revealed a viable second-order, four-factor solution. An oblique rotation of this solution revealed four highly correlated factors that we named Oral Function, Oro-facial Pain, Oro-facial Appearance and Psychosocial Impact. These four dimensions and the strong general factor are two viable hypotheses for the factor structure of the OHIP. © 2014 John Wiley & Sons Ltd.

Eigenvalue density of cross-correlations in Sri Lankan financial market

NASA Astrophysics Data System (ADS)

Nilantha, K. G. D. R.; Ranasinghe; Malmini, P. K. C.

2007-05-01

We apply the universal properties with Gaussian orthogonal ensemble (GOE) of random matrices namely spectral properties, distribution of eigenvalues, eigenvalue spacing predicted by random matrix theory (RMT) to compare cross-correlation matrix estimators from emerging market data. The daily stock prices of the Sri Lankan All share price index and Milanka price index from August 2004 to March 2005 were analyzed. Most eigenvalues in the spectrum of the cross-correlation matrix of stock price changes agree with the universal predictions of RMT. We find that the cross-correlation matrix satisfies the universal properties of the GOE of real symmetric random matrices. The eigen distribution follows the RMT predictions in the bulk but there are some deviations at the large eigenvalues. The nearest-neighbor spacing and the next nearest-neighbor spacing of the eigenvalues were examined and found that they follow the universality of GOE. RMT with deterministic correlations found that each eigenvalue from deterministic correlations is observed at values, which are repelled from the bulk distribution.

Investigation, development and application of optimal output feedback theory. Vol. 4: Measures of eigenvalue/eigenvector sensitivity to system parameters and unmodeled dynamics

NASA Technical Reports Server (NTRS)

Halyo, Nesim

1987-01-01

Some measures of eigenvalue and eigenvector sensitivity applicable to both continuous and discrete linear systems are developed and investigated. An infinite series representation is developed for the eigenvalues and eigenvectors of a system. The coefficients of the series are coupled, but can be obtained recursively using a nonlinear coupled vector difference equation. A new sensitivity measure is developed by considering the effects of unmodeled dynamics. It is shown that the sensitivity is high when any unmodeled eigenvalue is near a modeled eigenvalue. Using a simple example where the sensor dynamics have been neglected, it is shown that high feedback gains produce high eigenvalue/eigenvector sensitivity. The smallest singular value of the return difference is shown not to reflect eigenvalue sensitivity since it increases with the feedback gains. Using an upper bound obtained from the infinite series, a procedure to evaluate whether the sensitivity to parameter variations is within given acceptable bounds is developed and demonstrated by an example.

Non-Hermitian localization in biological networks.

PubMed

Amir, Ariel; Hatano, Naomichi; Nelson, David R

2016-04-01

We explore the spectra and localization properties of the N-site banded one-dimensional non-Hermitian random matrices that arise naturally in sparse neural networks. Approximately equal numbers of random excitatory and inhibitory connections lead to spatially localized eigenfunctions and an intricate eigenvalue spectrum in the complex plane that controls the spontaneous activity and induced response. A finite fraction of the eigenvalues condense onto the real or imaginary axes. For large N, the spectrum has remarkable symmetries not only with respect to reflections across the real and imaginary axes but also with respect to 90^{∘} rotations, with an unusual anisotropic divergence in the localization length near the origin. When chains with periodic boundary conditions become directed, with a systematic directional bias superimposed on the randomness, a hole centered on the origin opens up in the density-of-states in the complex plane. All states are extended on the rim of this hole, while the localized eigenvalues outside the hole are unchanged. The bias-dependent shape of this hole tracks the bias-independent contours of constant localization length. We treat the large-N limit by a combination of direct numerical diagonalization and using transfer matrices, an approach that allows us to exploit an electrostatic analogy connecting the "charges" embodied in the eigenvalue distribution with the contours of constant localization length. We show that similar results are obtained for more realistic neural networks that obey "Dale's law" (each site is purely excitatory or inhibitory) and conclude with perturbation theory results that describe the limit of large directional bias, when all states are extended. Related problems arise in random ecological networks and in chains of artificial cells with randomly coupled gene expression patterns.

Sensitivity of coronal loop sausage mode frequencies and decay rates to radial and longitudinal density inhomogeneities: a spectral approach

NASA Astrophysics Data System (ADS)

Cally, Paul S.; Xiong, Ming

2018-01-01

Fast sausage modes in solar magnetic coronal loops are only fully contained in unrealistically short dense loops. Otherwise they are leaky, losing energy to their surrounds as outgoing waves. This causes any oscillation to decay exponentially in time. Simultaneous observations of both period and decay rate therefore reveal the eigenfrequency of the observed mode, and potentially insight into the tubes’ nonuniform internal structure. In this article, a global spectral description of the oscillations is presented that results in an implicit matrix eigenvalue equation where the eigenvalues are associated predominantly with the diagonal terms of the matrix. The off-diagonal terms vanish identically if the tube is uniform. A linearized perturbation approach, applied with respect to a uniform reference model, is developed that makes the eigenvalues explicit. The implicit eigenvalue problem is easily solved numerically though, and it is shown that knowledge of the real and imaginary parts of the eigenfrequency is sufficient to determine the width and density contrast of a boundary layer over which the tubes’ enhanced internal densities drop to ambient values. Linearized density kernels are developed that show sensitivity only to the extreme outside of the loops for radial fundamental modes, especially for small density enhancements, with no sensitivity to the core. Higher radial harmonics do show some internal sensitivity, but these will be more difficult to observe. Only kink modes are sensitive to the tube centres. Variation in internal and external Alfvén speed along the loop is shown to have little effect on the fundamental dimensionless eigenfrequency, though the associated eigenfunction becomes more compact at the loop apex as stratification increases, or may even displace from the apex.

Non-Hermitian localization in biological networks

NASA Astrophysics Data System (ADS)

Amir, Ariel; Hatano, Naomichi; Nelson, David R.

2016-04-01

We explore the spectra and localization properties of the N -site banded one-dimensional non-Hermitian random matrices that arise naturally in sparse neural networks. Approximately equal numbers of random excitatory and inhibitory connections lead to spatially localized eigenfunctions and an intricate eigenvalue spectrum in the complex plane that controls the spontaneous activity and induced response. A finite fraction of the eigenvalues condense onto the real or imaginary axes. For large N , the spectrum has remarkable symmetries not only with respect to reflections across the real and imaginary axes but also with respect to 90∘ rotations, with an unusual anisotropic divergence in the localization length near the origin. When chains with periodic boundary conditions become directed, with a systematic directional bias superimposed on the randomness, a hole centered on the origin opens up in the density-of-states in the complex plane. All states are extended on the rim of this hole, while the localized eigenvalues outside the hole are unchanged. The bias-dependent shape of this hole tracks the bias-independent contours of constant localization length. We treat the large-N limit by a combination of direct numerical diagonalization and using transfer matrices, an approach that allows us to exploit an electrostatic analogy connecting the "charges" embodied in the eigenvalue distribution with the contours of constant localization length. We show that similar results are obtained for more realistic neural networks that obey "Dale's law" (each site is purely excitatory or inhibitory) and conclude with perturbation theory results that describe the limit of large directional bias, when all states are extended. Related problems arise in random ecological networks and in chains of artificial cells with randomly coupled gene expression patterns.

Quasinormal modes of Reissner-Nordstrom black holes

NASA Technical Reports Server (NTRS)

Leaver, Edward W.

1990-01-01

A matrix-eigenvalue algorithm is presented for accurately computing the quasi-normal frequencies and modes of charged static blackholes. The method is then refined through the introduction of a continued-fraction step. The approach should generalize to a variety of nonseparable wave equations, including the Kerr-Newman case of charged rotating blackholes.

Preconditioning for the Navier-Stokes equations with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Godfrey, Andrew G.

1993-01-01

The extension of Van Leer's preconditioning procedure to generalized finite-rate chemistry is discussed. Application to viscous flow is begun with the proper preconditioning matrix for the one-dimensional Navier-Stokes equations. Eigenvalue stiffness is resolved and convergence-rate acceleration is demonstrated over the entire Mach-number range from nearly stagnant flow to hypersonic. Specific benefits are realized at the low and transonic flow speeds typical of complete propulsion-system simulations. The extended preconditioning matrix necessarily accounts for both thermal and chemical nonequilibrium. Numerical analysis reveals the possible theoretical improvements from using a preconditioner for all Mach number regimes. Numerical results confirm the expectations from the numerical analysis. Representative test cases include flows with previously troublesome embedded high-condition-number areas. Van Leer, Lee, and Roe recently developed an optimal, analytic preconditioning technique to reduce eigenvalue stiffness over the full Mach-number range. By multiplying the flux-balance residual with the preconditioning matrix, the acoustic wave speeds are scaled so that all waves propagate at the same rate, an essential property to eliminate inherent eigenvalue stiffness. This session discusses a synthesis of the thermochemical nonequilibrium flux-splitting developed by Grossman and Cinnella and the characteristic wave preconditioning of Van Leer into a powerful tool for implicitly solving two and three-dimensional flows with generalized finite-rate chemistry. For finite-rate chemistry, the state vector of unknowns is variable in length. Therefore, the preconditioning matrix extended to generalized finite-rate chemistry must accommodate a flexible system of moving waves. Fortunately, no new kind of wave appears in the system. The only existing waves are entropy and vorticity waves, which move with the fluid, and acoustic waves, which propagate in Mach number dependent directions. The nonequilibrium vibrational energies and species densities in the unknown state vector act strictly as convective waves. The essential concept for extending the preconditioning to generalized chemistry models is determining the differential variables which symmetrize the flux Jacobians. The extension is then straight-forward. This algorithm research effort will be released in a future version of the production level computational code coined the General Aerodynamic Simulation Program (GASP), developed by Walters, Slack, and McGrory.

Fourier method for modeling slanted lamellar gratings of arbitrary end-surface shapes in conical mounting.

PubMed

Li, Lifeng

2015-10-01

An efficient modal method for numerically modeling slanted lamellar gratings of isotropic dielectric or metallic media in conical mounting is presented. No restrictions are imposed on the slant angle and the length of the lamellae. The end surface of the lamellae can be arbitrary, subject to certain restrictions. An oblique coordinate system that is adapted to the slanted lamella sidewalls allows the most efficient way of representing and manipulating the electromagnetic fields. A translational coordinate system that is based on the oblique Cartesian coordinate system adapts to the end-surface profile of the lamellae, so that the latter can be handled simply and easily. Moreover, two matrix eigenvalue problems of size 2N × 2N, one for each fundamental polarization of the electromagnetic fields in the periodic lamellar structure, where N is the matrix truncation number, are derived to replace the 4N × 4N eigenvalue problem that has been used in the literature. The core idea leading to this success is the polarization decomposition of the electromagnetic fields inside the periodic lamellar region when the fields are expressed in the oblique translational coordinate system.

Oscilaciones estelares no-radiales: aplicación a configuraciones politrópicas y modelos de enanas blancas de He

NASA Astrophysics Data System (ADS)

Córsico, A. H.; Benvenuto, O. G.

Recently in our Observatory we have developed a new Stellar Pulsation Code, independently of other workers. Such program computes eigenvalues (eigenfrequencies) and eigenfunctions of non-radial modes in spherical non-perturbated stellar models. To accomplish this calculations, the four order eigenvalue problem (in the linear adiabatic approach) is solved by means of the well-know technique of Henyey on the finite differences scheme wich replace to the differential equations of the problem. In order to test the Code, we have computed numerous eigenmodes in polytropic configurations for several values of index n. In this comunication we show the excelent agreement of our results and that best available in the literature. Also, we present results of oscillations in models of white dwarf stars with homogeneus chemical composition (pure Helium). This models have been obtained with the Evolution Stellar Code of our Observatory. The calculations outlined above conform a first preliminary step in a major proyect whose main purpose is the study of pulsational properties of DA, DB and DO white dwarfs stars. Detailed investigations have demonstrated that such objets pulsates in non-radial g-modes with eigenperiods in the range 100-2000 sec.

An accurate and efficient acoustic eigensolver based on a fast multipole BEM and a contour integral method

NASA Astrophysics Data System (ADS)

Zheng, Chang-Jun; Gao, Hai-Feng; Du, Lei; Chen, Hai-Bo; Zhang, Chuanzeng

2016-01-01

An accurate numerical solver is developed in this paper for eigenproblems governed by the Helmholtz equation and formulated through the boundary element method. A contour integral method is used to convert the nonlinear eigenproblem into an ordinary eigenproblem, so that eigenvalues can be extracted accurately by solving a set of standard boundary element systems of equations. In order to accelerate the solution procedure, the parameters affecting the accuracy and efficiency of the method are studied and two contour paths are compared. Moreover, a wideband fast multipole method is implemented with a block IDR (s) solver to reduce the overall solution cost of the boundary element systems of equations with multiple right-hand sides. The Burton-Miller formulation is employed to identify the fictitious eigenfrequencies of the interior acoustic problems with multiply connected domains. The actual effect of the Burton-Miller formulation on tackling the fictitious eigenfrequency problem is investigated and the optimal choice of the coupling parameter as α = i / k is confirmed through exterior sphere examples. Furthermore, the numerical eigenvalues obtained by the developed method are compared with the results obtained by the finite element method to show the accuracy and efficiency of the developed method.

Maximizing algebraic connectivity in interconnected networks.

PubMed

Shakeri, Heman; Albin, Nathan; Darabi Sahneh, Faryad; Poggi-Corradini, Pietro; Scoglio, Caterina

2016-03-01

Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with interlayer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these interlayer links considering realistic constraints. In this work, we solve the problem of finding an optimal weight distribution for one-to-one interlayer links under budget constraint. We show that for the special multiplex configurations with identical layers, the uniform weight distribution is always optimal. On the other hand, when the two layers are arbitrary, increasing the budget reveals the existence of two different regimes. Up to a certain threshold budget, the second eigenvalue of the supra-Laplacian is simple, the optimal weight distribution is uniform, and the Fiedler vector is constant on each layer. Increasing the budget past the threshold, the optimal weight distribution can be nonuniform. The interesting consequence of this result is that there is no need to solve the optimization problem when the available budget is less than the threshold, which can be easily found analytically.

New matrix bounds and iterative algorithms for the discrete coupled algebraic Riccati equation

NASA Astrophysics Data System (ADS)

Liu, Jianzhou; Wang, Li; Zhang, Juan

2017-11-01

The discrete coupled algebraic Riccati equation (DCARE) has wide applications in control theory and linear system. In general, for the DCARE, one discusses every term of the coupled term, respectively. In this paper, we consider the coupled term as a whole, which is different from the recent results. When applying eigenvalue inequalities to discuss the coupled term, our method has less error. In terms of the properties of special matrices and eigenvalue inequalities, we propose several upper and lower matrix bounds for the solution of DCARE. Further, we discuss the iterative algorithms for the solution of the DCARE. In the fixed point iterative algorithms, the scope of Lipschitz factor is wider than the recent results. Finally, we offer corresponding numerical examples to illustrate the effectiveness of the derived results.

Bespoke analogue space-times: meta-material mimics

NASA Astrophysics Data System (ADS)

Schuster, Sebastian; Visser, Matt

2018-06-01

Modern meta-materials allow one to construct electromagnetic media with almost arbitrary bespoke permittivity, permeability, and magneto-electric tensors. If (and only if) the permittivity, permeability, and magneto-electric tensors satisfy certain stringent compatibility conditions, can the meta-material be fully described (at the wave optics level) in terms of an effective Lorentzian metric—an analogue spacetime. We shall consider some of the standard black-hole spacetimes of primary interest in general relativity, in various coordinate systems, and determine the equivalent meta-material susceptibility tensors in a laboratory setting. In static black hole spacetimes (Schwarzschild and the like) certain eigenvalues of the susceptibility tensors will be seen to diverge on the horizon. In stationary black hole spacetimes (Kerr and the like) certain eigenvalues of the susceptibility tensors will be seen to diverge on the ergo-surface.

a Unified Matrix Polynomial Approach to Modal Identification

NASA Astrophysics Data System (ADS)

Allemang, R. J.; Brown, D. L.

1998-04-01

One important current focus of modal identification is a reformulation of modal parameter estimation algorithms into a single, consistent mathematical formulation with a corresponding set of definitions and unifying concepts. Particularly, a matrix polynomial approach is used to unify the presentation with respect to current algorithms such as the least-squares complex exponential (LSCE), the polyreference time domain (PTD), Ibrahim time domain (ITD), eigensystem realization algorithm (ERA), rational fraction polynomial (RFP), polyreference frequency domain (PFD) and the complex mode indication function (CMIF) methods. Using this unified matrix polynomial approach (UMPA) allows a discussion of the similarities and differences of the commonly used methods. the use of least squares (LS), total least squares (TLS), double least squares (DLS) and singular value decomposition (SVD) methods is discussed in order to take advantage of redundant measurement data. Eigenvalue and SVD transformation methods are utilized to reduce the effective size of the resulting eigenvalue-eigenvector problem as well.

Computing resonance energies, widths, and wave functions using a Lanczos method in real arithmetic.

PubMed

Tremblay, Jean Christophe; Carrington, Tucker

2005-06-22

We introduce new ideas for calculating resonance energies and widths. It is shown that a non-Hermitian-Lanczos approach can be used to compute eigenvalues of H+W, where H is the Hamiltonian and W is a complex absorbing potential (CAP), without evaluating complex matrix-vector products. This is done by exploiting the link between a CAP-modified Hamiltonian matrix and a real but nonsymmetric matrix U suggested by Mandelshtam and Neumaier [J. Theor. Comput. Chem. 1, 1 (2002)] and using a coupled-two-term Lanczos procedure. We use approximate resonance eigenvectors obtained from the non-Hermitian-Lanczos algorithm and a very good CAP to obtain very accurate energies and widths without solving eigenvalue problems for many values of the CAP strength parameter and searching for cusps. The method is applied to the resonances of HCO. We compare properties of the method with those of established approaches.

An assessment of coupling algorithms for nuclear reactor core physics simulations

DOE PAGES

Hamilton, Steven; Berrill, Mark; Clarno, Kevin; ...

2016-04-01

This paper evaluates the performance of multiphysics coupling algorithms applied to a light water nuclear reactor core simulation. The simulation couples the k-eigenvalue form of the neutron transport equation with heat conduction and subchannel flow equations. We compare Picard iteration (block Gauss–Seidel) to Anderson acceleration and multiple variants of preconditioned Jacobian-free Newton–Krylov (JFNK). The performance of the methods are evaluated over a range of energy group structures and core power levels. A novel physics-based approximation to a Jacobian-vector product has been developed to mitigate the impact of expensive on-line cross section processing steps. Furthermore, numerical simulations demonstrating the efficiency ofmore » JFNK and Anderson acceleration relative to standard Picard iteration are performed on a 3D model of a nuclear fuel assembly. Both criticality (k-eigenvalue) and critical boron search problems are considered.« less

Moving mode shape function approach for spinning disk and asymmetric disc brake squeal

NASA Astrophysics Data System (ADS)

Kang, Jaeyoung

2018-06-01

The solution approach of an asymmetric spinning disk under stationary friction loads requires the mode shape function fixed in the disk in the assumed mode method when the equations of motion is described in the space-fixed frame. This model description will be termed the 'moving mode shape function approach' and it allows us to formulate the stationary contact load problem in both the axisymmetric and asymmetric disk cases. Numerical results show that the eigenvalues of the time-periodic axisymmetric disk system are time-invariant. When the axisymmetry of the disk is broken, the positive real parts of the eigenvalues highly vary with the rotation of the disk in the slow speeds in such application as disc brake squeal. By using the Floquet stability analysis, it is also shown that breaking the axisymmetry of the disc alters the stability boundaries of the system.

Approximate equiangular tight frames for compressed sensing and CDMA applications

NASA Astrophysics Data System (ADS)

Tsiligianni, Evaggelia; Kondi, Lisimachos P.; Katsaggelos, Aggelos K.

2017-12-01

Performance guarantees for recovery algorithms employed in sparse representations, and compressed sensing highlights the importance of incoherence. Optimal bounds of incoherence are attained by equiangular unit norm tight frames (ETFs). Although ETFs are important in many applications, they do not exist for all dimensions, while their construction has been proven extremely difficult. In this paper, we construct frames that are close to ETFs. According to results from frame and graph theory, the existence of an ETF depends on the existence of its signature matrix, that is, a symmetric matrix with certain structure and spectrum consisting of two distinct eigenvalues. We view the construction of a signature matrix as an inverse eigenvalue problem and propose a method that produces frames of any dimensions that are close to ETFs. Due to the achieved equiangularity property, the so obtained frames can be employed as spreading sequences in synchronous code-division multiple access (s-CDMA) systems, besides compressed sensing.

An assessment of coupling algorithms for nuclear reactor core physics simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hamilton, Steven; Berrill, Mark; Clarno, Kevin

This paper evaluates the performance of multiphysics coupling algorithms applied to a light water nuclear reactor core simulation. The simulation couples the k-eigenvalue form of the neutron transport equation with heat conduction and subchannel flow equations. We compare Picard iteration (block Gauss–Seidel) to Anderson acceleration and multiple variants of preconditioned Jacobian-free Newton–Krylov (JFNK). The performance of the methods are evaluated over a range of energy group structures and core power levels. A novel physics-based approximation to a Jacobian-vector product has been developed to mitigate the impact of expensive on-line cross section processing steps. Furthermore, numerical simulations demonstrating the efficiency ofmore » JFNK and Anderson acceleration relative to standard Picard iteration are performed on a 3D model of a nuclear fuel assembly. Both criticality (k-eigenvalue) and critical boron search problems are considered.« less

An assessment of coupling algorithms for nuclear reactor core physics simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hamilton, Steven, E-mail: hamiltonsp@ornl.gov; Berrill, Mark, E-mail: berrillma@ornl.gov; Clarno, Kevin, E-mail: clarnokt@ornl.gov

This paper evaluates the performance of multiphysics coupling algorithms applied to a light water nuclear reactor core simulation. The simulation couples the k-eigenvalue form of the neutron transport equation with heat conduction and subchannel flow equations. We compare Picard iteration (block Gauss–Seidel) to Anderson acceleration and multiple variants of preconditioned Jacobian-free Newton–Krylov (JFNK). The performance of the methods are evaluated over a range of energy group structures and core power levels. A novel physics-based approximation to a Jacobian-vector product has been developed to mitigate the impact of expensive on-line cross section processing steps. Numerical simulations demonstrating the efficiency of JFNKmore » and Anderson acceleration relative to standard Picard iteration are performed on a 3D model of a nuclear fuel assembly. Both criticality (k-eigenvalue) and critical boron search problems are considered.« less

Pressure distribution under flexible polishing tools. I - Conventional aspheric optics

NASA Astrophysics Data System (ADS)

Mehta, Pravin K.; Hufnagel, Robert E.

1990-10-01

The paper presents a mathematical model, based on Kirchoff's thin flat plate theory, developed to determine polishing pressure distribution for a flexible polishing tool. A two-layered tool in which bending and compressive stiffnesses are equal is developed, which is formulated as a plate on a linearly elastic foundation. An equivalent eigenvalue problem and solution for a free-free plate are created from the plate formulation. For aspheric, anamorphic optical surfaces, the tool misfit is derived; it is defined as the result of movement from the initial perfect fit on the optic to any other position. The Polisher Design (POD) software for circular tools on aspheric optics is introduced. NASTRAN-based finite element analysis results are compared with the POD software, showing high correlation. By employing existing free-free eigenvalues and eigenfunctions, the work may be extended to rectangular polishing tools as well.

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

DOE PAGES

Kalchev, Delyan Z.; Lee, C. S.; Villa, U.; ...

2016-09-22

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kalchev, Delyan Z.; Lee, C. S.; Villa, U.

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less

The method of Ritz applied to the equation of Hamilton. [for pendulum systems

NASA Technical Reports Server (NTRS)

Bailey, C. D.

1976-01-01

Without any reference to the theory of differential equations, the initial value problem of the nonlinear, nonconservative double pendulum system is solved by the application of the method of Ritz to the equation of Hamilton. Also shown is an example of the reduction of the traditional eigenvalue problem of linear, homogeneous, differential equations of motion to the solution of a set of nonhomogeneous algebraic equations. No theory of differential equations is used. Solution of the time-space path of the linear oscillator is demonstrated and compared to the exact solution.

Extension of Nikiforov-Uvarov method for the solution of Heun equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Karayer, H., E-mail: hale.karayer@gmail.com; Demirhan, D.; Büyükkılıç, F.

2015-06-15

We report an alternative method to solve second order differential equations which have at most four singular points. This method is developed by changing the degrees of the polynomials in the basic equation of Nikiforov-Uvarov (NU) method. This is called extended NU method for this paper. The eigenvalue solutions of Heun equation and confluent Heun equation are obtained via extended NU method. Some quantum mechanical problems such as Coulomb problem on a 3-sphere, two Coulombically repelling electrons on a sphere, and hyperbolic double-well potential are investigated by this method.

Fourier analysis of finite element preconditioned collocation schemes

NASA Technical Reports Server (NTRS)

Deville, Michel O.; Mund, Ernest H.

1990-01-01

The spectrum of the iteration operator of some finite element preconditioned Fourier collocation schemes is investigated. The first part of the paper analyses one-dimensional elliptic and hyperbolic model problems and the advection-diffusion equation. Analytical expressions of the eigenvalues are obtained with use of symbolic computation. The second part of the paper considers the set of one-dimensional differential equations resulting from Fourier analysis (in the tranverse direction) of the 2-D Stokes problem. All results agree with previous conclusions on the numerical efficiency of finite element preconditioning schemes.

Frictionless Contact of Multilayered Composite Half Planes Containing Layers With Complex Eigenvalues

NASA Technical Reports Server (NTRS)

Zhang, Wang; Binienda, Wieslaw K.; Pindera, Marek-Jerzy

1997-01-01

A previously developed local-global stiffness matrix methodology for the response of a composite half plane, arbitrarily layered with isotropic, orthotropic or monoclinic plies, to indentation by a rigid parabolic punch is further extended to accommodate the presence of layers with complex eigenvalues (e.g., honeycomb or piezoelectric layers). First, a generalized plane deformation solution for the displacement field in an orthotropic layer or half plane characterized by complex eigenvalues is obtained using Fourier transforms. A local stiffness matrix in the transform domain is subsequently constructed for this class of layers and half planes, which is then assembled into a global stiffness matrix for the entire multilayered half plane by enforcing continuity conditions along the interfaces. Application of the mixed boundary condition on the top surface of the half plane indented by a rigid punch results in an integral equation for the unknown pressure in the contact region. The integral possesses a divergent kernel which is decomposed into Cauchy-type and regular parts using the asymptotic properties of the local stiffness matrix and a relationship between Fourier and finite Hilbert transform of the contact pressure. The solution of the resulting singular integral equation is obtained using a collocation technique based on the properties of orthogonal polynomials developed by Erdogan and Gupta. Examples are presented that illustrate the important influence of low transverse properties of layers with complex eigenvalues, such as those exhibited by honeycomb, on the load versus contact length response and contact pressure distributions for half planes containing typical composite materials.

Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mohammadi, Shahin; Gleich, David F.; Kolda, Tamara G.

2015-11-01

Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangularmore » AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.« less

Polynomial approximation of functions of matrices and its application to the solution of a general system of linear equations

NASA Technical Reports Server (NTRS)

Tal-Ezer, Hillel

1987-01-01

During the process of solving a mathematical model numerically, there is often a need to operate on a vector v by an operator which can be expressed as f(A) while A is NxN matrix (ex: exp(A), sin(A), A sup -1). Except for very simple matrices, it is impractical to construct the matrix f(A) explicitly. Usually an approximation to it is used. In the present research, an algorithm is developed which uses a polynomial approximation to f(A). It is reduced to a problem of approximating f(z) by a polynomial in z while z belongs to the domain D in the complex plane which includes all the eigenvalues of A. This problem of approximation is approached by interpolating the function f(z) in a certain set of points which is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problem is described. Since a solution to a linear system Ax = b is x= A sup -1 b, an iterative solution to it can be regarded as a polynomial approximation to f(A) = A sup -1. Implementing the algorithm in this case is also described.

PDQ-8 reference manual (LWBR development program)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pfiefer, C J; Spitz, C J

1978-05-01

The PDQ-8 program is designed to solve the neutron diffusion, depletion problem in one, two, or three dimensions on the CDC-6600 and CDC-7600 computers. The three dimensional spatial calculation may be either explicit or discontinuous trial function synthesis. Up to five lethargy groups are permitted. The fast group treatment may be simplified P(3), and the thermal neutrons may be represented by a single group or a pair of overlapping groups. Adjoint, fixed source, one iteration, additive fixed source, eigenvalue, and boundary value calculations may be performed. The HARMONY system is used for cross section variation and generalized depletion chain solutions.more » The depletion is a combination gross block depletion for all nuclides as well as a fine block depletion for a specified subset of the nuclides. The geometries available include rectangular, cylindrical, spherical, hexagonal, and a very general quadrilateral geometry with diagonal interfaces. All geometries allow variable mesh in all dimensions. Various control searches as well as temperature and xenon feedbacks are provided. The synthesis spatial solution time is dependent on the number of trial functions used and the number of gross blocks. The PDQ-8 program is used at Bettis on a production basis for solving diffusion--depletion problems. The report describes the various features of the program and then separately describes the input required to utilize these features.« less

Topics in QCD at Nonzero Temperature and Density

NASA Astrophysics Data System (ADS)

Pangeni, Kamal

Understanding the behavior of matter at ultra-high density such as neutron stars require the knowledge of ground state properties of Quantum chromodynamics (QCD) at finite chemical potential. However, this task has turned out to be very difficult because of two main reasons: 1) QCD may still be strongly coupled at those regimes making perturbative calculations unreliable and 2) QCD at finite density suffers from the sign problem that makes the use of lattice simulation problematic and it even affects phenomenological models. In the first part of this thesis, we show that the sign problem in analytical calculations of finite density models can be solved by considering the CK-symmetric, where C is charge conjugation and K is complex conjugation, complex saddle points of the effective action. We then explore the properties and consequences of such complex saddle points at non-zero temperature and density. Due to CK symmetry, the mass matrix eigenvalues in these models are not always real but can be complex, which results in damped oscillation of the density-density correlation function, a new feature of finite density models. To address the generality of such behavior, we next consider a lattice model of QCD with static quarks at strong-coupling. Computation of the mass spectrum confirms the existence of complex eigenvalues in much of temperature-chemical potential plane. This provides an independent confirmation of our results obtained using phenomenological models of QCD. The existence of regions in parameter space where density-density correlation function exhibit damped oscillation is one of the hallmarks of typical liquid-gas system. The formalism developed to tackle the sign problem in QCD models actually gives a simple understanding for the existence of such behavior in liquid-gas system. To this end, we develop a generic field theoretic model for the treatment of liquid-gas phase transition. An effective field theory at finite density derived from a fundamental four dimensional field theory turns out to be complex but CK symmetric. The existence of CK symmetry results in complex mass eigenvalues, which in turn leads to damped oscillatory behavior of the density-density correlation function. In the last part of this thesis, we study the effect of large amplitude density oscillations on the transport properties of superfluid nuclear matter. In nuclear matter at neutron-star densities and temperature, Cooper pairing leads to the formations of a gap in the nucleon excitation spectra resulting in exponentially strong Boltzmann suppression of many transport coefficients. Previous calculations have shown evidence that density oscillations of sufficiently large amplitude can overcome this suppression for flavor-changing beta processes via the mechanism of "gap-bridging". We address the simplifications made in that initial work, and show that gap bridging can counteract Boltzmann suppression of neutrino emissivity for the realistic case of modified Urca processes in matter with 3 P2 neutron pairing.

Matched signal detection on graphs: Theory and application to brain imaging data classification.

PubMed

Hu, Chenhui; Sepulcre, Jorge; Johnson, Keith A; Fakhri, Georges E; Lu, Yue M; Li, Quanzheng

2016-01-15

Motivated by recent progress in signal processing on graphs, we have developed a matched signal detection (MSD) theory for signals with intrinsic structures described by weighted graphs. First, we regard graph Laplacian eigenvalues as frequencies of graph-signals and assume that the signal is in a subspace spanned by the first few graph Laplacian eigenvectors associated with lower eigenvalues. The conventional matched subspace detector can be applied to this case. Furthermore, we study signals that may not merely live in a subspace. Concretely, we consider signals with bounded variation on graphs and more general signals that are randomly drawn from a prior distribution. For bounded variation signals, the test is a weighted energy detector. For the random signals, the test statistic is the difference of signal variations on associated graphs, if a degenerate Gaussian distribution specified by the graph Laplacian is adopted. We evaluate the effectiveness of the MSD on graphs both with simulated and real data sets. Specifically, we apply MSD to the brain imaging data classification problem of Alzheimer's disease (AD) based on two independent data sets: 1) positron emission tomography data with Pittsburgh compound-B tracer of 30 AD and 40 normal control (NC) subjects, and 2) resting-state functional magnetic resonance imaging (R-fMRI) data of 30 early mild cognitive impairment and 20 NC subjects. Our results demonstrate that the MSD approach is able to outperform the traditional methods and help detect AD at an early stage, probably due to the success of exploiting the manifold structure of the data. Copyright © 2015. Published by Elsevier Inc.

Three flavor neutrino oscillations in matter: Flavor diagonal potentials, the adiabatic basis, and the CP phase

NASA Astrophysics Data System (ADS)

Kneller, James P.; McLaughlin, Gail C.

2009-09-01

We discuss the three neutrino flavor evolution problem with general, flavor-diagonal, matter potentials and a fully parametrized mixing matrix that includes CP violation, and derive expressions for the eigenvalues, mixing angles, and phases. We demonstrate that, in the limit that the mu and tau potentials are equal, the eigenvalues and matter mixing angles θ˜12 and θ˜13 are independent of the CP phase, although θ˜23 does have CP dependence. Since we are interested in developing a framework that can be used for S matrix calculations of neutrino flavor transformation, it is useful to work in a basis that contains only off-diagonal entries in the Hamiltonian. We derive the “nonadiabaticity” parameters that appear in the Hamiltonian in this basis. We then introduce the neutrino S matrix, derive its evolution equation and the integral solution. We find that this new Hamiltonian, and therefore the S matrix, in the limit that the μ and τ neutrino potentials are the same, is independent of both θ˜23 and the CP violating phase. In this limit, any CP violation in the flavor basis can only be introduced via the rotation matrices, and so effects which derive from the CP phase are then straightforward to determine. We then show explicitly that the electron neutrino and electron antineutrino survival probability is independent of the CP phase in this limit. Conversely, if the CP phase is nonzero and mu and tau matter potentials are not equal, then the electron neutrino survival probability cannot be independent of the CP phase.

Morse Theory and Relative Equilibria in the Planar n-Vortex Problem

NASA Astrophysics Data System (ADS)

Roberts, Gareth E.

2018-04-01

Morse theoretical ideas are applied to the study of relative equilibria in the planar n-vortex problem. For the case of positive circulations, we prove that the Morse index of a critical point of the Hamiltonian restricted to a level surface of the angular impulse is equal to the number of pairs of real eigenvalues of the corresponding relative equilibrium periodic solution. The Morse inequalities are then used to prove the instability of some families of relative equilibria in the four-vortex problem with two pairs of equal vorticities. We also show that, for positive circulations, relative equilibria cannot accumulate on the collision set.

ENDF/B-VII.1 Neutron Cross Section Data Testing with Critical Assembly Benchmarks and Reactor Experiments

NASA Astrophysics Data System (ADS)

Kahler, A. C.; MacFarlane, R. E.; Mosteller, R. D.; Kiedrowski, B. C.; Frankle, S. C.; Chadwick, M. B.; McKnight, R. D.; Lell, R. M.; Palmiotti, G.; Hiruta, H.; Herman, M.; Arcilla, R.; Mughabghab, S. F.; Sublet, J. C.; Trkov, A.; Trumbull, T. H.; Dunn, M.

2011-12-01

The ENDF/B-VII.1 library is the latest revision to the United States' Evaluated Nuclear Data File (ENDF). The ENDF library is currently in its seventh generation, with ENDF/B-VII.0 being released in 2006. This revision expands upon that library, including the addition of new evaluated files (was 393 neutron files previously, now 423 including replacement of elemental vanadium and zinc evaluations with isotopic evaluations) and extension or updating of many existing neutron data files. Complete details are provided in the companion paper [M. B. Chadwick et al., "ENDF/B-VII.1 Nuclear Data for Science and Technology: Cross Sections, Covariances, Fission Product Yields and Decay Data," Nuclear Data Sheets, 112, 2887 (2011)]. This paper focuses on how accurately application libraries may be expected to perform in criticality calculations with these data. Continuous energy cross section libraries, suitable for use with the MCNP Monte Carlo transport code, have been generated and applied to a suite of nearly one thousand critical benchmark assemblies defined in the International Criticality Safety Benchmark Evaluation Project's International Handbook of Evaluated Criticality Safety Benchmark Experiments. This suite covers uranium and plutonium fuel systems in a variety of forms such as metallic, oxide or solution, and under a variety of spectral conditions, including unmoderated (i.e., bare), metal reflected and water or other light element reflected. Assembly eigenvalues that were accurately predicted with ENDF/B-VII.0 cross sections such as unmoderated and uranium reflected 235U and 239Pu assemblies, HEU solution systems and LEU oxide lattice systems that mimic commercial PWR configurations continue to be accurately calculated with ENDF/B-VII.1 cross sections, and deficiencies in predicted eigenvalues for assemblies containing selected materials, including titanium, manganese, cadmium and tungsten are greatly reduced. Improvements are also confirmed for selected actinide reaction rates such as 236U, 238,242Pu and 241,243Am capture in fast systems. Other deficiencies, such as the overprediction of Pu solution system critical eigenvalues and a decreasing trend in calculated eigenvalue for 233U fueled systems as a function of Above-Thermal Fission Fraction remain. The comprehensive nature of this critical benchmark suite and the generally accurate calculated eigenvalues obtained with ENDF/B-VII.1 neutron cross sections support the conclusion that this is the most accurate general purpose ENDF/B cross section library yet released to the technical community.

Conservative-variable average states for equilibrium gas multi-dimensional fluxes

NASA Technical Reports Server (NTRS)

Iannelli, G. S.

1992-01-01

Modern split component evaluations of the flux vector Jacobians are thoroughly analyzed for equilibrium-gas average-state determinations. It is shown that all such derivations satisfy a fundamental eigenvalue consistency theorem. A conservative-variable average state is then developed for arbitrary equilibrium-gas equations of state and curvilinear-coordinate fluxes. Original expressions for eigenvalues, sound speed, Mach number, and eigenvectors are then determined for a general average Jacobian, and it is shown that the average eigenvalues, Mach number, and eigenvectors may not coincide with their classical pointwise counterparts. A general equilibrium-gas equation of state is then discussed for conservative-variable computational fluid dynamics (CFD) Euler formulations. The associated derivations lead to unique compatibility relations that constrain the pressure Jacobian derivatives. Thereafter, alternative forms for the pressure variation and average sound speed are developed in terms of two average pressure Jacobian derivatives. Significantly, no additional degree of freedom exists in the determination of these two average partial derivatives of pressure. Therefore, they are simultaneously computed exactly without any auxiliary relation, hence without any geometric solution projection or arbitrary scale factors. Several alternative formulations are then compared and key differences highlighted with emphasis on the determination of the pressure variation and average sound speed. The relevant underlying assumptions are identified, including some subtle approximations that are inherently employed in published average-state procedures. Finally, a representative test case is discussed for which an intrinsically exact average state is determined. This exact state is then compared with the predictions of recent methods, and their inherent approximations are appropriately quantified.

Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications

NASA Astrophysics Data System (ADS)

Julaiti, Alafate; Wu, Bin; Zhang, Zhongzhi

2013-05-01

The eigenvalues of the normalized Laplacian matrix of a network play an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian matrices of a family of fractal trees and dendrimers modeled by Cayley trees, both of which are built in an iterative way. For the fractal trees, we apply the spectral decimation approach to determine analytically all the eigenvalues and their corresponding multiplicities, with the eigenvalues provided by a recursive relation governing the eigenvalues of networks at two successive generations. For Cayley trees, we show that all their eigenvalues can be obtained by computing the roots of several small-degree polynomials defined recursively. By using the relation between normalized Laplacian spectra and eigentime identity, we derive the explicit solution to the eigentime identity for random walks on the two treelike networks, the leading scalings of which follow quite different behaviors. In addition, we corroborate the obtained eigenvalues and their degeneracies through the link between them and the number of spanning trees.

Chandrasekhar-Kendall modes and Taylor relaxation in an axisymmetric torus

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tang, X.Z.; Boozer, A.H.; Department of Applied Physics and Applied Mathematics, Columbia University, New York, New York 10027

2005-10-01

The helicity-conserving Taylor relaxation of a plasma in a toroidal chamber to a force-free configuration, which means j=(j{sub parallel})/B)B with j{sub parallel}/B independent of position, can be generalized to include the external injection of magnetic helicity. When this is done, j{sub parallel}/B has resonant values, which can be understood using the eigenmodes of Taylor-relaxed plasmas enclosed by a perfectly conducting toroidal shell. These eigenmodes include a toroidal generalization of those found by Chandrasekhar and Kendall (CK) [Astrophys. J. 126, 457 (1957)] for a spherical chamber, which has no externally produced magnetic flux. It is shown that the CK modes inmore » an axisymmetric torus are of three types: (1) helical modes as well as axisymmetric modes that have (2) and have no (3) net toroidal flux. Yoshida and Giga (YG) [Math. Z. 204, 235 (1990)] published a fourth class of modes: axisymmetric modes that have no net toroidal flux in the chamber due to toroidal flux produced by a net poloidal current in the shell canceling the net toroidal flux from the plasma currents. Jensen and Chu [Phys. Fluids 27, 2881 (1984)], as well as Taylor [Rev. Mod. Phys. 58, 741 (1986)], considered modes in which the vector potential was zero on the axisymmetric toroidal chamber. It is shown that these Jensen-Chu-Taylor modes include only the CK helical modes and the CK axisymmetric modes without net toroidal flux. If the toroidal chamber is perfectly conducting except for a cut that prevents a net poloidal current from flowing, resonances in j{sub parallel}/B occur at the eigenvalues of the axisymmetric CK modes. Jensen and Chu studied this type of resonance. Without the cut, so a poloidal current flows to conserve the net toroidal flux, it is shown that j{sub parallel}/B resonances occur at the eigenvalues of the CK modes that have no net toroidal flux and at the eigenvalues of the YG modes, which are upshifted from the eigenvalues of the axisymmetric CK modes that carry net toroidal flux.« less

Matrix Results and Techniques in Quantum Information Science and Related Topics

NASA Astrophysics Data System (ADS)

Pelejo, Diane Christine

In this dissertation, we present several matrix-related problems and results motivated by quantum information theory. Some background material of quantum information science will be discussed in chapter 1, while chapter 7 gives a summary of results and concluding remarks. In chapter 2, we look at 2n x 2 n unitary matrices, which describe operations on a closed n-qubit system. We define a set of simple quantum gates, called controlled single qubit gates, and their associated operational cost. We then present a recurrence scheme to decompose a general 2n x 2n unitary matrix to the product of no more than 2n-12n-1 single qubit gates with small number of controls. In chapter 3, we address the problem of finding a specific element phi among a given set of quantum channels S that will produce the optimal value of a scalar function D(rho 1,phi(rho2)), on two fixed quantum states rho 1 and rho2. Some of the functions we considered for D(·,·) are the trace distance, quantum fidelity and quantum relative entropy. We discuss the optimal solution when S is the set of unitary quantum channels, the set of mixed unitary channels, the set of unital quantum channels, and the set of all quantum channels. In chapter 4, we focus on the spectral properties of qubit-qudit bipartite states with a maximally mixed qudit subsystem. More specifically, given positive numbers a1 ≥ ... ≥ a 2n ≥ 0, we want to determine if there exist a 2n x 2n density matrix rho having eigenvalues a1,..., a2n and satisfying tr 1(rho)=1/n In. This problem is a special case of the more general quantum marginal problem. We give the minimal necessary and sufficient conditions on a1,..., a2n for n ≤ 6 and state some observations on general values of n.. In chapter 5, we discuss the numerical method of alternating projections and illustrate its usefulness in: (a) constructing a quantum channel, if it exists, such that phi(rho(1))=sigma(1),...,phi(rho (k))=sigma(k) for given rho (1),...,rho(k) ∈ Dn and sigma(1),...,sigma (k) ∈ Dm, (b) constructing a multipartite state rho having a prescribed set of reduced states rho1,..., rhor on r of its subsystems, (c) constructing a multipartite staterho having prescribed reduced states and additional properties such as having prescribed eigenvalues, prescribed rank or low von Neuman entropy; and (d) determining if a square matrix A can be written as a product of two positive semidefinite contractions. In chapter 6, we examine the shape of the Minkowski product of convex subsets K1 and K2 of C given by K1K 2 = {ab: a ∈ K1, b ∈ K2}, which has applications in the study of the product numerical range and quantum error-correction. In Karol, it was conjectured that K1K 2 is star-shaped when K1 and K2 are convex. We give counterexamples to show that this conjecture does not hold in general but we show that the set K 1K2 is star-shaped if K 1 is a line segment or a circular disk.

Parallel-vector computation for structural analysis and nonlinear unconstrained optimization problems

NASA Technical Reports Server (NTRS)

Nguyen, Duc T.

1990-01-01

Practical engineering application can often be formulated in the form of a constrained optimization problem. There are several solution algorithms for solving a constrained optimization problem. One approach is to convert a constrained problem into a series of unconstrained problems. Furthermore, unconstrained solution algorithms can be used as part of the constrained solution algorithms. Structural optimization is an iterative process where one starts with an initial design, a finite element structure analysis is then performed to calculate the response of the system (such as displacements, stresses, eigenvalues, etc.). Based upon the sensitivity information on the objective and constraint functions, an optimizer such as ADS or IDESIGN, can be used to find the new, improved design. For the structural analysis phase, the equation solver for the system of simultaneous, linear equations plays a key role since it is needed for either static, or eigenvalue, or dynamic analysis. For practical, large-scale structural analysis-synthesis applications, computational time can be excessively large. Thus, it is necessary to have a new structural analysis-synthesis code which employs new solution algorithms to exploit both parallel and vector capabilities offered by modern, high performance computers such as the Convex, Cray-2 and Cray-YMP computers. The objective of this research project is, therefore, to incorporate the latest development in the parallel-vector equation solver, PVSOLVE into the widely popular finite-element production code, such as the SAP-4. Furthermore, several nonlinear unconstrained optimization subroutines have also been developed and tested under a parallel computer environment. The unconstrained optimization subroutines are not only useful in their own right, but they can also be incorporated into a more popular constrained optimization code, such as ADS.

Performance and Self-Consistency of the Generalized Dielectric Dependent Hybrid Functional

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brawand, Nicholas P.; Govoni, Marco; Vörös, Márton

Here, we analyze the performance of the recently proposed screened exchange constant functional (SX) on the GW100 test set, and we discuss results obtained at different levels of self-consistency. The SX functional is a generalization of dielectric dependent hybrid functionals to finite systems; it is nonempirical and depends on the average screening of the exchange interaction. We compare results for ionization potentials obtained with SX to those of CCSD(T) calculations and experiments, and we find excellent agreement, on par with recent state of the art methods based on many body perturbation theory. Applying SX perturbatively to correct PBE eigenvalues yieldsmore » improved results in most cases, except for ionic molecules, for which wave function self-consistency is instead crucial. Calculations where wave functions and the screened exchange constant (α SX) are determined self-consistently, and those where α SX is fixed to the value determined within PBE, yield results of comparable accuracy. Perturbative G 0W 0 corrections of eigenvalues obtained with self-consistent αSX are small on average, for all molecules in the GW100 test set.« less

New Approaches to Coding Information using Inverse Scattering Transform

NASA Astrophysics Data System (ADS)

Frumin, L. L.; Gelash, A. A.; Turitsyn, S. K.

2017-06-01

Remarkable mathematical properties of the integrable nonlinear Schrödinger equation (NLSE) can offer advanced solutions for the mitigation of nonlinear signal distortions in optical fiber links. Fundamental optical soliton, continuous, and discrete eigenvalues of the nonlinear spectrum have already been considered for the transmission of information in fiber-optic channels. Here, we propose to apply signal modulation to the kernel of the Gelfand-Levitan-Marchenko equations that offers the advantage of a relatively simple decoder design. First, we describe an approach based on exploiting the general N -soliton solution of the NLSE for simultaneous coding of N symbols involving 4 ×N coding parameters. As a specific elegant subclass of the general schemes, we introduce a soliton orthogonal frequency division multiplexing (SOFDM) method. This method is based on the choice of identical imaginary parts of the N -soliton solution eigenvalues, corresponding to equidistant soliton frequencies, making it similar to the conventional OFDM scheme, thus, allowing for the use of the efficient fast Fourier transform algorithm to recover the data. Then, we demonstrate how to use this new approach to control signal parameters in the case of the continuous spectrum.