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.

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.

The Modern Origin of Matrices and Their Applications

ERIC Educational Resources Information Center

Debnath, L.

2014-01-01

This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show…

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.

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.

Quadratic Zeeman effect in hydrogen Rydberg states: Rigorous error estimates for energy eigenvalues, energy eigenfunctions, and oscillator strengths

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

Falsaperla, P.; Fonte, G.

1994-10-01

A variational method, based on some results due to T. Kato [Proc. Phys. Soc. Jpn. 4, 334 (1949)], and previously discussed is here applied to the hydrogen atom in uniform magnetic fields of tesla in order to calculate, with a rigorous error estimate, energy eigenvalues, energy eigenfunctions, and oscillator strengths relative to Rydberg states up to just below the field-free ionization threshold. Making use of a basis (parabolic Sturmian basis) with a size varying from 990 up to 5050, we obtain, over the energy range of [minus]190 to [minus]24 cm[sup [minus]1], all of the eigenvalues and a good part ofmore » the oscillator strengths with a remarkable accuracy. This, however, decreases with increasing excitation energy and, thus, above [similar to][minus]24 cm[sup [minus]1], we obtain results of good accuracy only for eigenvalues ranging up to [similar to][minus]12 cm[sup [minus]1].« less

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)

Preliminary demonstration of a robust controller design method

NASA Technical Reports Server (NTRS)

Anderson, L. R.

1980-01-01

Alternative computational procedures for obtaining a feedback control law which yields a control signal based on measurable quantitites are evaluated. The three methods evaluated are: (1) the standard linear quadratic regulator design model; (2) minimization of the norm of the feedback matrix, k via nonlinear programming subject to the constraint that the closed loop eigenvalues be in a specified domain in the complex plane; and (3) maximize the angles between the closed loop eigenvectors in combination with minimizing the norm of K also via the constrained nonlinear programming. The third or robust design method was chosen to yield a closed loop system whose eigenvalues are insensitive to small changes in the A and B matrices. The relationship between orthogonality of closed loop eigenvectors and the sensitivity of closed loop eigenvalues is described. Computer programs are described.

Optimization of cascade blade mistuning. I - Equations of motion and basic inherent properties

NASA Technical Reports Server (NTRS)

Nissim, E.

1985-01-01

Attention is given to the derivation of the equations of motion of mistuned compressor blades, interpolating aerodynamic coefficients by means of quadratic expressions in the reduced frequency. If the coefficients of the quadratic expressions are permitted to assume complex values, excellent accuracy is obtained and Pade rational expressions are obviated. On the basis of the resulting equations, it is shown analytically that the sum of all the real parts of the eigenvalues is independent of the mistuning introduced into the system. Blade mistuning is further treated through the aerodynamic energy approach, and the limiting vibration modes associated with alternative mistunings are identified.

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.

Sensitivity analysis and approximation methods for general eigenvalue problems

NASA Technical Reports Server (NTRS)

Murthy, D. V.; Haftka, R. T.

1986-01-01

Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

A contracting-interval program for the Danilewski method. Ph.D. Thesis - Va. Univ.

NASA Technical Reports Server (NTRS)

Harris, J. D.

1971-01-01

The concept of contracting-interval programs is applied to finding the eigenvalues of a matrix. The development is a three-step process in which (1) a program is developed for the reduction of a matrix to Hessenberg form, (2) a program is developed for the reduction of a Hessenberg matrix to colleague form, and (3) the characteristic polynomial with interval coefficients is readily obtained from the interval of colleague matrices. This interval polynomial is then factored into quadratic factors so that the eigenvalues may be obtained. To develop a contracting-interval program for factoring this polynomial with interval coefficients it is necessary to have an iteration method which converges even in the presence of controlled rounding errors. A theorem is stated giving sufficient conditions for the convergence of Newton's method when both the function and its Jacobian cannot be evaluated exactly but errors can be made proportional to the square of the norm of the difference between the previous two iterates. This theorem is applied to prove the convergence of the generalization of the Newton-Bairstow method that is used to obtain quadratic factors of the characteristic polynomial.

Learning graph matching.

PubMed

Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J

2009-06-01

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.

An Algebraic Construction of the First Integrals of the Stationary KdV Hierarchy

NASA Astrophysics Data System (ADS)

Matsushima, Masatomo; Ohmiya, Mayumi

2009-09-01

The stationary KdV hierarchy is constructed using a kind of recursion operator called Λ-operator. The notion of the maximal solution of the n-th stationary KdV equation is introduced. Using this maximal solution, a specific differential polynomial with the auxiliary spectral parameter called the spectral M-function is constructed as the quadratic form of the fundamental system of the eigenvalue problem for the 2-nd order linear ordinary differential equation which is related to the linearizing operator of the hierarchy. By calculating a perfect square condition of the quadratic form by an elementary algebraic method, the complete set of first integrals of this hierarchy is constructed.

Universality and Thouless energy in the supersymmetric Sachdev-Ye-Kitaev model

NASA Astrophysics Data System (ADS)

García-García, Antonio M.; Jia, Yiyang; Verbaarschot, Jacobus J. M.

2018-05-01

We investigate the supersymmetric Sachdev-Ye-Kitaev (SYK) model, N Majorana fermions with infinite range interactions in 0 +1 dimensions. We have found that, close to the ground state E ≈0 , discrete symmetries alter qualitatively the spectral properties with respect to the non-supersymmetric SYK model. The average spectral density at finite N , which we compute analytically and numerically, grows exponentially with N for E ≈0 . However the chiral condensate, which is normalized with respect the total number of eigenvalues, vanishes in the thermodynamic limit. Slightly above E ≈0 , the spectral density grows exponentially with the energy. Deep in the quantum regime, corresponding to the first O (N ) eigenvalues, the average spectral density is universal and well described by random matrix ensembles with chiral and superconducting discrete symmetries. The dynamics for E ≈0 is investigated by level fluctuations. Also in this case we find excellent agreement with the prediction of chiral and superconducting random matrix ensembles for eigenvalue separations smaller than the Thouless energy, which seems to scale linearly with N . Deviations beyond the Thouless energy, which describes how ergodicity is approached, are universally characterized by a quadratic growth of the number variance. In the time domain, we have found analytically that the spectral form factor g (t ), obtained from the connected two-level correlation function of the unfolded spectrum, decays as 1 /t2 for times shorter but comparable to the Thouless time with g (0 ) related to the coefficient of the quadratic growth of the number variance. Our results provide further support that quantum black holes are ergodic and therefore can be classified by random matrix theory.

Quadratic Zeeman effect for hydrogen: A method for rigorous bound-state error estimates

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

Fonte, G.; Falsaperla, P.; Schiffrer, G.

1990-06-01

We present a variational method, based on direct minimization of energy, for the calculation of eigenvalues and eigenfunctions of a hydrogen atom in a strong uniform magnetic field in the framework of the nonrelativistic theory (quadratic Zeeman effect). Using semiparabolic coordinates and a harmonic-oscillator basis, we show that it is possible to give rigorous error estimates for both eigenvalues and eigenfunctions by applying some results of Kato (Proc. Phys. Soc. Jpn. 4, 334 (1949)). The method can be applied in this simple form only to the lowest level of given angular momentum and parity, but it is also possible tomore » apply it to any excited state by using the standard Rayleigh-Ritz diagonalization method. However, due to the particular basis, the method is expected to be more effective, the weaker the field and the smaller the excitation energy, while the results of Kato we have employed lead to good estimates only when the level spacing is not too small. We present a numerical application to the {ital m}{sup {ital p}}=0{sup +} ground state and the lowest {ital m}{sup {ital p}}=1{sup {minus}} excited state, giving results that are among the most accurate in the literature for magnetic fields up to about 10{sup 10} G.« less

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

NASA Technical Reports Server (NTRS)

Swarztrauber, Paul N.

1993-01-01

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. 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 signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

NASA Astrophysics Data System (ADS)

Heinkenschloss, Matthias

2005-01-01

We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality 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.

Control of large flexible systems via eigenvalue relocation

NASA Technical Reports Server (NTRS)

Denman, E. D.; Jeon, G. J.

1985-01-01

For the vibration control of large flexible systems, a control scheme by which the eigenvalues of the closed-loop systems are assigned to predetermined locations within the feasible region through velocity-only feedback is presented. Owing to the properties of second-order lambda-matrices and an efficient model decoupling technique, the control scheme makes it possible that selected modes are damped with the rest of the modes unchanged.

Quadratic Zeeman effect in hydrogen Rydberg states: Rigorous bound-state error estimates in the weak-field regime

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

Falsaperla, P.; Fonte, G.

1993-05-01

Applying a method based on some results due to Kato [Proc. Phys. Soc. Jpn. 4, 334 (1949)], we show that series of Rydberg eigenvalues and Rydberg eigenfunctions of hydrogen in a uniform magnetic field can be calculated with a rigorous error estimate. The efficiency of the method decreases as the eigenvalue density increases and as [gamma][ital n][sup 3][r arrow]1, where [gamma] is the magnetic-field strength in units of 2.35[times]10[sup 9] G and [ital n] is the principal quantum number of the unperturbed hydrogenic manifold from which the diamagnetic Rydberg states evolve. Fixing [gamma] at the laboratory value 2[times]10[sup [minus]5] andmore » confining our calculations to the region [gamma][ital n][sup 3][lt]1 (weak-field regime), we obtain extremely accurate results up to states corresponding to the [ital n]=32 manifold.« less

Optimal linear-quadratic control of coupled parabolic-hyperbolic PDEs

NASA Astrophysics Data System (ADS)

Aksikas, I.; Moghadam, A. Alizadeh; Forbes, J. F.

2017-10-01

This paper focuses on the optimal control design for a system of coupled parabolic-hypebolic partial differential equations by using the infinite-dimensional state-space description and the corresponding operator Riccati equation. Some dynamical properties of the coupled system of interest are analysed to guarantee the existence and uniqueness of the solution of the linear-quadratic (LQ)-optimal control problem. A state LQ-feedback operator is computed by solving the operator Riccati equation, which is converted into a set of algebraic and differential Riccati equations, thanks to the eigenvalues and the eigenvectors of the parabolic operator. The results are applied to a non-isothermal packed-bed catalytic reactor. The LQ-optimal controller designed in the early portion of the paper is implemented for the original nonlinear model. Numerical simulations are performed to show the controller performances.

Robustness of linear quadratic state feedback designs in the presence of system uncertainty. [application to Augmentor Wing Jet STOL Research Aircraft flare control autopilot design

NASA Technical Reports Server (NTRS)

Patel, R. V.; Toda, M.; Sridhar, B.

1977-01-01

The paper deals with the problem of expressing the robustness (stability) property of a linear quadratic state feedback (LQSF) design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices so that the closed-loop system remains stable. Nonlinear time-varying and linear time-invariant perturbations are considered. The only computation required in obtaining a measure of the robustness of an LQSF design is to determine the eigenvalues of two symmetric matrices determined when solving the algebraic Riccati equation corresponding to the LQSF design problem. Results are applied to a complex dynamic system consisting of the flare control of a STOL aircraft. The design of the flare control is formulated as an LQSF tracking problem.

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 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.

Molecular dynamics in principal component space.

PubMed

Michielssens, Servaas; van Erp, Titus S; Kutzner, Carsten; Ceulemans, Arnout; de Groot, Bert L

2012-07-26

A molecular dynamics algorithm in principal component space is presented. It is demonstrated that sampling can be improved without changing the ensemble by assigning masses to the principal components proportional to the inverse square root of the eigenvalues. The setup of the simulation requires no prior knowledge of the system; a short initial MD simulation to extract the eigenvectors and eigenvalues suffices. Independent measures indicated a 6-7 times faster sampling compared to a regular molecular dynamics simulation.

Eigenvalue assignment by minimal state-feedback gain in LTI multivariable systems

NASA Astrophysics Data System (ADS)

Ataei, Mohammad; Enshaee, Ali

2011-12-01

In this article, an improved method for eigenvalue assignment via state feedback in the linear time-invariant multivariable systems is proposed. This method is based on elementary similarity operations, and involves mainly utilisation of vector companion forms, and thus is very simple and easy to implement on a digital computer. In addition to the controllable systems, the proposed method can be applied for the stabilisable ones and also systems with linearly dependent inputs. Moreover, two types of state-feedback gain matrices can be achieved by this method: (1) the numerical one, which is unique, and (2) the parametric one, in which its parameters are determined in order to achieve a gain matrix with minimum Frobenius norm. The numerical examples are presented to demonstrate the advantages of the proposed method.

Conjugate gradient heat bath for ill-conditioned actions.

PubMed

Ceriotti, Michele; Bussi, Giovanni; Parrinello, Michele

2007-08-01

We present a method for performing sampling from a Boltzmann distribution of an ill-conditioned quadratic action. This method is based on heat-bath thermalization along a set of conjugate directions, generated via a conjugate-gradient procedure. The resulting scheme outperforms local updates for matrices with very high condition number, since it avoids the slowing down of modes with lower eigenvalue, and has some advantages over the global heat-bath approach, compared to which it is more stable and allows for more freedom in devising case-specific optimizations.

General Criterion for Harmonicity

NASA Astrophysics Data System (ADS)

Proesmans, Karel; Vandebroek, Hans; Van den Broeck, Christian

2017-10-01

Inspired by Kubo-Anderson Markov processes, we introduce a new class of transfer matrices whose largest eigenvalue is determined by a simple explicit algebraic equation. Applications include the free energy calculation for various equilibrium systems and a general criterion for perfect harmonicity, i.e., a free energy that is exactly quadratic in the external field. As an illustration, we construct a "perfect spring," namely, a polymer with non-Gaussian, exponentially distributed subunits which, nevertheless, remains harmonic until it is fully stretched. This surprising discovery is confirmed by Monte Carlo and Langevin simulations.

Vibration control of large linear quadratic symmetric systems. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Jeon, G. J.

1983-01-01

Some unique properties on a class of the second order lambda matrices were found and applied to determine a damping matrix of the decoupled subsystem in such a way that the damped system would have preassigned eigenvalues without disturbing the stiffness matrix. The resulting system was realized as a time invariant velocity only feedback control system with desired poles. Another approach using optimal control theory was also applied to the decoupled system in such a way that the mode spillover problem could be eliminated. The procedures were tested successfully by numerical examples.

An analysis of spectral envelope-reduction via quadratic assignment problems

NASA Technical Reports Server (NTRS)

George, Alan; Pothen, Alex

1994-01-01

A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

A novel method to quantify the activity of alcohol acetyltransferase Using a SnO2-based sensor of electronic nose.

PubMed

Hu, Zhongqiu; Li, Xiaojing; Wang, Huxuan; Niu, Chen; Yuan, Yahong; Yue, Tianli

2016-07-15

Alcohol acetyltransferase (AATFase) extensively catalyzes the reactions of alcohols to acetic esters in microorganisms and plants. In this work, a novel method has been proposed to quantify the activity of AATFase using a SnO2-based sensor of electronic nose, which was determined on the basis of its higher sensitivity to the reducing alcohol than the oxidizing ester. The maximum value of the first-derivative of the signals from the SnO2-based sensor was therein found to be an eigenvalue of isoamyl alcohol concentration. Quadratic polynomial regression perfectly fitted the correlation between the eigenvalue and the isoamyl alcohol concentration. The method was used to determine the AATFase activity in this type of reaction by calculating the conversion rate of isoamyl alcohol. The proposed method has been successfully applied to determine the AATFase activity of a cider yeast strain. Compared with GC-MS, the method shows promises with ideal recovery and low cost. Copyright © 2016 Elsevier Ltd. All rights reserved.

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.

Some insights on hard quadratic assignment problem instances

NASA Astrophysics Data System (ADS)

Hussin, Mohamed Saifullah

2017-11-01

Since the formal introduction of metaheuristics, a huge number Quadratic Assignment Problem (QAP) instances have been introduced. Those instances however are loosely-structured, and therefore made it difficult to perform any systematic analysis. The QAPLIB for example, is a library that contains a huge number of QAP benchmark instances that consists of instances with different size and structure, but with a very limited availability for every instance type. This prevents researchers from performing organized study on those instances, such as parameter tuning and testing. In this paper, we will discuss several hard instances that have been introduced over the years, and algorithms that have been used for solving them.

Patent Network Analysis and Quadratic Assignment Procedures to Identify the Convergence of Robot Technologies

PubMed Central

Lee, Woo Jin; Lee, Won Kyung

2016-01-01

Because of the remarkable developments in robotics in recent years, technological convergence has been active in this area. We focused on finding patterns of convergence within robot technology using network analysis of patents in both the USPTO and KIPO. To identify the variables that affect convergence, we used quadratic assignment procedures (QAP). From our analysis, we observed the patent network ecology related to convergence and found technologies that have great potential to converge with other robotics technologies. The results of our study are expected to contribute to setting up convergence based R&D policies for robotics, which can lead new innovation. PMID:27764196

The Benefit of Interleaved Mathematics Practice Is Not Limited to Superficially Similar Kinds of Problems

ERIC Educational Resources Information Center

Rohrer, Doug; Dedrick, Robert F.; Burgess, Kaleena

2014-01-01

Most mathematics assignments consist of a group of problems requiring the same strategy. For example, a lesson on the quadratic formula is typically followed by a block of problems requiring students to use the quadratic formula, which means that students know the appropriate strategy before they read each problem. In an alternative approach,…

The coprime quantum chain

NASA Astrophysics Data System (ADS)

Mussardo, G.; Giudici, G.; Viti, J.

2017-03-01

In this paper we introduce and study the coprime quantum chain, i.e. a strongly correlated quantum system defined in terms of the integer eigenvalues n i of the occupation number operators at each site of a chain of length M. The n i ’s take value in the interval [2,q] and may be regarded as S z eigenvalues in the spin representation j  =  (q  -  2)/2. The distinctive interaction of the model is based on the coprimality matrix \\boldsymbolΦ : for the ferromagnetic case, this matrix assigns lower energy to configurations where occupation numbers n i and n i+1 of neighbouring sites share a common divisor, while for the anti-ferromagnetic case it assigns a lower energy to configurations where n i and n i+1 are coprime. The coprime chain, both in the ferro and anti-ferromagnetic cases, may present an exponential number of ground states whose values can be exactly computed by means of graph theoretical tools. In the ferromagnetic case there are generally also frustration phenomena. A fine tuning of local operators may lift the exponential ground state degeneracy and, according to which operators are switched on, the system may be driven into different classes of universality, among which the Ising or Potts universality class. The paper also contains an appendix by Don Zagier on the exact eigenvalues and eigenvectors of the coprimality matrix in the limit q\\to ∞ .

Adaptive dynamic programming for discrete-time linear quadratic regulation based on multirate generalised policy iteration

NASA Astrophysics Data System (ADS)

Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho

2018-06-01

In this paper, we propose two multirate generalised policy iteration (GPI) algorithms applied to discrete-time linear quadratic regulation problems. The proposed algorithms are extensions of the existing GPI algorithm that consists of the approximate policy evaluation and policy improvement steps. The two proposed schemes, named heuristic dynamic programming (HDP) and dual HDP (DHP), based on multirate GPI, use multi-step estimation (M-step Bellman equation) at the approximate policy evaluation step for estimating the value function and its gradient called costate, respectively. Then, we show that these two methods with the same update horizon can be considered equivalent in the iteration domain. Furthermore, monotonically increasing and decreasing convergences, so called value iteration (VI)-mode and policy iteration (PI)-mode convergences, are proved to hold for the proposed multirate GPIs. Further, general convergence properties in terms of eigenvalues are also studied. The data-driven online implementation methods for the proposed HDP and DHP are demonstrated and finally, we present the results of numerical simulations performed to verify the effectiveness of the proposed methods.

The generalized quadratic knapsack problem. A neuronal network approach.

PubMed

Talaván, Pedro M; Yáñez, Javier

2006-05-01

The solution of an optimization problem through the continuous Hopfield network (CHN) is based on some energy or Lyapunov function, which decreases as the system evolves until a local minimum value is attained. A new energy function is proposed in this paper so that any 0-1 linear constrains programming with quadratic objective function can be solved. This problem, denoted as the generalized quadratic knapsack problem (GQKP), includes as particular cases well-known problems such as the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). This new energy function generalizes those proposed by other authors. Through this energy function, any GQKP can be solved with an appropriate parameter setting procedure, which is detailed in this paper. As a particular case, and in order to test this generalized energy function, some computational experiments solving the traveling salesman problem are also included.

The damped wave equation with unbounded damping

NASA Astrophysics Data System (ADS)

Freitas, Pedro; Siegl, Petr; Tretter, Christiane

2018-06-01

We analyze new phenomena arising in linear damped wave equations on unbounded domains when the damping is allowed to become unbounded at infinity. We prove the generation of a contraction semigroup, study the relation between the spectra of the semigroup generator and the associated quadratic operator function, the convergence of non-real eigenvalues in the asymptotic regime of diverging damping on a subdomain, and we investigate the appearance of essential spectrum on the negative real axis. We further show that the presence of the latter prevents exponential estimates for the semigroup and turns out to be a robust effect that cannot be easily canceled by adding a positive potential. These analytic results are illustrated by examples.

Estimating factors influencing the detection probability of semiaquatic freshwater snails using quadrat survey methods

USGS Publications Warehouse

Roesler, Elizabeth L.; Grabowski, Timothy B.

2018-01-01

Developing effective monitoring methods for elusive, rare, or patchily distributed species requires extra considerations, such as imperfect detection. Although detection is frequently modeled, the opportunity to assess it empirically is rare, particularly for imperiled species. We used Pecos assiminea (Assiminea pecos), an endangered semiaquatic snail, as a case study to test detection and accuracy issues surrounding quadrat searches. Quadrats (9 × 20 cm; n = 12) were placed in suitable Pecos assiminea habitat and randomly assigned a treatment, defined as the number of empty snail shells (0, 3, 6, or 9). Ten observers rotated through each quadrat, conducting 5-min visual searches for shells. The probability of detecting a shell when present was 67.4 ± 3.0%, but it decreased with the increasing litter depth and fewer number of shells present. The mean (± SE) observer accuracy was 25.5 ± 4.3%. Accuracy was positively correlated to the number of shells in the quadrat and negatively correlated to the number of times a quadrat was searched. The results indicate quadrat surveys likely underrepresent true abundance, but accurately determine the presence or absence. Understanding detection and accuracy of elusive, rare, or imperiled species improves density estimates and aids in monitoring and conservation efforts.

Bag-of-features based medical image retrieval via multiple assignment and visual words weighting.

PubMed

Wang, Jingyan; Li, Yongping; Zhang, Ying; Wang, Chao; Xie, Honglan; Chen, Guoling; Gao, Xin

2011-11-01

Bag-of-features based approaches have become prominent for image retrieval and image classification tasks in the past decade. Such methods represent an image as a collection of local features, such as image patches and key points with scale invariant feature transform (SIFT) descriptors. To improve the bag-of-features methods, we first model the assignments of local descriptors as contribution functions, and then propose a novel multiple assignment strategy. Assuming the local features can be reconstructed by their neighboring visual words in a vocabulary, reconstruction weights can be solved by quadratic programming. The weights are then used to build contribution functions, resulting in a novel assignment method, called quadratic programming (QP) assignment. We further propose a novel visual word weighting method. The discriminative power of each visual word is analyzed by the sub-similarity function in the bin that corresponds to the visual word. Each sub-similarity function is then treated as a weak classifier. A strong classifier is learned by boosting methods that combine those weak classifiers. The weighting factors of the visual words are learned accordingly. We evaluate the proposed methods on medical image retrieval tasks. The methods are tested on three well-known data sets, i.e., the ImageCLEFmed data set, the 304 CT Set, and the basal-cell carcinoma image set. Experimental results demonstrate that the proposed QP assignment outperforms the traditional nearest neighbor assignment, the multiple assignment, and the soft assignment, whereas the proposed boosting based weighting strategy outperforms the state-of-the-art weighting methods, such as the term frequency weights and the term frequency-inverse document frequency weights.

Extensions to PIFCGT: Multirate output feedback and optimal disturbance suppression

NASA Technical Reports Server (NTRS)

Broussard, J. R.

1986-01-01

New control synthesis procedures for digital flight control systems were developed. The theoretical developments are the solution to the problem of optimal disturbance suppression in the presence of windshear. Control synthesis is accomplished using a linear quadratic cost function, the command generator tracker for trajectory following and the proportional-integral-filter control structure for practical implementation. Extensions are made to the optimal output feedback algorithm for computing feedback gains so that the multirate and optimal disturbance control designs are computed and compared for the advanced transport operating system (ATOPS). The performance of the designs is demonstrated by closed-loop poles, frequency domain multiinput sigma and eigenvalue plots and detailed nonlinear 6-DOF aircraft simulations in the terminal area in the presence of windshear.

Modern control techniques in active flutter suppression using a control moment gyro

NASA Technical Reports Server (NTRS)

Buchek, P. M.

1974-01-01

Development of organized synthesis techniques, using concepts of modern control theory was studied for the design of active flutter suppression systems for two and three-dimensional lifting surfaces, utilizing a control moment gyro (CMG) to generate the required control torques. Incompressible flow theory is assumed, with the unsteady aerodynamic forces and moments for arbitrary airfoil motion obtained by using the convolution integral based on Wagner's indicial lift function. Linear optimal control theory is applied to find particular optimal sets of gain values which minimize a quadratic performance function. The closed loop system's response to impulsive gust disturbances and the resulting control power requirements are investigated, and the system eigenvalues necessary to minimize the maximum value of control power are determined.

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.

Neural-genetic synthesis for state-space controllers based on linear quadratic regulator design for eigenstructure assignment.

PubMed

da Fonseca Neto, João Viana; Abreu, Ivanildo Silva; da Silva, Fábio Nogueira

2010-04-01

Toward the synthesis of state-space controllers, a neural-genetic model based on the linear quadratic regulator design for the eigenstructure assignment of multivariable dynamic systems is presented. The neural-genetic model represents a fusion of a genetic algorithm and a recurrent neural network (RNN) to perform the selection of the weighting matrices and the algebraic Riccati equation solution, respectively. A fourth-order electric circuit model is used to evaluate the convergence of the computational intelligence paradigms and the control design method performance. The genetic search convergence evaluation is performed in terms of the fitness function statistics and the RNN convergence, which is evaluated by landscapes of the energy and norm, as a function of the parameter deviations. The control problem solution is evaluated in the time and frequency domains by the impulse response, singular values, and modal analysis.

Extremal entanglement witnesses

NASA Astrophysics Data System (ADS)

Hansen, Leif Ove; Hauge, Andreas; Myrheim, Jan; Sollid, Per Øyvind

2015-02-01

We present a study of extremal entanglement witnesses on a bipartite composite quantum system. We define the cone of witnesses as the dual of the set of separable density matrices, thus TrΩρ≥0 when Ω is a witness and ρ is a pure product state, ρ=ψψ† with ψ=ϕ⊗χ. The set of witnesses of unit trace is a compact convex set, uniquely defined by its extremal points. The expectation value f(ϕ,χ)=TrΩρ as a function of vectors ϕ and χ is a positive semidefinite biquadratic form. Every zero of f(ϕ,χ) imposes strong real-linear constraints on f and Ω. The real and symmetric Hessian matrix at the zero must be positive semidefinite. Its eigenvectors with zero eigenvalue, if such exist, we call Hessian zeros. A zero of f(ϕ,χ) is quadratic if it has no Hessian zeros, otherwise it is quartic. We call a witness quadratic if it has only quadratic zeros, and quartic if it has at least one quartic zero. A main result we prove is that a witness is extremal if and only if no other witness has the same, or a larger, set of zeros and Hessian zeros. A quadratic extremal witness has a minimum number of isolated zeros depending on dimensions. If a witness is not extremal, then the constraints defined by its zeros and Hessian zeros determine all directions in which we may search for witnesses having more zeros or Hessian zeros. A finite number of iterated searches in random directions, by numerical methods, leads to an extremal witness which is nearly always quadratic and has the minimum number of zeros. We discuss briefly some topics related to extremal witnesses, in particular the relation between the facial structures of the dual sets of witnesses and separable states. We discuss the relation between extremality and optimality of witnesses, and a conjecture of separability of the so-called structural physical approximation (SPA) of an optimal witness. Finally, we discuss how to treat the entanglement witnesses on a complex Hilbert space as a subset of the witnesses on a real Hilbert space.

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows

PubMed Central

Wang, Di; Kleinberg, Robert D.

2009-01-01

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C2, C3, C4,…. It is known that C2 can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing Ck (k > 2) require solving a linear program. In this paper we prove that C3 can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}n, this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network. PMID:20161596

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows.

PubMed

Wang, Di; Kleinberg, Robert D

2009-11-28

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C(2), C(3), C(4),…. It is known that C(2) can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing C(k) (k > 2) require solving a linear program. In this paper we prove that C(3) can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}(n), this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network.

Evaluation of linearly solvable Markov decision process with dynamic model learning in a mobile robot navigation task.

PubMed

Kinjo, Ken; Uchibe, Eiji; Doya, Kenji

2013-01-01

Linearly solvable Markov Decision Process (LMDP) is a class of optimal control problem in which the Bellman's equation can be converted into a linear equation by an exponential transformation of the state value function (Todorov, 2009b). In an LMDP, the optimal value function and the corresponding control policy are obtained by solving an eigenvalue problem in a discrete state space or an eigenfunction problem in a continuous state using the knowledge of the system dynamics and the action, state, and terminal cost functions. In this study, we evaluate the effectiveness of the LMDP framework in real robot control, in which the dynamics of the body and the environment have to be learned from experience. We first perform a simulation study of a pole swing-up task to evaluate the effect of the accuracy of the learned dynamics model on the derived the action policy. The result shows that a crude linear approximation of the non-linear dynamics can still allow solution of the task, despite with a higher total cost. We then perform real robot experiments of a battery-catching task using our Spring Dog mobile robot platform. The state is given by the position and the size of a battery in its camera view and two neck joint angles. The action is the velocities of two wheels, while the neck joints were controlled by a visual servo controller. We test linear and bilinear dynamic models in tasks with quadratic and Guassian state cost functions. In the quadratic cost task, the LMDP controller derived from a learned linear dynamics model performed equivalently with the optimal linear quadratic regulator (LQR). In the non-quadratic task, the LMDP controller with a linear dynamics model showed the best performance. The results demonstrate the usefulness of the LMDP framework in real robot control even when simple linear models are used for dynamics learning.

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].

Complexity and diversity.

PubMed

Doebeli, Michael; Ispolatov, Iaroslav

2010-04-23

The mechanisms for the origin and maintenance of biological diversity are not fully understood. It is known that frequency-dependent selection, generating advantages for rare types, can maintain genetic variation and lead to speciation, but in models with simple phenotypes (that is, low-dimensional phenotype spaces), frequency dependence needs to be strong to generate diversity. However, we show that if the ecological properties of an organism are determined by multiple traits with complex interactions, the conditions needed for frequency-dependent selection to generate diversity are relaxed to the point where they are easily satisfied in high-dimensional phenotype spaces. Mathematically, this phenomenon is reflected in properties of eigenvalues of quadratic forms. Because all living organisms have at least hundreds of phenotypes, this casts the potential importance of frequency dependence for the origin and maintenance of diversity in a new light.

Piecewise linear approximation for hereditary control problems

NASA Technical Reports Server (NTRS)

Propst, Georg

1987-01-01

Finite dimensional approximations are presented for linear retarded functional differential equations by use of discontinuous piecewise linear functions. The approximation scheme is applied to optimal control problems when a quadratic cost integral has to be minimized subject to the controlled retarded system. It is shown that the approximate optimal feedback operators converge to the true ones both in case the cost integral ranges over a finite time interval as well as in the case it ranges over an infinite time interval. The arguments in the latter case rely on the fact that the piecewise linear approximations to stable systems are stable in a uniform sense. This feature is established using a vector-component stability criterion in the state space R(n) x L(2) and the favorable eigenvalue behavior of the piecewise linear approximations.

Where Do We Draw the Line? Assigning Cases to Subsamples for MAMBAC, MAXCOV, and MAXEIG Taxometric Analyses

ERIC Educational Resources Information Center

Walters, Glenn D.; Ruscio, John

2010-01-01

There are several important decisions that must be made when implementing taxometric procedures such as mean above minus below a cut (MAMBAC), maximum covariance (MAXCOV), and maximum eigenvalue (MAXEIG). A Monte Carlo study was performed with 10,000 (5,000 categorical, 5,000 dimensional) samples to examine 5 ways to locate the first and last…

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.

Flight control synthesis for flexible aircraft using Eigenspace assignment

NASA Technical Reports Server (NTRS)

Davidson, J. B.; Schmidt, D. K.

1986-01-01

The use of eigenspace assignment techniques to synthesize flight control systems for flexible aircraft is explored. Eigenspace assignment techniques are used to achieve a specified desired eigenspace, chosen to yield desirable system impulse residue magnitudes for selected system responses. Two of these are investigated. The first directly determines constant measurement feedback gains that will yield a close-loop system eigenspace close to a desired eigenspace. The second technique selects quadratic weighting matrices in a linear quadratic control synthesis that will asymptotically yield the close-loop achievable eigenspace. Finally, the possibility of using either of these techniques with state estimation is explored. Application of the methods to synthesize integrated flight-control and structural-mode-control laws for a large flexible aircraft is demonstrated and results discussed. Eigenspace selection criteria based on design goals are discussed, and for the study case it would appear that a desirable eigenspace can be obtained. In addition, the importance of state-space selection is noted along with problems with reduced-order measurement feedback. Since the full-state control laws may be implemented with dynamic compensation (state estimation), the use of reduced-order measurement feedback is less desirable. This is especially true since no change in the transient response from the pilot's input results if state estimation is used appropriately. The potential is also noted for high actuator bandwidth requirements if the linear quadratic synthesis approach is utilized. Even with the actuator pole location selected, a problem with unmodeled modes is noted due to high bandwidth. Some suggestions for future research include investigating how to choose an eigenspace that will achieve certain desired dynamics and stability robustness, determining how the choice of measurements effects synthesis results, and exploring how the phase relationships between desired eigenvector elements effects the synthesis results.

A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

PubMed Central

Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

2016-01-01

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.

PubMed

Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

2016-01-01

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian

NASA Technical Reports Server (NTRS)

Guattery, Stephen; Leighton, Tom; Miller, Gary L.

1997-01-01

We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical circuits; it uses clique embeddings to produce lower bounds on lambda(sub 2) and star embeddings to produce lower bounds on the smallest Rayleigh quotient when there is a zero Dirichlet boundary condition. The method assigns priorities to the paths in the embedding; we show that, for an unweighted tree T, using uniform priorities for a clique embedding produces a lower bound on lambda(sub 2) that is off by at most an 0(log diameter(T)) factor. We show that the best bounds this method can produce for clique embeddings are the same as for a related method that uses clique embeddings and edge lengths to produce bounds.

Fungible Correlation Matrices: A Method for Generating Nonsingular, Singular, and Improper Correlation Matrices for Monte Carlo Research.

PubMed

Waller, Niels G

2016-01-01

For a fixed set of standardized regression coefficients and a fixed coefficient of determination (R-squared), an infinite number of predictor correlation matrices will satisfy the implied quadratic form. I call such matrices fungible correlation matrices. In this article, I describe an algorithm for generating positive definite (PD), positive semidefinite (PSD), or indefinite (ID) fungible correlation matrices that have a random or fixed smallest eigenvalue. The underlying equations of this algorithm are reviewed from both algebraic and geometric perspectives. Two simulation studies illustrate that fungible correlation matrices can be profitably used in Monte Carlo research. The first study uses PD fungible correlation matrices to compare penalized regression algorithms. The second study uses ID fungible correlation matrices to compare matrix-smoothing algorithms. R code for generating fungible correlation matrices is presented in the supplemental materials.

Sub-optimal control of fuzzy linear dynamical systems under granular differentiability concept.

PubMed

Mazandarani, Mehran; Pariz, Naser

2018-05-01

This paper deals with sub-optimal control of a fuzzy linear dynamical system. The aim is to keep the state variables of the fuzzy linear dynamical system close to zero in an optimal manner. In the fuzzy dynamical system, the fuzzy derivative is considered as the granular derivative; and all the coefficients and initial conditions can be uncertain. The criterion for assessing the optimality is regarded as a granular integral whose integrand is a quadratic function of the state variables and control inputs. Using the relative-distance-measure (RDM) fuzzy interval arithmetic and calculus of variations, the optimal control law is presented as the fuzzy state variables feedback. Since the optimal feedback gains are obtained as fuzzy functions, they need to be defuzzified. This will result in the sub-optimal control law. This paper also sheds light on the restrictions imposed by the approaches which are based on fuzzy standard interval arithmetic (FSIA), and use strongly generalized Hukuhara and generalized Hukuhara differentiability concepts for obtaining the optimal control law. The granular eigenvalues notion is also defined. Using an RLC circuit mathematical model, it is shown that, due to their unnatural behavior in the modeling phenomenon, the FSIA-based approaches may obtain some eigenvalues sets that might be different from the inherent eigenvalues set of the fuzzy dynamical system. This is, however, not the case with the approach proposed in this study. The notions of granular controllability and granular stabilizability of the fuzzy linear dynamical system are also presented in this paper. Moreover, a sub-optimal control for regulating a Boeing 747 in longitudinal direction with uncertain initial conditions and parameters is gained. In addition, an uncertain suspension system of one of the four wheels of a bus is regulated using the sub-optimal control introduced in this paper. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Order-Constrained Solutions in K-Means Clustering: Even Better than Being Globally Optimal

ERIC Educational Resources Information Center

Steinley, Douglas; Hubert, Lawrence

2008-01-01

This paper proposes an order-constrained K-means cluster analysis strategy, and implements that strategy through an auxiliary quadratic assignment optimization heuristic that identifies an initial object order. A subsequent dynamic programming recursion is applied to optimally subdivide the object set subject to the order constraint. We show that…

Gain weighted eigenspace assignment

NASA Technical Reports Server (NTRS)

Davidson, John B.; Andrisani, Dominick, II

1994-01-01

This report presents the development of the gain weighted eigenspace assignment methodology. This provides a designer with a systematic methodology for trading off eigenvector placement versus gain magnitudes, while still maintaining desired closed-loop eigenvalue locations. This is accomplished by forming a cost function composed of a scalar measure of error between desired and achievable eigenvectors and a scalar measure of gain magnitude, determining analytical expressions for the gradients, and solving for the optimal solution by numerical iteration. For this development the scalar measure of gain magnitude is chosen to be a weighted sum of the squares of all the individual elements of the feedback gain matrix. An example is presented to demonstrate the method. In this example, solutions yielding achievable eigenvectors close to the desired eigenvectors are obtained with significant reductions in gain magnitude compared to a solution obtained using a previously developed eigenspace (eigenstructure) assignment method.

Minimizing distortion and internal forces in truss structures by simulated annealing

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.

1989-01-01

Inaccuracies in the length of members and the diameters of joints of large truss reflector backup structures may produce unacceptable levels of surface distortion and member forces. However, if the member lengths and joint diameters can be measured accurately it is possible to configure the members and joints so that root-mean-square (rms) surface error and/or rms member forces is minimized. Following Greene and Haftka (1989) it is assumed that the force vector f is linearly proportional to the member length errors e(sub M) of dimension NMEMB (the number of members) and joint errors e(sub J) of dimension NJOINT (the number of joints), and that the best-fit displacement vector d is a linear function of f. Let NNODES denote the number of positions on the surface of the truss where error influences are measured. The solution of the problem is discussed. To classify, this problem was compared to a similar combinatorial optimization problem. In particular, when only the member length errors are considered, minimizing d(sup 2)(sub rms) is equivalent to the quadratic assignment problem. The quadratic assignment problem is a well known NP-complete problem in operations research literature. Hence minimizing d(sup 2)(sub rms) is is also an NP-complete problem. The focus of the research is the development of a simulated annealing algorithm to reduce d(sup 2)(sub rms). The plausibility of this technique is its recent success on a variety of NP-complete combinatorial optimization problems including the quadratic assignment problem. A physical analogy for simulated annealing is the way liquids freeze and crystallize. All computational experiments were done on a MicroVAX. The two interchange heuristic is very fast but produces widely varying results. The two and three interchange heuristic provides less variability in the final objective function values but runs much more slowly. Simulated annealing produced the best objective function values for every starting configuration and was faster than the two and three interchange heuristic.

Finite-temperature phase transitions of third and higher order in gauge theories at large N

DOE PAGES

Nishimura, Hiromichi; Pisarski, Robert D.; Skokov, Vladimir V.

2018-02-15

We study phase transitions in SU(∞) gauge theories at nonzero temperature using matrix models. Our basic assumption is that the effective potential is dominated by double trace terms for the Polyakov loops. As a function of the various parameters, related to terms linear, quadratic, and quartic in the Polyakov loop, the phase diagram exhibits a universal structure. In a large region of this parameter space, there is a continuous phase transition whose order is larger than second. This is a generalization of the phase transition of Gross, Witten, and Wadia (GWW). Depending upon the detailed form of the matrix model,more » the eigenvalue density and the behavior of the specific heat near the transition differ drastically. Here, we speculate that in the pure gauge theory, that although the deconfining transition is thermodynamically of first order, it can be nevertheless conformally symmetric at infnite N.« less

LQR-Based Optimal Distributed Cooperative Design for Linear Discrete-Time Multiagent Systems.

PubMed

Zhang, Huaguang; Feng, Tao; Liang, Hongjing; Luo, Yanhong

2017-03-01

In this paper, a novel linear quadratic regulator (LQR)-based optimal distributed cooperative design method is developed for synchronization control of general linear discrete-time multiagent systems on a fixed, directed graph. Sufficient conditions are derived for synchronization, which restrict the graph eigenvalues into a bounded circular region in the complex plane. The synchronizing speed issue is also considered, and it turns out that the synchronizing region reduces as the synchronizing speed becomes faster. To obtain more desirable synchronizing capacity, the weighting matrices are selected by sufficiently utilizing the guaranteed gain margin of the optimal regulators. Based on the developed LQR-based cooperative design framework, an approximate dynamic programming technique is successfully introduced to overcome the (partially or completely) model-free cooperative design for linear multiagent systems. Finally, two numerical examples are given to illustrate the effectiveness of the proposed design methods.

Finite-temperature phase transitions of third and higher order in gauge theories at large N

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

Nishimura, Hiromichi; Pisarski, Robert D.; Skokov, Vladimir V.

We study phase transitions in SU(∞) gauge theories at nonzero temperature using matrix models. Our basic assumption is that the effective potential is dominated by double trace terms for the Polyakov loops. As a function of the various parameters, related to terms linear, quadratic, and quartic in the Polyakov loop, the phase diagram exhibits a universal structure. In a large region of this parameter space, there is a continuous phase transition whose order is larger than second. This is a generalization of the phase transition of Gross, Witten, and Wadia (GWW). Depending upon the detailed form of the matrix model,more » the eigenvalue density and the behavior of the specific heat near the transition differ drastically. Here, we speculate that in the pure gauge theory, that although the deconfining transition is thermodynamically of first order, it can be nevertheless conformally symmetric at infnite N.« less

Comparison of SIRT and SQS for Regularized Weighted Least Squares Image Reconstruction

PubMed Central

Gregor, Jens; Fessler, Jeffrey A.

2015-01-01

Tomographic image reconstruction is often formulated as a regularized weighted least squares (RWLS) problem optimized by iterative algorithms that are either inherently algebraic or derived from a statistical point of view. This paper compares a modified version of SIRT (Simultaneous Iterative Reconstruction Technique), which is of the former type, with a version of SQS (Separable Quadratic Surrogates), which is of the latter type. We show that the two algorithms minimize the same criterion function using similar forms of preconditioned gradient descent. We present near-optimal relaxation for both based on eigenvalue bounds and include a heuristic extension for use with ordered subsets. We provide empirical evidence that SIRT and SQS converge at the same rate for all intents and purposes. For context, we compare their performance with an implementation of preconditioned conjugate gradient. The illustrative application is X-ray CT of luggage for aviation security. PMID:26478906

A wide-angle high Mach number modal expansion for infrasound propagation.

PubMed

Assink, Jelle; Waxler, Roger; Velea, Doru

2017-03-01

The use of modal expansions to solve the problem of atmospheric infrasound propagation is revisited. A different form of the associated modal equation is introduced, valid for wide-angle propagation in atmospheres with high Mach number flow. The modal equation can be formulated as a quadratic eigenvalue problem for which there are simple and efficient numerical implementations. A perturbation expansion for the treatment of attenuation, valid for stratified media with background flow, is derived as well. Comparisons are carried out between the proposed algorithm and a modal algorithm assuming an effective sound speed, including a real data case study. The comparisons show that the effective sound speed approximation overestimates the effect of horizontal wind on sound propagation, leading to errors in traveltime, propagation path, trace velocity, and absorption. The error is found to be dependent on propagation angle and Mach number.

Measuring Human Performance on Clustering Problems: Some Potential Objective Criteria and Experimental Research Opportunities

ERIC Educational Resources Information Center

Brusco, Michael J.

2007-01-01

The study of human performance on discrete optimization problems has a considerable history that spans various disciplines. The two most widely studied problems are the Euclidean traveling salesperson problem and the quadratic assignment problem. The purpose of this paper is to outline a program of study for the measurement of human performance on…

Modal control theory and application to aircraft lateral handling qualities design

NASA Technical Reports Server (NTRS)

Srinathkumar, S.

1978-01-01

A multivariable synthesis procedure based on eigenvalue/eigenvector assignment is reviewed and is employed to develop a systematic design procedure to meet the lateral handling qualities design objectives of a fighter aircraft over a wide range of flight conditions. The closed loop modal characterization developed provides significant insight into the design process and plays a pivotal role in the synthesis of robust feedback systems. The simplicity of the synthesis algorithm yields an efficient computer aided interactive design tool for flight control system synthesis.

Scalable Effective Approaches for Quadratic Assignment Problems Based on Conic Optimization and Applications

DTIC Science & Technology

2012-02-09

1nclud1ng suggestions for reduc1ng the burden. to the Department of Defense. ExecutiVe Serv1ce D>rectorate (0704-0188) Respondents should be aware...benchmark problem we contacted Bertrand LeCun who in their poject CHOC from 2005-2008 had applied their parallel B&B framework BOB++ to the RLT1

An open source software tool to assign the material properties of bone for ABAQUS finite element simulations.

PubMed

Pegg, Elise C; Gill, Harinderjit S

2016-09-06

A new software tool to assign the material properties of bone to an ABAQUS finite element mesh was created and compared with Bonemat, a similar tool originally designed to work with Ansys finite element models. Our software tool (py_bonemat_abaqus) was written in Python, which is the chosen scripting language for ABAQUS. The purpose of this study was to compare the software packages in terms of the material assignment calculation and processing speed. Three element types were compared (linear hexahedral (C3D8), linear tetrahedral (C3D4) and quadratic tetrahedral elements (C3D10)), both individually and as part of a mesh. Comparisons were made using a CT scan of a hemi-pelvis as a test case. A small difference, of -0.05kPa on average, was found between Bonemat version 3.1 (the current version) and our Python package. Errors were found in the previous release of Bonemat (version 3.0 downloaded from www.biomedtown.org) during calculation of the quadratic tetrahedron Jacobian, and conversion of the apparent density to modulus when integrating over the Young׳s modulus field. These issues caused up to 2GPa error in the modulus assignment. For these reasons, we recommend users upgrade to the most recent release of Bonemat. Processing speeds were assessed for the three different element types. Our Python package took significantly longer (110s on average) to perform the calculations compared with the Bonemat software (10s). Nevertheless, the workflow advantages of the package and added functionality makes 'py_bonemat_abaqus' a useful tool for ABAQUS users. Copyright © 2016 Elsevier Ltd. All rights reserved.

Optimal reduced-rank quadratic classifiers using the Fukunaga-Koontz transform with applications to automated target recognition

NASA Astrophysics Data System (ADS)

Huo, Xiaoming; Elad, Michael; Flesia, Ana G.; Muise, Robert R.; Stanfill, S. Robert; Friedman, Jerome; Popescu, Bogdan; Chen, Jihong; Mahalanobis, Abhijit; Donoho, David L.

2003-09-01

In target recognition applications of discriminant of classification analysis, each 'feature' is a result of a convolution of an imagery with a filter, which may be derived from a feature vector. It is important to use relatively few features. We analyze an optimal reduced-rank classifier under the two-class situation. Assuming each population is Gaussian and has zero mean, and the classes differ through the covariance matrices: ∑1 and ∑2. The following matrix is considered: Λ=(∑1+∑2)-1/2∑1(∑1+∑2)-1/2. We show that the k eigenvectors of this matrix whose eigenvalues are most different from 1/2 offer the best rank k approximation to the maximum likelihood classifier. The matrix Λ and its eigenvectors have been introduced by Fukunaga and Koontz; hence this analysis gives a new interpretation of the well known Fukunaga-Koontz transform. The optimality that is promised in this method hold if the two populations are exactly Guassian with the same means. To check the applicability of this approach to real data, an experiment is performed, in which several 'modern' classifiers were used on an Infrared ATR data. In these experiments, a reduced-rank classifier-Tuned Basis Functions-outperforms others. The competitive performance of the optimal reduced-rank quadratic classifier suggests that, at least for classification purposes, the imagery data behaves in a nearly-Gaussian fashion.

Consensus Algorithms for Networks of Systems with Second- and Higher-Order Dynamics

NASA Astrophysics Data System (ADS)

Fruhnert, Michael

This thesis considers homogeneous networks of linear systems. We consider linear feedback controllers and require that the directed graph associated with the network contains a spanning tree and systems are stabilizable. We show that, in continuous-time, consensus with a guaranteed rate of convergence can always be achieved using linear state feedback. For networks of continuous-time second-order systems, we provide a new and simple derivation of the conditions for a second-order polynomials with complex coefficients to be Hurwitz. We apply this result to obtain necessary and sufficient conditions to achieve consensus with networks whose graph Laplacian matrix may have complex eigenvalues. Based on the conditions found, methods to compute feedback gains are proposed. We show that gains can be chosen such that consensus is achieved robustly over a variety of communication structures and system dynamics. We also consider the use of static output feedback. For networks of discrete-time second-order systems, we provide a new and simple derivation of the conditions for a second-order polynomials with complex coefficients to be Schur. We apply this result to obtain necessary and sufficient conditions to achieve consensus with networks whose graph Laplacian matrix may have complex eigenvalues. We show that consensus can always be achieved for marginally stable systems and discretized systems. Simple conditions for consensus achieving controllers are obtained when the Laplacian eigenvalues are all real. For networks of continuous-time time-variant higher-order systems, we show that uniform consensus can always be achieved if systems are quadratically stabilizable. In this case, we provide a simple condition to obtain a linear feedback control. For networks of discrete-time higher-order systems, we show that constant gains can be chosen such that consensus is achieved for a variety of network topologies. First, we develop simple results for networks of time-invariant systems and networks of time-variant systems that are given in controllable canonical form. Second, we formulate the problem in terms of Linear Matrix Inequalities (LMIs). The condition found simplifies the design process and avoids the parallel solution of multiple LMIs. The result yields a modified Algebraic Riccati Equation (ARE) for which we present an equivalent LMI condition.

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.

Control design for future agile fighters

NASA Technical Reports Server (NTRS)

Murphy, Patrick C.; Davidson, John B.

1991-01-01

The CRAFT control design methodology is presented. CRAFT stands for the design objectives addressed, namely, Control power, Robustness, Agility, and Flying Qualities Tradeoffs. The approach combines eigenspace assignment, which allows for direct specification of eigenvalues and eigenvectors, and a graphical approach for representing control design metrics that captures numerous design goals in one composite illustration. The methodology makes use of control design metrics from four design objective areas, namely, control power, robustness, agility, and flying qualities. An example of the CRAFT methodology as well as associated design issues are presented.

Effects of supplementation with green tea by-products on growth performance, meat quality, blood metabolites and immune cell proliferation in goats.

PubMed

Ahmed, S T; Lee, J-W; Mun, H-S; Yang, C-J

2015-12-01

Forty-eight castrated male goats were used to determine the effects of feeding green tea by-products (GTB) on growth performance, meat quality, blood metabolites and immune cell proliferation. Experimental treatments consisted of basal diets supplemented with four levels of GTB (0%, 0.5%, 1.0% or 2.0%). Four replicate pens were assigned to each treatment with three goats per replicate. Increasing dietary GTB tended to linearly increase the overall average weight gain and feed intake (p = 0.09). Water holding capacity, pH and sensory attributes of meat were not affected by GTB supplementation, while cooking loss was reduced both linearly and quadratically (p < 0.01). The redness (linear; p = 0.02, quadratic; p < 0.01) and yellowness (quadratic; p < 0.01) values of goat meat were improved by GTB supplementation. Increasing dietary GTB quadratically increased protein and decreased crude fat (p < 0.05), while linearly decreased cholesterol (p = 0.03) content of goat meat. The proportions of monounsaturated fatty acid, polyunsaturated fatty acid (PUFA) and n-6 PUFA increased linearly (p < 0.01) and n-3 PUFA increased quadratically (p < 0.05) as GTB increased in diets. Increasing dietary GTB linearly increased the PUFA/SFA (saturated fatty acid) and tended to linearly and quadratically increase (p ≤ 0.10) the n-6/n-3 ratio. The thiobarbituric acid-reactive substances values of meat were lower in the 2.0% GTB-supplemented group in all storage periods (p < 0.05). Dietary GTB linearly decreased plasma glucose and cholesterol (p < 0.01) and quadratically decreased urea nitrogen concentrations (p = 0.001). The growth of spleen cells incubated in concanavalin A and lipopolysaccharides medium increased significantly (p < 0.05) in response to GTB supplementation. Our results suggest that GTB may positively affect the growth performance, meat quality, blood metabolites and immune cell proliferation when supplemented as a feed additive in goat diet. Journal of Animal Physiology and Animal Nutrition © 2014 Blackwell Verlag GmbH.

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.

On the modular structure of the genus-one Type II superstring low energy expansion

NASA Astrophysics Data System (ADS)

D'Hoker, Eric; Green, Michael B.; Vanhove, Pierre

2015-08-01

The analytic contribution to the low energy expansion of Type II string amplitudes at genus-one is a power series in space-time derivatives with coefficients that are determined by integrals of modular functions over the complex structure modulus of the world-sheet torus. These modular functions are associated with world-sheet vacuum Feynman diagrams and given by multiple sums over the discrete momenta on the torus. In this paper we exhibit exact differential and algebraic relations for a certain infinite class of such modular functions by showing that they satisfy Laplace eigenvalue equations with inhomogeneous terms that are polynomial in non-holomorphic Eisenstein series. Furthermore, we argue that the set of modular functions that contribute to the coefficients of interactions up to order are linear sums of functions in this class and quadratic polynomials in Eisenstein series and odd Riemann zeta values. Integration over the complex structure results in coefficients of the low energy expansion that are rational numbers multiplying monomials in odd Riemann zeta values.

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.

Spectral statistics and scattering resonances of complex primes arrays

NASA Astrophysics Data System (ADS)

Wang, Ren; Pinheiro, Felipe A.; Dal Negro, Luca

2018-01-01

We introduce a class of aperiodic arrays of electric dipoles generated from the distribution of prime numbers in complex quadratic fields (Eisenstein and Gaussian primes) as well as quaternion primes (Hurwitz and Lifschitz primes), and study the nature of their scattering resonances using the vectorial Green's matrix method. In these systems we demonstrate several distinctive spectral properties, such as the absence of level repulsion in the strongly scattering regime, critical statistics of level spacings, and the existence of critical modes, which are extended fractal modes with long lifetimes not supported by either random or periodic systems. Moreover, we show that one can predict important physical properties, such as the existence spectral gaps, by analyzing the eigenvalue distribution of the Green's matrix of the arrays in the complex plane. Our results unveil the importance of aperiodic correlations in prime number arrays for the engineering of gapped photonic media that support far richer mode localization and spectral properties compared to usual periodic and random media.

Optimal control of coupled parabolic-hyperbolic non-autonomous PDEs: infinite-dimensional state-space approach

NASA Astrophysics Data System (ADS)

Aksikas, I.; Moghadam, A. Alizadeh; Forbes, J. F.

2018-04-01

This paper deals with the design of an optimal state-feedback linear-quadratic (LQ) controller for a system of coupled parabolic-hypebolic non-autonomous partial differential equations (PDEs). The infinite-dimensional state space representation and the corresponding operator Riccati differential equation are used to solve the control problem. Dynamical properties of the coupled system of interest are analysed to guarantee the existence and uniqueness of the solution of the LQ-optimal control problem and also to guarantee the exponential stability of the closed-loop system. Thanks to the eigenvalues and eigenfunctions of the parabolic operator and also the fact that the hyperbolic-associated operator Riccati differential equation can be converted to a scalar Riccati PDE, an algorithm to solve the LQ control problem has been presented. The results are applied to a non-isothermal packed-bed catalytic reactor. The LQ optimal controller designed in the early portion of the paper is implemented for the original non-linear model. Numerical simulations are performed to show the controller performances.

Effects of dietary supplementation with alkyl polyglycoside, a nonionic surfactant, on nutrient digestion and ruminal fermentation in goats.

PubMed

Yuan, Z Q; Tang, S X; Zeng, B; Wang, M; Tan, Z L; Sun, Z H; Zhou, C S; Han, X F; Bamikole, M A

2010-12-01

The effects of dietary alkyl polyglycoside [APG, a nonionic surfactant (NIS), derived from a reaction of corn starch glucose and a natural fatty alcohol] inclusion on digestion of nutrients and ruminal fermentation in goats were examined in a 4 × 4 Latin square design using 4 ruminally and duodenally cannulated wethers (mean BW: 19.5 ± 0.8 kg). The animals were assigned to 4 dietary treatments of APG supplementation at 0, 3, 6, and 12 g/kg of DM diets and were designated as control, APG3, APG6, and APG12, respectively. The results showed that dietary APG inclusion tended to increase the intestinal digestibility of OM (linear, P = 0.09) and NDF (linear, P = 0.1), and quadratically increased (P ≤ 0.02) total tract digestibility of OM and NDF, the duodenal microbial N flow, and efficiency of microbial protein synthesis. The true ruminal digestibility and apparent total tract digestibility of N quadratically increased (P < 0.01) with increasing dietary APG. The ruminal pH values were not affected by dietary APG inclusion (P > 0.05), but the concentration of NH(3)-N (P < 0.01) and total VFA (linear and quadratic, P < 0.01) increased in the rumen fluid. Dietary APG inclusion also increased the activities of ruminal carboxymethyl cellulase (quadratic, P < 0.01) and xylanase (linear and quadratic, P < 0.01). It is concluded that APG is a potential feed additive that can be used in ruminant production; 6 g/kg in the total mixed rations for goats is recommended. It is necessary to validate the effectiveness of dietary APG inclusion in ruminant diets with more animals in further studies.

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.

Neural Meta-Memes Framework for Combinatorial Optimization

NASA Astrophysics Data System (ADS)

Song, Li Qin; Lim, Meng Hiot; Ong, Yew Soon

In this paper, we present a Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF is a framework which models basic optimization algorithms as memes and manages them dynamically when solving combinatorial problems. NMMF encompasses neural networks which serve as the overall planner/coordinator to balance the workload between memes. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial problem, the quadratic assignment problem (QAP).

A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems.

PubMed

Horio, Yoshihiko; Ikeguchi, Tohru; Aihara, Kazuyuki

2005-01-01

We construct a mixed analog/digital chaotic neuro-computer prototype system for quadratic assignment problems (QAPs). The QAP is one of the difficult NP-hard problems, and includes several real-world applications. Chaotic neural networks have been used to solve combinatorial optimization problems through chaotic search dynamics, which efficiently searches optimal or near optimal solutions. However, preliminary experiments have shown that, although it obtained good feasible solutions, the Hopfield-type chaotic neuro-computer hardware system could not obtain the optimal solution of the QAP. Therefore, in the present study, we improve the system performance by adopting a solution construction method, which constructs a feasible solution using the analog internal state values of the chaotic neurons at each iteration. In order to include the construction method into our hardware, we install a multi-channel analog-to-digital conversion system to observe the internal states of the chaotic neurons. We show experimentally that a great improvement in the system performance over the original Hopfield-type chaotic neuro-computer is obtained. That is, we obtain the optimal solution for the size-10 QAP in less than 1000 iterations. In addition, we propose a guideline for parameter tuning of the chaotic neuro-computer system according to the observation of the internal states of several chaotic neurons in the network.

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.

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.

Quadratically Convergent Method for Simultaneously Approaching the Roots of Polynomial Solutions of a Class of Differential Equations

NASA Astrophysics Data System (ADS)

Recchioni, Maria Cristina

2001-12-01

This paper investigates the application of the method introduced by L. Pasquini (1989) for simultaneously approaching the zeros of polynomial solutions to a class of second-order linear homogeneous ordinary differential equations with polynomial coefficients to a particular case in which these polynomial solutions have zeros symmetrically arranged with respect to the origin. The method is based on a family of nonlinear equations which is associated with a given class of differential equations. The roots of the nonlinear equations are related to the roots of the polynomial solutions of differential equations considered. Newton's method is applied to find the roots of these nonlinear equations. In (Pasquini, 1994) the nonsingularity of the roots of these nonlinear equations is studied. In this paper, following the lines in (Pasquini, 1994), the nonsingularity of the roots of these nonlinear equations is studied. More favourable results than the ones in (Pasquini, 1994) are proven in the particular case of polynomial solutions with symmetrical zeros. The method is applied to approximate the roots of Hermite-Sobolev type polynomials and Freud polynomials. A lower bound for the smallest positive root of Hermite-Sobolev type polynomials is given via the nonlinear equation. The quadratic convergence of the method is proven. A comparison with a classical method that uses the Jacobi matrices is carried out. We show that the algorithm derived by the proposed method is sometimes preferable to the classical QR type algorithms for computing the eigenvalues of the Jacobi matrices even if these matrices are real and symmetric.

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.

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.

Investigations into the shape-preserving interpolants using symbolic computation

NASA Technical Reports Server (NTRS)

Lam, Maria

1988-01-01

Shape representation is a central issue in computer graphics and computer-aided geometric design. Many physical phenomena involve curves and surfaces that are monotone (in some directions) or are convex. The corresponding representation problem is given some monotone or convex data, and a monotone or convex interpolant is found. Standard interpolants need not be monotone or convex even though they may match monotone or convex data. Most of the methods of investigation of this problem involve the utilization of quadratic splines or Hermite polynomials. In this investigation, a similar approach is adopted. These methods require derivative information at the given data points. The key to the problem is the selection of the derivative values to be assigned to the given data points. Schemes for choosing derivatives were examined. Along the way, fitting given data points by a conic section has also been investigated as part of the effort to study shape-preserving quadratic splines.

Jet cooled cavity ringdown spectroscopy of the A ˜ 2 E ″ ← X ˜ 2 A2 ' transition of the NO3 radical

NASA Astrophysics Data System (ADS)

Codd, Terrance; Chen, Ming-Wei; Roudjane, Mourad; Stanton, John F.; Miller, Terry A.

2015-05-01

The A ˜ 2 E ″ ← X ˜ 2 A2 ' spectrum of NO3 radical from 7550 cm-1 to 9750 cm-1 has been recorded and analyzed. Our spectrum differs from previously recorded spectra of this transition due to jet-cooling, which narrows the rotational contours and eliminates spectral interference from hot bands. Assignments of numerous vibronic features can be made based on both band contour and position including the previously unassigned 30 1 band and several associated combination bands. We have analyzed our spectrum first with an independent anharmonic oscillator model and then by a quadratic Jahn-Teller vibronic coupling model. The fit achieved with the quadratic Jahn-Teller model is excellent, but the potential energy surface obtained with the fitted parameters is in only qualitative agreement with one obtained from ab initio calculations.

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.

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

The Geometry of Quadratic Polynomial Differential Systems with a Finite and an Infinite Saddle-Node (C)

NASA Astrophysics Data System (ADS)

Artés, Joan C.; Rezende, Alex C.; Oliveira, Regilene D. S.

Planar quadratic differential systems occur in many areas of applied mathematics. Although more than one thousand papers have been written on these systems, a complete understanding of this family is still missing. Classical problems, and in particular, Hilbert's 16th problem [Hilbert, 1900, 1902], are still open for this family. Our goal is to make a global study of the family QsnSN of all real quadratic polynomial differential systems which have a finite semi-elemental saddle-node and an infinite saddle-node formed by the collision of two infinite singular points. This family can be divided into three different subfamilies, all of them with the finite saddle-node in the origin of the plane with the eigenvectors on the axes and with the eigenvector associated with the zero eigenvalue on the horizontal axis and (A) with the infinite saddle-node in the horizontal axis, (B) with the infinite saddle-node in the vertical axis and (C) with the infinite saddle-node in the bisector of the first and third quadrants. These three subfamilies modulo the action of the affine group and time homotheties are three-dimensional and we give the bifurcation diagram of their closure with respect to specific normal forms, in the three-dimensional real projective space. The subfamilies (A) and (B) have already been studied [Artés et al., 2013b] and in this paper we provide the complete study of the geometry of the last family (C). The bifurcation diagram for the subfamily (C) yields 371 topologically distinct phase portraits with and without limit cycles for systems in the closure /line{QsnSN(C)} within the representatives of QsnSN(C) given by a chosen normal form. Algebraic invariants are used to construct the bifurcation set. The phase portraits are represented on the Poincaré disk. The bifurcation set of /line{QsnSN(C)} is not only algebraic due to the presence of some surfaces found numerically. All points in these surfaces correspond to either connections of separatrices, or the presence of a double limit cycle.

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.

Method of locating related items in a geometric space for data mining

DOEpatents

Hendrickson, B.A.

1999-07-27

A method for locating related items in a geometric space transforms relationships among items to geometric locations. The method locates items in the geometric space so that the distance between items corresponds to the degree of relatedness. The method facilitates communication of the structure of the relationships among the items. The method is especially beneficial for communicating databases with many items, and with non-regular relationship patterns. Examples of such databases include databases containing items such as scientific papers or patents, related by citations or keywords. A computer system adapted for practice of the present invention can include a processor, a storage subsystem, a display device, and computer software to direct the location and display of the entities. The method comprises assigning numeric values as a measure of similarity between each pairing of items. A matrix is constructed, based on the numeric values. The eigenvectors and eigenvalues of the matrix are determined. Each item is located in the geometric space at coordinates determined from the eigenvectors and eigenvalues. Proper construction of the matrix and proper determination of coordinates from eigenvectors can ensure that distance between items in the geometric space is representative of the numeric value measure of the items' similarity. 12 figs.

Method of locating related items in a geometric space for data mining

DOEpatents

Hendrickson, Bruce A.

1999-01-01

A method for locating related items in a geometric space transforms relationships among items to geometric locations. The method locates items in the geometric space so that the distance between items corresponds to the degree of relatedness. The method facilitates communication of the structure of the relationships among the items. The method is especially beneficial for communicating databases with many items, and with non-regular relationship patterns. Examples of such databases include databases containing items such as scientific papers or patents, related by citations or keywords. A computer system adapted for practice of the present invention can include a processor, a storage subsystem, a display device, and computer software to direct the location and display of the entities. The method comprises assigning numeric values as a measure of similarity between each pairing of items. A matrix is constructed, based on the numeric values. The eigenvectors and eigenvalues of the matrix are determined. Each item is located in the geometric space at coordinates determined from the eigenvectors and eigenvalues. Proper construction of the matrix and proper determination of coordinates from eigenvectors can ensure that distance between items in the geometric space is representative of the numeric value measure of the items' similarity.

Eigenvalue assignment strategies in rotor systems

NASA Technical Reports Server (NTRS)

Youngblood, J. N.; Welzyn, K. J.

1986-01-01

The work done to establish the control and direction of effective eigenvalue excursions of lightly damped, speed dependent rotor systems using passive control is discussed. Both second order and sixth order bi-axis, quasi-linear, speed dependent generic models were investigated. In every case a single, bi-directional control bearing was used in a passive feedback stabilization loop to resist modal destabilization above the rotor critical speed. Assuming incomplete state measurement, sub-optimal control strategies were used to define the preferred location of the control bearing, the most effective measurement locations, and the best set of control gains to extend the speed range of stable operation. Speed dependent control gains were found by Powell's method to maximize the minimum modal damping ratio for the speed dependent linear model. An increase of 300 percent in stable speed operation was obtained for the sixth order linear system using passive control. Simulations were run to examine the effectiveness of the linear control law on nonlinear rotor models with bearing deadband. The maximum level of control effort (force) required by the control bearing to stabilize the rotor at speeds above the critical was determined for the models with bearing deadband.

Asymptotic sideslip angle and yaw rate decoupling control in four-wheel steering vehicles

NASA Astrophysics Data System (ADS)

Marino, Riccardo; Scalzi, Stefano

2010-09-01

This paper shows that, for a four-wheel steering vehicle, a proportional-integral (PI) active front steering control and a PI active rear steering control from the yaw rate error together with an additive feedforward reference signal for the vehicle sideslip angle can asymptotically decouple the lateral velocity and the yaw rate dynamics; that is the control can set arbitrary steady state values for lateral speed and yaw rate at any longitudinal speed. Moreover, the PI controls can suppress oscillatory behaviours by assigning real stable eigenvalues to a widely used linearised model of the vehicle steering dynamics for any value of longitudinal speed in understeering vehicles. In particular, the four PI control parameters are explicitly expressed in terms of the three real eigenvalues to be assigned. No lateral acceleration and no lateral speed measurements are required. The controlled system maintains the well-known advantages of both front and rear active steering controls: higher controllability, enlarged bandwidth for the yaw rate dynamics, suppressed resonances, new stable cornering manoeuvres and improved manoeuvrability. In particular, zero lateral speed may be asymptotically achieved while controlling the yaw rate: in this case comfort is improved since the phase lag between lateral acceleration and yaw rate is reduced. Also zero yaw rate can be asymptotically achieved: in this case additional stable manoeuvres are obtained in obstacle avoidance. Several simulations, including step references and moose tests, are carried out on a standard small SUV CarSim model to explore the robustness with respect to unmodelled effects such as combined lateral and longitudinal tyre forces, pitch, roll and driver dynamics. The simulations confirm the decoupling between the lateral velocity and the yaw rate and show the advantages obtained by the proposed control: reduced lateral speed or reduced yaw rate, suppressed oscillations and new stable manoeuvres.

Optimization of Heterogeneous UAV Communications Using the Multiobjective Quadratic Assignment Problem

DTIC Science & Technology

2004-03-01

definition efficiency is the amount of the time that the processing element is gainfully employed , which is calculated by using the ratio of the... employs an interest- ing form of tournament selection called Pareto domination tournaments. Two members of the population are chosen at random and they...it has a set of solutions and using a template for each solution is not feasible. So the MOMGA employs a different competitive template during the

Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.

PubMed

Ceberio, Josu; Calvo, Borja; Mendiburu, Alexander; Lozano, Jose A

2018-02-15

In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. In this sense, a number of papers have proposed multi-objectivising single-objective problems in order to use multi-objective algorithms in their optimisation. In this article, we follow up this idea by presenting a methodology for multi-objectivising combinatorial optimisation problems based on elementary landscape decompositions of their objective function. Under this framework, each of the elementary landscapes obtained from the decomposition is considered as an independent objective function to optimise. In order to illustrate this general methodology, we consider four problems from different domains: the quadratic assignment problem and the linear ordering problem (permutation domain), the 0-1 unconstrained quadratic optimisation problem (binary domain), and the frequency assignment problem (integer domain). We implemented two widely known multi-objective algorithms, NSGA-II and SPEA2, and compared their performance with that of a single-objective GA. The experiments conducted on a large benchmark of instances of the four problems show that the multi-objective algorithms clearly outperform the single-objective approaches. Furthermore, a discussion on the results suggests that the multi-objective space generated by this decomposition enhances the exploration ability, thus permitting NSGA-II and SPEA2 to obtain better results in the majority of the tested instances.

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.

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.

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.

Topology optimization of embedded piezoelectric actuators considering control spillover effects

NASA Astrophysics Data System (ADS)

Gonçalves, Juliano F.; De Leon, Daniel M.; Perondi, Eduardo A.

2017-02-01

This article addresses the problem of active structural vibration control by means of embedded piezoelectric actuators. The topology optimization method using the solid isotropic material with penalization (SIMP) approach is employed in this work to find the optimum design of actuators taken into account the control spillover effects. A coupled finite element model of the structure is derived assuming a two-phase material and this structural model is written into the state-space representation. The proposed optimization formulation aims to determine the distribution of piezoelectric material which maximizes the controllability for a given vibration mode. The undesirable effects of the feedback control on the residual modes are limited by including a spillover constraint term containing the residual controllability Gramian eigenvalues. The optimization of the shape and placement of the conventionally embedded piezoelectric actuators are performed using a Sequential Linear Programming (SLP) algorithm. Numerical examples are presented considering the control of the bending vibration modes for a cantilever and a fixed beam. A Linear-Quadratic Regulator (LQR) is synthesized for each case of controlled structure in order to compare the influence of the additional constraint.

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.

Dynamics of f(R) gravity models and asymmetry of time

NASA Astrophysics Data System (ADS)

Verma, Murli Manohar; Yadav, Bal Krishna

We solve the field equations of modified gravity for f(R) model in metric formalism. Further, we obtain the fixed points of the dynamical system in phase-space analysis of f(R) models, both with and without the effects of radiation. The stability of these points is studied against the perturbations in a smooth spatial background by applying the conditions on the eigenvalues of the matrix obtained in the linearized first-order differential equations. Following this, these fixed points are used for analyzing the dynamics of the system during the radiation, matter and acceleration-dominated phases of the universe. Certain linear and quadratic forms of f(R) are determined from the geometrical and physical considerations and the behavior of the scale factor is found for those forms. Further, we also determine the Hubble parameter H(t), the Ricci scalar R and the scale factor a(t) for these cosmic phases. We show the emergence of an asymmetry of time from the dynamics of the scalar field exclusively owing to the f(R) gravity in the Einstein frame that may lead to an arrow of time at a classical level.

Approximate analytical relationships for linear optimal aeroelastic flight control laws

NASA Astrophysics Data System (ADS)

Kassem, Ayman Hamdy

1998-09-01

This dissertation introduces new methods to uncover functional relationships between design parameters of a contemporary control design technique and the resulting closed-loop properties. Three new methods are developed for generating such relationships through analytical expressions: the Direct Eigen-Based Technique, the Order of Magnitude Technique, and the Cost Function Imbedding Technique. Efforts concentrated on the linear-quadratic state-feedback control-design technique applied to an aeroelastic flight control task. For this specific application, simple and accurate analytical expressions for the closed-loop eigenvalues and zeros in terms of basic parameters such as stability and control derivatives, structural vibration damping and natural frequency, and cost function weights are generated. These expressions explicitly indicate how the weights augment the short period and aeroelastic modes, as well as the closed-loop zeros, and by what physical mechanism. The analytical expressions are used to address topics such as damping, nonminimum phase behavior, stability, and performance with robustness considerations, and design modifications. This type of knowledge is invaluable to the flight control designer and would be more difficult to formulate when obtained from numerical-based sensitivity analysis.

Large planar maneuvers for articulated flexible manipulators

NASA Technical Reports Server (NTRS)

Huang, Jen-Kuang; Yang, Li-Farn

1988-01-01

An articulated flexible manipulator carried on a translational cart is maneuvered by an active controller to perform certain position control tasks. The nonlinear dynamics of the articulated flexible manipulator are derived and a transformation matrix is formulated to localize the nonlinearities within the inertia matrix. Then a feedback linearization scheme is introduced to linearize the dynamic equations for controller design. Through a pole placement technique, a robust controller design is obtained by properly assigning a set of closed-loop desired eigenvalues to meet performance requirements. Numerical simulations for the articulated flexible manipulators are given to demonstrate the feasibility and effectiveness of the proposed position control algorithms.

Robust Assignment Of Eigensystems For Flexible Structures

NASA Technical Reports Server (NTRS)

Juang, Jer-Nan; Lim, Kyong B.; Junkins, John L.

1992-01-01

Improved method for placement of eigenvalues and eigenvectors of closed-loop control system by use of either state or output feedback. Applied to reduced-order finite-element mathematical model of NASA's MAST truss beam structure. Model represents deployer/retractor assembly, inertial properties of Space Shuttle, and rigid platforms for allocation of sensors and actuators. Algorithm formulated in real arithmetic for efficient implementation. Choice of open-loop eigenvector matrix and its closest unitary matrix believed suitable for generating well-conditioned eigensystem with small control gains. Implication of this approach is that element of iterative search for "optimal" unitary matrix appears unnecessary in practice for many test problems.

Factor Analytic Approach to Transitive Text Mining using Medline Descriptors

NASA Astrophysics Data System (ADS)

Stegmann, J.; Grohmann, G.

Matrix decomposition methods were applied to examples of noninteractive literature sets sharing implicit relations. Document-by-term matrices were created from downloaded PubMed literature sets, the terms being the Medical Subject Headings (MeSH descriptors) assigned to the documents. The loadings of the factors derived from singular value or eigenvalue matrix decomposition were sorted according to absolute values and subsequently inspected for positions of terms relevant to the discovery of hidden connections. It was found that only a small number of factors had to be screened to find key terms in close neighbourhood, being separated by a small number of terms only.

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.

New sets of eigenvalues in inverse scattering for inhomogeneous media and their determination from scattering data

NASA Astrophysics Data System (ADS)

Audibert, Lorenzo; Cakoni, Fioralba; Haddar, Houssem

2017-12-01

In this paper we develop a general mathematical framework to determine interior eigenvalues from a knowledge of the modified far field operator associated with an unknown (anisotropic) inhomogeneity. The modified far field operator is obtained by subtracting from the measured far field operator the computed far field operator corresponding to a well-posed scattering problem depending on one (possibly complex) parameter. Injectivity of this modified far field operator is related to an appropriate eigenvalue problem whose eigenvalues can be determined from the scattering data, and thus can be used to obtain information about material properties of the unknown inhomogeneity. We discuss here two examples of such modification leading to a Steklov eigenvalue problem, and a new type of the transmission eigenvalue problem. We present some numerical examples demonstrating the viability of our method for determining the interior eigenvalues form far field data.

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

Covariance expressions for eigenvalue and eigenvector problems

NASA Astrophysics Data System (ADS)

Liounis, Andrew J.

There are a number of important scientific and engineering problems whose solutions take the form of an eigenvalue--eigenvector problem. Some notable examples include solutions to linear systems of ordinary differential equations, controllability of linear systems, finite element analysis, chemical kinetics, fitting ellipses to noisy data, and optimal estimation of attitude from unit vectors. In many of these problems, having knowledge of the eigenvalue and eigenvector Jacobians is either necessary or is nearly as important as having the solution itself. For instance, Jacobians are necessary to find the uncertainty in a computed eigenvalue or eigenvector estimate. This uncertainty, which is usually represented as a covariance matrix, has been well studied for problems similar to the eigenvalue and eigenvector problem, such as singular value decomposition. There has been substantially less research on the covariance of an optimal estimate originating from an eigenvalue-eigenvector problem. In this thesis we develop two general expressions for the Jacobians of eigenvalues and eigenvectors with respect to the elements of their parent matrix. The expressions developed make use of only the parent matrix and the eigenvalue and eigenvector pair under consideration. In addition, they are applicable to any general matrix (including complex valued matrices, eigenvalues, and eigenvectors) as long as the eigenvalues are simple. Alongside this, we develop expressions that determine the uncertainty in a vector estimate obtained from an eigenvalue-eigenvector problem given the uncertainty of the terms of the matrix. The Jacobian expressions developed are numerically validated with forward finite, differencing and the covariance expressions are validated using Monte Carlo analysis. Finally, the results from this work are used to determine covariance expressions for a variety of estimation problem examples and are also applied to the design of a dynamical system.

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.

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.

Effect of stocking density on performance, diet selection, total-tract digestion, and nitrogen balance among heifers grazing cool-season annual forages.

PubMed

Brunsvig, B R; Smart, A J; Bailey, E A; Wright, C L; Grings, E E; Brake, D W

2017-08-01

Grazing annual cool-season forages after oat grain harvest in South Dakota may allow an opportunity to increase efficient use of tillable land. However, data are limited regarding effects of stocking density on diet selection, nutrient digestion, performance, and N retention by cattle grazing annual cool-season forage. Heifers were blocked by initial BW (261 ± 11.7 kg) and randomly assigned to 1 of 12 paddocks (1.1 ha) to graze a mixture of grass and brassica for 48 d. Each paddock contained 3, 4, or 5 heifers to achieve 4 replicates of each stocking density treatment. Ruminally cannulated heifers were used to measure diet and nutrient intake. Effects of stocking density on diet and nutrient selection were measured after 2, 24, and 46 d of grazing, and BW was measured at the beginning, middle, and end of the experiment as the average of d 1 and 2, d 22 and 23, and d 47 and 48 BW, respectively. Measures of DMI and DM, OM, NDF, and ADF digestion were collected from d 18 to 23. Increased stocking density increased intake of brassica relative to grass on d 24 (quadratic, = 0.02), but increased stocking density decreased (linear, ≤ 0.01) intake of brassica compared with grass on d 48 (stocking density × time, < 0.01). Increased stocking density increased DM (quadratic, < 0.01), OM (quadratic, = 0.01), and NDF (quadratic, = 0.05) digestion, and stocking density tended to increase DMI (quadratic, = 0.07). Additionally, increased stocking density quadratically increased ( = 0.05) N retention but did not affect overall BW gains. Increased stocking density did, however, contribute to linearly decreased ( = 0.05) BW gains from d 1 to 22 of grazing, but BW gains during the latter half of the experiment were greater than BW gains from d 1 to 22. Ruminal concentration of acetate:propionate was least on d 24 of grazing, and ruminal nitrate concentration tended to linearly decrease ( = 0.06) with greater amounts of time on pasture. Ruminal liquid and particulate fill and amounts of VFA were less (quadratic, ≤ 0.01) with greater amounts of time on pasture. Apparently, binary mixtures of brassica and grass planted after oat grain harvest can provide an opportunity to increase efficient use of land by providing forage resources. Increased stocking density may facilitate a more rapid adaptation to and intake of brassica among cattle grazing brassica-grass-based pastures.

Spectroscopic and Magnetic Investigations of Rhenium(i)chlorine(carbon MONOXIDE)(3)(ALPHA, - Complexes and Group (1B, 8B) Bimetallic Complexes.

NASA Astrophysics Data System (ADS)

Striplin, Durwin Ray

Complexes with the generic formula, Re(I)Cl(CO) _3(alpha,alpha-diimine), where alpha,alpha-diimine = 2,2^'-bipyridine, 1,10 -phenanthroline, or methyl-substituted analogs, were subjected to detailed optical investigations in the 77-4 K range, both in rigid glasses and in PMMA plastics. Excitation spectra, absorption spectra, and decay kinetics of the phosphorescing manifolds were complemented by detailed measurements of polarization ratios to arrive at a coherent picture of the emitting manifolds. Symmetry assignments and energy orderings of the ^3MLCT (metal-to-ligand charge transfer) spin sublevels were made. Analogous assignments for the ^3MLCT spin -sublevels of Ru(alpha, alpha -diimine)_3^{2+} and Os(alpha,alpha-diimine) _{3}^{2+} ions are implied by this analysis. Increases in luminescence decay rates and emission intensities with increasing external magnetic field strength were observed at 4 K. The decay rates were found to be non-quadratic with respect to magnetic field strength. A simple parametric model that includes spin-orbit coupling and a magnetic field perturbation was developed to describe the MLCT excited states. The energies, symmetry assignments, and magnetic field mixing of the ^3MLCT states were rationalized by the model. Fluorescence, phosphorescence, and excitation spectra were measured on a series of mu -bridged bis(diphenylphosphinomethane) homo- and heterobimetallic compounds of Rh(I), Ir(I), Pt(II), and Au(I). These results were augmented with polarization ratios obtained at 77 K and detailed studies of the temperature dependence of the phosphorescence in the 77-4 K range. The triplet manifold is split by spin-orbit coupling into a forbidden state lying lowest in energy followed by a quasi-degenerate pair lying a few wavenumbers higher that decays two orders of magnitude faster. A quadratic dependence of the decay rate on magnetic field strength was recorded at 4 K for ail complexes. The results are consistent with a rm d_{sigma*}to p_sigma orbital promotion, and the direction of charge-transfer for heterobimetallic complexes was unambiguously assigned. Electronic structural models based on D_{rm 4h}, D_{rm 2h}, and C _{rm 2v} micro-symmetries about the axial chromophore were employed to make explicit symmetry assignments of the excited states.

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"-…

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.

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.

Using ant colony optimization on the quadratic assignment problem to achieve low energy cost in geo-distributed data centers

NASA Astrophysics Data System (ADS)

Osei, Richard

There are many problems associated with operating a data center. Some of these problems include data security, system performance, increasing infrastructure complexity, increasing storage utilization, keeping up with data growth, and increasing energy costs. Energy cost differs by location, and at most locations fluctuates over time. The rising cost of energy makes it harder for data centers to function properly and provide a good quality of service. With reduced energy cost, data centers will have longer lasting servers/equipment, higher availability of resources, better quality of service, a greener environment, and reduced service and software costs for consumers. Some of the ways that data centers have tried to using to reduce energy costs include dynamically switching on and off servers based on the number of users and some predefined conditions, the use of environmental monitoring sensors, and the use of dynamic voltage and frequency scaling (DVFS), which enables processors to run at different combinations of frequencies with voltages to reduce energy cost. This thesis presents another method by which energy cost at data centers could be reduced. This method involves the use of Ant Colony Optimization (ACO) on a Quadratic Assignment Problem (QAP) in assigning user request to servers in geo-distributed data centers. In this paper, an effort to reduce data center energy cost involves the use of front portals, which handle users' requests, were used as ants to find cost effective ways to assign users requests to a server in heterogeneous geo-distributed data centers. The simulation results indicate that the ACO for Optimal Server Activation and Task Placement algorithm reduces energy cost on a small and large number of users' requests in a geo-distributed data center and its performance increases as the input data grows. In a simulation with 3 geo-distributed data centers, and user's resource request ranging from 25,000 to 25,000,000, the ACO algorithm was able to reduce energy cost on an average of $.70 per second. The ACO for Optimal Server Activation and Task Placement algorithm has proven to work as an alternative or improvement in reducing energy cost in geo-distributed data centers.

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.

A numerical projection technique for large-scale eigenvalue problems

NASA Astrophysics Data System (ADS)

Gamillscheg, Ralf; Haase, Gundolf; von der Linden, Wolfgang

2011-10-01

We present a new numerical technique to solve large-scale eigenvalue problems. It is based on the projection technique, used in strongly correlated quantum many-body systems, where first an effective approximate model of smaller complexity is constructed by projecting out high energy degrees of freedom and in turn solving the resulting model by some standard eigenvalue solver. Here we introduce a generalization of this idea, where both steps are performed numerically and which in contrast to the standard projection technique converges in principle to the exact eigenvalues. This approach is not just applicable to eigenvalue problems encountered in many-body systems but also in other areas of research that result in large-scale eigenvalue problems for matrices which have, roughly speaking, mostly a pronounced dominant diagonal part. We will present detailed studies of the approach guided by two many-body models.

Eigenmode computation of cavities with perturbed geometry using matrix perturbation methods applied on generalized eigenvalue problems

NASA Astrophysics Data System (ADS)

Gorgizadeh, Shahnam; Flisgen, Thomas; van Rienen, Ursula

2018-07-01

Generalized eigenvalue problems are standard problems in computational sciences. They may arise in electromagnetic fields from the discretization of the Helmholtz equation by for example the finite element method (FEM). Geometrical perturbations of the structure under concern lead to a new generalized eigenvalue problems with different system matrices. Geometrical perturbations may arise by manufacturing tolerances, harsh operating conditions or during shape optimization. Directly solving the eigenvalue problem for each perturbation is computationally costly. The perturbed eigenpairs can be approximated using eigenpair derivatives. Two common approaches for the calculation of eigenpair derivatives, namely modal superposition method and direct algebraic methods, are discussed in this paper. Based on the direct algebraic methods an iterative algorithm is developed for efficiently calculating the eigenvalues and eigenvectors of the perturbed geometry from the eigenvalues and eigenvectors of the unperturbed geometry.

AESOP- INTERACTIVE DESIGN OF LINEAR QUADRATIC REGULATORS AND KALMAN FILTERS

NASA Technical Reports Server (NTRS)

Lehtinen, B.

1994-01-01

AESOP was developed to solve a number of problems associated with the design of controls and state estimators for linear time-invariant systems. The systems considered are modeled in state-variable form by a set of linear differential and algebraic equations with constant coefficients. Two key problems solved by AESOP are the linear quadratic regulator (LQR) design problem and the steady-state Kalman filter design problem. AESOP is designed to be used in an interactive manner. The user can solve design problems and analyze the solutions in a single interactive session. Both numerical and graphical information are available to the user during the session. The AESOP program is structured around a list of predefined functions. Each function performs a single computation associated with control, estimation, or system response determination. AESOP contains over sixty functions and permits the easy inclusion of user defined functions. The user accesses these functions either by inputting a list of desired functions in the order they are to be performed, or by specifying a single function to be performed. The latter case is used when the choice of function and function order depends on the results of previous functions. The available AESOP functions are divided into several general areas including: 1) program control, 2) matrix input and revision, 3) matrix formation, 4) open-loop system analysis, 5) frequency response, 6) transient response, 7) transient function zeros, 8) LQR and Kalman filter design, 9) eigenvalues and eigenvectors, 10) covariances, and 11) user-defined functions. The most important functions are those that design linear quadratic regulators and Kalman filters. The user interacts with AESOP when using these functions by inputting design weighting parameters and by viewing displays of designed system response. Support functions obtain system transient and frequency responses, transfer functions, and covariance matrices. AESOP can also provide the user with open-loop system information including stability, controllability, and observability. The AESOP program is written in FORTRAN IV for interactive execution and has been implemented on an IBM 3033 computer using TSS 370. As currently configured, AESOP has a central memory requirement of approximately 2 Megs of 8 bit bytes. Memory requirements can be reduced by redimensioning arrays in the AESOP program. Graphical output requires adaptation of the AESOP plot routines to whatever device is available. The AESOP program was developed in 1984.

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.

Estimation of dietary arginine requirements for Longyan laying ducks.

PubMed

Xia, Weiguang; Fouad, Ahmed Mohamed; Chen, Wei; Ruan, Dong; Wang, Shuang; Fan, Qiuli; Wang, Ying; Cui, Yiyan; Zheng, Chuntian

2017-01-01

This study aimed to establish the arginine requirements of Longyan ducks from 17 to 31 wk of age based on egg production, egg quality, plasma, and ovarian indices, as well as the expression of vitellogenesis-related genes. In total, 660 Longyan ducks with similar body weight at 15 wk of age were assigned randomly to 5 treatments, each with 6 replicates of 22 birds, and fed a corn-corn gluten meal basal diet (0.66% arginine) supplemented with either 0, 0.20%, 0.40%, 0.60%, or 0.80% arginine. Dietary arginine did not affect egg production by laying ducks, but it increased (linear, P < 0.01) the egg weight at 22 to 31 and 17 to 31 wk of age. Dietary arginine increased the yolk color score (linearly, P < 0.05) and the yolk percentage (quadratic, P < 0.05), where the maximum values were obtained with 1.26% arginine. Dietary arginine affected the total shell percentage and shell thickness, with the highest values using 1.46% arginine (P < 0.01). The weight and number of small yellow follicles (SYFs) increased (quadratic, P < 0.05) with the dietary arginine level and there was a quadratic response (P < 0.05) in terms of the SYFs weight/ovarian weight; the highest values were obtained in ducks fed 1.26% arginine. The plasma arginine concentration exhibited a quadratic (P < 0.05) response to dietary arginine. The plasma progesterone concentration decreased (linear, P < 0.05) as dietary arginine increased. The mRNA abundance of the very low density lipoprotein receptor-b increased in the second large yellow follicle membranes (quadratic, P < 0.05) with the dietary arginine level, where the highest value occurred with 1.26% arginine. According to the regression model, the dietary arginine requirements for Longyan laying ducks aged 17 to 31 wk are 1.06%, 1.13%, 1.22%, and 1.11% to obtain the maximum yolk percentage, SYFs number, SYFs weight, and SYFs weight/ovarian weight, respectively. © 2016 Poultry Science Association Inc.

Effect of dietary crude glycerol level on ruminal fermentation in continuous culture and growth performance of beef calves.

PubMed

Ramos, M H; Kerley, M S

2012-03-01

Continuous culture and in vivo experiments were conducted to measure changes in ruminal fermentation and animal performance when crude glycerol was added to diets. For the continuous culture experiment (n = 6), diets consisted of 4 levels of crude glycerol (0, 5, 10, and 20%) that replaced corn grain. Dry matter and OM digestibility decreased linearly (P < 0.05) when crude glycerol increased in the diet, and no effect (P = 0.20 and 0.65, respectively) was observed for CP and NDF digestibility. Total VFA concentration and ammonia did not change (P > 0.05) due to crude glycerol level. Microbial efficiency increased quadratically (P = 0.012) as crude glycerol increased, whereas microbial N flow did not differ (P = 0.36) among treatments. As crude glycerol increased in the diet, crude glycerol digestibility decreased (P < 0.05). Seventy-two crossbred steer calves (250 ± 2.0 kg) were assigned to 4 treatments: 0, 5, 10, and 20% crude glycerol that replaced corn grain. Animals were fed for a total of 150 d. No differences (P = 0.08) between treatments were measured for DMI. Average daily gain and GF responded quadratically (P < 0.05), with 10% crude glycerol resulting in the greatest values. In the second in vivo experiment, 100 crossbred steer calves (300 ± 2.0 kg) were assigned to 5 treatments: 0, 5, 10, 12.5, or 15% crude glycerol replaced corn grain. Calves were fed for a total of 135 d. No significant differences (P > 0.05) were measured in growth performance. For Exp. 3, one hundred heifer calves (270 ± 2.0 kg) were assigned to 4 treatments: 0, 5, 10, or 20% crude glycerol that replaced hay. No differences (P > 0.05) were measured in animal performance. We concluded that crude glycerol addition to a diet did not negatively affect ruminal fermentation, and addition of up to 20% in concentrate and hay-based diets should not affect performance or carcass characteristics.

Associations between the degree of early lactation inflammation and performance, metabolism, and immune function in dairy cows.

PubMed

McCarthy, M M; Yasui, T; Felippe, M J B; Overton, T R

2016-01-01

The objective of the current study was to determine associations between the severity of systemic inflammation during the early postpartum period and performance, energy metabolism, and immune function in dairy cows. Cows were assigned to categorical quartiles (Q; Q1=0.18-0.59, Q2=0.60-1.14, Q3=1.15-2.05, and Q4=2.06-2.50 g of haptoglobin/L) based on the highest plasma haptoglobin (Hp) concentration measured during wk 1 postpartum. Although cows were assigned to different categories of inflammation during the postpartum period, we detected a quadratic relationship of inflammation on prepartum dry matter intake (DMI) and body weight (BW) such that cows in Q2 had lower prepartum DMI and cows in Q2 and Q3 had lower prepartum BW compared with cows in the other quartiles. We also detected a quadratic association of inflammation with postpartum DMI and BW such that cows in Q2 and Q3 also had generally lower postpartum DMI and BW compared with cows in Q1. There was a tendency for a Q × time interaction for milk yield and Q × time interactions for 3.5% fat-corrected milk and energy-corrected milk yields; quadratic relationships suggested decreased milk yield for Q2 and Q3 cows. We also found Q × parity and Q × time interactions for plasma glucose and insulin concentrations, suggesting alterations with differing degrees of inflammation. There was also a Q × time interaction for plasma nonesterified fatty acids concentration. In addition, alterations in liver triglyceride and glycogen contents for cows with inflammation as well as alterations in [1-(14)C]propionate oxidation in vitro were observed. Although we observed limited effects of inflammation on neutrophil and monocyte phagocytosis at d 7 postpartum, inflammation appeared to alter neutrophil and monocyte oxidative burst. Overall, cows with any degree of elevated haptoglobin in the first week after calving had alterations in both pre- and postpartum intake and postpartum metabolism. Copyright © 2016 American Dairy Science Association. Published by Elsevier Inc. All rights reserved.

Multicomponent diffusion in basaltic melts at 1350 °C

NASA Astrophysics Data System (ADS)

Guo, Chenghuan; Zhang, Youxue

2018-05-01

Nine successful diffusion couple experiments were conducted in an 8-component SiO2-TiO2-Al2O3-FeO-MgO-CaO-Na2O-K2O system at ∼1350 °C and at 1 GPa, to study multicomponent diffusion in basaltic melts. At least 3 traverses were measured to obtain diffusion profiles for each experiment. Multicomponent diffusion matrix at 1350 °C was obtained by simultaneously fitting diffusion profiles of diffusion couple experiments. Furthermore, in order to better constrain the diffusion matrix and reconcile mineral dissolution data, mineral dissolution experiments in the literature and diffusion couple experiments from this study, were fit together. All features of diffusion profiles in both diffusion couple and mineral dissolution experiments were well reproduced by the diffusion matrix. Diffusion mechanism is inferred from eigenvectors of the diffusion matrix, and it shows that the diffusive exchange between network-formers SiO2 and Al2O3 is the slowest, the exchange of SiO2 with other oxide components is the second slowest with an eigenvalue that is only ∼10% larger, then the exchange between divalent oxide components and all the other oxide components is the third slowest with an eigenvalue that is twice the smallest eigenvalue, then the exchange of FeO + K2O with all the other oxide components is the fourth slowest with an eigenvalue that is 5 times the smallest eigenvalue, then the exchange of MgO with FeO + CaO is the third fastest with an eigenvalue that is 6.3 times the smallest eigenvalue, then the exchange of CaO + K2O with all the other oxide components is the second fastest with an eigenvalue that is 7.5 times the smallest eigenvalue, and the exchange of Na2O with all other oxide components is the fastest with an eigenvalue that is 31 times the smallest eigenvalue. The slowest and fastest eigenvectors are consistent with those for simpler systems in most literature. The obtained diffusion matrix was successfully applied to predict diffusion profiles during mineral dissolution in basaltic melts.

S4 solution of the transport equation for eigenvalues using Legendre polynomials

NASA Astrophysics Data System (ADS)

Öztürk, Hakan; Bülbül, Ahmet

2017-09-01

Numerical solution of the transport equation for monoenergetic neutrons scattered isotropically through the medium of a finite homogeneous slab is studied for the determination of the eigenvalues. After obtaining the discrete ordinates form of the transport equation, separated homogeneous and particular solutions are formed and then the eigenvalues are calculated using the Gauss-Legendre quadrature set. Then, the calculated eigenvalues for various values of the c0, the mean number of secondary neutrons per collision, are given in the tables.

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.

Synchrony-induced modes of oscillation of a neural field model

NASA Astrophysics Data System (ADS)

Esnaola-Acebes, Jose M.; Roxin, Alex; Avitabile, Daniele; Montbrió, Ernest

2017-11-01

We investigate the modes of oscillation of heterogeneous ring networks of quadratic integrate-and-fire (QIF) neurons with nonlocal, space-dependent coupling. Perturbations of the equilibrium state with a particular wave number produce transient standing waves with a specific temporal frequency, analogously to those in a tense string. In the neuronal network, the equilibrium corresponds to a spatially homogeneous, asynchronous state. Perturbations of this state excite the network's oscillatory modes, which reflect the interplay of episodes of synchronous spiking with the excitatory-inhibitory spatial interactions. In the thermodynamic limit, an exact low-dimensional neural field model describing the macroscopic dynamics of the network is derived. This allows us to obtain formulas for the Turing eigenvalues of the spatially homogeneous state and hence to obtain its stability boundary. We find that the frequency of each Turing mode depends on the corresponding Fourier coefficient of the synaptic pattern of connectivity. The decay rate instead is identical for all oscillation modes as a consequence of the heterogeneity-induced desynchronization of the neurons. Finally, we numerically compute the spectrum of spatially inhomogeneous solutions branching from the Turing bifurcation, showing that similar oscillatory modes operate in neural bump states and are maintained away from onset.

Synchrony-induced modes of oscillation of a neural field model.

PubMed

Esnaola-Acebes, Jose M; Roxin, Alex; Avitabile, Daniele; Montbrió, Ernest

2017-11-01

We investigate the modes of oscillation of heterogeneous ring networks of quadratic integrate-and-fire (QIF) neurons with nonlocal, space-dependent coupling. Perturbations of the equilibrium state with a particular wave number produce transient standing waves with a specific temporal frequency, analogously to those in a tense string. In the neuronal network, the equilibrium corresponds to a spatially homogeneous, asynchronous state. Perturbations of this state excite the network's oscillatory modes, which reflect the interplay of episodes of synchronous spiking with the excitatory-inhibitory spatial interactions. In the thermodynamic limit, an exact low-dimensional neural field model describing the macroscopic dynamics of the network is derived. This allows us to obtain formulas for the Turing eigenvalues of the spatially homogeneous state and hence to obtain its stability boundary. We find that the frequency of each Turing mode depends on the corresponding Fourier coefficient of the synaptic pattern of connectivity. The decay rate instead is identical for all oscillation modes as a consequence of the heterogeneity-induced desynchronization of the neurons. Finally, we numerically compute the spectrum of spatially inhomogeneous solutions branching from the Turing bifurcation, showing that similar oscillatory modes operate in neural bump states and are maintained away from onset.

Quantifying uncertainty in climate change science through empirical information theory.

PubMed

Majda, Andrew J; Gershgorin, Boris

2010-08-24

Quantifying the uncertainty for the present climate and the predictions of climate change in the suite of imperfect Atmosphere Ocean Science (AOS) computer models is a central issue in climate change science. Here, a systematic approach to these issues with firm mathematical underpinning is developed through empirical information theory. An information metric to quantify AOS model errors in the climate is proposed here which incorporates both coarse-grained mean model errors as well as covariance ratios in a transformation invariant fashion. The subtle behavior of model errors with this information metric is quantified in an instructive statistically exactly solvable test model with direct relevance to climate change science including the prototype behavior of tracer gases such as CO(2). Formulas for identifying the most sensitive climate change directions using statistics of the present climate or an AOS model approximation are developed here; these formulas just involve finding the eigenvector associated with the largest eigenvalue of a quadratic form computed through suitable unperturbed climate statistics. These climate change concepts are illustrated on a statistically exactly solvable one-dimensional stochastic model with relevance for low frequency variability of the atmosphere. Viable algorithms for implementation of these concepts are discussed throughout the paper.

Sturm-Liouville eigenproblems with an interior pole

NASA Technical Reports Server (NTRS)

Boyd, J. P.

1981-01-01

The eigenvalues and eigenfunctions of self-adjoint Sturm-Liouville problems with a simple pole on the interior of an interval are investigated. Three general theorems are proved, and it is shown that as n approaches infinity, the eigenfunctions more and more closely resemble those of an ordinary Sturm-Liouville problem. The low-order modes differ significantly from those of a nonsingular eigenproblem in that both eigenvalues and eigenfunctions are complex, and the eigenvalues for all small n may cluster about a common value in contrast to the widely separated eigenvalues of the corresponding nonsingular problem. In addition, the WKB is shown to be accurate for all n, and all eigenvalues of a normal one-dimensional Sturm-Liouville equation with nonperiodic boundary conditions are well separated.

Integrated optimization of location assignment and sequencing in multi-shuttle automated storage and retrieval systems under modified 2n-command cycle pattern

NASA Astrophysics Data System (ADS)

Yang, Peng; Peng, Yongfei; Ye, Bin; Miao, Lixin

2017-09-01

This article explores the integrated optimization problem of location assignment and sequencing in multi-shuttle automated storage/retrieval systems under the modified 2n-command cycle pattern. The decision of storage and retrieval (S/R) location assignment and S/R request sequencing are jointly considered. An integer quadratic programming model is formulated to describe this integrated optimization problem. The optimal travel cycles for multi-shuttle S/R machines can be obtained to process S/R requests in the storage and retrieval request order lists by solving the model. The small-sized instances are optimally solved using CPLEX. For large-sized problems, two tabu search algorithms are proposed, in which the first come, first served and nearest neighbour are used to generate initial solutions. Various numerical experiments are conducted to examine the heuristics' performance and the sensitivity of algorithm parameters. Furthermore, the experimental results are analysed from the viewpoint of practical application, and a parameter list for applying the proposed heuristics is recommended under different real-life scenarios.

Ant colony optimization for solving university facility layout problem

NASA Astrophysics Data System (ADS)

Mohd Jani, Nurul Hafiza; Mohd Radzi, Nor Haizan; Ngadiman, Mohd Salihin

2013-04-01

Quadratic Assignment Problems (QAP) is classified as the NP hard problem. It has been used to model a lot of problem in several areas such as operational research, combinatorial data analysis and also parallel and distributed computing, optimization problem such as graph portioning and Travel Salesman Problem (TSP). In the literature, researcher use exact algorithm, heuristics algorithm and metaheuristic approaches to solve QAP problem. QAP is largely applied in facility layout problem (FLP). In this paper we used QAP to model university facility layout problem. There are 8 facilities that need to be assigned to 8 locations. Hence we have modeled a QAP problem with n ≤ 10 and developed an Ant Colony Optimization (ACO) algorithm to solve the university facility layout problem. The objective is to assign n facilities to n locations such that the minimum product of flows and distances is obtained. Flow is the movement from one to another facility, whereas distance is the distance between one locations of a facility to other facilities locations. The objective of the QAP is to obtain minimum total walking (flow) of lecturers from one destination to another (distance).

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.

Statistical properties of cross-correlation in the Korean stock market

NASA Astrophysics Data System (ADS)

Oh, G.; Eom, C.; Wang, F.; Jung, W.-S.; Stanley, H. E.; Kim, S.

2011-01-01

We investigate the statistical properties of the cross-correlation matrix between individual stocks traded in the Korean stock market using the random matrix theory (RMT) and observe how these affect the portfolio weights in the Markowitz portfolio theory. We find that the distribution of the cross-correlation matrix is positively skewed and changes over time. We find that the eigenvalue distribution of original cross-correlation matrix deviates from the eigenvalues predicted by the RMT, and the largest eigenvalue is 52 times larger than the maximum value among the eigenvalues predicted by the RMT. The β_{473} coefficient, which reflect the largest eigenvalue property, is 0.8, while one of the eigenvalues in the RMT is approximately zero. Notably, we show that the entropy function E(σ) with the portfolio risk σ for the original and filtered cross-correlation matrices are consistent with a power-law function, E( σ) σ^{-γ}, with the exponent γ 2.92 and those for Asian currency crisis decreases significantly.

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.

Effect of the inclusion of dry pasta by-products at different levels in the diet of typical Italian finishing heavy pigs: Performance, carcass characteristics, and ham quality.

PubMed

Prandini, A; Sigolo, S; Moschini, M; Giuberti, G; Morlacchini, M

2016-04-01

The effect of pasta inclusion in finishing pig diets was evaluated on growth performance, carcass characteristics, and ham quality. Pigs (144) were assigned to 4 diets with different pasta levels: 0 (control, corn-based diet), 30, 60, or 80%. Pigs fed pasta had greater (linear, P<0.01) feed intakes than controls. Pasta increased (quadratic, P<0.01) carcass weight and dressing percentage reaching the highest values at 30% inclusion level, and reduced (linear, P<0.01) the Longissimus thoracis et lumborum thickness. Pasta decreased (linear, P<0.01) linoleic acid and polyunsaturated fatty acid levels in subcutaneous (fresh and seasoned hams) and intramuscular (seasoned hams) fat, and enhanced saturated fatty acid content in subcutaneous fat (fresh hams: quadratic, P<0.01; seasoned hams: linear, P=0.03). Proteolysis index, colour, weight losses, and sensory properties (excepted extraneous taste) of the hams were unaffected by the pasta. Pasta could be considered as an ingredient in the diet for typical Italian finishing heavy pigs. Copyright © 2015 Elsevier Ltd. All rights reserved.

Morphological adaptation of sheep's rumen epithelium to high-grain diet entails alteration in the expression of genes involved in cell cycle regulation, cell proliferation and apoptosis.

PubMed

Xu, Lei; Wang, Yue; Liu, Junhua; Zhu, Weiyun; Mao, Shengyong

2018-01-01

The objectives of this study were to characterize changes in the relative mRNA expression of candidate genes and proteins involved in cell cycle regulation, cell proliferation and apoptosis in the ruminal epithelium (RE) of sheep during high-grain (HG) diet adaptation. Twenty sheep were assigned to four groups with five animals each. These animals were assigned to different periods of HG diet (containing 40% forage and 60% concentrate mix) feeding. The HG groups received an HG diet for 7 (G7, n  = 5), 14 (G14, n  = 5) and 28 d (G28, n  = 5), respectively. In contrast, the control group (CON, n  = 5) was fed the forage-based diet for 28 d. The results showed that HG feeding linearly decreased ( P  <  0.001) the ruminal pH, and increased the concentrations of ruminal total volatile fatty acid (linear, P  = 0.001), butyrate (linear, P  <  0.001), valerate (quadratic P  = 0.029) and the level of IGF-1 (quadratic, P  = 0.043) in plasma. The length (quadratic, P  = 0.004), width (cubic, P  = 0.015) and surface of the ruminal papillae (linear, P  = 0.003) were all enlarged after 14 d of HG diet feeding. HG feeding cubically increased the number of cell layers forming the stratum corneum (SC, P  <  0.001) and the thickness of the SC ( P  <  0.001) and stratum basale ( P  <  0.001). The proportion of basal layer cells in the RE decreased (linear, P  <  0.001) in the G0/G1-phase, but it increased linearly ( P  = 0.006) in the S-phase and cubically ( P  = 0.004) in the G2/M-phases. The proportion of apoptosis cells in G7, G14 and G28 was reduced compared to the CON (quadratic, P  < 0.001). HG diet feeding linearly decreased the mRNA expression of Cyclin E1 ( P  = 0.021) and CDK-2 ( P  = 0.001) and ( P  = 0.027) the protein expression of Cyclin E1. Feeding an HG diet linearly increased the mRNA expression of genes IGFBP-2 ( P  = 0.034) and IGFBP 5 ( P  < 0.009), while linearly decreasing ( P  < 0.001) the IGFBP 3 expression. The expression of cell apoptosis gene Caspase 8 decreased (quadratic, P  = 0.012), while Bad mRNA expression tended to decrease (cubic, P  = 0.053) after HG feeding. These results demonstrated sequential changes in rumen papillae size, cell cycle regulation and the genes involved in proliferation and apoptosis as time elapsed in feeding a high-grain diet to sheep.

On the number of eigenvalues of the discrete one-dimensional Dirac operator with a complex potential

NASA Astrophysics Data System (ADS)

Hulko, Artem

2018-03-01

In this paper we define a one-dimensional discrete Dirac operator on Z . We study the eigenvalues of the Dirac operator with a complex potential. We obtain bounds on the total number of eigenvalues in the case where V decays exponentially at infinity. We also estimate the number of eigenvalues for the discrete Schrödinger operator with complex potential on Z . That is we extend the result obtained by Hulko (Bull Math Sci, to appear) to the whole Z.

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.

An eigenvalue localization set for tensors and its applications.

PubMed

Zhao, Jianxing; Sang, Caili

2017-01-01

A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Li et al . (Linear Algebra Appl. 481:36-53, 2015) and Huang et al . (J. Inequal. Appl. 2016:254, 2016). As an application of this set, new bounds for the minimum eigenvalue of [Formula: see text]-tensors are established and proved to be sharper than some known results. Compared with the results obtained by Huang et al ., the advantage of our results is that, without considering the selection of nonempty proper subsets S of [Formula: see text], we can obtain a tighter eigenvalue localization set for tensors and sharper bounds for the minimum eigenvalue of [Formula: see text]-tensors. Finally, numerical examples are given to verify the theoretical results.

SCALE Continuous-Energy Eigenvalue Sensitivity Coefficient Calculations

DOE PAGES

Perfetti, Christopher M.; Rearden, Bradley T.; Martin, William R.

2016-02-25

Sensitivity coefficients describe the fractional change in a system response that is induced by changes to system parameters and nuclear data. The Tools for Sensitivity and UNcertainty Analysis Methodology Implementation (TSUNAMI) code within the SCALE code system makes use of eigenvalue sensitivity coefficients for an extensive number of criticality safety applications, including 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 developmentmore » of a methodology for calculating sensitivity coefficients in continuous-energy (CE) Monte Carlo applications. The Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) and Iterated Fission Probability (IFP) eigenvalue sensitivity methods were recently implemented in the CE-KENO framework of the SCALE code system to enable TSUNAMI-3D to perform eigenvalue sensitivity calculations using continuous-energy Monte Carlo methods. This work provides a detailed description of the theory behind the CLUTCH method and describes in detail its implementation. This work explores the improvements in eigenvalue sensitivity coefficient accuracy that can be gained through the use of continuous-energy sensitivity methods and also compares several sensitivity methods in terms of computational efficiency and memory requirements.« less

Design of a New Concentration Series for the Orthogonal Sample Design Approach and Estimation of the Number of Reactions in Chemical Systems.

PubMed

Shi, Jiajia; Liu, Yuhai; Guo, Ran; Li, Xiaopei; He, Anqi; Gao, Yunlong; Wei, Yongju; Liu, Cuige; Zhao, Ying; Xu, Yizhuang; Noda, Isao; Wu, Jinguang

2015-11-01

A new concentration series is proposed for the construction of a two-dimensional (2D) synchronous spectrum for orthogonal sample design analysis to probe intermolecular interaction between solutes dissolved in the same solutions. The obtained 2D synchronous spectrum possesses the following two properties: (1) cross peaks in the 2D synchronous spectra can be used to reflect intermolecular interaction reliably, since interference portions that have nothing to do with intermolecular interaction are completely removed, and (2) the two-dimensional synchronous spectrum produced can effectively avoid accidental collinearity. Hence, the correct number of nonzero eigenvalues can be obtained so that the number of chemical reactions can be estimated. In a real chemical system, noise present in one-dimensional spectra may also produce nonzero eigenvalues. To get the correct number of chemical reactions, we classified nonzero eigenvalues into significant nonzero eigenvalues and insignificant nonzero eigenvalues. Significant nonzero eigenvalues can be identified by inspecting the pattern of the corresponding eigenvector with help of the Durbin-Watson statistic. As a result, the correct number of chemical reactions can be obtained from significant nonzero eigenvalues. This approach provides a solid basis to obtain insight into subtle spectral variations caused by intermolecular interaction.

Stability analysis for virus spreading in complex networks with quarantine and non-homogeneous transition rates

NASA Astrophysics Data System (ADS)

Alarcon-Ramos, L. A.; Schaum, A.; Rodríguez Lucatero, C.; Bernal Jaquez, R.

2014-03-01

Virus propagations in complex networks have been studied in the framework of discrete time Markov process dynamical systems. These studies have been carried out under the assumption of homogeneous transition rates, yielding conditions for virus extinction in terms of the transition probabilities and the largest eigenvalue of the connectivity matrix. Nevertheless the assumption of homogeneous rates is rather restrictive. In the present study we consider non-homogeneous transition rates, assigned according to a uniform distribution, with susceptible, infected and quarantine states, thus generalizing the previous studies. A remarkable result of this analysis is that the extinction depends on the weakest element in the network. Simulation results are presented for large free-scale networks, that corroborate our theoretical findings.

Carcass characteristics of lambs fed spineless cactus as a replacement for sugarcane.

PubMed

de Oliveira, Juliana Paula Felipe; de Andrade Ferreira, Marcelo; Alves, Adryanne Marjorie Souza Vitor; de Melo, Ana Caroline Cerqueira; de Andrade, Ida Barbosa; Urbano, Stela Antas; Suassuna, Juraci Marcos Alves; de Barros, Leonardo José Assis; de Barros Melo, Tobias Tobit

2018-04-01

Fresh sugarcane has been a new roughage source for ruminant's in semiarid regions, a function of the decline of sugar and alcohol industry in recent years. However, there is little data published regarding lambs fed sugarcane associated with spineless cactus. This study evaluated the effect of sugarcane replacement with spineless cactus (0%, 33%, 66%, and 100%) in the diet of Santa Inês lambs on carcass characteristics. Thirty-six non-castrated Santa Ines lambs at four months of age and an initial body weight of 22±2.3 kg were assigned in a randomized block design and slaughtered after 70 days of confinement. The effects of spineless cactus as a replacement for sugarcane in the diet of the lambs on the carcass characteristics, commercial cut weight and yield, leg tissue composition, and carcass measurements were studied. The study revealed quadratic behavior in slaughter body weight, and hot and cold carcass weight, with maximum values of 38.60, 18.60, and 18.11 kg and replacement levels of 40.18%, 44.42%, and 43.14%, respectively. The cold carcass yield presented an increasing linear behavior. The compactness index of carcass and leg presented a quadratic effect, with estimated maximal values of 0.28 and 0.57 kg/cm and replacement levels of 43.37% and 45.5%, respectively. The weights of commercial cuts of leg, loin, shoulder, and breast showed quadratic behavior, with maximum values of 2.79, 0.852, 1.46, and 1.30 kg and replacement levels of 49.5, 45.32, 39.0, and 40.7, respectively. For tissue composition, quadratic behavior was verified for leg weight, subcutaneous fat, and total fat. The replacement of sugarcane by spineless cactus at level 44% is recommended for finishing lambs considering that this level improved most of the carcass characteristics, weights, and yields of commercial cuts and leg tissue composition.

Accurate Valence Ionization Energies from Kohn-Sham Eigenvalues with the Help of Potential Adjustors.

PubMed

Thierbach, Adrian; Neiss, Christian; Gallandi, Lukas; Marom, Noa; Körzdörfer, Thomas; Görling, Andreas

2017-10-10

An accurate yet computationally very efficient and formally well justified approach to calculate molecular ionization potentials is presented and tested. The first as well as higher ionization potentials are obtained as the negatives of the Kohn-Sham eigenvalues of the neutral molecule after adjusting the eigenvalues by a recently [ Görling Phys. Rev. B 2015 , 91 , 245120 ] introduced potential adjustor for exchange-correlation potentials. Technically the method is very simple. Besides a Kohn-Sham calculation of the neutral molecule, only a second Kohn-Sham calculation of the cation is required. The eigenvalue spectrum of the neutral molecule is shifted such that the negative of the eigenvalue of the highest occupied molecular orbital equals the energy difference of the total electronic energies of the cation minus the neutral molecule. For the first ionization potential this simply amounts to a ΔSCF calculation. Then, the higher ionization potentials are obtained as the negatives of the correspondingly shifted Kohn-Sham eigenvalues. Importantly, this shift of the Kohn-Sham eigenvalue spectrum is not just ad hoc. In fact, it is formally necessary for the physically correct energetic adjustment of the eigenvalue spectrum as it results from ensemble density-functional theory. An analogous approach for electron affinities is equally well obtained and justified. To illustrate the practical benefits of the approach, we calculate the valence ionization energies of test sets of small- and medium-sized molecules and photoelectron spectra of medium-sized electron acceptor molecules using a typical semilocal (PBE) and two typical global hybrid functionals (B3LYP and PBE0). The potential adjusted B3LYP and PBE0 eigenvalues yield valence ionization potentials that are in very good agreement with experimental values, reaching an accuracy that is as good as the best G 0 W 0 methods, however, at much lower computational costs. The potential adjusted PBE eigenvalues result in somewhat less accurate ionization energies, which, however, are almost as accurate as those obtained from the most commonly used G 0 W 0 variants.

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.

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

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.

Hessian eigenvalue distribution in a random Gaussian landscape

NASA Astrophysics Data System (ADS)

Yamada, Masaki; Vilenkin, Alexander

2018-03-01

The energy landscape of multiverse cosmology is often modeled by a multi-dimensional random Gaussian potential. The physical predictions of such models crucially depend on the eigenvalue distribution of the Hessian matrix at potential minima. In particular, the stability of vacua and the dynamics of slow-roll inflation are sensitive to the magnitude of the smallest eigenvalues. The Hessian eigenvalue distribution has been studied earlier, using the saddle point approximation, in the leading order of 1/ N expansion, where N is the dimensionality of the landscape. This approximation, however, is insufficient for the small eigenvalue end of the spectrum, where sub-leading terms play a significant role. We extend the saddle point method to account for the sub-leading contributions. We also develop a new approach, where the eigenvalue distribution is found as an equilibrium distribution at the endpoint of a stochastic process (Dyson Brownian motion). The results of the two approaches are consistent in cases where both methods are applicable. We discuss the implications of our results for vacuum stability and slow-roll inflation in the landscape.

Two-faced property of a market factor in asset pricing and diversification effect

NASA Astrophysics Data System (ADS)

Eom, Cheoljun

2017-04-01

This study empirically investigates the test hypothesis that a market factor acting as a representative common factor in the pricing models has a negative influence on constructing a well-diversified portfolio from the Markowitz mean-variance optimization function (MVOF). We use the comparative correlation matrix (C-CM) method to control a single eigenvalue among all eigenvalues included in the sample correlation matrix (S-CM), through the random matrix theory (RMT). In particular, this study observes the effect of the largest eigenvalue that has the property of the market factor. According to the results, the largest eigenvalue has the highest explanatory power on the stock return changes. The C-CM without the largest eigenvalue in the S-CM constructs a more diversified portfolio capable of improving the practical applicability of the MVOF. Moreover, the more diversified portfolio constructed from this C-CM has better out-of-sample performance in the future period. These results support the test hypothesis for the two-faced property of the market factor, defined by the largest eigenvalue.

Fixed order dynamic compensation for multivariable linear systems

NASA Technical Reports Server (NTRS)

Kramer, F. S.; Calise, A. J.

1986-01-01

This paper considers the design of fixed order dynamic compensators for multivariable time invariant linear systems, minimizing a linear quadratic performance cost functional. Attention is given to robustness issues in terms of multivariable frequency domain specifications. An output feedback formulation is adopted by suitably augmenting the system description to include the compensator states. Either a controller or observer canonical form is imposed on the compensator description to reduce the number of free parameters to its minimal number. The internal structure of the compensator is prespecified by assigning a set of ascending feedback invariant indices, thus forming a Brunovsky structure for the nominal compensator.

Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations

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

Cai, Yunfeng, E-mail: yfcai@math.pku.edu.cn; Department of Computer Science, University of California, Davis 95616; Bai, Zhaojun, E-mail: bai@cs.ucdavis.edu

2013-12-15

The iterative diagonalization of a sequence of large ill-conditioned generalized eigenvalue problems is a computational bottleneck in quantum mechanical methods employing a nonorthogonal basis for ab initio electronic structure calculations. We propose a hybrid preconditioning scheme to effectively combine global and locally accelerated preconditioners for rapid iterative diagonalization of such eigenvalue problems. In partition-of-unity finite-element (PUFE) pseudopotential density-functional calculations, employing a nonorthogonal basis, we show that the hybrid preconditioned block steepest descent method is a cost-effective eigensolver, outperforming current state-of-the-art global preconditioning schemes, and comparably efficient for the ill-conditioned generalized eigenvalue problems produced by PUFE as the locally optimal blockmore » preconditioned conjugate-gradient method for the well-conditioned standard eigenvalue problems produced by planewave methods.« less

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 interior eigenvalues of nonsymmetric matrices: application to three-dimensional metamaterial composites.

PubMed

Terao, Takamichi

2010-08-01

We propose a numerical method to calculate interior eigenvalues and corresponding eigenvectors for nonsymmetric matrices. Based on the subspace projection technique onto expanded Ritz subspace, it becomes possible to obtain eigenvalues and eigenvectors with sufficiently high precision. This method overcomes the difficulties of the traditional nonsymmetric Lanczos algorithm, and improves the accuracy of the obtained interior eigenvalues and eigenvectors. Using this algorithm, we investigate three-dimensional metamaterial composites consisting of positive and negative refractive index materials, and it is demonstrated that the finite-difference frequency-domain algorithm is applicable to analyze these metamaterial composites.

The first eigenvalue of the p-Laplacian on quantum graphs

NASA Astrophysics Data System (ADS)

Del Pezzo, Leandro M.; Rossi, Julio D.

2016-12-01

We study the first eigenvalue of the p-Laplacian (with 1

A new approach to the method of source-sink potentials for molecular conduction

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

Pickup, Barry T., E-mail: B.T.Pickup@sheffield.ac.uk, E-mail: P.W.Fowler@sheffield.ac.uk; Fowler, Patrick W., E-mail: B.T.Pickup@sheffield.ac.uk, E-mail: P.W.Fowler@sheffield.ac.uk; Borg, Martha

2015-11-21

We re-derive the tight-binding source-sink potential (SSP) equations for ballistic conduction through conjugated molecular structures in a form that avoids singularities. This enables derivation of new results for families of molecular devices in terms of eigenvectors and eigenvalues of the adjacency matrix of the molecular graph. In particular, we define the transmission of electrons through individual molecular orbitals (MO) and through MO shells. We make explicit the behaviour of the total current and individual MO and shell currents at molecular eigenvalues. A rich variety of behaviour is found. A SSP device has specific insulation or conduction at an eigenvalue ofmore » the molecular graph (a root of the characteristic polynomial) according to the multiplicities of that value in the spectra of four defined device polynomials. Conduction near eigenvalues is dominated by the transmission curves of nearby shells. A shell may be inert or active. An inert shell does not conduct at any energy, not even at its own eigenvalue. Conduction may occur at the eigenvalue of an inert shell, but is then carried entirely by other shells. If a shell is active, it carries all conduction at its own eigenvalue. For bipartite molecular graphs (alternant molecules), orbital conduction properties are governed by a pairing theorem. Inertness of shells for families such as chains and rings is predicted by selection rules based on node counting and degeneracy.« less

The Use of Sphere Indentation Experiments to Characterize Ceramic Damage Models

DTIC Science & Technology

2011-09-01

state having two equal eigenvalues. For TXC, the axial stress (single eigenvalue) is more compressive than the lateral stresses (dual eigenvalues). For...parameters. These dynamic experiments supplement traditional characterization experiments such as tension, triaxial compression , Brazilian, and...These dynamic experiments supplement traditional characterization experiments such as tension, triaxial compression , Brazilian, and plate impact, which

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.

Derivation of an eigenvalue probability density function relating to the Poincaré disk

NASA Astrophysics Data System (ADS)

Forrester, Peter J.; Krishnapur, Manjunath

2009-09-01

A result of Zyczkowski and Sommers (2000 J. Phys. A: Math. Gen. 33 2045-57) gives the eigenvalue probability density function for the top N × N sub-block of a Haar distributed matrix from U(N + n). In the case n >= N, we rederive this result, starting from knowledge of the distribution of the sub-blocks, introducing the Schur decomposition and integrating over all variables except the eigenvalues. The integration is done by identifying a recursive structure which reduces the dimension. This approach is inspired by an analogous approach which has been recently applied to determine the eigenvalue probability density function for random matrices A-1B, where A and B are random matrices with entries standard complex normals. We relate the eigenvalue distribution of the sub-blocks to a many-body quantum state, and to the one-component plasma, on the pseudosphere.

Asymptotics of empirical eigenstructure for high dimensional spiked covariance.

PubMed

Wang, Weichen; Fan, Jianqing

2017-06-01

We derive the asymptotic distributions of the spiked eigenvalues and eigenvectors under a generalized and unified asymptotic regime, which takes into account the magnitude of spiked eigenvalues, sample size, and dimensionality. This regime allows high dimensionality and diverging eigenvalues and provides new insights into the roles that the leading eigenvalues, sample size, and dimensionality play in principal component analysis. Our results are a natural extension of those in Paul (2007) to a more general setting and solve the rates of convergence problems in Shen et al. (2013). They also reveal the biases of estimating leading eigenvalues and eigenvectors by using principal component analysis, and lead to a new covariance estimator for the approximate factor model, called shrinkage principal orthogonal complement thresholding (S-POET), that corrects the biases. Our results are successfully applied to outstanding problems in estimation of risks of large portfolios and false discovery proportions for dependent test statistics and are illustrated by simulation studies.

Asymptotics of empirical eigenstructure for high dimensional spiked covariance

PubMed Central

Wang, Weichen

2017-01-01

We derive the asymptotic distributions of the spiked eigenvalues and eigenvectors under a generalized and unified asymptotic regime, which takes into account the magnitude of spiked eigenvalues, sample size, and dimensionality. This regime allows high dimensionality and diverging eigenvalues and provides new insights into the roles that the leading eigenvalues, sample size, and dimensionality play in principal component analysis. Our results are a natural extension of those in Paul (2007) to a more general setting and solve the rates of convergence problems in Shen et al. (2013). They also reveal the biases of estimating leading eigenvalues and eigenvectors by using principal component analysis, and lead to a new covariance estimator for the approximate factor model, called shrinkage principal orthogonal complement thresholding (S-POET), that corrects the biases. Our results are successfully applied to outstanding problems in estimation of risks of large portfolios and false discovery proportions for dependent test statistics and are illustrated by simulation studies. PMID:28835726

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.

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

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.

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.

Solving complex band structure problems with the FEAST eigenvalue algorithm

NASA Astrophysics Data System (ADS)

Laux, S. E.

2012-08-01

With straightforward extension, the FEAST eigenvalue algorithm [Polizzi, Phys. Rev. B 79, 115112 (2009)] is capable of solving the generalized eigenvalue problems representing traveling-wave problems—as exemplified by the complex band-structure problem—even though the matrices involved are complex, non-Hermitian, and singular, and hence outside the originally stated range of applicability of the algorithm. The obtained eigenvalues/eigenvectors, however, contain spurious solutions which must be detected and removed. The efficiency and parallel structure of the original algorithm are unaltered. The complex band structures of Si layers of varying thicknesses and InAs nanowires of varying radii are computed as test problems.

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.

Comment on ‘Numerical estimates of the spectrum for anharmonic PT symmetric potentials’

NASA Astrophysics Data System (ADS)

Amore, Paolo; Fernández, Francisco M.

2013-04-01

We show that the authors of the commented paper (Bowen et al 2012 Phys. Scr. 85 065005) draw their conclusions from the eigenvalues of truncated Hamiltonian matrices that do not converge as the matrix dimension increases. In some of the studied examples, the authors missed the real positive eigenvalues that already converge towards the exact eigenvalues of the non-Hermitian operators and focused their attention on the complex ones that do not. We also show that the authors misread Bender's argument about the eigenvalues of the harmonic oscillator with boundary conditions in the complex-x plane (Bender 2007 Rep. Prog. Phys. 70 947).

HIV health center affiliation networks of black men who have sex with men: disentangling fragmented patterns of HIV prevention service utilization.

PubMed

Schneider, John A; Walsh, Tim; Cornwell, Benjamin; Ostrow, David; Michaels, Stuart; Laumann, Edward O

2012-08-01

In the United States, black men who have sex with men (BMSM) are at highest risk for HIV infection and are at high risk for limited health service utilization. We describe HIV health center (HHC) affiliation network patterns and their potential determinants among urban BMSM. The Men's Assessment of Social and Risk Network instrument was used to elicit HHC utilization, as reported by study respondents recruited through respondent-driven sampling. In 2010, 204 BMSM were systematically recruited from diverse venues in Chicago, IL. A 2-mode data set was constructed that included study participants and 9 diverse HHCs. Associations between individual-level characteristics and HHC utilization were analyzed using Multiple Regression Quadratic Assignment Procedure. Visualization analyses included computation of HHC centrality and faction membership. High utilization of HHCs (45.9%-70.3%) was evident among BMSM, 44.4% who were HIV infected. Multiple Regression Quadratic Assignment Procedure revealed that age, social network size, and HIV status were associated with HHC affiliation patterns (coeff., 0.13-0.27; all P < 0.05). With the exception of one HHC, HHCs offering HIV prevention services to HIV-infected participants occupied peripheral positions within the network of health centers. High-risk HIV-uninfected participants affiliated most with an HHC that offers only treatment services. Subcategories of BMSM in this sample affiliated with HHCs that may not provide appropriate HIV prevention services. Using 2-mode data, public health authorities may be better able to match prevention services to BMSM need; in particular, HIV prevention services for high-risk HIV-uninfected men and HIV "prevention for positives" services for HIV-infected men.

Spectral properties of the temporal evolution of brain network structure.

PubMed

Wang, Rong; Zhang, Zhen-Zhen; Ma, Jun; Yang, Yong; Lin, Pan; Wu, Ying

2015-12-01

The temporal evolution properties of the brain network are crucial for complex brain processes. In this paper, we investigate the differences in the dynamic brain network during resting and visual stimulation states in a task-positive subnetwork, task-negative subnetwork, and whole-brain network. The dynamic brain network is first constructed from human functional magnetic resonance imaging data based on the sliding window method, and then the eigenvalues corresponding to the network are calculated. We use eigenvalue analysis to analyze the global properties of eigenvalues and the random matrix theory (RMT) method to measure the local properties. For global properties, the shifting of the eigenvalue distribution and the decrease in the largest eigenvalue are linked to visual stimulation in all networks. For local properties, the short-range correlation in eigenvalues as measured by the nearest neighbor spacing distribution is not always sensitive to visual stimulation. However, the long-range correlation in eigenvalues as evaluated by spectral rigidity and number variance not only predicts the universal behavior of the dynamic brain network but also suggests non-consistent changes in different networks. These results demonstrate that the dynamic brain network is more random for the task-positive subnetwork and whole-brain network under visual stimulation but is more regular for the task-negative subnetwork. Our findings provide deeper insight into the importance of spectral properties in the functional brain network, especially the incomparable role of RMT in revealing the intrinsic properties of complex systems.

Efficient exact-exchange time-dependent density-functional theory methods and their relation to time-dependent Hartree-Fock.

PubMed

Hesselmann, Andreas; Görling, Andreas

2011-01-21

A recently introduced time-dependent exact-exchange (TDEXX) method, i.e., a response method based on time-dependent density-functional theory that treats the frequency-dependent exchange kernel exactly, is reformulated. In the reformulated version of the TDEXX method electronic excitation energies can be calculated by solving a linear generalized eigenvalue problem while in the original version of the TDEXX method a laborious frequency iteration is required in the calculation of each excitation energy. The lowest eigenvalues of the new TDEXX eigenvalue equation corresponding to the lowest excitation energies can be efficiently obtained by, e.g., a version of the Davidson algorithm appropriate for generalized eigenvalue problems. Alternatively, with the help of a series expansion of the new TDEXX eigenvalue equation, standard eigensolvers for large regular eigenvalue problems, e.g., the standard Davidson algorithm, can be used to efficiently calculate the lowest excitation energies. With the help of the series expansion as well, the relation between the TDEXX method and time-dependent Hartree-Fock is analyzed. Several ways to take into account correlation in addition to the exact treatment of exchange in the TDEXX method are discussed, e.g., a scaling of the Kohn-Sham eigenvalues, the inclusion of (semi)local approximate correlation potentials, or hybrids of the exact-exchange kernel with kernels within the adiabatic local density approximation. The lowest lying excitations of the molecules ethylene, acetaldehyde, and pyridine are considered as examples.

Spectral properties of the temporal evolution of brain network structure

NASA Astrophysics Data System (ADS)

Wang, Rong; Zhang, Zhen-Zhen; Ma, Jun; Yang, Yong; Lin, Pan; Wu, Ying

2015-12-01

The temporal evolution properties of the brain network are crucial for complex brain processes. In this paper, we investigate the differences in the dynamic brain network during resting and visual stimulation states in a task-positive subnetwork, task-negative subnetwork, and whole-brain network. The dynamic brain network is first constructed from human functional magnetic resonance imaging data based on the sliding window method, and then the eigenvalues corresponding to the network are calculated. We use eigenvalue analysis to analyze the global properties of eigenvalues and the random matrix theory (RMT) method to measure the local properties. For global properties, the shifting of the eigenvalue distribution and the decrease in the largest eigenvalue are linked to visual stimulation in all networks. For local properties, the short-range correlation in eigenvalues as measured by the nearest neighbor spacing distribution is not always sensitive to visual stimulation. However, the long-range correlation in eigenvalues as evaluated by spectral rigidity and number variance not only predicts the universal behavior of the dynamic brain network but also suggests non-consistent changes in different networks. These results demonstrate that the dynamic brain network is more random for the task-positive subnetwork and whole-brain network under visual stimulation but is more regular for the task-negative subnetwork. Our findings provide deeper insight into the importance of spectral properties in the functional brain network, especially the incomparable role of RMT in revealing the intrinsic properties of complex systems.

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

Quadrat Data for Fermilab Prairie Plant Survey

Science.gov Websites

Quadrat Data 2012 Quadrat Data 2013 Quadrat Data None taken by volunteers in 2014 due to weather problems . 2015 Quadrat Data 2016 Quadrat Data None taken by volunteers in 2017 due to weather and other problems

Potential energy surface and vibrational band origins of the triatomic lithium cation

NASA Astrophysics Data System (ADS)

Searles, Debra J.; Dunne, Simon J.; von Nagy-Felsobuki, Ellak I.

The 104 point CISD Li +3 potential energy surface and its analytical representation is reported. The calculations predict the minimum energy geometry to be an equilateral triangle of side RLiLi = 3.0 Å and of energy - 22.20506 E h. A fifth-order Morse—Dunham type analytical force field is used in the Carney—Porter normal co-ordinate vibrational Hamiltonian, the corresponding eigenvalue problem being solved variationally using a 560 configurational finite-element basis set. The predicted assignment of the vibrational band origins is in accord with that reported for H +3. Moreover, for 6Li +3 and 7Li +3 the lowest i.r. accessible band origin is the overlineν0,1,±1 predicted to be at 243.6 and 226.0 cm -1 respectively.

Hyperfine Sublevel Correlation (HYSCORE) Spectra for Paramagnetic Centers with Nuclear Spin I = 1 Having Isotropic Hyperfine Interactions

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

Maryasov, Alexander G.; Bowman, Michael K.

2004-07-08

It is shown that HYSCORE spectra of paramagnetic centers having nuclei of spin I=1 with isotropic hfi and arbitrary NQI consist of ridges having zero width. A parametric presentation of these ridges is found which shows the range of possible frequencies in the HYSCORE spectrum and aids in spectral assignments and rapid estimation of spin Hamiltonian parameters. An alternative approach for the spectral density calculation is presented that is based on spectral decomposition of the Hamiltonian. Only the eigenvalues of the Hamiltonian are needed in this approach. An atlas of HYSCORE spectra is given in the Supporting Information. This approachmore » is applied to the estimation of the spin Hamiltonian parameters of the oxovanadium-EDTA complex.« less

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.

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.

The method of fundamental solutions for computing acoustic interior transmission eigenvalues

NASA Astrophysics Data System (ADS)

Kleefeld, Andreas; Pieronek, Lukas

2018-03-01

We analyze the method of fundamental solutions (MFS) in two different versions with focus on the computation of approximate acoustic interior transmission eigenvalues in 2D for homogeneous media. Our approach is mesh- and integration free, but suffers in general from the ill-conditioning effects of the discretized eigenoperator, which we could then successfully balance using an approved stabilization scheme. Our numerical examples cover many of the common scattering objects and prove to be very competitive in accuracy with the standard methods for PDE-related eigenvalue problems. We finally give an approximation analysis for our framework and provide error estimates, which bound interior transmission eigenvalue deviations in terms of some generalized MFS output.

Aeroelastic Stability of Idling Wind Turbines

NASA Astrophysics Data System (ADS)

Wang, Kai; Riziotis, Vasilis A.; Voutsinas, Spyros G.

2016-09-01

Wind turbine rotors in idling operation mode can experience high angles of attack, within the post stall region that are capable of triggering stall-induced vibrations. In the present paper rotor stability in slow idling operation is assessed on the basis of non-linear time domain and linear eigenvalue analysis. Analysis is performed for a 10 MW conceptual wind turbine designed by DTU. First the flow conditions that are likely to favour stall induced instabilities are identified through non-linear time domain aeroelastic analysis. Next, for the above specified conditions, eigenvalue stability simulations are performed aiming at identifying the low damped modes of the turbine. Finally the results of the eigenvalue analysis are evaluated through computations of the work of the aerodynamic forces by imposing harmonic vibrations following the shape and frequency of the various modes. Eigenvalue analysis indicates that the asymmetric and symmetric out-of-plane modes have the lowest damping. The results of the eigenvalue analysis agree well with those of the time domain analysis.

Substructure Versus Property-Level Dispersed Modes Calculation

NASA Technical Reports Server (NTRS)

Stewart, Eric C.; Peck, Jeff A.; Bush, T. Jason; Fulcher, Clay W.

2016-01-01

This paper calculates the effect of perturbed finite element mass and stiffness values on the eigenvectors and eigenvalues of the finite element model. The structure is perturbed in two ways: at the "subelement" level and at the material property level. In the subelement eigenvalue uncertainty analysis the mass and stiffness of each subelement is perturbed by a factor before being assembled into the global matrices. In the property-level eigenvalue uncertainty analysis all material density and stiffness parameters of the structure are perturbed modified prior to the eigenvalue analysis. The eigenvalue and eigenvector dispersions of each analysis (subelement and property-level) are also calculated using an analytical sensitivity approximation. Two structural models are used to compare these methods: a cantilevered beam model, and a model of the Space Launch System. For each structural model it is shown how well the analytical sensitivity modes approximate the exact modes when the uncertainties are applied at the subelement level and at the property level.

Robust cooperation of connected vehicle systems with eigenvalue-bounded interaction topologies in the presence of uncertain dynamics

NASA Astrophysics Data System (ADS)

Li, Keqiang; Gao, Feng; Li, Shengbo Eben; Zheng, Yang; Gao, Hongbo

2017-12-01

This study presents a distributed H-infinity control method for uncertain platoons with dimensionally and structurally unknown interaction topologies provided that the associated topological eigenvalues are bounded by a predesigned range.With an inverse model to compensate for nonlinear powertrain dynamics, vehicles in a platoon are modeled by third-order uncertain systems with bounded disturbances. On the basis of the eigenvalue decomposition of topological matrices, we convert the platoon system to a norm-bounded uncertain part and a diagonally structured certain part by applying linear transformation. We then use a common Lyapunov method to design a distributed H-infinity controller. Numerically, two linear matrix inequalities corresponding to the minimum and maximum eigenvalues should be solved. The resulting controller can tolerate interaction topologies with eigenvalues located in a certain range. The proposed method can also ensure robustness performance and disturbance attenuation ability for the closed-loop platoon system. Hardware-in-the-loop tests are performed to validate the effectiveness of our method.

Spectrum of walk matrix for Koch network and its application

NASA Astrophysics Data System (ADS)

Xie, Pinchen; Lin, Yuan; Zhang, Zhongzhi

2015-06-01

Various structural and dynamical properties of a network are encoded in the eigenvalues of walk matrix describing random walks on the network. In this paper, we study the spectra of walk matrix of the Koch network, which displays the prominent scale-free and small-world features. Utilizing the particular architecture of the network, we obtain all the eigenvalues and their corresponding multiplicities. Based on the link between the eigenvalues of walk matrix and random target access time defined as the expected time for a walker going from an arbitrary node to another one selected randomly according to the steady-state distribution, we then derive an explicit solution to the random target access time for random walks on the Koch network. Finally, we corroborate our computation for the eigenvalues by enumerating spanning trees in the Koch network, using the connection governing eigenvalues and spanning trees, where a spanning tree of a network is a subgraph of the network, that is, a tree containing all the nodes.

Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements

NASA Astrophysics Data System (ADS)

Wu, Sheng-Jhih; Chu, Moody T.

2017-08-01

An inverse eigenvalue problem usually entails two constraints, one conditioned upon the spectrum and the other on the structure. This paper investigates the problem where triple constraints of eigenvalues, singular values, and diagonal entries are imposed simultaneously. An approach combining an eclectic mix of skills from differential geometry, optimization theory, and analytic gradient flow is employed to prove the solvability of such a problem. The result generalizes the classical Mirsky, Sing-Thompson, and Weyl-Horn theorems concerning the respective majorization relationships between any two of the arrays of main diagonal entries, eigenvalues, and singular values. The existence theory fills a gap in the classical matrix theory. The problem might find applications in wireless communication and quantum information science. The technique employed can be implemented as a first-step numerical method for constructing the matrix. With slight modification, the approach might be used to explore similar types of inverse problems where the prescribed entries are at general locations.

A direct potential fitting RKR method: Semiclassical vs. quantal comparisons

NASA Astrophysics Data System (ADS)

Tellinghuisen, Joel

2016-12-01

Quantal and semiclassical (SC) eigenvalues are compared for three diatomic molecular potential curves: the X state of CO, the X state of Rb2, and the A state of I2. The comparisons show higher levels of agreement than generally recognized, when the SC calculations incorporate a quantum defect correction to the vibrational quantum number, in keeping with the Kaiser modification. One particular aspect of this is better agreement between quantal and SC estimates of the zero-point vibrational energy, supporting the need for the Y00 correction in this context. The pursuit of a direct-potential-fitting (DPF) RKR method is motivated by the notion that some of the limitations of RKR potentials may be innate, from their generation by an exact inversion of approximate quantities: the vibrational energy Gυ and rotational constant Bυ from least-squares analysis of spectroscopic data. In contrast, the DPF RKR method resembles the quantal DPF methods now increasingly used to analyze diatomic spectral data, but with the eigenvalues obtained from SC phase integrals. Application of this method to the analysis of 9500 assigned lines in the I2A ← X spectrum fails to alter the quantal-SC disparities found for the A-state RKR curve from a previous analysis. On the other hand, the SC method can be much faster than the quantal method in exploratory work with different potential functions, where it is convenient to use finite-difference methods to evaluate the partial derivatives required in nonlinear fitting.

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.

Eigenvectors determination of the ribosome dynamics model during mRNA translation using the Kleene Star algorithm

NASA Astrophysics Data System (ADS)

Ernawati; Carnia, E.; Supriatna, A. K.

2018-03-01

Eigenvalues and eigenvectors in max-plus algebra have the same important role as eigenvalues and eigenvectors in conventional algebra. In max-plus algebra, eigenvalues and eigenvectors are useful for knowing dynamics of the system such as in train system scheduling, scheduling production systems and scheduling learning activities in moving classes. In the translation of proteins in which the ribosome move uni-directionally along the mRNA strand to recruit the amino acids that make up the protein, eigenvalues and eigenvectors are used to calculate protein production rates and density of ribosomes on the mRNA. Based on this, it is important to examine the eigenvalues and eigenvectors in the process of protein translation. In this paper an eigenvector formula is given for a ribosome dynamics during mRNA translation by using the Kleene star algorithm in which the resulting eigenvector formula is simpler and easier to apply to the system than that introduced elsewhere. This paper also discusses the properties of the matrix {B}λ \\otimes n of model. Among the important properties, it always has the same elements in the first column for n = 1, 2,… if the eigenvalue is the time of initiation, λ = τin , and the column is the eigenvector of the model corresponding to λ.

Eigenvalue Attraction

NASA Astrophysics Data System (ADS)

Movassagh, Ramis

2016-02-01

We prove that the complex conjugate (c.c.) eigenvalues of a smoothly varying real matrix attract (Eq. 15). We offer a dynamical perspective on the motion and interaction of the eigenvalues in the complex plane, derive their governing equations and discuss applications. C.c. pairs closest to the real axis, or those that are ill-conditioned, attract most strongly and can collide to become exactly real. As an application we consider random perturbations of a fixed matrix M. If M is Normal, the total expected force on any eigenvalue is shown to be only the attraction of its c.c. (Eq. 24) and when M is circulant the strength of interaction can be related to the power spectrum of white noise. We extend this by calculating the expected force (Eq. 41) for real stochastic processes with zero-mean and independent intervals. To quantify the dominance of the c.c. attraction, we calculate the variance of other forces. We apply the results to the Hatano-Nelson model and provide other numerical illustrations. It is our hope that the simple dynamical perspective herein might help better understanding of the aggregation and low density of the eigenvalues of real random matrices on and near the real line respectively. In the appendix we provide a Matlab code for plotting the trajectories of the eigenvalues.

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.

Market Correlation Structure Changes Around the Great Crash: A Random Matrix Theory Analysis of the Chinese Stock Market

NASA Astrophysics Data System (ADS)

Han, Rui-Qi; Xie, Wen-Jie; Xiong, Xiong; Zhang, Wei; Zhou, Wei-Xing

The correlation structure of a stock market contains important financial contents, which may change remarkably due to the occurrence of financial crisis. We perform a comparative analysis of the Chinese stock market around the occurrence of the 2008 crisis based on the random matrix analysis of high-frequency stock returns of 1228 Chinese stocks. Both raw correlation matrix and partial correlation matrix with respect to the market index in two time periods of one year are investigated. We find that the Chinese stocks have stronger average correlation and partial correlation in 2008 than in 2007 and the average partial correlation is significantly weaker than the average correlation in each period. Accordingly, the largest eigenvalue of the correlation matrix is remarkably greater than that of the partial correlation matrix in each period. Moreover, each largest eigenvalue and its eigenvector reflect an evident market effect, while other deviating eigenvalues do not. We find no evidence that deviating eigenvalues contain industrial sectorial information. Surprisingly, the eigenvectors of the second largest eigenvalues in 2007 and of the third largest eigenvalues in 2008 are able to distinguish the stocks from the two exchanges. We also find that the component magnitudes of the some largest eigenvectors are proportional to the stocks’ capitalizations.

A comparison of acceleration methods for solving the neutron transport k-eigenvalue problem

NASA Astrophysics Data System (ADS)

Willert, Jeffrey; Park, H.; Knoll, D. A.

2014-10-01

Over the past several years a number of papers have been written describing modern techniques for numerically computing the dominant eigenvalue of the neutron transport criticality problem. These methods fall into two distinct categories. The first category of methods rewrite the multi-group k-eigenvalue problem as a nonlinear system of equations and solve the resulting system using either a Jacobian-Free Newton-Krylov (JFNK) method or Nonlinear Krylov Acceleration (NKA), a variant of Anderson Acceleration. These methods are generally successful in significantly reducing the number of transport sweeps required to compute the dominant eigenvalue. The second category of methods utilize Moment-Based Acceleration (or High-Order/Low-Order (HOLO) Acceleration). These methods solve a sequence of modified diffusion eigenvalue problems whose solutions converge to the solution of the original transport eigenvalue problem. This second class of methods is, in our experience, always superior to the first, as most of the computational work is eliminated by the acceleration from the LO diffusion system. In this paper, we review each of these methods. Our computational results support our claim that the choice of which nonlinear solver to use, JFNK or NKA, should be secondary. The primary computational savings result from the implementation of a HOLO algorithm. We display computational results for a series of challenging multi-dimensional test problems.

Boundary crisis for degenerate singular cycles

NASA Astrophysics Data System (ADS)

Lohse, Alexander; Rodrigues, Alexandre

2017-06-01

The term boundary crisis refers to the destruction or creation of a chaotic attractor when parameters vary. The locus of a boundary crisis may contain regions of positive Lebesgue measure marking the transition from regular dynamics to the chaotic regime. This article investigates the dynamics occurring near a heteroclinic cycle involving a hyperbolic equilibrium point E and a hyperbolic periodic solution P, such that the connection from E to P is of codimension one and the connection from P to E occurs at a quadratic tangency (also of codimension one). We study these cycles as organizing centers of two-parameter bifurcation scenarios and, depending on properties of the transition maps, we find different types of shift dynamics that appear near the cycle. Breaking one or both of the connections we further explore the bifurcation diagrams previously begun by other authors. In particular, we identify the region of crisis near the cycle, by giving information on multipulse homoclinic solutions to E and P as well as multipulse heteroclinic tangencies from P to E, and bifurcating periodic solutions, giving partial answers to the problems (Q1)-(Q3) of Knobloch (2008 Nonlinearity 21 45-60). Throughout our analysis, we focus on the case where E has real eigenvalues and P has positive Floquet multipliers.

Accelerating large scale Kohn-Sham density functional theory calculations with semi-local functionals and hybrid functionals

NASA Astrophysics Data System (ADS)

Lin, Lin

The computational cost of standard Kohn-Sham density functional theory (KSDFT) calculations scale cubically with respect to the system size, which limits its use in large scale applications. In recent years, we have developed an alternative procedure called the pole expansion and selected inversion (PEXSI) method. The PEXSI method solves KSDFT without solving any eigenvalue and eigenvector, and directly evaluates physical quantities including electron density, energy, atomic force, density of states, and local density of states. The overall algorithm scales as at most quadratically for all materials including insulators, semiconductors and the difficult metallic systems. The PEXSI method can be efficiently parallelized over 10,000 - 100,000 processors on high performance machines. The PEXSI method has been integrated into a number of community electronic structure software packages such as ATK, BigDFT, CP2K, DGDFT, FHI-aims and SIESTA, and has been used in a number of applications with 2D materials beyond 10,000 atoms. The PEXSI method works for LDA, GGA and meta-GGA functionals. The mathematical structure for hybrid functional KSDFT calculations is significantly different. I will also discuss recent progress on using adaptive compressed exchange method for accelerating hybrid functional calculations. DOE SciDAC Program, DOE CAMERA Program, LBNL LDRD, Sloan Fellowship.

Ground-state-entanglement bound for quantum energy teleportation of general spin-chain models

NASA Astrophysics Data System (ADS)

Hotta, Masahiro

2013-03-01

Many-body quantum systems in the ground states have zero-point energy due to the uncertainty relation. In many cases, the system in the ground state accompanies spatially entangled energy density fluctuation via the noncommutativity of the energy density operators, though the total energy takes a fixed value, i.e., the lowest eigenvalue of the Hamiltonian. Quantum energy teleportation (QET) is a protocol for the extraction of the zero-point energy out of one subsystem using information of a remote measurement of another subsystem. From an operational viewpoint of protocol users, QET can be regarded as an effective rapid energy transportation without breaking all physical laws, including causality and local energy conservation. In the protocol, the ground-state entanglement plays a crucial role. In this paper, we show analytically for a general class of spin-chain systems that the entanglement entropy is lower bounded by a positive quadratic function of the teleported energy between the regions of a QET protocol. This supports a general conjecture that ground-state entanglement is an evident physical resource for energy transportation in the context of QET. The result may also deepen our understanding of the energy density fluctuation in condensed-matter systems from a perspective of quantum information theory.

Growth mechanisms of perturbations in boundary layers over a compliant wall

NASA Astrophysics Data System (ADS)

Malik, M.; Skote, Martin; Bouffanais, Roland

2018-01-01

The temporal modal and nonmodal growth of three-dimensional perturbations in the boundary layer flow over an infinite compliant flat wall is considered. Using a wall-normal velocity and wall-normal vorticity formalism, the dynamic boundary condition at the compliant wall admits a linear dependence on the eigenvalue parameter, as compared to a quadratic one in the canonical formulation of the problem. As a consequence, the continuous spectrum is accurately obtained. This enables us to effectively filter the pseudospectra, which is a prerequisite to the transient growth analysis. An energy-budget analysis for the least-decaying hydroelastic (static divergence, traveling wave flutter, and near-stationary transitional) and Tollmien-Schlichting modes in the parameter space reveals the primary routes of energy flow. Moreover, the maximum transient growth rate increases more slowly with the Reynolds number than for the solid wall case. The slowdown is due to a complex dependence of the wall-boundary condition with the Reynolds number, which translates into a transition of the fluid-solid interaction from a two-way to a one-way coupling. Unlike the solid-wall case, viscosity plays a pivotal role in the transient growth. The initial and optimal perturbations are compared with the boundary layer flow over a solid wall; differences and similarities are discussed.

Changes in diffusion tensor imaging (DTI) eigenvalues of skeletal muscle due to hybrid exercise training.

PubMed

Okamoto, Yoshikazu; Kemp, Graham J; Isobe, Tomonori; Sato, Eisuke; Hirano, Yuji; Shoda, Junichi; Minami, Manabu

2014-12-01

Several studies have proposed the cell membrane as the main water diffusion restricting factor in the skeletal muscle cell. We sought to establish whether a particular form of exercise training (which is likely to affect only intracellular components) could affect water diffusion. The purpose of this study is to characterise prospectively the changes in diffusion tensor imaging (DTI) eigenvalues of thigh muscle resulting from hybrid training (HYBT) in patients with non-alcoholic fatty liver disease (NAFLD). Twenty-one NAFLD patients underwent HYBT for 30 minutes per day, twice a week for 6 months. Patients were scanned using DTI of the thigh pre- and post-HYBT. Fractional anisotropy (FA), apparent diffusion coefficient (ADC), the three eigenvalues lambda 1 (λ1), λ2, λ3, and the maximal cross sectional area (CSA) were measured in bilateral thigh muscles: knee flexors (biceps femoris (BF), semitendinosus (ST), semimembranous (SM)) and knee extensors (medial vastus (MV), intermediate vastus (IV), lateral vastus (LV), and rectus femoris (RF)), and compared pre- and post-HYBT by paired t-test. Muscle strength of extensors (P<0.01), but not flexors, increased significantly post-HYBT. For FA, ADC and eigenvalues, the overall picture was of increase. Some (P<0.05 in λ2 and P<0.01 in λ1) eigenvalues of flexors and all (λ1-λ3) eigenvalues of extensors increased significantly (P<0.01) post-HYBT. HYBT increased all 3 eigenvalues. We suggest this might be caused by enlargement of muscle intracellular space. Copyright © 2014 Elsevier Inc. All rights reserved.

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

Algorithm-Eigenvalue Estimation of Hyperspectral Wishart Covariance Matrices from a Limited Number of Samples

DTIC Science & Technology

2015-03-01

ALGORITHM—EIGENVALUE ESTIMATION OF HYPERSPECTRAL WISHART COVARIANCE MATRICES FROM A LIMITED NUMBER OF SAMPLES ECBC-TN-067 Avishai Ben- David ...NUMBER 6. AUTHOR(S) Ben- David , Avishai (ECBC) and Davidson, Charles E. (STC) 5d. PROJECT NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7...and published by Avishai Ben- David and Charles E. Davidson (Eigenvalue Estimation of Hyperspectral WishartCovariance Matrices from Limited Number of

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.

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

Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices

NASA Astrophysics Data System (ADS)

Böttcher, A.; Bogoya, J. M.; Grudsky, S. M.; Maximenko, E. A.

2017-11-01

Analysis of the asymptotic behaviour of the spectral characteristics of Toeplitz matrices as the dimension of the matrix tends to infinity has a history of over 100 years. For instance, quite a number of versions of Szegő's theorem on the asymptotic behaviour of eigenvalues and of the so-called strong Szegő theorem on the asymptotic behaviour of the determinants of Toeplitz matrices are known. Starting in the 1950s, the asymptotics of the maximum and minimum eigenvalues were actively investigated. However, investigation of the individual asymptotics of all the eigenvalues and eigenvectors of Toeplitz matrices started only quite recently: the first papers on this subject were published in 2009-2010. A survey of this new field is presented here. Bibliography: 55 titles.

The Impact of the Network Topology on the Viral Prevalence: A Node-Based Approach

PubMed Central

Yang, Lu-Xing; Draief, Moez; Yang, Xiaofan

2015-01-01

This paper addresses the impact of the structure of the viral propagation network on the viral prevalence. For that purpose, a new epidemic model of computer virus, known as the node-based SLBS model, is proposed. Our analysis shows that the maximum eigenvalue of the underlying network is a key factor determining the viral prevalence. Specifically, the value range of the maximum eigenvalue is partitioned into three subintervals: viruses tend to extinction very quickly or approach extinction or persist depending on into which subinterval the maximum eigenvalue of the propagation network falls. Consequently, computer virus can be contained by adjusting the propagation network so that its maximum eigenvalue falls into the desired subinterval. PMID:26222539

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.

Eigentime identities for on weighted polymer networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Tang, Hualong; Zou, Jiahui; He, Di; Sun, Yu; Su, Weiyi

2018-01-01

In this paper, we first analytically calculate the eigenvalues of the transition matrix of a structure with very complex architecture and their multiplicities. We call this structure polymer network. Based on the eigenvalues obtained in the iterative manner, we then calculate the eigentime identity. We highlight two scaling behaviors (logarithmic and linear) for this quantity, strongly depending on the value of the weight factor. Finally, by making use of the obtained eigenvalues, we determine the weighted counting of spanning trees.

A New Measure of Wireless Network Connectivity

DTIC Science & Technology

2014-10-31

matrix QG. From Lemma 1, QG is a non-zero nonnegative matrix. Thus from the Perron - Frobenius Theorem, [24], its largest magni- tude eigenvalue, known as...the Perron - Frobenius eigenvalue is real and positive. Further as QG is symmetric, all its eigenval- ues are real, and its largest magnitude...eigenvalue λmax(QG) is also its largest singular value. Also from the Perron - Frobenius Theorem, should the network be connected, i.e. QG is positive as opposed

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.

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

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).

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

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

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.

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.

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.

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 Control Law Design Method Facilitating Control Power, Robustness, Agility, and Flying Qualities Tradeoffs: CRAFT

NASA Technical Reports Server (NTRS)

Murphy, Patrick C.; Davidson, John B.

1998-01-01

A multi-input, multi-output control law design methodology, named "CRAFT", is presented. CRAFT stands for the design objectives addressed, namely, Control power, Robustness, Agility, and Flying Qualities Tradeoffs. The methodology makes use of control law design metrics from each of the four design objective areas. It combines eigenspace assignment, which allows for direct specification of eigenvalues and eigenvectors, with a graphical approach for representing the metrics that captures numerous design goals in one composite illustration. Sensitivity of the metrics to eigenspace choice is clearly displayed, enabling the designer to assess the cost of design tradeoffs. This approach enhances the designer's ability to make informed design tradeoffs and to reach effective final designs. An example of the CRAFT methodology applied to an advanced experimental fighter and discussion of associated design issues are provided.

Experimental feedback linearisation of a vibrating system with a non-smooth nonlinearity

NASA Astrophysics Data System (ADS)

Lisitano, D.; Jiffri, S.; Bonisoli, E.; Mottershead, J. E.

2018-03-01

Input-output partial feedback linearisation is demonstrated experimentally for the first time on a system with non-smooth nonlinearity, a laboratory three degrees of freedom lumped mass system with a piecewise-linear spring. The output degree of freedom is located away from the nonlinearity so that the partial feedback linearisation possesses nonlinear internal dynamics. The dynamic behaviour of the linearised part is specified by eigenvalue assignment and an investigation of the zero dynamics is carried out to confirm stability of the overall system. A tuned numerical model is developed for use in the controller and to produce numerical outputs for comparison with experimental closed-loop results. A new limitation of the feedback linearisation method is discovered in the case of lumped mass systems - that the input and output must share the same degrees of freedom.

Method for computing self-consistent solution in a gun code

DOEpatents

Nelson, Eric M

2014-09-23

Complex gun code computations can be made to converge more quickly based on a selection of one or more relaxation parameters. An eigenvalue analysis is applied to error residuals to identify two error eigenvalues that are associated with respective error residuals. Relaxation values can be selected based on these eigenvalues so that error residuals associated with each can be alternately reduced in successive iterations. In some examples, relaxation values that would be unstable if used alone can be used.

PT-symmetric eigenvalues for homogeneous potentials

NASA Astrophysics Data System (ADS)

Eremenko, Alexandre; Gabrielov, Andrei

2018-05-01

We consider one-dimensional Schrödinger equations with potential x2M(ix)ɛ, where M ≥ 1 is an integer and ɛ is real, under appropriate parity and time (PT)-symmetric boundary conditions. We prove the phenomenon which was discovered by Bender and Boettcher by numerical computation: as ɛ changes, the real spectrum suddenly becomes non-real in the sense that all but finitely many eigenvalues become non-real. We find the limit arguments of these non-real eigenvalues E as E → ∞.

Spectral properties of Google matrix of Wikipedia and other networks

NASA Astrophysics Data System (ADS)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2013-05-01

We study the properties of eigenvalues and eigenvectors of the Google matrix of the Wikipedia articles hyperlink network and other real networks. With the help of the Arnoldi method, we analyze the distribution of eigenvalues in the complex plane and show that eigenstates with significant eigenvalue modulus are located on well defined network communities. We also show that the correlator between PageRank and CheiRank vectors distinguishes different organizations of information flow on BBC and Le Monde web sites.

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.

The Factorability of Quadratics: Motivation for More Techniques

ERIC Educational Resources Information Center

Bosse, Michael J.; Nandakumar, N. R.

2005-01-01

Typically, secondary and college algebra students attempt to utilize either completing the square or the quadratic formula as techniques to solve a quadratic equation only after frustration with factoring has arisen. While both completing the square and the quadratic formula are techniques which can determine solutions for all quadratic equations,…

A control system design approach for flexible spacecraft

NASA Technical Reports Server (NTRS)

Silverberg, L. M.

1985-01-01

A control system design approach for flexible spacecraft is presented. The control system design is carried out in two steps. The first step consists of determining the ideal control system in terms of a desirable dynamic performance. The second step consists of designing a control system using a limited number of actuators that possess a dynamic performance that is close to the ideal dynamic performance. The effects of using a limited number of actuators is that the actual closed-loop eigenvalues differ from the ideal closed-loop eigenvalues. A method is presented to approximate the actual closed-loop eigenvalues so that the calculation of the actual closed-loop eigenvalues can be avoided. Depending on the application, it also may be desirable to apply the control forces as impulses. The effect of digitizing the control to produce the appropriate impulses is also examined.

Fine structure of spectral properties for random correlation matrices: An application to financial markets

NASA Astrophysics Data System (ADS)

Livan, Giacomo; Alfarano, Simone; Scalas, Enrico

2011-07-01

We study some properties of eigenvalue spectra of financial correlation matrices. In particular, we investigate the nature of the large eigenvalue bulks which are observed empirically, and which have often been regarded as a consequence of the supposedly large amount of noise contained in financial data. We challenge this common knowledge by acting on the empirical correlation matrices of two data sets with a filtering procedure which highlights some of the cluster structure they contain, and we analyze the consequences of such filtering on eigenvalue spectra. We show that empirically observed eigenvalue bulks emerge as superpositions of smaller structures, which in turn emerge as a consequence of cross correlations between stocks. We interpret and corroborate these findings in terms of factor models, and we compare empirical spectra to those predicted by random matrix theory for such models.

The Theory of Quantized Fields. III

DOE R&D Accomplishments Database

Schwinger, J.

1953-05-01

In this paper we discuss the electromagnetic field, as perturbed by a prescribed current. All quantities of physical interest in various situations, eigenvalues, eigenfunctions, and transformation probabilities, are derived from a general transformation function which is expressed in a non-Hermitian representation. The problems treated are: the determination of the energy-momentum eigenvalues and eigenfunctions for the isolated electromagnetic field, and the energy eigenvalues and eigenfunctions for the field perturbed by a time-independent current that departs from zero only within a finite time interval, and for a time-dependent current that assumes non-vanishing time-independent values initially and finally. The results are applied in a discussion of the intra-red catastrophe and of the adiabatic theorem. It is shown how the latter can be exploited to give a uniform formulation for all problems requiring the evaluation of transition probabilities or eigenvalue displacements.

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.

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.

A new method for computation of eigenvector derivatives with distinct and repeated eigenvalues in structural dynamic analysis

NASA Astrophysics Data System (ADS)

Li, Zhengguang; Lai, Siu-Kai; Wu, Baisheng

2018-07-01

Determining eigenvector derivatives is a challenging task due to the singularity of the coefficient matrices of the governing equations, especially for those structural dynamic systems with repeated eigenvalues. An effective strategy is proposed to construct a non-singular coefficient matrix, which can be directly used to obtain the eigenvector derivatives with distinct and repeated eigenvalues. This approach also has an advantage that only requires eigenvalues and eigenvectors of interest, without solving the particular solutions of eigenvector derivatives. The Symmetric Quasi-Minimal Residual (SQMR) method is then adopted to solve the governing equations, only the existing factored (shifted) stiffness matrix from an iterative eigensolution such as the subspace iteration method or the Lanczos algorithm is utilized. The present method can deal with both cases of simple and repeated eigenvalues in a unified manner. Three numerical examples are given to illustrate the accuracy and validity of the proposed algorithm. Highly accurate approximations to the eigenvector derivatives are obtained within a few iteration steps, making a significant reduction of the computational effort. This method can be incorporated into a coupled eigensolver/derivative software module. In particular, it is applicable for finite element models with large sparse matrices.

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.

Eigenvalue Detonation of Combined Effects Aluminized Explosives

NASA Astrophysics Data System (ADS)

Capellos, C.; Baker, E. L.; Nicolich, S.; Balas, W.; Pincay, J.; Stiel, L. I.

2007-12-01

Theory and performance for recently developed combined—effects aluminized explosives are presented. Our recently developed combined-effects aluminized explosives (PAX-29C, PAX-30, PAX-42) are capable of achieving excellent metal pushing, as well as high blast energies. Metal pushing capability refers to the early volume expansion work produced during the first few volume expansions associated with cylinder and wall velocities and Gurney energies. Eigenvalue detonation explains the observed detonation states achieved by these combined effects explosives. Cylinder expansion data and thermochemical calculations (JAGUAR and CHEETAH) verify the eigenvalue detonation behavior.

Dimension from covariance matrices.

PubMed

Carroll, T L; Byers, J M

2017-02-01

We describe a method to estimate embedding dimension from a time series. This method includes an estimate of the probability that the dimension estimate is valid. Such validity estimates are not common in algorithms for calculating the properties of dynamical systems. The algorithm described here compares the eigenvalues of covariance matrices created from an embedded signal to the eigenvalues for a covariance matrix of a Gaussian random process with the same dimension and number of points. A statistical test gives the probability that the eigenvalues for the embedded signal did not come from the Gaussian random process.

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.

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.

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.

Eigenvalue sensitivity analysis of planar frames with variable joint and support locations

NASA Technical Reports Server (NTRS)

Chuang, Ching H.; Hou, Gene J. W.

1991-01-01

Two sensitivity equations are derived in this study based upon the continuum approach for eigenvalue sensitivity analysis of planar frame structures with variable joint and support locations. A variational form of an eigenvalue equation is first derived in which all of the quantities are expressed in the local coordinate system attached to each member. Material derivative of this variational equation is then sought to account for changes in member's length and orientation resulting form the perturbation of joint and support locations. Finally, eigenvalue sensitivity equations are formulated in either domain quantities (by the domain method) or boundary quantities (by the boundary method). It is concluded that the sensitivity equation derived by the boundary method is more efficient in computation but less accurate than that of the domain method. Nevertheless, both of them in terms of computational efficiency are superior to the conventional direct differentiation method and the finite difference method.

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.

Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects

NASA Astrophysics Data System (ADS)

Castellano, Claudio; Pastor-Satorras, Romualdo

2017-10-01

The largest eigenvalue of a network's adjacency matrix and its associated principal eigenvector are key elements for determining the topological structure and the properties of dynamical processes mediated by it. We present a physically grounded expression relating the value of the largest eigenvalue of a given network to the largest eigenvalue of two network subgraphs, considered as isolated: the hub with its immediate neighbors and the densely connected set of nodes with maximum K -core index. We validate this formula by showing that it predicts, with good accuracy, the largest eigenvalue of a large set of synthetic and real-world topologies. We also present evidence of the consequences of these findings for broad classes of dynamics taking place on the networks. As a by-product, we reveal that the spectral properties of heterogeneous networks built according to the linear preferential attachment model are qualitatively different from those of their static counterparts.

A comparison of maximum likelihood and other estimators of eigenvalues from several correlated Monte Carlo samples

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

Beer, M.

1980-12-01

The maximum likelihood method for the multivariate normal distribution is applied to the case of several individual eigenvalues. Correlated Monte Carlo estimates of the eigenvalue are assumed to follow this prescription and aspects of the assumption are examined. Monte Carlo cell calculations using the SAM-CE and VIM codes for the TRX-1 and TRX-2 benchmark reactors, and SAM-CE full core results are analyzed with this method. Variance reductions of a few percent to a factor of 2 are obtained from maximum likelihood estimation as compared with the simple average and the minimum variance individual eigenvalue. The numerical results verify that themore » use of sample variances and correlation coefficients in place of the corresponding population statistics still leads to nearly minimum variance estimation for a sufficient number of histories and aggregates.« less

Intrinsic character of Stokes matrices

NASA Astrophysics Data System (ADS)

Gagnon, Jean-François; Rousseau, Christiane

2017-02-01

Two germs of linear analytic differential systems x k + 1Y‧ = A (x) Y with a non-resonant irregular singularity are analytically equivalent if and only if they have the same eigenvalues and equivalent collections of Stokes matrices. The Stokes matrices are the transition matrices between sectors on which the system is analytically equivalent to its formal normal form. Each sector contains exactly one separating ray for each pair of eigenvalues. A rotation in S allows supposing that R+ lies in the intersection of two sectors. Reordering of the coordinates of Y allows ordering the real parts of the eigenvalues, thus yielding triangular Stokes matrices. However, the choice of the rotation in x is not canonical. In this paper we establish how the collection of Stokes matrices depends on this rotation, and hence on a chosen order of the projection of the eigenvalues on a line through the origin.

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.

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.

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.

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

Dimensionality of genomic information and performance of the Algorithm for Proven and Young for different livestock species.

PubMed

Pocrnic, Ivan; Lourenco, Daniela A L; Masuda, Yutaka; Misztal, Ignacy

2016-10-31

A genomic relationship matrix (GRM) can be inverted efficiently with the Algorithm for Proven and Young (APY) through recursion on a small number of core animals. The number of core animals is theoretically linked to effective population size (N e ). In a simulation study, the optimal number of core animals was equal to the number of largest eigenvalues of GRM that explained 98% of its variation. The purpose of this study was to find the optimal number of core animals and estimate N e for different species. Datasets included phenotypes, pedigrees, and genotypes for populations of Holstein, Jersey, and Angus cattle, pigs, and broiler chickens. The number of genotyped animals varied from 15,000 for broiler chickens to 77,000 for Holsteins, and the number of single-nucleotide polymorphisms used for genomic prediction varied from 37,000 to 61,000. Eigenvalue decomposition of the GRM for each population determined numbers of largest eigenvalues corresponding to 90, 95, 98, and 99% of variation. The number of eigenvalues corresponding to 90% (98%) of variation was 4527 (14,026) for Holstein, 3325 (11,500) for Jersey, 3654 (10,605) for Angus, 1239 (4103) for pig, and 1655 (4171) for broiler chicken. Each trait in each species was analyzed using the APY inverse of the GRM with randomly selected core animals, and their number was equal to the number of largest eigenvalues. Realized accuracies peaked with the number of core animals corresponding to 98% of variation for Holstein and Jersey and closer to 99% for other breed/species. N e was estimated based on comparisons of eigenvalue decomposition in a simulation study. Assuming a genome length of 30 Morgan, N e was equal to 149 for Holsteins, 101 for Jerseys, 113 for Angus, 32 for pigs, and 44 for broilers. Eigenvalue profiles of GRM for common species are similar to those in simulation studies although they are affected by number of genotyped animals and genotyping quality. For all investigated species, the APY required less than 15,000 core animals. Realized accuracies were equal or greater with the APY inverse than with regular inversion. Eigenvalue analysis of GRM can provide a realistic estimate of N e .

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.

Constructing 1/omegaalpha noise from reversible Markov chains.

PubMed

Erland, Sveinung; Greenwood, Priscilla E

2007-09-01

This paper gives sufficient conditions for the output of 1/omegaalpha noise from reversible Markov chains on finite state spaces. We construct several examples exhibiting this behavior in a specified range of frequencies. We apply simple representations of the covariance function and the spectral density in terms of the eigendecomposition of the probability transition matrix. The results extend to hidden Markov chains. We generalize the results for aggregations of AR1-processes of C. W. J. Granger [J. Econometrics 14, 227 (1980)]. Given the eigenvalue function, there is a variety of ways to assign values to the states such that the 1/omegaalpha condition is satisfied. We show that a random walk on a certain state space is complementary to the point process model of 1/omega noise of B. Kaulakys and T. Meskauskas [Phys. Rev. E 58, 7013 (1998)]. Passing to a continuous state space, we construct 1/omegaalpha noise which also has a long memory.

On the placement of active members in adaptive truss structures for vibration control

NASA Technical Reports Server (NTRS)

Lu, L.-Y.; Utku, S.; Wada, B. K.

1992-01-01

The problem of optimal placement of active members which are used for vibration control in adaptive truss structures is investigated. The control scheme is based on the method of eigenvalue assignment as a means of shaping the transient response of the controlled adaptive structures, and the minimization of required control action is considered as the optimization criterion. To this end, a performance index which measures the control strokes of active members is formulated in an efficient way. In order to reduce the computation burden, particularly for the case where the locations of active members have to be selected from a large set of available sites, several heuristic searching schemes are proposed for obtaining the near-optimal locations. The proposed schemes significantly reduce the computational complexity of placing multiple active members to the order of that when a single active member is placed.

Some Properties and Uses of Torsional Overlap Integrals

NASA Astrophysics Data System (ADS)

Mekhtiev, Mirza A.; Hougen, Jon T.

1998-01-01

The first diagonalization step in a rho-axis-method treatment of methyl-top internal rotation problems involves finding eigenvalues and eigenvectors of a torsional Hamiltonian, which depends on the rotational projection quantum numberKas a parameter. Traditionally the torsional quantum numbervt= 0, 1, 2···is assigned to eigenfunctions of givenKin order of increasing energy. In this paper we propose an alternative labeling scheme, using the torsional quantum numbervT, which is based on properties of theK-dependent torsional overlap integrals . In particular, the quantum numbervTis assigned in such a way that torsional wavefunctions |vT,K> vary as slowly as possible whenKchanges by unity. Roughly speaking,vT=vtfor torsional levels below the barrier, whereasvTis more closely related to the free-rotor quantum number for levels above the barrier. Because of the latter fact, we believevTwill in general be a physically more meaningful torsional quantum number for levels above the barrier. The usefulness of overlap integrals for qualitative prediction of torsion-rotation band intensities and for rationalizing the magnitudes of perturbations involving some excitation of the small-amplitude vibrations in an internal rotor problem is also discussed.

Complexity of Quantum Impurity Problems

NASA Astrophysics Data System (ADS)

Bravyi, Sergey; Gosset, David

2017-12-01

We give a quasi-polynomial time classical algorithm for estimating the ground state energy and for computing low energy states of quantum impurity models. Such models describe a bath of free fermions coupled to a small interacting subsystem called an impurity. The full system consists of n fermionic modes and has a Hamiltonian {H=H_0+H_{imp}}, where H 0 is quadratic in creation-annihilation operators and H imp is an arbitrary Hamiltonian acting on a subset of O(1) modes. We show that the ground energy of H can be approximated with an additive error {2^{-b}} in time {n^3 \\exp{[O(b^3)]}}. Our algorithm also finds a low energy state that achieves this approximation. The low energy state is represented as a superposition of {\\exp{[O(b^3)]}} fermionic Gaussian states. To arrive at this result we prove several theorems concerning exact ground states of impurity models. In particular, we show that eigenvalues of the ground state covariance matrix decay exponentially with the exponent depending very mildly on the spectral gap of H 0. A key ingredient of our proof is Zolotarev's rational approximation to the {√{x}} function. We anticipate that our algorithms may be used in hybrid quantum-classical simulations of strongly correlated materials based on dynamical mean field theory. We implemented a simplified practical version of our algorithm and benchmarked it using the single impurity Anderson model.

Seven Wonders of the Ancient and Modern Quadratic World.

ERIC Educational Resources Information Center

Taylor, Sharon E.; Mittag, Kathleen Cage

2001-01-01

Presents four methods for solving a quadratic equation using graphing calculator technology: (1) graphing with the CALC feature; (2) quadratic formula program; (3) table; and (4) solver. Includes a worksheet for a lab activity on factoring quadratic equations. (KHR)

On the time-weighted quadratic sum of linear discrete systems

NASA Technical Reports Server (NTRS)

Jury, E. I.; Gutman, S.

1975-01-01

A method is proposed for obtaining the time-weighted quadratic sum for linear discrete systems. The formula of the weighted quadratic sum is obtained from matrix z-transform formulation. In addition, it is shown that this quadratic sum can be derived in a recursive form for several useful weighted functions. The discussion presented parallels that of MacFarlane (1963) for weighted quadratic integral for linear continuous systems.

Eigenvalues of the Laplacian of a graph

NASA Technical Reports Server (NTRS)

Anderson, W. N., Jr.; Morley, T. D.

1971-01-01

Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta(G), is defined by Delta sub ii = degree of vertex i and Delta sub ij = -1 if there is an edge between vertex i and vertex j. The structure of the graph G is related to the eigenvalues of Delta(G); in particular, it is proved that all the eigenvalues of Delta(G) are nonnegative, less than or equal to the number of vertices, and less than or equal to twice the maximum vertex degree. Precise conditions for equality are given.

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.

A Novel Hyperbolization Procedure for The Two-Phase Six-Equation Flow Model

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

Samet Y. Kadioglu; Robert Nourgaliev; Nam Dinh

2011-10-01

We introduce a novel approach for the hyperbolization of the well-known two-phase six equation flow model. The six-equation model has been frequently used in many two-phase flow applications such as bubbly fluid flows in nuclear reactors. One major drawback of this model is that it can be arbitrarily non-hyperbolic resulting in difficulties such as numerical instability issues. Non-hyperbolic behavior can be associated with complex eigenvalues that correspond to characteristic matrix of the system. Complex eigenvalues are often due to certain flow parameter choices such as the definition of inter-facial pressure terms. In our method, we prevent the characteristic matrix receivingmore » complex eigenvalues by fine tuning the inter-facial pressure terms with an iterative procedure. In this way, the characteristic matrix possesses all real eigenvalues meaning that the characteristic wave speeds are all real therefore the overall two-phase flowmodel becomes hyperbolic. The main advantage of this is that one can apply less diffusive highly accurate high resolution numerical schemes that often rely on explicit calculations of real eigenvalues. We note that existing non-hyperbolic models are discretized mainly based on low order highly dissipative numerical techniques in order to avoid stability issues.« less

Emergent spectral properties of river network topology: an optimal channel network approach.

PubMed

Abed-Elmdoust, Armaghan; Singh, Arvind; Yang, Zong-Liang

2017-09-13

Characterization of river drainage networks has been a subject of research for many years. However, most previous studies have been limited to quantities which are loosely connected to the topological properties of these networks. In this work, through a graph-theoretic formulation of drainage river networks, we investigate the eigenvalue spectra of their adjacency matrix. First, we introduce a graph theory model for river networks and explore the properties of the network through its adjacency matrix. Next, we show that the eigenvalue spectra of such complex networks follow distinct patterns and exhibit striking features including a spectral gap in which no eigenvalue exists as well as a finite number of zero eigenvalues. We show that such spectral features are closely related to the branching topology of the associated river networks. In this regard, we find an empirical relation for the spectral gap and nullity in terms of the energy dissipation exponent of the drainage networks. In addition, the eigenvalue distribution is found to follow a finite-width probability density function with certain skewness which is related to the drainage pattern. Our results are based on optimal channel network simulations and validated through examples obtained from physical experiments on landscape evolution. These results suggest the potential of the spectral graph techniques in characterizing and modeling river networks.

Fourth-order convergence of a compact scheme for the one-dimensional biharmonic equation

NASA Astrophysics Data System (ADS)

Fishelov, D.; Ben-Artzi, M.; Croisille, J.-P.

2012-09-01

The convergence of a fourth-order compact scheme to the one-dimensional biharmonic problem is established in the case of general Dirichlet boundary conditions. The compact scheme invokes value of the unknown function as well as Pade approximations of its first-order derivative. Using the Pade approximation allows us to approximate the first-order derivative within fourth-order accuracy. However, although the truncation error of the discrete biharmonic scheme is of fourth-order at interior point, the truncation error drops to first-order at near-boundary points. Nonetheless, we prove that the scheme retains its fourth-order (optimal) accuracy. This is done by a careful inspection of the matrix elements of the discrete biharmonic operator. A number of numerical examples corroborate this effect. We also present a study of the eigenvalue problem uxxxx = νu. We compute and display the eigenvalues and the eigenfunctions related to the continuous and the discrete problems. By the positivity of the eigenvalues, one can deduce the stability of of the related time-dependent problem ut = -uxxxx. In addition, we study the eigenvalue problem uxxxx = νuxx. This is related to the stability of the linear time-dependent equation uxxt = νuxxxx. Its continuous and discrete eigenvalues and eigenfunction (or eigenvectors) are computed and displayed graphically.

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.

TIMEDELN: A programme for the detection and parametrization of overlapping resonances using the time-delay method

NASA Astrophysics Data System (ADS)

Little, Duncan A.; Tennyson, Jonathan; Plummer, Martin; Noble, Clifford J.; Sunderland, Andrew G.

2017-06-01

TIMEDELN implements the time-delay method of determining resonance parameters from the characteristic Lorentzian form displayed by the largest eigenvalues of the time-delay matrix. TIMEDELN constructs the time-delay matrix from input K-matrices and analyses its eigenvalues. This new version implements multi-resonance fitting and may be run serially or as a high performance parallel code with three levels of parallelism. TIMEDELN takes K-matrices from a scattering calculation, either read from a file or calculated on a dynamically adjusted grid, and calculates the time-delay matrix. This is then diagonalized, with the largest eigenvalue representing the longest time-delay experienced by the scattering particle. A resonance shows up as a characteristic Lorentzian form in the time-delay: the programme searches the time-delay eigenvalues for maxima and traces resonances when they pass through different eigenvalues, separating overlapping resonances. It also performs the fitting of the calculated data to the Lorentzian form and outputs resonance positions and widths. Any remaining overlapping resonances can be fitted jointly. The branching ratios of decay into the open channels can also be found. The programme may be run serially or in parallel with three levels of parallelism. The parallel code modules are abstracted from the main physics code and can be used independently.

THE EFFECTIVENESS OF QUADRATS FOR MEASURING VASCULAR PLANT DIVERSITY

EPA Science Inventory

Quadrats are widely used for measuring characteristics of vascular plant communities. It is well recognized that quadrat size affects measurements of frequency and cover. The ability of quadrats of varying sizes to adequately measure diversity has not been established. An exha...

The non-avian theropod quadrate I: standardized terminology with an overview of the anatomy and function

PubMed Central

Araújo, Ricardo; Mateus, Octávio

2015-01-01

The quadrate of reptiles and most other tetrapods plays an important morphofunctional role by allowing the articulation of the mandible with the cranium. In Theropoda, the morphology of the quadrate is particularly complex and varies importantly among different clades of non-avian theropods, therefore conferring a strong taxonomic potential. Inconsistencies in the notation and terminology used in discussions of the theropod quadrate anatomy have been noticed, including at least one instance when no less than eight different terms were given to the same structure. A standardized list of terms and notations for each quadrate anatomical entity is proposed here, with the goal of facilitating future descriptions of this important cranial bone. In addition, an overview of the literature on quadrate function and pneumaticity in non-avian theropods is presented, along with a discussion of the inferences that could be made from this research. Specifically, the quadrate of the large majority of non-avian theropods is akinetic but the diagonally oriented intercondylar sulcus of the mandibular articulation allowed both rami of the mandible to move laterally when opening the mouth in many of theropods. Pneumaticity of the quadrate is also present in most averostran clades and the pneumatic chamber—invaded by the quadrate diverticulum of the mandibular arch pneumatic system—was connected to one or several pneumatic foramina on the medial, lateral, posterior, anterior or ventral sides of the quadrate. PMID:26401455

XCOM intrinsic dimensionality for low-Z elements at diagnostic energies

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

Bornefalk, Hans

2012-02-15

Purpose: To determine the intrinsic dimensionality of linear attenuation coefficients (LACs) from XCOM for elements with low atomic number (Z = 1-20) at diagnostic x-ray energies (25-120 keV). H{sub 0}{sup q}, the hypothesis that the space of LACs is spanned by q bases, is tested for various q-values. Methods: Principal component analysis is first applied and the LACs are projected onto the first q principal component bases. The residuals of the model values vs XCOM data are determined for all energies and atomic numbers. Heteroscedasticity invalidates the prerequisite of i.i.d. errors necessary for bootstrapping residuals. Instead wild bootstrap is applied,more » which, by not mixing residuals, allows the effect of the non-i.i.d residuals to be reflected in the result. Credible regions for the eigenvalues of the correlation matrix for the bootstrapped LAC data are determined. If subsequent credible regions for the eigenvalues overlap, the corresponding principal component is not considered to represent true data structure but noise. If this happens for eigenvalues l and l + 1, for any l{<=}q, H{sub 0}{sup q} is rejected. Results: The largest value of q for which H{sub 0}{sup q} is nonrejectable at the 5%-level is q = 4. This indicates that the statistically significant intrinsic dimensionality of low-Z XCOM data at diagnostic energies is four. Conclusions: The method presented allows determination of the statistically significant dimensionality of any noisy linear subspace. Knowledge of such significant dimensionality is of interest for any method making assumptions on intrinsic dimensionality and evaluating results on noisy reference data. For LACs, knowledge of the low-Z dimensionality might be relevant when parametrization schemes are tuned to XCOM data. For x-ray imaging techniques based on the basis decomposition method (Alvarez and Macovski, Phys. Med. Biol. 21, 733-744, 1976), an underlying dimensionality of two is commonly assigned to the LAC of human tissue at diagnostic energies. The finding of a higher statistically significant dimensionality thus raises the question whether a higher assumed model dimensionality (now feasible with the advent of multibin x-ray systems) might also be practically relevant, i.e., if better tissue characterization results can be obtained.« less

On the Aharonov-Bohm Operators with Varying Poles: The Boundary Behavior of Eigenvalues

NASA Astrophysics Data System (ADS)

Noris, Benedetta; Nys, Manon; Terracini, Susanna

2015-11-01

We consider a magnetic Schrödinger operator with magnetic field concentrated at one point (the pole) of a domain and half integer circulation, and we focus on the behavior of Dirichlet eigenvalues as functions of the pole. Although the magnetic field vanishes almost everywhere, it is well known that it affects the operator at the spectral level (the Aharonov-Bohm effect, Phys Rev (2) 115:485-491, 1959). Moreover, the numerical computations performed in (Bonnaillie-Noël et al., Anal PDE 7(6):1365-1395, 2014; Noris and Terracini, Indiana Univ Math J 59(4):1361-1403, 2010) show a rather complex behavior of the eigenvalues as the pole varies in a planar domain. In this paper, in continuation of the analysis started in (Bonnaillie-Noël et al., Anal PDE 7(6):1365-1395, 2014; Noris and Terracini, Indiana Univ Math J 59(4):1361-1403, 2010), we analyze the relation between the variation of the eigenvalue and the nodal structure of the associated eigenfunctions. We deal with planar domains with Dirichlet boundary conditions and we focus on the case when the singular pole approaches the boundary of the domain: then, the operator loses its singular character and the k-th magnetic eigenvalue converges to that of the standard Laplacian. We can predict both the rate of convergence and whether the convergence happens from above or from below, in relation with the number of nodal lines of the k-th eigenfunction of the Laplacian. The proof relies on the variational characterization of eigenvalues, together with a detailed asymptotic analysis of the eigenfunctions, based on an Almgren-type frequency formula for magnetic eigenfunctions and on the blow-up technique.

Random matrix approach to cross correlations in financial data

NASA Astrophysics Data System (ADS)

Plerou, Vasiliki; Gopikrishnan, Parameswaran; Rosenow, Bernd; Amaral, Luís A.; Guhr, Thomas; Stanley, H. Eugene

2002-06-01

We analyze cross correlations between price fluctuations of different stocks using methods of random matrix theory (RMT). Using two large databases, we calculate cross-correlation matrices C of returns constructed from (i) 30-min returns of 1000 US stocks for the 2-yr period 1994-1995, (ii) 30-min returns of 881 US stocks for the 2-yr period 1996-1997, and (iii) 1-day returns of 422 US stocks for the 35-yr period 1962-1996. We test the statistics of the eigenvalues λi of C against a ``null hypothesis'' - a random correlation matrix constructed from mutually uncorrelated time series. We find that a majority of the eigenvalues of C fall within the RMT bounds [λ-,λ+] for the eigenvalues of random correlation matrices. We test the eigenvalues of C within the RMT bound for universal properties of random matrices and find good agreement with the results for the Gaussian orthogonal ensemble of random matrices-implying a large degree of randomness in the measured cross-correlation coefficients. Further, we find that the distribution of eigenvector components for the eigenvectors corresponding to the eigenvalues outside the RMT bound display systematic deviations from the RMT prediction. In addition, we find that these ``deviating eigenvectors'' are stable in time. We analyze the components of the deviating eigenvectors and find that the largest eigenvalue corresponds to an influence common to all stocks. Our analysis of the remaining deviating eigenvectors shows distinct groups, whose identities correspond to conventionally identified business sectors. Finally, we discuss applications to the construction of portfolios of stocks that have a stable ratio of risk to return.

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.

Elastic Model Transitions: A Hybrid Approach Utilizing Quadratic Inequality Constrained Least Squares (LSQI) and Direct Shape Mapping (DSM)

NASA Technical Reports Server (NTRS)

Hannan, Mike R.; Jurenko, Robert J.; Bush, Jason; Ottander, John

2014-01-01

A method for transitioning linear time invariant (LTI) models in time varying simulation is proposed that utilizes a hybrid approach for determining physical displacements by augmenting the original quadratically constrained least squares (LSQI) algorithm with Direct Shape Mapping (DSM) and modifying the energy constraints. The approach presented is applicable to simulation of the elastic behavior of launch vehicles and other structures that utilize discrete LTI finite element model (FEM) derived mode sets (eigenvalues and eigenvectors) that are propagated throughout time. The time invariant nature of the elastic data presents a problem of how to properly transition elastic states from the prior to the new model while preserving motion across the transition and ensuring there is no truncation or excitation of the system. A previous approach utilizes a LSQI algorithm with an energy constraint to effect smooth transitions between eigenvector sets with no requirement that the models be of similar dimension or have any correlation. This approach assumes energy is conserved across the transition, which results in significant non-physical transients due to changing quasi-steady state energy between mode sets, a phenomenon seen when utilizing a truncated mode set. The computational burden of simulating a full mode set is significant so a subset of modes is often selected to reduce run time. As a result of this truncation, energy between mode sets may not be constant and solutions across transitions could produce non-physical transients. In an effort to abate these transients an improved methodology was developed based on the aforementioned approach, but this new approach can handle significant changes in energy across mode set transitions. It is proposed that physical velocities due to elastic behavior be solved for using the LSQI algorithm, but solve for displacements using a two-step process that independently addresses the quasi-steady-state and non-steady-state contributions to the elastic displacement. For structures subject to large external forces, such as thrust or atmospheric drag, it is imperative to capture these forces when solving for elastic displacement. To simplify the mathematical formulation, assumptions are made regarding mass matrix normalization, constant external forcing, and constant viscous damping. These simplifications allow for direct solutions to the quasi-steady-state displacements through a process titled Direct Shape Mapping. DSM solves for the displacements using the eigenvalues of the elastic modes and the external forcing and returns a set of elastic displacements dictated by the eigenvectors of the post-transition mode set. For the non-steady-state contributions to displacement we formulate a LSQI problem that is constrained by energy of the non-steady state terms. The contributions from the quasi-steady-state and non-steady state solutions are then combined to obtain the physical displacements associated with the new set of eigenvectors. Results for the LSQI-DSM approach show significant reduction/complete removal of transients across mode set transitions while maintaining elastic motion from the prior state. For time propagation applications employing discrete elastic models that need to be transitioned in time and where running with full a full mode set is not feasible, the method developed offers a practical solution to simulating vehicle elasticity.

Quantum annealing for combinatorial clustering

NASA Astrophysics Data System (ADS)

Kumar, Vaibhaw; Bass, Gideon; Tomlin, Casey; Dulny, Joseph

2018-02-01

Clustering is a powerful machine learning technique that groups "similar" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum; however, the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small datasets. In order to circumvent this issue, cost function minima are found using popular local search-based heuristic approaches such as k-means and hierarchical clustering. Due to their greedy nature, such techniques do not guarantee that a global minimum will be found and can lead to sub-optimal clustering assignments. Other classes of global search-based techniques, such as simulated annealing, tabu search, and genetic algorithms, may offer better quality results but can be too time-consuming to implement. In this work, we describe how quantum annealing can be used to carry out clustering. We map the clustering objective to a quadratic binary optimization problem and discuss two clustering algorithms which are then implemented on commercially available quantum annealing hardware, as well as on a purely classical solver "qbsolv." The first algorithm assigns N data points to K clusters, and the second one can be used to perform binary clustering in a hierarchical manner. We present our results in the form of benchmarks against well-known k-means clustering and discuss the advantages and disadvantages of the proposed techniques.

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.

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

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.

Spectral analysis of Chinese language: Co-occurrence networks from four literary genres

NASA Astrophysics Data System (ADS)

Liang, Wei; Chen, Guanrong

2016-05-01

The eigenvalues and eigenvectors of the adjacency matrix of a network contain essential information about its topology. For each of the Chinese language co-occurrence networks constructed from four literary genres, i.e., essay, popular science article, news report, and novel, it is found that the largest eigenvalue depends on the network size N, the number of edges, the average shortest path length, and the clustering coefficient. Moreover, it is found that their node-degree distributions all follow a power-law. The number of different eigenvalues, Nλ, is found numerically to increase in the manner of Nλ ∝ log N for novel and Nλ ∝ N for the other three literary genres. An ;M; shape or a triangle-like distribution appears in their spectral densities. The eigenvector corresponding to the largest eigenvalue is mostly localized to a node with the largest degree. For the above observed phenomena, mathematical analysis is provided with interpretation from a linguistic perspective.

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

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

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

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.

A finite element algorithm for high-lying eigenvalues with Neumann and Dirichlet boundary conditions

NASA Astrophysics Data System (ADS)

Báez, G.; Méndez-Sánchez, R. A.; Leyvraz, F.; Seligman, T. H.

2014-01-01

We present a finite element algorithm that computes eigenvalues and eigenfunctions of the Laplace operator for two-dimensional problems with homogeneous Neumann or Dirichlet boundary conditions, or combinations of either for different parts of the boundary. We use an inverse power plus Gauss-Seidel algorithm to solve the generalized eigenvalue problem. For Neumann boundary conditions the method is much more efficient than the equivalent finite difference algorithm. We checked the algorithm by comparing the cumulative level density of the spectrum obtained numerically with the theoretical prediction given by the Weyl formula. We found a systematic deviation due to the discretization, not to the algorithm itself.

Estimating population size with correlated sampling unit estimates

Treesearch

David C. Bowden; Gary C. White; Alan B. Franklin; Joseph L. Ganey

2003-01-01

Finite population sampling theory is useful in estimating total population size (abundance) from abundance estimates of each sampled unit (quadrat). We develop estimators that allow correlated quadrat abundance estimates, even for quadrats in different sampling strata. Correlated quadrat abundance estimates based on mark–recapture or distance sampling methods occur...

Quadratic soliton self-reflection at a quadratically nonlinear interface

NASA Astrophysics Data System (ADS)

Jankovic, Ladislav; Kim, Hongki; Stegeman, George; Carrasco, Silvia; Torner, Lluis; Katz, Mordechai

2003-11-01

The reflection of bulk quadratic solutions incident onto a quadratically nonlinear interface in periodically poled potassium titanyl phosphate was observed. The interface consisted of the boundary between two quasi-phase-matched regions displaced from each other by a half-period. At high intensities and small angles of incidence the soliton is reflected.

Self-Replicating Quadratics

ERIC Educational Resources Information Center

Withers, Christopher S.; Nadarajah, Saralees

2012-01-01

We show that there are exactly four quadratic polynomials, Q(x) = x [superscript 2] + ax + b, such that (x[superscript 2] + ax + b) (x[superscript 2] - ax + b) = (x[superscript 4] + ax[superscript 2] + b). For n = 1, 2, ..., these quadratic polynomials can be written as the product of N = 2[superscript n] quadratic polynomials in x[superscript…

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.

On the Time-Dependent Analysis of Gamow Decay

ERIC Educational Resources Information Center

Durr, Detlef; Grummt, Robert; Kolb, Martin

2011-01-01

Gamow's explanation of the exponential decay law uses complex "eigenvalues" and exponentially growing "eigenfunctions". This raises the question, how Gamow's description fits into the quantum mechanical description of nature, which is based on real eigenvalues and square integrable wavefunctions. Observing that the time evolution of any…

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

Three-dimensional geometry of coronal loops inferred by the Principal Component Analysis

NASA Astrophysics Data System (ADS)

Nisticò, Giuseppe; Nakariakov, Valery

We propose a new method for the determination of the three dimensional (3D) shape of coronal loops from stereoscopy. The common approach requires to find a 1D geometric curve, as circumference or ellipse, that best-fits the 3D tie-points which sample the loop shape in a given coordinate system. This can be easily achieved by the Principal Component (PC) analysis. It mainly consists in calculating the eigenvalues and eigenvectors of the covariance matrix of the 3D tie-points: the eigenvalues give a measure of the variability of the distribution of the tie-points, and the corresponding eigenvectors define a new cartesian reference frame directly related to the loop. The eigenvector associated with the smallest eigenvalues defines the normal to the loop plane, while the other two determine the directions of the loop axes: the major axis is related to the largest eigenvalue, and the minor axis with the second one. The magnitude of the axes is directly proportional to the square roots of these eigenvalues. The technique is fast and easily implemented in some examples, returning best-fitting estimations of the loop parameters and 3D reconstruction with a reasonable small number of tie-points. The method is suitable for serial reconstruction of coronal loops in active regions, providing a useful tool for comparison between observations and theoretical magnetic field extrapolations from potential or force-free fields.

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.

Random matrix theory and cross-correlations in global financial indices and local stock market indices

NASA Astrophysics Data System (ADS)

Nobi, Ashadun; Maeng, Seong Eun; Ha, Gyeong Gyun; Lee, Jae Woo

2013-02-01

We analyzed cross-correlations between price fluctuations of global financial indices (20 daily stock indices over the world) and local indices (daily indices of 200 companies in the Korean stock market) by using random matrix theory (RMT). We compared eigenvalues and components of the largest and the second largest eigenvectors of the cross-correlation matrix before, during, and after the global financial the crisis in the year 2008. We find that the majority of its eigenvalues fall within the RMT bounds [ λ -, λ +], where λ - and λ + are the lower and the upper bounds of the eigenvalues of random correlation matrices. The components of the eigenvectors for the largest positive eigenvalues indicate the identical financial market mode dominating the global and local indices. On the other hand, the components of the eigenvector corresponding to the second largest eigenvalue are positive and negative values alternatively. The components before the crisis change sign during the crisis, and those during the crisis change sign after the crisis. The largest inverse participation ratio (IPR) corresponding to the smallest eigenvector is higher after the crisis than during any other periods in the global and local indices. During the global financial the crisis, the correlations among the global indices and among the local stock indices are perturbed significantly. However, the correlations between indices quickly recover the trends before the crisis.

Designing and evaluating health systems level hypertension control interventions for African-Americans: lessons from a pooled analysis of three cluster randomized trials.

PubMed

Pavlik, Valory N; Chan, Wenyaw; Hyman, David J; Feldman, Penny; Ogedegbe, Gbenga; Schwartz, Joseph E; McDonald, Margaret; Einhorn, Paula; Tobin, Jonathan N

2015-01-01

African-Americans (AAs) have a high prevalence of hypertension and their blood pressure (BP) control on treatment still lags behind other groups. In 2004, NHLBI funded five projects that aimed to evaluate clinically feasible interventions to effect changes in medical care delivery leading to an increased proportion of AA patients with controlled BP. Three of the groups performed a pooled analysis of trial results to determine: 1) the magnitude of the combined intervention effect; and 2) how the pooled results could inform the methodology for future health-system level BP interventions. Using a cluster randomized design, the trials enrolled AAs with uncontrolled hypertension to test interventions targeting a combination of patient and clinician behaviors. The 12-month Systolic BP (SBP) and Diastolic BP (DBP) effects of intervention or control cluster assignment were assessed using mixed effects longitudinal regression modeling. 2,015 patients representing 352 clusters participated across the three trials. Pooled BP slopes followed a quadratic pattern, with an initial decline, followed by a rise toward baseline, and did not differ significantly between intervention and control clusters: SBP linear coefficient = -2.60±0.21 mmHg per month, p<0.001; quadratic coefficient = 0.167± 0.02 mmHg/month, p<0.001; group by time interaction group by time group x linear time coefficient=0.145 ± 0.293, p=0.622; group x quadratic time coefficient= -0.017 ± 0.026, p=0.525). RESULTS were similar for DBP. The individual sites did not have significant intervention effects when analyzed separately. Investigators planning behavioral trials to improve BP control in health systems serving AAs should plan for small effect sizes and employ a "run-in" period in which BP can be expected to improve in both experimental and control clusters.

Quadratic general rotary unitized design for doping concentrations and up-conversion luminescence properties of Er{sup 3+}/Yb{sup 3+} co-doped NaLa(MoO{sub 4}){sub 2} phosphors

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

Sun, Jiashi, E-mail: sunjs@dlmu.edu.cn; Shi, Linlin; Li, Shuwei

Highlights: • NaLa(MoO4)2: Er3+/Yb3+ phosphor is synthesized by solid state method. • QGRUD is first applied to the codoping concentration option. • Optimized phosphor presents more stable UC emissions than the commercial phosphor. - Abstract: It is still a great challenge that designing proper codoping concentrations of rare earth ions for achieving intensest expected emission from the studied phosphor. In this work, the quadratic general rotary unitized design (QGRUD) was introduced into the codoping concentration option of NaLa(MoO{sub 4}){sub 2}: Er{sup 3+}/Yb{sup 3+} phosphor for upconversion (UC) applications, and the optimum doping concentrations of Er{sup 3+} and Yb{sup 3+} formore » achieving maximum UC luminescence intensity, which is close to commercial NaYF{sub 4}:Er{sup 3+}/Yb{sup 3+} phosphor, were obtained. The two-photon process was assigned to the green UC emissions in the optimized NaLa(MoO{sub 4}){sub 2}: Er{sup 3+}/Yb{sup 3+} phosphor. It was also demonstrated that the optimized phosphor presented more stable upconversion emissions than the commercial NaYF{sub 4}:Er{sup 3+}/Yb{sup 3+} phosphor.« less

Orthogonality preserving infinite dimensional quadratic stochastic operators

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

Akın, Hasan; Mukhamedov, Farrukh

In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators.

Graphical Solution of the Monic Quadratic Equation with Complex Coefficients

ERIC Educational Resources Information Center

Laine, A. D.

2015-01-01

There are many geometrical approaches to the solution of the quadratic equation with real coefficients. In this article it is shown that the monic quadratic equation with complex coefficients can also be solved graphically, by the intersection of two hyperbolas; one hyperbola being derived from the real part of the quadratic equation and one from…

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

Weyl's type estimates on the eigenvalues of critical Schrödinger operators using improved Hardy-Sobolev inequalities

NASA Astrophysics Data System (ADS)

Zographopoulos, N. B.

2009-11-01

Motivated by the work (Karachalios N I 2008 Lett. Math. Phys. 83 189-99), we present explicit asymptotic estimates on the eigenvalues of the critical Schrödinger operator, involving inverse-square potential, based on improved Hardy-Sobolev-type inequalities.

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…

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…

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.

Quadratic Optimisation with One Quadratic Equality Constraint

DTIC Science & Technology

2010-06-01

This report presents a theoretical framework for minimising a quadratic objective function subject to a quadratic equality constraint. The first part of the report gives a detailed algorithm which computes the global minimiser without calling special nonlinear optimisation solvers. The second part of the report shows how the developed theory can be applied to solve the time of arrival geolocation problem.

Hidden supersymmetry and quadratic deformations of the space-time conformal superalgebra

NASA Astrophysics Data System (ADS)

Yates, L. A.; Jarvis, P. D.

2018-04-01

We analyze the structure of the family of quadratic superalgebras, introduced in Jarvis et al (2011 J. Phys. A: Math. Theor. 44 235205), for the quadratic deformations of N  =  1 space-time conformal supersymmetry. We characterize in particular the ‘zero-step’ modules for this case. In such modules, the odd generators vanish identically, and the quadratic superalgebra is realized on a single irreducible representation of the even subalgebra (which is a Lie algebra). In the case under study, the quadratic deformations of N  =  1 space-time conformal supersymmetry, it is shown that each massless positive energy unitary irreducible representation (in the standard classification of Mack), forms such a zero-step module, for an appropriate parameter choice amongst the quadratic family (with vanishing central charge). For these massless particle multiplets therefore, quadratic supersymmetry is unbroken, in that the supersymmetry generators annihilate all physical states (including the vacuum state), while at the same time, superpartners do not exist.

Structural robustness with suboptimal responses for linear state space model

NASA Technical Reports Server (NTRS)

Keel, L. H.; Lim, Kyong B.; Juang, Jer-Nan

1989-01-01

A relationship between the closed-loop eigenvalues and the amount of perturbations in the open-loop matrix is addressed in the context of performance robustness. If the allowable perturbation ranges of elements of the open-loop matrix A and the desired tolerance of the closed-loop eigenvalues are given such that max(j) of the absolute value of Delta-lambda(j) (A+BF) should be less than some prescribed value, what is a state feedback controller F which satisfies the closed-loop eigenvalue perturbation-tolerance requirement for a class of given perturbation in A? The paper gives an algorithm to design such a controller. Numerical examples are included for illustration.

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.

Stability of a laminar premixed supersonic free shear layer with chemical reactions

NASA Technical Reports Server (NTRS)

Menon, S.; Anderson, J. D., Jr.; Pai, S. I.

1984-01-01

The stability of a two-dimensional compressible supersonic flow in the wake of a flat plate is discussed. The fluid is a multi-species mixture which is undergoing finite rate chemical reactions. The spatial stability of an infinitesimal disturbance in the fluid is considered. Numerical solutions of the eigenvalue stability equations for both reactive and nonreactive supersonic flows are presented and discussed. The chemical reactions have significant influence on the stability behavior. For instance, a neutral eigenvalue is observed near the freestream Mach number of 2.375 for the nonreactive case, but disappears when the reaction is turned on. For reactive flows, the eigenvalues are not very dependent on the free stream Mach number.

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).

Eigenvalues of Rectangular Waveguide Using FEM With Hybrid Elements

NASA Technical Reports Server (NTRS)

Deshpande, Manohar D.; Hall, John M.

2002-01-01

A finite element analysis using hybrid triangular-rectangular elements is developed to estimate eigenvalues of a rectangular waveguide. Use of rectangular vector-edge finite elements in the vicinity of the PEC boundary and triangular elements in the interior region more accurately models the physical nature of the electromagnetic field, and consequently quicken the convergence.

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.

Noncanonical harmonic and anharmonic oscillator in high-energy physics

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

Jannussis, A.; Vavougios, D.

1986-09-01

We study the eigenvalues of the noncanonical harmonic and anharmonic oscillator, by using different values of the elementary length l corresponding to typical cross sections for the strong interactions. There is evidence for a correlation between the energies of elementary particles (mesons, baryons, resonances) and the energy eigenvalues of the noncanonical theory.

Evaluation of Parallel Analysis Methods for Determining the Number of Factors

ERIC Educational Resources Information Center

Crawford, Aaron V.; Green, Samuel B.; Levy, Roy; Lo, Wen-Juo; Scott, Lietta; Svetina, Dubravka; Thompson, Marilyn S.

2010-01-01

Population and sample simulation approaches were used to compare the performance of parallel analysis using principal component analysis (PA-PCA) and parallel analysis using principal axis factoring (PA-PAF) to identify the number of underlying factors. Additionally, the accuracies of the mean eigenvalue and the 95th percentile eigenvalue criteria…

Twisting singular solutions of Betheʼs equations

NASA Astrophysics Data System (ADS)

Nepomechie, Rafael I.; Wang, Chunguang

2014-12-01

The Bethe equations for the periodic XXX and XXZ spin chains admit singular solutions, for which the corresponding eigenvalues and eigenvectors are ill-defined. We use a twist regularization to derive conditions for such singular solutions to be physical, in which case they correspond to genuine eigenvalues and eigenvectors of the Hamiltonian.

An Isoperimetric Inequality for Fundamental Tones of Free Plates

ERIC Educational Resources Information Center

Chasman, Laura

2009-01-01

We establish an isoperimetric inequality for the fundamental tone (first nonzero eigenvalue) of the free plate of a given area, proving the ball is maximal. Given tau greater than 0, the free plate eigenvalues omega and eigenfunctions upsilon are determined by the equation Delta Delta upsilon - tau Delta upsilon = omega upsilon together with…

A Teaching Proposal for the Study of Eigenvectors and Eigenvalues

ERIC Educational Resources Information Center

Meneu, María José Beltrán; Murillo Arcila, Marina; Jordá Mora, Enrique

2017-01-01

In this work, we present a teaching proposal which emphasizes on visualization and physical applications in the study of eigenvectors and eigenvalues. These concepts are introduced using the notion of the moment of inertia of a rigid body and the GeoGebra software. The proposal was motivated after observing students' difficulties when treating…

Emphasizing Visualization and Physical Applications in the Study of Eigenvectors and Eigenvalues

ERIC Educational Resources Information Center

BeltrÁn-Meneu, María José; Murillo-Arcila, Marina; Albarracín, Lluís

2017-01-01

This article presents a teaching proposal that emphasizes on visualization and physical applications in the study of eigenvectors and eigenvalues. More concretely, these concepts were introduced using the notion of the moment of inertia of a rigid body and the GeoGebra software. The proposal was designed after observing architecture students…

An Application of the Vandermonde Determinant

ERIC Educational Resources Information Center

Xu, Junqin; Zhao, Likuan

2006-01-01

Eigenvalue is an important concept in Linear Algebra. It is well known that the eigenvectors corresponding to different eigenvalues of a square matrix are linear independent. In most of the existing textbooks, this result is proven using mathematical induction. In this note, a new proof using Vandermonde determinant is given. It is shown that this…

Approximating natural connectivity of scale-free networks based on largest eigenvalue

NASA Astrophysics Data System (ADS)

Tan, S.-Y.; Wu, J.; Li, M.-J.; Lu, X.

2016-06-01

It has been recently proposed that natural connectivity can be used to efficiently characterize the robustness of complex networks. The natural connectivity has an intuitive physical meaning and a simple mathematical formulation, which corresponds to an average eigenvalue calculated from the graph spectrum. However, as a network model close to the real-world system that widely exists, the scale-free network is found difficult to obtain its spectrum analytically. In this article, we investigate the approximation of natural connectivity based on the largest eigenvalue in both random and correlated scale-free networks. It is demonstrated that the natural connectivity of scale-free networks can be dominated by the largest eigenvalue, which can be expressed asymptotically and analytically to approximate natural connectivity with small errors. Then we show that the natural connectivity of random scale-free networks increases linearly with the average degree given the scaling exponent and decreases monotonically with the scaling exponent given the average degree. Moreover, it is found that, given the degree distribution, the more assortative a scale-free network is, the more robust it is. Experiments in real networks validate our methods and results.

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

Free Fermions and the Classical Compact Groups

NASA Astrophysics Data System (ADS)

Cunden, Fabio Deelan; Mezzadri, Francesco; O'Connell, Neil

2018-06-01

There is a close connection between the ground state of non-interacting fermions in a box with classical (absorbing, reflecting, and periodic) boundary conditions and the eigenvalue statistics of the classical compact groups. The associated determinantal point processes can be extended in two natural directions: (i) we consider the full family of admissible quantum boundary conditions (i.e., self-adjoint extensions) for the Laplacian on a bounded interval, and the corresponding projection correlation kernels; (ii) we construct the grand canonical extensions at finite temperature of the projection kernels, interpolating from Poisson to random matrix eigenvalue statistics. The scaling limits in the bulk and at the edges are studied in a unified framework, and the question of universality is addressed. Whether the finite temperature determinantal processes correspond to the eigenvalue statistics of some matrix models is, a priori, not obvious. We complete the picture by constructing a finite temperature extension of the Haar measure on the classical compact groups. The eigenvalue statistics of the resulting grand canonical matrix models (of random size) corresponds exactly to the grand canonical measure of free fermions with classical boundary conditions.

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.

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 multiple-drawer medication layout problem in automated dispensing cabinets.

PubMed

Pazour, Jennifer A; Meller, Russell D

2012-12-01

In this paper we investigate the problem of locating medications in automated dispensing cabinets (ADCs) to minimize human selection errors. We formulate the multiple-drawer medication layout problem and show that the problem can be formulated as a quadratic assignment problem. As a way to evaluate various medication layouts, we develop a similarity rating for medication pairs. To solve industry-sized problem instances, we develop a heuristic approach. We use hospital ADC transaction data to conduct a computational experiment to test the performance of our developed heuristics, to demonstrate how our approach can aid in ADC design trade-offs, and to illustrate the potential improvements that can be made when applying an analytical process to the multiple-drawer medication layout problem. Finally, we present conclusions and future research directions.

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

NASA Astrophysics Data System (ADS)

Moslemipour, Ghorbanali

2018-07-01

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algorithm is proposed by combining the simulated annealing and clonal selection algorithms. The proposed model and the hybrid algorithm are verified and validated using design of experiment and benchmark methods. The results show that the hybrid algorithm has an outstanding performance from both solution quality and computational time points of view. Besides, the proposed model can be used in both of the stochastic and deterministic situations.

Model reduction by weighted Component Cost Analysis

NASA Technical Reports Server (NTRS)

Kim, Jae H.; Skelton, Robert E.

1990-01-01

Component Cost Analysis considers any given system driven by a white noise process as an interconnection of different components, and assigns a metric called 'component cost' to each component. These component costs measure the contribution of each component to a predefined quadratic cost function. A reduced-order model of the given system may be obtained by deleting those components that have the smallest component costs. The theory of Component Cost Analysis is extended to include finite-bandwidth colored noises. The results also apply when actuators have dynamics of their own. Closed-form analytical expressions of component costs are also derived for a mechanical system described by its modal data. This is very useful to compute the modal costs of very high order systems. A numerical example for MINIMAST system is presented.

[FQA: A method for floristic quality assessment based on conservatism of plant species].

PubMed

Cao, Li Juan; He, Ping; Wang, Mi; Xui, Jie; Ren, Ying

2018-04-01

FQA, which uses the conservatism of plant species for particular habitats and the species richness of plant communities, is a rapid method for the assessment of habitat quality. This method is based on species composition of quadrats and coefficients of conservatism for species which assigned by experts. Floristic Quality Index (FQI) that reflects vegetation integrity and degradation of a site can be calculated by a simple formula and be used for space-time comparison of habitat quality. It has been widely used in more than ten countries including the United States and Canada. This paper presented the principle, calculation formulas and application cases of this method, with the aim to provide a simple, repeatable and comparable method to assess habitat quality for ecological managers and researchers.

On the number of channels needed to classify vowels: Implications for cochlear implants

NASA Astrophysics Data System (ADS)

Fourakis, Marios; Hawks, John W.; Davis, Erin

2005-09-01

In cochlear implants the incoming signal is analyzed by a bank of filters. Each filter is associated with an electrode to constitute a channel. The present research seeks to determine the number of channels needed for optimal vowel classification. Formant measurements of vowels produced by men and women [Hillenbrand et al., J. Acoust. Soc. Am. 97, 3099-3111 (1995)] were converted to channel assignments. The number of channels varied from 4 to 20 over two frequency ranges (180-4000 and 180-6000 Hz) in equal bark steps. Channel assignments were submitted to linear discriminant analysis (LDA). Classification accuracy increased with the number of channels, ranging from 30% with 4 channels to 98% with 20 channels, both for the female voice. To determine asymptotic performance, LDA classification scores were plotted against the number of channels and fitted with quadratic equations. The number of channels at which no further improvement occurred was determined, averaging 19 across all conditions with little variation. This number of channels seems to resolve the frequency range spanned by the first three formants finely enough to maximize vowel classification. This resolution may not be achieved using six or eight channels as previously proposed. [Work supported by NIH.

Scaling Laws for the Multidimensional Burgers Equation with Quadratic External Potential

NASA Astrophysics Data System (ADS)

Leonenko, N. N.; Ruiz-Medina, M. D.

2006-07-01

The reordering of the multidimensional exponential quadratic operator in coordinate-momentum space (see X. Wang, C.H. Oh and L.C. Kwek (1998). J. Phys. A.: Math. Gen. 31:4329-4336) is applied to derive an explicit formulation of the solution to the multidimensional heat equation with quadratic external potential and random initial conditions. The solution to the multidimensional Burgers equation with quadratic external potential under Gaussian strongly dependent scenarios is also obtained via the Hopf-Cole transformation. The limiting distributions of scaling solutions to the multidimensional heat and Burgers equations with quadratic external potential are then obtained under such scenarios.

Non-algebraic integrability of the Chew-Low reversible dynamical system of the Cremona type and the relation with the 7th Hilbert problem (non-resonant case)

NASA Astrophysics Data System (ADS)

Rerikh, K. V.

A smooth reversible dynamical system (SRDS) and a system of nonlinear functional equations, defined by a certain rational quadratic Cremona mapping and arising from the static model of the dispersion approach in the theory of strong interactions (the Chew-Low equations for p- wave πN- scattering) are considered. This SRDS is splitted into 1- and 2-dimensional ones. An explicit Cremona transformation that completely determines the exact solution of the two-dimensional system is found. This solution depends on an odd function satisfying a nonlinear autonomous 3-point functional equation. Non-algebraic integrability of SRDS under consideration is proved using the method of Poincaré normal forms and the Siegel theorem on biholomorphic linearization of a mapping at a non-resonant fixed point. The proof is based on the classical Feldman-Baker theorem on linear forms of logarithms of algebraic numbers, which, in turn, relies upon solving the 7th Hilbert problem by A.I. Gel'fond and T. Schneider and new powerful methods of A. Baker in the theory of transcendental numbers. The general theorem, following from the Feldman-Baker theorem, on applicability of the Siegel theorem to the set of the eigenvalues λ ɛ Cn of a mapping at a non-resonant fixed point which belong to the algebraic number field A is formulated and proved. The main results are presented in Theorems 1-3, 5, 7, 8 and Remarks 3, 7.

Holographic conductivity of holographic superconductors with higher-order corrections

NASA Astrophysics Data System (ADS)

Sheykhi, Ahmad; Ghazanfari, Afsoon; Dehyadegari, Amin

2018-02-01

We analytically and numerically disclose the effects of the higher-order correction terms in the gravity and in the gauge field on the properties of s-wave holographic superconductors. On the gravity side, we consider the higher curvature Gauss-Bonnet corrections and on the gauge field side, we add a quadratic correction term to the Maxwell Lagrangian. We show that, for this system, one can still obtain an analytical relation between the critical temperature and the charge density. We also calculate the critical exponent and the condensation value both analytically and numerically. We use a variational method, based on the Sturm-Liouville eigenvalue problem for our analytical study, as well as a numerical shooting method in order to compare with our analytical results. For a fixed value of the Gauss-Bonnet parameter, we observe that the critical temperature decreases with increasing the nonlinearity of the gauge field. This implies that the nonlinear correction term to the Maxwell electrodynamics makes the condensation harder. We also study the holographic conductivity of the system and disclose the effects of the Gauss-Bonnet and nonlinear parameters α and b on the superconducting gap. We observe that, for various values of α and b, the real part of the conductivity is proportional to the frequency per temperature, ω /T, as the frequency is large enough. Besides, the conductivity has a minimum in the imaginary part which is shifted toward greater frequency with decreasing temperature.

Checking Dimensionality in Item Response Models with Principal Component Analysis on Standardized Residuals

ERIC Educational Resources Information Center

Chou, Yeh-Tai; Wang, Wen-Chung

2010-01-01

Dimensionality is an important assumption in item response theory (IRT). Principal component analysis on standardized residuals has been used to check dimensionality, especially under the family of Rasch models. It has been suggested that an eigenvalue greater than 1.5 for the first eigenvalue signifies a violation of unidimensionality when there…

Some Results on Mean Square Error for Factor Score Prediction

ERIC Educational Resources Information Center

Krijnen, Wim P.

2006-01-01

For the confirmatory factor model a series of inequalities is given with respect to the mean square error (MSE) of three main factor score predictors. The eigenvalues of these MSE matrices are a monotonic function of the eigenvalues of the matrix gamma[subscript rho] = theta[superscript 1/2] lambda[subscript rho] 'psi[subscript rho] [superscript…

Entropy-driven phase transitions of entanglement

NASA Astrophysics Data System (ADS)

Facchi, Paolo; Florio, Giuseppe; Parisi, Giorgio; Pascazio, Saverio; Yuasa, Kazuya

2013-05-01

We study the behavior of bipartite entanglement at fixed von Neumann entropy. We look at the distribution of the entanglement spectrum, that is, the eigenvalues of the reduced density matrix of a quantum system in a pure state. We report the presence of two continuous phase transitions, characterized by different entanglement spectra, which are deformations of classical eigenvalue distributions.

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

Geometric Approaches to Quadratic Equations from Other Times and Places.

ERIC Educational Resources Information Center

Allaire, Patricia R.; Bradley, Robert E.

2001-01-01

Focuses on geometric solutions of quadratic problems. Presents a collection of geometric techniques from ancient Babylonia, classical Greece, medieval Arabia, and early modern Europe to enhance the quadratic equation portion of an algebra course. (KHR)

Constructing 1/ωα noise from reversible Markov chains

NASA Astrophysics Data System (ADS)

Erland, Sveinung; Greenwood, Priscilla E.

2007-09-01

This paper gives sufficient conditions for the output of 1/ωα noise from reversible Markov chains on finite state spaces. We construct several examples exhibiting this behavior in a specified range of frequencies. We apply simple representations of the covariance function and the spectral density in terms of the eigendecomposition of the probability transition matrix. The results extend to hidden Markov chains. We generalize the results for aggregations of AR1-processes of C. W. J. Granger [J. Econometrics 14, 227 (1980)]. Given the eigenvalue function, there is a variety of ways to assign values to the states such that the 1/ωα condition is satisfied. We show that a random walk on a certain state space is complementary to the point process model of 1/ω noise of B. Kaulakys and T. Meskauskas [Phys. Rev. E 58, 7013 (1998)]. Passing to a continuous state space, we construct 1/ωα noise which also has a long memory.

Reusable Launch Vehicle Attitude Control Using a Time-Varying Sliding Mode Control Technique

NASA Technical Reports Server (NTRS)

Shtessel, Yuri B.; Zhu, J. Jim; Daniels, Dan; Jackson, Scott (Technical Monitor)

2002-01-01

In this paper we present a time-varying sliding mode control (TVSMC) technique for reusable launch vehicle (RLV) attitude control in ascent and entry flight phases. In ascent flight the guidance commands Euler roll, pitch and yaw angles, and in entry flight it commands the aerodynamic angles of bank, attack and sideslip. The controller employs a body rate inner loop and the attitude outer loop, which are separated in time-scale by the singular perturbation principle. The novelty of the TVSMC is that both the sliding surface and the boundary layer dynamics can be varied in real time using the PD-eigenvalue assignment technique. This salient feature is used to cope with control command saturation and integrator windup in the presence of severe disturbance or control effector failure, which enhances the robustness and fault tolerance of the controller. The TV-SMC ascent and descent designs are currently being tested with high fidelity, 6-DOF dispersion simulations. The test results will be presented in the final version of this paper.

Characterization of spatial and temporal variability in hydrochemistry of Johor Straits, Malaysia.

PubMed

Abdullah, Pauzi; Abdullah, Sharifah Mastura Syed; Jaafar, Othman; Mahmud, Mastura; Khalik, Wan Mohd Afiq Wan Mohd

2015-12-15

Characterization of hydrochemistry changes in Johor Straits within 5 years of monitoring works was successfully carried out. Water quality data sets (27 stations and 19 parameters) collected in this area were interpreted subject to multivariate statistical analysis. Cluster analysis grouped all the stations into four clusters ((Dlink/Dmax) × 100<90) and two clusters ((Dlink/Dmax) × 100<80) for site and period similarities. Principal component analysis rendered six significant components (eigenvalue>1) that explained 82.6% of the total variance of the data set. Classification matrix of discriminant analysis assigned 88.9-92.6% and 83.3-100% correctness in spatial and temporal variability, respectively. Times series analysis then confirmed that only four parameters were not significant over time change. Therefore, it is imperative that the environmental impact of reclamation and dredging works, municipal or industrial discharge, marine aquaculture and shipping activities in this area be effectively controlled and managed. Copyright © 2015 Elsevier Ltd. All rights reserved.

Introducing Computational Approaches in Intermediate Mechanics

NASA Astrophysics Data System (ADS)

Cook, David M.

2006-12-01

In the winter of 2003, we at Lawrence University moved Lagrangian mechanics and rigid body dynamics from a required sophomore course to an elective junior/senior course, freeing 40% of the time for computational approaches to ordinary differential equations (trajectory problems, the large amplitude pendulum, non-linear dynamics); evaluation of integrals (finding centers of mass and moment of inertia tensors, calculating gravitational potentials for various sources); and finding eigenvalues and eigenvectors of matrices (diagonalizing the moment of inertia tensor, finding principal axes), and to generating graphical displays of computed results. Further, students begin to use LaTeX to prepare some of their submitted problem solutions. Placed in the middle of the sophomore year, this course provides the background that permits faculty members as appropriate to assign computer-based exercises in subsequent courses. Further, students are encouraged to use our Computational Physics Laboratory on their own initiative whenever that use seems appropriate. (Curricular development supported in part by the W. M. Keck Foundation, the National Science Foundation, and Lawrence University.)

Optimal Frequency-Domain System Realization with Weighting

NASA Technical Reports Server (NTRS)

Juang, Jer-Nan; Maghami, Peiman G.

1999-01-01

Several approaches are presented to identify an experimental system model directly from frequency response data. The formulation uses a matrix-fraction description as the model structure. Frequency weighting such as exponential weighting is introduced to solve a weighted least-squares problem to obtain the coefficient matrices for the matrix-fraction description. A multi-variable state-space model can then be formed using the coefficient matrices of the matrix-fraction description. Three different approaches are introduced to fine-tune the model using nonlinear programming methods to minimize the desired cost function. The first method uses an eigenvalue assignment technique to reassign a subset of system poles to improve the identified model. The second method deals with the model in the real Schur or modal form, reassigns a subset of system poles, and adjusts the columns (rows) of the input (output) influence matrix using a nonlinear optimizer. The third method also optimizes a subset of poles, but the input and output influence matrices are refined at every optimization step through least-squares procedures.

Addition of a Worm Leachate as Source of Humic Substances in the Drinking Water of Broiler Chickens

PubMed Central

Gomez-Rosales, S.; de L. Angeles, M.

2015-01-01

The objective of this research was to evaluate the growth performance, the apparent ileal digestibility of nitrogen and energy, the retention of nutrients and the apparent metabolizable energy corrected to zero nitrogen retention (AMEn) in broiler chickens supplemented with increasing doses of a worm leachate (WL) as a source of humic substances (HS) in the drinking water. In Exp. 1, 140 male broilers were penned individually and assigned to four WL levels (0%, 10%, 20%, and 30%) mixed in the drinking water from 21 to 49 days of age. Water was offered in plastic bottles tied to the cage. In Exp. 2, 600 male broilers from 21 to 49 days of age housed in floor pens were assigned to three levels of WL (0%, 10%, and 20%) mixed in the drinking water. The WL was mixed with tap water in plastic containers connected by plastic tubing to bell drinkers. The results of both experiments were subjected to analysis of variance and polynomial contrasts. In Exp. 1, the daily water consumption was similar among treatments but the consumption of humic, fulvic, and total humic acids increased linearly (p<0.01) as the WL increased in the drinking water. The feed conversion (p<0.01) and the ileal digestibility of energy, the excretion of dry matter and energy, the retention of dry matter, ash and nitrogen and the AMEn showed quadratic responses (p<0.05) relative to the WL levels in drinking water. In Exp. 2, the increasing level of WL in the drinking water had quadratic effects on the final body weight, daily weight gain and feed conversion ratio (p<0.05). The addition of WL as a source of HS in the drinking water had beneficial effects on the growth performance, ileal digestibility of energy, the retention of nutrients as well on the AMEn in broiler chickens; the best results were observed when the WL was mixed at levels of 20% to 30% in the drinking water. PMID:25557817

Addition of a worm leachate as source of humic substances in the drinking water of broiler chickens.

PubMed

Gomez-Rosales, S; de L Angeles, M

2015-02-01

The objective of this research was to evaluate the growth performance, the apparent ileal digestibility of nitrogen and energy, the retention of nutrients and the apparent metabolizable energy corrected to zero nitrogen retention (AMEn) in broiler chickens supplemented with increasing doses of a worm leachate (WL) as a source of humic substances (HS) in the drinking water. In Exp. 1, 140 male broilers were penned individually and assigned to four WL levels (0%, 10%, 20%, and 30%) mixed in the drinking water from 21 to 49 days of age. Water was offered in plastic bottles tied to the cage. In Exp. 2, 600 male broilers from 21 to 49 days of age housed in floor pens were assigned to three levels of WL (0%, 10%, and 20%) mixed in the drinking water. The WL was mixed with tap water in plastic containers connected by plastic tubing to bell drinkers. The results of both experiments were subjected to analysis of variance and polynomial contrasts. In Exp. 1, the daily water consumption was similar among treatments but the consumption of humic, fulvic, and total humic acids increased linearly (p<0.01) as the WL increased in the drinking water. The feed conversion (p<0.01) and the ileal digestibility of energy, the excretion of dry matter and energy, the retention of dry matter, ash and nitrogen and the AMEn showed quadratic responses (p<0.05) relative to the WL levels in drinking water. In Exp. 2, the increasing level of WL in the drinking water had quadratic effects on the final body weight, daily weight gain and feed conversion ratio (p<0.05). The addition of WL as a source of HS in the drinking water had beneficial effects on the growth performance, ileal digestibility of energy, the retention of nutrients as well on the AMEn in broiler chickens; the best results were observed when the WL was mixed at levels of 20% to 30% in the drinking water.

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.

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.

Wave Propagation and Localization via Quasi-Normal Modes and Transmission Eigenchannels

NASA Astrophysics Data System (ADS)

Wang, Jing; Shi, Zhou; Davy, Matthieu; Genack, Azriel Z.

2013-10-01

Field transmission coefficients for microwave radiation between arrays of points on the incident and output surfaces of random samples are analyzed to yield the underlying quasi-normal modes and transmission eigenchannels of each realization of the sample. The linewidths, central frequencies, and transmitted speckle patterns associated with each of the modes of the medium are found. Modal speckle patterns are found to be strongly correlated leading to destructive interference between modes. This explains distinctive features of transmission spectra and pulsed transmission. An alternate description of wave transport is obtained from the eigenchannels and eigenvalues of the transmission matrix. The maximum transmission eigenvalue, τ1 is near unity for diffusive waves even in turbid samples. For localized waves, τ1 is nearly equal to the dimensionless conductance, which is the sum of all transmission eigenvalues, g = Στn. The spacings between the ensemble averages of successive values of lnτn are constant and equal to the inverse of the bare conductance in accord with predictions by Dorokhov. The effective number of transmission eigenvalues Neff determines the contrast between the peak and background of radiation focused for maximum peak intensity. The connection between the mode and channel approaches is discussed.

Wave Propagation and Localization via Quasi-Normal Modes and Transmission Eigenchannels

NASA Astrophysics Data System (ADS)

Wang, Jing; Shi, Zhou; Davy, Matthieu; Genack, Azriel Z.

Field transmission coefficients for microwave radiation between arrays of points on the incident and output surfaces of random samples are analyzed to yield the underlying quasi-normal modes and transmission eigenchannels of each realization of the sample. The linewidths, central frequencies, and transmitted speckle patterns associated with each of the modes of the medium are found. Modal speckle patterns are found to be strongly correlated leading to destructive interference between modes. This explains distinctive features of transmission spectra and pulsed transmission. An alternate description of wave transport is obtained from the eigenchannels and eigenvalues of the transmission matrix. The maximum transmission eigenvalue, τ1 is near unity for diffusive waves even in turbid samples. For localized waves, τ1 is nearly equal to the dimensionless conductance, which is the sum of all transmission eigenvalues, g = Στn. The spacings between the ensemble averages of successive values of lnτn are constant and equal to the inverse of the bare conductance in accord with predictions by Dorokhov. The effective number of transmission eigenvalues Neff determines the contrast between the peak and background of radiation focused for maximum peak intensity. The connection between the mode and channel approaches is discussed.

Periodic orbit spectrum in terms of Ruelle-Pollicott resonances

NASA Astrophysics Data System (ADS)

Leboeuf, P.

2004-02-01

Fully chaotic Hamiltonian systems possess an infinite number of classical solutions which are periodic, e.g., a trajectory “p” returns to its initial conditions after some fixed time τp. Our aim is to investigate the spectrum {τ1,τ2,…} of periods of the periodic orbits. An explicit formula for the density ρ(τ)=∑pδ(τ-τp) is derived in terms of the eigenvalues of the classical evolution operator. The density is naturally decomposed into a smooth part plus an interferent sum over oscillatory terms. The frequencies of the oscillatory terms are given by the imaginary part of the complex eigenvalues (Ruelle-Pollicott resonances). For large periods, corrections to the well-known exponential growth of the smooth part of the density are obtained. An alternative formula for ρ(τ) in terms of the zeros and poles of the Ruelle ζ function is also discussed. The results are illustrated with the geodesic motion in billiards of constant negative curvature. Connections with the statistical properties of the corresponding quantum eigenvalues, random-matrix theory, and discrete maps are also considered. In particular, a random-matrix conjecture is proposed for the eigenvalues of the classical evolution operator of chaotic billiards.

Recurrence quantity analysis based on matrix eigenvalues

NASA Astrophysics Data System (ADS)

Yang, Pengbo; Shang, Pengjian

2018-06-01

Recurrence plots is a powerful tool for visualization and analysis of dynamical systems. Recurrence quantification analysis (RQA), based on point density and diagonal and vertical line structures in the recurrence plots, is considered to be alternative measures to quantify the complexity of dynamical systems. In this paper, we present a new measure based on recurrence matrix to quantify the dynamical properties of a given system. Matrix eigenvalues can reflect the basic characteristics of the complex systems, so we show the properties of the system by exploring the eigenvalues of the recurrence matrix. Considering that Shannon entropy has been defined as a complexity measure, we propose the definition of entropy of matrix eigenvalues (EOME) as a new RQA measure. We confirm that EOME can be used as a metric to quantify the behavior changes of the system. As a given dynamical system changes from a non-chaotic to a chaotic regime, the EOME will increase as well. The bigger EOME values imply higher complexity and lower predictability. We also study the effect of some factors on EOME,including data length, recurrence threshold, the embedding dimension, and additional noise. Finally, we demonstrate an application in physiology. The advantage of this measure lies in a high sensitivity and simple computation.

Proper and improper zero energy modes in Hartree-Fock theory and their relevance for symmetry breaking and restoration.

PubMed

Cui, Yao; Bulik, Ireneusz W; Jiménez-Hoyos, Carlos A; Henderson, Thomas M; Scuseria, Gustavo E

2013-10-21

We study the spectra of the molecular orbital Hessian (stability matrix) and random-phase approximation (RPA) Hamiltonian of broken-symmetry Hartree-Fock solutions, focusing on zero eigenvalue modes. After all negative eigenvalues are removed from the Hessian by following their eigenvectors downhill, one is left with only positive and zero eigenvalues. Zero modes correspond to orbital rotations with no restoring force. These rotations determine states in the Goldstone manifold, which originates from a spontaneously broken continuous symmetry in the wave function. Zero modes can be classified as improper or proper according to their different mathematical and physical properties. Improper modes arise from symmetry breaking and their restoration always lowers the energy. Proper modes, on the other hand, correspond to degeneracies of the wave function, and their symmetry restoration does not necessarily lower the energy. We discuss how the RPA Hamiltonian distinguishes between proper and improper modes by doubling the number of zero eigenvalues associated with the latter. Proper modes in the Hessian always appear in pairs which do not double in RPA. We present several pedagogical cases exemplifying the above statements. The relevance of these results for projected Hartree-Fock methods is also addressed.

Distribution of Schmidt-like eigenvalues for Gaussian ensembles of the random matrix theory

NASA Astrophysics Data System (ADS)

Pato, Mauricio P.; Oshanin, Gleb

2013-03-01

We study the probability distribution function P(β)n(w) of the Schmidt-like random variable w = x21/(∑j = 1nx2j/n), where xj, (j = 1, 2, …, n), are unordered eigenvalues of a given n × n β-Gaussian random matrix, β being the Dyson symmetry index. This variable, by definition, can be considered as a measure of how any individual (randomly chosen) eigenvalue deviates from the arithmetic mean value of all eigenvalues of a given random matrix, and its distribution is calculated with respect to the ensemble of such β-Gaussian random matrices. We show that in the asymptotic limit n → ∞ and for arbitrary β the distribution P(β)n(w) converges to the Marčenko-Pastur form, i.e. is defined as P_{n}^{( \\beta )}(w) \\sim \\sqrt{(4 - w)/w} for w ∈ [0, 4] and equals zero outside of the support, despite the fact that formally w is defined on the interval [0, n]. Furthermore, for Gaussian unitary ensembles (β = 2) we present exact explicit expressions for P(β = 2)n(w) which are valid for arbitrary n and analyse their behaviour.

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.

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.

Squared eigenvalue condition numbers and eigenvector correlations from the single ring theorem

NASA Astrophysics Data System (ADS)

Belinschi, Serban; Nowak, Maciej A.; Speicher, Roland; Tarnowski, Wojciech

2017-03-01

We extend the so-called ‘single ring theorem’ (Feinberg and Zee 1997 Nucl. Phys. B 504 579), also known as the Haagerup-Larsen theorem (Haagerup and Larsen 2000 J. Funct. Anal. 176 331). We do this by showing that in the limit when the size of the matrix goes to infinity a particular correlator between left and right eigenvectors of the relevant non-hermitian matrix X, being the spectral density weighted by the squared eigenvalue condition number, is given by a simple formula involving only the radial spectral cumulative distribution function of X. We show that this object allows the calculation of the conditional expectation of the squared eigenvalue condition number. We give examples and provide a cross-check of the analytic prediction by the large scale numerics.

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.

Numerical method of applying shadow theory to all regions of multilayered dielectric gratings in conical mounting.

PubMed

Wakabayashi, Hideaki; Asai, Masamitsu; Matsumoto, Keiji; Yamakita, Jiro

2016-11-01

Nakayama's shadow theory first discussed the diffraction by a perfectly conducting grating in a planar mounting. In the theory, a new formulation by use of a scattering factor was proposed. This paper focuses on the middle regions of a multilayered dielectric grating placed in conical mounting. Applying the shadow theory to the matrix eigenvalues method, we compose new transformation and improved propagation matrices of the shadow theory for conical mounting. Using these matrices and scattering factors, being the basic quantity of diffraction amplitudes, we formulate a new description of three-dimensional scattering fields which is available even for cases where the eigenvalues are degenerate in any region. Some numerical examples are given for cases where the eigenvalues are degenerate in the middle regions.

Existence and analyticity of eigenvalues of a two-channel molecular resonance model

NASA Astrophysics Data System (ADS)

Lakaev, S. N.; Latipov, Sh. M.

2011-12-01

We consider a family of operators Hγμ(k), k ∈ mathbb{T}^d := (-π,π]d, associated with the Hamiltonian of a system consisting of at most two particles on a d-dimensional lattice ℤd, interacting via both a pair contact potential (μ > 0) and creation and annihilation operators (γ > 0). We prove the existence of a unique eigenvalue of Hγμ(k), k ∈ mathbb{T}^d , or its absence depending on both the interaction parameters γ,μ ≥ 0 and the system quasimomentum k ∈ mathbb{T}^d . We show that the corresponding eigenvector is analytic. We establish that the eigenvalue and eigenvector are analytic functions of the quasimomentum k ∈ mathbb{T}^d in the existence domain G ⊂ mathbb{T}^d.

Eigenvalue-eigenvector decomposition (EED) analysis of dissimilarity and covariance matrix obtained from total synchronous fluorescence spectral (TSFS) data sets of herbal preparations: Optimizing the classification approach

NASA Astrophysics Data System (ADS)

Tarai, Madhumita; Kumar, Keshav; Divya, O.; Bairi, Partha; Mishra, Kishor Kumar; Mishra, Ashok Kumar

2017-09-01

The present work compares the dissimilarity and covariance based unsupervised chemometric classification approaches by taking the total synchronous fluorescence spectroscopy data sets acquired for the cumin and non-cumin based herbal preparations. The conventional decomposition method involves eigenvalue-eigenvector analysis of the covariance of the data set and finds the factors that can explain the overall major sources of variation present in the data set. The conventional approach does this irrespective of the fact that the samples belong to intrinsically different groups and hence leads to poor class separation. The present work shows that classification of such samples can be optimized by performing the eigenvalue-eigenvector decomposition on the pair-wise dissimilarity matrix.

Spin 0 and spin 1/2 quantum relativistic particles in a constant gravitational field

NASA Astrophysics Data System (ADS)

Khorrami, M.; Alimohammadi, M.; Shariati, A.

2003-04-01

The Klein-Gordon and Dirac equations in a semi-infinite lab ( x>0), in the background metric d s2= u2( x)(-d t2+d x2)+d y2+d z2, are investigated. The resulting equations are studied for the special case u( x)=1+ gx. It is shown that in the case of zero transverse-momentum, the square of the energy eigenvalues of the spin-1/2 particles are less than the squares of the corresponding eigenvalues of spin-0 particles with same masses, by an amount of mgℏ c. Finally, for non-zero transverse-momentum, the energy eigenvalues corresponding to large quantum numbers are obtained and the results for spin-0 and spin-1/2 particles are compared to each other.

A new S-type eigenvalue inclusion set for tensors and its applications.

PubMed

Huang, Zheng-Ge; Wang, Li-Gong; Xu, Zhong; Cui, Jing-Jing

2016-01-01

In this paper, a new S -type eigenvalue localization set for a tensor is derived by dividing [Formula: see text] into disjoint subsets S and its complement. It is proved that this new set is sharper than those presented by Qi (J. Symb. Comput. 40:1302-1324, 2005), Li et al. (Numer. Linear Algebra Appl. 21:39-50, 2014) and Li et al. (Linear Algebra Appl. 481:36-53, 2015). As applications of the results, new bounds for the spectral radius of nonnegative tensors and the minimum H -eigenvalue of strong M -tensors are established, and we prove that these bounds are tighter than those obtained by Li et al. (Numer. Linear Algebra Appl. 21:39-50, 2014) and He and Huang (J. Inequal. Appl. 2014:114, 2014).

Increased fatty acid β-oxidation as a possible mechanism for fat-reducing effect of betaine in broilers.

PubMed

Leng, Zhixian; Fu, Qin; Yang, Xue; Ding, Liren; Wen, Chao; Zhou, Yanmin

2016-08-01

Two hundred and forty 1-day-old male Arbor Acres broiler chickens were randomly assigned to five dietary treatments with six replicates of eight chickens per replicate cage for a 42-day feeding trial. Broiler chickens were fed a basal diet supplemented with 0 (control), 250, 500, 750 or 1000 mg/kg betaine, respectively. Growth performance was not affected by betaine. Incremental levels of betaine decreased the absolute and relative weight of abdominal fat (linear P < 0.05, quadratic P < 0.01), low-density lipoprotein cholesterol (LDL-C), triglyceride (TG) and total cholesterol (TC) (linear P < 0.05), and increased concentration of nonesterified fatty acid (NEFA) (linear P = 0.038, quadratic P = 0.003) in serum of broilers. Moreover, incremental levels of betaine increased linearly (P < 0.05) the proliferator-activated receptor alpha (PPARα), the carnitine palmitoyl transferase-I (CPT-I) and 3-hydroxyacyl-coenzyme A dehydrogenase (HADH) messenger RNA (mRNA) expression, but decreased linearly (P < 0.05) the fatty acid synthase (FAS) and 3-hydroxyl-3-methylglutaryl-CoA (HMGR) mRNA expression in liver of broilers. In conclusion, this study indicated that betaine supplementation did not affect growth performance of broilers, but was effective in reducing abdominal fat deposition in a dose-dependent manner, which was probably caused by combinations of a decrease in fatty acid synthesis and an increase in β-oxidation. © 2016 Japanese Society of Animal Science.

Dietary α-ketoglutarate supplementation improves hepatic and intestinal energy status and anti-oxidative capacity of Cherry Valley ducks.

PubMed

Guo, Shuangshuang; Duan, Rui; Wang, Lei; Hou, Yongqing; Tan, Linglin; Cheng, Qiang; Liao, Man; Ding, Binying

2017-11-01

α-Ketoglutarate (AKG) is an extensively used dietary supplement in human and animal nutrition. The aim of the present study was to investigate effects of dietary AKG supplementation on the energy status and anti-oxidative capacity in liver and intestinal mucosa of Cherry Valley ducks. A total of 80 1-day-old ducks were randomly assigned into four groups, in which ducks were fed basal diets supplemented with 0% (control), 0.5%, 1.0% and 1.5% AKG, respectively. Graded doses of AKG supplementation linearly decreased the ratio of adenosine monophosphate (AMP) to adenosine triphosphate (ATP) in the liver, but increased ATP content and adenylate energy charge (AEC) in a quadratic and linear manner, respectively (P < 0.05). Increasing dietary AKG supplemental levels produced linear positive responses in ATP content and AEC, and negative responses in AMP concentration, the ratio of AMP to ATP and total adenine nucleotide in the ileal mucosa (P < 0.05). All levels of dietary AKG reduced the production of jejunal hydrogen peroxide and hepatic malondialdehyde (P < 0.05). Hepatic and ileal messenger RNA expression of AMP kinase α-1 and hypoxia-inducible factor-1α were linearly up-regulated as dietary AKG supplemental levels increased (P < 0.05). In conclusion, dietary AKG supplementation linearly or quadratically enhanced hepatic and intestinal energy storage and anti-oxidative capacity of Cherry Valley ducks. © 2017 Japanese Society of Animal Science.

Evaluation of dried vegetables residues for poultry: II. Effects of feeding cabbage leaf residues on broiler performance, ileal digestibility and total tract nutrient digestibility.

PubMed

Mustafa, A F; Baurhoo, B

2017-03-01

A study was conducted to investigate the effects of partial replacing corn and soybean meal with dried cabbage leaf residues (DCR) on broiler growth performance, apparent ileal nutrient digestibility, and apparent total tract nutrient utilization. Dietary treatments include 4 levels of DCR (0, 3, 6, and 9%). Two hundred and twenty-four day-old male broilers were randomly assigned to one of 4 groups (8 cage replicates; 7 birds/cage) and grown over a 35-d experimental period. Results showed that feeding DCR had no effects on daily body weigh gain (average 53.4 g/d), daily feed intake (average 94.9 g/d), and feed conversion ratio (average 1.78 g of feed/g of gain). Inclusion of DCR reduced apparent ileal DM (quadratic effect, P < 0.001), OM (linear effect, P = 0.012), and CP (quadratic effect, P = 0.001) digestibility of younger birds (d 21) while incremental levels of DCR had no effect on apparent ileal nutrient digestibilities of older birds (d 35). Apparent total tract digestibility of DM, OM, and CP increased (linear effect, P < 0.001) as the level of DCR increased. It was concluded that the inclusion of DCR in broiler diets up to 9% had no negative impact on bird performance and apparent ileal digestibility of older birds and improved apparent total tract nutrient digestibility. © 2016 Poultry Science Association Inc.

Students' Understanding of Quadratic Equations

ERIC Educational Resources Information Center

López, Jonathan; Robles, Izraim; Martínez-Planell, Rafael

2016-01-01

Action-Process-Object-Schema theory (APOS) was applied to study student understanding of quadratic equations in one variable. This required proposing a detailed conjecture (called a genetic decomposition) of mental constructions students may do to understand quadratic equations. The genetic decomposition which was proposed can contribute to help…

Gravitational lensing by eigenvalue distributions of random matrix models

NASA Astrophysics Data System (ADS)

Martínez Alonso, Luis; Medina, Elena

2018-05-01

We propose to use eigenvalue densities of unitary random matrix ensembles as mass distributions in gravitational lensing. The corresponding lens equations reduce to algebraic equations in the complex plane which can be treated analytically. We prove that these models can be applied to describe lensing by systems of edge-on galaxies. We illustrate our analysis with the Gaussian and the quartic unitary matrix ensembles.

Sur le spectre du laplacien des fibrés en tores qui s'effondrent

NASA Astrophysics Data System (ADS)

Jammes, Pierre

2005-06-01

We study the small eigenvalues of the Hodge Laplacian on collaping torus bundles with bounded curvature. In the first part of this dissertation, we consider examples of bundles on S^1 and T^2 with homogeneous structure. In the second part, we give a lower bound of the first non-zero eigenvalue of the 1-form Laplacian on principal torus bundles.

Those Do What? Connecting Eigenvectors and Eigenvalues to the Rest of Linear Algebra: Using Visual Enhancements to Help Students Connect Eigenvectors to the Rest of Linear Algebra

ERIC Educational Resources Information Center

Nyman, Melvin A.; Lapp, Douglas A.; St. John, Dennis; Berry, John S.

2010-01-01

This paper discusses student difficulties in grasping concepts from Linear Algebra--in particular, the connection of eigenvalues and eigenvectors to other important topics in linear algebra. Based on our prior observations from student interviews, we propose technology-enhanced instructional approaches that might positively impact student…

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.

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.

ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization.

PubMed

Sagban, Rafid; Ku-Mahamud, Ku Ruhana; Abu Bakar, Muhamad Shahbani

2015-01-01

A statistical machine learning indicator, ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens' acoustics of their ant hosts. The parasites' reaction results from their ability to indicate the state of penetration. The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance's matrix, especially when combinatorial optimization problems with rugged fitness landscape are applied. The performance of the proposed indicator is evaluated against the existing indicators in six variants of ant colony optimization algorithms. Instances for travelling salesman problem and quadratic assignment problem are used in the experimental evaluation. The analytical results showed that the proposed indicator is more informative and more robust.

Optimization Models for Scheduling of Jobs

PubMed Central

Indika, S. H. Sathish; Shier, Douglas R.

2006-01-01

This work is motivated by a particular scheduling problem that is faced by logistics centers that perform aircraft maintenance and modification. Here we concentrate on a single facility (hangar) which is equipped with several work stations (bays). Specifically, a number of jobs have already been scheduled for processing at the facility; the starting times, durations, and work station assignments for these jobs are assumed to be known. We are interested in how best to schedule a number of new jobs that the facility will be processing in the near future. We first develop a mixed integer quadratic programming model (MIQP) for this problem. Since the exact solution of this MIQP formulation is time consuming, we develop a heuristic procedure, based on existing bin packing techniques. This heuristic is further enhanced by application of certain local optimality conditions. PMID:27274921

Quadratic Damping

ERIC Educational Resources Information Center

Fay, Temple H.

2012-01-01

Quadratic friction involves a discontinuous damping term in equations of motion in order that the frictional force always opposes the direction of the motion. Perhaps for this reason this topic is usually omitted from beginning texts in differential equations and physics. However, quadratic damping is more realistic than viscous damping in many…

Visualising the Roots of Quadratic Equations with Complex Coefficients

ERIC Educational Resources Information Center

Bardell, Nicholas S.

2014-01-01

This paper is a natural extension of the root visualisation techniques first presented by Bardell (2012) for quadratic equations with real coefficients. Consideration is now given to the familiar quadratic equation "y = ax[superscript 2] + bx + c" in which the coefficients "a," "b," "c" are generally…

Simply Prairie Homepage

Science.gov Websites

Ed Home - Data Home PRAIRIE ADVOCATES Project - QUADRAT STUDY Project Answer research questions multi-state quadrat study. Bob Lootens, Fermilab Join us! Check out the Quadrat Study Project. Prairie study a prairie "expert" to facilitate your research student Internet access an e-mail address

Numerical Aspects of Eigenvalue and Eigenfunction Computations for Chaotic Quantum Systems

NASA Astrophysics Data System (ADS)

Bäcker, A.

Summary: We give an introduction to some of the numerical aspects in quantum chaos. The classical dynamics of two-dimensional area-preserving maps on the torus is illustrated using the standard map and a perturbed cat map. The quantization of area-preserving maps given by their generating function is discussed and for the computation of the eigenvalues a computer program in Python is presented. We illustrate the eigenvalue distribution for two types of perturbed cat maps, one leading to COE and the other to CUE statistics. For the eigenfunctions of quantum maps we study the distribution of the eigenvectors and compare them with the corresponding random matrix distributions. The Husimi representation allows for a direct comparison of the localization of the eigenstates in phase space with the corresponding classical structures. Examples for a perturbed cat map and the standard map with different parameters are shown. Billiard systems and the corresponding quantum billiards are another important class of systems (which are also relevant to applications, for example in mesoscopic physics). We provide a detailed exposition of the boundary integral method, which is one important method to determine the eigenvalues and eigenfunctions of the Helmholtz equation. We discuss several methods to determine the eigenvalues from the Fredholm equation and illustrate them for the stadium billiard. The occurrence of spurious solutions is discussed in detail and illustrated for the circular billiard, the stadium billiard, and the annular sector billiard. We emphasize the role of the normal derivative function to compute the normalization of eigenfunctions, momentum representations or autocorrelation functions in a very efficient and direct way. Some examples for these quantities are given and discussed.

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.

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.

Geometric quadratic stochastic operator on countable infinite set

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

Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar

2015-02-03

In this paper we construct the family of Geometric quadratic stochastic operators defined on the countable sample space of nonnegative integers and investigate their trajectory behavior. Such operators can be reinterpreted in terms of of evolutionary operator of free population. We show that Geometric quadratic stochastic operators are regular transformations.

An Unexpected Influence on a Quadratic

ERIC Educational Resources Information Center

Davis, Jon D.

2013-01-01

Using technology to explore the coefficients of a quadratic equation can lead to an unexpected result. This article describes an investigation that involves sliders and dynamically linked representations. It guides students to notice the effect that the parameter "a" has on the graphical representation of a quadratic function in the form…

Differences between quadratic equations and functions: Indonesian pre-service secondary mathematics teachers’ views

NASA Astrophysics Data System (ADS)

Aziz, T. A.; Pramudiani, P.; Purnomo, Y. W.

2018-01-01

Difference between quadratic equation and quadratic function as perceived by Indonesian pre-service secondary mathematics teachers (N = 55) who enrolled at one private university in Jakarta City was investigated. Analysis of participants’ written responses and interviews were conducted consecutively. Participants’ written responses highlighted differences between quadratic equation and function by referring to their general terms, main characteristics, processes, and geometrical aspects. However, they showed several obstacles in describing the differences such as inappropriate constraints and improper interpretations. Implications of the study are discussed.

Accuracy of analytic energy level formulas applied to hadronic spectroscopy of heavy mesons

NASA Technical Reports Server (NTRS)

Badavi, Forooz F.; Norbury, John W.; Wilson, John W.; Townsend, Lawrence W.

1988-01-01

Linear and harmonic potential models are used in the nonrelativistic Schroedinger equation to obtain article mass spectra for mesons as bound states of quarks. The main emphasis is on the linear potential where exact solutions of the S-state eigenvalues and eigenfunctions and the asymptotic solution for the higher order partial wave are obtained. A study of the accuracy of two analytical energy level formulas as applied to heavy mesons is also included. Cornwall's formula is found to be particularly accurate and useful as a predictor of heavy quarkonium states. Exact solution for all partial waves of eigenvalues and eigenfunctions for a harmonic potential is also obtained and compared with the calculated discrete spectra of the linear potential. Detailed derivations of the eigenvalues and eigenfunctions of the linear and harmonic potentials are presented in appendixes.

Hydrodynamics of the Polyakov line in SU(N c) Yang-Mills

DOE PAGES

Liu, Yizhuang; Warchoł, Piotr; Zahed, Ismail

2015-12-08

We discuss a hydrodynamical description of the eigenvalues of the Polyakov line at large but finite N c for Yang-Mills theory in even and odd space-time dimensions. The hydro-static solutions for the eigenvalue densities are shown to interpolate between a uniform distribution in the confined phase and a localized distribution in the de-confined phase. The resulting critical temperatures are in overall agreement with those measured on the lattice over a broad range of N c, and are consistent with the string model results at N c = ∞. The stochastic relaxation of the eigenvalues of the Polyakov line out ofmore » equilibrium is captured by a hydrodynamical instanton. An estimate of the probability of formation of a Z(N c)bubble using a piece-wise sound wave is suggested.« less

Coherence analysis of a class of weighted networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; He, Jiaojiao; Zong, Yue; Ju, Tingting; Sun, Yu; Su, Weiyi

2018-04-01

This paper investigates consensus dynamics in a dynamical system with additive stochastic disturbances that is characterized as network coherence by using the Laplacian spectrum. We introduce a class of weighted networks based on a complete graph and investigate the first- and second-order network coherence quantifying as the sum and square sum of reciprocals of all nonzero Laplacian eigenvalues. First, the recursive relationship of its eigenvalues at two successive generations of Laplacian matrix is deduced. Then, we compute the sum and square sum of reciprocal of all nonzero Laplacian eigenvalues. The obtained results show that the scalings of first- and second-order coherence with network size obey four and five laws, respectively, along with the range of the weight factor. Finally, it indicates that the scalings of our studied networks are smaller than other studied networks when 1/√{d }

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.

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.

Eigenvalue-eigenvector decomposition (EED) analysis of dissimilarity and covariance matrix obtained from total synchronous fluorescence spectral (TSFS) data sets of herbal preparations: Optimizing the classification approach.

PubMed

Tarai, Madhumita; Kumar, Keshav; Divya, O; Bairi, Partha; Mishra, Kishor Kumar; Mishra, Ashok Kumar

2017-09-05

The present work compares the dissimilarity and covariance based unsupervised chemometric classification approaches by taking the total synchronous fluorescence spectroscopy data sets acquired for the cumin and non-cumin based herbal preparations. The conventional decomposition method involves eigenvalue-eigenvector analysis of the covariance of the data set and finds the factors that can explain the overall major sources of variation present in the data set. The conventional approach does this irrespective of the fact that the samples belong to intrinsically different groups and hence leads to poor class separation. The present work shows that classification of such samples can be optimized by performing the eigenvalue-eigenvector decomposition on the pair-wise dissimilarity matrix. Copyright © 2017 Elsevier B.V. All rights reserved.

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.

Determination of Dietary Iron Requirements by Full Expression of Iron-Containing Enzymes in Various Tissues of Broilers.

PubMed

Ma, Xinyan; Liao, Xiudong; Lu, Lin; Li, Sufen; Zhang, Liyang; Luo, Xugang

2016-11-01

The current dietary iron requirement (80 mg/kg) of broilers is mainly based on growth, hemoglobin concentration, or hematocrit data obtained in a few early studies; however, expressions of iron-containing enzymes might be more sensitive novel criteria to evaluate dietary iron requirements. The objective of this study was to determine dietary iron requirements of broilers for the full expression of succinate dehydrogenase (SDH), catalase, and cytochrome c oxidase (COX) in various tissues. A total of 336 1-d-old Arbor Acres male chicks were randomly assigned to 1 of 7 treatments with 6 replicates and fed a basal corn and soybean-meal diet (control, containing 67 mg Fe/kg) and the basal diet supplemented with 20, 40, 60, 80, 100, or 120 mg Fe/kg from FeSO 4 ⋅ 7H 2 O for 21 d. Regression analysis was performed to estimate the optimal dietary iron concentration with the use of broken-line or quadratic models. SDH activity in the liver and heart, COX and catalase activity in the liver, Sdh mRNA levels in the liver, and Cox mRNA levels in the liver and heart of broilers were affected (P < 0.027) by supplemental iron concentration, and increased quadratically (P < 0.004) as dietary iron concentration increased. Dietary iron requirements estimated on the basis of fitted broken-line or quadratic-curve models (P < 0.005) of the above indexes were 97-136 mg/kg. SDH activity in the liver and heart, COX and catalase activity in the liver, Sdh mRNA levels in the liver, and Cox mRNA levels in the liver and heart are, to our knowledge, new and sensitive criteria to evaluate the dietary iron requirements of broilers, and the dietary iron requirements would be 97-136 mg/kg to support the full expression of the above iron-containing enzymes in various tissues of broiler chicks from 1 to 21 d of age, which are higher than the current NRC iron requirement. © 2016 American Society for Nutrition.

Effectiveness of scat-detection dogs in determining species presence in a tropical savanna landscape.

PubMed

Vynne, Carly; Skalski, John R; Machado, Ricardo B; Groom, Martha J; Jácomo, Anah T A; Marinho-Filho, Jader; Ramos Neto, Mario B; Pomilla, Cristina; Silveira, Leandro; Smith, Heath; Wasser, Samuel K

2011-02-01

Most protected areas are too small to sustain populations of wide-ranging mammals; thus, identification and conservation of high-quality habitat for those animals outside parks is often a high priority, particularly for regions where extensive land conversion is occurring. This is the case in the vicinity of Emas National Park, a small protected area in the Brazilian Cerrado. Over the last 40 years the native vegetation surrounding the park has been converted to agriculture, but the region still supports virtually all of the animals native to the area. We determined the effectiveness of scat-detection dogs in detecting presence of five species of mammals threatened with extinction by habitat loss: maned wolf (Chrysocyon brachyurus), puma (Puma concolor), jaguar (Panthera onca), giant anteater (Myrmecophaga tridactyla), and giant armadillo (Priodontes maximus). The probability of scat detection varied among the five species and among survey quadrats of different size, but was consistent across team, season, and year. The probability of occurrence, determined from the presence of scat, in a randomly selected site within the study area ranged from 0.14 for jaguars, which occur primarily in the forested areas of the park, to 0.91 for maned wolves, the most widely distributed species in our study area. Most occurrences of giant armadillos in the park were in open grasslands, but in the agricultural matrix they tended to occur in riparian woodlands. At least one target species occurred in every survey quadrat, and giant armadillos, jaguars, and maned wolves were more likely to be present in quadrats located inside than outside the park. The effort required for detection of scats was highest for the two felids. We were able to detect the presence for each of five wide-ranging species inside and outside the park and to assign occurrence probabilities to specific survey sites. Thus, scat dogs provide an effective survey tool for rare species even when accurate detection likelihoods are required. We believe the way we used scat-detection dogs to determine the presence of species can be applied to the detection of other mammalian species in other ecosystems. ©2010 Society for Conservation Biology.

Lichen Persistence and Recovery in Response to Varied Volcanic Disturbances

NASA Astrophysics Data System (ADS)

Nelson, P.; Wheeler, T. B.

2015-12-01

Volcanic eruptions produce many ecological disturbances that structure vegetation. While lichens are sensitive to disturbances, little is known about their responses to volcanic disturbances, except for colonization of lava. We examined lichen community responses through time to different disturbances produced by the May 1, 2008 eruption of Volcan Chaiten in south-central Chile. Pre-eruption vegetation near the volcano was old-growth Valdivian temperate rainforest dominated by closed-canopy Nothofagus sp... In 2012, we installed thirteen 1-acre plots across volcanic disturbance zones on which a time-constrained search was done for all macrolichen species, each of which was assigned an approximate log10 categorical abundance. We also installed a 0.2 m2 quadrat on two representative trees per plot for repeat photography of lichen cover. We remeasured at least one plot per disturbance zone in 2014 and re-photographed tree quadrats in 2013 and 2014. We then analyzed species composition and abundance differences among disturbance zones. In 2012, the blast (pyroclastic density flow), scorch (standing scorched forest at the edge of the blast) and deep tephra (>10 cm) zones had the lowest lichen species richness (5-13 species), followed by reference (unimpacted) and shallow (<10 cm) tephra (17-20 species). Gravel rain (preexisting rock ejected by eruption initiation), gravel rain + pumice and flooded forests (fluvially reworked volcanic material entrained by heavy rains) were species-rich (25-42 species). In 2014, the blast and deep tephra had regained 2-3 times the number of lichen species since 2012 while the light tephra and reference were essentially unchanged. Gravel rain, gravel rain + pumice and flooded forest plots all had about the same number of species in 2014 as 2012. Lichen colonization and growth in tree quadrats varied widely, from very little colonization in the blast to prolific colonization in the gravel rain + pumice zone. Lichen's varied responses to different volcanic disturbances were attributable to varying degrees of mortality and subsequent availability of substrate, quantity of light and removal of competitors. While sensitive to disturbance, lichens are apparently resilient to and can quickly recolonize after a variety of large, violent volcanic disturbances.

Acetate Dose-Dependently Stimulates Milk Fat Synthesis in Lactating Dairy Cows.

PubMed

Urrutia, Natalie L; Harvatine, Kevin J

2017-05-01

Background: Acetate is a short-chain fatty acid (FA) that is especially important to cows because it is the major substrate for de novo FA synthesis. However, the effect of acetate supply on mammary lipid synthesis is not clear. Objective: The objective of this experiment was to determine the effect of increasing acetate supply on milk fat synthesis in lactating dairy cows. Methods: Six multiparous lactating Holstein cows were randomly assigned to treatments in a replicated design to investigate the effect of acetate supply on milk fat synthesis. Treatments were 0 (control), 5, 10, and 15 mol acetate/d continuously infused into the rumen for 4 d. Rumen short-chain FAs, plasma hormones and metabolites, milk fat concentration, and milk FA profile were analyzed on day 4 of each treatment. Polynomial contrasts were used to test the linear and quadratic effects of increasing acetate supply. Results: Acetate increased milk fat yield quadratically ( P < 0.01) by 7%, 16%, and 14% and increased milk fat concentration linearly ( P < 0.001) by 6%, 9%, and 11% for 5, 10, and 15 mol acetate/d, respectively, compared with the control treatment. Increased milk fat yield predominantly was due to a linear increase in 16-carbon FAs ( P < 0.001) and a quadratic increase in de novo synthesized FAs (<16-carbon FAs; P < 0.01), indicating that there was stimulation of de novo synthesis pathways. Apparent transfer of acetate to milk fat was 33.4%, 36.2%, and 20.6% for 5, 10, and 15 mol/d, respectively. Acetate infusion linearly increased the relative concentration of rumen acetate ( P < 0.001) before feeding, but not after feeding. Acetate linearly increased plasma ß-hydroxybutyric acid by 29%, 50%, and 78%, respectively, after feeding compared with the control treatment ( P < 0.01). Conclusions: Increasing acetate supply to lactating cows increases milk fat synthesis, suggesting that nutritional strategies that increase ruminal acetate absorption would be expected to increase milk fat by increasing de novo FA synthesis. © 2017 American Society for Nutrition.

Visibility of quantum graph spectrum from the vertices

NASA Astrophysics Data System (ADS)

Kühn, Christian; Rohleder, Jonathan

2018-03-01

We investigate the relation between the eigenvalues of the Laplacian with Kirchhoff vertex conditions on a finite metric graph and a corresponding Titchmarsh-Weyl function (a parameter-dependent Neumann-to-Dirichlet map). We give a complete description of all real resonances, including multiplicities, in terms of the edge lengths and the connectivity of the graph, and apply it to characterize all eigenvalues which are visible for the Titchmarsh-Weyl function.

Efficient, massively parallel eigenvalue computation

NASA Technical Reports Server (NTRS)

Huo, Yan; Schreiber, Robert

1993-01-01

In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. An effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD computers, the Maspar MP-1 and MP-2 systems, is described. Results of numerical tests and timings are also presented.

CFD simulation of simultaneous monotonic cooling and surface heat transfer coefficient

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

Mihálka, Peter, E-mail: usarmipe@savba.sk; Matiašovský, Peter, E-mail: usarmat@savba.sk

The monotonic heating regime method for determination of thermal diffusivity is based on the analysis of an unsteady-state (stabilised) thermal process characterised by an independence of the space-time temperature distribution on initial conditions. At the first kind of the monotonic regime a sample of simple geometry is heated / cooled at constant ambient temperature. The determination of thermal diffusivity requires the determination rate of a temperature change and simultaneous determination of the first eigenvalue. According to a characteristic equation the first eigenvalue is a function of the Biot number defined by a surface heat transfer coefficient and thermal conductivity ofmore » an analysed material. Knowing the surface heat transfer coefficient and the first eigenvalue the thermal conductivity can be determined. The surface heat transport coefficient during the monotonic regime can be determined by the continuous measurement of long-wave radiation heat flow and the photoelectric measurement of the air refractive index gradient in a boundary layer. CFD simulation of the cooling process was carried out to analyse local convective and radiative heat transfer coefficients more in detail. Influence of ambient air flow was analysed. The obtained eigenvalues and corresponding surface heat transfer coefficient values enable to determine thermal conductivity of the analysed specimen together with its thermal diffusivity during a monotonic heating regime.« less

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 Projection free method for Generalized Eigenvalue Problem with a nonsmooth Regularizer.

PubMed

Hwang, Seong Jae; Collins, Maxwell D; Ravi, Sathya N; Ithapu, Vamsi K; Adluru, Nagesh; Johnson, Sterling C; Singh, Vikas

2015-12-01

Eigenvalue problems are ubiquitous in computer vision, covering a very broad spectrum of applications ranging from estimation problems in multi-view geometry to image segmentation. Few other linear algebra problems have a more mature set of numerical routines available and many computer vision libraries leverage such tools extensively. However, the ability to call the underlying solver only as a "black box" can often become restrictive. Many 'human in the loop' settings in vision frequently exploit supervision from an expert, to the extent that the user can be considered a subroutine in the overall system. In other cases, there is additional domain knowledge, side or even partial information that one may want to incorporate within the formulation. In general, regularizing a (generalized) eigenvalue problem with such side information remains difficult. Motivated by these needs, this paper presents an optimization scheme to solve generalized eigenvalue problems (GEP) involving a (nonsmooth) regularizer. We start from an alternative formulation of GEP where the feasibility set of the model involves the Stiefel manifold. The core of this paper presents an end to end stochastic optimization scheme for the resultant problem. We show how this general algorithm enables improved statistical analysis of brain imaging data where the regularizer is derived from other 'views' of the disease pathology, involving clinical measurements and other image-derived representations.

Some Paradoxical Results for the Quadratically Weighted Kappa

ERIC Educational Resources Information Center

Warrens, Matthijs J.

2012-01-01

The quadratically weighted kappa is the most commonly used weighted kappa statistic for summarizing interrater agreement on an ordinal scale. The paper presents several properties of the quadratically weighted kappa that are paradoxical. For agreement tables with an odd number of categories "n" it is shown that if one of the raters uses the same…

Quadratic elongation: A quantitative measure of distortion in coordination polyhedra

USGS Publications Warehouse

Robinson, Kelly F.; Gibbs, G.V.; Ribbe, P.H.

1971-01-01

Quadratic elongation and the variance of bond angles are linearly correlated for distorted octahedral and tetrahedral coordination complexes, both of which show variations in bond length and bond angle. The quadratic elonga tion is dimensionless, giving a quantitative measure of polyhedral distortion which is independent of the effective size of the polyhedron.

Analysis of Students' Error in Learning of Quadratic Equations

ERIC Educational Resources Information Center

Zakaria, Effandi; Ibrahim; Maat, Siti Mistima

2010-01-01

The purpose of the study was to determine the students' error in learning quadratic equation. The samples were 30 form three students from a secondary school in Jambi, Indonesia. Diagnostic test was used as the instrument of this study that included three components: factorization, completing the square and quadratic formula. Diagnostic interview…

Lump solutions to nonlinear partial differential equations via Hirota bilinear forms

NASA Astrophysics Data System (ADS)

Ma, Wen-Xiu; Zhou, Yuan

2018-02-01

Lump solutions are analytical rational function solutions localized in all directions in space. We analyze a class of lump solutions, generated from quadratic functions, to nonlinear partial differential equations. The basis of success is the Hirota bilinear formulation and the primary object is the class of positive multivariate quadratic functions. A complete determination of quadratic functions positive in space and time is given, and positive quadratic functions are characterized as sums of squares of linear functions. Necessary and sufficient conditions for positive quadratic functions to solve Hirota bilinear equations are presented, and such polynomial solutions yield lump solutions to nonlinear partial differential equations under the dependent variable transformations u = 2(ln ⁡ f) x and u = 2(ln ⁡ f) xx, where x is one spatial variable. Applications are made for a few generalized KP and BKP equations.

Linear and quadratic static response functions and structure functions in Yukawa liquids.

PubMed

Magyar, Péter; Donkó, Zoltán; Kalman, Gabor J; Golden, Kenneth I

2014-08-01

We compute linear and quadratic static density response functions of three-dimensional Yukawa liquids by applying an external perturbation potential in molecular dynamics simulations. The response functions are also obtained from the equilibrium fluctuations (static structure factors) in the system via the fluctuation-dissipation theorems. The good agreement of the quadratic response functions, obtained in the two different ways, confirms the quadratic fluctuation-dissipation theorem. We also find that the three-point structure function may be factorizable into two-point structure functions, leading to a cluster representation of the equilibrium triplet correlation function.

An Algebraic Approach for Solving Quadratic Inequalities

ERIC Educational Resources Information Center

Mahmood, Munir; Al-Mirbati, Rudaina

2017-01-01

In recent years most text books utilise either the sign chart or graphing functions in order to solve a quadratic inequality of the form ax[superscript 2] + bx + c < 0 This article demonstrates an algebraic approach to solve the above inequality. To solve a quadratic inequality in the form of ax[superscript 2] + bx + c < 0 or in the…

Effects of Classroom Instruction on Students' Understanding of Quadratic Equations

ERIC Educational Resources Information Center

Vaiyavutjamai, Pongchawee; Clements, M. A.

2006-01-01

Two hundred and thirty-one students in six Grade 9 classes in two government secondary schools located near Chiang Mai, Thailand, attempted to solve the same 18 quadratic equations before and after participating in 11 lessons on quadratic equations. Data from the students' written responses to the equations, together with data in the form of…

Computing the Partial Fraction Decomposition of Rational Functions with Irreducible Quadratic Factors in the Denominators

ERIC Educational Resources Information Center

Man, Yiu-Kwong

2012-01-01

In this note, a new method for computing the partial fraction decomposition of rational functions with irreducible quadratic factors in the denominators is presented. This method involves polynomial divisions and substitutions only, without having to solve for the complex roots of the irreducible quadratic polynomial or to solve a system of linear…

On Vieta's Formulas and the Determination of a Set of Positive Integers by Their Sum and Product

ERIC Educational Resources Information Center

Valahas, Theodoros; Boukas, Andreas

2011-01-01

In Years 9 and 10 of secondary schooling students are typically introduced to quadratic expressions and functions and related modelling, algebra, and graphing. This includes work on the expansion and factorisation of quadratic expressions (typically with integer values of coefficients), graphing quadratic functions, finding the roots of quadratic…

Sketching the General Quadratic Equation Using Dynamic Geometry Software

ERIC Educational Resources Information Center

Stols, G. H.

2005-01-01

This paper explores a geometrical way to sketch graphs of the general quadratic in two variables with Geometer's Sketchpad. To do this, a geometric procedure as described by De Temple is used, bearing in mind that this general quadratic equation (1) represents all the possible conics (conics sections), and the fact that five points (no three of…

On Distributed Strategies in Defense of a High Value Unit (HVU) Against a Swarm Attack

DTIC Science & Technology

2012-09-01

function [ lam ,U] = tqr(a,b,U) % [ lam u] = tqr(a,b) or [ lam U] = tqr(a,b,U... lam u] = tqr(a,b): % % The column lam contains the eigenvalues of the Hermitian tridiagonal % matrix T = mxt(a,b) computed by one version of the...computed. The computed eigenvalues are real and are sorted to be % nonincreasing. % % [ lam U] = tqr(a,b,U): % % This replaces the input U

Legendre-Tau approximation for functional differential equations. Part 3: Eigenvalue approximations and uniform stability

NASA Technical Reports Server (NTRS)

Ito, K.

1984-01-01

The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.

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.

Exact evaluations of some Meijer G-functions and probability of all eigenvalues real for the product of two Gaussian matrices

NASA Astrophysics Data System (ADS)

Kumar, Santosh

2015-11-01

We provide a proof to a recent conjecture by Forrester (2014 J. Phys. A: Math. Theor. 47 065202) regarding the algebraic and arithmetic structure of Meijer G-functions which appear in the expression for probability of all eigenvalues real for the product of two real Gaussian matrices. In the process we come across several interesting identities involving Meijer G-functions.

Exact evaluation of the causal spectrum and localization properties of electronic states on a scale-free network

NASA Astrophysics Data System (ADS)

Xie, Pinchen; Yang, Bingjia; Zhang, Zhongzhi; Andrade, Roberto F. S.

2018-07-01

A deterministic network with tree structure is considered, for which the spectrum of its adjacency matrix can be exactly evaluated by a recursive renormalization approach. It amounts to successively increasing number of contributions at any finite step of construction of the tree, resulting in a causal chain. The resulting eigenvalues can be related the full energy spectrum of a nearest-neighbor tight-binding model defined on this structure. Given this association, it turns out that further properties of the eigenvectors can be evaluated, like the degree of quantum localization of the tight-binding eigenstates, expressed by the inverse participation ratio (IPR). It happens that, for the current model, the IPR's are also suitable to be analytically expressed in terms in corresponding eigenvalue chain. The resulting IPR scaling behavior is expressed by the tails of eigenvalue chains as well.

Statistics of transmission eigenvalues in two-dimensional quantum cavities: Ballistic versus stochastic scattering

NASA Astrophysics Data System (ADS)

Rotter, Stefan; Aigner, Florian; Burgdörfer, Joachim

2007-03-01

We investigate the statistical distribution of transmission eigenvalues in phase-coherent transport through quantum dots. In two-dimensional ab initio simulations for both clean and disordered two-dimensional cavities, we find markedly different quantum-to-classical crossover scenarios for these two cases. In particular, we observe the emergence of “noiseless scattering states” in clean cavities, irrespective of sharp-edged entrance and exit lead mouths. We find the onset of these “classical” states to be largely independent of the cavity’s classical chaoticity, but very sensitive with respect to bulk disorder. Our results suggest that for weakly disordered cavities, the transmission eigenvalue distribution is determined both by scattering at the disorder potential and the cavity walls. To properly account for this intermediate parameter regime, we introduce a hybrid crossover scheme, which combines previous models that are valid in the ballistic and the stochastic limit, respectively.

On curve veering and flutter of rotating blades

NASA Technical Reports Server (NTRS)

Afolabi, Dare; Mehmed, Oral

1993-01-01

The eigenvalues of rotating blades usually change with rotation speed according to the Stodola-Southwell criterion. Under certain circumstances, the loci of eigenvalues belonging to two distinct modes of vibration approach each other very closely, and it may appear as if the loci cross each other. However, our study indicates that the observable frequency loci of an undamped rotating blade do not cross, but must either repel each other (leading to 'curve veering'), or attract each other (leading to 'frequency coalescence'). Our results are reached by using standard arguments from algebraic geometry--the theory of algebraic curves and catastrophe theory. We conclude that it is important to resolve an apparent crossing of eigenvalue loci into either a frequency coalescence or a curve veering, because frequency coalescence is dangerous since it leads to flutter, whereas curve veering does not precipitate flutter and is, therefore, harmless with respect to elastic stability.

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

Ground-state energies and highest occupied eigenvalues of atoms in exchange-only density-functional theory

NASA Astrophysics Data System (ADS)

Li, Yan; Harbola, Manoj K.; Krieger, J. B.; Sahni, Viraht

1989-11-01

The exchange-correlation potential of the Kohn-Sham density-functional theory has recently been interpreted as the work required to move an electron against the electric field of its Fermi-Coulomb hole charge distribution. In this paper we present self-consistent results for ground-state total energies and highest occupied eigenvalues of closed subshell atoms as obtained by this formalism in the exchange-only approximation. The total energies, which are an upper bound, lie within 50 ppm of Hartree-Fock theory for atoms heavier than Be. The highest occupied eigenvalues, as a consequence of this interpretation, approximate well the experimental ionization potentials. In addition, the self-consistently calculated exchange potentials are very close to those of Talman and co-workers [J. D. Talman and W. F. Shadwick, Phys. Rev. A 14, 36 (1976); K. Aashamar, T. M. Luke, and J. D. Talman, At. Data Nucl. Data Tables 22, 443 (1978)].

Asymmetric correlation matrices: an analysis of financial data

NASA Astrophysics Data System (ADS)

Livan, G.; Rebecchi, L.

2012-06-01

We analyse the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non-symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random matrix theory results on the average eigenvalue density of this type of matrix to distinguish between noise and non-trivial correlation structures, and we focus on financial data as a case study. Namely, we employ daily prices of stocks belonging to the American and British stock exchanges, and look for the emergence of correlations between two such markets in the eigenvalue spectrum of their non-symmetric correlation matrix. We find several non trivial results when considering time-lagged correlations over short lags, and we corroborate our findings by additionally studying the asymmetric correlation matrix of the principal components of our datasets.

Analytical bound-state solutions of the Schrödinger equation for the Manning-Rosen plus Hulthén potential within SUSY quantum mechanics

NASA Astrophysics Data System (ADS)

Ahmadov, A. I.; Naeem, Maria; Qocayeva, M. V.; Tarverdiyeva, V. A.

2018-01-01

In this paper, the bound-state solution of the modified radial Schrödinger equation is obtained for the Manning-Rosen plus Hulthén potential by using new developed scheme to overcome the centrifugal part. The energy eigenvalues and corresponding radial wave functions are defined for any l≠0 angular momentum case via the Nikiforov-Uvarov (NU) and supersymmetric quantum mechanics (SUSY QM) methods. Thanks to both methods, equivalent expressions are obtained for the energy eigenvalues, and the expression of radial wave functions transformations to each other is presented. The energy levels and the corresponding normalized eigenfunctions are represented in terms of the Jacobi polynomials for arbitrary l states. A closed form of the normalization constant of the wave functions is also found. It is shown that, the energy eigenvalues and eigenfunctions are sensitive to nr radial and l orbital quantum numbers.

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).

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.

Analyzing Small Signal Stability of Power System based on Online Data by Use of SMES

NASA Astrophysics Data System (ADS)

Ishikawa, Hiroyuki; Shirai, Yasuyuki; Nitta, Tanzo; Shibata, Katsuhiko

The purpose of this study is to estimate eigen-values and eigen-vectors of a power system from on-line data to evaluate the power system stability. Power system responses due to the small power modulation of known pattern from SMES (Superconducting Magnetic Energy Storage) were analyzed, and the transfer functions between the power modulation and power oscillations of generators were obtained. Eigen-values and eigen-vectors were estimated from the transfer functions. Experiments were carried out by use of a model SMES and Advanced Power System Analyzer (APSA), which is an analogue type power system simulator of Kansai Electric Power Company Inc., Japan. Changes in system condition were observed by the estimated eigen-values and eigen-vectors. Result agreed well with the resent report and digital simulation. This method gives a new application for SMES, which will be installed for improving electric power quality.

Determination of eigenvalues of dynamical systems by symbolic computation

NASA Technical Reports Server (NTRS)

Howard, J. C.

1982-01-01

A symbolic computation technique for determining the eigenvalues of dynamical systems is described wherein algebraic operations, symbolic differentiation, matrix formulation and inversion, etc., can be performed on a digital computer equipped with a formula-manipulation compiler. An example is included that demonstrates the facility with which the system dynamics matrix and the control distribution matrix from the state space formulation of the equations of motion can be processed to obtain eigenvalue loci as a function of a system parameter. The example chosen to demonstrate the technique is a fourth-order system representing the longitudinal response of a DC 8 aircraft to elevator inputs. This simplified system has two dominant modes, one of which is lightly damped and the other well damped. The loci may be used to determine the value of the controlling parameter that satisfied design requirements. The results were obtained using the MACSYMA symbolic manipulation system.

Topology and geometry of the dark matter web: A multi-stream view

NASA Astrophysics Data System (ADS)

Ramachandra, Nesar S.; Shandarin, Sergei F.

2017-05-01

Topological connections in the single-streaming voids and multistreaming filaments and walls reveal a cosmic web structure different from traditional mass density fields. A single void structure not only percolates the multistream field in all the directions, but also occupies over 99 per cent of all the single-streaming regions. Sub-grid analyses on scales smaller than simulation resolution reveal tiny pockets of voids that are isolated by membranes of the structure. For the multistreaming excursion sets, the percolating structure is significantly thinner than the filaments in overdensity excursion approach. Hessian eigenvalues of the multistream field are used as local geometrical indicators of dark matter structures. Single-streaming regions have most of the zero eigenvalues. Parameter-free conditions on the eigenvalues in the multistream region may be used to delineate primitive geometries with concavities corresponding to filaments, walls and haloes.

Single-particle energies and density of states in density functional theory

NASA Astrophysics Data System (ADS)

van Aggelen, H.; Chan, G. K.-L.

2015-07-01

Time-dependent density functional theory (TD-DFT) is commonly used as the foundation to obtain neutral excited states and transition weights in DFT, but does not allow direct access to density of states and single-particle energies, i.e. ionisation energies and electron affinities. Here we show that by extending TD-DFT to a superfluid formulation, which involves operators that break particle-number symmetry, we can obtain the density of states and single-particle energies from the poles of an appropriate superfluid response function. The standard Kohn- Sham eigenvalues emerge as the adiabatic limit of the superfluid response under the assumption that the exchange- correlation functional has no dependence on the superfluid density. The Kohn- Sham eigenvalues can thus be interpreted as approximations to the ionisation energies and electron affinities. Beyond this approximation, the formalism provides an incentive for creating a new class of density functionals specifically targeted at accurate single-particle eigenvalues and bandgaps.

The effect of changing disk parameters on whirling frequency of high speed rotor system

NASA Astrophysics Data System (ADS)

Wahab, A. M. Abdul; Rasid, Z. A.; Abu, A.; Rudin, N. F. Mohd Noor; Yakub, F.

2017-12-01

The requirement for efficiency improvement of machines has caused machine rotor to be designed to rotate at high speeds. It is known that whirling natural frequency of a shaft changes with the change of shaft speed and the design needs to avoid points of resonance where the whirling frequency equals the shaft speed. At high speeds, a shaft may have to carry a huge torque along and this torsional effect has been neglected in past shaft analyses. Whirling behaviour of high speed rotating shaft is investigated in this study with consideration of the torsional effect of the shaft. The shaft system under study consists of a shaft, discs and two bearings, and the focus is on the effect of the disc parameters. A finite element formulation is developed based on Nelson’s 5 degrees of freedom (DOF) per node element that includes the torsional degree of freedom. Bolotin’s method is applied to the derived Mathieu-Hill type of equation to get quadratic eigenvalues problem that gives the forward and backward frequencies of the shaft. Campbell’s diagrams are drawn in studying the effect of discs on the whirling behaviour of the shaft. It is found that the addition of disks on the shaft decreases the whirling frequency of the shaft and the frequency is lower for mass located at the centre of the shaft compared to the one located near to the end. The effect of torsional motion is found to be significant where the difference between critical speed of 4DOF and 5DOF models can be as high as 15%.

Effect of free-range days on a local chicken breed: growth performance, carcass yield, meat quality, and lymphoid organ index.

PubMed

Tong, H B; Wang, Q; Lu, J; Zou, J M; Chang, L L; Fu, S Y

2014-08-01

An experiment was conducted to evaluate the effect of free-range days on growth performance, carcass yield, meat quality, and lymphoid organ index of a local chicken breed. In total, 1,000 one-day-old male Suqin yellow chickens were raised for 21 d. On d 21, 720 birds with similar BW (536 ± 36 g) were selected and randomly assigned to free-range treatment at 21, 28, 35, and 42 d of age (assigned to free-range treatment for 21, 14, 7, and 0 d, respectively). Each treatment was represented by 5 replicates (pens) containing 36 birds (180 birds per treatment). All the birds were raised in indoor floor pens measuring 1.42 × 1.42 m (2 m(2), 18 birds/m(2)) in conventional poultry research houses before free-range treatment. In the free-range treatment, the chickens were raised in indoor floor houses measuring 3 × 5 m (15 m(2), 2.4 birds/m(2)). In addition, they also had an outdoor free-range paddock measuring 3 × 8 m (24 m(2), 1.5 birds/m(2)). The BW of birds after being assigned to free-range treatment for 7 d decreased significantly compared with that in the conventional treatment (P < 0.05). However, there was no effect of the free-range days on the BW at 42 d of age (P > 0.05). The daily weight gain, feed per gain, daily feed intake, and mortality from 21 to 42 d of age were unaffected by free-range days (P > 0.05). At 42 d of age, the breast yield increased linearly with increasing free-range days (P < 0.05), whereas the thigh, leg, thigh bone, and foot yields decreased linearly (P < 0.05). The lung yield showed a significant increasing and then decreasing quadratic response to increasing free-range days (P < 0.05). The water-holding capacity of the thigh muscle decreased linearly with increasing free-range days (P < 0.05), whereas there was no significant difference in the meat color, shear force, and muscle pH (P > 0.05). The absolute thymus weight and thymus:BW ratio showed a significant increasing and then decreasing quadratic response to increasing free-range days (P < 0.05). The findings of this study suggest that increasing free-range days advantageously affects breast yield, but decreases thigh, leg, thigh bone, and foot yields as well as the water-holding capacity of thigh. No evidence was found that increasing free-range days caused changes in growth performance, meat quality, and lymphoid organs except for changes in water-holding capacity and thymus. © Poultry Science Association Inc.

Tangent Lines without Derivatives for Quadratic and Cubic Equations

ERIC Educational Resources Information Center

Carroll, William J.

2009-01-01

In the quadratic equation, y = ax[superscript 2] + bx + c, the equation y = bx + c is identified as the equation of the line tangent to the parabola at its y-intercept. This is extended to give a convenient method of graphing tangent lines at any point on the graph of a quadratic or a cubic equation. (Contains 5 figures.)

Using Linear and Quadratic Functions to Teach Number Patterns in Secondary School

ERIC Educational Resources Information Center

Kenan, Kok Xiao-Feng

2017-01-01

This paper outlines an approach to definitively find the general term in a number pattern, of either a linear or quadratic form, by using the general equation of a linear or quadratic function. This approach is governed by four principles: (1) identifying the position of the term (input) and the term itself (output); (2) recognising that each…

Geometrical Solutions of Some Quadratic Equations with Non-Real Roots

ERIC Educational Resources Information Center

Pathak, H. K.; Grewal, A. S.

2002-01-01

This note gives geometrical/graphical methods of finding solutions of the quadratic equation ax[squared] + bx + c = 0, a [not equal to] 0, with non-real roots. Three different cases which give rise to non-real roots of the quadratic equation have been discussed. In case I a geometrical construction and its proof for finding the solutions of the…

Tip-tilt disturbance model identification based on non-linear least squares fitting for Linear Quadratic Gaussian control

NASA Astrophysics Data System (ADS)

Yang, Kangjian; Yang, Ping; Wang, Shuai; Dong, Lizhi; Xu, Bing

2018-05-01

We propose a method to identify tip-tilt disturbance model for Linear Quadratic Gaussian control. This identification method based on Levenberg-Marquardt method conducts with a little prior information and no auxiliary system and it is convenient to identify the tip-tilt disturbance model on-line for real-time control. This identification method makes it easy that Linear Quadratic Gaussian control runs efficiently in different adaptive optics systems for vibration mitigation. The validity of the Linear Quadratic Gaussian control associated with this tip-tilt disturbance model identification method is verified by experimental data, which is conducted in replay mode by simulation.

Functional Data Approximation on Bounded Domains using Polygonal Finite Elements.

PubMed

Cao, Juan; Xiao, Yanyang; Chen, Zhonggui; Wang, Wenping; Bajaj, Chandrajit

2018-07-01

We construct and analyze piecewise approximations of functional data on arbitrary 2D bounded domains using generalized barycentric finite elements, and particularly quadratic serendipity elements for planar polygons. We compare approximation qualities (precision/convergence) of these partition-of-unity finite elements through numerical experiments, using Wachspress coordinates, natural neighbor coordinates, Poisson coordinates, mean value coordinates, and quadratic serendipity bases over polygonal meshes on the domain. For a convex n -sided polygon, the quadratic serendipity elements have 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, rather than the usual n ( n + 1)/2 basis functions to achieve quadratic convergence. Two greedy algorithms are proposed to generate Voronoi meshes for adaptive functional/scattered data approximations. Experimental results show space/accuracy advantages for these quadratic serendipity finite elements on polygonal domains versus traditional finite elements over simplicial meshes. Polygonal meshes and parameter coefficients of the quadratic serendipity finite elements obtained by our greedy algorithms can be further refined using an L 2 -optimization to improve the piecewise functional approximation. We conduct several experiments to demonstrate the efficacy of our algorithm for modeling features/discontinuities in functional data/image approximation.

Comparison of optimization algorithms in intensity-modulated radiation therapy planning

NASA Astrophysics Data System (ADS)

Kendrick, Rachel

Intensity-modulated radiation therapy is used to better conform the radiation dose to the target, which includes avoiding healthy tissue. Planning programs employ optimization methods to search for the best fluence of each photon beam, and therefore to create the best treatment plan. The Computational Environment for Radiotherapy Research (CERR), a program written in MATLAB, was used to examine some commonly-used algorithms for one 5-beam plan. Algorithms include the genetic algorithm, quadratic programming, pattern search, constrained nonlinear optimization, simulated annealing, the optimization method used in Varian EclipseTM, and some hybrids of these. Quadratic programing, simulated annealing, and a quadratic/simulated annealing hybrid were also separately compared using different prescription doses. The results of each dose-volume histogram as well as the visual dose color wash were used to compare the plans. CERR's built-in quadratic programming provided the best overall plan, but avoidance of the organ-at-risk was rivaled by other programs. Hybrids of quadratic programming with some of these algorithms seems to suggest the possibility of better planning programs, as shown by the improved quadratic/simulated annealing plan when compared to the simulated annealing algorithm alone. Further experimentation will be done to improve cost functions and computational time.

Time-resolved infrared fluorescence from 2ν 1 and 2ν 8 modes of CF 2Cl 2 excited by a CO 2 laser

NASA Astrophysics Data System (ADS)

Vatsa, R. K.; Kumar, Awadhesh; Naik, P. D.; Rama Rao, K. V. S.; Mittal, J. P.

1993-04-01

Infrared fluorescence has been observed from the overtones and combination bands of ν 1 and ν 8 on pumping either of these modes of CF 2Cl 2 by a CO 2 laser. Excitation of the ν 8 mode gives fluorescence from 2ν 1/(ν 1 + ν 6) and 2ν 8 modes at 4.6 and 5.4 μm, respectively. The intensity of 4.6 μm fluorescence showed a quadratic dependence on the pressure of CF 2Cl 2. A decay rate constant of (2.76±0.55)×10 4 s -1 Torr -1 was obtained for this emission band and it has been assigned to intermode energy outflow from the ν 1 and ν 6 modes. The possible pathways of populating the ν 1 and ν 6 modes are discussed.

Vibrational spectra and normal coordinate analysis of diazepam, phenytoin and phenobarbitone

NASA Astrophysics Data System (ADS)

Gunasekaran, S.; Thilak Kumar, R.; Ponnusamy, S.

2006-12-01

Vibrational spectroscopy is an important tool for the structural investigation of the organic molecules. In the present investigation, a normal coordinate analysis has been carried out on some anti-epileptic drugs, viz. diazepam, phenytoin and phenobarbitone. Diazepam is a derivative of benzodiazepine, phenytoin is a derivative of hydanation and pheonobarbitone is a barbiturate. The infrared spectra of the compounds are recorded in the region 4000-400 cm -1 and Raman spectra are recorded in the region 3500-50 cm -1. From the structural point of view, diazepam, phenytoin and phenobarbitone have been assumed to C s point group. A systematic set of symmetry coordinates has been constructed for these compounds and Wilson's FG matrix method has been applied for the normal coordinate analysis using general quadratic valance force field. The potential energy distribution is also calculated to check the vibrational band assignments.

Fishing in the Amazonian forest: a gendered social network puzzle

PubMed Central

Díaz-Reviriego, I.; Fernández-Llamazares, Á.; Howard, P.L; Molina, JL; Reyes-García, V

2016-01-01

We employ social network analysis (SNA) to describe the structure of subsistence fishing social networks and to explore the relation between fishers’ emic perceptions of fishing expertise and their position in networks. Participant observation and quantitative methods were employed among the Tsimane’ Amerindians of the Bolivian Amazonia. A multiple regression quadratic assignment procedure was used to explore the extent to which gender, kinship, and age homophilies influence the formation of fishing networks. Logistic regressions were performed to determine the association between the fishers’ expertise, their socio-demographic identities, and network centrality. We found that fishing networks are gendered and that there is a positive association between fishers’ expertise and centrality in networks, an association that is more striking for women than for men. We propose that a social network perspective broadens understanding of the relations that shape the intracultural distribution of fishing expertise as well as natural resource access and use. PMID:28479670

Fishing in the Amazonian forest: a gendered social network puzzle.

PubMed

Díaz-Reviriego, I; Fernández-Llamazares, Á; Howard, P L; Molina, J L; Reyes-García, V

2017-01-01

We employ social network analysis (SNA) to describe the structure of subsistence fishing social networks and to explore the relation between fishers' emic perceptions of fishing expertise and their position in networks. Participant observation and quantitative methods were employed among the Tsimane' Amerindians of the Bolivian Amazonia. A multiple regression quadratic assignment procedure was used to explore the extent to which gender, kinship, and age homophilies influence the formation of fishing networks. Logistic regressions were performed to determine the association between the fishers' expertise, their socio-demographic identities, and network centrality. We found that fishing networks are gendered and that there is a positive association between fishers' expertise and centrality in networks, an association that is more striking for women than for men. We propose that a social network perspective broadens understanding of the relations that shape the intracultural distribution of fishing expertise as well as natural resource access and use.

Projected power iteration for network alignment

NASA Astrophysics Data System (ADS)

Onaran, Efe; Villar, Soledad

2017-08-01

The network alignment problem asks for the best correspondence between two given graphs, so that the largest possible number of edges are matched. This problem appears in many scientific problems (like the study of protein-protein interactions) and it is very closely related to the quadratic assignment problem which has graph isomorphism, traveling salesman and minimum bisection problems as particular cases. The graph matching problem is NP-hard in general. However, under some restrictive models for the graphs, algorithms can approximate the alignment efficiently. In that spirit the recent work by Feizi and collaborators introduce EigenAlign, a fast spectral method with convergence guarantees for Erd-s-Renyí graphs. In this work we propose the algorithm Projected Power Alignment, which is a projected power iteration version of EigenAlign. We numerically show it improves the recovery rates of EigenAlign and we describe the theory that may be used to provide performance guarantees for Projected Power Alignment.

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.

PubMed

Mohsen, Abdulqader M

2016-01-01

Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and local search has the ability to speed up the convergence. Therefore, this paper proposed a hybrid ACO algorithm integrating the advantages of ACO, SA, mutation operator, and local search procedure to solve the traveling salesman problem. The core of algorithm is based on the ACO. SA and mutation operator were used to increase the ants population diversity from time to time and the local search was used to exploit the current search area efficiently. The comparative experiments, using 24 TSP instances from TSPLIB, show that the proposed algorithm outperformed some well-known algorithms in the literature in terms of solution quality.

Fourier-transform-infrared-spectroscopy based spectral-biomarker selection towards optimum diagnostic differentiation of oral leukoplakia and cancer.

PubMed

Banerjee, Satarupa; Pal, Mousumi; Chakrabarty, Jitamanyu; Petibois, Cyril; Paul, Ranjan Rashmi; Giri, Amita; Chatterjee, Jyotirmoy

2015-10-01

In search of specific label-free biomarkers for differentiation of two oral lesions, namely oral leukoplakia (OLK) and oral squamous-cell carcinoma (OSCC), Fourier-transform infrared (FTIR) spectroscopy was performed on paraffin-embedded tissue sections from 47 human subjects (eight normal (NOM), 16 OLK, and 23 OSCC). Difference between mean spectra (DBMS), Mann-Whitney's U test, and forward feature selection (FFS) techniques were used for optimising spectral-marker selection. Classification of diseases was performed with linear and quadratic support vector machine (SVM) at 10-fold cross-validation, using different combinations of spectral features. It was observed that six features obtained through FFS enabled differentiation of NOM and OSCC tissue (1782, 1713, 1665, 1545, 1409, and 1161 cm(-1)) and were most significant, able to classify OLK and OSCC with 81.3 % sensitivity, 95.7 % specificity, and 89.7 % overall accuracy. The 43 spectral markers extracted through Mann-Whitney's U Test were the least significant when quadratic SVM was used. Considering the high sensitivity and specificity of the FFS technique, extracting only six spectral biomarkers was thus most useful for diagnosis of OLK and OSCC, and to overcome inter and intra-observer variability experienced in diagnostic best-practice histopathological procedure. By considering the biochemical assignment of these six spectral signatures, this work also revealed altered glycogen and keratin content in histological sections which could able to discriminate OLK and OSCC. The method was validated through spectral selection by the DBMS technique. Thus this method has potential for diagnostic cost minimisation for oral lesions by label-free biomarker identification.

Using Linear Regression To Determine the Number of Factors To Retain in Factor Analysis and the Number of Issues To Retain in Delphi Studies and Other Surveys.

ERIC Educational Resources Information Center

Jurs, Stephen; And Others

The scree test and its linear regression technique are reviewed, and results of its use in factor analysis and Delphi data sets are described. The scree test was originally a visual approach for making judgments about eigenvalues, which considered the relationships of the eigenvalues to one another as well as their actual values. The graph that is…

Spectral analysis for weighted tree-like fractals

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Chen, Yufei; Wang, Xiaoqian; Sun, Yu; Su, Weiyi

2018-02-01

Much information about the structural properties and dynamical aspects of a network is measured by the eigenvalues of its normalized Laplacian matrix. In this paper, we aim to present a study on the spectra of the normalized Laplacian of weighted tree-like fractals. We analytically obtain the relationship between the eigenvalues and their multiplicities for two successive generations. As an example of application of these results, we then derive closed-form expressions for their multiplicative Kirchhoff index and Kemeny's constant.

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).

Short-term effects of soybean oil supplementation on performance, digestion, and metabolism in dairy cows fed sugarcane-based diets.

PubMed

Rodrigues, João Paulo P; de Paula, Ricardo M; Rennó, Luciana N; Fontes, Marta M S; Machado, Andreia F; de C Valadares Filho, Sebastião; Huhtanen, Pekka; Marcondes, Marcos I

2017-06-01

We aimed to quantify the productive and metabolic responses, and digestive changes in dairy cows fed various concentrations of soybean oil (SBO) in high-concentrate, sugarcane-based diets. Eight rumen-cannulated multiparous Holstein cows in mid lactation (574 ± 19.1 kg of body weight and 122 ± 6.9 d in milk), averaging 22.5 ± 1.22 kg/d of milk were assigned to replicated 4 × 4 Latin squares. The experimental period lasted 21 d as follows: 14 d for adaptation, followed by a sampling period from d 15 to 21. The diets were formulated with increasing concentrations of SBO [% of dry matter (DM)]: control (0%), low (LSBO; 1.57%), medium (MSBO; 4.43%), and high (HSBO; 7.34%). Dry matter intake decreased quadratically in response to SBO addition. The greatest decrease in DM intake was observed in MSBO and HSBO diets. Both milk and energy-corrected milk yield were quadratically affected by the SBO inclusion, with a slight decrease up to MSBO and substantial decrease in the HSBO diet. The milk fat concentration linearly decreased from 3.78% in the control to 3.50% in the HSBO diet. The potentially digestible neutral detergent fiber digestibility in the rumen decreased from 55.7% in the control to 35.2% in the HSBO diet. The fractional rate of digestion of potentially digestible neutral detergent fiber in the rumen decreased linearly from 3.13 to 1.39%/h from the control to HSBO diet. The fractional rate of indigestible neutral detergent fiber passage in the rumen was quadratically affected, with the lowest value (2.25%/h) for the HSBO diet. Rumen pH increased from 6.42 to 6.67, and ammonia nitrogen decreased from 28.1 to 21.4 mg/dL, in the control and HSBO diets, respectively. Rumen volatile fatty acids decreased quadratically, with the greatest decrease observed in MSBO and HSBO diets. Serum concentrations of glucose, fatty acids, and β-hydroxybutyrate were unaffected by SBO inclusion. However, serum concentrations of total cholesterol and high- and low-density lipoproteins linearly increased with increasing concentrations of SBO in the diet. Inclusion of SBO at concentrations from 4.43 to 7.34% of the diet DM decreased DM intake, energy-corrected milk production, fiber digestibility, and rumen fermentation and was thus not recommended. Soybean oil supplementation at 1.57% of the diet DM proved to be a safe concentration for dairy cows fed high-concentrate diets with sugarcane as the sole forage. Copyright © 2017 American Dairy Science Association. Published by Elsevier Inc. All rights reserved.

Comparing the structure of an emerging market with a mature one under global perturbation

NASA Astrophysics Data System (ADS)

Namaki, A.; Jafari, G. R.; Raei, R.

2011-09-01

In this paper we investigate the Tehran stock exchange (TSE) and Dow Jones Industrial Average (DJIA) in terms of perturbed correlation matrices. To perturb a stock market, there are two methods, namely local and global perturbation. In the local method, we replace a correlation coefficient of the cross-correlation matrix with one calculated from two Gaussian-distributed time series, whereas in the global method, we reconstruct the correlation matrix after replacing the original return series with Gaussian-distributed time series. The local perturbation is just a technical study. We analyze these markets through two statistical approaches, random matrix theory (RMT) and the correlation coefficient distribution. By using RMT, we find that the largest eigenvalue is an influence that is common to all stocks and this eigenvalue has a peak during financial shocks. We find there are a few correlated stocks that make the essential robustness of the stock market but we see that by replacing these return time series with Gaussian-distributed time series, the mean values of correlation coefficients, the largest eigenvalues of the stock markets and the fraction of eigenvalues that deviate from the RMT prediction fall sharply in both markets. By comparing these two markets, we can see that the DJIA is more sensitive to global perturbations. These findings are crucial for risk management and portfolio selection.

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.

Possibility of modifying the growth trajectory in Raeini Cashmere goat.

PubMed

Ghiasi, Heydar; Mokhtari, M S

2018-03-27

The objective of this study was to investigate the possibility of modifying the growth trajectory in Raeini Cashmere goat breed. In total, 13,193 records on live body weight collected from 4788 Raeini Cashmere goats were used. According to Akanke's information criterion (AIC), the sing-trait random regression model included fourth-order Legendre polynomial for direct and maternal genetic effect; maternal and individual permanent environmental effect was the best model for estimating (co)variance components. The matrices of eigenvectors for (co)variances between random regression coefficients of direct additive genetic were used to calculate eigenfunctions, and different eigenvector indices were also constructed. The obtained results showed that the first eigenvalue explained 79.90% of total genetic variance. Therefore, changing the body weights applying the first eigenfunction will be obtained rapidly. Selection based on the first eigenvector will cause favorable positive genetic gains for all body weight considered from birth to 12 months of age. For modifying the growth trajectory in Raeini Cashmere goat, the selection should be based on the second eigenfunction. The second eigenvalue accounted for 14.41% of total genetic variance for body weights that is low in comparison with genetic variance explained by the first eigenvalue. The complex patterns of genetic change in growth trajectory observed under the third and fourth eigenfunction and low amount of genetic variance explained by the third and fourth eigenvalues.

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

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).

Group identification in Indonesian stock market

NASA Astrophysics Data System (ADS)

Nurriyadi Suparno, Ervano; Jo, Sung Kyun; Lim, Kyuseong; Purqon, Acep; Kim, Soo Yong

2016-08-01

The characteristic of Indonesian stock market is interesting especially because it represents developing countries. We investigate the dynamics and structures by using Random Matrix Theory (RMT). Here, we analyze the cross-correlation of the fluctuations of the daily closing price of stocks from the Indonesian Stock Exchange (IDX) between January 1, 2007, and October 28, 2014. The eigenvalue distribution of the correlation matrix consists of noise which is filtered out using the random matrix as a control. The bulk of the eigenvalue distribution conforms to the random matrix, allowing the separation of random noise from original data which is the deviating eigenvalues. From the deviating eigenvalues and the corresponding eigenvectors, we identify the intrinsic normal modes of the system and interpret their meaning based on qualitative and quantitative approach. The results show that the largest eigenvector represents the market-wide effect which has a predominantly common influence toward all stocks. The other eigenvectors represent highly correlated groups within the system. Furthermore, identification of the largest components of the eigenvectors shows the sector or background of the correlated groups. Interestingly, the result shows that there are mainly two clusters within IDX, natural and non-natural resource companies. We then decompose the correlation matrix to investigate the contribution of the correlated groups to the total correlation, and we find that IDX is still driven mainly by the market-wide effect.

FastSKAT: Sequence kernel association tests for very large sets of markers.

PubMed

Lumley, Thomas; Brody, Jennifer; Peloso, Gina; Morrison, Alanna; Rice, Kenneth

2018-06-22

The sequence kernel association test (SKAT) is widely used to test for associations between a phenotype and a set of genetic variants that are usually rare. Evaluating tail probabilities or quantiles of the null distribution for SKAT requires computing the eigenvalues of a matrix related to the genotype covariance between markers. Extracting the full set of eigenvalues of this matrix (an n×n matrix, for n subjects) has computational complexity proportional to n 3 . As SKAT is often used when n>104, this step becomes a major bottleneck in its use in practice. We therefore propose fastSKAT, a new computationally inexpensive but accurate approximations to the tail probabilities, in which the k largest eigenvalues of a weighted genotype covariance matrix or the largest singular values of a weighted genotype matrix are extracted, and a single term based on the Satterthwaite approximation is used for the remaining eigenvalues. While the method is not particularly sensitive to the choice of k, we also describe how to choose its value, and show how fastSKAT can automatically alert users to the rare cases where the choice may affect results. As well as providing faster implementation of SKAT, the new method also enables entirely new applications of SKAT that were not possible before; we give examples grouping variants by topologically associating domains, and comparing chromosome-wide association by class of histone marker. © 2018 WILEY PERIODICALS, INC.

Voltage scheduling for low power/energy

NASA Astrophysics Data System (ADS)

Manzak, Ali

2001-07-01

Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned to lower voltage levels (thus reducing the power consumption). A polynomial time resource and latency constrained scheduling algorithm is developed to distribute the available slack among the nodes such that power consumption is minimum. The algorithm is iterative and utilizes the slack based on the Lagrange multiplier method.

Revealing Ozgur's Thoughts of a Quadratic Function with a Clinical Interview: Concepts and Their Underlying Reasons

ERIC Educational Resources Information Center

Ozaltun Celik, Aytug; Bukova Guzel, Esra

2017-01-01

The quadratic function is an important concept for calculus but the students at high school have many difficulties related to this concept. It is important that the teaching of the quadratic function is realized considering the students' thinking. In this context, the aim of this study conducted through a qualitative case study is to reveal the…

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.

Sample size determination for GEE analyses of stepped wedge cluster randomized trials.

PubMed

Li, Fan; Turner, Elizabeth L; Preisser, John S

2018-06-19

In stepped wedge cluster randomized trials, intact clusters of individuals switch from control to intervention from a randomly assigned period onwards. Such trials are becoming increasingly popular in health services research. When a closed cohort is recruited from each cluster for longitudinal follow-up, proper sample size calculation should account for three distinct types of intraclass correlations: the within-period, the inter-period, and the within-individual correlations. Setting the latter two correlation parameters to be equal accommodates cross-sectional designs. We propose sample size procedures for continuous and binary responses within the framework of generalized estimating equations that employ a block exchangeable within-cluster correlation structure defined from the distinct correlation types. For continuous responses, we show that the intraclass correlations affect power only through two eigenvalues of the correlation matrix. We demonstrate that analytical power agrees well with simulated power for as few as eight clusters, when data are analyzed using bias-corrected estimating equations for the correlation parameters concurrently with a bias-corrected sandwich variance estimator. © 2018, The International Biometric Society.

Dynamic neutron scattering from conformational dynamics. I. Theory and Markov models

NASA Astrophysics Data System (ADS)

Lindner, Benjamin; Yi, Zheng; Prinz, Jan-Hendrik; Smith, Jeremy C.; Noé, Frank

2013-11-01

The dynamics of complex molecules can be directly probed by inelastic neutron scattering experiments. However, many of the underlying dynamical processes may exist on similar timescales, which makes it difficult to assign processes seen experimentally to specific structural rearrangements. Here, we show how Markov models can be used to connect structural changes observed in molecular dynamics simulation directly to the relaxation processes probed by scattering experiments. For this, a conformational dynamics theory of dynamical neutron and X-ray scattering is developed, following our previous approach for computing dynamical fingerprints of time-correlation functions [F. Noé, S. Doose, I. Daidone, M. Löllmann, J. Chodera, M. Sauer, and J. Smith, Proc. Natl. Acad. Sci. U.S.A. 108, 4822 (2011)]. Markov modeling is used to approximate the relaxation processes and timescales of the molecule via the eigenvectors and eigenvalues of a transition matrix between conformational substates. This procedure allows the establishment of a complete set of exponential decay functions and a full decomposition into the individual contributions, i.e., the contribution of every atom and dynamical process to each experimental relaxation process.

Analysis of structural correlations in a model binary 3D liquid through the eigenvalues and eigenvectors of the atomic stress tensors

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

Levashov, V. A.

2016-03-07

It is possible to associate with every atom or molecule in a liquid its own atomic stress tensor. These atomic stress tensors can be used to describe liquids’ structures and to investigate the connection between structural and dynamic properties. In particular, atomic stresses allow to address atomic scale correlations relevant to the Green-Kubo expression for viscosity. Previously correlations between the atomic stresses of different atoms were studied using the Cartesian representation of the stress tensors or the representation based on spherical harmonics. In this paper we address structural correlations in a 3D model binary liquid using the eigenvalues and eigenvectorsmore » of the atomic stress tensors. This approach allows to interpret correlations relevant to the Green-Kubo expression for viscosity in a simple geometric way. On decrease of temperature the changes in the relevant stress correlation function between different atoms are significantly more pronounced than the changes in the pair density function. We demonstrate that this behaviour originates from the orientational correlations between the eigenvectors of the atomic stress tensors. We also found correlations between the eigenvalues of the same atomic stress tensor. For the studied system, with purely repulsive interactions between the particles, the eigenvalues of every atomic stress tensor are positive and they can be ordered: λ{sub 1} ≥ λ{sub 2} ≥ λ{sub 3} ≥ 0. We found that, for the particles of a given type, the probability distributions of the ratios (λ{sub 2}/λ{sub 1}) and (λ{sub 3}/λ{sub 2}) are essentially identical to each other in the liquids state. We also found that λ{sub 2} tends to be equal to the geometric average of λ{sub 1} and λ{sub 3}. In our view, correlations between the eigenvalues may represent “the Poisson ratio effect” at the atomic scale.« less

Analysis of structural correlations in a model binary 3D liquid through the eigenvalues and eigenvectors of the atomic stress tensors.

PubMed

Levashov, V A

2016-03-07

It is possible to associate with every atom or molecule in a liquid its own atomic stress tensor. These atomic stress tensors can be used to describe liquids' structures and to investigate the connection between structural and dynamic properties. In particular, atomic stresses allow to address atomic scale correlations relevant to the Green-Kubo expression for viscosity. Previously correlations between the atomic stresses of different atoms were studied using the Cartesian representation of the stress tensors or the representation based on spherical harmonics. In this paper we address structural correlations in a 3D model binary liquid using the eigenvalues and eigenvectors of the atomic stress tensors. This approach allows to interpret correlations relevant to the Green-Kubo expression for viscosity in a simple geometric way. On decrease of temperature the changes in the relevant stress correlation function between different atoms are significantly more pronounced than the changes in the pair density function. We demonstrate that this behaviour originates from the orientational correlations between the eigenvectors of the atomic stress tensors. We also found correlations between the eigenvalues of the same atomic stress tensor. For the studied system, with purely repulsive interactions between the particles, the eigenvalues of every atomic stress tensor are positive and they can be ordered: λ1 ≥ λ2 ≥ λ3 ≥ 0. We found that, for the particles of a given type, the probability distributions of the ratios (λ2/λ1) and (λ3/λ2) are essentially identical to each other in the liquids state. We also found that λ2 tends to be equal to the geometric average of λ1 and λ3. In our view, correlations between the eigenvalues may represent "the Poisson ratio effect" at the atomic scale.

Analysis of spontaneous oscillations for a three-state power-stroke model.

PubMed

Washio, Takumi; Hisada, Toshiaki; Shintani, Seine A; Higuchi, Hideo

2017-02-01

Our study considers the mechanism of the spontaneous oscillations of molecular motors that are driven by the power stroke principle by applying linear stability analysis around the stationary solution. By representing the coupling equation of microscopic molecular motor dynamics and mesoscopic sarcomeric dynamics by a rank-1 updated matrix system, we derived the analytical representations of the eigenmodes of the Jacobian matrix that cause the oscillation. Based on these analytical representations, we successfully derived the essential conditions for the oscillation in terms of the rate constants of the power stroke and the reversal stroke transitions of the molecular motor. Unlike the two-state model, in which the dependence of the detachment rates on the motor coordinates or the applied forces on the motors plays a key role for the oscillation, our three-state power stroke model demonstrates that the dependence of the rate constants of the power and reversal strokes on the strains in the elastic elements in the motor molecules plays a key role, where these rate constants are rationally determined from the free energy available for the power stroke, the stiffness of the elastic element in the molecular motor, and the working stroke size. By applying the experimentally confirmed values to the free energy, the stiffness, and the working stroke size, our numerical model reproduces well the experimentally observed oscillatory behavior. Furthermore, our analysis shows that two eigenmodes with real positive eigenvalues characterize the oscillatory behavior, where the eigenmode with the larger eigenvalue indicates the transient of the system of the quick sarcomeric lengthening induced by the collective reversal strokes, and the smaller eigenvalue correlates with the speed of sarcomeric shortening, which is much slower than lengthening. Applying the perturbation analyses with primal physical parameters, we find that these two real eigenvalues occur on two branches derived from a merge point of a pair of complex-conjugate eigenvalues generated by Hopf bifurcation.

Quadratic spline subroutine package

USGS Publications Warehouse

Rasmussen, Lowell A.

1982-01-01

A continuous piecewise quadratic function with continuous first derivative is devised for approximating a single-valued, but unknown, function represented by a set of discrete points. The quadratic is proposed as a treatment intermediate between using the angular (but reliable, easily constructed and manipulated) piecewise linear function and using the smoother (but occasionally erratic) cubic spline. Neither iteration nor the solution of a system of simultaneous equations is necessary to determining the coefficients. Several properties of the quadratic function are given. A set of five short FORTRAN subroutines is provided for generating the coefficients (QSC), finding function value and derivatives (QSY), integrating (QSI), finding extrema (QSE), and computing arc length and the curvature-squared integral (QSK). (USGS)

Solving the Integral of Quadratic Forms of Covariance Matrices for Applications in Polarimetric Radar Imagery

NASA Astrophysics Data System (ADS)

Marino, Armando; Hajnsek, Irena

2015-04-01

In this work, the solution of quadratic forms with special application to polarimetric and interferometric covariance matrices is investigated. An analytical solution for the integral of a single quadratic form is derived. Additionally, the integral of the Pol-InSAR coherence (expressed as combination of quadratic forms) is investigated. An approximation for such integral is proposed and defined as Trace coherence. Such approximation is tested on real data to verify that the error is acceptable. The trace coherence can be used for tackle problems related to change detection. Moreover, the use of the Trace coherence in model inversion (as for the RVoG three stage inversion) will be investigated in the future.

Closed-loop stability of linear quadratic optimal systems in the presence of modeling errors

NASA Technical Reports Server (NTRS)

Toda, M.; Patel, R.; Sridhar, B.

1976-01-01

The well-known stabilizing property of linear quadratic state feedback design is utilized to evaluate the robustness of a linear quadratic feedback design in the presence of modeling errors. Two general conditions are obtained for allowable modeling errors such that the resulting closed-loop system remains stable. One of these conditions is applied to obtain two more particular conditions which are readily applicable to practical situations where a designer has information on the bounds of modeling errors. Relations are established between the allowable parameter uncertainty and the weighting matrices of the quadratic performance index, thereby enabling the designer to select appropriate weighting matrices to attain a robust feedback design.

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.

The algebraic theory of latent projectors in lambda matrices

NASA Technical Reports Server (NTRS)

Denman, E. D.; Leyva-Ramos, J.; Jeon, G. J.

1981-01-01

Multivariable systems such as a finite-element model of vibrating structures, control systems, and large-scale systems are often formulated in terms of differential equations which give rise to lambda matrices. The present investigation is concerned with the formulation of the algebraic theory of lambda matrices and the relationship of latent roots, latent vectors, and latent projectors to the eigenvalues, eigenvectors, and eigenprojectors of the companion form. The chain rule for latent projectors and eigenprojectors for the repeated latent root or eigenvalues is given.

Eigenvalue asymptotics for the damped wave equation on metric graphs

NASA Astrophysics Data System (ADS)

Freitas, Pedro; Lipovský, Jiří

2017-09-01

We consider the linear damped wave equation on finite metric graphs and analyse its spectral properties with an emphasis on the asymptotic behaviour of eigenvalues. In the case of equilateral graphs and standard coupling conditions we show that there is only a finite number of high-frequency abscissas, whose location is solely determined by the averages of the damping terms on each edge. We further describe some of the possible behaviour when the edge lengths are no longer necessarily equal but remain commensurate.

Wigner surmises and the two-dimensional homogeneous Poisson point process.

PubMed

Sakhr, Jamal; Nieminen, John M

2006-04-01

We derive a set of identities that relate the higher-order interpoint spacing statistics of the two-dimensional homogeneous Poisson point process to the Wigner surmises for the higher-order spacing distributions of eigenvalues from the three classical random matrix ensembles. We also report a remarkable identity that equates the second-nearest-neighbor spacing statistics of the points of the Poisson process and the nearest-neighbor spacing statistics of complex eigenvalues from Ginibre's ensemble of 2 x 2 complex non-Hermitian random matrices.

Non-isospectral Hamiltonians, intertwining operators and hidden hermiticity

NASA Astrophysics Data System (ADS)

Bagarello, F.

2011-12-01

We have recently proposed a strategy to produce, starting from a given Hamiltonian h and a certain operator x for which [h,xx]=0 and xx is invertible, a second Hamiltonian h with the same eigenvalues as h and whose eigenvectors are related to those of h by x. Here we extend this procedure to build up a second Hamiltonian, whose eigenvalues are different from those of h, and whose eigenvectors are still related as before. This new procedure is also extended to crypto-hermitian Hamiltonians.

On complex matrices with simple spectrum that are unitarily similar to real matrices

NASA Astrophysics Data System (ADS)

Ikramov, Khakim D.

2011-04-01

Suppose that one should verify whether a given complex n × n matrix can be converted into a real matrix by a unitary similarity transformation. Sufficient conditions for this property to hold were found in an earlier publication of this author. These conditions are relaxed in the following way: as before, the spectrum is required to be simple, but pairs of complex conjugate eigenvalues λ ,bar λ are now allowed. However, the eigenvectors corresponding to such eigenvalues must not be orthogonal.

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.

Hydrodynamics of the Dirac spectrum

DOE PAGES

Liu, Yizhuang; Warchoł, Piotr; Zahed, Ismail

2015-12-15

We discuss a hydrodynamical description of the eigenvalues of the Dirac spectrum in even dimensions in the vacuum and in the large N (volume) limit. The linearized hydrodynamics supports sound waves. The hydrodynamical relaxation of the eigenvalues is captured by a hydrodynamical (tunneling) minimum configuration which follows from a pertinent form of Euler equation. As a result, the relaxation from a phase of unbroken chiral symmetry to a phase of broken chiral symmetry occurs over a time set by the speed of sound.