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
Colpitts, Eigenvalues and Chaos
DEFF Research Database (Denmark)
Lindberg, Erik
1997-01-01
It is possible to obtain insight in the chaotic nature of a nonlinear oscillator by means of a study of the eigenvalues of the linearized Jacobian of the differential equations describing the oscillator. The movements of the eigenvalues as functions of time are found. The instantaneous power in t...
Energy Technology Data Exchange (ETDEWEB)
Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics
1997-11-01
The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.
The Schrodinger Eigenvalue March
Tannous, C.; Langlois, J.
2011-01-01
A simple numerical method for the determination of Schrodinger equation eigenvalues is introduced. It is based on a marching process that starts from an arbitrary point, proceeds in two opposite directions simultaneously and stops after a tolerance criterion is met. The method is applied to solving several 1D potential problems including symmetric…
On Selberg's small eigenvalue conjecture and residual eigenvalues
DEFF Research Database (Denmark)
Risager, Morten S.
2011-01-01
We show that Selberg’s eigenvalue conjecture concerning small eigenvalues of the automorphic Laplacian for congruence groups is equivalent to a conjecture about the non-existence of residual eigenvalues for a perturbed system. We prove this using a combination of methods from asymptotic perturbat...
DEFF Research Database (Denmark)
Lindberg, Erik
1997-01-01
In order to obtain insight in the nature of nonlinear oscillators the eigenvalues of the linearized Jacobian of the differential equations describing the oscillator are found and displayed as functions of time. A number of oscillators are studied including Dewey's oscillator (piecewise linear wit...... with negative resistance), Kennedy's Colpitts-oscillator (with and without chaos) and a new 4'th order oscillator with hyper-chaos....
Sturm--Liouville eigenvalue problem
International Nuclear Information System (INIS)
Bailey, P.B.
1977-01-01
The viewpoint is taken that Sturn--Liouville problem is specified and the problem of computing one or more of the eigenvalues and possibly the corresponding eigenfunctions is presented for solution. The procedure follows the construction of a computer code, although such a code is not constructed, intended to solve Sturn--Liouville eigenvalue problems whether singular or nonsingular
A Bootstrap Approach to Eigenvalue Correction
Hendrikse, A.J.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.
2009-01-01
Eigenvalue analysis is an important aspect in many data modeling methods. Unfortunately, the eigenvalues of the sample covariance matrix (sample eigenvalues) are biased estimates of the eigenvalues of the covariance matrix of the data generating process (population eigenvalues). We present a new
Tensor eigenvalues and their applications
Qi, Liqun; Chen, Yannan
2018-01-01
This book offers an introduction to applications prompted by tensor analysis, especially by the spectral tensor theory developed in recent years. It covers applications of tensor eigenvalues in multilinear systems, exponential data fitting, tensor complementarity problems, and tensor eigenvalue complementarity problems. It also addresses higher-order diffusion tensor imaging, third-order symmetric and traceless tensors in liquid crystals, piezoelectric tensors, strong ellipticity for elasticity tensors, and higher-order tensors in quantum physics. This book is a valuable reference resource for researchers and graduate students who are interested in applications of tensor eigenvalues.
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
Research” and the use of copyright material. Approved by Major Professor(s): Approved by: Head of the Departmental Graduate Program Date Alicia Marie... matrix . . . . . . . . . . . . . . . . . 106 8.15 Sparsity patterns for the Nastran benchmark of order 1.5 million . . . . 108 8.16 Sparsity patterns...magnitude eigenvalues of a given matrix pencil (A,B) along with their associated eigenvectors. Computing the smallest eigenvalues is more difficult
Perturbation Theory of Embedded Eigenvalues
DEFF Research Database (Denmark)
Engelmann, Matthias
project gives a general and systematic approach to analytic perturbation theory of embedded eigenvalues. The spectral deformation technique originally developed in the theory of dilation analytic potentials in the context of Schrödinger operators is systematized by the use of Mourre theory. The group...... of dilations is thereby replaced by the unitary group generated y the conjugate operator. This then allows to treat the perturbation problem with the usual Kato theory.......We study problems connected to perturbation theory of embedded eigenvalues in two different setups. The first part deals with second order perturbation theory of mass shells in massive translation invariant Nelson type models. To this end an expansion of the eigenvalues w.r.t. fiber parameter up...
Eigenvalue treatment of cosmological models
International Nuclear Information System (INIS)
Novello, M.; Soares, D.
1976-08-01
From the decomposition of Weyl tensor into its electric and magnetic parts, it is formulated the eigenvalue problem for cosmological models, and is used quasi-maxwellian form of Einstein's equation to propagate it along a time-like congruence. Three related theorems are presented
Generalized eigenvalue based spectrum sensing
Shakir, Muhammad
2012-01-01
Spectrum sensing is one of the fundamental components in cognitive radio networks. In this chapter, a generalized spectrum sensing framework which is referred to as Generalized Mean Detector (GMD) has been introduced. In this context, we generalize the detectors based on the eigenvalues of the received signal covariance matrix and transform the eigenvalue based spectrum sensing detectors namely: (i) the Eigenvalue Ratio Detector (ERD) and two newly proposed detectors which are referred to as (ii) the GEometric Mean Detector (GEMD) and (iii) the ARithmetic Mean Detector (ARMD) into an unified framework of generalize spectrum sensing. The foundation of the proposed framework is based on the calculation of exact analytical moments of the random variables of the decision threshold of the respective detectors. The decision threshold has been calculated in a closed form which is based on the approximation of Cumulative Distribution Functions (CDFs) of the respective test statistics. In this context, we exchange the analytical moments of the two random variables of the respective test statistics with the moments of the Gaussian (or Gamma) distribution function. The performance of the eigenvalue based detectors is compared with the several traditional detectors including the energy detector (ED) to validate the importance of the eigenvalue based detectors and the performance of the GEMD and the ARMD particularly in realistic wireless cognitive radio network. Analytical and simulation results show that the newly proposed detectors yields considerable performance advantage in realistic spectrum sensing scenarios. Moreover, the presented results based on proposed approximation approaches are in perfect agreement with the empirical results. © 2012 Springer Science+Business Media Dordrecht.
An Optimal Lower Eigenvalue System
Directory of Open Access Journals (Sweden)
Yingfan Liu
2011-01-01
Full Text Available An optimal lower eigenvalue system is studied, and main theorems including a series of necessary and suffcient conditions concerning existence and a Lipschitz continuity result concerning stability are obtained. As applications, solvability results to some von-Neumann-type input-output inequalities, growth, and optimal growth factors, as well as Leontief-type balanced and optimal balanced growth paths, are also gotten.
Eigenvalue pinching on spinc manifolds
Roos, Saskia
2017-02-01
We derive various pinching results for small Dirac eigenvalues using the classification of spinc and spin manifolds admitting nontrivial Killing spinors. For this, we introduce a notion of convergence for spinc manifolds which involves a general study on convergence of Riemannian manifolds with a principal S1-bundle. We also analyze the relation between the regularity of the Riemannian metric and the regularity of the curvature of the associated principal S1-bundle on spinc manifolds with Killing spinors.
Highly indefinite multigrid for eigenvalue problems
Energy Technology Data Exchange (ETDEWEB)
Borges, L.; Oliveira, S.
1996-12-31
Eigenvalue problems are extremely important in understanding dynamic processes such as vibrations and control systems. Large scale eigenvalue problems can be very difficult to solve, especially if a large number of eigenvalues and the corresponding eigenvectors need to be computed. For solving this problem a multigrid preconditioned algorithm is presented in {open_quotes}The Davidson Algorithm, preconditioning and misconvergence{close_quotes}. Another approach for solving eigenvalue problems is by developing efficient solutions for highly indefinite problems. In this paper we concentrate on the use of new highly indefinite multigrid algorithms for the eigenvalue problem.
Preconditioned Krylov subspace methods for eigenvalue problems
Energy Technology Data Exchange (ETDEWEB)
Wu, Kesheng; Saad, Y.; Stathopoulos, A. [Univ. of Minnesota, Minneapolis, MN (United States)
1996-12-31
Lanczos algorithm is a commonly used method for finding a few extreme eigenvalues of symmetric matrices. It is effective if the wanted eigenvalues have large relative separations. If separations are small, several alternatives are often used, including the shift-invert Lanczos method, the preconditioned Lanczos method, and Davidson method. The shift-invert Lanczos method requires direct factorization of the matrix, which is often impractical if the matrix is large. In these cases preconditioned schemes are preferred. Many applications require solution of hundreds or thousands of eigenvalues of large sparse matrices, which pose serious challenges for both iterative eigenvalue solver and preconditioner. In this paper we will explore several preconditioned eigenvalue solvers and identify the ones suited for finding large number of eigenvalues. Methods discussed in this paper make up the core of a preconditioned eigenvalue toolkit under construction.
Eigenvalue distributions of Wilson loops
International Nuclear Information System (INIS)
Lohmayer, Robert
2010-01-01
In the first part of this thesis, we focus on the distribution of the eigenvalues of the unitary Wilson loop matrix in the two-dimensional case at arbitrary finite N. To characterize the distribution of the eigenvalues, we introduce three density functions (the ''symmetric'', the ''antisymmetric'', and the ''true'' eigenvalue density) which differ at finite N but possess the same infinite-N limit, exhibiting the Durhuus-Olesen phase transition. Using expansions of determinants and inverse determinants in characters of totally symmetric or totally antisymmetric representations of SU(N), the densities at finite N can be expressed in terms of simple sums involving only dimensions and quadratic Casimir invariants of certain irreducible representations of SU(N), allowing for a numerical computation of the densities at arbitrary N to any desired accuracy. We find that the true eigenvalue density, adding N oscillations to the monotonic symmetric density, is in some sense intermediate between the symmetric and the antisymmetric density, which in turn is given by a sum of N delta peaks located at the zeros of the average of the characteristic polynomial. Furthermore, we show that the dependence on N can be made explicit by deriving integral representations for the resolvents associated to the three eigenvalue densities. Using saddle-point approximations, we confirm that all three densities reduce to the Durhuus-Olesen result in the infinite-N limit. In the second part, we study an exponential form of the multiplicative random complex matrix model introduced by Gudowska-Nowak et al. Varying a parameter which can be identified with the area of the Wilson loop in the unitary case, the region of non-vanishing eigenvalue density of the N-dimensional complex product matrix undergoes a topological change at a transition point in the infinite-N limit. We study the transition by a detailed analysis of the average of the modulus square of the characteristic polynomial. Furthermore
Eigenvalue distributions of Wilson loops
Energy Technology Data Exchange (ETDEWEB)
Lohmayer, Robert
2010-07-01
In the first part of this thesis, we focus on the distribution of the eigenvalues of the unitary Wilson loop matrix in the two-dimensional case at arbitrary finite N. To characterize the distribution of the eigenvalues, we introduce three density functions (the ''symmetric'', the ''antisymmetric'', and the ''true'' eigenvalue density) which differ at finite N but possess the same infinite-N limit, exhibiting the Durhuus-Olesen phase transition. Using expansions of determinants and inverse determinants in characters of totally symmetric or totally antisymmetric representations of SU(N), the densities at finite N can be expressed in terms of simple sums involving only dimensions and quadratic Casimir invariants of certain irreducible representations of SU(N), allowing for a numerical computation of the densities at arbitrary N to any desired accuracy. We find that the true eigenvalue density, adding N oscillations to the monotonic symmetric density, is in some sense intermediate between the symmetric and the antisymmetric density, which in turn is given by a sum of N delta peaks located at the zeros of the average of the characteristic polynomial. Furthermore, we show that the dependence on N can be made explicit by deriving integral representations for the resolvents associated to the three eigenvalue densities. Using saddle-point approximations, we confirm that all three densities reduce to the Durhuus-Olesen result in the infinite-N limit. In the second part, we study an exponential form of the multiplicative random complex matrix model introduced by Gudowska-Nowak et al. Varying a parameter which can be identified with the area of the Wilson loop in the unitary case, the region of non-vanishing eigenvalue density of the N-dimensional complex product matrix undergoes a topological change at a transition point in the infinite-N limit. We study the transition by a detailed analysis of the average of the
Singular perturbation of simple eigenvalues
International Nuclear Information System (INIS)
Greenlee, W.M.
1976-01-01
Two operator theoretic theorems which generalize those of asymptotic regular perturbation theory and which apply to singular perturbation problems are proved. Application of these theorems to concrete problems is involved, but the perturbation expansions for eigenvalues and eigenvectors are developed in terms of solutions of linear operator equations. The method of correctors, as well as traditional boundary layer techniques, can be used to apply these theorems. The current formulation should be applicable to highly singular ''hard core'' potential perturbations of the radial equation of quantum mechanics. The theorems are applied to a comparatively simple model problem whose analysis is basic to that of the quantum mechanical problem
Interior transmission eigenvalues of a rectangle
International Nuclear Information System (INIS)
Sleeman, B D; Stocks, D C
2016-01-01
The problem of scattering of acoustic waves by an inhomogeneous medium is intimately connected with so called inside–outside duality, in which the interior transmission eigenvalue problem plays a fundamental role. Here a study of the interior transmission eigenvalues for rectangular domains of constant refractive index is made. By making a nonstandard use of the classical separation of variables technique both real and complex eigenvalues are determined. (paper)
Preconditioned iterations to calculate extreme eigenvalues
Energy Technology Data Exchange (ETDEWEB)
Brand, C.W.; Petrova, S. [Institut fuer Angewandte Mathematik, Leoben (Austria)
1994-12-31
Common iterative algorithms to calculate a few extreme eigenvalues of a large, sparse matrix are Lanczos methods or power iterations. They converge at a rate proportional to the separation of the extreme eigenvalues from the rest of the spectrum. Appropriate preconditioning improves the separation of the eigenvalues. Davidson`s method and its generalizations exploit this fact. The authors examine a preconditioned iteration that resembles a truncated version of Davidson`s method with a different preconditioning strategy.
Covariance expressions for eigenvalue and eigenvector problems
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.
Eigenvalue Decomposition-Based Modified Newton Algorithm
Directory of Open Access Journals (Sweden)
Wen-jun Wang
2013-01-01
Full Text Available When the Hessian matrix is not positive, the Newton direction may not be the descending direction. A new method named eigenvalue decomposition-based modified Newton algorithm is presented, which first takes the eigenvalue decomposition of the Hessian matrix, then replaces the negative eigenvalues with their absolute values, and finally reconstructs the Hessian matrix and modifies the searching direction. The new searching direction is always the descending direction. The convergence of the algorithm is proven and the conclusion on convergence rate is presented qualitatively. Finally, a numerical experiment is given for comparing the convergence domains of the modified algorithm and the classical algorithm.
Computation of standard deviations in eigenvalue calculations
International Nuclear Information System (INIS)
Gelbard, E.M.; Prael, R.
1990-01-01
In Brissenden and Garlick (1985), the authors propose a modified Monte Carlo method for eigenvalue calculations, designed to decrease particle transport biases in the flux and eigenvalue estimates, and in corresponding estimates of standard deviations. Apparently a very similar method has been used by Soviet Monte Carlo specialists. The proposed method is based on the generation of ''superhistories'', chains of histories run in sequence without intervening renormalization of the fission source. This method appears to have some disadvantages, discussed elsewhere. Earlier numerical experiments suggest that biases in fluxes and eigenvalues are negligibly small, even for very small numbers of histories per generation. Now more recent experiments, run on the CRAY-XMP, tend to confirm these earlier conclusions. The new experiments, discussed in this paper, involve the solution of one-group 1D diffusion theory eigenvalue problems, in difference form, via Monte Carlo. Experiments covered a range of dominance ratios from ∼0.75 to ∼0.985. In all cases flux and eigenvalue biases were substantially smaller than one standard deviation. The conclusion that, in practice, the eigenvalue bias is negligible has strong theoretical support. (author)
Sorting waves and associated eigenvalues
Carbonari, Costanza; Colombini, Marco; Solari, Luca
2017-04-01
The presence of mixed sediment always characterizes gravel bed rivers. Sorting processes take place during bed load transport of heterogeneous sediment mixtures. The two main elements necessary to the occurrence of sorting are the heterogeneous character of sediments and the presence of an active sediment transport. When these two key ingredients are simultaneously present, the segregation of bed material is consistently detected both in the field [7] and in laboratory [3] observations. In heterogeneous sediment transport, bed altimetric variations and sorting always coexist and both mechanisms are independently capable of driving the formation of morphological patterns. Indeed, consistent patterns of longitudinal and transverse sorting are identified almost ubiquitously. In some cases, such as bar formation [2] and channel bends [5], sorting acts as a stabilizing effect and therefore the dominant mechanism driving pattern formation is associated with bed altimetric variations. In other cases, such as longitudinal streaks, sorting enhances system instability and can therefore be considered the prevailing mechanism. Bedload sheets, first observed by Khunle and Southard [1], represent another classic example of a morphological pattern essentially triggered by sorting, as theoretical [4] and experimental [3] results suggested. These sorting waves cause strong spatial and temporal fluctuations of bedload transport rate typical observed in gravel bed rivers. The problem of bed load transport of a sediment mixture is formulated in the framework of a 1D linear stability analysis. The base state consists of a uniform flow in an infinitely wide channel with active bed load transport. The behaviour of the eigenvalues associated with fluid motion, bed evolution and sorting processes in the space of the significant flow and sediment parameters is analysed. A comparison is attempted with the results of the theoretical analysis of Seminara Colombini and Parker [4] and Stecca
Modified Bateman solution for identical eigenvalues
International Nuclear Information System (INIS)
Dreher, Raymond
2013-01-01
Highlights: ► Solving indeterminacies due to identical eigenvalues in Bateman’s solution. ► Exact analytical solution of Bateman’s equations for identical eigenvalues. ► Algorithm calculating higher order derivatives appearing in this solution. ► Alternative evaluation of the derivatives through the Taylor polynomial. ► Implementation of an example program demonstrating the developed solution. - Abstract: In this paper we develop a general solution to the Bateman equations taking into account the special case of identical eigenvalues. A characteristic of this new solution is the presence of higher order derivatives. It is shown that the derivatives can be obtained analytically and also computed in an efficient manner
The eigenvalue problem in phase space.
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.
Modern algorithms for large sparse eigenvalue problems
International Nuclear Information System (INIS)
Meyer, A.
1987-01-01
The volume is written for mathematicians interested in (numerical) linear algebra and in the solution of large sparse eigenvalue problems, as well as for specialists in engineering, who use the considered algorithms in the investigation of eigenoscillations of structures, in reactor physics, etc. Some variants of the algorithms based on the idea of a gradient-type direction of movement are presented and their convergence properties are discussed. From this, a general strategy for the direct use of preconditionings for the eigenvalue problem is derived. In this new approach the necessity of the solution of large linear systems is entirely avoided. Hence, these methods represent a new alternative to some other modern eigenvalue algorithms, as they show a slightly slower convergence on the one hand but essentially lower numerical and data processing problems on the other hand. A brief description and comparison of some well-known methods (i.e. simultaneous iteration, Lanczos algorithm) completes this volume. (author)
Shakir, Muhammad
2011-12-01
In this paper, we introduce a new detector referred to as Geometric mean detector (GEMD) which is based on the ratio of the largest eigenvalue to the Geometric mean of the eigenvalues for collaborative spectrum sensing. The decision threshold has been derived by employing Gaussian approximation approach. In this approach, the two random variables, i.e. The largest eigenvalue and the Geometric mean of the eigenvalues are considered as independent Gaussian random variables such that their cumulative distribution functions (CDFs) are approximated by a univariate Gaussian distribution function for any number of cooperating secondary users and received samples. The approximation approach is based on the calculation of exact analytical moments of the largest eigenvalue and the Geometric mean of the eigenvalues of the received covariance matrix. The decision threshold has been calculated by exploiting the CDF of the ratio of two Gaussian distributed random variables. In this context, we exchange the analytical moments of the two random variables with the moments of the Gaussian distribution function. The performance of the detector is compared with the performance of the energy detector and eigenvalue ratio detector. Analytical and simulation results show that our newly proposed detector yields considerable performance advantage in realistic spectrum sensing scenarios. Moreover, our results based on proposed approximation approach are in perfect agreement with the empirical results. © 2011 IEEE.
Eigenvalue ratio detection based on exact moments of smallest and largest eigenvalues
Shakir, Muhammad; Tang, Wuchen; Rao, Anlei; Imran, Muhammad Ali; Alouini, Mohamed-Slim
2011-01-01
Detection based on eigenvalues of received signal covariance matrix is currently one of the most effective solution for spectrum sensing problem in cognitive radios. However, the results of these schemes always depend on asymptotic assumptions since the close-formed expression of exact eigenvalues ratio distribution is exceptionally complex to compute in practice. In this paper, non-asymptotic spectrum sensing approach to approximate the extreme eigenvalues is introduced. In this context, the Gaussian approximation approach based on exact analytical moments of extreme eigenvalues is presented. In this approach, the extreme eigenvalues are considered as dependent Gaussian random variables such that the joint probability density function (PDF) is approximated by bivariate Gaussian distribution function for any number of cooperating secondary users and received samples. In this context, the definition of Copula is cited to analyze the extent of the dependency between the extreme eigenvalues. Later, the decision threshold based on the ratio of dependent Gaussian extreme eigenvalues is derived. The performance analysis of our newly proposed approach is compared with the already published asymptotic Tracy-Widom approximation approach. © 2011 ICST.
The eigenvalue problem for a singular quasilinear elliptic equation
Directory of Open Access Journals (Sweden)
Benjin Xuan
2004-02-01
Full Text Available We show that many results about the eigenvalues and eigenfunctions of a quasilinear elliptic equation in the non-singular case can be extended to the singular case. Among these results, we have the first eigenvalue is associated to a $C^{1,alpha}(Omega$ eigenfunction which is positive and unique (up to a multiplicative constant, that is, the first eigenvalue is simple. Moreover the first eigenvalue is isolated and is the unique positive eigenvalue associated to a non-negative eigenfunction. We also prove some variational properties of the second eigenvalue.
Eigenvalue study of a chaotic resonator
Energy Technology Data Exchange (ETDEWEB)
Banova, Todorka [Technische Universitaet Darmstadt, Institut fuer Theorie Elektromagnetischer Felder (TEMF), Schlossgartenstrasse 8, D-64289 Darmstadt (Germany); Technische Universitaet Darmstadt, Graduate School of Computational Engineering, Dolivostrasse 15, D-64293 Darmstadt (Germany); Ackermann, Wolfgang; Weiland, Thomas [Technische Universitaet Darmstadt, Institut fuer Theorie Elektromagnetischer Felder (TEMF), Schlossgartenstrasse 8, D-64289 Darmstadt (Germany)
2013-07-01
The field of quantum chaos comprises the study of the manifestations of classical chaos in the properties of the corresponding quantum systems. Within this work, we compute the eigenfrequencies that are needed for the level spacing analysis of a microwave resonator with chaotic characteristics. The major challenges posed by our work are: first, the ability of the approaches to tackle the large scale eigenvalue problem and second, the capability to extract many, i.e. order of thousands, eigenfrequencies for the considered cavity. The first proposed approach for an accurate eigenfrequency extraction takes into consideration the evaluated electric field computations in time domain of a superconducting cavity and by means of signal-processing techniques extracts the eigenfrequencies. The second approach is based on the finite element method with curvilinear elements, which transforms the continuous eigenvalue problem to a discrete generalized eigenvalue problem. Afterwards, the Lanczos algorithm is used for the solution of the generalized eigenvalue problem. In the poster, a summary of the applied algorithms, as well as, critical implementation details together with the simulation results are provided.
Eigenvalues and expansion of bipartite graphs
DEFF Research Database (Denmark)
Høholdt, Tom; Janwa, Heeralal
2012-01-01
We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...
Analysis of eigenvalue correction applied to biometrics
Hendrikse, A.J.; Veldhuis, Raymond N.J.; Spreeuwers, Lieuwe Jan; Bazen, A.M.
Eigenvalue estimation plays an important role in biometrics. However, if the number of samples is limited, estimates are significantly biased. In this article we analyse the influence of this bias on the error rates of PCA/LDA based verification systems, using both synthetic data with realistic
A note on quasilinear elliptic eigenvalue problems
Directory of Open Access Journals (Sweden)
Gianni Arioli
1999-11-01
Full Text Available We study an eigenvalue problem by a non-smooth critical point theory. Under general assumptions, we prove the existence of at least one solution as a minimum of a constrained energy functional. We apply some results on critical point theory with symmetry to provide a multiplicity result.
Eigenvalues of the -Laplacian and disconjugacy criteria
Directory of Open Access Journals (Sweden)
Pinasco Juan P
2006-01-01
Full Text Available We derive oscillation and nonoscillation criteria for the one-dimensional -Laplacian in terms of an eigenvalue inequality for a mixed problem. We generalize the results obtained in the linear case by Nehari and Willett, and the proof is based on a Picone-type identity.
A new localization set for generalized eigenvalues
Directory of Open Access Journals (Sweden)
Jing Gao
2017-05-01
Full Text Available Abstract 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.
A robust multilevel simultaneous eigenvalue solver
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.
Generalization of Samuelson's inequality and location of eigenvalues
Indian Academy of Sciences (India)
We prove a generalization of Samuelson's inequality for higher order central moments. Bounds for the eigenvalues are obtained when a given complex × matrix has real eigenvalues. Likewise, we discuss bounds for the roots of polynomial equations.
Eigenstructure of of singular systems. Perturbation analysis of simple eigenvalues
García Planas, María Isabel; Tarragona Romero, Sonia
2014-01-01
The problem to study small perturbations of simple eigenvalues with a change of parameters is of general interest in applied mathematics. After to introduce a systematic way to know if an eigenvalue of a singular system is simple or not, the aim of this work is to study the behavior of a simple eigenvalue of singular linear system family
Frequency response as a surrogate eigenvalue problem in topology optimization
DEFF Research Database (Denmark)
Andreassen, Erik; Ferrari, Federico; Sigmund, Ole
2018-01-01
This article discusses the use of frequency response surrogates for eigenvalue optimization problems in topology optimization that may be used to avoid solving the eigenvalue problem. The motivation is to avoid complications that arise from multiple eigenvalues and the computational complexity as...
Computing the eigenvalues and eigenvectors of a fuzzy matrix
Directory of Open Access Journals (Sweden)
A. Kumar
2012-08-01
Full Text Available Computation of fuzzy eigenvalues and fuzzy eigenvectors of a fuzzy matrix is a challenging problem. Determining the maximal and minimal symmetric solution can help to find the eigenvalues. So, we try to compute these eigenvalues by determining the maximal and minimal symmetric solution of the fully fuzzy linear system $widetilde{A}widetilde{X}= widetilde{lambda} widetilde{X}.$
Monotonicity of energy eigenvalues for Coulomb systems
International Nuclear Information System (INIS)
Englisch, R.
1983-01-01
Generalising results by earlier workers for a large class of Hamiltonians (among others, Hamiltonians of Coulomb systems) which can be written in the form H(α) = H 0 + αH' the present works shows that their eigenvalues decrease with increasing α. This result is applied to Coulomb systems in which the distances between the infinitely heavy particles are varying and also is used to obtain a completion and simplification of proof for the stability of the biexciton. (author)
Lagrangian Differentiation, Integration and Eigenvalues Problems
International Nuclear Information System (INIS)
Durand, L.
1983-01-01
Calogero recently proposed a new and very powerful method for the solution of Sturm-Liouville eigenvalue problems based on Lagrangian differentiation. In this paper, some results of a numerical investigation of Calogero's method for physical interesting problems are presented. It is then shown that one can 'invert' his differentiation technique to obtain a flexible, factorially convergent Lagrangian integration scheme which should be useful in a variety of problems, e.g. solution of integral equations
Eigenvalue translation method for mode calculations
International Nuclear Information System (INIS)
Gerck, E.; Cruz, C.H.B.
1978-11-01
A new method is described for the first few modes calculations in a interferometer that has several advantages over the ALLMAT subroutine, the Prony Method and the Fox and Li Method. In the illustrative results shown for the same cases it can be seen that the eigenvalue translation method is typically 100 fold times faster than the usual Fox and Li Method and 10 times faster than ALLMAT [pt
New approach to calculate bound state eigenvalues
International Nuclear Information System (INIS)
Gerck, E.; Gallas, J.A.C.
1983-01-01
A method of solving the radial Schrodinger equation for bound states is discussed. The method is based on a new piecewise representation of the second derivative operator on a set of functions that obey the boundary conditions. This representation is trivially diagonalised and leads to closed form expressions of the type E sub(n)=E(ab+b+c/n+...) for the eigenvalues. Examples are given for the power-law and logarithmic potentials. (Author) [pt
Recurrence quantity analysis based on matrix eigenvalues
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.
Generalized Eigenvalues for pairs on heritian matrices
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.
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.
International Nuclear Information System (INIS)
Wu, Sheng-Jhih; Chu, Moody T
2017-01-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. (paper)
Random matrices, Frobenius eigenvalues, and monodromy
Katz, Nicholas M
1998-01-01
The main topic of this book is the deep relation between the spacings between zeros of zeta and L-functions and spacings between eigenvalues of random elements of large compact classical groups. This relation, the Montgomery-Odlyzko law, is shown to hold for wide classes of zeta and L-functions over finite fields. The book draws on and gives accessible accounts of many disparate areas of mathematics, from algebraic geometry, moduli spaces, monodromy, equidistribution, and the Weil conjectures, to probability theory on the compact classical groups in the limit as their dimension goes to infinit
Maximal imaginery eigenvalues in optimal systems
Directory of Open Access Journals (Sweden)
David Di Ruscio
1991-07-01
Full Text Available In this note we present equations that uniquely determine the maximum possible imaginary value of the closed loop eigenvalues in an LQ-optimal system, irrespective of how the state weight matrix is chosen, provided a real symmetric solution of the algebraic Riccati equation exists. In addition, the corresponding state weight matrix and the solution to the algebraic Riccati equation are derived for a class of linear systems. A fundamental lemma for the existence of a real symmetric solution to the algebraic Riccati equation is derived for this class of linear systems.
Jargalsaikhan, Bolor
Checking copositivity of a matrix is a co-NP-complete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out
On a quadratic inverse eigenvalue problem
International Nuclear Information System (INIS)
Cai, Yunfeng; Xu, Shufang
2009-01-01
This paper concerns the quadratic inverse eigenvalue problem (QIEP) of constructing real symmetric matrices M, C and K of size n × n, with M nonsingular, so that the quadratic matrix polynomial Q(λ) ≡ λ 2 M + λC + K has a completely prescribed set of eigenvalues and eigenvectors. It is shown via construction that the QIEP has a solution if and only if r 0, where r and δ are computable from the prescribed spectral data. A necessary and sufficient condition for the existence of a solution to the QIEP with M being positive definite is also established in a constructive way. Furthermore, two algorithms are developed: one is to solve the QIEP; another is to find a particular solution to the QIEP with the leading coefficient matrix being positive definite, which also provides us an approach to a simultaneous reduction of real symmetric matrix triple (M, C, K) by real congruence. Numerical results show that the two algorithms are feasible and numerically reliable
MAIA, Eigenvalues for MHD Equation of Tokamak Plasma Stability Problems
International Nuclear Information System (INIS)
Tanaka, Y.; Azumi, M.; Kurita, G.; Tsunematsu, T.; Takeda, T.
1986-01-01
1 - Description of program or function: This program solves an eigenvalue problem zBx=Ax where A and B are real block tri-diagonal matrices. This eigenvalue problem is derived from a reduced set of linear resistive MHD equations which is often employed to study tokamak plasma stability problem. 2 - Method of solution: Both the determinant and inverse iteration methods are employed. 3 - Restrictions on the complexity of the problem: The eigenvalue z must be real
On the distribution of eigenvalues of certain matrix ensembles
International Nuclear Information System (INIS)
Bogomolny, E.; Bohigas, O.; Pato, M.P.
1995-01-01
Invariant random matrix ensembles with weak confinement potentials of the eigenvalues, corresponding to indeterminate moment problems, are investigated. These ensembles are characterized by the fact that the mean density of eigenvalues tends to a continuous function with increasing matrix dimension contrary to the usual cases where it grows indefinitely. It is demonstrated that the standard asymptotic formulae are not applicable in these cases and that the asymptotic distribution of eigenvalues can deviate from the classical ones. (author)
Application of collocation meshless method to eigenvalue problem
International Nuclear Information System (INIS)
Saitoh, Ayumu; Matsui, Nobuyuki; Itoh, Taku; Kamitani, Atsushi; Nakamura, Hiroaki
2012-01-01
The numerical method for solving the nonlinear eigenvalue problem has been developed by using the collocation Element-Free Galerkin Method (EFGM) and its performance has been numerically investigated. The results of computations show that the approximate solution of the nonlinear eigenvalue problem can be obtained stably by using the developed method. Therefore, it can be concluded that the developed method is useful for solving the nonlinear eigenvalue problem. (author)
Asymptotic Distribution of Eigenvalues of Weakly Dilute Wishart Matrices
Energy Technology Data Exchange (ETDEWEB)
Khorunzhy, A. [Institute for Low Temperature Physics (Ukraine)], E-mail: khorunjy@ilt.kharkov.ua; Rodgers, G. J. [Brunel University, Uxbridge, Department of Mathematics and Statistics (United Kingdom)], E-mail: g.j.rodgers@brunel.ac.uk
2000-03-15
We study the eigenvalue distribution of large random matrices that are randomly diluted. We consider two random matrix ensembles that in the pure (nondilute) case have a limiting eigenvalue distribution with a singular component at the origin. These include the Wishart random matrix ensemble and Gaussian random matrices with correlated entries. Our results show that the singularity in the eigenvalue distribution is rather unstable under dilution and that even weak dilution destroys it.
Critical eigenvalue in LMFBRs: a physics assessment
International Nuclear Information System (INIS)
McKnight, R.D.; Collins, P.J.; Olsen, D.N.
1984-01-01
This paper summarizes recent work to put the analysis of past critical eigenvalue measurements from the US critical experiments program on a consistent basis. The integral data base includes 53 configurations built in 11 ZPPR assemblies which simulate mixed oxide LMFBRs. Both conventional and heterogeneous designs representing 350, 700, and 900 MWe sizes and with and without simulated control rods and/or control rod positions have been studied. The review of the integral data base includes quantitative assessment of experimental uncertainties in the measured excess reactivity. Analyses have been done with design level and higher-order methods using ENDF/B-IV data. Comparisons of these analyses with the experiments are used to generate recommended bias factors for criticality predictions. Recommended methods for analysis of LMFBR fast critical assemblies and LMFBR design calculations are presented. Unresolved issues and areas which require additional experimental or analytical study are identified
Uncertainty Estimates in Cold Critical Eigenvalue Predictions
International Nuclear Information System (INIS)
Karve, Atul A.; Moore, Brian R.; Mills, Vernon W.; Marrotte, Gary N.
2005-01-01
A recent cycle of a General Electric boiling water reactor performed two beginning-of-cycle local cold criticals. The eigenvalues estimated by the core simulator were 0.99826 and 1.00610. The large spread in them (= 0.00784) is a source of concern, and it is studied here. An analysis process is developed using statistical techniques, where first a transfer function relating the core observable Y (eigenvalue) to various factors (X's) is established. Engineering judgment is used to recognize the best candidates for X's. They are identified as power-weighted assembly k ∞ 's of selected assemblies around the withdrawn rods. These are a small subset of many X's that could potentially influence Y. However, the intention here is not to do a comprehensive study by accounting for all the X's. Rather, the scope is to demonstrate that the process developed is reasonable and to show its applicability to performing detailed studies. Variability in X's is obtained by perturbing nodal k ∞ 's since they directly influence the buckling term in the quasi-two-group diffusion equation model of the core simulator. Any perturbations introduced in them are bounded by standard well-established uncertainties. The resulting perturbations in the X's may not necessarily be directly correlated to physical attributes, but they encompass numerous biases and uncertainties credited to input and modeling uncertainties. The 'vital few' from the 'unimportant many' X's are determined, and then they are subgrouped according to assembly type, location, exposure, and control rod insertion. The goal is to study how the subgroups influence Y in order to have a better understanding of the variability observed in it
Eigenvalues of the volume operator in loop quantum gravity
International Nuclear Information System (INIS)
Meissner, Krzysztof A
2006-01-01
We present a simple method to calculate certain sums of the eigenvalues of the volume operator in loop quantum gravity. We derive the asymptotic distribution of the eigenvalues in the classical limit of very large spins, which turns out to be of a very simple form. The results can be useful for example in the statistical approach to quantum gravity
Deflation of Eigenvalues for GMRES in Lattice QCD
International Nuclear Information System (INIS)
Morgan, Ronald B.; Wilcox, Walter
2002-01-01
Versions of GMRES with deflation of eigenvalues are applied to lattice QCD problems. Approximate eigenvectors corresponding to the smallest eigenvalues are generated at the same time that linear equations are solved. The eigenvectors improve convergence for the linear equations, and they help solve other right-hand sides
Energy eigenvalues of helium-like atoms in dense plasmas
International Nuclear Information System (INIS)
Hashino, Tasuke; Nakazaki, Shinobu; Kato, Takako; Kashiwabara, Hiromichi.
1987-04-01
Calculations based on a variational method with wave functions including the correlation of electrons are carried out to obtain energy eigenvalues of Schroedinger's equation for helium-like atoms embedded in dense plasmas, taking the Debye-Hueckel approximation. Energy eigenvalues for the 1 1 S, 2 1 S, and 2 3 S states are obtained as a function of Debye screening length. (author)
A numerical method to compute interior transmission eigenvalues
International Nuclear Information System (INIS)
Kleefeld, Andreas
2013-01-01
In this paper the numerical calculation of eigenvalues of the interior transmission problem arising in acoustic scattering for constant contrast in three dimensions is considered. From the computational point of view existing methods are very expensive, and are only able to show the existence of such transmission eigenvalues. Furthermore, they have trouble finding them if two or more eigenvalues are situated closely together. We present a new method based on complex-valued contour integrals and the boundary integral equation method which is able to calculate highly accurate transmission eigenvalues. So far, this is the first paper providing such accurate values for various surfaces different from a sphere in three dimensions. Additionally, the computational cost is even lower than those of existing methods. Furthermore, the algorithm is capable of finding complex-valued eigenvalues for which no numerical results have been reported yet. Until now, the proof of existence of such eigenvalues is still open. Finally, highly accurate eigenvalues of the interior Dirichlet problem are provided and might serve as test cases to check newly derived Faber–Krahn type inequalities for larger transmission eigenvalues that are not yet available. (paper)
Estimates for lower order eigenvalues of a clamped plate problem
Cheng, Qing-Ming; Huang, Guangyue; Wei, Guoxin
2009-01-01
For a bounded domain $\\Omega$ in a complete Riemannian manifold $M^n$, we study estimates for lower order eigenvalues of a clamped plate problem. We obtain universal inequalities for lower order eigenvalues. We would like to remark that our results are sharp.
Jacobi-Davidson methods for generalized MHD-eigenvalue problems
J.G.L. Booten; D.R. Fokkema; G.L.G. Sleijpen; H.A. van der Vorst (Henk)
1995-01-01
textabstractA Jacobi-Davidson algorithm for computing selected eigenvalues and associated eigenvectors of the generalized eigenvalue problem $Ax = lambda Bx$ is presented. In this paper the emphasis is put on the case where one of the matrices, say the B-matrix, is Hermitian positive definite. The
A method for the solution of the RPA eigenvalue
International Nuclear Information System (INIS)
Hoffman, M.J.H.; De Kock, P.R.
1986-01-01
The RPA eigenvalue problem requires the diagonalization of a 2nx2n matrix. In practical calculations, n (the number of particle-hole basis states) can be a few hundred and the diagonalization of such a large non-symmetric matrix may take quite a long time. In this report we firstly discuss sufficient conditions for real and non-zero RPA eigenvalues. The presence of zero or imaginary eigenvalues is related to the relative importance of the groundstate correlations to the total interaction energy. We then rewrite the RPA eigenvalue problem for the cases where these conditions are fulfilled in a form which only requires the diagonalization of two symmetric nxn matrices. The extend to which this method can be applied when zero eigenvalues occur, is also discussed
The eigenvalues of the SN transport matrix
International Nuclear Information System (INIS)
Ourique, L.E.; Vilhena, M.T. de
2005-01-01
In a recent paper, we analyze the dependence of the eigenvalues of the S N matrix transport, associated with the system of linear differential equations that corresponds to the S N approximations of the transport equation [1]. By considering a control parameter, we have shown that there exist some bifurcation points. This means that the solutions of S N approximations change from oscillatory to non-oscillatory behavior, a different approach of the study by [2]. Nowadays, the one-dimensional transport equation and related problems have been a source of new techniques for solving particular cases as well the development of analytical methods that search aspects of existence and uniqueness of the solutions [3], [4]. In this work, we generalize the results shown in [1], searching for a model of the distribution of the bifurcation points of the S N matrix transport, studying the one-dimensional case in a slab, with anisotropic differential cross section of order 3. The result indicates that the bifurcation points obey a certain rule of distribution. Beside that, the condition number of the matrix transport increases too much in the neighborhood of these points, as we have seen in [1]. (author)
Eigenvalues of the simplified ideal MHD ballooning equation
International Nuclear Information System (INIS)
Paris, R.B.; Auby, N.; Dagazian, R.Y.
1986-01-01
The investigation of the spectrum of the simplified differential equation describing the variation of the amplitude of the ideal MHD ballooning instability along magnetic field lines constitutes a multiparameter Schroedinger eigenvalue problem. An exact eigenvalue relation for the discrete part of the spectrum is obtained in terms of the oblate spheroidal functions. The dependence of the eigenvalues lambda on the two free parameters γ 2 and μ 2 of the equation is discussed, together with certain analytical approximations in the limits of small and large γ 2 . A brief review of the principal properties of the spheroidal functions is given in an appendix
Solving complex band structure problems with the FEAST eigenvalue algorithm
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.
Shakir, Muhammad Zeeshan
2013-03-01
Eigenvalue Ratio (ER) detector based on the two extreme eigenvalues of the received signal covariance matrix is currently one of the most effective solution for spectrum sensing. However, the analytical results of such scheme often depend on asymptotic assumptions since the distribution of the ratio of two extreme eigenvalues is exceptionally complex to compute. In this paper, a non-asymptotic spectrum sensing approach for ER detector is introduced to approximate the marginal and joint distributions of the two extreme eigenvalues. The two extreme eigenvalues are considered as dependent Gaussian random variables such that their joint probability density function (PDF) is approximated by a bivariate Gaussian distribution function for any number of cooperating secondary users and received samples. The PDF approximation approach is based on the moment matching method where we calculate the exact analytical moments of joint and marginal distributions of the two extreme eigenvalues. The decision threshold is calculated by exploiting the statistical mean and the variance of each of the two extreme eigenvalues and the correlation coefficient between them. The performance analysis of our newly proposed approximation approach is compared with the already published asymptotic Tracy-Widom approximation approach. It has been shown that our results are in perfect agreement with the simulation results for any number of secondary users and received samples. © 2002-2012 IEEE.
Extreme eigenvalues of sample covariance and correlation matrices
DEFF Research Database (Denmark)
Heiny, Johannes
This thesis is concerned with asymptotic properties of the eigenvalues of high-dimensional sample covariance and correlation matrices under an infinite fourth moment of the entries. In the first part, we study the joint distributional convergence of the largest eigenvalues of the sample covariance...... matrix of a p-dimensional heavy-tailed time series when p converges to infinity together with the sample size n. We generalize the growth rates of p existing in the literature. Assuming a regular variation condition with tail index ... eigenvalues are essentially determined by the extreme order statistics from an array of iid random variables. The asymptotic behavior of the extreme eigenvalues is then derived routinely from classical extreme value theory. The resulting approximations are strikingly simple considering the high dimension...
Complex eigenvalue analysis of railway wheel/rail squeal
African Journals Online (AJOL)
DR OKE
Squeal noise from wheel/rail and brake disc/pad frictional contact is typical in railways. ... squeal noise by multibody simulation of a rail car running on rigid rails. ... system, traditional complex eigenvalue analysis by finite element was used.
Inequalities among eigenvalues of Sturm–Liouville problems
Directory of Open Access Journals (Sweden)
Kong Q
1999-01-01
Full Text Available There are well-known inequalities among the eigenvalues of Sturm–Liouville problems with periodic, semi-periodic, Dirichlet and Neumann boundary conditions. In this paper, for an arbitrary coupled self-adjoint boundary condition, we identify two separated boundary conditions corresponding to the Dirichlet and Neumann conditions in the classical case, and establish analogous inequalities. It is also well-known that the lowest periodic eigenvalue is simple; here we prove a similar result for the general case. Moreover, we show that the algebraic and geometric multiplicities of the eigenvalues of self-adjoint regular Sturm–Liouville problems with coupled boundary conditions are the same. An important step in our approach is to obtain a representation of the fundamental solutions for sufficiently negative values of the spectral parameter. Our approach yields the existence and boundedness from below of the eigenvalues of arbitrary self-adjoint regular Sturm–Liouville problems without using operator theory.
An eigenvalue localization set for tensors and its applications
Directory of Open Access Journals (Sweden)
Jianxing Zhao
2017-03-01
Full Text Available Abstract 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 M $\\mathcal{M}$ -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 N = { 1 , 2 , … , n } $N=\\{1,2,\\ldots,n\\}$ , we can obtain a tighter eigenvalue localization set for tensors and sharper bounds for the minimum eigenvalue of M $\\mathcal{M}$ -tensors. Finally, numerical examples are given to verify the theoretical results.
An eigenvalue localization set for tensors and its applications.
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.
Fourier convergence analysis applied to neutron diffusion Eigenvalue problem
International Nuclear Information System (INIS)
Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook
2004-01-01
Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Though the methods can be applied to Eigenvalue problems too, all the Fourier convergence analyses have been performed only for fixed source problems and a Fourier convergence analysis for Eigenvalue problem has never been reported. Lee et al proposed new 2-D/1-D coupling methods and they showed that the new ones are unconditionally stable while one of the two existing ones is unstable at a small mesh size and that the new ones are better than the existing ones in terms of the convergence rate. In this paper the convergence of method A in reference 4 for the diffusion Eigenvalue problem was analyzed by the Fourier analysis. The Fourier convergence analysis presented in this paper is the first one applied to a neutronics eigenvalue problem to the best of our knowledge
Eigenvalues of Words in Two Positive Definite Letters
Hillar, Christopher J; Johnson, Charles R
2005-01-01
The question of whether all words in two real positive definite letters have only positive eigenvalues is addressed and settled (negatively). This question was raised some time ago in connection with a long-standing problem in theoretical physics. A large class of words that do guarantee positive eigenvalues is identified, and considerable evidence is given for the conjecture that no other words do. In the process, a fundamental question about solvability of symmetric word equations is encoun...
Complex eigenvalues for neutron transport equation with quadratically anisotropic scattering
International Nuclear Information System (INIS)
Sjoestrand, N.G.
1981-01-01
Complex eigenvalues for the monoenergetic neutron transport equation in the buckling approximation have been calculated for various combinations of linearly and quadratically anisotropic scattering. The results are discussed in terms of the time-dependent case. Tables are given of complex bucklings for real decay constants and of complex decay constants for real bucklings. The results fit nicely into the pattern of real and purely imaginary eigenvalues obtained earlier. (author)
Bound-state Dirac eigenvalues for scalar potentials
International Nuclear Information System (INIS)
Ram, B.; Arafah, M.
1981-01-01
The Dirac equation is solved with a linear and a quadratic scalar potential using an approach in which the Dirac equation is first transformed to a one-dimensional Schroedinger equation with an effective potential. The WKB method is used to obtain the energy eigenvalues. The eigenvalues for the quadratic scalar potential are real just as they are for the linear potential. The results with the linear potential agree well with those obtained by Critchfield. (author)
An adjoint-based scheme for eigenvalue error improvement
International Nuclear Information System (INIS)
Merton, S.R.; Smedley-Stevenson, R.P.; Pain, C.C.; El-Sheikh, A.H.; Buchan, A.G.
2011-01-01
A scheme for improving the accuracy and reducing the error in eigenvalue calculations is presented. Using a rst order Taylor series expansion of both the eigenvalue solution and the residual of the governing equation, an approximation to the error in the eigenvalue is derived. This is done using a convolution of the equation residual and adjoint solution, which is calculated in-line with the primal solution. A defect correction on the solution is then performed in which the approximation to the error is used to apply a correction to the eigenvalue. The method is shown to dramatically improve convergence of the eigenvalue. The equation for the eigenvalue is shown to simplify when certain normalizations are applied to the eigenvector. Two such normalizations are considered; the rst of these is a fission-source type of normalisation and the second is an eigenvector normalisation. Results are demonstrated on a number of demanding elliptic problems using continuous Galerkin weighted nite elements. Moreover, the correction scheme may also be applied to hyperbolic problems and arbitrary discretization. This is not limited to spatial corrections and may be used throughout the phase space of the discrete equation. The applied correction not only improves fidelity of the calculation, it allows assessment of the reliability of numerical schemes to be made and could be used to guide mesh adaption algorithms or to automate mesh generation schemes. (author)
EISPACK, Subroutines for Eigenvalues, Eigenvectors, Matrix Operations
International Nuclear Information System (INIS)
Garbow, Burton S.; Cline, A.K.; Meyering, J.
1993-01-01
1 - Description of problem or function: EISPACK3 is a collection of 75 FORTRAN subroutines, both single- and double-precision, that compute the eigenvalues and eigenvectors of nine classes of matrices. The package can determine the Eigen-system of complex general, complex Hermitian, real general, real symmetric, real symmetric band, real symmetric tridiagonal, special real tridiagonal, generalized real, and generalized real symmetric matrices. In addition, there are two routines which use the singular value decomposition to solve certain least squares problem. The individual subroutines are - Identification/Description: BAKVEC: Back transform vectors of matrix formed by FIGI; BALANC: Balance a real general matrix; BALBAK: Back transform vectors of matrix formed by BALANC; BANDR: Reduce sym. band matrix to sym. tridiag. matrix; BANDV: Find some vectors of sym. band matrix; BISECT: Find some values of sym. tridiag. matrix; BQR: Find some values of sym. band matrix; CBABK2: Back transform vectors of matrix formed by CBAL; CBAL: Balance a complex general matrix; CDIV: Perform division of two complex quantities; CG: Driver subroutine for a complex general matrix; CH: Driver subroutine for a complex Hermitian matrix; CINVIT: Find some vectors of complex Hess. matrix; COMBAK: Back transform vectors of matrix formed by COMHES; COMHES: Reduce complex matrix to complex Hess. (elementary); COMLR: Find all values of complex Hess. matrix (LR); COMLR2: Find all values/vectors of cmplx Hess. matrix (LR); CCMQR: Find all values of complex Hessenberg matrix (QR); COMQR2: Find all values/vectors of cmplx Hess. matrix (QR); CORTB: Back transform vectors of matrix formed by CORTH; CORTH: Reduce complex matrix to complex Hess. (unitary); CSROOT: Find square root of complex quantity; ELMBAK: Back transform vectors of matrix formed by ELMHES; ELMHES: Reduce real matrix to real Hess. (elementary); ELTRAN: Accumulate transformations from ELMHES (for HQR2); EPSLON: Estimate unit roundoff
Hessian eigenvalue distribution in a random Gaussian landscape
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.
Solving the RPA eigenvalue equation in real-space
Muta, A; Hashimoto, Y; Yabana, K
2002-01-01
We present a computational method to solve the RPA eigenvalue equation employing a uniform grid representation in three-dimensional Cartesian coordinates. The conjugate gradient method is used for this purpose as an interactive method for a generalized eigenvalue problem. No construction of unoccupied orbitals is required in the procedure. We expect this method to be useful for systems lacking spatial symmetry to calculate accurate eigenvalues and transition matrix elements of a few low-lying excitations. Some applications are presented to demonstrate the feasibility of the method, considering the simplified mean-field model as an example of a nuclear physics system and the electronic excitations in molecules with time-dependent density functional theory as an example of an electronic system. (author)
The nonconforming virtual element method for eigenvalue problems
Energy Technology Data Exchange (ETDEWEB)
Gardini, Francesca [Univ. of Pavia (Italy). Dept. of Mathematics; Manzini, Gianmarco [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Vacca, Giuseppe [Univ. of Milano-Bicocca, Milan (Italy). Dept. of Mathematics and Applications
2018-02-05
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 numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.
Efficient methods for time-absorption (α) eigenvalue calculations
International Nuclear Information System (INIS)
Hill, T.R.
1983-01-01
The time-absorption eigenvalue (α) calculation is one of the options found in most discrete-ordinates transport codes. Several methods have been developed at Los Alamos to improve the efficiency of this calculation. Two procedures, based on coarse-mesh rebalance, to accelerate the α eigenvalue search are derived. A hybrid scheme to automatically choose the more-effective rebalance method is described. The α rebalance scheme permits some simple modifications to the iteration strategy that eliminates many unnecessary calculations required in the standard search procedure. For several fast supercritical test problems, these methods resulted in convergence with one-fifth the number of iterations required for the conventional eigenvalue search procedure
Evaluation of Eigenvalue Routines for Large Scale Applications
Directory of Open Access Journals (Sweden)
V.A. Tischler
1994-01-01
Full Text Available 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 article is to examine the current eigenvalue routines in NASTRAN and to make efficiency comparisons with a more recent implementation of the block Lanczos aLgorithm. This eigenvalue routine is now availabLe in several mathematics libraries as well as in severaL commerciaL versions of NASTRAN. In addition, the eRA Y library 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, particularly for very large problems.
Bounds and estimates for the linearly perturbed eigenvalue problem
International Nuclear Information System (INIS)
Raddatz, W.D.
1983-01-01
This thesis considers the problem of bounding and estimating the discrete portion of the spectrum of a linearly perturbed self-adjoint operator, M(x). It is supposed that one knows an incomplete set of data consisting in the first few coefficients of the Taylor series expansions of one or more of the eigenvalues of M(x) about x = 0. The foundations of the variational study of eigen-values are first presented. These are then used to construct the best possible upper bounds and estimates using various sets of given information. Lower bounds are obtained by estimating the error in the upper bounds. The extension of these bounds and estimates to the eigenvalues of the doubly-perturbed operator M(x,y) is discussed. The results presented have numerous practical application in the physical sciences, including problems in atomic physics and the theory of vibrations of acoustical and mechanical systems
An algebraic substructuring using multiple shifts for eigenvalue computations
International Nuclear Information System (INIS)
Ko, Jin Hwan; Jung, Sung Nam; Byun, Do Young; Bai, Zhaojun
2008-01-01
Algebraic substructuring (AS) is a state-of-the-art method in eigenvalue computations, especially for large-sized problems, but originally it was designed to calculate only the smallest eigenvalues. Recently, an updated version of AS has been introduced to calculate the interior eigenvalues over a specified range by using a shift concept that is referred to as the shifted AS. In this work, we propose a combined method of both AS and the shifted AS by using multiple shifts for solving a considerable number of eigensolutions in a large-sized problem, which is an emerging computational issue of noise or vibration analysis in vehicle design. In addition, we investigated the accuracy of the shifted AS by presenting an error criterion. The proposed method has been applied to the FE model of an automobile body. The combined method yielded a higher efficiency without loss of accuracy in comparison to the original AS
Eigenvalues of PT-symmetric oscillators with polynomial potentials
International Nuclear Information System (INIS)
Shin, Kwang C
2005-01-01
We study the eigenvalue problem -u''(z) - [(iz) m + P m-1 (iz)]u(z) λu(z) with the boundary condition that u(z) decays to zero as z tends to infinity along the rays arg z = -π/2 ± 2π/(m+2) in the complex plane, where P m-1 (z) = a 1 z m-1 + a 2 z m-2 + . . . + a m-1 z is a polynomial and integers m ≥ 3. We provide an asymptotic expansion of the eigenvalues λ n as n → +∞, and prove that for each real polynomial P m-1 , the eigenvalues are all real and positive, with only finitely many exceptions
Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices
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.
Perturbation of eigenvalues of preconditioned Navier-Stokes operators
Energy Technology Data Exchange (ETDEWEB)
Elman, H.C. [Univ. of Maryland, College Park, MD (United States)
1996-12-31
We study the sensitivity of algebraic eigenvalue problems associated with matrices arising from linearization and discretization of the steady-state Navier-Stokes equations. In particular, for several choices of preconditioners applied to the system of discrete equations, we derive upper bounds on perturbations of eigenvalues as functions of the viscosity and discretization mesh size. The bounds suggest that the sensitivity of the eigenvalues is at worst linear in the inverse of the viscosity and quadratic in the inverse of the mesh size, and that scaling can be used to decrease the sensitivity in some cases. Experimental results supplement these results and confirm the relatively mild dependence on viscosity. They also indicate a dependence on the mesh size of magnitude smaller than the analysis suggests.
Joint density of eigenvalues in spiked multivariate models.
Dharmawansa, Prathapasinghe; Johnstone, Iain M
2014-01-01
The classical methods of multivariate analysis are based on the eigenvalues of one or two sample covariance matrices. In many applications of these methods, for example to high dimensional data, it is natural to consider alternative hypotheses which are a low rank departure from the null hypothesis. For rank one alternatives, this note provides a representation for the joint eigenvalue density in terms of a single contour integral. This will be of use for deriving approximate distributions for likelihood ratios and 'linear' statistics used in testing.
Recent developments in semiclassical mechanics: eigenvalues and reaction rate constants
International Nuclear Information System (INIS)
Miller, W.H.
1976-04-01
A semiclassical treatment of eigenvalues for a multidimensional non-separable potential function and of the rate constant for a chemical reaction with an activation barrier is presented. Both phenomena are seen to be described by essentially the same semiclassical formalism, which is based on a construction of the total Hamiltonian in terms of the complete set of ''good'' action variables (or adiabatic invariants) associated with the minimum in the potential energy surface for the eigenvalue case, or the saddle point in the potential energy surface for the case of chemical reaction
A teaching proposal for the study of Eigenvectors and Eigenvalues
Directory of Open Access Journals (Sweden)
María José Beltrán Meneu
2017-03-01
Full Text Available 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 eigenvectors and eigenvalues from a geometric point of view. It was designed following a particular sequence of activities with the schema: exploration, introduction of concepts, structuring of knowledge and application, and considering the three worlds of mathematical thinking provided by Tall: embodied, symbolic and formal.
Eigenvalues of the Transferences of Gaussian Optical Systems
Directory of Open Access Journals (Sweden)
W.F. Harris
2005-12-01
Full Text Available The problem of how to define an average eye leads to the question of what eigenvalues are possible for ray transferences. This paper examines the set of possible eigenvalues in the simplest possible case, that of optical systems consisting of elements that are stigmatic and centred on a common axis.
A subspace preconditioning algorithm for eigenvector/eigenvalue computation
Energy Technology Data Exchange (ETDEWEB)
Bramble, J.H.; Knyazev, A.V.; Pasciak, J.E.
1996-12-31
We consider the problem of computing a modest number of the smallest eigenvalues along with orthogonal bases for the corresponding eigen-spaces of a symmetric positive definite matrix. In our applications, the dimension of a matrix is large and the cost of its inverting is prohibitive. In this paper, we shall develop an effective parallelizable technique for computing these eigenvalues and eigenvectors utilizing subspace iteration and preconditioning. Estimates will be provided which show that the preconditioned method converges linearly and uniformly in the matrix dimension when used with a uniform preconditioner under the assumption that the approximating subspace is close enough to the span of desired eigenvectors.
Fundaments of transport equation splitting and the eigenvalue problem
International Nuclear Information System (INIS)
Stancic, V.
2000-01-01
In order to remove some singularities concerning the boundary conditions of one dimensional transport equation, a split form of transport equation describing the forward i.e. μ≥0, and a backward μ<0 directed neutrons is being proposed here. The eigenvalue problem has also been considered here (author)
Discontinuous Sturm-Liouville Problems with Eigenvalue Dependent Boundary Condition
Energy Technology Data Exchange (ETDEWEB)
Amirov, R. Kh., E-mail: emirov@cumhuriyet.edu.tr; Ozkan, A. S., E-mail: sozkan@cumhuriyet.edu.tr [Cumhuriyet University, Department of Mathematics Faculty of Art and Science (Turkey)
2014-12-15
In this study, an inverse problem for Sturm-Liouville differential operators with discontinuities is studied when an eigenparameter appears not only in the differential equation but it also appears in the boundary condition. Uniqueness theorems of inverse problems according to the Prüfer angle, the Weyl function and two different eigenvalues sets are proved.
A Universal Quantum Circuit Scheme For Finding Complex Eigenvalues
Daskin, Anmer; Grama, Ananth; Kais, Sabre
2013-01-01
We present a general quantum circuit design for finding eigenvalues of non-unitary matrices on quantum computers using the iterative phase estimation algorithm. In particular, we show how the method can be used for the simulation of resonance states for quantum systems.
Eigenvalue estimates for submanifolds with bounded f-mean curvature
Indian Academy of Sciences (India)
GUANGYUE HUANG
1College of Mathematics and Information Science, Henan Normal University,. Xinxiang 453007 ... submanifolds in a hyperbolic space with the norm of their mean curvature vector bounded above by a constant. ..... [2] Batista M, Cavalcante M P and Pyo J, Some isoperimetric inequalities and eigenvalue estimates in ...
Hardy inequality, compact embeddings and properties of certain eigenvalue problems
Czech Academy of Sciences Publication Activity Database
Drábek, P.; Kufner, Alois
2017-01-01
Roč. 49, č. 1 (2017), s. 5-17 ISSN 0049-4704 Institutional support: RVO:67985840 Keywords : BD-property * compact embeddings * degenerate and singular eigenvalue problem Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics https://www.openstarts.units.it/handle/10077/16201
Escape rate from strange sets as an eigenvalue
International Nuclear Information System (INIS)
Tel, T.
1986-06-01
A new method is applied for calculating the escape rate from chaotic repellers or semi-attractors, based on the eigenvalue problem of the master equation of discrete dynamical systems. The corresponding eigenfunction is found to be smooth along unstable directions and to be, in general, a fractal measure. Examples of one and two dimensional maps are investigated. (author)
First-order optical systems with unimodular eigenvalues
Bastiaans, M.J.; Alieva, T.
2006-01-01
It is shown that a lossless first-order optical system whose real symplectic ray transformation matrix can be diagonalized and has only unimodular eigenvalues, is similar to a separable fractional Fourier transformer in the sense that the ray transformation matrices of the unimodular system and the
Eigenvalue estimates of positive integral operators with analytic ...
Indian Academy of Sciences (India)
Eigenvalue estimates of positive integral operators. 337 will be used to denote, respectively, the complex line integral of f along γ and the integral of f with respect to arc-length measure. In the first case we assume γ has an orientation. The notation Lp(γ ) will denote the Lp space of normalized arc length measure on γ with.
New algorithms for the symmetric tridiagonal eigenvalue computation
Energy Technology Data Exchange (ETDEWEB)
Pan, V. [City Univ. of New York, Bronx, NY (United States)]|[International Computer Sciences Institute, Berkeley, CA (United States)
1994-12-31
The author presents new algorithms that accelerate the bisection method for the symmetric eigenvalue problem. The algorithms rely on some new techniques, which include acceleration of Newton`s iteration and can also be further applied to acceleration of some other iterative processes, in particular, of iterative algorithms for approximating polynomial zeros.
Solving eigenvalue response matrix equations with nonlinear techniques
International Nuclear Information System (INIS)
Roberts, Jeremy A.; Forget, Benoit
2014-01-01
Highlights: • High performance solvers were applied within ERMM for the first time. • Accelerated fixed-point methods were developed that reduce computational times by 2–3. • A nonlinear, Newton-based ERMM led to similar improvement and more robustness. • A 3-D, SN-based ERMM shows how ERMM can apply fine-mesh methods to full-core analysis. - Abstract: This paper presents new algorithms for use in the eigenvalue response matrix method (ERMM) for reactor eigenvalue problems. ERMM spatially decomposes a domain into independent nodes linked via boundary conditions approximated as truncated orthogonal expansions, the coefficients of which are response functions. In its simplest form, ERMM consists of a two-level eigenproblem: an outer Picard iteration updates the k-eigenvalue via balance, while the inner λ-eigenproblem imposes neutron balance between nodes. Efficient methods are developed for solving the inner λ-eigenvalue problem within the outer Picard iteration. Based on results from several diffusion and transport benchmark models, it was found that the Krylov–Schur method applied to the λ-eigenvalue problem reduces Picard solver times (excluding response generation) by a factor of 2–5. Furthermore, alternative methods, including Picard acceleration schemes, Steffensen’s method, and Newton’s method, are developed in this paper. These approaches often yield faster k-convergence and a need for fewer k-dependent response function evaluations, which is important because response generation is often the primary cost for problems using responses computed online (i.e., not from a precomputed database). Accelerated Picard iteration was found to reduce total computational times by 2–3 compared to the unaccelerated case for problems dominated by response generation. In addition, Newton’s method was found to provide nearly the same performance with improved robustness
The universal eigenvalue bounds of Payne–Pólya–Weinberger, Hile ...
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
following universal inequalities for the λi's in the case when n = 2: λk+1 − λk ≤. 2 .... with V ≥ 0 on and eigenvalue problems with a weight (e.g., the fixed ...... [29] Protter M H, Universal inequalities for eigenvalues, Maximum Principles and Eigenvalue. Problems in ... minimal submanifolds, Ann. Scuola Norm. Sup. Pisa Cl.
Directory of Open Access Journals (Sweden)
Manfred Möller
2013-01-01
Full Text Available Considered is a regular fourth order ordinary differential equation which depends quadratically on the eigenvalue parameter λ and which has separable boundary conditions depending linearly on λ. It is shown that the eigenvalues lie in the closed upper half plane or on the imaginary axis and are symmetric with respect to the imaginary axis. The first four terms in the asymptotic expansion of the eigenvalues are provided.
Two new eigenvalue localization sets for tensors and theirs applications
Directory of Open Access Journals (Sweden)
Zhao Jianxing
2017-10-01
Full Text Available A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Qi (J. Symbolic Comput., 2005, 40, 1302-1324 and Li et al. (Numer. Linear Algebra Appl., 2014, 21, 39-50. As an application, a weaker checkable sufficient condition for the positive (semi-definiteness of an even-order real symmetric tensor is obtained. Meanwhile, an S-type E-eigenvalue localization set for tensors is given and proved to be tighter than that presented by Wang et al. (Discrete Cont. Dyn.-B, 2017, 22(1, 187-198. As an application, an S-type upper bound for the Z-spectral radius of weakly symmetric nonnegative tensors is obtained. Finally, numerical examples are given to verify the theoretical results.
EISPACK-J: subprogram package for solving eigenvalue problems
International Nuclear Information System (INIS)
Fujimura, Toichiro; Tsutsui, Tsuneo
1979-05-01
EISPACK-J, a subprogram package for solving eigenvalue problems, has been developed and subprograms with a variety of functions have been prepared. These subprograms can solve standard problems of complex matrices, general problems of real matrices and special problems in which only the required eigenvalues and eigenvectors are calculated. They are compared to existing subprograms, showing their features through benchmark tests. Many test problems, including realistic scale problems, are provided for the benchmark tests. Discussions are made on computer core storage and computing time required for each subprogram, and accuracy of the solution. The results show that the subprograms of EISPACK-J, based on Householder, QR and inverse iteration methods, are the best in computing time and accuracy. (author)
Gravitational lensing by eigenvalue distributions of random matrix models
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.
On Polya's inequality for torsional rigidity and first Dirichlet eigenvalue
Berg, M. van den; Ferone, V.; Nitsch, C.; Trombetti, C.
2016-01-01
Let $\\Omega$ be an open set in Euclidean space with finite Lebesgue measure $|\\Omega|$. We obtain some properties of the set function $F:\\Omega\\mapsto \\R^+$ defined by $$ F(\\Omega)=\\frac{T(\\Omega)\\lambda_1(\\Omega)}{|\\Omega|} ,$$ where $T(\\Omega)$ and $\\lambda_1(\\Omega)$ are the torsional rigidity and the first eigenvalue of the Dirichlet Laplacian respectively. We improve the classical P\\'olya bound $F(\\Omega)\\le 1,$ and show that $$F(\\Omega)\\le 1- \
A method for eigenvalues of sparse lambda-matrices
International Nuclear Information System (INIS)
Yang, W.H.
1982-01-01
The matrix N(lambda) whose elements are functions of a parameter lambda is called the lambda-matrix. Those values of lambda that make the matrix singular are of great interest in many applied fields. An efficient method for those eigenvalues of a lambda-matrix is presented. A simple explicit convergence criterion is given as well as the algorithm and two numerical examples
Eigenvalue inequalities for the Laplacian with mixed boundary conditions
Czech Academy of Sciences Publication Activity Database
Lotoreichik, Vladimir; Rohleder, J.
2017-01-01
Roč. 263, č. 1 (2017), s. 491-508 ISSN 0022-0396 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : Laplace operator * mixed boundary conditions * eigenvalue inequality * polyhedral domain * Lipschitz domain Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 1.988, year: 2016
Eigenvalue solutions in finite element thermal transient problems
International Nuclear Information System (INIS)
Stoker, J.R.
1975-01-01
The eigenvalue economiser concept can be useful in solving large finite element transient heat flow problems in which the boundary heat transfer coefficients are constant. The usual economiser theory is equivalent to applying a unit thermal 'force' to each of a small sub-set of nodes on the finite element mesh, and then calculating sets of resulting steady state temperatures. Subsequently it is assumed that the required transient temperature distributions can be approximated by a linear combination of this comparatively small set of master temperatures. The accuracy of a reduced eigenvalue calculation depends upon a good choice of master nodes, which presupposes at least a little knowledge about what sort of shape is expected in the unknown temperature distributions. There are some instances, however, where a reasonably good idea exists of the required shapes, permitting a modification to the economiser process which leads to greater economy in the number of master temperatures. The suggested new approach is to use manually prescribed temperature distributions as the master distributions, rather than using temperatures resulting from unit thermal forces. Thus, with a little pre-knowledge one may write down a set of master distributions which, as a linear combination, can represent the required solution over the range of interest to a reasonable engineering accuracy, and using the minimum number of variables. The proposed modified eigenvalue economiser technique then uses the master distributions in an automatic way to arrive at the required solution. The technique is illustrated by some simple finite element examples
New exact approaches to the nuclear eigenvalue problem
International Nuclear Information System (INIS)
Andreozzi, F.; Lo Iudice, N.; Porrino, A.; Knapp, F.; Kvasil, J.
2005-01-01
In a recent past some of us have developed a new algorithm for diagonalizing the shell model Hamiltonian which consists of an iterative sequence of diagonalization of sub-matrices of small dimensions. The method, apart from being easy to implement, is robust, yielding always stable numerical solutions, and free of ghost eigenvalues. Subsequently, we have endowed the algorithm with an importance sampling, which leads to a drastic truncation of the shell model space, while keeping the accuracy of the solutions under control. Applications to typical nuclei show that the sampling yields also an extrapolation law to the exact eigenvalues. Complementary to the shell model algorithm is a method we are developing for studying collective and non collective excitations. To this purpose we solve the nuclear eigenvalue problem in a space which is the direct sum of Tamm-Dancoff n-phonon subspaces (n=0,1, ...N). The multiphonon basis is constructed by an iterative equation of motion method, which generates an over complete set of n-phonon states from the (n-1)-phonon basis. The redundancy is removed completely and exactly by a method based on the Choleski decomposition. The full Hamiltonian matrix comes out to have a simple structure and, therefore, can be drastically truncated before diagonalization by the mentioned importance sampling method. The phonon composition of the basis states allows removing naturally and maximally the spurious admixtures induced by the centre of mass motion. An application of the method to 16 O will be given for illustrative purposes. (authors)
Ab initio nuclear structure - the large sparse matrix eigenvalue problem
Energy Technology Data Exchange (ETDEWEB)
Vary, James P; Maris, Pieter [Department of Physics, Iowa State University, Ames, IA, 50011 (United States); Ng, Esmond; Yang, Chao [Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720 (United States); Sosonkina, Masha, E-mail: jvary@iastate.ed [Scalable Computing Laboratory, Ames Laboratory, Iowa State University, Ames, IA, 50011 (United States)
2009-07-01
The structure and reactions of light nuclei represent fundamental and formidable challenges for microscopic theory based on realistic strong interaction potentials. Several ab initio methods have now emerged that provide nearly exact solutions for some nuclear properties. The ab initio no core shell model (NCSM) and the no core full configuration (NCFC) method, frame this quantum many-particle problem as a large sparse matrix eigenvalue problem where one evaluates the Hamiltonian matrix in a basis space consisting of many-fermion Slater determinants and then solves for a set of the lowest eigenvalues and their associated eigenvectors. The resulting eigenvectors are employed to evaluate a set of experimental quantities to test the underlying potential. For fundamental problems of interest, the matrix dimension often exceeds 10{sup 10} and the number of nonzero matrix elements may saturate available storage on present-day leadership class facilities. We survey recent results and advances in solving this large sparse matrix eigenvalue problem. We also outline the challenges that lie ahead for achieving further breakthroughs in fundamental nuclear theory using these ab initio approaches.
Ab initio nuclear structure - the large sparse matrix eigenvalue problem
International Nuclear Information System (INIS)
Vary, James P; Maris, Pieter; Ng, Esmond; Yang, Chao; Sosonkina, Masha
2009-01-01
The structure and reactions of light nuclei represent fundamental and formidable challenges for microscopic theory based on realistic strong interaction potentials. Several ab initio methods have now emerged that provide nearly exact solutions for some nuclear properties. The ab initio no core shell model (NCSM) and the no core full configuration (NCFC) method, frame this quantum many-particle problem as a large sparse matrix eigenvalue problem where one evaluates the Hamiltonian matrix in a basis space consisting of many-fermion Slater determinants and then solves for a set of the lowest eigenvalues and their associated eigenvectors. The resulting eigenvectors are employed to evaluate a set of experimental quantities to test the underlying potential. For fundamental problems of interest, the matrix dimension often exceeds 10 10 and the number of nonzero matrix elements may saturate available storage on present-day leadership class facilities. We survey recent results and advances in solving this large sparse matrix eigenvalue problem. We also outline the challenges that lie ahead for achieving further breakthroughs in fundamental nuclear theory using these ab initio approaches.
Stratified source-sampling techniques for Monte Carlo eigenvalue analysis
International Nuclear Information System (INIS)
Mohamed, A.
1998-01-01
In 1995, at a conference on criticality safety, a special session was devoted to the Monte Carlo ''Eigenvalue of the World'' problem. Argonne presented a paper, at that session, in which the anomalies originally observed in that problem were reproduced in a much simplified model-problem configuration, and removed by a version of stratified source-sampling. In this paper, stratified source-sampling techniques are generalized and applied to three different Eigenvalue of the World configurations which take into account real-world statistical noise sources not included in the model problem, but which differ in the amount of neutronic coupling among the constituents of each configuration. It is concluded that, in Monte Carlo eigenvalue analysis of loosely-coupled arrays, the use of stratified source-sampling reduces the probability of encountering an anomalous result over that if conventional source-sampling methods are used. However, this gain in reliability is substantially less than that observed in the model-problem results
AMDLIBF, IBM 360 Subroutine Library, Eigenvalues, Eigenvectors, Matrix Inversion
International Nuclear Information System (INIS)
Wang, Jesse Y.
1980-01-01
Description of problem or function: AMDLIBF is a subset of the IBM 360 Subroutine Library at the Applied Mathematics Division at Argonne. This subset includes library category F: Identification/Description: F152S F SYMINV: Invert sym. matrices, solve lin. systems; F154S A DOTP: Double plus precision accum. inner prod.; F156S F RAYCOR: Rayleigh corrections for eigenvalues; F161S F XTRADP: A fast extended precision inner product; F162S A XTRADP: Inner product of two DP real vectors; F202S F1 EIGEN: Eigen-system for real symmetric matrix; F203S F: Driver for F202S; F248S F RITZIT: Largest eigenvalue and vec. real sym. matrix; F261S F EIGINV: Inverse eigenvalue problem; F313S F CQZHES: Reduce cmplx matrices to upper Hess and tri; F314S F CQZVAL: Reduce complex matrix to upper Hess. form; F315S F CQZVEC: Eigenvectors of cmplx upper triang. syst.; F316S F CGG: Driver for complex general Eigen-problem; F402S F MATINV: Matrix inversion and sol. of linear eqns.; F403S F: Driver for F402S; F452S F CHOLLU,CHOLEQ: Sym. decomp. of pos. def. band matrices; F453S F MATINC: Inversion of complex matrices; F454S F CROUT: Solution of simultaneous linear equations; F455S F CROUTC: Sol. of simultaneous complex linear eqns.; F456S F1 DIAG: Integer preserving Gaussian elimination
Large deviations of the maximum eigenvalue in Wishart random matrices
International Nuclear Information System (INIS)
Vivo, Pierpaolo; Majumdar, Satya N; Bohigas, Oriol
2007-01-01
We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X T X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value (λ) = N/c decreases for large N as ∼exp[-β/2 N 2 Φ - (2√c + 1: c)], where β = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M ≤ 1 and Φ - (x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions
Large deviations of the maximum eigenvalue in Wishart random matrices
Energy Technology Data Exchange (ETDEWEB)
Vivo, Pierpaolo [School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH (United Kingdom) ; Majumdar, Satya N [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France); Bohigas, Oriol [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France)
2007-04-20
We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X{sup T}X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value ({lambda}) = N/c decreases for large N as {approx}exp[-{beta}/2 N{sup 2}{phi}{sub -} (2{radical}c + 1: c)], where {beta} = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M {<=} 1 and {phi}{sub -}(x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions.
Photonic band structure calculations using nonlinear eigenvalue techniques
International Nuclear Information System (INIS)
Spence, Alastair; Poulton, Chris
2005-01-01
This paper considers the numerical computation of the photonic band structure of periodic materials such as photonic crystals. This calculation involves the solution of a Hermitian nonlinear eigenvalue problem. Numerical methods for nonlinear eigenvalue problems are usually based on Newton's method or are extensions of techniques for the standard eigenvalue problem. We present a new variation on existing methods which has its derivation in methods for bifurcation problems, where bordered matrices are used to compute critical points in singular systems. This new approach has several advantages over the current methods. First, in our numerical calculations the new variation is more robust than existing techniques, having a larger domain of convergence. Second, the linear systems remain Hermitian and are nonsingular as the method converges. Third, the approach provides an elegant and efficient way of both thinking about the problem and organising the computer solution so that only one linear system needs to be factorised at each stage in the solution process. Finally, first- and higher-order derivatives are calculated as a natural extension of the basic method, and this has advantages in the electromagnetic problem discussed here, where the band structure is plotted as a set of paths in the (ω,k) plane
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.
Accounting for Sampling Error in Genetic Eigenvalues Using Random Matrix Theory.
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.
Cluster structure in the correlation coefficient matrix can be characterized by abnormal eigenvalues
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.
Imaginary eigenvalue solution in RPA and phase transition
International Nuclear Information System (INIS)
Yao Yujie; Jing Xiaogong; Zhao Guoquan; Wu Shishu
1993-01-01
The phase transition (PT) of a many-particle system with a close-shell configuration, the stability of the Hartree-Fock (HF) solution and the random phase approximation (RPA) are studied by means of a generalized three-level solvable model. The question whether the occurrence of an imaginary eigenvalue solution in RPA (OISA) may be considered as a signature of PT is explored in some detail. It is found that there is no close relation between OISA and PT. Generally, OISA shows that RPA becomes poor
Perturbative stability of the approximate Killing field eigenvalue problem
International Nuclear Information System (INIS)
Beetle, Christopher; Wilder, Shawn
2014-01-01
An approximate Killing field may be defined on a compact, Riemannian geometry by solving an eigenvalue problem for a certain elliptic operator. This paper studies the effect of small perturbations in the Riemannian metric on the resulting vector field. It shows that small metric perturbations, as measured using a Sobolev-type supremum norm on the space of Riemannian geometries on a fixed manifold, yield small perturbations in the approximate Killing field, as measured using a Hilbert-type square integral norm. It also discusses applications to the problem of computing the spin of a generic black hole in general relativity. (paper)
Wielandt acceleration for MCNP5 Monte Carlo eigenvalue calculations
International Nuclear Information System (INIS)
Brown, F.
2007-01-01
Monte Carlo criticality calculations use the power iteration method to determine the eigenvalue (k eff ) and eigenfunction (fission source distribution) of the fundamental mode. A recently proposed method for accelerating convergence of the Monte Carlo power iteration using Wielandt's method has been implemented in a test version of MCNP5. The method is shown to provide dramatic improvements in convergence rates and to greatly reduce the possibility of false convergence assessment. The method is effective and efficient, improving the Monte Carlo figure-of-merit for many problems. In addition, the method should eliminate most of the underprediction bias in confidence intervals for Monte Carlo criticality calculations. (authors)
Nonlinear Eigenvalue Problems in Elliptic Variational Inequalities: a local study
International Nuclear Information System (INIS)
Conrad, F.; Brauner, C.; Issard-Roch, F.; Nicolaenko, B.
1985-01-01
The authors consider a class of Nonlinear Eigenvalue Problems (N.L.E.P.) associated with Elliptic Variational Inequalities (E.V.I.). First the authors introduce the main tools for a local study of branches of solutions; the authors extend the linearization process required in the case of equations. Next the authors prove the existence of arcs of solutions close to regular vs singular points, and determine their local behavior up to the first order. Finally, the authors discuss the connection between their regularity condition and some stability concept. 37 references, 6 figures
A parallel algorithm for the non-symmetric eigenvalue problem
International Nuclear Information System (INIS)
Sidani, M.M.
1991-01-01
An algorithm is presented for the solution of the non-symmetric eigenvalue problem. The algorithm is based on a divide-and-conquer procedure that provides initial approximations to the eigenpairs, which are then refined using Newton iterations. Since the smaller subproblems can be solved independently, and since Newton iterations with different initial guesses can be started simultaneously, the algorithm - unlike the standard QR method - is ideal for parallel computers. The author also reports on his investigation of deflation methods designed to obtain further eigenpairs if needed. Numerical results from implementations on a host of parallel machines (distributed and shared-memory) are presented
p-Norm SDD tensors and eigenvalue localization
Directory of Open Access Journals (Sweden)
Qilong Liu
2016-07-01
Full Text Available Abstract We present a new class of nonsingular tensors (p-norm strictly diagonally dominant tensors, which is a subclass of strong H $\\mathcal{H}$ -tensors. As applications of the results, we give a new eigenvalue inclusion set, which is tighter than those provided by Li et al. (Linear Multilinear Algebra 64:727-736, 2016 in some case. Based on this set, we give a checkable sufficient condition for the positive (semidefiniteness of an even-order symmetric tensor.
Eigenvalue problems for degenerate nonlinear elliptic equations in anisotropic media
Directory of Open Access Journals (Sweden)
Vicenţiu RăDulescu
2005-06-01
Full Text Available We study nonlinear eigenvalue problems of the type Ã¢ÂˆÂ’div(a(xÃ¢ÂˆÂ‡u=g(ÃŽÂ»,x,u in Ã¢Â„ÂN, where a(x is a degenerate nonnegative weight. We establish the existence of solutions and we obtain information on qualitative properties as multiplicity and location of solutions. Our approach is based on the critical point theory in Sobolev weighted spaces combined with a Caffarelli-Kohn-Nirenberg-type inequality. A specific minimax method is developed without making use of Palais-Smale condition.
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
Directory of Open Access Journals (Sweden)
Fatemeh Mohammad
2014-05-01
Full Text Available In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem $Ax = \\lambda Bx$[Q.~Ye and P.~Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011 1697-1715]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
Eigenvalues calculation algorithms for {lambda}-modes determination. Parallelization approach
Energy Technology Data Exchange (ETDEWEB)
Vidal, V. [Universidad Politecnica de Valencia (Spain). Departamento de Sistemas Informaticos y Computacion; Verdu, G.; Munoz-Cobo, J.L. [Universidad Politecnica de Valencia (Spain). Departamento de Ingenieria Quimica y Nuclear; Ginestart, D. [Universidad Politecnica de Valencia (Spain). Departamento de Matematica Aplicada
1997-03-01
In this paper, we review two methods to obtain the {lambda}-modes of a nuclear reactor, Subspace Iteration method and Arnoldi`s method, which are popular methods to solve the partial eigenvalue problem for a given matrix. In the developed application for the neutron diffusion equation we include improved acceleration techniques for both methods. Also, we propose two parallelization approaches for these methods, a coarse grain parallelization and a fine grain one. We have tested the developed algorithms with two realistic problems, focusing on the efficiency of the methods according to the CPU times. (author).
Dimensionality of social networks using motifs and eigenvalues.
Directory of Open Access Journals (Sweden)
Anthony Bonato
Full Text Available We consider the dimensionality of social networks, and develop experiments aimed at predicting that dimension. We find that a social network model with nodes and links sampled from an m-dimensional metric space with power-law distributed influence regions best fits samples from real-world networks when m scales logarithmically with the number of nodes of the network. This supports a logarithmic dimension hypothesis, and we provide evidence with two different social networks, Facebook and LinkedIn. Further, we employ two different methods for confirming the hypothesis: the first uses the distribution of motif counts, and the second exploits the eigenvalue distribution.
Dynamic Eigenvalue Problem of Concrete Slab Road Surface
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.
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.
Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold.
Palacios, Jonathan; Yeh, Harry; Wang, Wenping; Zhang, Yue; Laramee, Robert S; Sharma, Ritesh; Schultz, Thomas; Zhang, Eugene
2016-03-01
Three-dimensional symmetric tensor fields have a wide range of applications in solid and fluid mechanics. Recent advances in the (topological) analysis of 3D symmetric tensor fields focus on degenerate tensors which form curves. In this paper, we introduce a number of feature surfaces, such as neutral surfaces and traceless surfaces, into tensor field analysis, based on the notion of eigenvalue manifold. Neutral surfaces are the boundary between linear tensors and planar tensors, and the traceless surfaces are the boundary between tensors of positive traces and those of negative traces. Degenerate curves, neutral surfaces, and traceless surfaces together form a partition of the eigenvalue manifold, which provides a more complete tensor field analysis than degenerate curves alone. We also extract and visualize the isosurfaces of tensor modes, tensor isotropy, and tensor magnitude, which we have found useful for domain applications in fluid and solid mechanics. Extracting neutral and traceless surfaces using the Marching Tetrahedra method can cause the loss of geometric and topological details, which can lead to false physical interpretation. To robustly extract neutral surfaces and traceless surfaces, we develop a polynomial description of them which enables us to borrow techniques from algebraic surface extraction, a topic well-researched by the computer-aided design (CAD) community as well as the algebraic geometry community. In addition, we adapt the surface extraction technique, called A-patches, to improve the speed of finding degenerate curves. Finally, we apply our analysis to data from solid and fluid mechanics as well as scalar field analysis.
Intergenerational Correlation in Monte Carlo k-Eigenvalue Calculation
International Nuclear Information System (INIS)
Ueki, Taro
2002-01-01
This paper investigates intergenerational correlation in the Monte Carlo k-eigenvalue calculation of a neutron effective multiplicative factor. To this end, the exponential transform for path stretching has been applied to large fissionable media with localized highly multiplying regions because in such media an exponentially decaying shape is a rough representation of the importance of source particles. The numerical results show that the difference between real and apparent variances virtually vanishes for an appropriate value of the exponential transform parameter. This indicates that the intergenerational correlation of k-eigenvalue samples could be eliminated by the adjoint biasing of particle transport. The relation between the biasing of particle transport and the intergenerational correlation is therefore investigated in the framework of collision estimators, and the following conclusion has been obtained: Within the leading order approximation with respect to the number of histories per generation, the intergenerational correlation vanishes when immediate importance is constant, and the immediate importance under simulation can be made constant by the biasing of particle transport with a function adjoint to the source neutron's distribution, i.e., the importance over all future generations
Reflectance variability of surface coatings reveals characteristic eigenvalue spectra
Medina, José M.; Díaz, José A.; Barros, Rui
2012-10-01
We have examined the trial-to-trial variability of the reflectance spectra of surface coatings containing effect pigments. Principal component analysis of reflectances was done at each detection angle separately. A method for classification of principal components is applied based on the eigenvalue spectra. It was found that the eigenvalue spectra follow characteristic power laws and depend on the detection angle. Three different subsets of principal components were examined to separate the relevant spectral features related to the pigments from other noise sources. Reconstruction of the reflectance spectra by taking only the first subset indicated that reflectance variability was higher at near-specular reflection, suggesting a correlation with the trial-to-trial deposition of effect pigments. Reconstruction by using the second subset indicates that variability was higher at short wavelengths. Finally, reconstruction by using only the third subset indicates that reflectance variability was not totally random as a function of the wavelength. The methods employed can be useful in the evaluation of color variability in industrial paint application processes.
Eigenvalue-dependent neutron energy spectra: Definitions, analyses, and applications
International Nuclear Information System (INIS)
Cacuci, D.G.; Ronen, Y.; Shayer, Z.; Wagschal, J.J.; Yeivin, Y.
1982-01-01
A general qualitative analysis of spectral effects that arise from solving the kappa-, α-, γ-, and sigma-eigenvalue formulations of the neutron transport equation for nuclear systems that deviate (to first order) from criticality is presented. Hierarchies of neutron spectra softness are established and expressed concisely in terms of the newly introduced spatialdependent local spectral indices for the core and for the reflector. It is shown that each hierarchy is preserved, regardless of the nature of the specific physical mechanism that cause the system to deviate from criticality. Qualitative conclusions regarding the general behavior of the spectrum-dependent integral spectral indices and ICRs corresponding to the kappa-, α-, γ-, and sigma-eigenvalue formalisms are also presented. By defining spectral indices separately for the core and for the reflector, it is possible to account for the characteristics of neutron spectra in both the core and the reflector. The distinctions between the spectra in the core and in the reflector could not have been accounted for by using a single type of spectral index (e.g., a spectral index for the entire system or a spectral index solely for the core)
A scheme for the evaluation of dominant time-eigenvalues of a nuclear reactor
International Nuclear Information System (INIS)
Modak, R.S.; Gupta, Anurag
2007-01-01
This paper presents a scheme to obtain the fundamental and few dominant solutions of the prompt time eigenvalue problem (referred to as α-eigenvalue problem) for a nuclear reactor using multi-group neutron diffusion theory. The scheme is based on the use of an algorithm called Orthomin(1). This algorithm was originally proposed by Suetomi and Sekimoto [Suetomi, E., Sekimoto, H., 1991. Conjugate gradient like methods and their application to eigenvalue problems for neutron diffusion equations. Ann. Nucl. Energy 18 (4), 205-227] to obtain the fundamental K-eigenvalue (K-effective) of nuclear reactors. Recently, it has been shown that the algorithm can be used to obtain the further dominant K-modes also. Since α-eigenvalue problem is usually more difficult to solve than the K-eigenvalue problem, an attempt has been made here to use Orthomin(1) for its solution. Numerical results are given for realistic 3-D test case
Directory of Open Access Journals (Sweden)
Khalil Ben Haddouch
2016-04-01
Full Text Available In this work we will study the eigenvalues for a fourth order elliptic equation with $p(x$-growth conditions $\\Delta^2_{p(x} u=\\lambda |u|^{p(x-2} u$, under Neumann boundary conditions, where $p(x$ is a continuous function defined on the bounded domain with $p(x>1$. Through the Ljusternik-Schnireleman theory on $C^1$-manifold, we prove the existence of infinitely many eigenvalue sequences and $\\sup \\Lambda =+\\infty$, where $\\Lambda$ is the set of all eigenvalues.
A Geršgorin-type eigenvalue localization set with n parameters for stochastic matrices
Directory of Open Access Journals (Sweden)
Wang Xiaoxiao
2018-04-01
Full Text Available A set in the complex plane which involves n parameters in [0, 1] is given to localize all eigenvalues different from 1 for stochastic matrices. As an application of this set, an upper bound for the moduli of the subdominant eigenvalues of a stochastic matrix is obtained. Lastly, we fix n parameters in [0, 1] to give a new set including all eigenvalues different from 1, which is tighter than those provided by Shen et al. (Linear Algebra Appl. 447 (2014 74-87 and Li et al. (Linear and Multilinear Algebra 63(11 (2015 2159-2170 for estimating the moduli of subdominant eigenvalues.
Periodic Solutions, Eigenvalue Curves, and Degeneracy of the Fractional Mathieu Equation
International Nuclear Information System (INIS)
Parra-Hinojosa, A; Gutiérrez-Vega, J C
2016-01-01
We investigate the eigenvalue curves, the behavior of the periodic solutions, and the orthogonality properties of the Mathieu equation with an additional fractional derivative term using the method of harmonic balance. The addition of the fractional derivative term breaks the hermiticity of the equation in such a way that its eigenvalues need not be real nor its eigenfunctions orthogonal. We show that for a certain choice of parameters the eigenvalue curves reveal the appearance of degenerate eigenvalues. We offer a detailed discussion of the matrix representation of the differential operator corresponding to the fractional Mathieu equation, as well as some numerical examples of its periodic solutions. (paper)
An algorithm of α-and γ-mode eigenvalue calculations by Monte Carlo method
International Nuclear Information System (INIS)
Yamamoto, Toshihiro; Miyoshi, Yoshinori
2003-01-01
A new algorithm for Monte Carlo calculation was developed to obtain α- and γ-mode eigenvalues. The α is a prompt neutron time decay constant measured in subcritical experiments, and the γ is a spatial decay constant measured in an exponential method for determining the subcriticality. This algorithm can be implemented into existing Monte Carlo eigenvalue calculation codes with minimum modifications. The algorithm was implemented into MCNP code and the performance of calculating the both mode eigenvalues were verified through comparison of the calculated eigenvalues with the ones obtained by fixed source calculations. (author)
Super-quantum curves from super-eigenvalue models
Energy Technology Data Exchange (ETDEWEB)
Ciosmak, Paweł [Faculty of Mathematics, Informatics and Mechanics, University of Warsaw,ul. Banacha 2, 02-097 Warsaw (Poland); Hadasz, Leszek [M. Smoluchowski Institute of Physics, Jagiellonian University,ul. Łojasiewicza 11, 30-348 Kraków (Poland); Manabe, Masahide [Faculty of Physics, University of Warsaw,ul. Pasteura 5, 02-093 Warsaw (Poland); Sułkowski, Piotr [Faculty of Physics, University of Warsaw,ul. Pasteura 5, 02-093 Warsaw (Poland); Walter Burke Institute for Theoretical Physics, California Institute of Technology,1200 E. California Blvd, Pasadena, CA 91125 (United States)
2016-10-10
In modern mathematical and theoretical physics various generalizations, in particular supersymmetric or quantum, of Riemann surfaces and complex algebraic curves play a prominent role. We show that such supersymmetric and quantum generalizations can be combined together, and construct supersymmetric quantum curves, or super-quantum curves for short. Our analysis is conducted in the formalism of super-eigenvalue models: we introduce β-deformed version of those models, and derive differential equations for associated α/β-deformed super-matrix integrals. We show that for a given model there exists an infinite number of such differential equations, which we identify as super-quantum curves, and which are in one-to-one correspondence with, and have the structure of, super-Virasoro singular vectors. We discuss potential applications of super-quantum curves and prospects of other generalizations.
Instability of the cored barotropic disc: the linear eigenvalue formulation
Polyachenko, E. V.
2018-05-01
Gaseous rotating razor-thin discs are a testing ground for theories of spiral structure that try to explain appearance and diversity of disc galaxy patterns. These patterns are believed to arise spontaneously under the action of gravitational instability, but calculations of its characteristics in the gas are mostly obscured. The paper suggests a new method for finding the spiral patterns based on an expansion of small amplitude perturbations over Lagrange polynomials in small radial elements. The final matrix equation is extracted from the original hydrodynamical equations without the use of an approximate theory and has a form of the linear algebraic eigenvalue problem. The method is applied to a galactic model with the cored exponential density profile.
Super-quantum curves from super-eigenvalue models
International Nuclear Information System (INIS)
Ciosmak, Paweł; Hadasz, Leszek; Manabe, Masahide; Sułkowski, Piotr
2016-01-01
In modern mathematical and theoretical physics various generalizations, in particular supersymmetric or quantum, of Riemann surfaces and complex algebraic curves play a prominent role. We show that such supersymmetric and quantum generalizations can be combined together, and construct supersymmetric quantum curves, or super-quantum curves for short. Our analysis is conducted in the formalism of super-eigenvalue models: we introduce β-deformed version of those models, and derive differential equations for associated α/β-deformed super-matrix integrals. We show that for a given model there exists an infinite number of such differential equations, which we identify as super-quantum curves, and which are in one-to-one correspondence with, and have the structure of, super-Virasoro singular vectors. We discuss potential applications of super-quantum curves and prospects of other generalizations.
Super-quantum curves from super-eigenvalue models
Ciosmak, Paweł; Hadasz, Leszek; Manabe, Masahide; Sułkowski, Piotr
2016-10-01
In modern mathematical and theoretical physics various generalizations, in particular supersymmetric or quantum, of Riemann surfaces and complex algebraic curves play a prominent role. We show that such supersymmetric and quantum generalizations can be combined together, and construct supersymmetric quantum curves, or super-quantum curves for short. Our analysis is conducted in the formalism of super-eigenvalue models: we introduce β-deformed version of those models, and derive differential equations for associated α/ β-deformed super-matrix integrals. We show that for a given model there exists an infinite number of such differential equations, which we identify as super-quantum curves, and which are in one-to-one correspondence with, and have the structure of, super-Virasoro singular vectors. We discuss potential applications of super-quantum curves and prospects of other generalizations.
Convergence diagnostics for Eigenvalue problems with linear regression model
International Nuclear Information System (INIS)
Shi, Bo; Petrovic, Bojan
2011-01-01
Although the Monte Carlo method has been extensively used for criticality/Eigenvalue problems, a reliable, robust, and efficient convergence diagnostics method is still desired. Most methods are based on integral parameters (multiplication factor, entropy) and either condense the local distribution information into a single value (e.g., entropy) or even disregard it. We propose to employ the detailed cycle-by-cycle local flux evolution obtained by using mesh tally mechanism to assess the source and flux convergence. By applying a linear regression model to each individual mesh in a mesh tally for convergence diagnostics, a global convergence criterion can be obtained. We exemplify this method on two problems and obtain promising diagnostics results. (author)
Multivariate analysis of eigenvalues and eigenvectors in tensor based morphometry
Rajagopalan, Vidya; Schwartzman, Armin; Hua, Xue; Leow, Alex; Thompson, Paul; Lepore, Natasha
2015-01-01
We develop a new algorithm to compute voxel-wise shape differences in tensor-based morphometry (TBM). As in standard TBM, we non-linearly register brain T1-weighed MRI data from a patient and control group to a template, and compute the Jacobian of the deformation fields. In standard TBM, the determinants of the Jacobian matrix at each voxel are statistically compared between the two groups. More recently, a multivariate extension of the statistical analysis involving the deformation tensors derived from the Jacobian matrices has been shown to improve statistical detection power.7 However, multivariate methods comprising large numbers of variables are computationally intensive and may be subject to noise. In addition, the anatomical interpretation of results is sometimes difficult. Here instead, we analyze the eigenvalues and the eigenvectors of the Jacobian matrices. Our method is validated on brain MRI data from Alzheimer's patients and healthy elderly controls from the Alzheimer's Disease Neuro Imaging Database.
Coarse-mesh rebalancing acceleration for eigenvalue problems
International Nuclear Information System (INIS)
Asaoka, T.; Nakahara, Y.; Miyasaka, S.
1974-01-01
The coarse-mesh rebalance method is adopted for Monte Carlo schemes for aiming at accelerating the convergence of a source iteration process. At every completion of the Monte Carlo game for one batch of neutron histories, the scaling factor for the neutron flux is calculated to achieve the neutron balance in each coarse-mesh zone into which the total system is divided. This rebalance factor is multiplied to the weight of each fission source neutron in the coarse-mesh zone for playing the next Monte Carlo game. The numerical examples have shown that the coarse-mesh rebalance Monte Carlo calculation gives a good estimate of the eigenvalue already after several batches with a negligible extra computer time compared to the standard Monte Carlo. 5 references. (U.S.)
Perturbation of embedded eigenvalue by a near-lying resonance
Energy Technology Data Exchange (ETDEWEB)
Belyaev, V B; Motovilov, A K
1997-12-31
The case of quantum-mechanical system (including electronic molecules) is considered where Hamiltonian allows a separation, in particular by the Faddeev method, of a weakly coupled channel. Width (i.e. the imaginary part) of the resonance generated by a discrete spectrum eigenvalue of the separated channel is studied in the case where main part of the Hamiltonian gives itself another resonance. It is shown that if real parts of these resonances coincide and, at the same time, a coupling between the separated and main channels is sufficiently small then the width of the resonance generated by the separated (molecular) channel is inversely proportional to the width of the main (nuclear) channel resonance. This phenomenon being a kind of universal law, may play an important role increasing the `cold fusion` probability in electronic molecules whose nuclear constituents have narrow pre-threshold resonances. 21 refs.
A numerical method for eigenvalue problems in modeling liquid crystals
Energy Technology Data Exchange (ETDEWEB)
Baglama, J.; Farrell, P.A.; Reichel, L.; Ruttan, A. [Kent State Univ., OH (United States); Calvetti, D. [Stevens Inst. of Technology, Hoboken, NJ (United States)
1996-12-31
Equilibrium configurations of liquid crystals in finite containments are minimizers of the thermodynamic free energy of the system. It is important to be able to track the equilibrium configurations as the temperature of the liquid crystals decreases. The path of the minimal energy configuration at bifurcation points can be computed from the null space of a large sparse symmetric matrix. We describe a new variant of the implicitly restarted Lanczos method that is well suited for the computation of extreme eigenvalues of a large sparse symmetric matrix, and we use this method to determine the desired null space. Our implicitly restarted Lanczos method determines adoptively a polynomial filter by using Leja shifts, and does not require factorization of the matrix. The storage requirement of the method is small, and this makes it attractive to use for the present application.
Absence of positive eigenvalues for hard-core N-body systems
DEFF Research Database (Denmark)
Ito, K.; Skibsted, Erik
We show absence of positive eigenvalues for generalized 2-body hard-core Schrödinger operators under the condition of bounded strictly convex obstacles. A scheme for showing absence of positive eigenvalues for generalized N-body hard-core Schrödinger operators, N≥ 2, is presented. This scheme inv...
Estimates of the first Dirichlet eigenvalue from exit time moment spectra
DEFF Research Database (Denmark)
Hurtado, Ana; Markvorsen, Steen; Palmer, Vicente
2013-01-01
We compute the first Dirichlet eigenvalue of a geodesic ball in a rotationally symmetric model space in terms of the moment spectrum for the Brownian motion exit times from the ball. This expression implies an estimate as exact as you want for the first Dirichlet eigenvalue of a geodesic ball...
Ground eigenvalue and eigenfunction of a spin-weighted spheroidal wave equation in low frequencies
Institute of Scientific and Technical Information of China (English)
Tang Wen-Lin; Tian Gui-Hua
2011-01-01
Spin-weighted spheroidal wave functions play an important role in the study of the linear stability of rotating Kerr black holes and are studied by the perturbation method in supersymmetric quantum mechanics. Their analytic ground eigenvalues and eigenfunctions are obtained by means of a series in low frequency. The ground eigenvalue and eigenfunction for small complex frequencies are numerically determined.
Accurate high-lying eigenvalues of Schroedinger and Sturm-Liouville problems
International Nuclear Information System (INIS)
Vanden Berghe, G.; Van Daele, M.; De Meyer, H.
1994-01-01
A modified difference and a Numerov-like scheme have been introduced in a shooting algorithm for the determination of the (higher-lying) eigenvalues of Schroedinger equations and Sturm-Liouville problems. Some numerical experiments are introduced. Time measurements have been performed. The proposed algorithms are compared with other previously introduced shooting schemes. The structure of the eigenvalue error is discussed. ((orig.))
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.
International Nuclear Information System (INIS)
Lomnitz-Adler, J.; Brink, D.M.
1976-01-01
A generating function for the eigenvalues of the RGM Normalization Kernel is expressed in terms of the diagonal matrix elements of thw GCM Overlap Kernel. An asymptotic expression for the eigenvalues is obtained by using the Method of Steepest Descent. (Auth.)
Efficient solutions to the NDA-NCA low-order eigenvalue problem
International Nuclear Information System (INIS)
Willert, J. A.; Kelley, C. T.
2013-01-01
Recent algorithmic advances combine moment-based acceleration and Jacobian-Free Newton-Krylov (JFNK) methods to accelerate the computation of the dominant eigenvalue in a k-eigenvalue calculation. In particular, NDA-NCA [1], builds a sequence of low-order (LO) diffusion-based eigenvalue problems in which the solution converges to the true eigenvalue solution. Within NDA-NCA, the solution to the LO k-eigenvalue problem is computed by solving a system of nonlinear equation using some variant of Newton's method. We show that we can speed up the solution to the LO problem dramatically by abandoning the JFNK method and exploiting the structure of the Jacobian matrix. (authors)
Zhang, Shao-Liang; Imamura, Toshiyuki; Yamamoto, Yusaku; Kuramashi, Yoshinobu; Hoshi, Takeo
2017-01-01
This book provides state-of-the-art and interdisciplinary topics on solving matrix eigenvalue problems, particularly by using recent petascale and upcoming post-petascale supercomputers. It gathers selected topics presented at the International Workshops on Eigenvalue Problems: Algorithms; Software and Applications, in Petascale Computing (EPASA2014 and EPASA2015), which brought together leading researchers working on the numerical solution of matrix eigenvalue problems to discuss and exchange ideas – and in so doing helped to create a community for researchers in eigenvalue problems. The topics presented in the book, including novel numerical algorithms, high-performance implementation techniques, software developments and sample applications, will contribute to various fields that involve solving large-scale eigenvalue problems.
Eigenvalue sensitivity of sampled time systems operating in closed loop
Bernal, Dionisio
2018-05-01
The use of feedback to create closed-loop eigenstructures with high sensitivity has received some attention in the Structural Health Monitoring field. Although practical implementation is necessarily digital, and thus in sampled time, work thus far has center on the continuous time framework, both in design and in checking performance. It is shown in this paper that the performance in discrete time, at typical sampling rates, can differ notably from that anticipated in the continuous time formulation and that discrepancies can be particularly large on the real part of the eigenvalue sensitivities; a consequence being important error on the (linear estimate) of the level of damage at which closed-loop stability is lost. As one anticipates, explicit consideration of the sampling rate poses no special difficulties in the closed-loop eigenstructure design and the relevant expressions are developed in the paper, including a formula for the efficient evaluation of the derivative of the matrix exponential based on the theory of complex perturbations. The paper presents an easily reproduced numerical example showing the level of error that can result when the discrete time implementation of the controller is not considered.
Depletion GPT-free sensitivity analysis for reactor eigenvalue problems
International Nuclear Information System (INIS)
Kennedy, C.; Abdel-Khalik, H.
2013-01-01
This manuscript introduces a novel approach to solving depletion perturbation theory problems without the need to set up or solve the generalized perturbation theory (GPT) equations. The approach, hereinafter denoted generalized perturbation theory free (GPT-Free), constructs a reduced order model (ROM) using methods based in perturbation theory and computes response sensitivity profiles in a manner that is independent of the number or type of responses, allowing for an efficient computation of sensitivities when many responses are required. Moreover, the reduction error from using the ROM is quantified in the GPT-Free approach by means of a Wilks' order statistics error metric denoted the K-metric. Traditional GPT has been recognized as the most computationally efficient approach for performing sensitivity analyses of models with many input parameters, e.g. when forward sensitivity analyses are computationally intractable. However, most neutronics codes that can solve the fundamental (homogenous) adjoint eigenvalue problem do not have GPT capabilities unless envisioned during code development. The GPT-Free approach addresses this limitation by requiring only the ability to compute the fundamental adjoint. This manuscript demonstrates the GPT-Free approach for depletion reactor calculations performed in SCALE6 using the 7x7 UAM assembly model. A ROM is developed for the assembly over a time horizon of 990 days. The approach both calculates the reduction error over the lifetime of the simulation using the K-metric and benchmarks the obtained sensitivities using sample calculations. (authors)
Overview of the ArbiTER edge plasma eigenvalue code
Baver, Derek; Myra, James; Umansky, Maxim
2011-10-01
The Arbitrary Topology Equation Reader, or ArbiTER, is a flexible eigenvalue solver that is currently under development for plasma physics applications. The ArbiTER code builds on the equation parser framework of the existing 2DX code, extending it to include a topology parser. This will give the code the capability to model problems with complicated geometries (such as multiple X-points and scrape-off layers) or model equations with arbitrary numbers of dimensions (e.g. for kinetic analysis). In the equation parser framework, model equations are not included in the program's source code. Instead, an input file contains instructions for building a matrix from profile functions and elementary differential operators. The program then executes these instructions in a sequential manner. These instructions may also be translated into analytic form, thus giving the code transparency as well as flexibility. We will present an overview of how the ArbiTER code is to work, as well as preliminary results from early versions of this code. Work supported by the U.S. DOE.
Effective Perron-Frobenius eigenvalue for a correlated random map
Pool, Roman R.; Cáceres, Manuel O.
2010-09-01
We investigate the evolution of random positive linear maps with various type of disorder by analytic perturbation and direct simulation. Our theoretical result indicates that the statistics of a random linear map can be successfully described for long time by the mean-value vector state. The growth rate can be characterized by an effective Perron-Frobenius eigenvalue that strongly depends on the type of correlation between the elements of the projection matrix. We apply this approach to an age-structured population dynamics model. We show that the asymptotic mean-value vector state characterizes the population growth rate when the age-structured model has random vital parameters. In this case our approach reveals the nontrivial dependence of the effective growth rate with cross correlations. The problem was reduced to the calculation of the smallest positive root of a secular polynomial, which can be obtained by perturbations in terms of Green’s function diagrammatic technique built with noncommutative cumulants for arbitrary n -point correlations.
EvArnoldi: A New Algorithm for Large-Scale Eigenvalue Problems.
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.
Multi-level nonlinear diffusion acceleration method for multigroup transport k-Eigenvalue problems
International Nuclear Information System (INIS)
Anistratov, Dmitriy Y.
2011-01-01
The nonlinear diffusion acceleration (NDA) method is an efficient and flexible transport iterative scheme for solving reactor-physics problems. This paper presents a fast iterative algorithm for solving multigroup neutron transport eigenvalue problems in 1D slab geometry. The proposed method is defined by a multi-level system of equations that includes multigroup and effective one-group low-order NDA equations. The Eigenvalue is evaluated in the exact projected solution space of smallest dimensionality, namely, by solving the effective one- group eigenvalue transport problem. Numerical results that illustrate performance of the new algorithm are demonstrated. (author)
On a Non-Symmetric Eigenvalue Problem Governing Interior Structural–Acoustic Vibrations
Directory of Open Access Journals (Sweden)
Heinrich Voss
2016-06-01
Full Text Available Small amplitude vibrations of a structure completely filled with a fluid are considered. Describing the structure by displacements and the fluid by its pressure field, the free vibrations are governed by a non-self-adjoint eigenvalue problem. This survey reports on a framework for taking advantage of the structure of the non-symmetric eigenvalue problem allowing for a variational characterization of its eigenvalues. Structure-preserving iterative projection methods of the the Arnoldi and of the Jacobi–Davidson type and an automated multi-level sub-structuring method are reviewed. The reliability and efficiency of the methods are demonstrated by a numerical example.
Complex energy eigenvalues of a linear potential with a parabolical barrier
International Nuclear Information System (INIS)
Malherbe, J.B.
1978-01-01
The physical meaning and restrictions of complex energy eigenvalues are briefly discussed. It is indicated that a quasi-stationary phase describes an idealised disintegration system. Approximate resonance-eigenvalues of the one dimensional Schrodinger equation with a linear potential and parabolic barrier are calculated by means of Connor's semiclassical method. This method is based on the generalized WKB-method of Miller and Good. The results obtained confirm the correctness of a model representation which explains the unusual distribution of eigenvalues by certain other linear potentials in a complex energy level [af
Characteristic dynamics near two coalescing eigenvalues incorporating continuum threshold effects
Garmon, Savannah; Ordonez, Gonzalo
2017-06-01
It has been reported in the literature that the survival probability P(t) near an exceptional point where two eigenstates coalesce should generally exhibit an evolution P (t ) ˜t2e-Γ t, in which Γ is the decay rate of the coalesced eigenstate; this has been verified in a microwave billiard experiment [B. Dietz et al., Phys. Rev. E 75, 027201 (2007)]. However, the heuristic effective Hamiltonian that is usually employed to obtain this result ignores the possible influence of the continuum threshold on the dynamics. By contrast, in this work we employ an analytical approach starting from the microscopic Hamiltonian representing two simple models in order to show that the continuum threshold has a strong influence on the dynamics near exceptional points in a variety of circumstances. To report our results, we divide the exceptional points in Hermitian open quantum systems into two cases: at an EP2A two virtual bound states coalesce before forming a resonance, anti-resonance pair with complex conjugate eigenvalues, while at an EP2B two resonances coalesce before forming two different resonances. For the EP2B, which is the case studied in the microwave billiard experiment, we verify that the survival probability exhibits the previously reported modified exponential decay on intermediate time scales, but this is replaced with an inverse power law on very long time scales. Meanwhile, for the EP2A the influence from the continuum threshold is so strong that the evolution is non-exponential on all time scales and the heuristic approach fails completely. When the EP2A appears very near the threshold, we obtain the novel evolution P (t ) ˜1 -C1√{t } on intermediate time scales, while further away the parabolic decay (Zeno dynamics) on short time scales is enhanced.
Ltaief, Hatem; Luszczek, Piotr R.; Haidar, Azzam; Dongarra, Jack
2012-01-01
This paper proposes an efficient implementation of the generalized symmetric eigenvalue problem on multicore architecture. Based on a four-stage approach and tile algorithms, the original problem is first transformed into a standard symmetric
International Nuclear Information System (INIS)
Friedman, R.S.; Jamieson, M.J.; Preston, S.C.
1990-01-01
A method for solving coupled eigenvalue differential equations is given and its relation to an existing technique is shown. Use of the Gram-Schmidt process to overcome the severe instabilities arising in molecular problems is described in detail. (orig.)
Directory of Open Access Journals (Sweden)
Serguei I. Iakovlev
2013-01-01
Full Text Available It is shown that any \\(\\mu \\in \\mathbb{C}\\ is an infinite multiplicity eigenvalue of the Steklov smoothing operator \\(S_h\\ acting on the space \\(L^1_{loc}(\\mathbb{R}\\. For \\(\\mu \
Directory of Open Access Journals (Sweden)
Feng Qi
2014-10-01
Full Text Available The authors find the absolute monotonicity and complete monotonicity of some functions involving trigonometric functions and related to estimates the lower bounds of the first eigenvalue of Laplace operator on Riemannian manifolds.
TWO-DIMENSIONAL APPROXIMATION OF EIGENVALUE PROBLEMS IN SHELL THEORY: FLEXURAL SHELLS
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
The eigenvalue problem for a thin linearly elastic shell, of thickness 2e, clamped along its lateral surface is considered. Under the geometric assumption on the middle surface of the shell that the space of inextensional displacements is non-trivial, the authors obtain, as ε→0,the eigenvalue problem for the two-dimensional"flexural shell"model if the dimension of the space is infinite. If the space is finite dimensional, the limits of the eigenvalues could belong to the spectra of both flexural and membrane shells. The method consists of rescaling the variables and studying the problem over a fixed domain. The principal difficulty lies in obtaining suitable a priori estimates for the scaled eigenvalues.
Liu, Hongyu
2012-01-01
In this note, we present some interesting observations on the Schiffer's conjecture, interior transmission eigenvalue problem and their connections to singular and nonsingular invisibility cloaking problems of acoustic waves.
A second eigenvalue bound for the Dirichlet Schrodinger equation wtih a radially symmetric potential
Directory of Open Access Journals (Sweden)
Craig Haile
2000-01-01
Full Text Available We study the time-independent Schrodinger equation with radially symmetric potential $k|x|^alpha$, $k ge 0$, $k in mathbb{R}, alpha ge 2$ on a bounded domain $Omega$ in $mathbb{R}^n$, $(n ge 2$ with Dirichlet boundary conditions. In particular, we compare the eigenvalue $lambda_2(Omega$ of the operator $-Delta + k |x|^alpha $ on $Omega$ with the eigenvalue $lambda_2(S_1$ of the same operator $-Delta +kr^alpha$ on a ball $S_1$, where $S_1$ has radius such that the first eigenvalues are the same ($lambda_1(Omega = lambda_1(S_1$. The main result is to show $lambda_2(Omega le lambda_2(S_1$. We also give an extension of the main result to the case of a more general elliptic eigenvalue problem on a bounded domain $Omega$ with Dirichlet boundary conditions.
Analytic approximation to the largest eigenvalue distribution of a white Wishart matrix
CSIR Research Space (South Africa)
Vlok, JD
2012-08-14
Full Text Available offers largely simplified computation and provides statistics such as the mean value and region of support of the largest eigenvalue distribution. Numeric results from the literature are compared with the approximation and Monte Carlo simulation results...
Parallelization of mathematical library for generalized eigenvalue problem for real band matrices
International Nuclear Information System (INIS)
Tanaka, Yasuhisa.
1997-05-01
This research has focused on a parallelization of the mathematical library for a generalized eigenvalue problem for real band matrices on IBM SP and Hitachi SR2201. The origin of the library is LASO (Lanczos Algorithm with Selective Orthogonalization), which was developed on the basis of Block Lanczos method for standard eigenvalue problem for real band matrices at Texas University. We adopted D.O.F. (Degree Of Freedom) decomposition method for a parallelization of this library, and evaluated its parallel performance. (author)
On a minimization of the eigenvalues of Schroedinger operator relatively domains
International Nuclear Information System (INIS)
Gasymov, Yu.S.; Niftiev, A.A.
2001-01-01
Minimization of the eigenvalues plays an important role in the operators spectral theory. The problem on the minimization of the eigenvalues of the Schroedinger operator by areas is considered in this work. The algorithm, analogous to the conditional gradient method, is proposed for the numerical solution of this problem in the common case. The result is generalized for the case of the positively determined completely continuous operator [ru
Directory of Open Access Journals (Sweden)
Pengzhan Huang
2011-01-01
Full Text Available Several stabilized finite element methods for the Stokes eigenvalue problem based on the lowest equal-order finite element pair are numerically investigated. They are penalty, regular, multiscale enrichment, and local Gauss integration method. Comparisons between them are carried out, which show that the local Gauss integration method has good stability, efficiency, and accuracy properties, and it is a favorite method among these methods for the Stokes eigenvalue problem.
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.
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
Smallest eigenvalue distribution of the fixed-trace Laguerre beta-ensemble
International Nuclear Information System (INIS)
Chen Yang; Liu Dangzheng; Zhou Dasheng
2010-01-01
In this paper we study the entanglement of the reduced density matrix of a bipartite quantum system in a random pure state. It transpires that this involves the computation of the smallest eigenvalue distribution of the fixed-trace Laguerre ensemble of N x N random matrices. We showed that for finite N the smallest eigenvalue distribution may be expressed in terms of Jack polynomials. Furthermore, based on the exact results, we found a limiting distribution when the smallest eigenvalue is suitably scaled with N followed by a large N limit. Our results turn out to be the same as the smallest eigenvalue distribution of the classical Laguerre ensembles without the fixed-trace constraint. This suggests in a broad sense, the global constraint does not influence local correlations, at least, in the large N limit. Consequently, we have solved an open problem: the determination of the smallest eigenvalue distribution of the reduced density matrix-obtained by tracing out the environmental degrees of freedom-for a bipartite quantum system of unequal dimensions.
Gui, Tao; Lu, Chao; Lau, Alan Pak Tao; Wai, P K A
2017-08-21
In this paper, we experimentally investigate high-order modulation over a single discrete eigenvalue under the nonlinear Fourier transform (NFT) framework and exploit all degrees of freedom for encoding information. For a fixed eigenvalue, we compare different 4 bit/symbol modulation formats on the spectral amplitude and show that a 2-ring 16-APSK constellation achieves optimal performance. We then study joint spectral phase, spectral magnitude and eigenvalue modulation and found that while modulation on the real part of the eigenvalue induces pulse timing drift and leads to neighboring pulse interactions and nonlinear inter-symbol interference (ISI), it is more bandwidth efficient than modulation on the imaginary part of the eigenvalue in practical settings. We propose a spectral amplitude scaling method to mitigate such nonlinear ISI and demonstrate a record 4 GBaud 16-APSK on the spectral amplitude plus 2-bit eigenvalue modulation (total 6 bit/symbol at 24 Gb/s) transmission over 1000 km.
On the number of eigenvalues of the discrete one-dimensional Dirac operator with a complex potential
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.
A Numerical method for solving a class of fractional Sturm-Liouville eigenvalue problems
Directory of Open Access Journals (Sweden)
Muhammed I. Syam
2017-11-01
Full Text Available This article is devoted to both theoretical and numerical studies of eigenvalues of regular fractional $2\\alpha $-order Sturm-Liouville problem where $\\frac{1}{2}< \\alpha \\leq 1$. In this paper, we implement the reproducing kernel method RKM to approximate the eigenvalues. To find the eigenvalues, we force the approximate solution produced by the RKM satisfy the boundary condition at $x=1$. The fractional derivative is described in the Caputo sense. Numerical results demonstrate the accuracy of the present algorithm. In addition, we prove the existence of the eigenfunctions of the proposed problem. Uniformly convergence of the approximate eigenfunctions produced by the RKM to the exact eigenfunctions is proven.
Eigenvalue routines in NASTRAN: A comparison with the Block Lanczos method
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.
The method of fundamental solutions for computing acoustic interior transmission eigenvalues
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.
A numerical study of the eigenvalues in the neutron diffusion theory
International Nuclear Information System (INIS)
Lima Bezerra, J. de.
1982-12-01
A systematic numerical study for the eigenvalue problem in one dimension was carried out. A computer code RED2G was developed to obtain and to discuss a number of numerical solutions concerning eigenvalues problems originating from the discretization of the two groups neutron diffusion equation in one dimension and steady state. The problem of eigenvalues was created from the discretization by the method of finite differences. The solutions were obtained by four different iterative methods, i.e. Power, Wielandt-1, Wielandt-2 and accelerated Power with the Chebyshev polinomials. The numerical results given by the solution of the two test-problems indicate that the RED2G code is fast and efficient in these calculations and the Wielandt-2 method has been found to be the best both in respect of rapidity of calculations as well as programation effort required. (E.G.) [pt
International Nuclear Information System (INIS)
Gene Golub; Kwok Ko
2009-01-01
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.
International Nuclear Information System (INIS)
Beer, M.
1980-01-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 the 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
On the eigenvalues of S.Π for arbitrary spin in a constant magnetic field
International Nuclear Information System (INIS)
Jayaraman, J.; Oliveira, M.A.B. de.
1985-01-01
Utilizing the intimate connection of a charged particle in a nomogeneous magnetic field to that of a harmonic oscillator, it was established in a recent communication that the eigenvalue spectrum of the matrix operator S.Π for spin 1 is purely real for any intensity of the external magnetic field thereby removing a false impression to the contrary in the recent literature. Here these results are extended to arbitrary spin the reality of the eigenvalue spectrum. The case of spin 3/2 is discussed in some details and it is demonstrated that the complex eigenvalues implied the spectrum by a recent analysis of Weaver, for sufficiently intense magnetic field, when the particle number n assumes values 0 and 1 do not in fact appear at all. (Author) [pt
A Decentralized Eigenvalue Computation Method for Spectrum Sensing Based on Average Consensus
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.
International Nuclear Information System (INIS)
Dongarra, J.J.
1982-01-01
SICEDR is a FORTRAN subroutine for improving the accuracy of a computed real eigenvalue and improving or computing the associated eigenvector. It is first used to generate information during the determination of the eigenvalues by the Schur decomposition technique. In particular, the Schur decomposition technique results in an orthogonal matrix Q and an upper quasi-triangular matrix T, such that A = QTQ/sup T/. Matrices A, Q, and T and the approximate eigenvalue, say lambda, are then used in the improvement phase. SICEDR uses an iterative method similar to iterative improvement for linear systems to improve the accuracy of lambda and improve or compute the eigenvector x in O(n 2 ) work, where n is the order of the matrix A
Methods for computing SN eigenvalues and eigenvectors of slab geometry transport problems
International Nuclear Information System (INIS)
Yavuz, Musa
1998-01-01
We discuss computational methods for computing the eigenvalues and eigenvectors of single energy-group neutral particle transport (S N ) problems in homogeneous slab geometry, with an arbitrary scattering anisotropy of order L. These eigensolutions are important when exact (or very accurate) solutions are desired for coarse spatial cell problems demanding rapid execution times. Three methods, one of which is 'new', are presented for determining the eigenvalues and eigenvectors of such S N problems. In the first method, separation of variables is directly applied to the S N equations. In the second method, common characteristics of the S N and P N-1 equations are used. In the new method, the eigenvalues and eigenvectors can be computed provided that the cell-interface Green's functions (transmission and reflection factors) are known. Numerical results for S 4 test problems are given to compare the new method with the existing methods
Methods for computing SN eigenvalues and eigenvectors of slab geometry transport problems
International Nuclear Information System (INIS)
Yavuz, M.
1997-01-01
We discuss computational methods for computing the eigenvalues and eigenvectors of single energy-group neutral particle transport (S N ) problems in homogeneous slab geometry, with an arbitrary scattering anisotropy of order L. These eigensolutions are important when exact (or very accurate) solutions are desired for coarse spatial cell problems demanding rapid execution times. Three methods, one of which is 'new', are presented for determining the eigenvalues and eigenvectors of such S N problems. In the first method, separation of variables is directly applied to the S N equations. In the second method, common characteristics of the S N and P N-1 equations are used. In the new method, the eigenvalues and eigenvectors can be computed provided that the cell-interface Green's functions (transmission and reflection factors) are known. Numerical results for S 4 test problems are given to compare the new method with the existing methods. (author)
The numerical analysis of eigenvalue problem solutions in the multigroup neutron diffusion theory
International Nuclear Information System (INIS)
Woznicki, Z.I.
1994-01-01
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iteration within global iterations. Particular interactive strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 32 figs, 15 tabs
Multi-level methods for solving multigroup transport eigenvalue problems in 1D slab geometry
International Nuclear Information System (INIS)
Anistratov, D. Y.; Gol'din, V. Y.
2009-01-01
A methodology for solving eigenvalue problems for the multigroup neutron transport equation in 1D slab geometry is presented. In this paper we formulate and compare different variants of nonlinear multi-level iteration methods. They are defined by means of multigroup and effective one-group low-order quasi diffusion (LOQD) equations. We analyze the effects of utilization of the effective one-group LOQD problem for estimating the eigenvalue. We present numerical results to demonstrate the performance of the iteration algorithms in different types of reactor-physics problems. (authors)
Directory of Open Access Journals (Sweden)
Winfried Auzinger
2006-01-01
Full Text Available We demonstrate that eigenvalue problems for ordinary differential equations can be recast in a formulation suitable for the solution by polynomial collocation. It is shown that the well-posedness of the two formulations is equivalent in the regular as well as in the singular case. Thus, a collocation code equipped with asymptotically correct error estimation and adaptive mesh selection can be successfully applied to compute the eigenvalues and eigenfunctions efficiently and with reliable control of the accuracy. Numerical examples illustrate this claim.
The total Hartree-Fock energy-eigenvalue sum relationship in atoms
International Nuclear Information System (INIS)
Sen, K.D.
1979-01-01
Using the well known relationships for the isoelectronic changes in the total Hartree-Fock energy, nucleus-electron attraction energy and electron-electron repulsion energy in atoms a simple polynomial expansion in Z is obtained for the sum of the eigenvalues which can be used to calculate the total Hartree-Fock energy. Numerical results are presented for 2-10 electron series to show that the present relationship is a better approximation than the other available energy-eigenvalue relationships. (author)
Bonnesen-style inequality for the first eigenvalue on a complete surface of constant curvature
Directory of Open Access Journals (Sweden)
Niufa Fang
2017-08-01
Full Text Available Abstract By Cheeger’s isoperimetric constants, some lower bounds and upper bounds of λ 1 $\\lambda_{1}$ , the first eigenvalue on a complete surface of constant curvature, are given. Some Bonnesen-style inequalities and reverse Bonnesen-style inequalities for the first eigenvalue are obtained. Those Bonnesen-style inequalities obtained are stronger than the well-known Osserman’s results and the upper bound is stronger than Osserman’s results (Osserman in Proceedings of the International Congress of Mathematicians, Helsinki, 1978.
The numerical analysis of eigenvalue problem solutions in the multigroup neutron diffusion theory
Energy Technology Data Exchange (ETDEWEB)
Woznicki, Z I [Institute of Atomic Energy, Otwock-Swierk (Poland)
1994-12-31
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iteration within global iterations. Particular interactive strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 32 figs, 15 tabs.
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
Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
Directory of Open Access Journals (Sweden)
Shu-Guang Guo
2016-05-01
Full Text Available Abstract A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013 and Liu et al. (Electron. J. Linear Algebra 26:333-344, 2013 determined, independently, the unique unicyclic graph whose least Q-eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three non-bipartite unicyclic graphs of order n with k pendant vertices ordering by least Q-eigenvalue.
The numerical analysis of eigenvalue problem solutions in multigroup neutron diffusion theory
International Nuclear Information System (INIS)
Woznicki, Z.I.
1995-01-01
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iterations within global iterations. Particular iterative strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 35 figs, 16 tabs
Oscillatory Stability and Eigenvalue Sensitivity Analysis of A DFIG Wind Turbine System
DEFF Research Database (Denmark)
Yang, Lihui; Xu, Zhao; Østergaard, Jacob
2011-01-01
This paper focuses on modeling and oscillatory stability analysis of a wind turbine with doubly fed induction generator (DFIG). A detailed mathematical model of DFIG wind turbine with vector-control loops is developed, based on which the loci of the system Jacobian's eigenvalues have been analyzed......, showing that, without appropriate controller tuning a Hopf bifurcation can occur in such a system due to various factors, such as wind speed. Subsequently, eigenvalue sensitivity with respect to machine and control parameters is performed to assess their impacts on system stability. Moreover, the Hopf...
On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems
Directory of Open Access Journals (Sweden)
El-Sayed M. E. Mostafa
2017-01-01
Full Text Available The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.
Gould, S H
1966-01-01
The first edition of this book gave a systematic exposition of the Weinstein method of calculating lower bounds of eigenvalues by means of intermediate problems. This second edition presents new developments in the framework of the material contained in the first edition, which is retained in somewhat modified form.
A multilevel in space and energy solver for multigroup diffusion eigenvalue problems
Directory of Open Access Journals (Sweden)
Ben C. Yee
2017-09-01
Full Text Available In this paper, we present a new multilevel in space and energy diffusion (MSED method for solving multigroup diffusion eigenvalue problems. The MSED method can be described as a PI scheme with three additional features: (1 a grey (one-group diffusion equation used to efficiently converge the fission source and eigenvalue, (2 a space-dependent Wielandt shift technique used to reduce the number of PIs required, and (3 a multigrid-in-space linear solver for the linear solves required by each PI step. In MSED, the convergence of the solution of the multigroup diffusion eigenvalue problem is accelerated by performing work on lower-order equations with only one group and/or coarser spatial grids. Results from several Fourier analyses and a one-dimensional test code are provided to verify the efficiency of the MSED method and to justify the incorporation of the grey diffusion equation and the multigrid linear solver. These results highlight the potential efficiency of the MSED method as a solver for multidimensional multigroup diffusion eigenvalue problems, and they serve as a proof of principle for future work. Our ultimate goal is to implement the MSED method as an efficient solver for the two-dimensional/three-dimensional coarse mesh finite difference diffusion system in the Michigan parallel characteristics transport code. The work in this paper represents a necessary step towards that goal.
A note on the gap between the first two eigenvalues for the Schroedinger operator
International Nuclear Information System (INIS)
Benguria, R.
1986-01-01
By means of a commutation formula, the author gives a simple proof of the upper bound of Wong et al on the gap between the first two eigenvalues in the Schrodinger operator. Unfortunately this proof does not seem to generalise into higher dimensions. (author)
Photonic Band Structure of Dispersive Metamaterials Formulated as a Hermitian Eigenvalue Problem
Raman, Aaswath; Fan, Shanhui
2010-01-01
We formulate the photonic band structure calculation of any lossless dispersive photonic crystal and optical metamaterial as a Hermitian eigenvalue problem. We further show that the eigenmodes of such lossless systems provide an orthonormal basis, which can be used to rigorously describe the behavior of lossy dispersive systems in general. © 2010 The American Physical Society.
Parallel algorithms for 2-D cylindrical transport equations of Eigenvalue problem
International Nuclear Information System (INIS)
Wei, J.; Yang, S.
2013-01-01
In this paper, aimed at the neutron transport equations of eigenvalue problem under 2-D cylindrical geometry on unstructured grid, the discrete scheme of Sn discrete ordinate and discontinuous finite is built, and the parallel computation for the scheme is realized on MPI systems. Numerical experiments indicate that the designed parallel algorithm can reach perfect speedup, it has good practicality and scalability. (authors)
Higher-order relationship between eigen-value separation and static flux tilts
International Nuclear Information System (INIS)
Beckner, W.D.
1975-01-01
Spatial kinetics phenomena in nuclear reactors, such as xenon-induced spatial flux oscillations, are currently being analyzed using the higher harmonic solutions to the static reactor balance equation. An important parameter in such an analysis is a global quantity called eigenvalue separation. It is desirable to be able to experimentally measure this parameter in power reactors in order to confirm design calculations. Since spatial distortions in the flux shape depend on the eigenvalue separation of the reactor, an attempt has been made previously to use this fact as a means of measuring the parameter. It was postulated that an induced flux distortion or ''static flux tilt'' could be measured and theoretically related to eigenvalue separation. Unfortunately, the behavior of experimental data did not exactly agree with theoretical predictions, and values of the parameter found using the original static flux tilt technique were consistently low. The theory has been re-evaluated here and the previously observed discrepancy eliminated. Techniques have been also developed to allow for more accurate interpretation of experimental data. In order to make the method applicable to real systems, the theory has been extended to two spatial dimensions; extension to three dimensions follows directly. Possible trouble areas have been investigated, and experimental procedures for use of the technique to measure the eigenvalue separation in power reactors are presented
Correlation between eigenvalues and sorted diagonal matrix elements of a large dimensional matrix
International Nuclear Information System (INIS)
Arima, A.
2008-01-01
Functional dependences of eigenvalues as functions of sorted diagonal elements are given for realistic nuclear shell model (NSM) hamiltonian, the uniform distribution hamiltonian and the GOE hamiltonian. In the NSM case, the dependence is found to be linear. We discuss extrapolation methods for more accurate predictions for low-lying states. (author)
Photonic Band Structure of Dispersive Metamaterials Formulated as a Hermitian Eigenvalue Problem
Raman, Aaswath
2010-02-26
We formulate the photonic band structure calculation of any lossless dispersive photonic crystal and optical metamaterial as a Hermitian eigenvalue problem. We further show that the eigenmodes of such lossless systems provide an orthonormal basis, which can be used to rigorously describe the behavior of lossy dispersive systems in general. © 2010 The American Physical Society.
Bonito, Andrea; Guermond, Jean-Luc
2011-01-01
We propose and analyze an approximation technique for the Maxwell eigenvalue problem using H1-conforming finite elements. The key idea consists of considering a mixed method controlling the divergence of the electric field in a fractional Sobolev space H-α with α ∈ (1/2, 1). The method is shown to be convergent and spectrally correct. © 2011 American Mathematical Society.
Directory of Open Access Journals (Sweden)
Boubakari Ibrahimou
2013-01-01
maximal monotone with and . Using the topological degree theory developed by Kartsatos and Quarcoo we study the eigenvalue problem where the operator is a single-valued of class . The existence of continuous branches of eigenvectors of infinite length then could be easily extended to the case where the operator is multivalued and is investigated.
The discontinuous finite element method for solving Eigenvalue problems of transport equations
International Nuclear Information System (INIS)
Yang, Shulin; Wang, Ruihong
2011-01-01
In this paper, the multigroup transport equations for solving the eigenvalues λ and K_e_f_f under two dimensional cylindrical coordinate are discussed. Aimed at the equations, the discretizing way combining discontinuous finite element method (DFE) with discrete ordinate method (SN) is developed, and the iterative algorithms and steps are studied. The numerical results show that the algorithms are efficient. (author)
The Second Eigenvalue of the p-Laplacian as p Goes to 1
Directory of Open Access Journals (Sweden)
Enea Parini
2010-01-01
Full Text Available The asymptotic behaviour of the second eigenvalue of the p-Laplacian operator as p goes to 1 is investigated. The limit setting depends only on the geometry of the domain. In the particular case of a planar disc, it is possible to show that the second eigenfunctions are nonradial if p is close enough to 1.
International Nuclear Information System (INIS)
Scheunert, M.
1982-10-01
The generators of the algebras under consideration can be written in a canonical two-index form and hence the associated standard seuqence of Casimir elements can be constructed. Following the classical approach by Perelomov and Popov, we obtain the eigenvalues of these Casimir elements in an arbitrary highest weight module by calculating the corresponding generating functions. (orig.)
2015-03-01
biometrics for physiological characteristics, hyperspectral remote sensing for detecting signals buried in noise and clutter, and medical genetics for...s); %approximate bounds on the eigenvalues used in Eq. (8) that are derived %from the Marcenko- Pastur law k=p./n; %band
Directory of Open Access Journals (Sweden)
Yuuki Kanemiyo
2012-01-01
Full Text Available This paper described a spatial correlation and eigenvalue in a multiple-input multiple-output (MIMO channel. A MIMO channel model with a multipath propagation mechanism was proposed and showed the channel matrix. The spatial correlation coefficient formula −,′−′( between MIMO channel matrix elements was derived for the model and was expressed as a directive wave term added to the product of mobile site correlation −′( and base site correlation −′( without LOS path, which are calculated independently of each other. By using −,′−′(, it is possible to create the channel matrix element with a fixed correlation value estimated by −,′−′( for a given multipath condition and a given antenna configuration. Furthermore, the correlation and the channel matrix eigenvalue were simulated, and the simulated and theoretical correlation values agreed well. The simulated eigenvalue showed that the average of the first eigenvalue λ1 hardly depends on the correlation −,′−′(, but the others do depend on −,′−′( and approach 1 as −,′−′( decreases. Moreover, as the path moves into LOS, the 1 state with mobile movement becomes more stable than the 1 of NLOS path.
A new formulation for the eigenvalue and the eigenfunction in the perturbation theory
International Nuclear Information System (INIS)
Korek, Mahmoud
1999-01-01
Full text.In infrared transitions, the problem of the ro vibrational eigenvalue and eigenfunction of a diatomic molecule is considered. It is shown that, for the transitions vJ↔v'J' the eigenvalues and the eigenfunctions of the two considered states can be expressed respectively in terms of one variable m (transition number), relating these two states, as E vm =Σ i=o e v (i) m i , Ψ vm =Σ i=0 φ v (i) m i and E v'm =Σ i=0 e v' (i) m i , Ψ v'm =Σ i=0 φ v' (i) m i , where m=[J'(J'+1)-J(J+1)]/2, and the coefficients e v (i) , φ v (i) , e v (i) , and φ v (i) , are given by analytical expressions. This m-representation of the eigenvalues and the eigenfunctions is more advantageous for the calculation of many factors in spectroscopy that are given in terms of m as the line intensities, the wave number of a transition, the Herman-Wallis coefficients,...etc. The numerical application to the ground state of the molecule CO shows that the present formulation provides a simple and accurate method for the calculation of the eigenvalues and the eigenfunctions for the two considered states
DEFF Research Database (Denmark)
Bendtsen, Claus; Nielsen, Ole Holm; Hansen, Lars Bruno
2001-01-01
The quantum mechanical ground state of electrons is described by Density Functional Theory, which leads to large minimization problems. An efficient minimization method uses a self-consistent field (SCF) solution of large eigenvalue problems. The iterative Davidson algorithm is often used, and we...
Eigenvalue condition for the Weinberg angle and possible new leptons and quarks
International Nuclear Information System (INIS)
Ma, E.
1977-01-01
In a given SU(2) x U(1) gauge model of the weak and electro-magnetic interactions, if one assumes that an eigenvalue condition exists for the mixing (Weinberg) angle, then its value can be computed in lower-order perturbation theory. This idea is illustrated with several examples, including two which are in agreement with all the present available data. (auth.)
Asymptotic eigenvalue estimates for a Robin problem with a large parameter
Czech Academy of Sciences Publication Activity Database
Exner, Pavel; Minakov, A.; Parnovski, L.
2014-01-01
Roč. 71, č. 2 (2014), s. 141-156 ISSN 0032-5155 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : Laplacian * Robin problem * eigenvalue asymptotics Subject RIV: BE - Theoretical Physics Impact factor: 0.250, year: 2014
On eigenvalue asymptotics for strong delta-interactions supported by surfaces with boundaries
Czech Academy of Sciences Publication Activity Database
Dittrich, Jaroslav; Exner, Pavel; Kuhn, C.; Pankrashkin, K.
2016-01-01
Roč. 97, 1-2 (2016), s. 1-25 ISSN 0921-7134 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : singular Schrodinger operator * delta-interaction * strong coupling * eigenvalue Subject RIV: BE - Theoretical Physics Impact factor: 0.933, year: 2016
Some remarks on the optimization of eigenvalue problems involving the p-Laplacian
Directory of Open Access Journals (Sweden)
Wacław Pielichowski
2008-01-01
Full Text Available Given a bounded domain \\(\\Omega \\subset \\mathbb{R}^n\\, numbers \\(p \\gt 1\\, \\(\\alpha \\geq 0\\ and \\(A \\in [0,|\\Omega |]\\, consider the optimization problem: find a subset \\(D \\subset \\Omega \\, of measure \\(A\\, for which the first eigenvalue of the operator \\(u\\mapsto -\\text{div} (|\
Lq-perturbations of leading coefficients of elliptic operators: Asymptotics of eigenvalues
Directory of Open Access Journals (Sweden)
Vladimir Kozlov
2006-01-01
Full Text Available We consider eigenvalues of elliptic boundary value problems, written in variational form, when the leading coefficients are perturbed by terms which are small in some integral sense. We obtain asymptotic formulae. The main specific of these formulae is that the leading term is different from that in the corresponding formulae when the perturbation is small in L∞-norm.
Effect of continuous eigenvalue spectrum on plasma transport in toroidal systems
International Nuclear Information System (INIS)
Yamagishi, Tomejiro
1993-03-01
The effect of the continuous eigenvalue of the Vlasov equation on the cross field ion thermal flux is investigated. The continuum contribution due to the toroidal drift resonance is found to play an important role in ion transport particularly near the edge, which may apply to the interpretation of the sharp increase of ion heat conductivity near the periphery observed in large tokamaks. (author)
Asymptotics of the Perron-Frobenius eigenvalue of nonnegative Hessenberg-Toeplitz matrices
Janssen, A.J.E.M.
1989-01-01
Asymptotic results for the Perron-Frobenius eigenvalue of a nonnegative Hessenberg-Toeplitz matrix as the dimension of the matrix tends to 8 are given. The results are used and interpreted in terms of source entropies in the case where the Hessenberg-Toeplitz matrix arises as the transition matrix
On the number of negative eigenvalues of the Laplacian on a metric graph
International Nuclear Information System (INIS)
Behrndt, Jussi; Luger, Annemarie
2010-01-01
The number of negative eigenvalues of self-adjoint Laplacians on metric graphs is calculated in terms of the boundary conditions and the underlying geometric structure. This extends and complements earlier results by Kostrykin and Schrader (2006 Contemp. Math. 415 201-25).
On the number of negative eigenvalues of the Laplacian on a metric graph
Energy Technology Data Exchange (ETDEWEB)
Behrndt, Jussi [Institut fuer Mathematik, MA 6-4, Technische Universitaet Berlin, Strasse des 17. Juni 136, 10623 Berlin (Germany); Luger, Annemarie, E-mail: behrndt@math.tu-berlin.d, E-mail: luger@maths.lth.s [Center for Mathematical Sciences, Lund Institute of Technology/Lund University, Box 118, SE-221 00 Lund (Sweden)
2010-11-26
The number of negative eigenvalues of self-adjoint Laplacians on metric graphs is calculated in terms of the boundary conditions and the underlying geometric structure. This extends and complements earlier results by Kostrykin and Schrader (2006 Contemp. Math. 415 201-25).
Distribution of the Largest Eigenvalues of the Levi-Smirnov Ensemble
International Nuclear Information System (INIS)
Wieczorek, W.
2004-01-01
We calculate the distribution of the k-th largest eigenvalue in the random matrix Levi - Smirnov Ensemble (LSE), using the spectral dualism between LSE and chiral Gaussian Unitary Ensemble (GUE). Then we reconstruct universal spectral oscillations and we investigate an asymptotic behavior of the spectral distribution. (author)
Bounds and extremal domains for Robin eigenvalues with negative boundary parameter
Czech Academy of Sciences Publication Activity Database
Antunes, P. R. S.; Freitas, P.; Krejčiřík, David
2017-01-01
Roč. 10, č. 4 (2017), s. 357-379 ISSN 1864-8258 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : Eigenvalue optimisation * Robin Laplacian * negative boundary parameter * Bareket's conjecture Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.182, year: 2016
Guliyev, Namig J.
2008-01-01
International audience; Inverse problems of recovering the coefficients of Sturm–Liouville problems with the eigenvalue parameter linearly contained in one of the boundary conditions are studied: 1) from the sequences of eigenvalues and norming constants; 2) from two spectra. Necessary and sufficient conditions for the solvability of these inverse problems are obtained.
Eigenvalues of relaxed toroidal plasmas of arbitrary sharp edged cross sections. Vol. 2
Energy Technology Data Exchange (ETDEWEB)
Khalil, Sh M [Plasma Physics and Nuclear Fusion Department, Nuclear Research Center, Atomic Energy Authority, Cairo, (Egypt)
1996-03-01
Relaxed (force-free) toroidal plasmas described by the equations cur 1 B={mu}B, and grad {mu}=O (B is the magnetic field) induces interest in nuclear fusion. Its solution is perceived to describe the gross of the reversed field pinch (RFP), spheromak configuration, current limitation in toroidal plasmas, and others. The parameter {mu} plays an important roll in relaxed states. It cannot exceed the smallest eigenvalue {mu} (min), and that for a toroidal discharge there is a maximum toroidal current which is connected to this value. The values of{mu} were calculated numerically, using the methods of collocation points, for toroids of arbitrary aspect ratio {alpha} ({alpha} = R/a, ratio of major/minor radii of tokamak) and arbitrary curved cross-sections (circle, ellipse, cassini, and D-shaped). The aim of present work is to prove the applicability of the numerical methods for calculating the eigenvalues for toroidal plasmas having sharp edged cross sections and arbitrary aspect ratio. The lowest eigenvalue {mu} (min), satisfy the boundary condition {beta} .n = O (or RB. = O) for which the toroidal flux are calculated. These are the zero field eigenvalues of the equation cur 1 b={mu}B. The poloidal magnetic field lines corresponding to different cross sections are shown by plotting the boundary condition B.n=O. The plots showed good fulfillment of the boundary condition along the whole boundaries of different cross sections. Dependence of eigenvalues {mu}a on aspect ratio {alpha} is also obtained. Several runs of the programme with various wave numbers K showed that {mu}a is very insensitive to the choice of K. 8 figs.
International Nuclear Information System (INIS)
Velarde, G.; Ahnert, C.; Aragones, J.M.
1977-01-01
A comparative study of the eigenvalue transport in kappa, lambda, γ and α is made. The neutronic fluxes obtained by solving the transport equation in the four eigenvalue types are compared numerically for fast and thermal systems in unreflected and reflected configurations. Important conclusions will be obtained about the appropiate use of each eigenvalue depending on the calculation type to be performed. (author)
The solution of a chiral random matrix model with complex eigenvalues
International Nuclear Information System (INIS)
Akemann, G
2003-01-01
We describe in detail the solution of the extension of the chiral Gaussian unitary ensemble (chGUE) into the complex plane. The correlation functions of the model are first calculated for a finite number of N complex eigenvalues, where we exploit the existence of orthogonal Laguerre polynomials in the complex plane. When taking the large-N limit we derive new correlation functions in the case of weak and strong non-Hermiticity, thus describing the transition from the chGUE to a generalized Ginibre ensemble. We briefly discuss applications to the Dirac operator eigenvalue spectrum in quantum chromodynamics with non-vanishing chemical potential. This is an extended version of hep-th/0204068
International Nuclear Information System (INIS)
Goncalves, G.A.; Vilhena, M.T. de; Bodmann, B.E.J.
2010-01-01
In the present work we propose a heuristic construction of a transport equation for neutrons with anisotropic scattering considering only the radial cylinder dimension. The eigenvalues of the solutions of the equation correspond to the positive values for the one dimensional case. The central idea of the procedure is the application of the S N method for the discretisation of the angular variable followed by the application of the zero order Hankel transformation. The basis the construction of the scattering terms in form of an integro-differential equation for stationary transport resides in the hypothesis that the eigenvalues that compose the elementary solutions are independent of geometry for a homogeneous medium. We compare the solutions for the cartesian one dimensional problem for an infinite cylinder with azimuthal symmetry and linear anisotropic scattering for two cases. (orig.)
Topological derivatives of eigenvalues and neural networks in identification of imperfections
International Nuclear Information System (INIS)
Grzanek, M; Nowakowski, A; Sokolowski, J
2008-01-01
Numerical method for identification of imperfections is devised for elliptic spectral problems. The neural networks are employed for numerical solution. The topological derivatives of eigenvalues are used in the learning procedure of the neural networks. The topological derivatives of eigenvalues are determined by the methods of asymptotic analysis in singularly perturbed geometrical domains. The convergence of the numerical method in a probabilistic setting is analysed. The method is presented for the identification of small singular perturbations of the boundary of geometrical domain, however the framework is general and can be used for numerical solutions of inverse problems in the presence of small imperfections in the interior of the domain. Some numerical results are given for elliptic spectral problem in two spatial dimensions.
Solving eigenvalue problems on curved surfaces using the Closest Point Method
Macdonald, Colin B.
2011-06-01
Eigenvalue problems are fundamental to mathematics and science. We present a simple algorithm for determining eigenvalues and eigenfunctions of the Laplace-Beltrami operator on rather general curved surfaces. Our algorithm, which is based on the Closest Point Method, relies on an embedding of the surface in a higher-dimensional space, where standard Cartesian finite difference and interpolation schemes can be easily applied. We show that there is a one-to-one correspondence between a problem defined in the embedding space and the original surface problem. For open surfaces, we present a simple way to impose Dirichlet and Neumann boundary conditions while maintaining second-order accuracy. Convergence studies and a series of examples demonstrate the effectiveness and generality of our approach. © 2011 Elsevier Inc.
Improved simple graphical solution for the eigenvalues of the finite square well potential
International Nuclear Information System (INIS)
Burge, E.J.
1985-01-01
The three principal graphical methods for obtaining the energy eigenvalues of the finite square well potential are presented. The forms of the wavefunctions within the well, and the corresponding linear probability densities, are derived directly from the method. A simple extension of the method allows the energy level spectrum to be obtained directly on a linear energy scale. The variations of the energy eigenvalues with well depth and width are separately and jointly displayed, and explicit corresponding functional relationships are derived. Two universal graphs are deduced which allow the rapid appreciation and calculation of the dependence of the energy levels on the depth and width of the well and on the mass of the particle. (author)
Applications of elliptic operator theory to the isotropic interior transmission eigenvalue problem
Lakshtanov, E.; Vainberg, B.
2013-10-01
The paper concerns the isotropic interior transmission eigenvalue (ITE) problem. This problem is not elliptic, but we show that, using the Dirichlet-to-Neumann map, it can be reduced to an elliptic one. This leads to the discreteness of the spectrum as well as to certain results on a possible location of the transmission eigenvalues. If the index of refraction \\sqrt{n(x)} is real, then we obtain a result on the existence of infinitely many positive ITEs and the Weyl-type lower bound on its counting function. All the results are obtained under the assumption that n(x) - 1 does not vanish at the boundary of the obstacle or it vanishes identically, but its normal derivative does not vanish at the boundary. We consider the classical transmission problem as well as the case when the inhomogeneous medium contains an obstacle. Some results on the discreteness and localization of the spectrum are obtained for complex valued n(x).
Generalization of the Fourier Convergence Analysis in the Neutron Diffusion Eigenvalue Problem
International Nuclear Information System (INIS)
Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook
2005-01-01
Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Lee et al proposed new 2- D/1-D coupling methods and demonstrated several advantages of the new methods by performing a Fourier convergence analysis of the methods as well as two existing methods for a fixed source problem. We demonstrated the Fourier convergence analysis of one of the 2-D/1-D coupling methods applied to a neutron diffusion eigenvalue problem. However, the technique cannot be used directly to analyze the convergence of the other 2-D/1-D coupling methods since some algorithm-specific features were used in our previous study. In this paper we generalized the Fourier convergence analysis technique proposed and analyzed the convergence of the 2-D/1-D coupling methods applied to a neutron diffusion Eigenvalue problem using the generalized technique
Haidar, Azzam
2012-01-01
Classical solvers for the dense symmetric eigenvalue problem suffer from the first step, which involves a reduction to tridiagonal form that is dominated by the cost of accessing memory during the panel factorization. The solution is to reduce the matrix to a banded form, which then requires the eigenvalues of the banded matrix to be computed. The standard divide and conquer algorithm can be modified for this purpose. The paper combines this insight with tile algorithms that can be scheduled via a dynamic runtime system to multicore architectures. A detailed analysis of performance and accuracy is included. Performance improvements of 14-fold and 4-fold speedups are reported relative to LAPACK and Intel\\'s Math Kernel Library.
Solving Large Scale Nonlinear Eigenvalue Problem in Next-Generation Accelerator Design
Energy Technology Data Exchange (ETDEWEB)
Liao, Ben-Shan; Bai, Zhaojun; /UC, Davis; Lee, Lie-Quan; Ko, Kwok; /SLAC
2006-09-28
A number of numerical methods, including inverse iteration, method of successive linear problem and nonlinear Arnoldi algorithm, are studied in this paper to solve a large scale nonlinear eigenvalue problem arising from finite element analysis of resonant frequencies and external Q{sub e} values of a waveguide loaded cavity in the next-generation accelerator design. They present a nonlinear Rayleigh-Ritz iterative projection algorithm, NRRIT in short and demonstrate that it is the most promising approach for a model scale cavity design. The NRRIT algorithm is an extension of the nonlinear Arnoldi algorithm due to Voss. Computational challenges of solving such a nonlinear eigenvalue problem for a full scale cavity design are outlined.
Inequalities among partial traces of hermitian operators and partial sums of their eigenvalues
International Nuclear Information System (INIS)
Daboul, J.
1990-01-01
Two different proofs of the following inequality are given: Tr sup(k)(H):= sup(k)Σ sub(i=1) h sub(i) :sup(k)Σ sub(i=1)(X sub(i), Hx sub(i))≥ sup(k)Σ sub(i=1)E sub(i), for k = 1,-,N, where H is a Hermitian matrix, the {X sub(i), i = 1,2-,k } are any k orthonormal vectors and the e sub(i) are the eigenvalues of H, ordered according to increasing values. This result is a generalization of the well-known fact, that ground state of a Hamiltonian is given by its lowest eigenvalue, E sub(i). It can also be regarded as a generalization, for Hermitian operators, of the invariance of the trace under unitary transformation. A few consequences of the above result are also derived. (author)
A new S-type eigenvalue inclusion set for tensors and its applications.
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).
International Nuclear Information System (INIS)
Lay-Ekuakille, Aimé; Pariset, Carlo; Trotta, Amerigo
2010-01-01
The FDM (filter diagonalization method), an interesting technique used in nuclear magnetic resonance data processing for tackling FFT (fast Fourier transform) limitations, can be used by considering pipelines, especially complex configurations, as a vascular apparatus with arteries, veins, capillaries, etc. Thrombosis, which might occur in humans, can be considered as a leakage for the complex pipeline, the human vascular apparatus. The choice of eigenvalues in FDM or in spectra-based techniques is a key issue in recovering the solution of the main equation (for FDM) or frequency domain transformation (for FFT) in order to determine the accuracy in detecting leaks in pipelines. This paper deals with the possibility of improving the leak detection accuracy of the FDM technique thanks to a robust algorithm by assessing the problem of eigenvalues, making it less experimental and more analytical using Tikhonov-based regularization techniques. The paper starts from the results of previous experimental procedures carried out by the authors
International Nuclear Information System (INIS)
Molchanov, I.N.; Khimich, A.N.
1984-01-01
This article shows how a reflection method can be used to find the eigenvalues of a matrix by transforming the matrix to tridiagonal form. The method of conjugate gradients is used to find the smallest eigenvalue and the corresponding eigenvector of symmetric positive-definite band matrices. Topics considered include the computational scheme of the reflection method, the organization of parallel calculations by the reflection method, the computational scheme of the conjugate gradient method, the organization of parallel calculations by the conjugate gradient method, and the effectiveness of parallel algorithms. It is concluded that it is possible to increase the overall effectiveness of the multiprocessor electronic computers by either letting the newly available processors of a new problem operate in the multiprocessor mode, or by improving the coefficient of uniform partition of the original information
Elementary Baecklund transformations for a discrete Ablowitz-Ladik eigenvalue problem
International Nuclear Information System (INIS)
Rourke, David E
2004-01-01
Elementary Baecklund transformations (BTs) are described for a discretization of the Zakharov-Shabat eigenvalue problem (a special case of the Ablowitz-Ladik eigenvalue problem). Elementary BTs allow the process of adding bound states to a system (i.e., the add-one-soliton BT) to be 'factorized' to solving two simpler sub-problems. They are used to determine the effect on the scattering data when bound states are added. They are shown to provide a method of calculating discrete solitons-this is achieved by constructing a lattice of intermediate potentials, with the parameters used in the calculation of the lattice simply related to the soliton scattering data. When the potentials, S n , T n , in the system are related by S n = -T n , they enable simple derivations to be obtained of the add-one-soliton BT and the nonlinear superposition formula
On the Shape Sensitivity of the First Dirichlet Eigenvalue for Two-Phase Problems
International Nuclear Information System (INIS)
Dambrine, M.; Kateb, D.
2011-01-01
We consider a two-phase problem in thermal conductivity: inclusions filled with a material of conductivity σ 1 are layered in a body of conductivity σ 2 . We address the shape sensitivity of the first eigenvalue associated with Dirichlet boundary conditions when both the boundaries of the inclusions and the body can be modified. We prove a differentiability result and provide the expressions of the first and second order derivatives. We apply the results to the optimal design of an insulated body. We prove the stability of the optimal design thanks to a second order analysis. We also continue the study of an extremal eigenvalue problem for a two-phase conductor in a ball initiated by Conca et al. (Appl. Math. Optim. 60(2):173-184, 2009) and pursued in Conca et al. (CANUM 2008, ESAIM Proc., vol. 27, pp. 311-321, EDP Sci., Les Ulis, 2009).
International Nuclear Information System (INIS)
Macfarlane, A J; Pfeiffer, Hendryk
2003-01-01
The uniformity, for the family of exceptional Lie algebras g, of the decompositions of the powers of their adjoint representations is now well known for powers up to four. The paper describes an extension of this uniformity for the totally antisymmetrized nth powers up to n = 9, identifying families of representations with integer eigenvalues 5, ..., 9 for the quadratic Casimir operator, in each case providing a formula for the dimensions of the representations in the family as a function of D = dim g. This generalizes previous results for powers j and Casimir eigenvalues j, j ≤ 4. Many intriguing, perhaps puzzling, features of the dimension formulae are discussed and the possibility that they may be valid for a wider class of not necessarily simple Lie algebras is considered
International Nuclear Information System (INIS)
Itagaki, Masafumi; Sahashi, Naoki.
1996-01-01
The multiple reciprocity method (MRM) in conjunction with the boundary element method has been employed to solve one-group eigenvalue problems described by the three-dimensional (3-D) neutron diffusion equation. The domain integral related to the fission source is transformed into a series of boundary-only integrals, with the aid of the higher order fundamental solutions based on the spherical and the modified spherical Bessel functions. Since each degree of the higher order fundamental solutions in the 3-D cases has a singularity of order (1/r), the above series of boundary integrals requires additional terms which do not appear in the 2-D MRM formulation. The critical eigenvalue itself can be also described using only boundary integrals. Test calculations show that Wielandt's spectral shift technique guarantees rapid and stable convergence of 3-D MRM computations. (author)
Eigenfunctions and Eigenvalues for a Scalar Riemann-Hilbert Problem Associated to Inverse Scattering
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.
International Nuclear Information System (INIS)
Moeller, K.
1978-01-01
A system of three particles is considered which interacts by rank-1 separable potential. For the Faddeev equation kernel of this system a method is proposed for calculating the eigenvalues on the nonphysical sheet of the three-particle cms-energy. From the consideration of the analytical structure of the eigenvalues in the energy plane it follows that the analytical continuations of the eigenvalues from the physical to the nonphysical region are different above and below the three-particle threshold. In this paper the continuation below the threshold is discussed. (author)
2017-09-01
features can be evaluated such a welds and bolted connections. With these situations investigated, test articles with more complex geometry can be used...become more capable. Despite these advancements, the construction of physical prototypes remains an essential aspect of design and testing . FEM...prototype, there may be design deficiencies that cannot be identified until the prototype is tested . Using eigenvalue sensitivities, enhanced by
Prolongation structure and linear eigenvalue equations for Einstein-Maxwell fields
International Nuclear Information System (INIS)
Kramer, D.; Neugebauer, G.
1981-01-01
The Einstein-Maxwell equations for stationary axisymmetric exterior fields are shown to be the integrability conditions of a set of linear eigenvalue equations for pseudopotentials. Using the method of Wahlquist and Estabrook (J. Math Phys.; 16:1 (1975)) it is shown that the prolongation structure of the Einstein-Maxwell equations contains the SU(2,1) Lie algebra. A new mapping of known solutions to other solutions has been found. (author)
Energy Technology Data Exchange (ETDEWEB)
Zanette, Rodrigo [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Programa de Pós-Graduação em Matemática Aplicada; Petersen, Claudio Z.; Tavares, Matheus G., E-mail: rodrigozanette@hotmail.com, E-mail: claudiopetersen@yahoo.com.br, E-mail: matheus.gulartetavares@gmail.com [Universidade Federal de Pelotas (UFPEL), RS (Brazil). Programa de Pós-Graduação em Modelagem Matemática
2017-07-01
We describe in this work the application of the modified power method for solve the multigroup neutron diffusion eigenvalue problem in slab geometry considering two-dimensions for nuclear reactor global calculations. It is well known that criticality calculations can often be best approached by solving eigenvalue problems. The criticality in nuclear reactors physics plays a relevant role since establishes the ratio between the numbers of neutrons generated in successive fission reactions. In order to solve the eigenvalue problem, a modified power method is used to obtain the dominant eigenvalue (effective multiplication factor (K{sub eff})) and its corresponding eigenfunction (scalar neutron flux), which is non-negative in every domain, that is, physically relevant. The innovation of this work is solving the neutron diffusion equation in analytical form for each new iteration of the power method. For solve this problem we propose to apply the Finite Fourier Sine Transform on one of the spatial variables obtaining a transformed problem which is resolved by well-established methods for ordinary differential equations. The inverse Fourier transform is used to reconstruct the solution for the original problem. It is known that the power method is an iterative source method in which is updated by the neutron flux expression of previous iteration. Thus, for each new iteration, the neutron flux expression becomes larger and more complex due to analytical solution what makes propose that it be reconstructed through an polynomial interpolation. The methodology is implemented to solve a homogeneous problem and the results are compared with works presents in the literature. (author)
Cessna Citation X Business Aircraft Eigenvalue Stability – Part2: Flight Envelope Analysis
Directory of Open Access Journals (Sweden)
Yamina BOUGHARI
2017-12-01
Full Text Available Civil aircraft flight control clearance is a time consuming, thus an expensive process in the aerospace industry. This process has to be investigated and proved to be safe for thousands of combinations in terms of speeds, altitudes, gross weights, Xcg / weight configurations and angles of attack. Even in this case, a worst-case condition that could lead to a critical situation might be missed. To address this problem, models that are able to describe an aircraft’s dynamics by taking into account all uncertainties over a region within a flight envelope have been developed using Linear Fractional Representation. In order to investigate the Cessna Citation X aircraft Eigenvalue Stability envelope, the Linear Fractional Representation models are implemented using the speeds and the altitudes as varying parameters. In this paper Part 2, the aircraft longitudinal eigenvalue stability is analyzed in a continuous range of flight envelope with varying parameter of True airspeed and altitude, instead of a single point, like classical methods. This is known as the aeroelastic stability envelope, required for civil aircraft certification as given by the Circular Advisory “Aeroelastic Stability Substantiation of Transport Category Airplanes AC No: 25.629-18”. In this new methodology the analysis is performed in time domain based on Lyapunov stability and solved by convex optimization algorithms by using the linear matrix inequalities to evaluate the eigenvalue stability, which is reduced to search for the negative eigenvalues in a region of flight envelope. It can also be used to study the stability of a system during an arbitrary motion from one point to another in the flight envelope. A whole aircraft analysis results’ for its entire envelope are presented in the form of graphs, thus offering good readability, and making them easily exploitable.
Inversion for Eigenvalues and Modes Using Sierra-SD and ROL.
Energy Technology Data Exchange (ETDEWEB)
Walsh, Timothy [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Aquino, Wilkins [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ridzal, Denis [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Kouri, Drew Philip [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2015-12-01
In this report we formulate eigenvalue-based methods for model calibration using a PDE-constrained optimization framework. We derive the abstract optimization operators from first principles and implement these methods using Sierra-SD and the Rapid Optimization Library (ROL). To demon- strate this approach, we use experimental measurements and an inverse solution to compute the joint and elastic foam properties of a low-fidelity unit (LFU) model.
Numerical Aspects of Eigenvalue and Eigenfunction Computations for Chaotic Quantum Systems
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.
Ltaief, Hatem
2012-01-01
This paper proposes an efficient implementation of the generalized symmetric eigenvalue problem on multicore architecture. Based on a four-stage approach and tile algorithms, the original problem is first transformed into a standard symmetric eigenvalue problem by computing the Cholesky factorization of the right hand side symmetric definite positive matrix (first stage), and applying the inverse of the freshly computed triangular Cholesky factors to the original dense symmetric matrix of the problem (second stage). Calculating the eigenpairs of the resulting problem is then equivalent to the eigenpairs of the original problem. The computation proceeds by reducing the updated dense symmetric matrix to symmetric band form (third stage). The band structure is further reduced by applying a bulge chasing procedure, which annihilates the extra off-diagonal entries using orthogonal transformations (fourth stage). More details on the third and fourth stage can be found in Haidar et al. [Accepted at SC\\'11, November 2011]. The eigenvalues are then calculated from the tridiagonal form using the standard LAPACK QR algorithm (i.e., DTSEQR routine), while the complex and challenging eigenvector computations will be addressed in a companion paper. The tasks from the various stages can concurrently run in an out-of-order fashion. The data dependencies are cautiously tracked by the dynamic runtime system environment QUARK, which ensures the dependencies are not violated for numerical correctness purposes. The obtained tile four-stage generalized symmetric eigenvalue solver significantly outperforms the state-of-the-art numerical libraries (up to 21-fold speed up against multithreaded LAPACK with optimized multithreaded MKL BLAS and up to 4-fold speed up against the corresponding routine from the commercial numerical software Intel MKL) on four sockets twelve cores AMD system with a 24000×24000 matrix size. © 2012 The authors and IOS Press. All rights reserved.
International Nuclear Information System (INIS)
Torrini, M.
1983-01-01
The exponential nature of the translation matrix G of spherical free waves has been set forth in a previous paper.The explicit expression of the exponential form of the translation matrix is given here, once the eigenvectros and the eigenvalues of G have been found. In addition, the eigenproblem relative to the matrix which transforms outgoing waves scattered by a centre in a set of spherical free waves centered at a different point is solved
Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices
International Nuclear Information System (INIS)
Kabashima, Yoshiyuki; Takahashi, Hisanao; Watanabe, Osamu
2010-01-01
A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is plausible for infinitely large systems, in conjunction with the introduction of a Lagrange multiplier for constraining the length of the eigenvector, the eigenvalue problem is reduced to a bunch of optimization problems of a quadratic function of a single variable, and the coefficients of the first and the second order terms of the functions act as cavity fields that are handled in cavity analysis. We show that the first eigenvalue is determined in such a way that the distribution of the cavity fields has a finite value for the second order moment with respect to the cavity fields of the first order coefficient. The validity and utility of the developed methodology are examined by applying it to two analytically solvable and one simple but non-trivial examples in conjunction with numerical justification.
Genetic Algorithm Applied to the Eigenvalue Equalization Filtered-x LMS Algorithm (EE-FXLMS
Directory of Open Access Journals (Sweden)
Stephan P. Lovstedt
2008-01-01
Full Text Available The FXLMS algorithm, used extensively in active noise control (ANC, exhibits frequency-dependent convergence behavior. This leads to degraded performance for time-varying tonal noise and noise with multiple stationary tones. Previous work by the authors proposed the eigenvalue equalization filtered-x least mean squares (EE-FXLMS algorithm. For that algorithm, magnitude coefficients of the secondary path transfer function are modified to decrease variation in the eigenvalues of the filtered-x autocorrelation matrix, while preserving the phase, giving faster convergence and increasing overall attenuation. This paper revisits the EE-FXLMS algorithm, using a genetic algorithm to find magnitude coefficients that give the least variation in eigenvalues. This method overcomes some of the problems with implementing the EE-FXLMS algorithm arising from finite resolution of sampled systems. Experimental control results using the original secondary path model, and a modified secondary path model for both the previous implementation of EE-FXLMS and the genetic algorithm implementation are compared.
Hybrid subgroup decomposition method for solving fine-group eigenvalue transport problems
International Nuclear Information System (INIS)
Yasseri, Saam; Rahnema, Farzad
2014-01-01
Highlights: • An acceleration technique for solving fine-group eigenvalue transport problems. • Coarse-group quasi transport theory to solve coarse-group eigenvalue transport problems. • Consistent and inconsistent formulations for coarse-group quasi transport theory. • Computational efficiency amplified by a factor of 2 using hybrid SGD for 1D BWR problem. - Abstract: In this paper, a new hybrid method for solving fine-group eigenvalue transport problems is developed. This method extends the subgroup decomposition method to efficiently couple a new coarse-group quasi transport theory with a set of fixed-source transport decomposition sweeps to obtain the fine-group transport solution. The advantages of the quasi transport theory are its high accuracy, straight-forward implementation and numerical stability. The hybrid method is analyzed for a 1D benchmark problem characteristic of boiling water reactors (BWR). It is shown that the method reproduces the fine-group transport solution with high accuracy while increasing the computational efficiency up to 12 times compared to direct fine-group transport calculations
Numerical computations of interior transmission eigenvalues for scattering objects with cavities
International Nuclear Information System (INIS)
Peters, Stefan; Kleefeld, Andreas
2016-01-01
In this article we extend the inside-outside duality for acoustic transmission eigenvalue problems by allowing scattering objects that may contain cavities. In this context we provide the functional analytical framework necessary to transfer the techniques that have been used in Kirsch and Lechleiter (2013 Inverse Problems, 29 104011) to derive the inside-outside duality. Additionally, extensive numerical results are presented to show that we are able to successfully detect interior transmission eigenvalues with the inside-outside duality approach for a variety of obstacles with and without cavities in three dimensions. In this context, we also discuss the advantages and disadvantages of the inside-outside duality approach from a numerical point of view. Furthermore we derive the integral equations necessary to extend the algorithm in Kleefeld (2013 Inverse Problems, 29 104012) to compute highly accurate interior transmission eigenvalues for scattering objects with cavities, which we will then use as reference values to examine the accuracy of the inside-outside duality algorithm. (paper)
Distribution of Schmidt-like eigenvalues for Gaussian ensembles of the random matrix theory
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.
Distribution of Schmidt-like eigenvalues for Gaussian ensembles of the random matrix theory
International Nuclear Information System (INIS)
Pato, Mauricio P; Oshanin, Gleb
2013-01-01
We study the probability distribution function P (β) n (w) of the Schmidt-like random variable w = x 2 1 /(∑ j=1 n x 2 j /n), where x j , (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 (β) (w)∼√((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. (paper)
A Projection free method for Generalized Eigenvalue Problem with a nonsmooth Regularizer.
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.
1987-06-01
11.55), we get (11.56) 1 bu(u - ZhU)dx < bull - hUi{ !s Ch2V(a), where C = C(aOa 1lbo,blV 0 (a),X). Next we consider I(S-Sh)uIL and Ij(T-Th)uaL2 It is...Math. Ann. 97, 711-736. Courant, R. [1943]: Variational methods for the solution of prob- .-lems of equilibrium and vibrations, Bull . Amer. Math. Soc...fournir des bornes superieures ou inferieures, C.R. Acad. Sci., Paris 235, 995-997. .V Prodi, G. (1962]: Theoremi di tipo locale per il sistema de Navier
International Nuclear Information System (INIS)
Rekab, S.; Zenine, N.
2006-01-01
We consider the three dimensional non relativistic eigenvalue problem in the case of a Coulomb potential plus linear and quadratic radial terms. In the framework of the Rayleigh-Schrodinger Perturbation Theory, using a specific choice of the unperturbed Hamiltonian, we obtain approximate analytic expressions for the eigenvalues of orbital excitations. The implications and the range of validity of the obtained analytic expression are discussed
Institute of Scientific and Technical Information of China (English)
Tang Wen-Lin; Tian Gui-Hua
2011-01-01
The spheroidal wave functions are found to have extensive applications in many branches of physics and mathematics. We use the perturbation method in supersymmetric quantum mechanics to obtain the analytic ground eigenvalue and the ground eigenfunction of the angular spheroidal wave equation at low frequency in a series form. Using this approach, the numerical determinations of the ground eigenvalue and the ground eigenfunction for small complex frequencies are also obtained.
Akemann, G; Bittner, E; Lombardo, M; Markum, H; Pullirsch, R
2004-01-01
We investigate the eigenvalue spectrum of the staggered Dirac matrix in two color QCD at finite chemical potential. The profiles of complex eigenvalues close to the origin are compared to a complex generalization of the chiral Gaussian Symplectic Ensemble, confirming its predictions for weak and strong non-Hermiticity. They differ from the QCD symmetry class with three colors by a level repulsion from both the real and imaginary axis.
International Nuclear Information System (INIS)
Akemann, Gernot; Bittner, Elmar; Lombardo, Maria-Paola; Markum, Harald; Pullirsch, Rainer
2005-01-01
We investigate the eigenvalue spectrum of the staggered Dirac matrix in two color QCD at finite chemical potential. The profiles of complex eigenvalues close to the origin are compared to a complex generalization of the chiral Gaussian Symplectic Ensemble, confirming its predictions for weak and strong non-Hermiticity. They differ from the QCD symmetry class with three colors by a level repulsion from both the real and imaginary axis
International Nuclear Information System (INIS)
Qiu, Yishu; She, Ding; Tang, Xiao; Wang, Kan; Liang, Jingang
2016-01-01
Highlights: • A new algorithm is proposed to reduce memory consumption for sensitivity analysis. • The fission matrix method is used to generate adjoint fission source distributions. • Sensitivity analysis is performed on a detailed 3D full-core benchmark with RMC. - Abstract: Recently, there is a need to develop advanced methods of computing eigenvalue sensitivity coefficients to nuclear data in the continuous-energy Monte Carlo codes. One of these methods is the iterated fission probability (IFP) method, which is adopted by most of Monte Carlo codes of having the capabilities of computing sensitivity coefficients, including the Reactor Monte Carlo code RMC. Though it is accurate theoretically, the IFP method faces the challenge of huge memory consumption. Therefore, it may sometimes produce poor sensitivity coefficients since the number of particles in each active cycle is not sufficient enough due to the limitation of computer memory capacity. In this work, two algorithms of the Contribution-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method, namely, the collision-event-based algorithm (C-CLUTCH) which is also implemented in SCALE and the fission-event-based algorithm (F-CLUTCH) which is put forward in this work, are investigated and implemented in RMC to reduce memory requirements for computing eigenvalue sensitivity coefficients. While the C-CLUTCH algorithm requires to store concerning reaction rates of every collision, the F-CLUTCH algorithm only stores concerning reaction rates of every fission point. In addition, the fission matrix method is put forward to generate the adjoint fission source distribution for the CLUTCH method to compute sensitivity coefficients. These newly proposed approaches implemented in RMC code are verified by a SF96 lattice model and the MIT BEAVRS benchmark problem. The numerical results indicate the accuracy of the F-CLUTCH algorithm is the same as the C
Estimates of the eigenvalues of operator arising in swelling pressure model
International Nuclear Information System (INIS)
Kanguzhin, Baltabek; Zhapsarbayeva, Lyailya
2016-01-01
Swelling pressures from materials confined by structures can cause structural deformations and instability. Due to the complexity of interactions between expansive solid and solid-liquid equilibrium, the forces exerting on retaining structures from swelling are highly nonlinear. This work is our initial attempt to study a simplistic spectral problem based on the Euler-elastic beam theory and some simplistic swelling pressure model. In this work estimates of the eigenvalues of some initial/boundary value problem for nonlinear Euler-elastic beam equation are obtained.
Miyazaki, Yoshinori
2000-01-01
This paper is strongly based on two powerful general theorems proved by Ikebe, et. al in 1993[15] and 1996[13], which will be referred to as Theorem A and Theorem B in this paper. They were recently published and justify the approximate computations of simple eigenvalues of infinite matrices of certain types by truncation, giving an extremely accurate error estimates. So far, they have applied to some important problems in engineering, such as computing the zeros of some special functions, an...
Computation of Double Eigenvalues for Infinite Matrices of a Certain Class
宮崎, 佳典; Yoshinori, MIYAZAKI; 静岡産業大学 国際情報学部; Faculty of Communications and Informatics, Shizuoka Sangyo University
2001-01-01
It has been shown that a series of three-term recurrence relations of a certain class is a powerful tool for solving zeros of some special functions and eigenvalue problems (EVPs) of certain differential equations. Such cases include: the zeros of J_v(z); the zeros of zJ′_v(z)+HJ_v(z); the EVP of the Mathieu differential equation; and the EVP of the spheroidal wave equation. Previously by the author, it was demonstrated that the three-term recurrence relations of the class may be reformulated...
Third-order WKBJ eigenvalues for Lennard-Jones and Varshni V potentials
International Nuclear Information System (INIS)
Kesarwani, R.N.; Varshni, Y.P.
1978-01-01
The WKBJ method is applied to the third order for obtaining the eigenvalues for the fifth potential of Varshni, and the relevant integrals are analytically evaluated. Numerical results are obtained for the Lennard-Jones Potential, which is a special case of the Varshni V potential, and are compared to the results of Harrison and Bernstein obtained by a numerical integration of the wave equation. Error estimates are made. It is shown that for diatomic potentials, the Langer correction is not needed if the WKBJ approximation is carried to second and higher orders. (author)
Positive Eigenvalues of Generalized Words in Two Hermitian Positive Definite Matrices
Hillar, Christopher; Johnson, Charles R.
2005-01-01
We define a word in two positive definite (complex Hermitian) matrices $A$ and $B$ as a finite product of real powers of $A$ and $B$. The question of which words have only positive eigenvalues is addressed. This question was raised some time ago in connection with a long-standing problem in theoretical physics, and it was previously approached by the authors for words in two real positive definite matrices with positive integral exponents. A large class of words that do guarantee positive eig...
The numerical analysis of eigenvalue problem solutions in the multigroup diffusion theory
International Nuclear Information System (INIS)
Woznick, Z.I.
1994-01-01
In this paper a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations is described. Usually the solution method is based on the system of inner and outer iterations. The presented matrix formalism allows us to visualize clearly, how the used matrix splitting influences the structure of the matrix in an eigenvalue problem to be solved as well as the independence between inner and outer iterations within global iterations. To keep the page limit, the present version of the paper consists only with first three of five sections given in the original paper under the same title (which will be published soon). (author). 13 refs
The Application of Vector Fitting to Eigenvalue-based Harmonic Stability Analysis
DEFF Research Database (Denmark)
Dowlatabadi, Mohammadkazem Bakhshizadeh; Yoon, Changwoo; Hjerrild, Jesper
2017-01-01
Participation factor analysis is an interesting feature of the eigenvalue-based stability analysis in a power system, which enables the developers to identify the problematic elements in a multi-vendor project like in an offshore wind power plant. However, this method needs a full state space model...... of the elements that is not always possible to have in a competitive world due to confidentiality. In this paper, by using an identification method, the state space models for power converters are extracted from the provided data by the suppliers. Some uncertainties in the identification process are also...
A multilevel, level-set method for optimizing eigenvalues in shape design problems
International Nuclear Information System (INIS)
Haber, E.
2004-01-01
In this paper, we consider optimal design problems that involve shape optimization. The goal is to determine the shape of a certain structure such that it is either as rigid or as soft as possible. To achieve this goal we combine two new ideas for an efficient solution of the problem. First, we replace the eigenvalue problem with an approximation by using inverse iteration. Second, we use a level set method but rather than propagating the front we use constrained optimization methods combined with multilevel continuation techniques. Combining these two ideas we obtain a robust and rapid method for the solution of the optimal design problem
Solving Eigenvalue response matrix equations with Jacobian-Free Newton-Krylov methods
International Nuclear Information System (INIS)
Roberts, Jeremy A.; Forget, Benoit
2011-01-01
The response matrix method for reactor eigenvalue problems is motivated as a technique for solving coarse mesh transport equations, and the classical approach of power iteration (PI) for solution is described. The method is then reformulated as a nonlinear system of equations, and the associated Jacobian is derived. A Jacobian-Free Newton-Krylov (JFNK) method is employed to solve the system, using an approximate Jacobian coupled with incomplete factorization as a preconditioner. The unpreconditioned JFNK slightly outperforms PI, and preconditioned JFNK outperforms both PI and Steffensen-accelerated PI significantly. (author)
Spectral Method with the Tensor-Product Nodal Basis for the Steklov Eigenvalue Problem
Directory of Open Access Journals (Sweden)
Xuqing Zhang
2013-01-01
Full Text Available This paper discusses spectral method with the tensor-product nodal basis at the Legendre-Gauss-Lobatto points for solving the Steklov eigenvalue problem. A priori error estimates of spectral method are discussed, and based on the work of Melenk and Wohlmuth (2001, a posterior error estimator of the residual type is given and analyzed. In addition, this paper combines the shifted-inverse iterative method and spectral method to establish an efficient scheme. Finally, numerical experiments with MATLAB program are reported.
Computation of dominant eigenvalues and eigenvectors: A comparative study of algorithms
International Nuclear Information System (INIS)
Nightingale, M.P.; Viswanath, V.S.; Mueller, G.
1993-01-01
We investigate two widely used recursive algorithms for the computation of eigenvectors with extreme eigenvalues of large symmetric matrices---the modified Lanczoes method and the conjugate-gradient method. The goal is to establish a connection between their underlying principles and to evaluate their performance in applications to Hamiltonian and transfer matrices of selected model systems of interest in condensed matter physics and statistical mechanics. The conjugate-gradient method is found to converge more rapidly for understandable reasons, while storage requirements are the same for both methods
POSITIVE SOLUTIONS OF A NONLINEAR THREE-POINT EIGENVALUE PROBLEM WITH INTEGRAL BOUNDARY CONDITIONS
Directory of Open Access Journals (Sweden)
FAOUZI HADDOUCHI
2015-11-01
Full Text Available In this paper, we study the existence of positive solutions of a three-point integral boundary value problem (BVP for the following second-order differential equation u''(t + \\lambda a(tf(u(t = 0; 0 0 is a parameter, 0 <\\eta < 1, 0 <\\alpha < 1/{\\eta}. . By using the properties of the Green's function and Krasnoselskii's fixed point theorem on cones, the eigenvalue intervals of the nonlinear boundary value problem are considered, some sufficient conditions for the existence of at least one positive solutions are established.
International Nuclear Information System (INIS)
Davis, I.M.; Palmer, T.S.
2005-01-01
Benchmark calculations are performed for neutron transport in a two material (binary) stochastic multiplying medium. Spatial, angular, and energy dependence are included. The problem considered is based on a fuel assembly of a common pressurized water reactor. The mean chord length through the assembly is determined and used as the planar geometry system length. According to assumed or calculated material distributions, this system length is populated with alternating fuel and moderator segments of random size. Neutron flux distributions are numerically computed using a discretized form of the Boltzmann transport equation employing diffusion synthetic acceleration. Average quantities (group fluxes and k-eigenvalue) and variances are calculated from an ensemble of realizations of the mixing statistics. The effects of varying two parameters in the fuel, two different boundary conditions, and three different sets of mixing statistics are assessed. A probability distribution function (PDF) of the k-eigenvalue is generated and compared with previous research. Atomic mix solutions are compared with these benchmark ensemble average flux and k-eigenvalue solutions. Mixing statistics with large standard deviations give the most widely varying ensemble solutions of the flux and k-eigenvalue. The shape of the k-eigenvalue PDF qualitatively agrees with previous work. Its overall shape is independent of variations in fuel cross-sections for the problems considered, but its width is impacted by these variations. Statistical distributions with smaller standard deviations alter the shape of this PDF toward a normal distribution. The atomic mix approximation yields large over-predictions of the ensemble average k-eigenvalue and under-predictions of the flux. Qualitatively correct flux shapes are obtained in some cases. These benchmark calculations indicate that a model which includes higher statistical moments of the mixing statistics is needed for accurate predictions of binary
Extending the subspace hybrid method for eigenvalue problems in reactor physics calculation
International Nuclear Information System (INIS)
Zhang, Q.; Abdel-Khalik, H. S.
2013-01-01
This paper presents an innovative hybrid Monte-Carlo-Deterministic method denoted by the SUBSPACE method designed for improving the efficiency of hybrid methods for reactor analysis applications. The SUBSPACE method achieves its high computational efficiency by taking advantage of the existing correlations between desired responses. Recently, significant gains in computational efficiency have been demonstrated using this method for source driven problems. Within this work the mathematical theory behind the SUBSPACE method is introduced and extended to address core wide level k-eigenvalue problems. The method's efficiency is demonstrated based on a three-dimensional quarter-core problem, where responses are sought on the pin cell level. The SUBSPACE method is compared to the FW-CADIS method and is found to be more efficient for the utilized test problem because of the reason that the FW-CADIS method solves a forward eigenvalue problem and an adjoint fixed-source problem while the SUBSPACE method only solves an adjoint fixed-source problem. Based on the favorable results obtained here, we are confident that the applicability of Monte Carlo for large scale reactor analysis could be realized in the near future. (authors)
Fourth-order Perturbed Eigenvalue Equation for Stepwise Damage Detection of Aeroplane Wing
Directory of Open Access Journals (Sweden)
Wong Chun Nam
2016-01-01
Full Text Available Perturbed eigenvalue equations up to fourth-order are established to detect structural damage in aeroplane wing. Complete set of perturbation terms including orthogonal and non-orthogonal coefficients are computed using perturbed eigenvalue and orthonormal equations. Then the perturbed eigenparameters are optimized using BFGS approach. Finite element model with small to large stepwise damage is used to represent actual aeroplane wing. In small damaged level, termination number is the same for both approaches, while rms errors and termination d-norms are very close. For medium damaged level, termination number is larger for third-order perturbation with lower d-norm and smaller rms error. In large damaged level, termination number is much larger for third-order perturbation with same d-norm and larger rms error. These trends are more significant as the damaged level increases. As the stepwise damage effect increases with damage level, the increase in stepwise effect leads to the increase in model order. Hence, fourth-order perturbation is more accurate to estimate the model solution.
An eigenvalue approach to quantum plasmonics based on a self-consistent hydrodynamics method.
Ding, Kun; Chan, C T
2018-02-28
Plasmonics has attracted much attention not only because it has useful properties such as strong field enhancement, but also because it reveals the quantum nature of matter. To handle quantum plasmonics effects, ab initio packages or empirical Feibelman d-parameters have been used to explore the quantum correction of plasmonic resonances. However, most of these methods are formulated within the quasi-static framework. The self-consistent hydrodynamics model offers a reliable approach to study quantum plasmonics because it can incorporate the quantum effect of the electron gas into classical electrodynamics in a consistent manner. Instead of the standard scattering method, we formulate the self-consistent hydrodynamics method as an eigenvalue problem to study quantum plasmonics with electrons and photons treated on the same footing. We find that the eigenvalue approach must involve a global operator, which originates from the energy functional of the electron gas. This manifests the intrinsic nonlocality of the response of quantum plasmonic resonances. Our model gives the analytical forms of quantum corrections to plasmonic modes, incorporating quantum electron spill-out effects and electrodynamical retardation. We apply our method to study the quantum surface plasmon polariton for a single flat interface.
Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code
International Nuclear Information System (INIS)
Gill, D. F.; Nease, B. R.; Griesheimer, D. P.
2013-01-01
A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)
Code development for eigenvalue total sensitivity analysis and total uncertainty analysis
International Nuclear Information System (INIS)
Wan, Chenghui; Cao, Liangzhi; Wu, Hongchun; Zu, Tiejun; Shen, Wei
2015-01-01
Highlights: • We develop a new code for total sensitivity and uncertainty analysis. • The implicit effects of cross sections can be considered. • The results of our code agree well with TSUNAMI-1D. • Detailed analysis for origins of implicit effects is performed. - Abstract: The uncertainties of multigroup cross sections notably impact eigenvalue of neutron-transport equation. We report on a total sensitivity analysis and total uncertainty analysis code named UNICORN that has been developed by applying the direct numerical perturbation method and statistical sampling method. In order to consider the contributions of various basic cross sections and the implicit effects which are indirect results of multigroup cross sections through resonance self-shielding calculation, an improved multigroup cross-section perturbation model is developed. The DRAGON 4.0 code, with application of WIMSD-4 format library, is used by UNICORN to carry out the resonance self-shielding and neutron-transport calculations. In addition, the bootstrap technique has been applied to the statistical sampling method in UNICORN to obtain much steadier and more reliable uncertainty results. The UNICORN code has been verified against TSUNAMI-1D by analyzing the case of TMI-1 pin-cell. The numerical results show that the total uncertainty of eigenvalue caused by cross sections can reach up to be about 0.72%. Therefore the contributions of the basic cross sections and their implicit effects are not negligible
International Nuclear Information System (INIS)
Abreu, M.P.; Filho, H.A.; Barros, R.C.
1993-01-01
The authors describe a new nodal method for multigroup slab-geometry discrete ordinates S N eigenvalue problems that is completely free from all spatial truncation errors. The unknowns in the method are the node-edge angular fluxes, the node-average angular fluxes, and the effective multiplication factor k eff . The numerical values obtained for these quantities are exactly those of the dominant analytic solution of the S N eigenvalue problem apart from finite arithmetic considerations. This method is based on the use of the standard balance equation and two nonstandard auxiliary equations. In the nonmultiplying regions, e.g., the reflector, we use the multigroup spectral Green's function (SGF) auxiliary equations. In the fuel regions, we use the multigroup spectral diamond (SD) auxiliary equations. The SD auxiliary equation is an extension of the conventional auxiliary equation used in the diamond difference (DD) method. This hybrid characteristic of the SD-SGF method improves both the numerical stability and the convergence rate
An algebraic sub-structuring method for large-scale eigenvalue calculation
International Nuclear Information System (INIS)
Yang, C.; Gao, W.; Bai, Z.; Li, X.; Lee, L.; Husbands, P.; Ng, E.
2004-01-01
We examine sub-structuring methods for solving large-scale generalized eigenvalue problems from a purely algebraic point of view. We use the term 'algebraic sub-structuring' to refer to the process of applying matrix reordering and partitioning algorithms to divide a large sparse matrix into smaller submatrices from which a subset of spectral components are extracted and combined to provide approximate solutions to the original problem. We are interested in the question of which spectral components one should extract from each sub-structure in order to produce an approximate solution to the original problem with a desired level of accuracy. Error estimate for the approximation to the smallest eigenpair is developed. The estimate leads to a simple heuristic for choosing spectral components (modes) from each sub-structure. The effectiveness of such a heuristic is demonstrated with numerical examples. We show that algebraic sub-structuring can be effectively used to solve a generalized eigenvalue problem arising from the simulation of an accelerator structure. One interesting characteristic of this application is that the stiffness matrix produced by a hierarchical vector finite elements scheme contains a null space of large dimension. We present an efficient scheme to deflate this null space in the algebraic sub-structuring process
Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code
Energy Technology Data Exchange (ETDEWEB)
Gill, D. F.; Nease, B. R.; Griesheimer, D. P. [Bettis Atomic Power Laboratory, PO Box 79, West Mifflin, PA 15122 (United States)
2013-07-01
A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)
A Schur Method for Designing LQ-optimal Systems with Prescribed Eigenvalues
Directory of Open Access Journals (Sweden)
David Di Ruscio
1990-01-01
Full Text Available In this paper a new algorithm for solving the LQ-optimal pole placement problem is presented. The method studied is a variant of the classical eigenvector approach and instead uses a set of Schur vectors, thereby gaining substantial numerical advantages. An important task in this method is the LQ-optimal pole placement problem for a second order (sub system. The paper presents a detailed analytical solution to this problem. This part is not only important for solving the general n-dimensional problem but also provides an understanding of the behaviour of an optimal system: The paper shows that in some cases it is an infinite number; in others a finite number, and in still others, non state weighting matrices Q that give the system a set of prescribed eigenvalues. Equations are presented that uniquely determine these state weight matrices as a function of the new prescribed eigcnvalues. From this result we have been able to derive the maximum possible imaginary part of the eigenvalues in an LQ-optimal system, irrespective of how the state weight matrix is chosen.
Leibfried, D.; Wineland, D. J.
2018-03-01
Effective spin-spin interactions between ? qubits enable the determination of the eigenvalue of an arbitrary Pauli product of dimension N with a constant, small number of multi-qubit gates that is independent of N and encodes the eigenvalue in the measurement basis states of an extra ancilla qubit. Such interactions are available whenever qubits can be coupled to a shared harmonic oscillator, a situation that can be realized in many physical qubit implementations. For example, suitable interactions have already been realized for up to 14 qubits in ion traps. It should be possible to implement stabilizer codes for quantum error correction with a constant number of multi-qubit gates, in contrast to typical constructions with a number of two-qubit gates that increases as a function of N. The special case of finding the parity of N qubits only requires a small number of operations that is independent of N. This compares favorably to algorithms for computing the parity on conventional machines, which implies a genuine quantum advantage.
Energy Technology Data Exchange (ETDEWEB)
Garattini, Remo [Univ. degli Studi di Bergamo, Dalmine (Italy). Dept. of Engineering and Applied Sciences; I.N.F.N., Sezione di Milano, Milan (Italy); De Laurentis, Mariafelicia [Tomsk State Pedagogical Univ. (Russian Federation). Dept. of Theoretical Physics; INFN, Sezione di Napoli (Italy); Complutense Univ. di Monte S. Angelo, Napoli (Italy)
2017-01-15
In the framework of a Varying Speed of Light theory, we study the eigenvalues associated with the Wheeler-DeWitt equation representing the vacuum expectation values associated with the cosmological constant. We find that the Wheeler-DeWitt equation for the Friedmann-Lemaitre-Robertson-Walker metric is completely equivalent to a Sturm-Liouville problem provided that the related eigenvalue and the cosmological constant be identified. The explicit calculation is performed with the help of a variational procedure with trial wave functionals related to the Bessel function of the second kind K{sub ν}(x). After having verified that in ordinary General Relativity no eigenvalue appears, we find that in a Varying Speed of Light theory this is not the case. Nevertheless, instead of a single eigenvalue, we discover the existence of a family of eigenvalues associated to a negative power of the scale. A brief comment on what happens at the inflationary scale is also included. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)
International Nuclear Information System (INIS)
Hwang, F-N; Wei, Z-H; Huang, T-M; Wang Weichung
2010-01-01
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc's efficient and various parallel operations, linear solvers, preconditioning schemes, and easy usages. The parallel eigenvalue solver is then used to solve higher degree polynomial eigenvalue problems arising in numerical simulations of three dimensional quantum dots governed by Schroedinger's equations. We find that the parallel restricted additive Schwarz preconditioner in conjunction with a parallel Krylov subspace method (e.g. GMRES) can solve the correction equations, the most costly step in the Jacobi-Davidson algorithm, very efficiently in parallel. Besides, the overall performance is quite satisfactory. We have observed near perfect superlinear speedup by using up to 320 processors. The parallel eigensolver can find all target interior eigenpairs of a quintic polynomial eigenvalue problem with more than 32 million variables within 12 minutes by using 272 Intel 3.0 GHz processors.
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.
Advanced Variance Reduction for Global k-Eigenvalue Simulations in MCNP
Energy Technology Data Exchange (ETDEWEB)
Edward W. Larsen
2008-06-01
The "criticality" or k-eigenvalue of a nuclear system determines whether the system is critical (k=1), or the extent to which it is subcritical (k<1) or supercritical (k>1). Calculations of k are frequently performed at nuclear facilities to determine the criticality of nuclear reactor cores, spent nuclear fuel storage casks, and other fissile systems. These calculations can be expensive, and current Monte Carlo methods have certain well-known deficiencies. In this project, we have developed and tested a new "functional Monte Carlo" (FMC) method that overcomes several of these deficiencies. The current state-of-the-art Monte Carlo k-eigenvalue method estimates the fission source for a sequence of fission generations (cycles), during each of which M particles per cycle are processed. After a series of "inactive" cycles during which the fission source "converges," a series of "active" cycles are performed. For each active cycle, the eigenvalue and eigenfunction are estimated; after N >> 1 active cycles are performed, the results are averaged to obtain estimates of the eigenvalue and eigenfunction and their standard deviations. This method has several disadvantages: (i) the estimate of k depends on the number M of particles per cycle, (iii) for optically thick systems, the eigenfunction estimate may not converge due to undersampling of the fission source, and (iii) since the fission source in any cycle depends on the estimated fission source from the previous cycle (the fission sources in different cycles are correlated), the estimated variance in k is smaller than the real variance. For an acceptably large number M of particles per cycle, the estimate of k is nearly independent of M; this essentially takes care of item (i). Item (ii) can be addressed by taking M sufficiently large, but for optically thick systems a sufficiently large M can easily be unrealistic. Item (iii) cannot be accounted for by taking M or N sufficiently large; it is an inherent deficiency due
On the generalized eigenvalue method for energies and matrix elements in lattice field theory
Energy Technology Data Exchange (ETDEWEB)
Blossier, Benoit [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)]|[Paris-XI Univ., 91 - Orsay (France). Lab. de Physique Theorique; Morte, Michele della [CERN, Geneva (Switzerland). Physics Dept.]|[Mainz Univ. (Germany). Inst. fuer Kernphysik; Hippel, Georg von; Sommer, Rainer [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Mendes, Tereza [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)]|[Sao Paulo Univ. (Brazil). IFSC
2009-02-15
We discuss the generalized eigenvalue problem for computing energies and matrix elements in lattice gauge theory, including effective theories such as HQET. It is analyzed how the extracted effective energies and matrix elements converge when the time separations are made large. This suggests a particularly efficient application of the method for which we can prove that corrections vanish asymptotically as exp(-(E{sub N+1}-E{sub n}) t). The gap E{sub N+1}-E{sub n} can be made large by increasing the number N of interpolating fields in the correlation matrix. We also show how excited state matrix elements can be extracted such that contaminations from all other states disappear exponentially in time. As a demonstration we present numerical results for the extraction of ground state and excited B-meson masses and decay constants in static approximation and to order 1/m{sub b} in HQET. (orig.)
An Approximate Proximal Bundle Method to Minimize a Class of Maximum Eigenvalue Functions
Directory of Open Access Journals (Sweden)
Wei Wang
2014-01-01
Full Text Available We present an approximate nonsmooth algorithm to solve a minimization problem, in which the objective function is the sum of a maximum eigenvalue function of matrices and a convex function. The essential idea to solve the optimization problem in this paper is similar to the thought of proximal bundle method, but the difference is that we choose approximate subgradient and function value to construct approximate cutting-plane model to solve the above mentioned problem. An important advantage of the approximate cutting-plane model for objective function is that it is more stable than cutting-plane model. In addition, the approximate proximal bundle method algorithm can be given. Furthermore, the sequences generated by the algorithm converge to the optimal solution of the original problem.
International Nuclear Information System (INIS)
Chung, N. N.; Chew, L. Y.
2007-01-01
We have generalized the two-step approach to the solution of systems of N coupled quantum anharmonic oscillators. By using the squeezed vacuum state of each individual oscillator, we construct the tensor product state, and obtain the optimal squeezed vacuum product state through energy minimization. We then employ this optimal state and its associated bosonic operators to define a basis set to construct the Heisenberg matrix. The diagonalization of the matrix enables us to obtain the energy eigenvalues of the coupled oscillators. In particular, we have applied our formalism to determine the eigenenergies of systems of two coupled quantum anharmonic oscillators perturbed by a general polynomial potential, as well as three and four coupled systems. Furthermore, by performing a first-order perturbation analysis about the optimal squeezed vacuum product state, we have also examined into the squeezing properties of two coupled oscillator systems
International Nuclear Information System (INIS)
Das, Sonjoy; Goswami, Kundan; Datta, Biswa N.
2014-01-01
Failure of structural systems under dynamic loading can be prevented via active vibration control which shifts the damped natural frequencies of the systems away from the dominant range of loading spectrum. The damped natural frequencies and the dynamic load typically show significant variations in practice. A computationally efficient methodology based on quadratic partial eigenvalue assignment technique and optimization under uncertainty has been formulated in the present work that will rigorously account for these variations and result in an economic and resilient design of structures. A novel scheme based on hierarchical clustering and importance sampling is also developed in this work for accurate and efficient estimation of probability of failure to guarantee the desired resilience level of the designed system. Numerical examples are presented to illustrate the proposed methodology
On a Volume Constrained for the First Eigenvalue of the P-Laplacian Operator
International Nuclear Information System (INIS)
Ly, Idrissa
2009-10-01
In this paper, we are interested in a shape optimization problem which consists in minimizing the functional that associates to an open set the first eigenvalue for p-Laplacian operator with homogeneous boundary condition. The minimum is taken among all open subsets with prescribed measure of a given bounded domain. We study an existence result for the associate variational problem. Our technique consists in enlarging the class of admissible functions to the whole space W 0 1,p (D), penalizing those functions whose level sets have a measure which is less than those required. In fact, we study the minimizers of a family of penalized functionals J λ , λ > 0 showing they are Hoelder continuous. And we prove that such functions minimize the initial problem provided the penalization parameter λ is large enough. (author)
Energy Technology Data Exchange (ETDEWEB)
Das, Sonjoy; Goswami, Kundan [University at Buffalo, NY (United States); Datta, Biswa N. [Northern Illinois University, IL (United States)
2014-12-10
Failure of structural systems under dynamic loading can be prevented via active vibration control which shifts the damped natural frequencies of the systems away from the dominant range of loading spectrum. The damped natural frequencies and the dynamic load typically show significant variations in practice. A computationally efficient methodology based on quadratic partial eigenvalue assignment technique and optimization under uncertainty has been formulated in the present work that will rigorously account for these variations and result in an economic and resilient design of structures. A novel scheme based on hierarchical clustering and importance sampling is also developed in this work for accurate and efficient estimation of probability of failure to guarantee the desired resilience level of the designed system. Numerical examples are presented to illustrate the proposed methodology.
International Nuclear Information System (INIS)
Nishida, Takahiko; Horikami, Kunihiko; Suzuki, Tadakazu; Nakahara, Yasuaki; Taji, Yukichi
1975-09-01
The coarse-mesh rebalancing technique is introduced into the general-purpose neutron and gamma-ray Monte Carlo transport code MORSE, to accelerate the convergence rate of the iteration process for eigenvalue calculation in a nuclear reactor system. Two subroutines are thus attached to the code. One is bookkeeping routine 'COARSE' for obtaining the quantities related with the neutron balance in each coarse mesh cell, such as the number of neutrons absorbed in the cell, from random walks of neutrons in a batch. The other is rebalance factor calculation routine 'REBAL' for obtaining the scaling factor whereby the neutron flux in the cell is multiplied to attain the neutron balance. The two subroutines and algorithm of the coarse mesh rebalancing acceleration in a Monte Carlo game are described. (auth.)
No Eigenvalues Outside the Limiting Support of Generally Correlated Gaussian Matrices
Kammoun, Abla
2016-05-04
This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their columns and that of their rows grow at infinity with the same pace. Following the approach proposed in [1], we prove that under some mild conditions, there is no eigenvalue outside the limiting support of generally correlated Gaussian matrices. As an outcome of this result, we establish that the smallest singular value of these matrices is almost surely greater than zero. From a practical perspective, this control of the smallest singular value is paramount to applications from statistical signal processing and wireless communication, in which this kind of matrices naturally arise.
Eigenvalues of the Laplacian and of the Hecke operators for PSL(2,Z)
International Nuclear Information System (INIS)
Steil, G.
1994-03-01
A new method is described to compute with high accuracy a large number of eigenvalues and eigenfunctions (Maass wave forms) of the Laplacian and of the Hecke operators for the modular group. It relies essentially on the theory of Hecke operators. The results of the computations confirm some important conjectures from number theory, namely Ramanujan-Petersson, Sato-Tate, and the conjecture that the discrete spectrum of the Laplacian be simple. Examples of the numerical data are included as a reference. The algorithm can be generalized to other non-cocompact but cofinite arithmetic groups, like Picard group PSL(2, Z)[i]) and Hecke triangle groups Γ(√2) and Γ(√3). (orig.)
Schwartz, L M; Bergman, D J; Dunn, K J; Mitra, P P
1996-01-01
Random walk computer simulations are an important tool in understanding magnetic resonance measurements in porous media. In this paper we focus on the description of pulsed field gradient spin echo (PGSE) experiments that measure the probability, P(R,t), that a diffusing water molecule will travel a distance R in a time t. Because PGSE simulations are often limited by statistical considerations, we will see that valuable insight can be gained by working with simple periodic geometries and comparing simulation data to the results of exact eigenvalue expansions. In this connection, our attention will be focused on (1) the wavevector, k, and time dependent magnetization, M(k, t); and (2) the normalized probability, Ps(delta R, t), that a diffusing particle will return to within delta R of the origin after time t.
International Nuclear Information System (INIS)
Densmore, Jeffery D.; Larsen, Edward W.
2003-01-01
The Variational Variance Reduction (VVR) method is an effective technique for increasing the efficiency of Monte Carlo simulations [Ann. Nucl. Energy 28 (2001) 457; Nucl. Sci. Eng., in press]. This method uses a variational functional, which employs first-order estimates of forward and adjoint fluxes, to yield a second-order estimate of a desired system characteristic - which, in this paper, is the criticality eigenvalue k. If Monte Carlo estimates of the forward and adjoint fluxes are used, each having global 'first-order' errors of O(1/√N), where N is the number of histories used in the Monte Carlo simulation, then the statistical error in the VVR estimation of k will in principle be O(1/N). In this paper, we develop this theoretical possibility and demonstrate with numerical examples that implementations of the VVR method for criticality problems can approximate O(1/N) convergence for significantly large values of N
No Eigenvalues Outside the Limiting Support of Generally Correlated Gaussian Matrices
Kammoun, Abla; Alouini, Mohamed-Slim
2016-01-01
This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their columns and that of their rows grow at infinity with the same pace. Following the approach proposed in [1], we prove that under some mild conditions, there is no eigenvalue outside the limiting support of generally correlated Gaussian matrices. As an outcome of this result, we establish that the smallest singular value of these matrices is almost surely greater than zero. From a practical perspective, this control of the smallest singular value is paramount to applications from statistical signal processing and wireless communication, in which this kind of matrices naturally arise.
The discrete hungry Lotka Volterra system and a new algorithm for computing matrix eigenvalues
Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa
2009-01-01
The discrete hungry Lotka-Volterra (dhLV) system is a generalization of the discrete Lotka-Volterra (dLV) system which stands for a prey-predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix.
Nature of complex time eigenvalues of the one speed transport equation in a homogeneous sphere
International Nuclear Information System (INIS)
Dahl, E.B.; Sahni, D.C.
1990-01-01
The complex time eigenvalues of the transport equation have been studied for one speed neutrons, scattered isotropically in a homogeneous sphere with vacuum boundary conditions. It is shown that the complex decay constants vary continuously with the radius of the sphere. Our earlier conjecture (Dahl and Sahni (1983-84)) regarding disjoint arcs is thus shown to be true. We also indicate that complex decay constants exist even for large assemblies, though with rapid oscillations in the corresponding eigenvectors. These modes cannot be predicted by the diffusion equation as this behaviour of the eigenvectors contradicts the assumption of 'slowly varying flux' needed to derive the diffusion approximation from the transport equation. For an infinite system, the existence of complex modes is related to the solution of a homogeneous equation. (author)
An algebraic approach to the inverse eigenvalue problem for a quantum system with a dynamical group
International Nuclear Information System (INIS)
Wang, S.J.
1993-04-01
An algebraic approach to the inverse eigenvalue problem for a quantum system with a dynamical group is formulated for the first time. One dimensional problem is treated explicitly in detail for both the finite dimensional and infinite dimensional Hilbert spaces. For the finite dimensional Hilbert space, the su(2) algebraic representation is used; while for the infinite dimensional Hilbert space, the Heisenberg-Weyl algebraic representation is employed. Fourier expansion technique is generalized to the generator space, which is suitable for analysis of irregular spectra. The polynormial operator basis is also used for complement, which is appropriate for analysis of some simple Hamiltonians. The proposed new approach is applied to solve the classical inverse Sturn-Liouville problem and to study the problems of quantum regular and irregular spectra. (orig.)
On the generalized eigenvalue method for energies and matrix elements in lattice field theory
International Nuclear Information System (INIS)
Blossier, Benoit; Mendes, Tereza; Sao Paulo Univ.
2009-02-01
We discuss the generalized eigenvalue problem for computing energies and matrix elements in lattice gauge theory, including effective theories such as HQET. It is analyzed how the extracted effective energies and matrix elements converge when the time separations are made large. This suggests a particularly efficient application of the method for which we can prove that corrections vanish asymptotically as exp(-(E N+1 -E n ) t). The gap E N+1 -E n can be made large by increasing the number N of interpolating fields in the correlation matrix. We also show how excited state matrix elements can be extracted such that contaminations from all other states disappear exponentially in time. As a demonstration we present numerical results for the extraction of ground state and excited B-meson masses and decay constants in static approximation and to order 1/m b in HQET. (orig.)
The eigenvalue problem. Alpha, lambda and gamma modes and its applications
International Nuclear Information System (INIS)
Carreno, A.; Vidal-Ferrandiz, A.; Verdu, G.; Ginestar, D.
2017-01-01
Modal analysis has been efficiently used to study different problems in reactor physics. In this sense, several eigenvalue problems can be defined for neutron transport equation: the λ-modes, the γ-modes and the α-modes. However, for simplicity, the neutron diffusion equation is used as approximation of each one of these equations that they have been discretized by a high order finite elements. The obtained algebraic eigenproblems are large problems and have to be solved using iterative methods. In this work, we analyze two methods. The first one is the Krylov-Schur method and the second one is the modified block Newton method. The comparison of modes and the performance of these methods have been studied in two benchmark problems, a homogeneous 3D reactor and the 3D Langenbuch reactor. (author)
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
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.
The discrete hungry Lotka–Volterra system and a new algorithm for computing matrix eigenvalues
International Nuclear Information System (INIS)
Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa
2009-01-01
The discrete hungry Lotka–Volterra (dhLV) system is a generalization of the discrete Lotka–Volterra (dLV) system which stands for a prey–predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix
International Nuclear Information System (INIS)
Asadzadeh, M.; Thevenot, L.
2010-01-01
The objective of this paper is to give a mathematical framework for a fully discrete numerical approach for the study of the neutron transport equation in a cylindrical domain (container model,). More specifically, we consider the discontinuous Galerkin (D G) finite element method for spatial approximation of the mono-energetic, critical neutron transport equation in an infinite cylindrical domain ??in R3 with a polygonal convex cross-section ? The velocity discretization relies on a special quadrature rule developed to give optimal estimates in discrete ordinate parameters compatible with the quasi-uniform spatial mesh. We use interpolation spaces and derive optimal error estimates, up to maximal available regularity, for the fully discrete scalar flux. Finally we employ a duality argument and prove superconvergence estimates for the critical eigenvalue.
On the ratio probability of the smallest eigenvalues in the Laguerre unitary ensemble
Atkin, Max R.; Charlier, Christophe; Zohren, Stefan
2018-04-01
We study the probability distribution of the ratio between the second smallest and smallest eigenvalue in the Laguerre unitary ensemble. The probability that this ratio is greater than r > 1 is expressed in terms of an Hankel determinant with a perturbed Laguerre weight. The limiting probability distribution for the ratio as is found as an integral over containing two functions q 1(x) and q 2(x). These functions satisfy a system of two coupled Painlevé V equations, which are derived from a Lax pair of a Riemann-Hilbert problem. We compute asymptotic behaviours of these functions as and , as well as large n asymptotics for the associated Hankel determinants in several regimes of r and x.
Energy Technology Data Exchange (ETDEWEB)
Stathopoulos, A.; Fischer, C.F. [Vanderbilt Univ., Nashville, TN (United States); Saad, Y.
1994-12-31
The solution of the large, sparse, symmetric eigenvalue problem, Ax = {lambda}x, is central to many scientific applications. Among many iterative methods that attempt to solve this problem, the Lanczos and the Generalized Davidson (GD) are the most widely used methods. The Lanczos method builds an orthogonal basis for the Krylov subspace, from which the required eigenvectors are approximated through a Rayleigh-Ritz procedure. Each Lanczos iteration is economical to compute but the number of iterations may grow significantly for difficult problems. The GD method can be considered a preconditioned version of Lanczos. In each step the Rayleigh-Ritz procedure is solved and explicit orthogonalization of the preconditioned residual ((M {minus} {lambda}I){sup {minus}1}(A {minus} {lambda}I)x) is performed. Therefore, the GD method attempts to improve convergence and robustness at the expense of a more complicated step.
Multigrid method applied to the solution of an elliptic, generalized eigenvalue problem
Energy Technology Data Exchange (ETDEWEB)
Alchalabi, R.M. [BOC Group, Murray Hill, NJ (United States); Turinsky, P.J. [North Carolina State Univ., Raleigh, NC (United States)
1996-12-31
The work presented in this paper is concerned with the development of an efficient MG algorithm for the solution of an elliptic, generalized eigenvalue problem. The application is specifically applied to the multigroup neutron diffusion equation which is discretized by utilizing the Nodal Expansion Method (NEM). The underlying relaxation method is the Power Method, also known as the (Outer-Inner Method). The inner iterations are completed using Multi-color Line SOR, and the outer iterations are accelerated using Chebyshev Semi-iterative Method. Furthermore, the MG algorithm utilizes the consistent homogenization concept to construct the restriction operator, and a form function as a prolongation operator. The MG algorithm was integrated into the reactor neutronic analysis code NESTLE, and numerical results were obtained from solving production type benchmark problems.
Solution of the Fokker-Planck equation with a logarithmic potential and mixed eigenvalue spectrum
Guarnieri, F.; Moon, W.; Wettlaufer, J. S.
2017-09-01
Motivated by a problem in climate dynamics, we investigate the solution of a Bessel-like process with a negative constant drift, described by a Fokker-Planck equation with a potential V (x ) =-[b ln(x ) +a x ] , for b >0 and a finance. The Bessel-like process we consider can be solved by seeking solutions through an expansion into a complete set of eigenfunctions. The associated imaginary-time Schrödinger equation exhibits a mix of discrete and continuous eigenvalue spectra, corresponding to the quantum Coulomb potential describing the bound states of the hydrogen atom. We present a technique to evaluate the normalization factor of the continuous spectrum of eigenfunctions that relies solely upon their asymptotic behavior. We demonstrate the technique by solving the Brownian motion problem and the Bessel process both with a constant negative drift. We conclude with a comparison to other analytical methods and with numerical solutions.
Fast EEG spike detection via eigenvalue analysis and clustering of spatial amplitude distribution
Fukami, Tadanori; Shimada, Takamasa; Ishikawa, Bunnoshin
2018-06-01
Objective. In the current study, we tested a proposed method for fast spike detection in electroencephalography (EEG). Approach. We performed eigenvalue analysis in two-dimensional space spanned by gradients calculated from two neighboring samples to detect high-amplitude negative peaks. We extracted the spike candidates by imposing restrictions on parameters regarding spike shape and eigenvalues reflecting detection characteristics of individual medical doctors. We subsequently performed clustering, classifying detected peaks by considering the amplitude distribution at 19 scalp electrodes. Clusters with a small number of candidates were excluded. We then defined a score for eliminating spike candidates for which the pattern of detected electrodes differed from the overall pattern in a cluster. Spikes were detected by setting the score threshold. Main results. Based on visual inspection by a psychiatrist experienced in EEG, we evaluated the proposed method using two statistical measures of precision and recall with respect to detection performance. We found that precision and recall exhibited a trade-off relationship. The average recall value was 0.708 in eight subjects with the score threshold that maximized the F-measure, with 58.6 ± 36.2 spikes per subject. Under this condition, the average precision was 0.390, corresponding to a false positive rate 2.09 times higher than the true positive rate. Analysis of the required processing time revealed that, using a general-purpose computer, our method could be used to perform spike detection in 12.1% of the recording time. The process of narrowing down spike candidates based on shape occupied most of the processing time. Significance. Although the average recall value was comparable with that of other studies, the proposed method significantly shortened the processing time.
International Nuclear Information System (INIS)
Eaker, C.W.; Schatz, G.C.; De Leon, N.; Heller, E.J.
1984-01-01
Two methods for calculating the good action variables and semiclassical eigenvalues for coupled oscillator systems are presented, both of which relate the actions to the coefficients appearing in the Fourier representation of the normal coordinates and momenta. The two methods differ in that one is based on the exact expression for the actions together with the EBK semiclassical quantization condition while the other is derived from the Sorbie--Handy (SH) approximation to the actions. However, they are also very similar in that the actions in both methods are related to the same set of Fourier coefficients and both require determining the perturbed frequencies in calculating actions. These frequencies are also determined from the Fourier representations, which means that the actions in both methods are determined from information entirely contained in the Fourier expansion of the coordinates and momenta. We show how these expansions can very conveniently be obtained from fast Fourier transform (FFT) methods and that numerical filtering methods can be used to remove spurious Fourier components associated with the finite trajectory integration duration. In the case of the SH based method, we find that the use of filtering enables us to relax the usual periodicity requirement on the calculated trajectory. Application to two standard Henon--Heiles models is considered and both are shown to give semiclassical eigenvalues in good agreement with previous calculations for nondegenerate and 1:1 resonant systems. In comparing the two methods, we find that although the exact method is quite general in its ability to be used for systems exhibiting complex resonant behavior, it converges more slowly with increasing trajectory integration duration and is more sensitive to the algorithm for choosing perturbed frequencies than the SH based method
International Nuclear Information System (INIS)
Emel'yanenko, G.A.; Sek, I.E.
1988-01-01
Many correctable unknown methods for eigenvalue calculation of general tridiagonal matrices with real elements; criteria of singular tridiagonal matrices; necessary and sufficient conditions of tridiagonal matrix degeneracy; process with boundary conditions according to calculation processes of general upper and lower tridiagonal matrix minors are obtained. 6 refs
Czech Academy of Sciences Publication Activity Database
Kučera, Milan; Navrátil, J.
2018-01-01
Roč. 166, January (2018), s. 154-180 ISSN 0362-546X Institutional support: RVO:67985840 Keywords : global bifurcation * maximal eigenvalue * positively homogeneous operators Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.192, year: 2016 http://www. science direct.com/ science /article/pii/S0362546X17302559?via%3Dihub
Alexandrov, Theodore; Golyandina, Nina; Timofeyev, Alexey
2009-02-26
This paper is devoted to estimation of parameters for a noisy sum of two real exponential functions. Singular Spectrum Analysis is used to extract the signal subspace and then the ESPRIT method exploiting signal subspace features is applied to obtain estimates of the desired exponential rates. Dependence of estimation quality on signal eigenvalues is investigated. The special design to test this relation is elaborated.
Jarlebring, E.; Hochstenbach, M.E.
2009-01-01
Several recent methods used to analyze asymptotic stability of delay-differential equations (DDEs) involve determining the eigenvalues of a matrix, a matrix pencil or a matrix polynomial constructed by Kronecker products. Despite some similarities between the different types of these so-called
Czech Academy of Sciences Publication Activity Database
Kučera, Milan; Navrátil, J.
2018-01-01
Roč. 166, January (2018), s. 154-180 ISSN 0362-546X Institutional support: RVO:67985840 Keywords : global bifurcation * maximal eigenvalue * positively homogeneous operators Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.192, year: 2016 http://www.sciencedirect.com/science/article/pii/S0362546X17302559?via%3Dihub
Bourne, D.P.; Elman, H.; Osborn, J.E.
2009-01-01
This paper is the second part of a two-part paper treating a non-self-adjoint quadratic eigenvalue problem for the linear stability of solutions to the Taylor-Couette problem for flow of a viscous liquid in a deformable cylinder, with the cylinder modelled as a membrane. The first part formulated
International Nuclear Information System (INIS)
Wei Yi; Fyodorov, Yan V
2008-01-01
Given any fixed N x N positive semi-definite diagonal matrix G ≥ 0 we derive the explicit formula for the density of complex eigenvalues for random matrices A of the form A=U√G where the random unitary matrices U are distributed on the group U(N) according to the Haar measure. (fast track communication)
International Nuclear Information System (INIS)
Kanki, Takashi; Uyama, Tadao; Tokuda, Shinji.
1995-07-01
In the numerical method to compute the matching data which are necessary for resistive MHD stability analyses, it is required to solve the eigenvalue problem and the associated singular equation. An iterative method is developed to solve the eigenvalue problem and the singular equation. In this method, the eigenvalue problem is replaced with an equivalent nonlinear equation and a singular equation is derived from Newton's method for the nonlinear equation. The multi-grid method (MGM), a high speed iterative method, can be applied to this method. The convergence of the eigenvalue and the eigenvector, and the CPU time in this method are investigated for a model equation. It is confirmed from the numerical results that this method is effective for solving the eigenvalue problem and the singular equation with numerical stability and high accuracy. It is shown by improving the MGM that the CPU time for this method is 50 times shorter than that of the direct method. (author)
A nonlinear eigenvalue problem for self-similar spherical force-free magnetic fields
Energy Technology Data Exchange (ETDEWEB)
Lerche, I. [Institut für Geowissenschaften, Naturwissenschaftliche Fakultät III, Martin-Luther Universität, D-06099 Halle (Germany); Low, B. C. [High Altitude Observatory, National Center for Atmospheric Research, Boulder, Colorado 80307 (United States)
2014-10-15
An axisymmetric force-free magnetic field B(r, θ) in spherical coordinates is defined by a function r sin θB{sub φ}=Q(A) relating its azimuthal component to its poloidal flux-function A. The power law r sin θB{sub φ}=aA|A|{sup 1/n}, n a positive constant, admits separable fields with A=(A{sub n}(θ))/(r{sup n}) , posing a nonlinear boundary-value problem for the constant parameter a as an eigenvalue and A{sub n}(θ) as its eigenfunction [B. C. Low and Y. Q Lou, Astrophys. J. 352, 343 (1990)]. A complete analysis is presented of the eigenvalue spectrum for a given n, providing a unified understanding of the eigenfunctions and the physical relationship between the field's degree of multi-polarity and rate of radial decay via the parameter n. These force-free fields, self-similar on spheres of constant r, have basic astrophysical applications. As explicit solutions they have, over the years, served as standard benchmarks for testing 3D numerical codes developed to compute general force-free fields in the solar corona. The study presented includes a set of illustrative multipolar field solutions to address the magnetohydrodynamics (MHD) issues underlying the observation that the solar corona has a statistical preference for negative and positive magnetic helicities in its northern and southern hemispheres, respectively; a hemispherical effect, unchanging as the Sun's global field reverses polarity in successive eleven-year cycles. Generalizing these force-free fields to the separable form B=(H(θ,φ))/(r{sup n+2}) promises field solutions of even richer topological varieties but allowing for φ-dependence greatly complicates the governing equations that have remained intractable. The axisymmetric results obtained are discussed in relation to this generalization and the Parker Magnetostatic Theorem. The axisymmetric solutions are mathematically related to a family of 3D time-dependent ideal MHD solutions for a polytropic fluid of index γ = 4
Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem
International Nuclear Information System (INIS)
Du, X.; Liu, T.; Ji, W.; Xu, X. G.; Brown, F. B.
2013-01-01
Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER GPU code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)
Energy Technology Data Exchange (ETDEWEB)
Wang, C.; Abdel-Khalik, H. S. [Dept. of Nuclear Engineering, North Caroline State Univ., Raleigh, NC 27695 (United States)
2012-07-01
The construction of surrogate models for high fidelity models is now considered an important objective in support of all engineering activities which require repeated execution of the simulation, such as verification studies, validation exercises, and uncertainty quantification. The surrogate must be computationally inexpensive to allow its repeated execution, and must be computationally accurate in order for its predictions to be credible. This manuscript introduces a new surrogate construction approach that reduces the dimensionality of the state solution via a range-finding algorithm from linear algebra. It then employs a proper orthogonal decomposition-like approach to solve for the reduced state. The algorithm provides an upper bound on the error resulting from the reduction. Different from the state-of-the-art, the new approach allows the user to define the desired accuracy a priori which controls the maximum allowable reduction. We demonstrate the utility of this approach using an eigenvalue radiation diffusion model, where the accuracy is selected to match machine precision. Results indicate that significant reduction is possible for typical reactor assembly models, which are currently considered expensive given the need to employ very fine mesh many group calculations to ensure the highest possible fidelity for the downstream core calculations. Given the potential for significant reduction in the computational cost, we believe it is possible to rethink the manner in which homogenization theory is currently employed in reactor design calculations. (authors)
An Extremal Eigenvalue Problem for a Two-Phase Conductor in a Ball
International Nuclear Information System (INIS)
Conca, Carlos; Mahadevan, Rajesh; Sanz, Leon
2009-01-01
The pioneering works of Murat and Tartar (Topics in the mathematical modeling of composite materials. PNLDE 31. Birkhaeuser, Basel, 1997) go a long way in showing, in general, that problems of optimal design may not admit solutions if microstructural designs are excluded from consideration. Therefore, assuming, tactilely, that the problem of minimizing the first eigenvalue of a two-phase conducting material with the conducting phases to be distributed in a fixed proportion in a given domain has no true solution in general domains, Cox and Lipton only study conditions for an optimal microstructural design (Cox and Lipton in Arch. Ration. Mech. Anal. 136:101-117, 1996). Although, the problem in one dimension has a solution (cf. Krein in AMS Transl. Ser. 2(1):163-187, 1955) and, in higher dimensions, the problem set in a ball can be deduced to have a radially symmetric solution (cf. Alvino et al. in Nonlinear Anal. TMA 13(2):185-220, 1989), these existence results have been regarded so far as being exceptional owing to complete symmetry. It is still not clear why the same problem in domains with partial symmetry should fail to have a solution which does not develop microstructure and respecting the symmetry of the domain. We hope to revive interest in this question by giving a new proof of the result in a ball using a simpler symmetrization result from Alvino and Trombetti (J. Math. Anal. Appl. 94:328-337, 1983)
HERESY, 2-D Few-Group Static Eigenvalues Calculation for Thermal Reactor
International Nuclear Information System (INIS)
Finch, D.R.
1965-01-01
1 - Description of problem or function: HERESY3 solves the two- dimensional, few-group, static reactor eigenvalue problem using the heterogeneous (source-sink or Feinburg-Galanin) formalism. The solution yields the reactor k-effective and absorption reaction rates for each rod normalized to the most absorptive rod in the thermal level. Epithermal fissions are allowed at each resonance level, and lattice-averaged values of thermal utilization, resonance escape probability, thermal and resonance eta values, and the fast fission factor are calculated. Kernels in the calculation are based on age-diffusion theory. Both finite reactor lattices and infinitely repeating reactor super-cells may be calculated. Rod parameters may be calculated by several internal options, and a direct interface is provided to a HAMMER system (NESC Abstract 277) lattice library tape to obtain cell parameters. Criticality searches are provided on thermal utilization, thermal eta, and axial leakage buckling. 2 - Method of solution: Direct power iteration on matrix form of the heterogeneous critical equation is used. 3 - Restrictions on the complexity of the problem: Maxima of - 50 flux/geometry symmetry positions; 20 physically different assemblies; 9 resonance levels; 5000 rod coordinate positions
International Nuclear Information System (INIS)
Gurbanovich, N.S.; Zelenskaya, I.N.
1976-01-01
The solution for eigenfunction and eigenvalue for effective Hamiltonians anti Hsub(p) in two-particle channels corresponding to division of four particles into groups (3.1) and (2.2) is very essential in the four-body problem as applied to nuclear reactions. The interaction of anti√sub(p) in each channel may be written in the form of an integral operator which takes account of the structure of a target nucleus or of an incident particle and satisfying the integral equation. While assuming the two-particle potentials to be central, it is possible to expand the effective interactions anti√sub(p) in partial waves and write the radial equation for anti Hsub(p). In the approximation on a mass shell the radial equations for the eigenfunctions of Hsub(p) are reduced to an algebraic equations system. The coefficients of the latter are expressed through the Fourier images for products of wave functions of bound clusters and the two-particle central potential which are localized in a momentum space
Quantum complex rotation and uniform semiclassical calculations of complex energy eigenvalues
International Nuclear Information System (INIS)
Connor, J.N.L.; Smith, A.D.
1983-01-01
Quantum and semiclassical calculations of complex energy eigenvalues have been carried out for an exponential potential of the form V 0 r 2 exp(-r) and Lennard-Jones (12,6) potential. A straightforward method, based on the complex coordinate rotation technique, is described for the quantum calculation of complex eigenenergies. For singular potentials, the method involves an inward and outward integration of the radial Schroedinger equation, followed by matching of the logarithmic derivatives of the wave functions at an intermediate point. For regular potentials, the method is simpler, as only an inward integration is required. Attention is drawn to the World War II researches of Hartree and co-workers who anticipated later quantum mechanical work on the complex rotation method. Complex eigenenergies are also calculated from a uniform semiclassical three turning point quantization formula, which allows for the proximity of the outer pair of complex turning points. Limiting cases of this formula, which are valid for very narrow or very broad widths, are also used in the calculations. We obtain good agreement between the semiclassical and quantum results. For the Lennard-Jones (12,6) potential, we compare resonance energies and widths from the complex energy definition of a resonance with those obtained from the time delay definition
Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem
Energy Technology Data Exchange (ETDEWEB)
Du, X.; Liu, T.; Ji, W.; Xu, X. G. [Nuclear Engineering Program, Rensselaer Polytechnic Institute, Troy, NY 12180 (United States); Brown, F. B. [Monte Carlo Codes Group, Los Alamos National Laboratory, Los Alamos, NM 87545 (United States)
2013-07-01
Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER{sub GPU} code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)
Plestenjak, Bor; Gheorghiu, Călin I.; Hochstenbach, Michiel E.
2015-10-01
In numerous science and engineering applications a partial differential equation has to be solved on some fairly regular domain that allows the use of the method of separation of variables. In several orthogonal coordinate systems separation of variables applied to the Helmholtz, Laplace, or Schrödinger equation leads to a multiparameter eigenvalue problem (MEP); important cases include Mathieu's system, Lamé's system, and a system of spheroidal wave functions. Although multiparameter approaches are exploited occasionally to solve such equations numerically, MEPs remain less well known, and the variety of available numerical methods is not wide. The classical approach of discretizing the equations using standard finite differences leads to algebraic MEPs with large matrices, which are difficult to solve efficiently. The aim of this paper is to change this perspective. We show that by combining spectral collocation methods and new efficient numerical methods for algebraic MEPs it is possible to solve such problems both very efficiently and accurately. We improve on several previous results available in the literature, and also present a MATLAB toolbox for solving a wide range of problems.
Ahmed, Hassan Yousif; Nisar, K. S.
2013-08-01
Code with ideal in-phase cross correlation (CC) and practical code length to support high number of users are required in spectral amplitude coding-optical code division multiple access (SAC-OCDMA) systems. SAC systems are getting more attractive in the field of OCDMA because of its ability to eliminate the influence of multiple access interference (MAI) and also suppress the effect of phase induced intensity noise (PIIN). In this paper, we have proposed new Diagonal Eigenvalue Unity (DEU) code families with ideal in-phase CC based on Jordan block matrix with simple algebraic ways. Four sets of DEU code families based on the code weight W and number of users N for the combination (even, even), (even, odd), (odd, odd) and (odd, even) are constructed. This combination gives DEU code more flexibility in selection of code weight and number of users. These features made this code a compelling candidate for future optical communication systems. Numerical results show that the proposed DEU system outperforms reported codes. In addition, simulation results taken from a commercial optical systems simulator, Virtual Photonic Instrument (VPI™) shown that, using point to multipoint transmission in passive optical network (PON), DEU has better performance and could support long span with high data rate.
Spectral/spatial optical CDMA code based on Diagonal Eigenvalue Unity
Najjar, Monia; Jellali, Nabiha; Ferchichi, Moez; Rezig, Houria
2017-11-01
A new two dimensional Diagonal Eigenvalue Unity (2D-DEU) code is developed for the spectral⧹spatial optical code division multiple access (OCDMA) system. It has a lower cross correlation value compared to two dimensional diluted perfect difference (2D-DPD), two dimensional Extended Enhanced Double Weight (2D-Extended-EDW) codes. Also, for the same code length, the number of users can be generated by the 2D-DEU code is higher than that provided by the others codes. The Bit Error Rate (BER) numerical analysis is developed by considering the effects of shot noise, phase induced intensity noise (PIIN), and thermal noise. The main result shows that BER is strongly affected by PIIN for the higher source power. The 2D-DEU code performance is compared with 2D-DPD, 2D-Extended-EDW and two dimensional multi-diagonals (2D-MD) codes. This comparison proves that the proposed 2D-DEU system outperforms the related codes.
MARG2D code. 1. Eigenvalue problem for two dimensional Newcomb equation
Energy Technology Data Exchange (ETDEWEB)
Tokuda, Shinji [Japan Atomic Energy Research Inst., Naka, Ibaraki (Japan). Naka Fusion Research Establishment; Watanabe, Tomoko
1997-10-01
A new method and a code MARG2D have been developed to solve the 2-dimensional Newcomb equation which plays an important role in the magnetohydrodynamic (MHD) stability analysis in an axisymmetric toroidal plasma such as a tokamak. In the present formulation, an eigenvalue problem is posed for the 2-D Newcomb equation, where the weight function (the kinetic energy integral) and the boundary conditions at rational surfaces are chosen so that an eigenfunction correctly behaves as the linear combination of the small solution and the analytical solutions around each of the rational surfaces. Thus, the difficulty on solving the 2-D Newcomb equation has been resolved. By using the MARG2D code, the ideal MHD marginally stable state can be identified for a 2-D toroidal plasma. The code is indispensable on computing the outer-region matching data necessary for the resistive MHD stability analysis. Benchmark with ERATOJ, an ideal MHD stability code, has been carried out and the MARG2D code demonstrates that it indeed identifies both stable and marginally stable states against ideal MHD motion. (author)
On the behavior of the leading eigenvalue of Eigen's evolutionary matrices.
Semenov, Yuri S; Bratus, Alexander S; Novozhilov, Artem S
2014-12-01
We study general properties of the leading eigenvalue w¯(q) of Eigen's evolutionary matrices depending on the replication fidelity q. This is a linear algebra problem that has various applications in theoretical biology, including such diverse fields as the origin of life, evolution of cancer progression, and virus evolution. We present the exact expressions for w¯(q),w¯(')(q),w¯('')(q) for q = 0, 0.5, 1 and prove that the absolute minimum of w¯(q), which always exists, belongs to the interval (0, 0.5]. For the specific case of a single peaked landscape we also find lower and upper bounds on w¯(q), which are used to estimate the critical mutation rate, after which the distribution of the types of individuals in the population becomes almost uniform. This estimate is used as a starting point to conjecture another estimate, valid for any fitness landscape, and which is checked by numerical calculations. The last estimate stresses the fact that the inverse dependence of the critical mutation rate on the sequence length is not a generally valid fact. Copyright © 2014 Elsevier Inc. All rights reserved.
Energy Technology Data Exchange (ETDEWEB)
Pieper, Andreas [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Kreutzer, Moritz [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany); Alvermann, Andreas, E-mail: alvermann@physik.uni-greifswald.de [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Galgon, Martin [Bergische Universität Wuppertal (Germany); Fehske, Holger [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Hager, Georg [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany); Lang, Bruno [Bergische Universität Wuppertal (Germany); Wellein, Gerhard [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany)
2016-11-15
We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.
Directory of Open Access Journals (Sweden)
Ruyun Ma
2018-01-01
Full Text Available Let T>2 be an integer and T={1,2,…,T}. We show the existence of the principal eigenvalues of linear periodic eigenvalue problem -Δ2u(j-1+q(ju(j=λg(ju(j, j∈T, u(0=u(T, u(1=u(T+1, and we determine the sign of the corresponding eigenfunctions, where λ is a parameter, q(j≥0 and q(j≢0 in T, and the weight function g changes its sign in T. As an application of our spectrum results, we use the global bifurcation theory to study the existence of positive solutions for the corresponding nonlinear problem.
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)].
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available In the solution of boundary value problems, usually zero eigenvalue is ignored. This case also happens in calculating the eigenvalues of matrices, so that we would often like to find the nonzero solutions of the linear system A X = λ X when λ ≠ 0 . But λ = 0 implies that det A = 0 for X ≠ 0 and then the rank of matrix A is reduced at least one degree. This comment can similarly be stated for boundary value problems. In other words, if at least one of the eigens of equations related to the main problem is considered zero, then one of the solutions will be specified in advance. By using this note, first we study a class of special functions and then apply it for the potential, heat, and wave equations in spherical coordinate. In this way, some practical examples are also given.
International Nuclear Information System (INIS)
Sperotto, Fabiola Aiub; Segatto, Cynthia Feijo; Zabadal, Jorge
2002-01-01
In this work, we determine the dominant eigenvalue of the one-dimensional neutron transport equation in a slab constructing an integral form for the neutron transport equation which is the expressed in terms of fractional derivative of the angular flux. Equating the fractional derivative of the angular flux to the integrate equation, we determine the unknown order of the fractional derivative comparing the kernel of the integral equation with the one of Riemann-Liouville definition of fractional derivative. Once known the angular flux the dominant eigenvalue is calculated solving a transcendental equation resulting from the application of the boundary conditions. We report the methodology applied, for comparison with available results in literature. (author)
International Nuclear Information System (INIS)
Sahni, D.C.
1991-01-01
Many papers have been devoted to the study of the spectral properties of the linear (neutron) transport equation. Most of the theoretical investigations have concentrated on the existence (or otherwise) of a continuous spectrum, point spectrum, a leading/dominant eigenvalue, and a corresponding positive eigenvector. It is shown that the fundamental time eigenvalue of the linear transport operator increases with the size of the system. This follows from the increase in the largest eigenvalue of a non-negative irreducible matrix whenever any matrix element his increased. This result of matrix analysis is generalized to more general Krein-Rutman operators that leave a cone of vectors invariant
International Nuclear Information System (INIS)
Migdal, A.A.; Polikarpov, M.I.; Veselov, A.I.; Yurov, V.P.
1983-01-01
The Langevin equation for the lattice theory with arbitrary gauge group is derived. The four-dimensional twisted Eguchi-Kawai model is investigated numerically. The results for the plaquette energy agree with those of the known Monte Carlo calculations. The new result is the distribution of eigenvalues of the plaquette matrix. In the strong coupling phase this distribution is smooth, whereas in the weak coupling phase a gap is clearly seen
International Nuclear Information System (INIS)
Mariz, A.M.; Rio Grande do Norte Univ., Natal; Tsallis, C.
1982-01-01
The quantum single one-dimensional oscillator associated with a potential proportional to /X/ sup(#betta#) (#betta# > 0) is discussed. The exact energy eigenvalues recently established by Turschner are further elaborated and convenient exact as well as asymptotic relations are exhibited. The exact T → 0 and T → infinite specific heat is discussed and numerical results for typical values of #betta# and intermediate temperature are presented. (Author) [pt
International Nuclear Information System (INIS)
Abreu, M.P. de
1994-01-01
The use of exact albedo boundary conditions in numerical methods applied to one-dimensional one-speed discrete ordinates (S n ) eigenvalue problems for nuclear reactor global calculations is described. An albedo operator that treats the reflector region around a nuclear reactor core implicitly is described and exactly was derived. To illustrate the method's efficiency and accuracy, it was used conventional linear diamond method with the albedo option to solve typical model problems. (author)
International Nuclear Information System (INIS)
Petersen, Claudio Zen; Vilhena, Marco T.; Barros, Ricardo C.
2009-01-01
In this paper the application of the Laplace transform method is described in order to determine the energy-dependent albedo matrix that is used in the boundary conditions multigroup neutron diffusion eigenvalue problems in slab geometry for nuclear reactor global calculations. In slab geometry, the diffusion albedo substitutes without approximation the baffle-reflector system around the active domain. Numerical results to typical test problems are shown to illustrate the accuracy and the efficiency of the Chebysheff acceleration scheme. (orig.)
Energy Technology Data Exchange (ETDEWEB)
Bondarenko, Sergey; Prygarin, Alex [Physics Department, Ariel University,Ariel 40700, territories administered by (Israel)
2016-07-15
We discuss a residual freedom of the next-to-leading BFKL eigenvalue that originates from ambiguity in redistributing the next-to-leading (NLO) corrections between the adjoint BFKL eigenvalue and eigenfunctions in planar N=4 super-Yang-Mills (SYM) Theory. In terms of the remainder function of the Bern-Dixon-Smirnov (BDS) amplitude this freedom is translated to reshuffling correction between the eigenvalue and the impact factors in the multi-Regge kinematics (MRK) in the next-to-leading logarithm approximation (NLA). We show that the modified NLO BFKL eigenvalue suggested by the authors in ref. http://arxiv.org/abs/1510.00589 can be introduced in the MRK expression for the remainder function by shifting the anomalous dimension in the impact factor in such a way that the two and three loop remainder function is left unchanged to the NLA accuracy.
Directory of Open Access Journals (Sweden)
Gift Muchatibaya
2018-01-01
Full Text Available The asymptotic and threshold behaviour of the eigenvalues of a perturbed difference operator inside a spectral gap is investigated. In particular, applications of the Titchmarsh-Weyl m-function theory as well as the Birman-Schwinger principle is performed to investigate the existence and behaviour of the eigenvalues of the operator H0+λWn inside the spectral gap of H0 in the limits λ↑∞ and λ↓0.
International Nuclear Information System (INIS)
Logrado, P.G.; Vianna, J.D.M.
Upper and lower bounds for the energy eigenvalues is Schoenberg's perturbation-theory ground state are studied. After a review of the characteristic features of the partitioning techniques the perturbative expansion proposed by Schoenberg is generated from an exact operator equation. The upper and lower bounds for the ground state eigenvalue are derived by using reaction and wave operators concepts, the bracketing function and operator inequalities. (Author) [pt
Ogilvie, Karen; Olde Daalhuis, Adri B.
2015-11-01
By application of the theory for second-order linear differential equations with two turning points developed in [Olver F.W.J., Philos. Trans. Roy. Soc. London Ser. A 278 (1975), 137-174], uniform asymptotic approximations are obtained in the first part of this paper for the Lamé and Mathieu functions with a large real parameter. These approximations are expressed in terms of parabolic cylinder functions, and are uniformly valid in their respective real open intervals. In all cases explicit bounds are supplied for the error terms associated with the approximations. Approximations are also obtained for the large order behaviour for the respective eigenvalues. We restrict ourselves to a two term uniform approximation. Theoretically more terms in these approximations could be computed, but the coefficients would be very complicated. In the second part of this paper we use a simplified method to obtain uniform asymptotic expansions for these functions. The coefficients are just polynomials and satisfy simple recurrence relations. The price to pay is that these asymptotic expansions hold only in a shrinking interval as their respective parameters become large; this interval however encapsulates all the interesting oscillatory behaviour of the functions. This simplified method also gives many terms in asymptotic expansions for these eigenvalues, derived simultaneously with the coefficients in the function expansions. We provide rigorous realistic error bounds for the function expansions when truncated and order estimates for the error when the eigenvalue expansions are truncated. With this paper we confirm that many of the formal results in the literature are correct.
Energy Technology Data Exchange (ETDEWEB)
Shubov, Marianna A., E-mail: marianna.shubov@gmail.com [University of New Hampshire, Department of Mathematics and Statistics (United States)
2016-06-15
We consider a well known model of a piezoelectric energy harvester. The harvester is designed as a beam with a piezoceramic layer attached to its top face (unimorph configuration). A pair of thin perfectly conductive electrodes is covering the top and the bottom faces of the piezoceramic layer. These electrodes are connected to a resistive load. The model is governed by a system consisting of two equations. The first of them is the equation of the Euler–Bernoulli model for the transverse vibrations of the beam and the second one represents the Kirchhoff’s law for the electric circuit. Both equations are coupled due to the direct and converse piezoelectric effects. The boundary conditions for the beam equations are of clamped-free type. We represent the system as a single operator evolution equation in a Hilbert space. The dynamics generator of this system is a non-selfadjoint operator with compact resolvent. Our main result is an explicit asymptotic formula for the eigenvalues of this generator, i.e., we perform the modal analysis for electrically loaded (not short-circuit) system. We show that the spectrum splits into an infinite sequence of stable eigenvalues that approaches a vertical line in the left half plane and possibly of a finite number of unstable eigenvalues. This paper is the first in a series of three works. In the second one we will prove that the generalized eigenvectors of the dynamics generator form a Riesz basis (and, moreover, a Bari basis) in the energy space. In the third paper we will apply the results of the first two to control problems for this model.
Energy Technology Data Exchange (ETDEWEB)
Liu, T.; Ding, A.; Ji, W.; Xu, X. G. [Nuclear Engineering and Engineering Physics, Rensselaer Polytechnic Inst., Troy, NY 12180 (United States); Carothers, C. D. [Dept. of Computer Science, Rensselaer Polytechnic Inst. RPI (United States); Brown, F. B. [Los Alamos National Laboratory (LANL) (United States)
2012-07-01
Monte Carlo (MC) method is able to accurately calculate eigenvalues in reactor analysis. Its lengthy computation time can be reduced by general-purpose computing on Graphics Processing Units (GPU), one of the latest parallel computing techniques under development. The method of porting a regular transport code to GPU is usually very straightforward due to the 'embarrassingly parallel' nature of MC code. However, the situation becomes different for eigenvalue calculation in that it will be performed on a generation-by-generation basis and the thread coordination should be explicitly taken care of. This paper presents our effort to develop such a GPU-based MC code in Compute Unified Device Architecture (CUDA) environment. The code is able to perform eigenvalue calculation under simple geometries on a multi-GPU system. The specifics of algorithm design, including thread organization and memory management were described in detail. The original CPU version of the code was tested on an Intel Xeon X5660 2.8 GHz CPU, and the adapted GPU version was tested on NVIDIA Tesla M2090 GPUs. Double-precision floating point format was used throughout the calculation. The result showed that a speedup of 7.0 and 33.3 were obtained for a bare spherical core and a binary slab system respectively. The speedup factor was further increased by a factor of {approx}2 on a dual GPU system. The upper limit of device-level parallelism was analyzed, and a possible method to enhance the thread-level parallelism was proposed. (authors)
International Nuclear Information System (INIS)
Shubov, Marianna A.
2016-01-01
We consider a well known model of a piezoelectric energy harvester. The harvester is designed as a beam with a piezoceramic layer attached to its top face (unimorph configuration). A pair of thin perfectly conductive electrodes is covering the top and the bottom faces of the piezoceramic layer. These electrodes are connected to a resistive load. The model is governed by a system consisting of two equations. The first of them is the equation of the Euler–Bernoulli model for the transverse vibrations of the beam and the second one represents the Kirchhoff’s law for the electric circuit. Both equations are coupled due to the direct and converse piezoelectric effects. The boundary conditions for the beam equations are of clamped-free type. We represent the system as a single operator evolution equation in a Hilbert space. The dynamics generator of this system is a non-selfadjoint operator with compact resolvent. Our main result is an explicit asymptotic formula for the eigenvalues of this generator, i.e., we perform the modal analysis for electrically loaded (not short-circuit) system. We show that the spectrum splits into an infinite sequence of stable eigenvalues that approaches a vertical line in the left half plane and possibly of a finite number of unstable eigenvalues. This paper is the first in a series of three works. In the second one we will prove that the generalized eigenvectors of the dynamics generator form a Riesz basis (and, moreover, a Bari basis) in the energy space. In the third paper we will apply the results of the first two to control problems for this model.
International Nuclear Information System (INIS)
Liu, T.; Ding, A.; Ji, W.; Xu, X. G.; Carothers, C. D.; Brown, F. B.
2012-01-01
Monte Carlo (MC) method is able to accurately calculate eigenvalues in reactor analysis. Its lengthy computation time can be reduced by general-purpose computing on Graphics Processing Units (GPU), one of the latest parallel computing techniques under development. The method of porting a regular transport code to GPU is usually very straightforward due to the 'embarrassingly parallel' nature of MC code. However, the situation becomes different for eigenvalue calculation in that it will be performed on a generation-by-generation basis and the thread coordination should be explicitly taken care of. This paper presents our effort to develop such a GPU-based MC code in Compute Unified Device Architecture (CUDA) environment. The code is able to perform eigenvalue calculation under simple geometries on a multi-GPU system. The specifics of algorithm design, including thread organization and memory management were described in detail. The original CPU version of the code was tested on an Intel Xeon X5660 2.8 GHz CPU, and the adapted GPU version was tested on NVIDIA Tesla M2090 GPUs. Double-precision floating point format was used throughout the calculation. The result showed that a speedup of 7.0 and 33.3 were obtained for a bare spherical core and a binary slab system respectively. The speedup factor was further increased by a factor of ∼2 on a dual GPU system. The upper limit of device-level parallelism was analyzed, and a possible method to enhance the thread-level parallelism was proposed. (authors)
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.
Brewster, J.; Oware, E. K.
2017-12-01
Groundwater hosted in fractured rocks constitutes almost 65% of the principal aquifers in the US. The exploitation and contaminant management of fractured aquifers require fracture flow and transport modeling, which in turn requires a detailed understanding of the structure of the aquifer. The widely used equivalent porous medium approach to modeling fractured aquifer systems is inadequate to accurately predict fracture transport processes due to the averaging of the sharp lithological contrast between the matrix and the fractures. The potential of geophysical imaging (GI) to estimate spatially continuous subsurface profiles in a minimally invasive fashion is well proven. Conventional deterministic GI strategies, however, produce geologically unrealistic, smoothed-out results due to commonly enforced smoothing constraints. Stochastic GI of fractured aquifers is becoming increasing appealing due to its ability to recover realistic fracture features while providing multiple likely realizations that enable uncertainty assessment. Generating prior spatial features consistent with the expected target structures is crucial in stochastic imaging. We propose to utilize eigenvalue ratios to resolve the elongated fracture features expected in a fractured aquifer system. Eigenvalues capture the major and minor directions of variability in a region, which can be employed to evaluate shape descriptors, such as eccentricity (elongation) and orientation of features in the region. Eccentricity ranges from zero to one, representing a circularly sharped to a line feature, respectively. Here, we apply eigenvalue ratios to define a joint objective parameter consisting of eccentricity (shape) and direction terms to guide the generation of prior fracture-like features in some predefined principal directions for stochastic GI. Preliminary unconditional, synthetic experiments reveal the potential of the algorithm to simulate prior fracture-like features. We illustrate the strategy with a
Energy Technology Data Exchange (ETDEWEB)
Mehta, M. L. [Institute of Fundamental Research Bombay (India); Gaudin, M. [Commissariat a l' energie atomique et aux energies alternatives - CEA, Centre d' Etudes Nucleaires de Saclay, Gif-sur-Yvette (France)
1960-07-01
An exact expression for the density of eigenvalues of a random- matrix is derived. When the order of the matrix becomes infinite, it can be seen very directly that it goes over to Wigner's 'semi-circle law'. Reprint of a paper published in 'Nuclear Physics' 18, 1960, p. 420-427 [French] On deduit une expression precise pour la densite des racines caracteristiques d'une matrice stochastique. Quand l'ordre de la matrice devient infini, on peut voir facilement qu'elle obeit a la loi dite 'semi-circulaire' de Wigner. Reproduction d'un article publie dans 'Nuclear Physics' 18, 1960, p. 420-427.
International Nuclear Information System (INIS)
Adams, J.E.
1979-05-01
The difficulty of applying the WKB approximation to problems involving arbitrary potentials has been confronted. Recent work has produced a convenient expression for the potential correction term. However, this approach does not yield a unique correction term and hence cannot be used to construct the proper modification. An attempt is made to overcome the uniqueness difficulties by imposing a criterion which permits identification of the correct modification. Sections of this work are: semiclassical eigenvalues for potentials defined on a finite interval; reactive scattering exchange kernels; a unified model for elastic and inelastic scattering from a solid surface; and selective absorption on a solid surface
Energy Technology Data Exchange (ETDEWEB)
Park, Ho Jin [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Shim, Hyung Jin [Seoul National University, Seoul (Korea, Republic of)
2015-05-15
In a Monte Carlo (MC) eigenvalue calculation, it is well known that the apparent variance of a local tally such as pin power differs from the real variance considerably. The MC method in eigenvalue calculations uses a power iteration method. In the power iteration method, the fission matrix (FM) and fission source density (FSD) are used as the operator and the solution. The FM is useful to estimate a variance and covariance because the FM can be calculated by a few cycle calculations even at inactive cycle. Recently, S. Carney have implemented the higher order fission matrix (HOFM) capabilities into the MCNP6 MC code in order to apply to extend the perturbation theory to second order. In this study, the HOFM capability by the Hotelling deflation method was implemented into McCARD and used to predict the behavior of a real and apparent SD ratio. In the simple 1D slab problems, the Endo's theoretical model predicts well the real to apparent SD ratio. It was noted that the Endo's theoretical model with the McCARD higher mode FS solutions by the HOFM yields much better the real to apparent SD ratio than that with the analytic solutions. In the near future, the application for a high dominance ratio problem such as BEAVRS benchmark will be conducted.
International Nuclear Information System (INIS)
Paranjape, S.D.; Kumar, V.; Sahni, D.C.
1993-01-01
The one-speed, time-dependent, isotropically scattering, integral transport equation in a homogeneous sphere has been converted into a criticality-like problem by considering exponential time behaviour of the scalar flux. This criticality problem has been converted into a matrix eigenvalue problem using the Fourier transform technique. The time eigenvalues λ, which are complex in general, have been determined for spherically symmetric as well as asymmetric modes. For the former case, the real decay constants and the real parts of complex decay constants decrease monotonically with increasing system size and form two distinct families of single-valued functions. For the spherically asymmetric modes, certain new features emerge. The real decay constants are found to be multi-valued functions of system size and they do not always decrease monotonically with increasing system size. As the system size increases from zero onwards, the decay constants alternate between complex and real values and the real and complex decay constant curves interlace. (Author)
International Nuclear Information System (INIS)
Bottcher, C.; Strayer, M.R.; Werby, M.F.
1993-01-01
The Helmholtz-Poincare Wave Equation (H-PWE) arises in many areas of classical wave scattering theory. In particular it can be found for the cases of acoustical scattering from submerged bounded objects and electromagnetic scattering from objects. The extended boundary integral equations (EBIE) method is derived from considering both the exterior and interior solutions of the H-PWE's. This coupled set of expressions has the advantage of not only offering a prescription for obtaining a solution for the exterior scattering problem, but it also obviates the problem of irregular values corresponding to fictitious interior eigenvalues. Once the coupled equations are derived, they can by obtained in matrix form be expanding all relevant terms in partial wave expansions, including a biorthogonal expansion of the Green function. However some freedom of choice in the choice of the surface expansion is available since the unknown surface quantities may be expanded in a variety of ways to long as closure is obtained. Out of many possible choices, we develop an optimal method to obtain such expansions which is based on the optimum eigenfunctions related to the surface of the object. In effect, we convert part of the problem (that associated with the Fredholms integral equation of the first kind) an eigenvalue problem of a related Hermition operator. The methodology will be explained in detail and examples will be presented
International Nuclear Information System (INIS)
Jiang Bin; Zhang Yejing; Wang Yufei; Liu Anjin; Zheng Wanhua
2012-01-01
We present the extended Dirichlet-to-Neumann wave vector eigenvalue equation (DtN-WVEE) method to calculate the equi-frequency contour (EFC) of square lattice photonic crystals (PhCs). With the extended DtN-WVEE method and Snell's law, the effective refractive index of the mode with a circular EFC can be obtained, which is further validated with the refractive index weighted by the electric field or magnetic field. To further verify the EFC calculated by the DtN-WVEE method, the finite-difference time-domain method is also used. Compared with other wave vector eigenvalue equation methods that calculate EFC directly, the size of the eigenmatrix used in the DtN-WVEE method is much smaller, and the computation time is significantly reduced. Since the DtN-WVEE method solves wave vectors for given arbitrary frequencies, it can also find applications in studying the optical properties of a PhC with dispersive, lossy and magnetic materials. (paper)
International Nuclear Information System (INIS)
Turinsky, P.J.; Al-Chalabi, R.M.K.; Engrand, P.; Sarsour, H.N.; Faure, F.X.; Guo, W.
1994-06-01
NESTLE is a FORTRAN77 code that solves the few-group neutron diffusion equation utilizing the Nodal Expansion Method (NEM). NESTLE can solve the eigenvalue (criticality); eigenvalue adjoint; external fixed-source steady-state; or external fixed-source. or eigenvalue initiated transient problems. The code name NESTLE originates from the multi-problem solution capability, abbreviating Nodal Eigenvalue, Steady-state, Transient, Le core Evaluator. The eigenvalue problem allows criticality searches to be completed, and the external fixed-source steady-state problem can search to achieve a specified power level. Transient problems model delayed neutrons via precursor groups. Several core properties can be input as time dependent. Two or four energy groups can be utilized, with all energy groups being thermal groups (i.e. upscatter exits) if desired. Core geometries modelled include Cartesian and Hexagonal. Three, two and one dimensional models can be utilized with various symmetries. The non-linear iterative strategy associated with the NEM method is employed. An advantage of the non-linear iterative strategy is that NSTLE can be utilized to solve either the nodal or Finite Difference Method representation of the few-group neutron diffusion equation
International Nuclear Information System (INIS)
Rasulov, T.H.
2009-04-01
A model operator H μ , μ > 0 associated to a system of three particles on the three-dimensional lattice Z 3 . We study the case where the parameter function w has a special form with the nondegenerate minimum at the n, n > 1 points. If the associated Friedrichs model has a zero energy resonance, then we prove that the operator H μ has infinitely many negative eigenvalues accumulating at zero. Moreover, we obtain an asymptotic value for the number of negative eigenvalues of H μ lying below z < 0 with respect to the spectral parameter z → -0. (author)
International Nuclear Information System (INIS)
Schubert, R.
1995-05-01
We investigate the behaviour of the remainder term R(E) in the Weyl formula {nvertical stroke E n ≤E}=Vol(M).E d/2 /[(4π) d/2 Γ(d/2+1)]+R(E) for the eigenvalues E n of a Schroedinger operator on a d-dimensional compact Riemannian manifold all of whose geodesics are closed. We show that R(E) is of the form E (d-1)/2 Θ(√E), where Θ(x) is an almost periodic function of Besicovitch class B 2 which has a limit distribution whose density is a box-shaped function. Furthermore we derive a trace formula and study higher order terms in the asymptotics of the coefficients related to the periodic orbits. The periodicity of the geodesic flow leads to a very simple structure of the trace formula which is the reason why the limit distribution can be computed explicitly. (orig.)
International Nuclear Information System (INIS)
Pires, V. Fernao; Martins, J.F.; Pires, A.J.
2010-01-01
In this paper an integrated approach for on-line induction motor fault detection and diagnosis is presented. The need to insure a continuous and safety operation for induction motors involves preventive maintenance procedures combined with fault diagnosis techniques. The proposed approach uses an automatic three step algorithm. Firstly, the induction motor stator currents are measured which will give typical patterns that can be used to identify the fault. Secondly, the eigenvectors/eigenvalues of the 3D current referential are computed. Finally the proposed algorithm will discern if the motor is healthy or not and report the extent of the fault. Furthermore this algorithm is able to identify distinct faults (stator winding faults or broken bars). The proposed approach was experimentally implemented and its performance verified on various types of working conditions.
International Nuclear Information System (INIS)
Barakat, T
2012-01-01
Based on the simple similarity transformation, we were able to transform the Dirac equation whose potential contains vector V (r) = -A/r + B 1 r and scalar S(r) = B 2 r types into a form nearly identical to the Schrödinger equation. The transformed equation is so simple that one can solve it by means of the asymptotic iteration method. Moreover, within the same framework we were able to obtain the relativistic energy eigenvalues for the Dirac equation with vector Coulomb plus scalar linear, and with pure scalar linear potentials; V (r) = -A/r, S(r) = B 2 r, and V (r) = 0, S(r) = B 2 r, respectively.
International Nuclear Information System (INIS)
Barucq, Helene; Bekkey, Chokri; Djellouli, Rabia
2004-01-01
We present a general procedure based on the pseudo-differential calculus for deriving artificial boundary conditions for an eigenvalue problem that characterizes the propagation of guided modes in optical waveguides. This new approach allows the construction of local conditions that (a) are independent of the frequency regime, (b) preserve the sparsity pattern of the finite element discretization, and (c) are applicable to arbitrarily shaped convex artificial boundaries. The last feature has the potential for reducing the size of the computational domain. Numerical results are presented to highlight the potential of conditions of order 1/2 and 1, for improving significantly the computational efficiency of finite element methods for the solution of optical waveguide problems
Directory of Open Access Journals (Sweden)
Mao-sheng Cheng
2008-08-01
Full Text Available Abstract: CoMFA, CoMSIA and eigenvalue analysis (EVA were performed to study the structural features of 61 diverse dibenzodioxepinone and dibenzodioxocinone analogues to probe cholesteryl ester transfer protein (CETP inhibitory activity. Three methods yielded statistically significant models upon assessment of cross-validation, bootstrapping, and progressive scrambling. This was further validated by an external set of 13 derivatives. Our results demonstrate that three models have a good interpolation as well as extrapolation. The hydrophobic features were confirmed to contribute significantly to inhibitor potencies, while a pre-oriented hydrogen bond provided by the hydroxyl group at the 3-position indicated a good correlation with previous SAR, and a hydrogen bond acceptor may play a crucial role in CETP inhibition. These derived models may help us to gain a deeper understanding of the binding interaction of these lactone-based compounds and aid in the design of new potent compounds against CETP.
International Nuclear Information System (INIS)
Ito, Motohiro; Endo, Tomohiro; Yamamoto, Akio; Kuroda, Yusuke; Yoshii, Takashi
2017-01-01
The bias factor method based on the random sampling technique is applied to the benchmark problem of Peach Bottom Unit 2. Validity and availability of the present method, i.e. correction of calculation results and reduction of uncertainty, are confirmed in addition to features and performance of the present method. In the present study, core characteristics in cycle 3 are corrected with the proposed method using predicted and 'measured' critical eigenvalues in cycles 1 and 2. As the source of uncertainty, variance-covariance of cross sections is considered. The calculation results indicate that bias between predicted and measured results, and uncertainty owing to cross section can be reduced. Extension to other uncertainties such as thermal hydraulics properties will be a future task. (author)
Bazzani, Armando; Castellani, Gastone C; Cooper, Leon N
2010-05-01
We analyze the effects of noise correlations in the input to, or among, Bienenstock-Cooper-Munro neurons using the Wigner semicircular law to construct random, positive-definite symmetric correlation matrices and compute their eigenvalue distributions. In the finite dimensional case, we compare our analytic results with numerical simulations and show the effects of correlations on the lifetimes of synaptic strengths in various visual environments. These correlations can be due either to correlations in the noise from the input lateral geniculate nucleus neurons, or correlations in the variability of lateral connections in a network of neurons. In particular, we find that for fixed dimensionality, a large noise variance can give rise to long lifetimes of synaptic strengths. This may be of physiological significance.
Forrester, Peter J.; Trinh, Allan K.
2018-05-01
The neighbourhood of the largest eigenvalue λmax in the Gaussian unitary ensemble (GUE) and Laguerre unitary ensemble (LUE) is referred to as the soft edge. It is known that there exists a particular centring and scaling such that the distribution of λmax tends to a universal form, with an error term bounded by 1/N2/3. We take up the problem of computing the exact functional form of the leading error term in a large N asymptotic expansion for both the GUE and LUE—two versions of the LUE are considered, one with the parameter a fixed and the other with a proportional to N. Both settings in the LUE case allow for an interpretation in terms of the distribution of a particular weighted path length in a model involving exponential variables on a rectangular grid, as the grid size gets large. We give operator theoretic forms of the corrections, which are corollaries of knowledge of the first two terms in the large N expansion of the scaled kernel and are readily computed using a method due to Bornemann. We also give expressions in terms of the solutions of particular systems of coupled differential equations, which provide an alternative method of computation. Both characterisations are well suited to a thinned generalisation of the original ensemble, whereby each eigenvalue is deleted independently with probability (1 - ξ). In Sec. V, we investigate using simulation the question of whether upon an appropriate centring and scaling a wider class of complex Hermitian random matrix ensembles have their leading correction to the distribution of λmax proportional to 1/N2/3.
Marek-Crnjac, L
2003-01-01
In the present work we give a classical nested mechanical model and corresponding expressions for the theoretical masses of elementary particles, including the masses of quarks as being the joint eigenvalues of combined vibrating sets using the Southwell and the Dunkerly theorems. The role played by the golden mean in KAM theory and consequently our present model is also discussed.
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…
International Nuclear Information System (INIS)
Marek-Crnjac, L.
2003-01-01
In the present work we give a classical nested mechanical model and corresponding expressions for the theoretical masses of elementary particles, including the masses of quarks as being the joint eigenvalues of combined vibrating sets using the Southwell and the Dunkerly theorems. The role played by the golden mean in KAM theory and consequently our present model is also discussed
Haidar, Azzam
2011-01-01
This paper introduces a novel implementation in reducing a symmetric dense matrix to tridiagonal form, which is the preprocessing step toward solving symmetric eigenvalue problems. Based on tile algorithms, the reduction follows a two-stage approach, where the tile matrix is first reduced to symmetric band form prior to the final condensed structure. The challenging trade-off between algorithmic performance and task granularity has been tackled through a grouping technique, which consists of aggregating fine-grained and memory-aware computational tasks during both stages, while sustaining the application\\'s overall high performance. A dynamic runtime environment system then schedules the different tasks in an out-of-order fashion. The performance for the tridiagonal reduction reported in this paper is unprecedented. Our implementation results in up to 50-fold and 12-fold improvement (130 Gflop/s) compared to the equivalent routines from LAPACK V3.2 and Intel MKL V10.3, respectively, on an eight socket hexa-core AMD Opteron multicore shared-memory system with a matrix size of 24000×24000. Copyright 2011 ACM.
Energy Technology Data Exchange (ETDEWEB)
Maiz, F., E-mail: fethimaiz@gmail.com [University of Cartage, Nabeul Engineering Preparatory Institute, Merazka, 8000 Nabeul (Tunisia); King Khalid University, Faculty of Science, Physics Department, PO Box 9004, Abha 61413 (Saudi Arabia)
2015-04-15
A novel method to calculate the quantum transmission, resonance and eigenvalue energies forming the sub-bands structure of non-symmetrical, non-periodical semiconducting heterostructure potential has been proposed in this paper. The method can be applied on a multilayer system with varying thickness of the layer and effective mass of electrons and holes. Assuming an approximated effective mass and using Bastard's boundary conditions, Schrödinger equation at each media is solved and then using a confirmed recurrence method, the transmission and reflection coefficients and the energy quantification condition are expressed. They are simple combination of coupled equations. Schrödinger's equation solutions are Airy functions or plane waves, depending on the electrical potential energy slope. To illustrate the feasibility of the proposed method, the N barriers – (N−1) wells structure for N=3, 5, 8, 9, 17 and 35 are studied. All results show very good agreements with previously published results obtained from applying different methods on similar systems.
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.
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.
International Nuclear Information System (INIS)
Levashov, V. A.
2016-01-01
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.
Energy Technology Data Exchange (ETDEWEB)
Levashov, V. A. [Technological Design Institute of Scientific Instrument Engineering, Novosibirsk 630058 (Russian Federation)
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: λ{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.
Indian Academy of Sciences (India)
We make music by causing strings, membranes, or air columns to vibrate. Engineers design safe structures by control- ling vibrations. I will describe to you a very simple vibrating system and the mathematics needed to analyse it. The ideas were born in the work of Joseph-Louis Lagrange (1736–1813), and I begin by quot-.
Random eigenvalue problems revisited
Indian Academy of Sciences (India)
statistical distributions; linear stochastic systems. 1. ... dimensional multivariate Gaussian random vector with mean µ ∈ Rm and covariance ... 5, the proposed analytical methods are applied to a three degree-of-freedom system and the ...... The joint pdf ofω1 andω3 is however close to a bivariate Gaussian density function.
Indian Academy of Sciences (India)
The vibrating string problem is the source of much mathe- matics and physics. ... ing this science [mechanics],and the art of solving the problems pertaining to it, to .... used tools for finding maxima and minima of functions of several variables.
Energy Technology Data Exchange (ETDEWEB)
Silva, Davi Jose M.; Alves Filho, Hermes; Barros, Ricardo C., E-mail: davijmsilva@yahoo.com.br, E-mail: halves@iprj.uerj.br, E-mail: rcbarros@pq.cnpq.br [Universidade do Estado do Rio de Janeiro (UERJ), Nova Friburgo, RJ (Brazil). Programa de Pos-Graduacao em Modelagem Computacional
2015-07-01
A spectral nodal method is developed for multigroup x,y-geometry discrete ordinates (S{sub N}) eigenvalue problems for nuclear reactor global calculations. This method uses the conventional multigroup SN discretized spatial balance nodal equations with two non-standard auxiliary equations: the spectral diamond (SD) auxiliary equations for the discretization nodes inside the fuel regions, and the spectral Green's function (SGF) auxiliary equations for the non-multiplying regions, such as the baffle and the reactor. This spectral nodal method is derived from the analytical general solution of the SN transverse integrated nodal equations with constant approximations for the transverse leakage terms within each discretization node. The SD and SGF auxiliary equations have parameters, which are determined to preserve the homogeneous and the particular components of these local general solutions. Therefore, we refer to the offered method as the hybrid SD-SGF-Constant Nodal (SD-SGF-CN) method. The S{sub N} discretized spatial balance equations, together with the SD and the SGF auxiliary equations form the SD-SGF-CN equations. We solve the SD-SGF-CN equations by using the one-node block inversion inner iterations (NBI), wherein the most recent estimates for the incoming group node-edge average or prescribed boundary conditions are used to evaluate the outgoing group node-edge average fluxes in the directions of the S{sub N} transport sweeps, for each estimate of the dominant eigenvalue in the conventional Power outer iterations. We show in numerical calculations that the SD-SGF-CN method is very accurate for coarse-mesh multigroup S{sub N} eigenvalue problems, even though the transverse leakage terms are approximated rather simply. (author)
International Nuclear Information System (INIS)
Silva, Davi Jose M.; Alves Filho, Hermes; Barros, Ricardo C.
2015-01-01
A spectral nodal method is developed for multigroup x,y-geometry discrete ordinates (S N ) eigenvalue problems for nuclear reactor global calculations. This method uses the conventional multigroup SN discretized spatial balance nodal equations with two non-standard auxiliary equations: the spectral diamond (SD) auxiliary equations for the discretization nodes inside the fuel regions, and the spectral Green's function (SGF) auxiliary equations for the non-multiplying regions, such as the baffle and the reactor. This spectral nodal method is derived from the analytical general solution of the SN transverse integrated nodal equations with constant approximations for the transverse leakage terms within each discretization node. The SD and SGF auxiliary equations have parameters, which are determined to preserve the homogeneous and the particular components of these local general solutions. Therefore, we refer to the offered method as the hybrid SD-SGF-Constant Nodal (SD-SGF-CN) method. The S N discretized spatial balance equations, together with the SD and the SGF auxiliary equations form the SD-SGF-CN equations. We solve the SD-SGF-CN equations by using the one-node block inversion inner iterations (NBI), wherein the most recent estimates for the incoming group node-edge average or prescribed boundary conditions are used to evaluate the outgoing group node-edge average fluxes in the directions of the S N transport sweeps, for each estimate of the dominant eigenvalue in the conventional Power outer iterations. We show in numerical calculations that the SD-SGF-CN method is very accurate for coarse-mesh multigroup S N eigenvalue problems, even though the transverse leakage terms are approximated rather simply. (author)
International Nuclear Information System (INIS)
Kalkreuter, T.; Simma, H.
1995-07-01
The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalizations in the subspace spanned by the numerically computed eigenvectors. We study this combined algorithm in case of the Dirac operator with (dynamical) Wilson fermions in four-dimensional SU(2) gauge fields. The algorithm is numerically very stable and can be parallelized in an efficient way. On lattices of sizes 4 4 - 16 4 an acceleration of the pure CG method by a factor of 4 - 8 is found. (orig.)
Liu, Tianyu; Du, Xining; Ji, Wei; Xu, X. George; Brown, Forrest B.
2014-06-01
For nuclear reactor analysis such as the neutron eigenvalue calculations, the time consuming Monte Carlo (MC) simulations can be accelerated by using graphics processing units (GPUs). However, traditional MC methods are often history-based, and their performance on GPUs is affected significantly by the thread divergence problem. In this paper we describe the development of a newly designed event-based vectorized MC algorithm for solving the neutron eigenvalue problem. The code was implemented using NVIDIA's Compute Unified Device Architecture (CUDA), and tested on a NVIDIA Tesla M2090 GPU card. We found that although the vectorized MC algorithm greatly reduces the occurrence of thread divergence thus enhancing the warp execution efficiency, the overall simulation speed is roughly ten times slower than the history-based MC code on GPUs. Profiling results suggest that the slow speed is probably due to the memory access latency caused by the large amount of global memory transactions. Possible solutions to improve the code efficiency are discussed.
International Nuclear Information System (INIS)
Schmidt, Tobias; Kümmel, Stephan; Kraisler, Eli; Makmal, Adi; Kronik, Leeor
2014-01-01
We present and test a new approximation for the exchange-correlation (xc) energy of Kohn-Sham density functional theory. It combines exact exchange with a compatible non-local correlation functional. The functional is by construction free of one-electron self-interaction, respects constraints derived from uniform coordinate scaling, and has the correct asymptotic behavior of the xc energy density. It contains one parameter that is not determined ab initio. We investigate whether it is possible to construct a functional that yields accurate binding energies and affords other advantages, specifically Kohn-Sham eigenvalues that reliably reflect ionization potentials. Tests for a set of atoms and small molecules show that within our local-hybrid form accurate binding energies can be achieved by proper optimization of the free parameter in our functional, along with an improvement in dissociation energy curves and in Kohn-Sham eigenvalues. However, the correspondence of the latter to experimental ionization potentials is not yet satisfactory, and if we choose to optimize their prediction, a rather different value of the functional's parameter is obtained. We put this finding in a larger context by discussing similar observations for other functionals and possible directions for further functional development that our findings suggest
International Nuclear Information System (INIS)
Chang, Jonghwa
2014-01-01
Today, we can use a computer cluster consist of a few hundreds CPUs with reasonable budget. Such computer system enables us to do detailed modeling of reactor core. The detailed modeling will improve the safety and the economics of a nuclear reactor by eliminating un-necessary conservatism or missing consideration. To take advantage of such a cluster computer, efficient parallel algorithms must be developed. Mechanical structure analysis community has studied the domain decomposition method to solve the stress-strain equation using the finite element methods. One of the most successful domain decomposition method in terms of robustness is FETI-DP. We have modified the original FETI-DP to solve the eigenvalue problem for the multi-group diffusion problem in previous study. In this study, we report the result of recent modification to handle the three-dimensional subdomain partitioning, and the sub-domain multi-group problem. Modified FETI-DP algorithm has been successfully applied for the eigenvalue problem of multi-group neutron diffusion equation. The overall CPU time is decreasing as number of sub-domains (partitions) is increasing. However, there may be a limit in decrement due to increment of the number of primal points will increase the CPU time spent by the solution of the global equation. Even distribution of computational load (criterion a) is important to achieve fast computation. The subdomain partition can be effectively performed using suitable graph theory partition package such as MeTIS
Energy Technology Data Exchange (ETDEWEB)
Chang, Jonghwa [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2014-10-15
Today, we can use a computer cluster consist of a few hundreds CPUs with reasonable budget. Such computer system enables us to do detailed modeling of reactor core. The detailed modeling will improve the safety and the economics of a nuclear reactor by eliminating un-necessary conservatism or missing consideration. To take advantage of such a cluster computer, efficient parallel algorithms must be developed. Mechanical structure analysis community has studied the domain decomposition method to solve the stress-strain equation using the finite element methods. One of the most successful domain decomposition method in terms of robustness is FETI-DP. We have modified the original FETI-DP to solve the eigenvalue problem for the multi-group diffusion problem in previous study. In this study, we report the result of recent modification to handle the three-dimensional subdomain partitioning, and the sub-domain multi-group problem. Modified FETI-DP algorithm has been successfully applied for the eigenvalue problem of multi-group neutron diffusion equation. The overall CPU time is decreasing as number of sub-domains (partitions) is increasing. However, there may be a limit in decrement due to increment of the number of primal points will increase the CPU time spent by the solution of the global equation. Even distribution of computational load (criterion a) is important to achieve fast computation. The subdomain partition can be effectively performed using suitable graph theory partition package such as MeTIS.
International Nuclear Information System (INIS)
Liu, T.; Du, X.; Ji, W.; Xu, G.; Brown, F.B.
2013-01-01
For nuclear reactor analysis such as the neutron eigenvalue calculations, the time consuming Monte Carlo (MC) simulations can be accelerated by using graphics processing units (GPUs). However, traditional MC methods are often history-based, and their performance on GPUs is affected significantly by the thread divergence problem. In this paper we describe the development of a newly designed event-based vectorized MC algorithm for solving the neutron eigenvalue problem. The code was implemented using NVIDIA's Compute Unified Device Architecture (CUDA), and tested on a NVIDIA Tesla M2090 GPU card. We found that although the vectorized MC algorithm greatly reduces the occurrence of thread divergence thus enhancing the warp execution efficiency, the overall simulation speed is roughly ten times slower than the history-based MC code on GPUs. Profiling results suggest that the slow speed is probably due to the memory access latency caused by the large amount of global memory transactions. Possible solutions to improve the code efficiency are discussed. (authors)
Energy Technology Data Exchange (ETDEWEB)
Menke, Lorenz Harry, E-mail: lnz2004@mindspring.com [University of Pittsburgh (United States)
2012-05-15
This paper derives all 36 analytical solutions of the energy eigenvalues for nuclear electric quadrupole interaction Hamiltonian and equivalent rigid asymmetric rotor for polynomial degrees 1 through 4 using classical algebraic theory. By the use of double-parameterization the full general solution sets are illustrated in a compact, symmetric, structural, and usable form that is valid for asymmetry parameter {eta} is an element of (- {infinity}, + {infinity}). These results are useful for code developers in the area of Perturbed Angular Correlation (PAC), Nuclear Quadrupole Resonance (NQR) and rotational spectroscopy who want to offer exact solutions whenever possible, rather that resorting to numerical solutions. In addition, by using standard linear algebra methods, the characteristic equations of all integer and half-integer spins I from 0 to 15, inclusive are represented in a compact and naturally parameterized form that illustrates structure and symmetries. This extends Nielson's listing of characteristic equations for integer spins out to I = 15, inclusive.
Yamamoto, Takuya; Nishigaki, Shinsuke M.
2018-02-01
We compute individual distributions of low-lying eigenvalues of a chiral random matrix ensemble interpolating symplectic and unitary symmetry classes by the Nyström-type method of evaluating the Fredholm Pfaffian and resolvents of the quaternion kernel. The one-parameter family of these distributions is shown to fit excellently the Dirac spectra of SU(2) lattice gauge theory with a constant U(1) background or dynamically fluctuating U(1) gauge field, which weakly breaks the pseudoreality of the unperturbed SU(2) Dirac operator. The observed linear dependence of the crossover parameter with the strength of the U(1) perturbations leads to precise determination of the pseudo-scalar decay constant, as well as the chiral condensate in the effective chiral Lagrangian of the AI class.
International Nuclear Information System (INIS)
Tanaka, Yuho; Uruma, Kazunori; Furukawa, Toshihiro; Nakao, Tomoki; Izumi, Kenya; Utsumi, Hiroaki
2017-01-01
This paper deals with an analysis problem for diffusion-ordered NMR spectroscopy (DOSY). DOSY is formulated as a matrix factorization problem of a given observed matrix. In order to solve this problem, a direct exponential curve resolution algorithm (DECRA) is well known. DECRA is based on singular value decomposition; the advantage of this algorithm is that the initial value is not required. However, DECRA requires a long calculating time, depending on the size of the given observed matrix due to the singular value decomposition, and this is a serious problem in practical use. Thus, this paper proposes a new analysis algorithm for DOSY to achieve a short calculating time. In order to solve matrix factorization for DOSY without using singular value decomposition, this paper focuses on the size of the given observed matrix. The observed matrix in DOSY is also a rectangular matrix with more columns than rows, due to limitation of the measuring time; thus, the proposed algorithm transforms the given observed matrix into a small observed matrix. The proposed algorithm applies the eigenvalue decomposition and the difference approximation to the small observed matrix, and the matrix factorization problem for DOSY is solved. The simulation and a data analysis show that the proposed algorithm achieves a lower calculating time than DECRA as well as similar analysis result results to DECRA. (author)
Directory of Open Access Journals (Sweden)
Yudong Zhang
2015-03-01
Full Text Available Background: Developing an accurate computer-aided diagnosis (CAD system of MR brain images is essential for medical interpretation and analysis. In this study, we propose a novel automatic CAD system to distinguish abnormal brains from normal brains in MRI scanning. Methods: The proposed method simplifies the task to a binary classification problem. We used discrete wavelet packet transform (DWPT to extract wavelet packet coefficients from MR brain images. Next, Shannon entropy (SE and Tsallis entropy (TE were harnessed to obtain entropy features from DWPT coefficients. Finally, generalized eigenvalue proximate support vector machine (GEPSVM, and GEPSVM with radial basis function (RBF kernel, were employed as classifier. We tested the four proposed diagnosis methods (DWPT + SE + GEPSVM, DWPT + TE + GEPSVM, DWPT + SE + GEPSVM + RBF, and DWPT + TE + GEPSVM + RBF on three benchmark datasets of Dataset-66, Dataset-160, and Dataset-255. Results: The 10 repetition of K-fold stratified cross validation results showed the proposed DWPT + TE + GEPSVM + RBF method excelled not only other three proposed classifiers but also existing state-of-the-art methods in terms of classification accuracy. In addition, the DWPT + TE + GEPSVM + RBF method achieved accuracy of 100%, 100%, and 99.53% on Dataset-66, Dataset-160, and Dataset-255, respectively. For Dataset-255, the offline learning cost 8.4430s and online prediction cost merely 0.1059s. Conclusions: We have proved the effectiveness of the proposed method, which achieved nearly 100% accuracy over three benchmark datasets.
International Nuclear Information System (INIS)
Furuhashi, Ichiro; Kasahara, Naoto
2002-01-01
Two types of finite element models analyzed eigenvalues of hot-leg pipelines of a large-scale sodium reactor. One is a beam element model, which is usual for pipe analyses. The other is a shell element model to evaluate particular modes in thin pipes with large diameters. Summary of analysis results: (1) A beam element model and a order natural frequency. A beam element model is available to get the first order vibration mode. (2) The maximum difference ratio of beam mode natural frequencies was 14% between a beam element model with no shear deformations and a shell element model. However, its difference becomes very small, when shear deformations are considered in beam element. (3) In the first order horizontal mode, the Y-piece acts like a pendulum, and the elbow acts like the hinge. The natural frequency is strongly affected by the bending and shear rigidities of the outer supporting pipe. (4) In the first order vertical mode, the vertical sections of the outer and inner pipes moves in the axial-directional piston mode, the horizontal section of inner pipe behaves like the cantilever, and the elbow acts like the hinge. The natural frequency is strongly affected by the axial rigidity of outer supporting pipe. (5) Both effective masses and participation factors were small for particular shell modes. (author)
Energy Technology Data Exchange (ETDEWEB)
Chang, Jonghwa [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2014-05-15
Parallelization of Monte Carlo simulation is widely adpoted. There are also several parallel algorithms developed for the SN transport theory using the parallel wave sweeping algorithm and for the CPM using parallel ray tracing. For practical purpose of reactor physics application, the thermal feedback and burnup effects on the multigroup cross section should be considered. In this respect, the domain decomposition method(DDM) is suitable for distributing the expensive cross section calculation work. Parallel transport code and diffusion code based on the Raviart-Thomas mixed finite element method was developed. However most of the developed methods rely on the heuristic convergence of flux and current at the domain interfaces. Convergence was not attained in some cases. Mechanical stress computation community has also work on the DDM to solve the stress-strain equation using the finite element methods. The most successful domain decomposition method in terms of robustness is FETI-DP. We have modified the original FETI-DP to solve the eigenvalue problem for the multigroup diffusion problem in this study.
Tan, Zhengguo; Hohage, Thorsten; Kalentev, Oleksandr; Joseph, Arun A; Wang, Xiaoqing; Voit, Dirk; Merboldt, K Dietmar; Frahm, Jens
2017-12-01
The purpose of this work is to develop an automatic method for the scaling of unknowns in model-based nonlinear inverse reconstructions and to evaluate its application to real-time phase-contrast (RT-PC) flow magnetic resonance imaging (MRI). Model-based MRI reconstructions of parametric maps which describe a physical or physiological function require the solution of a nonlinear inverse problem, because the list of unknowns in the extended MRI signal equation comprises multiple functional parameters and all coil sensitivity profiles. Iterative solutions therefore rely on an appropriate scaling of unknowns to numerically balance partial derivatives and regularization terms. The scaling of unknowns emerges as a self-adjoint and positive-definite matrix which is expressible by its maximal eigenvalue and solved by power iterations. The proposed method is applied to RT-PC flow MRI based on highly undersampled acquisitions. Experimental validations include numerical phantoms providing ground truth and a wide range of human studies in the ascending aorta, carotid arteries, deep veins during muscular exercise and cerebrospinal fluid during deep respiration. For RT-PC flow MRI, model-based reconstructions with automatic scaling not only offer velocity maps with high spatiotemporal acuity and much reduced phase noise, but also ensure fast convergence as well as accurate and precise velocities for all conditions tested, i.e. for different velocity ranges, vessel sizes and the simultaneous presence of signals with velocity aliasing. In summary, the proposed automatic scaling of unknowns in model-based MRI reconstructions yields quantitatively reliable velocities for RT-PC flow MRI in various experimental scenarios. Copyright © 2017 John Wiley & Sons, Ltd.
Generalized eigenvalue based spectrum sensing
Shakir, Muhammad; Alouini, Mohamed-Slim
2012-01-01
of the decision threshold of the respective detectors. The decision threshold has been calculated in a closed form which is based on the approximation of Cumulative Distribution Functions (CDFs) of the respective test statistics. In this context, we exchange
Broadband Utilization of Eigenvalue Techniques
Directory of Open Access Journals (Sweden)
Z. Kus
1996-06-01
Full Text Available A large number of signal processing problems are concerned with estimating unknown parameters from sensor array measurement. This paper presents simple algorithm for estimating spatio-temporal spectrum of signals received by passive array derivated from MUSIC algorithm, based on eigenstructure of covariance matrices of received signals. Some simulation results are presented.
Transmission eigenvalues and thermoacoustic tomography
International Nuclear Information System (INIS)
Finch, David; Hickmann, Kyle S
2013-01-01
The spectrum of the interior transmission problem is related to the unique determination of the acoustic properties of a body in thermoacoustic imaging. Under a non-trapping hypothesis, we show that sparsity of the interior transmission spectrum implies a range separation condition for the thermoacoustic operator. In odd dimensions greater than or equal to 3, we prove that the interior transmission spectrum for a pair of radially symmetric non-trapping sound speeds is countable, and conclude that the ranges of the associated thermoacoustic maps have only trivial intersection. (paper)
Directory of Open Access Journals (Sweden)
Akimov Pavel Alekseevich
2012-10-01
Full Text Available The proposed paper covers the operator-related formulation of the eigenvalue problem of analysis of a three-dimensional structure that has piecewise-constant physical and geometrical parameters alongside the so-called basic direction within the framework of a discrete-continual approach (a discrete-continual finite element method, a discrete-continual variation method. Generally, discrete-continual formulations represent contemporary mathematical models that become available for computer implementation. They make it possible for a researcher to consider the boundary effects whenever particular components of the solution represent rapidly varying functions. Another feature of discrete-continual methods is the absence of any limitations imposed on lengths of structures. The three-dimensional problem of elasticity is used as the design model of a structure. In accordance with the so-called method of extended domain, the domain in question is embordered by an extended one of an arbitrary shape. At the stage of numerical implementation, relative key features of discrete-continual methods include convenient mathematical formulas, effective computational patterns and algorithms, simple data processing, etc. The authors present their formulation of the problem in question for an isotropic medium with allowance for supports restrained by elastic elements while standard boundary conditions are also taken into consideration.
International Nuclear Information System (INIS)
Sood, Avnet; Forster, R. Arthur; Parsons, D. Kent
2001-01-01
Monte Carlo simulations of nuclear criticality eigenvalue problems are often performed by general purpose radiation transport codes such as MCNP. MCNP performs detailed statistical analysis of the criticality calculation and provides feedback to the user with warning messages, tables, and graphs. The purpose of the analysis is to provide the user with sufficient information to assess spatial convergence of the eigenfunction and thus the validity of the criticality calculation. As a test of this statistical analysis package in MCNP, analytic criticality verification benchmark problems have been used for the first time to assess the performance of the criticality convergence tests in MCNP. The MCNP statistical analysis capability has been recently assessed using the 75 multigroup criticality verification analytic problem test set. MCNP was verified with these problems at the 10 -4 to 10 -5 statistical error level using 40 000 histories per cycle and 2000 active cycles. In all cases, the final boxed combined k eff answer was given with the standard deviation and three confidence intervals that contained the analytic k eff . To test the effectiveness of the statistical analysis checks in identifying poor eigenfunction convergence, ten problems from the test set were deliberately run incorrectly using 1000 histories per cycle, 200 active cycles, and 10 inactive cycles. Six problems with large dominance ratios were chosen from the test set because they do not achieve the normal spatial mode in the beginning of the calculation. To further stress the convergence tests, these problems were also started with an initial fission source point 1 cm from the boundary thus increasing the likelihood of a poorly converged initial fission source distribution. The final combined k eff confidence intervals for these deliberately ill-posed problems did not include the analytic k eff value. In no case did a bad confidence interval go undetected. Warning messages were given signaling that
Spegazzini, Nicolas; Siesler, Heinz W; Ozaki, Yukihiro
2012-08-02
The doublet of the ν(C=O) carbonyl band in isomeric urethane systems has been extensively discussed in qualitative terms on the basis of FT-IR spectroscopy of the macromolecular structures. Recently, a reaction extent model was proposed as an inverse kinetic problem for the synthesis of diphenylurethane for which hydrogen-bonded and non-hydrogen-bonded C=O functionalities were identified. In this article, the heteronuclear C=O···H-N hydrogen bonding in the isomeric structure of diphenylurethane synthesized from phenylisocyanate and phenol was investigated via FT-IR spectroscopy, using a methodology of regularization for the inverse reaction extent model through an eigenvalue problem. The kinetic and thermodynamic parameters of this system were derived directly from the spectroscopic data. The activation and thermodynamic parameters of the isomeric structures of diphenylurethane linked through a hydrogen bonding equilibrium were studied. The study determined the enthalpy (ΔH = 15.25 kJ/mol), entropy (TΔS = 14.61 kJ/mol), and free energy (ΔG = 0.6 kJ/mol) of heteronuclear C=O···H-N hydrogen bonding by FT-IR spectroscopy through direct calculation from the differences in the kinetic parameters (δΔ(‡)H, -TδΔ(‡)S, and δΔ(‡)G) at equilibrium in the chemical reaction system. The parameters obtained in this study may contribute toward a better understanding of the properties of, and interactions in, supramolecular systems, such as the switching behavior of hydrogen bonding.
Absence of embedded eigenvalues for Riemannian Laplacians
DEFF Research Database (Denmark)
Ito, Kenichi; Skibsted, Erik
Schrödinger operators on non-compact connected Riemannian manifolds. A principal example is given by a manifold with an end (possibly more than one) in which geodesic coordinates are naturally defined. In this case one of our geometric conditions is a positive lower bound of the second fundamenta...
Methods of intermediate problems for eigenvalues
Weinstein, Alexander
1972-01-01
In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank mat
Iterative approach for the eigenvalue problems
Indian Academy of Sciences (India)
the Schrödinger equation for the energy levels with a class of confining potentials [3] using Kato–Rellich ... Moreover,. QES problem has its own inner mathematical beauty – it can provide a good starting point for doing ... this technique for calculating the first- and second-order corrections for the ground state as well as the ...
Scientific computing vol II - eigenvalues and optimization
Trangenstein, John A
2017-01-01
This is the second of three volumes providing a comprehensive presentation of the fundamentals of scientific computing. This volume discusses more advanced topics than volume one, and is largely not a prerequisite for volume three. This book and its companions show how to determine the quality of computational results, and how to measure the relative efficiency of competing methods. Readers learn how to determine the maximum attainable accuracy of algorithms, and how to select the best method for computing problems. This book also discusses programming in several languages, including C++, Fortran and MATLAB. There are 49 examples, 110 exercises, 66 algorithms, 24 interactive JavaScript programs, 77 references to software programs and 1 case study. Topics are introduced with goals, literature references and links to public software. There are descriptions of the current algorithms in LAPACK, GSLIB and MATLAB. This book could be used for a second course in numerical methods, for either upper level undergraduate...
Eigenvalues, embeddings and generalised trigonometric functions
Lang, Jan
2011-01-01
The main theme of the book is the study, from the standpoint of s-numbers, of integral operators of Hardy type and related Sobolev embeddings. In the theory of s-numbers the idea is to attach to every bounded linear map between Banach spaces a monotone decreasing sequence of non-negative numbers with a view to the classification of operators according to the way in which these numbers approach a limit: approximation numbers provide an especially important example of such numbers. The asymptotic behavior of the s-numbers of Hardy operators acting between Lebesgue spaces is determined here in a wide variety of cases. The proof methods involve the geometry of Banach spaces and generalized trigonometric functions; there are connections with the theory of the p-Laplacian.
Eigenvalue distribution of large random matrices
Pastur, Leonid
2011-01-01
Random matrix theory is a wide and growing field with a variety of concepts, results, and techniques and a vast range of applications in mathematics and the related sciences. The book, written by well-known experts, offers beginners a fairly balanced collection of basic facts and methods (Part 1 on classical ensembles) and presents experts with an exposition of recent advances in the subject (Parts 2 and 3 on invariant ensembles and ensembles with independent entries). The text includes many of the authors' results and methods on several main aspects of the theory, thus allowing them to present a unique and personal perspective on the subject and to cover many topics using a unified approach essentially based on the Stieltjes transform and orthogonal polynomials. The exposition is supplemented by numerous comments, remarks, and problems. This results in a book that presents a detailed and self-contained treatment of the basic random matrix ensembles and asymptotic regimes. This book will be an important refer...
Biases in Monte Carlo eigenvalue calculations
Energy Technology Data Exchange (ETDEWEB)
Gelbard, E.M.
1992-12-01
The Monte Carlo method has been used for many years to analyze the neutronics of nuclear reactors. In fact, as the power of computers has increased the importance of Monte Carlo in neutronics has also increased, until today this method plays a central role in reactor analysis and design. Monte Carlo is used in neutronics for two somewhat different purposes, i.e., (a) to compute the distribution of neutrons in a given medium when the neutron source-density is specified, and (b) to compute the neutron distribution in a self-sustaining chain reaction, in which case the source is determined as the eigenvector of a certain linear operator. In (b), then, the source is not given, but must be computed. In the first case (the ``fixed-source`` case) the Monte Carlo calculation is unbiased. That is to say that, if the calculation is repeated (``replicated``) over and over, with independent random number sequences for each replica, then averages over all replicas will approach the correct neutron distribution as the number of replicas goes to infinity. Unfortunately, the computation is not unbiased in the second case, which we discuss here.
Biases in Monte Carlo eigenvalue calculations
Energy Technology Data Exchange (ETDEWEB)
Gelbard, E.M.
1992-01-01
The Monte Carlo method has been used for many years to analyze the neutronics of nuclear reactors. In fact, as the power of computers has increased the importance of Monte Carlo in neutronics has also increased, until today this method plays a central role in reactor analysis and design. Monte Carlo is used in neutronics for two somewhat different purposes, i.e., (a) to compute the distribution of neutrons in a given medium when the neutron source-density is specified, and (b) to compute the neutron distribution in a self-sustaining chain reaction, in which case the source is determined as the eigenvector of a certain linear operator. In (b), then, the source is not given, but must be computed. In the first case (the fixed-source'' case) the Monte Carlo calculation is unbiased. That is to say that, if the calculation is repeated ( replicated'') over and over, with independent random number sequences for each replica, then averages over all replicas will approach the correct neutron distribution as the number of replicas goes to infinity. Unfortunately, the computation is not unbiased in the second case, which we discuss here.
Maximization of eigenvalues using topology optimization
DEFF Research Database (Denmark)
Pedersen, Niels Leergaard
2000-01-01
to localized modes in low density areas. The topology optimization problem is formulated using the SIMP method. Special attention is paid to a numerical method for removing localized eigenmodes in low density areas. The method is applied to numerical examples of maximizing the first eigenfrequency, One example...
Sparse random matrices: The eigenvalue spectrum revisited
International Nuclear Information System (INIS)
Semerjian, Guilhem; Cugliandolo, Leticia F.
2003-08-01
We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum. (author)
Biases in Monte Carlo eigenvalue calculations
International Nuclear Information System (INIS)
Gelbard, E.M.
1992-01-01
The Monte Carlo method has been used for many years to analyze the neutronics of nuclear reactors. In fact, as the power of computers has increased the importance of Monte Carlo in neutronics has also increased, until today this method plays a central role in reactor analysis and design. Monte Carlo is used in neutronics for two somewhat different purposes, i.e., (a) to compute the distribution of neutrons in a given medium when the neutron source-density is specified, and (b) to compute the neutron distribution in a self-sustaining chain reaction, in which case the source is determined as the eigenvector of a certain linear operator. In (b), then, the source is not given, but must be computed. In the first case (the ''fixed-source'' case) the Monte Carlo calculation is unbiased. That is to say that, if the calculation is repeated (''replicated'') over and over, with independent random number sequences for each replica, then averages over all replicas will approach the correct neutron distribution as the number of replicas goes to infinity. Unfortunately, the computation is not unbiased in the second case, which we discuss here
Transposes, L-Eigenvalues and Invariants of Third Order Tensors
Qi, Liqun
2017-01-01
Third order tensors have wide applications in mechanics, physics and engineering. The most famous and useful third order tensor is the piezoelectric tensor, which plays a key role in the piezoelectric effect, first discovered by Curie brothers. On the other hand, the Levi-Civita tensor is famous in tensor calculus. In this paper, we study third order tensors and (third order) hypermatrices systematically, by regarding a third order tensor as a linear operator which transforms a second order t...
Parameters of the lowest order chiral Lagrangian from fermion eigenvalues
International Nuclear Information System (INIS)
DeGrand, T.; Schaefer, S.
2007-08-01
Recent advances in Random Matrix Theory enable one to determine the pseudoscalar decay constant from the response of eigenmodes of quenched fermions to an imaginary isospin chemical potential. We perform a pilot test of this idea, from simulations with two flavors of dynamical overlap fermions. (orig.)
On the Eigenvalue Problem in Multipartite Quantum Systems
International Nuclear Information System (INIS)
Enríquez, M
2016-01-01
We show that the Hamiltonian of a multiqudit system can be diagonalized through a sequence of unitary transformations written in terms of Hubbard operators. As an application this formalism is applied to particular cases of two and three-qubit systems. (paper)
On solving energy-dependent partitioned eigenvalue problem by ...
Indian Academy of Sciences (India)
unknown stationary state wave functions (ψ) are expanded, viz. ψ = ∑N ... λ being a user-defined scalar that takes care of exponential overflow or underflow. Clearly, as ... Two new strings Si and Sk (the children strings) are then created by an.
Deflation of eigenvalues for iterative methods in lattice QCD
International Nuclear Information System (INIS)
Darnell, Dean; Morgan, Ronald B.; Wilcox, Walter
2004-01-01
Work on generalizing the deflated, restarted GMRES algorithm, useful in lattice studies using stochastic noise methods, is reported. We first show how the multi-mass extension of deflated GMRES can be implemented. We then give a deflated GMRES method that can be used on multiple right-hand sides of Aχ = b in an efficient manner. We also discuss and give numerical results on the possibilty of combining deflated GMRES for the first right hand side with a deflated BiCGStab algorithm for the subsequent right hand sides
On the nonnegative inverse eigenvalue problem of traditional matrices
Directory of Open Access Journals (Sweden)
Alimohammad Nazari
2014-07-01
Full Text Available In this paper, at first for a given set of real or complex numbers $\\sigma$ with nonnegativesummation, we introduce some special conditions that with them there is no nonnegativetridiagonal matrix in which $\\sigma$ is its spectrum. In continue we present some conditions forexistence such nonnegative tridiagonal matrices.
Generalization of Samuelson's inequality and location of eigenvalues
Indian Academy of Sciences (India)
Department of Mathematics, H. P. University, Shimla 171 005, India ... Refinements, extensions and applications of such inequalities have been studied ..... Samuelson inequality with extensions and applications in statistics and matrix theory,.
A generalized Fucik type eigenvalue problem for p-Laplacian
Directory of Open Access Journals (Sweden)
Yuanji Cheng
2009-03-01
\\left\\{\\begin{array}{lll} - (\\varphi( u' ' = \\psi(u, \\quad -T1.$ We obtain a explicit characterization of Fucik spectrum $(\\alpha, \\beta, \\lambda, \\mu,$ i.e., for which the (* has a nontrivial solution.
Convergence testing for MCNP5 Monte Carlo eigenvalue calculations
International Nuclear Information System (INIS)
Brown, F.; Nease, B.; Cheatham, J.
2007-01-01
Determining convergence of Monte Carlo criticality problems is complicated by the statistical noise inherent in the random, walks of the neutrons in each generation. The latest version of MCNP5 incorporates an important new tool for assessing convergence: the Shannon entropy of the fission source distribution, H src . Shannon entropy is a well-known concept from information theory and provides a single number for each iteration to help characterize convergence trends for the fission source distribution. MCNP5 computes H src for each iteration, and these values may be plotted to examine convergence trends. Convergence testing should include both k eff and H src , since the fission distribution will converge more slowly than k eff , especially when the dominance ratio is close to 1.0. (authors)
On perturbation of eigenvalues embedded at thresholds in a two ...
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
In this paper we consider two channel Hamiltonians of the form H(g) = H0 +gV ... space Ka, densely and continuously embedded in Ha, such that we have an asymptotic ... the asymptotic expansion with the Feshbach formula for the resolvent ofH(g) and ... Under these assumptions we can introduce four constants that will be ...
Remarks on interior transmission eigenvalues, Weyl formula and branching billiards
International Nuclear Information System (INIS)
Lakshtanov, E; Vainberg, B
2012-01-01
This paper contains the Weyl formula for the counting function of the interior transmission problem when the latter is parameter elliptic. Branching billiard trajectories are constructed, and the second term of the Weyl asymptotics is estimated from above under some conditions on the set of periodic billiard trajectories. (paper)
An iterative method for determination of a minimal eigenvalue
DEFF Research Database (Denmark)
Kristiansen, G.K.
1968-01-01
Kristiansen (1963) has discussed the convergence of a group of iterative methods (denoted the Equipoise methods) for the solution of reactor criticality problems. The main result was that even though the methods are said to work satisfactorily in all practical cases, examples of divergence can be...
Detection of Wind Turbine Power Performance Abnormalities Using Eigenvalue Analysis
DEFF Research Database (Denmark)
Skrimpas, Georgios Alexandros; Sweeney, Christian Walsted; Marhadi, Kun Saptohartyadi
2014-01-01
Condition monitoring of wind turbines is a field of continu- ous research and development as new turbine configurations enter into the market and new failure modes appear. Systems utilising well established techniques from the energy and in- dustry sector, such as vibration analysis...
Emotion recognition using eigenvalues and Levenberg–Marquardt ...
Indian Academy of Sciences (India)
Vilas H Gaidhane
The robustness of the proposed approach is also tested on low-resolution facial ... The visual perception of human emotion is .... Kanade database and the experimental results are explained in .... After detailed study and analysis on image.
Existence of Positive Solutions for Nonlinear Eigenvalue Problems
Directory of Open Access Journals (Sweden)
Wong Fu-Hsiang
2010-01-01
Full Text Available We use a fixed point theorem in a cone to obtain the existence of positive solutions of the differential equation, , , with some suitable boundary conditions, where is a parameter.
Existence of Positive Solutions for Nonlinear Eigenvalue Problems
Directory of Open Access Journals (Sweden)
Fan-Kai Kung
2010-01-01
Full Text Available We use a fixed point theorem in a cone to obtain the existence of positive solutions of the differential equation, u″+λf(t,u=0, 0
Positive solutions and eigenvalues of nonlocal boundary-value problems
Directory of Open Access Journals (Sweden)
Jifeng Chu
2005-07-01
Full Text Available We study the ordinary differential equation $x''+lambda a(tf(x=0$ with the boundary conditions $x(0=0$ and $x'(1=int_{eta}^{1}x'(sdg(s$. We characterize values of $lambda$ for which boundary-value problem has a positive solution. Also we find appropriate intervals for $lambda$ so that there are two positive solutions.
Approximate eigenvalue determination of geometrically frustrated magnetic molecules
Directory of Open Access Journals (Sweden)
A.M. Läuchli
2009-01-01
Full Text Available Geometrically frustrated magnetic molecules have attracted a lot of interest in the field of molecular magnetism as well as frustrated Heisenberg antiferromagnets. In this article we demonstrate how an approximate diagonalization scheme can be used in order to obtain thermodynamic and spectroscopic information about frustrated magnetic molecules. To this end we theoretically investigate an antiferromagnetically coupled spin system with cuboctahedral structure modeled by an isotropic Heisenberg Hamiltonian.
Kernel based eigenvalue-decomposition methods for analysing ham
DEFF Research Database (Denmark)
Christiansen, Asger Nyman; Nielsen, Allan Aasbjerg; Møller, Flemming
2010-01-01
methods, such as PCA, MAF or MNF. We therefore investigated the applicability of kernel based versions of these transformation. This meant implementing the kernel based methods and developing new theory, since kernel based MAF and MNF is not described in the literature yet. The traditional methods only...... have two factors that are useful for segmentation and none of them can be used to segment the two types of meat. The kernel based methods have a lot of useful factors and they are able to capture the subtle differences in the images. This is illustrated in Figure 1. You can see a comparison of the most...... useful factor of PCA and kernel based PCA respectively in Figure 2. The factor of the kernel based PCA turned out to be able to segment the two types of meat and in general that factor is much more distinct, compared to the traditional factor. After the orthogonal transformation a simple thresholding...
On the adiabatic theorem when eigenvalues dive into the continuum
DEFF Research Database (Denmark)
Cornean, Decebal Horia; Jensen, Arne; Knörr, Hans Konrad
2018-01-01
We consider a reduced two-channel model of an atom consisting of a quantum dot coupled to an open scattering channel described by a three-dimensional Laplacian. We are interested in the survival probability of a bound state when the dot energy varies smoothly and adiabatically in time. The initial...... in the adiabatic limit. At the end of the paper, we present a short outlook on how our method may be extended to cover other classes of Hamiltonians; details will be given elsewhere....
Haidar, Azzam; Ltaief, Hatem; Dongarra, Jack
2012-01-01
dynamic runtime system to multicore architectures. A detailed analysis of performance and accuracy is included. Performance improvements of 14-fold and 4-fold speedups are reported relative to LAPACK and Intel's Math Kernel Library.
Eigenvalue Tests and Distributions for Small Sample Order Determination for Complex Wishart Matrices
1994-08-13
does not apply. The physical world is much nicer because we never have the case of a truly deficient covariance matrix. The problem becomes one of...jJ(LLH --+ A)I =(2P ll(TkkLkk)2P)1 (ft Tk~kk-1) (2-P fpjL k=1 k=1k=1 PPP = IJ Tk2 = (det T) 2p = (det TTH)P = (det B)P k=1 Therefore IJ(Y --+ A)l...proof. From theorem 32, (dZ) = [ft Tk2 -m-k] I [M) j + dT 3 ], [kk [(H~ffdH, )Tjj A ~j dTij (HHdH,) k=i= jjiI 437 Also, A = ZHZ = (H 1T)H(HIT) = THH HHIT
International Nuclear Information System (INIS)
Mueller, E.
2007-01-01
The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)
Directory of Open Access Journals (Sweden)
Leszek Majkut
Full Text Available In the work, in order to solve the inverse problem, i.e. the problem of finding values of the additional quantities (mass, elasticity, the beam inverse model was proposed. Analysis of this model allows finding such a value of additional mass (elasticity as a function of its localization so that the free vibration frequency changes to desirable value. The criteria for choice of the “proper” pair (mass - its position, including the criterion allowing changing the position of the vibration node of the second mode of the free vibrations, were given. Analysis of the influence of uncertainties in the determination of the additional quantity value and its position on the desired free vibration frequency was carried out, too. The proposed beam inverse model can be employing to identification of the beam cracks. In such a case, the input quantity is free vibration frequency measured on the damaged object. Each determined free-vibration frequency allows determining the flexibility curve for the spring modeling crack as a function of its position. The searched parameters of the crack (its depth and position are indicated by the common point of two arbitrary curves. Accuracy of crack parameters determination depends on accuracy (uncertainty of frequency measurement. Only some regions containing the searched crack parameters can be obtained in such a situation.
Directory of Open Access Journals (Sweden)
Leszek Majkut
Full Text Available In the work, the problems of the beam structural modification through coupling the additional mass or elastic support, as well as the problem of diagnostics of the beam cracks, are discussed. The common feature for both problems is that the material parameters in each of the discussed cases change only in one point (additional mass, the support in one point, the crack described by the elastic joint. These systems, after determination of the value of additional element and its localization, should have a given natural vibration frequency. In order to solve the inverse problem, i.e. the problem of finding values of the additional quantities (mass, elasticity, the beam inverse model was proposed. Analysis of this model allows finding such a value of additional mass (elasticity as a function of its localization so that the system has the free vibration frequency, which is desired in the modification problem or measured on the object in the diagnostics.
Energy Technology Data Exchange (ETDEWEB)
Mueller, E.
2007-12-15
The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)
On the Eigenvalues and Eigenvectors of Block Triangular Preconditioned Block Matrices
Pestana, Jennifer
2014-01-01
Block lower triangular matrices and block upper triangular matrices are popular preconditioners for 2×2 block matrices. In this note we show that a block lower triangular preconditioner gives the same spectrum as a block upper triangular preconditioner and that the eigenvectors of the two preconditioned matrices are related. © 2014 Society for Industrial and Applied Mathematics.
Dahlqvist, Per
1999-10-01
We estimate the error in the semiclassical trace formula for the Sinai billiard under the assumption that the largest source of error is due to penumbra diffraction: namely, diffraction effects for trajectories passing within a distance Ricons/Journals/Common/cdot" ALT="cdot" ALIGN="TOP"/>O((kR)-2/3) to the disc and trajectories being scattered in very forward directions. Here k is the momentum and R the radius of the scatterer. The semiclassical error is estimated by perturbing the Berry-Keating formula. The analysis necessitates an asymptotic analysis of very long periodic orbits. This is obtained within an approximation originally due to Baladi, Eckmann and Ruelle. We find that the average error, for sufficiently large values of kR, will exceed the mean level spacing.
CoFFEE: Corrections For Formation Energy and Eigenvalues for charged defect simulations
Naik, Mit H.; Jain, Manish
2018-05-01
Charged point defects in materials are widely studied using Density Functional Theory (DFT) packages with periodic boundary conditions. The formation energy and defect level computed from these simulations need to be corrected to remove the contributions from the spurious long-range interaction between the defect and its periodic images. To this effect, the CoFFEE code implements the Freysoldt-Neugebauer-Van de Walle (FNV) correction scheme. The corrections can be applied to charged defects in a complete range of material shapes and size: bulk, slab (or two-dimensional), wires and nanoribbons. The code is written in Python and features MPI parallelization and optimizations using the Cython package for slow steps.
Finite Element-Galerkin Approximation of the Eigenvalues of Eigenvectors of Selfadjoint Problems
1988-07-01
l’ "k, + 1. Combining (3.20), (3.22), and the fact that I-Eh(Ak ) and Ph are orthogonal projections we have I(I-Eh(Xk,)) PhUB 5 Si (I-Eh(xk)) PhT(Ph-I...Its adjoint are equal. (3.23) implies Hf(I-Eh(1kI )Ph)u{1B - P(IPh)UIBI 5 I(I-Eh(Ak )) PhuB -< d i ii ( Ph- I )T II H B_--H,3 1(P h- I ) u liB , and
Eigenvalue distributions of correlated multichannel transfer matrices in strongly scattering systems
Sprik, R.; Tourin, A.; de Rosny, J.; Fink, M.
2008-01-01
We experimentally study the effects of correlations in the propagation of ultrasonic waves in water from a multielement source to a multielement detector through a strongly scattering system of randomly placed vertical rods. Due to the strong scattering, the wave transport in the sample is in the
On the extrema of Dirichlet's first eigenvalue of a family of punctured ...
Indian Academy of Sciences (India)
a closed linear subspace of Hs( ) × L2( ). Then by Hahn-Banach theorem there exists l1 ∈ (Hs( ) × L2( ))∗ such that l1 ◦ T = l and ||l1||op = ||l||op where ||l||op denotes the operator norm of l. Consider Ps × Id : Hs( )×L2( ) → Hs(Rd)×L2( ). We can write Hs(Rd) = Ps(Hs( )) ⊕ Z for some closed linear subspace Z of Hs(Rd). Then.
STRANGE ATTRACTORS IN SYMMETRIC UNFOLDINGS OF A SINGULARITY WITH THREE-FOLD ZERO EIGENVALUE
Institute of Scientific and Technical Information of China (English)
Qinghua Zhou
2009-01-01
In this paper, we study the Sil'nikov heteroclinic bifurcations, which display strange attractors, for the symmetric versal unfoldings of the singularity at the origin with a nilpotent Linear part and 3-jet, using the normal form, the blow-up and the ge-neralized Mel'nikov methods of heteroclinic orbits to two hyperbolic or nonhyperbolic equilibria in a high-dimensional space.
An Inverse Eigenvalue Problem for a Vibrating String with Two Dirichlet Spectra
Rundell, William; Sacks, Paul
2013-01-01
A classical inverse problem is "can you hear the density of a string clamped at both ends?" The mathematical model gives rise to an inverse Sturm-Liouville problem for the unknown density ñ, and it is well known that the answer is negative
On the asymptotic of an eigenvalue problem with 2n2n2n interior ...
Indian Academy of Sciences (India)
Department of Mathematics, Faculty of Basic Sciences, Mazandaran University, ... the present paper is to transform (1) into a regular equation, in the sense that, eq. (1) ..... We show first that the integrated term of I111 is continuous at ci.
Analytic Solution of the Electromagnetic Eigenvalues Problem in a Cylindrical Resonator
Energy Technology Data Exchange (ETDEWEB)
Checchin, Mattia [Fermilab; Martinello, Martina [Fermilab
2016-10-06
Resonant accelerating cavities are key components in modern particles accelerating facilities. These take advantage of electromagnetic fields resonating at microwave frequencies to accelerate charged particles. Particles gain finite energy at each passage through a cavity if in phase with the resonating field, reaching energies even of the order of $TeV$ when a cascade of accelerating resonators are present. In order to understand how a resonant accelerating cavity transfers energy to charged particles, it is important to determine how the electromagnetic modes are exited into such resonators. In this paper we present a complete analytical calculation of the resonating fields for a simple cylindrical-shaped cavity.
Robust periodic steady state analysis of autonomous oscillators based on generalized eigenvalues
Mirzavand, R.; Maten, ter E.J.W.; Beelen, T.G.J.; Schilders, W.H.A.; Abdipour, A.
2011-01-01
In this paper, we present a new gauge technique for the Newton Raphson method to solve the periodic steady state (PSS) analysis of free-running oscillators in the time domain. To find the frequency a new equation is added to the system of equations. Our equation combines a generalized eigenvector
Robust periodic steady state analysis of autonomous oscillators based on generalized eigenvalues
Mirzavand, R.; Maten, ter E.J.W.; Beelen, T.G.J.; Schilders, W.H.A.; Abdipour, A.; Michielsen, B.; Poirier, J.R.
2012-01-01
In this paper, we present a new gauge technique for the Newton Raphson method to solve the periodic steady state (PSS) analysis of free-running oscillators in the time domain. To find the frequency a new equation is added to the system of equations. Our equation combines a generalized eigenvector
Matrix eigenvalue method for free-oscillations modelling of spherical elastic bodies
Czech Academy of Sciences Publication Activity Database
Zábranová, Eliška; Hanyk, L.; Matyska, C.
2017-01-01
Roč. 211, č. 2 (2017), s. 1254-1271 ISSN 0956-540X Institutional support: RVO:67985891 Keywords : numerical solutions * surface waves and free oscillations Subject RIV: DC - Siesmology, Volcanology, Earth Structure OBOR OECD: Geology Impact factor: 2.414, year: 2016
A state space approach for the eigenvalue problem of marine risers
Alfosail, Feras
2017-10-05
A numerical state-space approach is proposed to examine the natural frequencies and critical buckling limits of marine risers. A large axial tension in the riser model causes numerical limitations. These limitations are overcome by using the modified Gram–Schmidt orthonormalization process as an intermediate step during the numerical integration process with the fourth-order Runge–Kutta scheme. The obtained results are validated against those obtained with other numerical methods, such as the finite-element, Galerkin, and power-series methods, and are found to be in good agreement. The state-space approach is shown to be computationally more efficient than the other methods. Also, we investigate the effect of a high applied tension, a high apparent weight, and higher-order modes on the accuracy of the numerical scheme. We demonstrate that, by applying the orthonormalization process, the stability and convergence of the approach are significantly improved.
Directory of Open Access Journals (Sweden)
Pablo Rivero
2015-06-01
Full Text Available We present in this article a pseudopotential (PP database for DFT calculations in the context of the SIESTA code [1–3]. Comprehensive optimized PPs in two formats (psf files and input files for ATM program are provided for 20 chemical elements for LDA and GGA exchange-correlation potentials. Our data represents a validated database of PPs for SIESTA DFT calculations. Extensive transferability tests guarantee the usefulness of these PPs.
Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems
Jia, C. J.; Wang, Y.; Mendl, C. B.; Moritz, B.; Devereaux, T. P.
2018-03-01
We describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the "checkerboard" decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.
Electrodynamics as a problem of eigenvalues. III. Maxwell operator and perturbation theory
International Nuclear Information System (INIS)
Yudin, L.A.; Kapchinsky, M.I.; Korenev, I.L.; Efimov, S.P.
1996-01-01
This part of the work deals with perturbation theory. The standard technique permits us to solve problems of volume disturbances in free space, waveguides, and cavities, of disturbances of boundary conditions caused by finite conductivity of walls, and of disturbances of the boundary shape. Expressions for frequency and wave number shifts caused by the perturbation are obtained by the unified method. Several examples are presented: wave amplification in the waveguide filled with a resonant medium like an electron beam in a longitudinal magnetic field, the frequency shift (and increment/decrement) of a cavity loaded by an electron beam, and the field disturbance in the waveguide caused by finite conductivity of the walls. copyright 1996 American Institute of Physics
Solving eigenvalue problems on curved surfaces using the Closest Point Method
Macdonald, Colin B.; Brandman, Jeremy; Ruuth, Steven J.
2011-01-01
defined in the embedding space and the original surface problem. For open surfaces, we present a simple way to impose Dirichlet and Neumann boundary conditions while maintaining second-order accuracy. Convergence studies and a series of examples
Radial rescaling approach for the eigenvalue problem of a particle in an arbitrarily shaped box.
Lijnen, Erwin; Chibotaru, Liviu F; Ceulemans, Arnout
2008-01-01
In the present work we introduce a methodology for solving a quantum billiard with Dirichlet boundary conditions. The procedure starts from the exactly known solutions for the particle in a circular disk, which are subsequently radially rescaled in such a way that they obey the new boundary conditions. In this way one constructs a complete basis set which can be used to obtain the eigenstates and eigenenergies of the corresponding quantum billiard to a high level of precision. Test calculations for several regular polygons show the efficiency of the method which often requires one or two basis functions to describe the lowest eigenstates with high accuracy.
Spectral nodal method for one-speed X,Y-geometry Eigenvalue diffusion problems
International Nuclear Information System (INIS)
Dominguez, Dany S.; Lorenzo, Daniel M.; Hernandez, Carlos G.; Barros, Ricardo C.; Silva, Fernando C. da
2001-01-01
Presented here is a new numerical nodal method for steady-state multidimensional neutron diffusion equation in rectangular geometry. Our method is based on a spectral analysis of the transverse-integrated nodal diffusion equations. These equations are obtained by integrating the diffusion equation in X and Y directions, and then considering flat approximations for the transverse leakage terms. These flat approximations are the only approximations that we consider in this method; as a result the numerical solutions are completely free from truncation errors in slab geometry. We show numerical results to illustrate the method's accuracy for coarse mesh calculations in a heterogeneous medium. (author)
Thornton, W. A.; Majumder, D. K.
1974-01-01
The investigation reported demonstrates that in the case considered perturbation methods can be used in a straightforward manner to obtain reanalysis information. A perturbation formula for the buckling loads of a general shell of revolution is derived. The accuracy of the obtained relations and their range of application is studied with the aid of a specific example involving a particular stiffened shell of revolution.
Hamed, Haikel Ben; Bennacer, Rachid
2008-08-01
This work consists in evaluating algebraically and numerically the influence of a disturbance on the spectral values of a diagonalizable matrix. Thus, two approaches will be possible; to use the theorem of disturbances of a matrix depending on a parameter, due to Lidskii and primarily based on the structure of Jordan of the no disturbed matrix. The second approach consists in factorizing the matrix system, and then carrying out a numerical calculation of the roots of the disturbances matrix characteristic polynomial. This problem can be a standard model in the equations of the continuous media mechanics. During this work, we chose to use the second approach and in order to illustrate the application, we choose the Rayleigh-Bénard problem in Darcy media, disturbed by a filtering through flow. The matrix form of the problem is calculated starting from a linear stability analysis by a finite elements method. We show that it is possible to break up the general phenomenon into other elementary ones described respectively by a disturbed matrix and a disturbance. A good agreement between the two methods was seen. To cite this article: H.B. Hamed, R. Bennacer, C. R. Mecanique 336 (2008).
Eigenvalue and Entropy Statistics for Products of Conjugate Random Quantum Channels
Directory of Open Access Journals (Sweden)
Benoît Collins
2010-06-01
Full Text Available Using the graphical calculus and integration techniques introduced by the authors, we study the statistical properties of outputs of products of random quantum channels for entangled inputs. In particular, we revisit and generalize models of relevance for the recent counterexamples to the minimum output entropy additivity problems. Our main result is a classification of regimes for which the von Neumann entropy is lower on average than the elementary bounds that can be obtained with linear algebra techniques.
Efficient GW calculations using eigenvalue-eigenvector decomposition of the dielectric matrix
Nguyen, Huy-Viet; Pham, T. Anh; Rocca, Dario; Galli, Giulia
2011-03-01
During the past 25 years, the GW method has been successfully used to compute electronic quasi-particle excitation spectra of a variety of materials. It is however a computationally intensive technique, as it involves summations over occupied and empty electronic states, to evaluate both the Green function (G) and the dielectric matrix (DM) entering the expression of the screened Coulomb interaction (W). Recent developments have shown that eigenpotentials of DMs can be efficiently calculated without any explicit evaluation of empty states. In this work, we will present a computationally efficient approach to the calculations of GW spectra by combining a representation of DMs in terms of its eigenpotentials and a recently developed iterative algorithm. As a demonstration of the efficiency of the method, we will present calculations of the vertical ionization potentials of several systems. Work was funnded by SciDAC-e DE-FC02-06ER25777.
Bifurcations of Eigenvalues of Gyroscopic Systems with Parameters Near Stability Boundaries
DEFF Research Database (Denmark)
Seyranian, Alexander P.; Kliem, Wolfhard
1999-01-01
, as well as first derivatives of the system matrices (or operators) with respect to parameters. These results provide simple and constructive stability and instability criteria. The presented theory is exemplified by two mechanical problems: a rotating elastic shaft carrying a disk, and an axially moving...
An Inverse Eigenvalue Problem for a Vibrating String with Two Dirichlet Spectra
Rundell, William
2013-04-23
A classical inverse problem is "can you hear the density of a string clamped at both ends?" The mathematical model gives rise to an inverse Sturm-Liouville problem for the unknown density ñ, and it is well known that the answer is negative: the Dirichlet spectrum from the clamped end-point conditions is insufficient. There are many known ways to add additional information to gain a positive answer, and these include changing one of the boundary conditions and recomputing the spectrum or giving the energy in each eigenmode-the so-called norming constants. We make the assumption that neither of these changes are possible. Instead we will add known mass-densities to the string in a way we can prescribe and remeasure the Dirichlet spectrum. We will not be able to answer the uniqueness question in its most general form, but will give some insight to what "added masses" should be chosen and how this can lead to a reconstruction of the original string density. © 2013 Society for Industrial and Applied Mathematics.
Cessna Citation X Business Aircraft Eigenvalue Stability– Part 1: a New GUI for the LFRs Generation
Directory of Open Access Journals (Sweden)
Yamina BOUGHARI
2017-12-01
Full Text Available The aim of “Robustness Analysis” is to assess aircraft stability in the presence of all admissible uncertainties. Models that are able to describe the aircraft dynamics by taking into account all uncertainties over a region inside the flight envelope have therefore been developed, using Linear Fractional Representation (LFR. In this paper Part 1 a friendly Graphical User Interface is developed to facilitate the generation of Linear Fractional Representation uncertainty models for the Cessna Citation X aircraft using 12 weight and Xcg configurations; thus, 26 regions of the flight envelope are developed for different Weight/ Xcg configurations to study the aircraft’s longitudinal motion. In the aim to analyzed the robustness stability of Cessna Citation X in Part 2 using the Graphical User Interface developed in the Clearance Of Flight Control Laws Using Optimization (COFCLUO project. This project aimed to boost the aircraft safety using computer computation.
Vyas, Manan; Kota, V K B; Chavda, N D
2010-03-01
Finite interacting Fermi systems with a mean-field and a chaos generating two-body interaction are modeled by one plus two-body embedded Gaussian orthogonal ensemble of random matrices with spin degree of freedom [called EGOE(1+2)-s]. Numerical calculations are used to demonstrate that, as lambda , the strength of the interaction (measured in the units of the average spacing of the single-particle levels defining the mean-field), increases, generically there is Poisson to GOE transition in level fluctuations, Breit-Wigner to Gaussian transition in strength functions (also called local density of states) and also a duality region where information entropy will be the same in both the mean-field and interaction defined basis. Spin dependence of the transition points lambda_{c} , lambdaF, and lambdad , respectively, is described using the propagator for the spectral variances and the formula for the propagator is derived. We further establish that the duality region corresponds to a region of thermalization. For this purpose we compared the single-particle entropy defined by the occupancies of the single-particle orbitals with thermodynamic entropy and information entropy for various lambda values and they are very close to each other at lambda=lambdad.
Optimisation of the Lowest Robin Eigenvalue in the Exterior of a Compact Set
Czech Academy of Sciences Publication Activity Database
Krejčiřík, David; Lotoreichik, Vladimir
2018-01-01
Roč. 25, č. 1 (2018), s. 319-337 ISSN 0944-6532 R&D Projects: GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : Robin Laplacian * negative boundary parameter * exterior of a convex set * spectral isoperimetric inequality * spectral isochoric inequality * parallel coordinates Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.496, year: 2016
On eigenvalues of a PT-symmetric operator in a thin layer
Czech Academy of Sciences Publication Activity Database
Borisov, D. I.; Znojil, Miloslav
2017-01-01
Roč. 208, č. 2 (2017), s. 173-199 ISSN 1064-5616 R&D Projects: GA ČR GA16-22945S Institutional support: RVO:61389005 Keywords : thin domain * pT-symmetric operator * edge of a gap * asymptotics * periodic operator Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 0.721, year: 2016
Energy Technology Data Exchange (ETDEWEB)
Maiz, F., E-mail: Fethi_maiz@yahoo.fr [King Khalid University, Faculty of Science, Physics Department, P.O. Box 9004, Abha (Saudi Arabia); University of Cartage, Nabeul Engineering Preparatory Institute, Merazka, 8000 Nabeul (Tunisia); Eissa, S.A. [King Khalid University, Faculty of Science, Physics Department, P.O. Box 9004, Abha (Saudi Arabia); AL-AZHAR University, Faculty of Science, Physics Department, Nasr City, Cairo (Egypt); AlFaify, S. [King Khalid University, Faculty of Science, Physics Department, P.O. Box 9004, Abha (Saudi Arabia)
2013-09-15
Assuming an effective mass approximation and using Bastard's boundary conditions, a simple method for simultaneous determination of the energy levels forming the sub-band structure and the transmissions coefficient of non-symmetrical, non-periodical potential semiconducting heterostructure is being proposed. The method can be applied on a multilayer system with varying thickness and effective mass of the layers, and with potential that is neither periodical nor symmetrical. To illustrate the feasibility of the proposed method, cases of symmetrical rectangular triple-barrier structure with constant effective mass, multi-barrier semiconductor heterostructure (nine barriers–eight-wells), and monomer height barrier superlattices (300 barriers) systems have been examined. Findings show very good agreements with previously published results obtained by different methods on similar systems. The proposed method was found to be useful for any number of semiconducting layers arranged in any random way making it more realistic, simple, and applicable to superlattice analysis and for devices design.
DEFF Research Database (Denmark)
Yang, Li Hui; Xu, Zhao; Østergaard, Jacob
2010-01-01
This paper first presents the Hopf bifurcation analysis for a vector-controlled doubly fed induction generator (DFIG) which is widely used in wind power conversion systems. Using three-phase back-to-back pulse-width-modulated (PWM) converters, DFIG can keep stator frequency constant under variabl...
Eigenvalue problem and nonlinear evolution of kink modes in a toroidal plasma
International Nuclear Information System (INIS)
Ogino, T.; Takeda, S.; Sanuki, H.; Kamimura, T.
1979-04-01
The internal kink modes of a cylindrical plasma are investigated by a linear eigen value problem and their nonlinear evolution is studied by 3-dimensional MHD simulation based on the rectangular column model under the fixed boundary condition. The growth rates in two cases, namely uniform and diffused current profiles are analyzed in detail, which agree with the analytical estimation by Shafranov. The time evolution of the m = 1 mode showed that q > 1 is satisfied at the relaxation time (q safety factor), a stable configuration like a horse shoe (a new equilibrium) was formed. Also, the time evolution of the pressure p for the m = 2 mode showed that a stable configuration like a pair of anchors was formed. (author)
A state space approach for the eigenvalue problem of marine risers
Alfosail, Feras; Nayfeh, Ali H.; Younis, Mohammad I.
2017-01-01
A numerical state-space approach is proposed to examine the natural frequencies and critical buckling limits of marine risers. A large axial tension in the riser model causes numerical limitations. These limitations are overcome by using
Bound State Eigenvalues of the Schroedinger Eq. in two Spatial Variables.
Rawitscher, George H.; Koltracht, Israel
2002-08-01
An efficient spectral integral equation method (SIEM) has recently been developed for obtaining the scattering solution of a one-dimensional Schroedinger equation.(R.A. Gonzales, S.-Y. Kang, I. Koltracht and G. Rawitscher, J. of Comput. Phys. 153, 160 (1999).) The purpose of the present study is to extend this method to the case of bound-states in more than one dimension. Even though other methods have already been developed for this case, such as finite element methods, the application we have in mind is to solve the non-linear Bose-Einstein condensate case in the presence of an optical lattice. In the presence of a trapping potential alone, a B-E condensate solution has been obtained by a new iterative spectral method which solves the differential equation.(Y.-S. Choi, J. Javanainen, I. Koltracht, M. Koš)trun, P.J. McKenna and N. Savytska "A Fast Algorithm for the Solution of the Time-Independent Gross-Pitaevskii Equation," Submitted to Computational Physics. But this method becomes inadequate for the case that several potential barriers are also present. The reason that the SIEM is expected to be better suited is that it distributes the collocation points much more efficiently into partitions of variable size.
Czech Academy of Sciences Publication Activity Database
Landau, A.; Haritan, I.; Kaprálová-Žďánská, Petra Ruth; Moiseyev, N.
2016-01-01
Roč. 120, č. 19 (2016), s. 3098-3108 ISSN 1089-5639 R&D Projects: GA MŠk(CZ) LG13029 Institutional support: RVO:68378271 Keywords : autoionizing states * coordinate calculation * scattering resonances Subject RIV: CF - Physical ; Theoretical Chemistry OBOR OECD: Physical chemistry Impact factor: 2.847, year: 2016