A Combined Preconditioning Strategy for Nonsymmetric Systems

Energy Technology Data Exchange (ETDEWEB)

de Dios, B. Ayuso [Univ. of Bologna (Italy). Dept. of Mathematics; King Abdullah Univ. of Science and Technology, Thuwal (Saudi Arabia); Barker, A. T. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, P. S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2014-11-04

Here, we present and analyze a class of nonsymmetric preconditioners within a normal (weighted least-squares) matrix form for use in GMRES to solve nonsymmetric matrix problems that typically arise in finite element discretizations. An example of the additive Schwarz method applied to nonsymmetric but definite matrices is presented for which the abstract assumptions are verified. Variable preconditioner, which combines the original nonsymmetric one and a weighted least-squares version of it, and it is shown to be convergent and provides a viable strategy for using nonsymmetric preconditioners in practice. Numerical results are included to assess the theory and the performance of the proposed preconditioners.

The eigenvalue problem in phase space.

Science.gov (United States)

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.

Jacobi-Davidson methods for generalized MHD-eigenvalue problems

NARCIS (Netherlands)

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

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)

Nonsymmetric entropy and maximum nonsymmetric entropy principle

International Nuclear Information System (INIS)

Liu Chengshi

2009-01-01

Under the frame of a statistical model, the concept of nonsymmetric entropy which generalizes the concepts of Boltzmann's entropy and Shannon's entropy, is defined. Maximum nonsymmetric entropy principle is proved. Some important distribution laws such as power law, can be derived from this principle naturally. Especially, nonsymmetric entropy is more convenient than other entropy such as Tsallis's entropy in deriving power laws.

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.

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

Science.gov (United States)

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.

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

2nd International Workshop on Eigenvalue Problems : Algorithms, Software and Applications in Petascale Computing

CERN Document Server

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.

Solving complex band structure problems with the FEAST eigenvalue algorithm

Science.gov (United States)

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.

Estimates for lower order eigenvalues of a clamped plate problem

OpenAIRE

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.

Schiffer's Conjecture, Interior Transmission Eigenvalues and Invisibility Cloaking: Singular Problem vs. Nonsingular Problem

OpenAIRE

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.

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

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)

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.

Transmission eigenvalues

Science.gov (United States)

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

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

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.

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

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

Science.gov (United States)

Costiner, Sorin; Ta'asan, Shlomo

1995-07-01

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

On a 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

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)

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.

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.

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.

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.

Parallel Symmetric Eigenvalue Problem Solvers

Science.gov (United States)

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

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

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)

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

Numerical Investigations on Several Stabilized Finite Element Methods for the Stokes Eigenvalue Problem

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.

Solving eigenvalue problems on curved surfaces using the Closest Point Method

KAUST Repository

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.

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.

Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

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.

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.

Solving the generalized symmetric eigenvalue problem using tile algorithms on multicore architectures

KAUST Repository

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.

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)

A Projection free method for Generalized Eigenvalue Problem with a nonsmooth Regularizer.

Science.gov (United States)

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.

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

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.

Solving the generalized symmetric eigenvalue problem using tile algorithms on multicore architectures

KAUST Repository

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

A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation

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.

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.

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)

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

Covariant extensions and the nonsymmetric unified field

International Nuclear Information System (INIS)

Borchsenius, K.

1976-01-01

The problem of generally covariant extension of Lorentz invariant field equations, by means of covariant derivatives extracted from the nonsymmetric unified field, is considered. It is shown that the contracted curvature tensor can be expressed in terms of a covariant gauge derivative which contains the gauge derivative corresponding to minimal coupling, if the universal constant p, characterizing the nonsymmetric theory, is fixed in terms of Planck's constant and the elementary quantum of charge. By this choice the spinor representation of the linear connection becomes closely related to the spinor affinity used by Infeld and Van Der Waerden (Sitzungsber. Preuss. Akad. Wiss. Phys. Math. Kl.; 9:380 (1933)) in their generally covariant formulation of Dirac's equation. (author)

Nonsymmetric entropy I: basic concepts and results

OpenAIRE

Liu, Chengshi

2006-01-01

A new concept named nonsymmetric entropy which generalizes the concepts of Boltzman's entropy and shannon's entropy, was introduced. Maximal nonsymmetric entropy principle was proven. Some important distribution laws were derived naturally from maximal nonsymmetric entropy principle.

Variational methods for eigenvalue problems an introduction to the weinstein method of intermediate problems

CERN Document Server

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.

The Homogeneous Interior-Point Algorithm: Nonsymmetric Cones, Warmstarting, and Applications

DEFF Research Database (Denmark)

Skajaa, Anders

algorithms for these problems is still limited. The goal of this thesis is to investigate and shed light on two computational aspects of homogeneous interior-point algorithms for convex conic optimization: The first part studies the possibility of devising a homogeneous interior-point method aimed at solving...... problems involving constraints that require nonsymmetric cones in their formulation. The second part studies the possibility of warmstarting the homogeneous interior-point algorithm for conic problems. The main outcome of the first part is the introduction of a completely new homogeneous interior......-point algorithm designed to solve nonsymmetric convex conic optimization problems. The algorithm is presented in detail and then analyzed. We prove its convergence and complexity. From a theoretical viewpoint, it is fully competitive with other algorithms and from a practical viewpoint, we show that it holds lots...

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Energy Technology Data Exchange (ETDEWEB)

Vecharynski, Eugene [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division; Brabec, Jiri [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division; Shao, Meiyue [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division; Govind, Niranjan [Pacific Northwest National Lab. (PNNL), Richland, WA (United States). Environmental Molecular Sciences Lab.; Yang, Chao [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division

2017-12-01

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

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

Science.gov (United States)

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.

Solution of the multigroup neutron diffusion Eigenvalue problem in slab geometry by modified power method

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)

Inverse eigenvalue problems for Sturm-Liouville equations with spectral parameter linearly contained in one of the boundary conditions

OpenAIRE

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.

Dynamic Eigenvalue Problem of Concrete Slab Road Surface

Science.gov (United States)

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.

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)

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

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)

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

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

Solving large nonlinear generalized eigenvalue problems from Density Functional Theory calculations in parallel

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

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)

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

Science.gov (United States)

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

Collocation methods for the solution of eigenvalue problems for singular ordinary differential equations

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.

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)

Tensor eigenvalues and their applications

CERN Document Server

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.

Eigenvalue ratio detection based on exact moments of smallest and largest eigenvalues

KAUST Repository

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.

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)

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.

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} (|\

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

A Combined Preconditioning Strategy for Nonsymmetric Systems

KAUST Repository

Ayuso Dios, Blanca; Barker, A. T.; Vassilevski, P. S.

2014-01-01

of the additive Schwarz method applied to nonsymmetric but definite matrices is presented for which the abstract assumptions are verified. A variable preconditioner, combining the original nonsymmetric one and a weighted least-squares version of it, is shown

WYD method for an eigen solution of coupled problems

Directory of Open Access Journals (Sweden)

A Harapin

2016-04-01

Full Text Available Designing efficient and stable algorithm for finding the eigenvalues andeigenvectors is very important from the static as well as the dynamic aspectin coupled problems. Modal analysis requires first few significant eigenvectorsand eigenvalues while direct integration requires the highest value toascertain the length of the time step that satisfies the stability condition.The paper first presents the modification of the well known WYDmethod for a solution of single field problems: an efficient and numericallystable algorithm for computing eigenvalues and the correspondingeigenvectors. The modification is based on the special choice of thestarting vector. The starting vector is the static solution of displacements forthe applied load, defined as the product of the mass matrix and the unitdisplacement vector. The starting vector is very close to the theoreticalsolution, which is important in cases of small subspaces.Additionally, the paper briefly presents the adopted formulation for solvingthe fluid-structure coupled systems problems which is based on a separatesolution for each field. Individual fields (fluid and structure are solvedindependently, taking in consideration the interaction information transferbetween them at every stage of the iterative solution process. The assessmentof eigenvalues and eigenvectors for multiple fields is also presented. This eigenproblem is more complicated than the one for the ordinary structural analysis,as the formulation produces non-symmetrical matrices.Finally, a numerical example for the eigen solution coupled fluidstructureproblem is presented to show the efficiency and the accuracy ofthe developed algorithm.

Numerical method for the eigenvalue problem and the singular equation by using the multi-grid method and application to ordinary differential equation

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)

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)

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

Towards an ideal preconditioner for linearized Navier-Stokes problems

Energy Technology Data Exchange (ETDEWEB)

Murphy, M.F. [Univ. of Bristol (United Kingdom)

1996-12-31

Discretizing certain linearizations of the steady-state Navier-Stokes equations gives rise to nonsymmetric linear systems with indefinite symmetric part. We show that for such systems there exists a block diagonal preconditioner which gives convergence in three GMRES steps, independent of the mesh size and viscosity parameter (Reynolds number). While this {open_quotes}ideal{close_quotes} preconditioner is too expensive to be used in practice, it provides a useful insight into the problem. We then consider various approximations to the ideal preconditioner, and describe the eigenvalues of the preconditioned systems. Finally, we compare these preconditioners numerically, and present our conclusions.

NESTLE: Few-group neutron diffusion equation solver utilizing the nodal expansion method for eigenvalue, adjoint, fixed-source steady-state and transient problems

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

Photonic Band Structure of Dispersive Metamaterials Formulated as a Hermitian Eigenvalue Problem

KAUST Repository

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.

Photonic Band Structure of Dispersive Metamaterials Formulated as a Hermitian Eigenvalue Problem

KAUST Repository

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.

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.

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

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

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

Science.gov (United States)

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.

Existence of solutions for a fourth order eigenvalue problem ] {Existence of solutions for a fourth order eigenvalue problem with variable exponent under Neumann boundary conditions

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.

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)

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

Greedy algorithms for high-dimensional non-symmetric linear problems***

Directory of Open Access Journals (Sweden)

Cancès E.

2013-12-01

Full Text Available In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor product functions, each term of which is iteratively computed via a greedy algorithm ? . There exists a good theoretical framework for these methods in the case of (linear and nonlinear symmetric elliptic problems. However, the convergence results are not valid any more as soon as the problems under consideration are not symmetric. We present here a review of the main algorithms proposed in the literature to circumvent this difficulty, together with some new approaches. The theoretical convergence results and the practical implementation of these algorithms are discussed. Their behaviors are illustrated through some numerical examples. Dans cet article, nous présentons une famille de méthodes numériques pour résoudre des problèmes linéaires non symétriques en grande dimension. Le principe de ces approches est de représenter une fonction dépendant d’un grand nombre de variables sous la forme d’une somme de fonctions produit tensoriel, dont chaque terme est calculé itérativement via un algorithme glouton ? . Ces méthodes possèdent de bonnes propriétés théoriques dans le cas de problèmes elliptiques symétriques (linéaires ou non linéaires, mais celles-ci ne sont plus valables dès lors que les problèmes considérés ne sont plus symétriques. Nous présentons une revue des principaux algorithmes proposés dans la littérature pour contourner cette difficulté ainsi que de nouvelles approches que nous proposons. Les résultats de convergence théoriques et la mise en oeuvre pratique de ces algorithmes sont détaillés et leur comportement est illustré au travers d’exemples numériques.

Applications of implicit restarting in optimization and control Dan Sorensen

Energy Technology Data Exchange (ETDEWEB)

Sorensen, D. [Rice Univ., Houston, TX (United States)

1996-12-31

Implicit restarting is a technique for combining the implicitly shifted QR mechanism with a k-step Arnoldi or Lanczos factorization to obtain a truncated form of the implicitly shifted QR-iteration suitable for large scale eigenvalue problems. The software package ARPACK based upon this technique has been successfully used to solve large scale symmetric and nonsymmetric (generalized) eigenvalue problems arising from a variety of applications.

Asymptotics of the Eigenvalues of a Self-Adjoint Fourth Order Boundary Value Problem with Four Eigenvalue Parameter Dependent Boundary Conditions

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.

Numerical method for multigroup one-dimensional SN eigenvalue problems with no spatial truncation error

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

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)

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 concise entry into nonsymmetrical alkyl polyamines.

Science.gov (United States)

Pirali, Tracey; Callipari, Grazia; Ercolano, Emanuela; Genazzani, Armando A; Giovenzana, Giovanni Battista; Tron, Gian Cesare

2008-10-02

The synthesis of nonsymmetrical polyamines (PAs) has, up to now, been problematic due to lengthy synthetic procedures, lack of regioselectivity, and very poor atom economy. An innovative synthetic protocol for nonsymmetrical PAs using a modified Ugi reaction ( N-split Ugi) which simplifies the synthesis of these tricky compounds is described. We believe that this new synthesis may open the door for the generation of new and pharmacologically active PAs.

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.

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.

Traversible wormholes and the negative-stress-energy problem in the nonsymmetric gravitational theory

International Nuclear Information System (INIS)

Moffat, J.W.; Svoboda, T.

1991-01-01

The stress-energy tensor for a a general spherically symmetric matter distribution in the nonsymmetric gravitational theory (NGT) is determined using a heuristic argument. Using this tensor and the NGT field equations, it is shown that a wormhole threaded with matter must necessarily have a radial tension greater than the mass-energy density in the throat region. Hence, as in general relativity, a traversible wormhole in NGT must contain matter with a negative stress energy

Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem

KAUST Repository

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.

A non-self-adjoint quadratic eigenvalue problem describing a fluid-solid interaction Part II : analysis of convergence

NARCIS (Netherlands)

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

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

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

Science.gov (United States)

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.

Heuristic geometric ''eigenvalue universality'' in a one-dimensional neutron transport problem with anisotropic scattering

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

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

Some algorithms for the solution of the symmetric eigenvalue problem on a multiprocessor electronic computer

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

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.

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

The nonsymmetric Kaluza-Klein (Jordan-Thiry) theory in the electromagnetic case

International Nuclear Information System (INIS)

Kalinowski, M.W.

1992-01-01

We present the nonsymmetric Kaluza-Klein and Jordan-Thiry theories as interesting propositions of physics in higher dimensions. We consider the five-dimensional (electromagnetic) case. The work is devoted to a five-dimensional unification of the NGT (nonsymmetric theory of gravitation), electromagnetism, and scalar forces in a Jordan-Thiry manner. We find open-quotes interference effectsclose quotes between gravitational and electromagnetic fields which appear to be due to the skew-symmetric part of the metric. Our unification, called the nonsymmetric Jordan-Thiry theory, becomes the classical Jordan-Thiry theory if the skew-symmetric part of the metric is zero. It becomes the classical Kaluza-Klein theory if the scalar field ρ=1 (Kaluza's Ansatz). We also deal with material sources in the nonsymmetric Kaluza-Klein theory for the electromagnetic case. We consider phenomenological sources with a nonzero fermion current, a nonzero electric current, and a nonzero spin density tensor. From the Palatini variational principle we find equations for the gravitational and electromagnetic fields. We also consider the geodetic equations in the theory and the equation of motion for charged test particles. We consider some numerical predictions of the nonsymmetric Kaluza-Klein theory with nonzero (and with zero) material sources. We prove that they do not contradict any experimental data for the solar system and on the surface of a neutron star. We deal also with spin sources in the nonsymmetric Kaluza-Klein theory. We find an exact, static, spherically symmetric solution in the nonsymmetric Kaluza-Klein theory in the electromagnetic case. This solution has the remarkable property of describing open-quotes mass without massclose quotes and open-quotes charge without charge.close quotes We examine its properties and a physical interpretation. 91 refs., 7 figs

On Implementing a Homogeneous Interior-Point Algorithm for Nonsymmetric Conic Optimization

DEFF Research Database (Denmark)

Skajaa, Anders; Jørgensen, John Bagterp; Hansen, Per Christian

Based on earlier work by Nesterov, an implementation of a homogeneous infeasible-start interior-point algorithm for solving nonsymmetric conic optimization problems is presented. Starting each iteration from (the vicinity of) the central path, the method computes (nearly) primal-dual symmetric...... approximate tangent directions followed by a purely primal centering procedure to locate the next central primal-dual point. Features of the algorithm include that it makes use only of the primal barrier function, that it is able to detect infeasibilities in the problem and that no phase-I method is needed...

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.

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

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)

The BR eigenvalue algorithm

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.

Nonsymmetric gas transfer phenomena in nanoporous media

International Nuclear Information System (INIS)

Kurchatov, I.M.

2011-01-01

The regularities of nonsymmetric gas (nitrogen, helium, hydrogen, carbon dioxide) transfer in nanoporous materials are investigated. The effects of anisotropy and hysteresis of permeability in nanoporous media with pore gradient and porosity in objects of various nature are found out. The following objects are studied: polyethylene terephthalate track membranes with asymmetric pore form, commercial polyvinyl trimethylsilane gas-separation membranes with continuous distribution of pores over the membrane thickness and porous composite membranes (born nitride, silicon carbide, aluminium oxide) prepared by self-propagating high-temperature synthesis with abrupt change of pore dimensions over the thickness. The possible mechanisms of nonsymmetric gas transfer effects are under consideration [ru

Construction of local boundary conditions for an eigenvalue problem using micro-local analysis: application to optical waveguide problems

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

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

Eigenstructure of of singular systems. Perturbation analysis of simple eigenvalues

OpenAIRE

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

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

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)

Student paper competition: Splitting the determinants of upper Hessenberg matrices and the Hyman method

Energy Technology Data Exchange (ETDEWEB)

Zou, Xiulin [Michigan State Univ., East Lansing, MI (United States)

1996-12-31

In this article, an iterative algorithm is established that splits the evaluation of determinant of an upper Hessenberg matrix into two independent parts so that the evaluation can be done in parallel. This algorithm has application in parallel non-symmetric eigenvalue problems.

Overlapping domain decomposition preconditioners for the generalized Davidson method for the eigenvalue problem

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.

The homogeneous boundary value problem of the thick spherical shell

International Nuclear Information System (INIS)

Linder, F.

1975-01-01

With the aim to solve boundary value problems in the same manner as it is attained at thin shell theory (Superposition of Membrane solution to solution of boundary values), one has to search solutions of the equations of equilibrium of the three dimensional thick shell which produce tensions at the cut edge and are zero on the whole shell surface inside and outside. This problem was solved with the premissions of the linear theory of Elasticity. The gained solution is exact and contains the symmetric and non-symmetric behaviour and is described in relatively short analytical expressions for the deformations and tensions, after the problem of the coupled system had been solved. The static condition of the two surfaces (zero tension) leads to a homogeneous system of complex equations with the index of the Legendre spherical function as Eigenvalue. One symmetrical case is calculated numerically and is compared with the method of finite elements. This comparison results in good accordance. (Auth.)

A robust multilevel simultaneous eigenvalue solver

Science.gov (United States)

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.

INDEFINITE COPOSITIVE MATRICES WITH EXACTLY ONE POSITIVE EIGENVALUE OR EXACTLY ONE NEGATIVE EIGENVALUE

NARCIS (Netherlands)

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

Use of exact albedo conditions in numerical methods for one-dimensional one-speed discrete ordinates eigenvalue problems

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)

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)

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

Spectral function for a nonsymmetric differential operator on the half line

Directory of Open Access Journals (Sweden)

Wuqing Ning

2017-05-01

Full Text Available In this article we study the spectral function for a nonsymmetric differential operator on the half line. Two cases of the coefficient matrix are considered, and for each case we prove by Marchenko's method that, to the boundary value problem, there corresponds a spectral function related to which a Marchenko-Parseval equality and an expansion formula are established. Our results extend the classical spectral theory for self-adjoint Sturm-Liouville operators and Dirac operators.

Approximation of the eigenvalue problem for the time harmonic Maxwell system by continuous Lagrange finite elements

KAUST Repository

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.

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

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

Gaps in nonsymmetric numerical semigroups

International Nuclear Information System (INIS)

Fel, Leonid G.; Aicardi, Francesca

2006-12-01

There exist two different types of gaps in the nonsymmetric numerical semigroups S(d 1 , . . . , d m ) finitely generated by a minimal set of positive integers {d 1 , . . . , d m }. We give the generating functions for the corresponding sets of gaps. Detailed description of both gap types is given for the 1st nontrivial case m = 3. (author)

The Schrodinger Eigenvalue March

Science.gov (United States)

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…

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

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.

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)

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

Classical scattering theory of waves from the view point of an eigenvalue problem and application to target identification

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

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

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

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

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 Words in Two Positive Definite Letters

OpenAIRE

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

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.

Nonlinear and Nonsymmetric Single-Molecule Electronic Properties Towards Molecular Information Processing.

Science.gov (United States)

Tamaki, Takashi; Ogawa, Takuji

2017-09-05

This review highlights molecular design for nonlinear and nonsymmetric single-molecule electronic properties such as rectification, negative differential resistance, and switching, which are important components of future single-molecule information processing devices. Perspectives on integrated "molecular circuits" are also provided. Nonlinear and nonsymmetric single-molecule electronics can be designed by utilizing (1) asymmetric molecular cores, (2) asymmetric anchoring groups, (3) an asymmetric junction environment, and (4) asymmetric electrode materials. This review mainly focuses on the design of molecular cores.

Nonsymmetric systems arising in the computation of invariant tori

Energy Technology Data Exchange (ETDEWEB)

Trummer, M.R. [Simons Fraser Univ., Burnaby, British Columbia (Canada)

1996-12-31

We introduce two new spectral implementations for computing invariant tori. The underlying nonlinear partial differential equation although hyperbolic by nature, has periodic boundary conditions in both space and time. In our first approach we discretize the spatial variable, and find the solution via a shooting method. In our second approach, a full two-dimensional Fourier spectral discretization and Newton`s method lead to very large, sparse, nonsymmetric systems. These matrices are highly structured, but the sparsity pattern prohibits the use of direct solvers. A modified conjugate gradient type iterative solver appears to perform best for this type of problems. The two methods are applied to the van der Pol oscillator, and compared to previous algorithms. Several preconditioners are investigated.

Solving the RPA eigenvalue equation in real-space

CERN Document Server

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)

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.

Colorado Conference on iterative methods. Volume 1

Energy Technology Data Exchange (ETDEWEB)

NONE

1994-12-31

The conference provided a forum on many aspects of iterative methods. Volume I topics were:Session: domain decomposition, nonlinear problems, integral equations and inverse problems, eigenvalue problems, iterative software kernels. Volume II presents nonsymmetric solvers, parallel computation, theory of iterative methods, software and programming environment, ODE solvers, multigrid and multilevel methods, applications, robust iterative methods, preconditioners, Toeplitz and circulation solvers, and saddle point problems. Individual papers are indexed separately on the EDB.

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)

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

Science.gov (United States)

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

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

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

A Bootstrap Approach to Eigenvalue Correction

NARCIS (Netherlands)

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

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

Science.gov (United States)

Gyrya, V.; Lipnikov, K.

2017-11-01

We present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, we observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.

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)

Application of the Laplace transform method for the albedo boundary conditions in multigroup neutron diffusion eigenvalue problems in slab geometry

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

An algebraic approach to the non-symmetric Macdonald polynomial

International Nuclear Information System (INIS)

Nishino, Akinori; Ujino, Hideaki; Wadati, Miki

1999-01-01

In terms of the raising and lowering operators, we algebraically construct the non-symmetric Macdonald polynomials which are simultaneous eigenfunctions of the commuting Cherednik operators. We also calculate Cherednik's scalar product of them

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.

Complex stiffness formulation for the finite element analysis of anisotropic axisymmetric solids subjected to nonsymmetric loads

International Nuclear Information System (INIS)

Frater, J.; Lestingi, J.; Padovan, J.

1977-01-01

This paper describes the development of an improved semi-analytical finite element for the stress analysis of anisotropic axisymmetric solids subjected to nonsymmetric loads. Orthogonal functions in the form of finite Fourier exponential transforms, which satisfy the equations of equilibrium of the theory of elasticity for an anisotropic solid of revolution, are used to expand the imposed loadings and displacement field. It is found that the orthogonality conditions for the assumed solution reduce the theta-dependency, thus reducing the three dimensional problem to an infinite series of two dimensional problems. (Auth.)

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 comparative study of history-based versus vectorized Monte Carlo methods in the GPU/CUDA environment for a simple neutron eigenvalue problem

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)

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Generalized Eigenvalues for pairs on heritian matrices

Science.gov (United States)

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.

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.

Numerical method to calculate the quantum transmission, resonance and eigenvalue energies: application to a biased multibarrier systems

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.

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.

Rodrigues formulas for the non-symmetric multivariable polynomials associated with the BCN-type root system

International Nuclear Information System (INIS)

Nishino, Akinori; Ujino, Hideaki; Komori, Yasushi; Wadati, Miki

2000-01-01

The non-symmetric Macdonald-Koornwinder polynomials are joint eigenfunctions of the commuting Cherednik operators which are constructed from the representation theory for the affine Hecke algebra corresponding to the BC N -type root system. We present the Rodrigues formula for the non-symmetric Macdonald-Koornwinder polynomials. The raising operators are derived from the realizations of the corresponding double affine Hecke algebra. In the quasi-classical limit, the above theory reduces to that of the BC N -type Sutherland model which describes many particles with inverse-square long-range interactions on a circle with one impurity. We also present the Rodrigues formula for the non-symmetric Jacobi polynomials of type BC N which are eigenstates of the BC N -type Sutherland model

The method of fundamental solutions for computing acoustic interior transmission eigenvalues

Science.gov (United States)

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.

Collaborative spectrum sensing based on the ratio between largest eigenvalue and Geometric mean of eigenvalues

KAUST Repository

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.

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

The nonsymmetric-nonabelian Kaluza-Klein theory

International Nuclear Information System (INIS)

Kalinowski, M.W.

1983-01-01

This paper is devoted to an (n+4)-dimensional unification of Moffat's theory of gravitation and Yang-Mills field theory with nonabelian gauge group G. We found 'interference effects' between gravitational and Yang-Mills (gauge) fields which appear to be due to the skewsymmetric part of the metric of Moffat's theory and the skewsymmetric part of the metric on the group G. Our unification, called the nonsymmetric-nonabelian Kaluza-Klein theory, becomes classical Kaluza-Klein theory if the skewsymmetric parts of both metrics are zero. (author)

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

Two-group k-eigenvalue benchmark calculations for planar geometry transport in a binary stochastic medium

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

A spectral nodal method for eigenvalue SN transport problems in two-dimensional rectangular geometry for energy multigroup nuclear reactor global calculations

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)

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)

Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems

Energy Technology Data Exchange (ETDEWEB)

Benzi, M. [Universita di Bologna (Italy); Tuma, M. [Inst. of Computer Sciences, Prague (Czech Republic)

1996-12-31

A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods.

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

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.

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

Science.gov (United States)

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.

Synthesis of High Purity Nonsymmetric Dialkylphosphinic Acid Extractants.

Science.gov (United States)

Wang, Junlian; Xie, Meiying; Liu, Xinyu; Xu, Shengming

2017-10-19

We present the synthesis of (2,3-dimethylbutyl)(2,4,4'-trimethylpentyl)phosphinic acid as an example to demonstrate a method for the synthesis of high purity nonsymmetric dialkylphosphinic acid extractants. Low toxic sodium hypophosphite was chosen as the phosphorus source to react with olefin A (2,3-dimethyl-1-butene) to generate a monoalkylphosphinic acid intermediate. Amantadine was adopted to remove the dialkylphosphinic acid byproduct, as only the monoalkylphosphinic acid can react with amantadine to form an amantadine∙mono-alkylphosphinic acid salt, while the dialkylphosphinic acid cannot react with amantadine due to its large steric hindrance. The purified monoalkylphosphinic acid was then reacted with olefin B (diisobutylene) to yield nonsymmetric dialkylphosphinic acid (NSDAPA). The unreacted monoalkylphosphinic acid can be easily removed by a simple base-acid post-treatment and other organic impurities can be separated out through the precipitation of the cobalt salt. The structure of the (2,3-dimethylbutyl)(2,4,4'-trimethylpentyl)phosphinic acid was confirmed by 31 P NMR, 1 H NMR, ESI-MS, and FT-IR. The purity was determined by a potentiometric titration method, and the results indicate that the purity can exceed 96%.

Non-symmetric forms of non-linear vibrations of flexible cylindrical panels and plates under longitudinal load and additive white noise

Science.gov (United States)

Krysko, V. A.; Awrejcewicz, J.; Krylova, E. Yu; Papkova, I. V.; Krysko, A. V.

2018-06-01

Parametric non-linear vibrations of flexible cylindrical panels subjected to additive white noise are studied. The governing Marguerre equations are investigated using the finite difference method (FDM) of the second-order accuracy and the Runge-Kutta method. The considered mechanical structural member is treated as a system of many/infinite number of degrees of freedom (DoF). The dependence of chaotic vibrations on the number of DoFs is investigated. Reliability of results is guaranteed by comparing the results obtained using two qualitatively different methods to reduce the problem of PDEs (partial differential equations) to ODEs (ordinary differential equations), i.e. the Faedo-Galerkin method in higher approximations and the 4th and 6th order FDM. The Cauchy problem obtained by the FDM is eventually solved using the 4th-order Runge-Kutta methods. The numerical experiment yielded, for a certain set of parameters, the non-symmetric vibration modes/forms with and without white noise. In particular, it has been illustrated and discussed that action of white noise on chaotic vibrations implies quasi-periodicity, whereas the previously non-symmetric vibration modes are closer to symmetric ones.

An Experiment of Robust Parallel Algorithm for the Eigenvalue problem of a Multigroup Neutron Diffusion based on modified FETI-DP : Part 2

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

An Experiment of Robust Parallel Algorithm for the Eigenvalue problem of a Multigroup Neutron Diffusion based on modified FETI-DP : Part 2

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.

Markov Jump Processes Approximating a Non-Symmetric Generalized Diffusion

International Nuclear Information System (INIS)

Limić, Nedžad

2011-01-01

Consider a non-symmetric generalized diffusion X(⋅) in ℝ d determined by the differential operator A(x) = -Σ ij ∂ i a ij (x)∂ j + Σ i b i (x)∂ i . In this paper the diffusion process is approximated by Markov jump processes X n (⋅), in homogeneous and isotropic grids G n ⊂ℝ d , which converge in distribution in the Skorokhod space D([0,∞),ℝ d ) to the diffusion X(⋅). The generators of X n (⋅) are constructed explicitly. Due to the homogeneity and isotropy of grids, the proposed method for d≥3 can be applied to processes for which the diffusion tensor {a ij (x)} 11 dd fulfills an additional condition. The proposed construction offers a simple method for simulation of sample paths of non-symmetric generalized diffusion. Simulations are carried out in terms of jump processes X n (⋅). For piece-wise constant functions a ij on ℝ d and piece-wise continuous functions a ij on ℝ 2 the construction and principal algorithm are described enabling an easy implementation into a computer code.

An iteration for indefinite and non-symmetric systems and its application to the Navier-Stokes equations

Energy Technology Data Exchange (ETDEWEB)

Wathen, A. [Oxford Univ. (United Kingdom); Golub, G. [Stanford Univ., CA (United States)

1996-12-31

A simple fixed point linearisation of the Navier-Stokes equations leads to the Oseen problem which after appropriate discretisation yields large sparse linear systems with coefficient matrices of the form (A B{sup T} B -C). Here A is non-symmetric but its symmetric part is positive definite, and C is symmetric and positive semi-definite. Such systems arise in other situations. In this talk we will describe and present some analysis for an iteration based on an indefinite and symmetric preconditioner of the form (D B{sup T} B -C).

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)

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)

Schur rings and non-symmetric association schemes on 64 vertices

DEFF Research Database (Denmark)

Jørgensen, Leif Kjær

2010-01-01

In this paper we enumerate essentially all non-symmetric association schemes with three classes, less than 96 vertices and with a regular group of automorphisms. The enumeration is based on a computer search in Schur rings. The most interesting cases have 64 vertices. In one primitive case and in...

Eigenvalue-eigenfunction problem for Steklov's smoothing operator and differential-difference equations of mixed type

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 \

A spectral nodal method for eigenvalue S{sub N} transport problems in two-dimensional rectangular geometry for energy multigroup nuclear reactor global calculations

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)

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.

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.

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.

On the decision threshold of eigenvalue ratio detector based on moments of joint and marginal distributions of extreme eigenvalues

KAUST Repository

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.

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

Asymmetric correlation matrices: an analysis of financial data

Science.gov (United States)

Livan, G.; Rebecchi, L.

2012-06-01

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

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

Science.gov (United States)

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.

Generalized eigenvalue based spectrum sensing

KAUST Repository

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.

On integrability conditions of the equations of nonsymmetrical chiral field on SO(4)

International Nuclear Information System (INIS)

Tskhakaya, D.D.

1990-01-01

Possibility of integrating the equations of nonsymmetrical chiral field on SO(4) by means of the inverse scattering method is investigated. Maximal number of the motion integrals is found for the corresponding system of ordinary differential equations

Tailoring of the electrical and thermal properties using ultra-short period non-symmetric superlattices

Directory of Open Access Journals (Sweden)

Paulina Komar

2016-10-01

Full Text Available Thermoelectric modules based on half-Heusler compounds offer a cheap and clean way to create eco-friendly electrical energy from waste heat. Here we study the impact of the period composition on the electrical and thermal properties in non-symmetric superlattices, where the ratio of components varies according to (TiNiSnn:(HfNiSn6−n, and 0 ⩽ n ⩽ 6 unit cells. The thermal conductivity (κ showed a strong dependence on the material content achieving a minimum value for n = 3, whereas the highest value of the figure of merit ZT was achieved for n = 4. The measured κ can be well modeled using non-symmetric strain relaxation applied to the model of the series of thermal resistances.

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

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.

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

Probabilistic Teleportation of Arbitrary Two-Qubit Quantum State via Non-Symmetric Quantum Channel

Directory of Open Access Journals (Sweden)

Kan Wang

2018-03-01

Full Text Available Quantum teleportation has significant meaning in quantum information. In particular, entangled states can also be used for perfectly teleporting the quantum state with some probability. This is more practical and efficient in practice. In this paper, we propose schemes to use non-symmetric quantum channel combinations for probabilistic teleportation of an arbitrary two-qubit quantum state from sender to receiver. The non-symmetric quantum channel is composed of a two-qubit partially entangled state and a three-qubit partially entangled state, where partially entangled Greenberger–Horne–Zeilinger (GHZ state and W state are considered, respectively. All schemes are presented in detail and the unitary operations required are given in concise formulas. Methods are provided for reducing classical communication cost and combining operations to simplify the manipulation. Moreover, our schemes are flexible and applicable in different situations.

Polynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations

NARCIS (Netherlands)

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

A class of non-symmetric band determinants with the Gaussian q ...

African Journals Online (AJOL)

A class of symmetric band matrices of bandwidth 2r+1 with the binomial coefficients entries was studied earlier. We consider a class of non-symmetric band matrices with the Gaussian q-binomial coefficients whose upper bandwith is s and lower bandwith is r. We give explicit formulæ for the determinant, the inverse (along ...

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)

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)

Analytical prediction model for non-symmetric fatigue crack growth in Fibre Metal Laminates

NARCIS (Netherlands)

Wang, W.; Rans, C.D.; Benedictus, R.

2017-01-01

This paper proposes an analytical model for predicting the non-symmetric crack growth and accompanying delamination growth in FMLs. The general approach of this model applies Linear Elastic Fracture Mechanics, the principle of superposition, and displacement compatibility based on the

Non-symmetric bi-stable flow around the Ahmed body

International Nuclear Information System (INIS)

Meile, W.; Ladinek, T.; Brenn, G.; Reppenhagen, A.; Fuchs, A.

2016-01-01

Highlights: • The non-symmetric bi-stable flow around the Ahmed body is investigated experimentally. • Bi-stability, described for symmetric flow by Cadot and co-workers, was found in nonsymmetric flow also. • The flow field randomly switches between two states. • The flow is subject to a spanwise instability identified by Cadot and co-workers for symmetric flow. • Aerodynamic forces fluctuate strongly due to the bi-stability. - Abstract: The flow around the Ahmed body at varying Reynolds numbers under yawing conditions is investigated experimentally. The body geometry belongs to a regime subject to spanwise flow instability identified in symmetric flow by Cadot and co-workers (Grandemange et al., 2013b). Our experiments cover the two slant angles 25° and 35° and Reynolds numbers up to 2.784 × 10"6. Special emphasis lies on the aerodynamics under side wind influence. For the 35° slant angle, forces and moments change significantly with the yawing angle in the range 10° ≤ |β| ≤ 15°. The lift and the pitching moment exhibit strong fluctuations due to bi-stable flow around a critical angle β of ±12.5°, where the pitching moment changes sign. Time series of the forces and moments are studied and explained by PIV measurements in the flow field near the rear of the body.

Principal Eigenvalues of a Second-Order Difference Operator with Sign-Changing Weight and Its 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.

A Non-symmetric Digital Image Secure Communication Scheme Based on Generalized Chaos Synchronization System

International Nuclear Information System (INIS)

Zhang Xiaohong; Min Lequan

2005-01-01

Based on a generalized chaos synchronization system and a discrete Sinai map, a non-symmetric true color (RGB) digital image secure communication scheme is proposed. The scheme first changes an ordinary RGB digital image with 8 bits into unrecognizable disorder codes and then transforms the disorder codes into an RGB digital image with 16 bits for transmitting. A receiver uses a non-symmetric key to verify the authentication of the received data origin, and decrypts the ciphertext. The scheme can encrypt and decrypt most formatted digital RGB images recognized by computers, and recover the plaintext almost without any errors. The scheme is suitable to be applied in network image communications. The analysis of the key space, sensitivity of key parameters, and correlation of encrypted images imply that this scheme has sound security.

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.

Fracture mechanics assessment of surface and sub-surface cracks in the RPV under non-symmetric PTS loading

Energy Technology Data Exchange (ETDEWEB)

Keim, E; Shoepper, A; Fricke, S [Siemens AG Unternehmensbereich KWU, Erlangen (Germany)

1997-09-01

One of the most severe loading conditions of a reactor pressure vessel (rpv) under operation is the loss of coolant accident (LOCA) condition. Cold water is injected through nozzles in the downcomer of the rpv, while the internal pressure may remain at a high level. Complex thermal hydraulic situations occur and the fluid and downcomer temperatures as well as the fluid to wall heat transfer coefficient at the inner surface are highly non-linear. Due to this non-symmetric conditions, the problem is investigated by three-dimensional non-linear finite element analyses, which allow for an accurate assessment of the postulated flaws. Transient heat transfer analyses are carried out to analyze the effect of non-symmetrical cooling of the inner surface of the pressure vessel. In a following uncoupled stress analysis the thermal shock effects for different types of defects, surface flaws and sub-surface flaws are investigated for linear elastic and elastic-plastic material behaviour. The obtained fracture parameters are calculated along the crack fronts. By a fast fracture analysis the fracture parameters at different positions along the crack front are compared to the material resistance. Safety margins are pointed out in an assessment diagram of the fracture parameters and the fracture resistance versus the transient temperature at the crack tip position. (author). 4 refs, 10 figs.

Problem on eigenfunctions and eigenvalues for effective Hamiltonians in pair channels of four-particle systems

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

On the numerical solution of coupled eigenvalue differential equations arising in molecular spectroscopy

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

The cosmological constant as an eigenvalue of the Hamiltonian constraint in a varying speed of light theory

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)

Bound entangled states violate a nonsymmetric local uncertainty relation

International Nuclear Information System (INIS)

Hofmann, Holger F.

2003-01-01

As a consequence of having a positive partial transpose, bound entangled states lack many of the properties otherwise associated with entanglement. It is therefore interesting to identify properties that distinguish bound entangled states from separable states. In this paper, it is shown that some bound entangled states violate a nonsymmetric class of local uncertainty relations [H. F. Hofmann and S. Takeuchi, Phys. Rev. A 68, 032103 (2003)]. This result indicates that the asymmetry of nonclassical correlations may be a characteristic feature of bound entanglement

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.

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

Science.gov (United States)

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.

Dual and mixed nonsymmetric stress-based variational formulations for coupled thermoelastodynamics with second sound effect

Science.gov (United States)

Tóth, Balázs

2018-03-01

Some new dual and mixed variational formulations based on a priori nonsymmetric stresses will be developed for linearly coupled irreversible thermoelastodynamic problems associated with second sound effect according to the Lord-Shulman theory. Having introduced the entropy flux vector instead of the entropy field and defining the dissipation and the relaxation potential as the function of the entropy flux, a seven-field dual and mixed variational formulation will be derived from the complementary Biot-Hamilton-type variational principle, using the Lagrange multiplier method. The momentum-, the displacement- and the infinitesimal rotation vector, and the a priori nonsymmetric stress tensor, the temperature change, the entropy field and its flux vector are considered as the independent field variables of this formulation. In order to handle appropriately the six different groups of temporal prescriptions in the relaxed- and/or the strong form, two variational integrals will be incorporated into the seven-field functional. Then, eliminating the entropy from this formulation through the strong fulfillment of the constitutive relation for the temperature change with the use of the Legendre transformation between the enthalpy and Gibbs potential, a six-field dual and mixed action functional is obtained. As a further development, the elimination of the momentum- and the velocity vector from the six-field principle through the a priori satisfaction of the kinematic equation and the constitutive relation for the momentum vector leads to a five-field variational formulation. These principles are suitable for the transient analyses of the structures exposed to a thermal shock of short temporal domain or a large heat flux.

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

A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems

Science.gov (United States)

Chan, Tony; Szeto, Tedd

1994-03-01

We propose a new and more stable variant of the CGS method [27] for solving nonsymmetric linear systems. The method is based on squaring the Composite Step BCG method, introduced recently by Bank and Chan [1,2], which itself is a stabilized variant of BCG in that it skips over steps for which the BCG iterate is not defined and causes one kind of breakdown in BCG. By doing this, we obtain a method (Composite Step CGS or CSCGS) which not only handles the breakdowns described above, but does so with the advantages of CGS, namely, no multiplications by the transpose matrix and a faster convergence rate than BCG. Our strategy for deciding whether to skip a step does not involve any machine dependent parameters and is designed to skip near breakdowns as well as produce smoother iterates. Numerical experiments show that the new method does produce improved performance over CGS on practical problems.

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

Hessian eigenvalue distribution in a random Gaussian landscape

Science.gov (United States)

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.

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.

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.

Approximative analytic eigenvalues for orbital excitations in the case of a coulomb potential plus linear and quadratic radial terms

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

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.

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.

Eigenvalues and bifurcation for problems with positively homogeneous operators and reaction-diffusion systems with unilateral terms

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

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

Eigenvalues and bifurcation for problems with positively homogeneous operators and reaction-diffusion systems with unilateral terms

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

WKB analysis of PT-symmetric Sturm–Liouville problems

International Nuclear Information System (INIS)

Bender, Carl M; Jones, Hugh F

2012-01-01

Most studies of PT-symmetric quantum-mechanical Hamiltonians have considered the Schrödinger eigenvalue problem on an infinite domain. This paper examines the consequences of imposing the boundary conditions on a finite domain. As is the case with regular Hermitian Sturm–Liouville problems, the eigenvalues of the PT-symmetric Sturm–Liouville problem grow like n 2 for large n. However, the novelty is that a PT eigenvalue problem on a finite domain typically exhibits a sequence of critical points at which pairs of eigenvalues cease to be real and become complex conjugates of one another. For the potentials considered here this sequence of critical points is associated with a turning point on the imaginary axis in the complex plane. WKB analysis is used to calculate the asymptotic behaviours of the real eigenvalues and the locations of the critical points. The method turns out to be surprisingly accurate even at low energies. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Quantum physics with non-Hermitian operators’. (paper)

An eigenvalue localization set for tensors and its applications.

Science.gov (United States)

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.

Iterative methods for the detection of Hopf bifurcations in finite element discretisation of incompressible flow problems

International Nuclear Information System (INIS)

Cliffe, K.A.; Garratt, T.J.; Spence, A.

1992-03-01

This paper is concerned with the problem of computing a small number of eigenvalues of large sparse generalised eigenvalue problems arising from mixed finite element discretisations of time dependent equations modelling viscous incompressible flow. The eigenvalues of importance are those with smallest real part and can be used in a scheme to determine the stability of steady state solutions and to detect Hopf bifurcations. We introduce a modified Cayley transform of the generalised eigenvalue problem which overcomes a drawback of the usual Cayley transform applied to such problems. Standard iterative methods are then applied to the transformed eigenvalue problem to compute approximations to the eigenvalue of smallest real part. Numerical experiments are performed using a model of double diffusive convection. (author)

An Experiment of Robust Parallel Algorithm for the Eigenvalue problem of a Multigroup Neutron Diffusion based on modified FETI-DP

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.

Iterative methods for solving Ax=b, GMRES/FOM versus QMR/BiCG

Energy Technology Data Exchange (ETDEWEB)

Cullum, J. [IBM Research Division, Yorktown Heights, NY (United States)

1996-12-31

We study the convergence of GMRES/FOM and QMR/BiCG methods for solving nonsymmetric Ax=b. We prove that given the results of a BiCG computation on Ax=b, we can obtain a matrix B with the same eigenvalues as A and a vector c such that the residual norms generated by a FOM computation on Bx=c are identical to those generated by the BiCG computations. Using a unitary equivalence for each of these methods, we obtain test problems where we can easily vary certain spectral properties of the matrices. We use these test problems to study the effects of nonnormality on the convergence of GMRES and QMR, to study the effects of eigenvalue outliers on the convergence of QMR, and to compare the convergence of restarted GMRES, QMR, and BiCGSTAB across a family of normal and nonnormal problems. Our GMRES tests on nonnormal test matrices indicate that nonnormality can have unexpected effects upon the residual norm convergence, giving misleading indications of superior convergence over QMR when the error norms for GMRES are not significantly different from those for QMR. Our QMR tests indicate that the convergence of the QMR residual and error norms is influenced predominantly by small and large eigenvalue outliers and by the character, real, complex, or nearly real, of the outliers and the other eigenvalues. In our comparison tests QMR outperformed GMRES(10) and GMRES(20) on both the normal and nonnormal test matrices.

Parallel reduction to condensed forms for symmetric eigenvalue problems using aggregated fine-grained and memory-aware kernels

KAUST Repository

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.

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

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

NEW METHOD FOR THE SYNTHESIS OF NONSYMMETRIC DINUCLEATING LIGANDS BY AMINOMETHYLATION OF PHENOLS AND SALICYLALDEHYDES

NARCIS (Netherlands)

LUBBEN, M; FERINGA, BL

1994-01-01

Monoaminomethylated phenols 5-7 and symmetrically diaminomethylated phenols 8 and 9 were prepared in a one-step procedure-from p-cresol, formaldehyde, and a variety of secondary amines by making use of the aromatic Mannich reaction. Nonsymmetric diaminomethylated phenols 10 and 11 were prepared by a

Oscillators and Eigenvalues

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

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

Science.gov (United States)

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.

Least Squares Problems with Absolute Quadratic Constraints

Directory of Open Access Journals (Sweden)

R. Schöne

2012-01-01

Full Text Available This paper analyzes linear least squares problems with absolute quadratic constraints. We develop a generalized theory following Bookstein's conic-fitting and Fitzgibbon's direct ellipse-specific fitting. Under simple preconditions, it can be shown that a minimum always exists and can be determined by a generalized eigenvalue problem. This problem is numerically reduced to an eigenvalue problem by multiplications of Givens' rotations. Finally, four applications of this approach are presented.

Asymmetric modes and complex time eigenvalues of the one-speed neutron transport equation in a homogeneous sphere

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)

Three dimensional nilpotent singularity and Sil'nikov bifurcation

International Nuclear Information System (INIS)

Li Xindan; Liu Haifei

2007-01-01

In this paper, by using the normal form, blow-up theory and the technique of global bifurcations, we study the singularity at the origin with threefold zero eigenvalue for nonsymmetric vector fields with nilpotent linear part and 4-jet C ∼ -equivalent toy-bar -bar x+z-bar -bar y+ax 3 y-bar -bar z,with a 0, and analytically prove the existence of Sil'nikov bifurcation, and then of the strange attractor for certain subfamilies of the nonsymmetric versal unfoldings of this singularity under some conditions

Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices

Science.gov (United States)

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.

Application of zero eigenvalue for solving the potential, heat, and wave equations using a sequence of special functions

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.

Eigenvalue for Densely Defined Perturbations of Multivalued Maximal Monotone Operators in Reflexive Banach Spaces

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.

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)

Seeking Space Aliens and the Strong Approximation Property: A (disjoint) Study in Dust Plumes on Planetary Satellites and Nonsymmetric Algebraic Multigrid

Science.gov (United States)

Southworth, Benjamin Scott

linear systems arises often in the modeling of biological and physical phenomenon, data analysis through graphs and networks, and other scientific applications. This work focuses primarily on linear systems resulting from the discretization of partial differential equations (PDEs). Because solving linear systems is the bottleneck of many large simulation codes, there is a rich field of research in developing "fast" solvers, with the ultimate goal being a method that solves an n x n linear system in O(n) operations. One of the most effective classes of solvers is algebraic multigrid (AMG), which is a multilevel iterative method based on projecting the problem into progressively smaller spaces, and scales like O(n) or O(nlog n) for certain classes of problems. The field of AMG is well-developed for symmetric positive definite matrices, and is typically most effective on linear systems resulting from the discretization of scalar elliptic PDEs, such as the heat equation. Systems of PDEs can add additional difficulties, but the underlying linear algebraic theory is consistent and, in many cases, an elliptic system of PDEs can be handled well by AMG with appropriate modifications of the solver. Solving general, nonsymmetric linear systems remains the wild west of AMG (and other fast solvers), lacking significant results in convergence theory as well as robust methods. Here, we develop new theoretical motivation and practical variations of AMG to solve nonsymmetric linear systems, often resulting from the discretization of hyperbolic PDEs. In particular, multilevel convergence of AMG for nonsymmetric systems is proven for the first time. A new nonsymmetric AMG solver is also developed based on an approximate ideal restriction, referred to as AIR, which is able to solve advection-dominated, hyperbolic-type problems that are outside the scope of existing AMG solvers and other fast iterative methods. AIR demonstrates scalable convergence on unstructured meshes, in multiple

Solution of the two-dimensional spectral factorization problem

Science.gov (United States)

Lawton, W. M.

1985-01-01

An approximation theorem is proven which solves a classic problem in two-dimensional (2-D) filter theory. The theorem shows that any continuous two-dimensional spectrum can be uniformly approximated by the squared modulus of a recursively stable finite trigonometric polynomial supported on a nonsymmetric half-plane.

Positive Eigenvalues of Generalized Words in Two Hermitian Positive Definite Matrices

OpenAIRE

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

Advanced Variance Reduction for Global k-Eigenvalue Simulations in MCNP

Energy Technology Data Exchange (ETDEWEB)

Edward W. Larsen

2008-06-01

to the correlations between fission source estimates. In the new FMC method, the eigenvalue problem (expressed in terms of the Boltzmann equation) is integrated over the energy and direction variables. Then these equations are multiplied by J special "tent" functions in space and integrated over the spatial variable. This yields J equations that are exactly satisfied by the eigenvalue k and J space-angle-energy moments of the eigenfunction. Multiplying and dividing by suitable integrals of the eigenfunction, one obtains J algebraic equations for k and the space-angle-energy moments of the eigenfunction, which contain nonlinear functionals that depend weakly on the eigenfunction. In the FMC method, information from the standard Monte Carlo solution for each active cycle is used to estimate the functionals, and at the end of each cycle the J equations for k and the space-angle-energy moments of the eigenfunction are solved. Finally, these results are averaged over N active cycles to obtain estimated means and standard deviations for k and the space-angle-energy moments of the eigenfunction. Our limited testing shows that for large single fissile systems such as a commercial reactor core, (i) the FMC estimate of the eigenvalue is at least one order of magnitude more accurate than estimates obtained from the standard Monte Carlo approach, (ii) the FMC estimate of the eigenfunction converges and is several orders of magnitude more accurate than the standard estimate, and (iii) the FMC estimate of the standard deviation in k is at least one order of magnitude closer to the correct standard deviation than the standard estimate. These advances occur because: (i) the Monte Carlo estimates of the nonlinear functionals are much more accurate than the direct Monte Carlo estimates of the eigenfunction, (ii) the system of discrete equations that determines the FMC estimates of k is robust, and (iii) the functionals are only very weakly correlated between different fission

Spectral inversion of an indefinite Sturm-Liouville problem due to Richardson

International Nuclear Information System (INIS)

Shanley, Paul E

2009-01-01

We study an indefinite Sturm-Liouville problem due to Richardson whose complicated eigenvalue dependence on a parameter has been a puzzle for decades. In atomic physics a process exists that inverts the usual Schroedinger situation of an energy eigenvalue depending on a coupling parameter into the so-called Sturmian problem where the coupling parameter becomes the eigenvalue which then depends on the energy. We observe that the Richardson equation is of the Sturmian type. This means that the Richardson and its related Schroedinger eigenvalue functions are inverses of each other and that the Richardson spectrum is therefore no longer a puzzle

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)

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

Three-dimensional multiple reciprocity boundary element method for one-group neutron diffusion eigenvalue computations

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)

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)

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.

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

Adomian decomposition method for nonlinear Sturm-Liouville problems

Directory of Open Access Journals (Sweden)

Sennur Somali

2007-09-01

Full Text Available In this paper the Adomian decomposition method is applied to the nonlinear Sturm-Liouville problem-y" + y(tp=λy(t, y(t > 0, t ∈ I = (0, 1, y(0 = y(1 = 0, where p > 1 is a constant and λ > 0 is an eigenvalue parameter. Also, the eigenvalues and the behavior of eigenfuctions of the problem are demonstrated.

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

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.

Joint density of eigenvalues in spiked multivariate models.

Science.gov (United States)

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.

Efficient Nonlocal M-Control and N-Target Controlled Unitary Gate Using Non-symmetric GHZ States

Science.gov (United States)

Chen, Li-Bing; Lu, Hong

2018-03-01

Efficient local implementation of a nonlocal M-control and N-target controlled unitary gate is considered. We first show that with the assistance of two non-symmetric qubit(1)-qutrit(N) Greenberger-Horne-Zeilinger (GHZ) states, a nonlocal 2-control and N-target controlled unitary gate can be constructed from 2 local two-qubit CNOT gates, 2 N local two-qutrit conditional SWAP gates, N local qutrit-qubit controlled unitary gates, and 2 N single-qutrit gates. At each target node, the two third levels of the two GHZ target qutrits are used to expose one and only one initial computational state to the local qutrit-qubit controlled unitary gate, instead of being used to hide certain states from the conditional dynamics. This scheme can be generalized straightforwardly to implement a higher-order nonlocal M-control and N-target controlled unitary gate by using M non-symmetric qubit(1)-qutrit(N) GHZ states as quantum channels. Neither the number of the additional levels of each GHZ target particle nor that of single-qutrit gates needs to increase with M. For certain realistic physical systems, the total gate time may be reduced compared with that required in previous schemes.

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)

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)

Computation of Double Eigenvalues for Infinite Matrices of a Certain Class

OpenAIRE

宮崎, 佳典; 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...

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

Recurrence quantity analysis based on matrix eigenvalues

Science.gov (United States)

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.

The Guderley problem revisited

International Nuclear Information System (INIS)

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

2009-01-01

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

Seismic response of a nonsymmetric nuclear reactor building with a flexible stepped foundation

International Nuclear Information System (INIS)

Okano, H.; Sakai, A.; Takita, H.; Fukunishi, S.; Nakatogawa, T.; Kabayama, K.

1993-01-01

The effect of the non symmetry of a nuclear reactor building on its seismic response was studied. The nonsymmetric natures we considered, Included the eccentricity of the superstructure and the non symmetry of the cross section of the foundation. A three-dimensional analysis which employed Green's function was applied to study the interaction between the soil and the non symmetrically sectioned foundation. The effect of a flexible foundation on its seismic response was also studied by applying the sub structuring method, which combines the finite element method and Green's function method. (author)

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

Subspace orthogonalization for substructuring preconditioners for nonsymmetric systems of linear equations

Energy Technology Data Exchange (ETDEWEB)

Starke, G. [Universitaet Karlsruhe (Germany)

1994-12-31

For nonselfadjoint elliptic boundary value problems which are preconditioned by a substructuring method, i.e., nonoverlapping domain decomposition, the author introduces and studies the concept of subspace orthogonalization. In subspace orthogonalization variants of Krylov methods the computation of inner products and vector updates, and the storage of basis elements is restricted to a (presumably small) subspace, in this case the edge and vertex unknowns with respect to the partitioning into subdomains. The author investigates subspace orthogonalization for two specific iterative algorithms, GMRES and the full orthogonalization method (FOM). This is intended to eliminate certain drawbacks of the Arnoldi-based Krylov subspace methods mentioned above. Above all, the length of the Arnoldi recurrences grows linearly with the iteration index which is therefore restricted to the number of basis elements that can be held in memory. Restarts become necessary and this often results in much slower convergence. The subspace orthogonalization methods, in contrast, require the storage of only the edge and vertex unknowns of each basis element which means that one can iterate much longer before restarts become necessary. Moreover, the computation of inner products is also restricted to the edge and vertex points which avoids the disturbance of the computational flow associated with the solution of subdomain problems. The author views subspace orthogonalization as an alternative to restarting or truncating Krylov subspace methods for nonsymmetric linear systems of equations. Instead of shortening the recurrences, one restricts them to a subset of the unknowns which has to be carefully chosen in order to be able to extend this partial solution to the entire space. The author discusses the convergence properties of these iteration schemes and its advantages compared to restarted or truncated versions of Krylov methods applied to the full preconditioned system.

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.

On two-spectra inverse problems

OpenAIRE

Guliyev, Namig J.

2018-01-01

We consider a two-spectra inverse problem for the one-dimensional Schr\\"{o}dinger equation with boundary conditions containing rational Herglotz--Nevanlinna functions of the eigenvalue parameter and provide a complete solution of this problem.

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)

The Schroedinger equation as a singular perturbation problem

International Nuclear Information System (INIS)

Jager, E.M. de; Kuepper, T.

1978-01-01

Comparisons are made of the eigenvalues and the corresponding eigenfunctions of the eigenvalue problem connected with the one dimensional Schroedinger equation in Hilbert space. The difference of the eigenvalues is estimated by applying Weyl's monotonicity principle and the minimum maximum principle. The difference of the eigenfunctions is estimated in L 2 norm and in maximum norm obtained by using simple tools from operator theory in Hilbert spaces. An application concerning perturbations of the Planck ideal linear oscillator is given. (author)

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)

The simple production of nonsymmetric quaterpyridines through Kröhnke pyridine synthesis

Directory of Open Access Journals (Sweden)

Isabelle Sasaki

2015-09-01

Full Text Available Quaterpyridines have been demonstrated to be useful building blocks in metallo-supramolecular chemistry; however, their synthesis requires the preparation of sensitive building blocks. We present here three examples of nonsymmetric quaterpyridines that were easily obtained in yields of 70–85% by condensation of commercially available enones with 6-acetyl-2,2’:6’,2’’-terpyridine through a Kröhnke pyridine synthesis. Easy access to 6-acetyl-2,2’:6’,2’’-terpyridine starting from 2,6-diacetylpyridine and 2-acetylpyridine is described. The X-ray analysis of a chiral quaterpyridine and its Pt(II complex is presented.

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

Advanced quadratures and periodic boundary conditions in parallel 3D Sn transport

International Nuclear Information System (INIS)

Manalo, K.; Yi, C.; Huang, M.; Sjoden, G.

2013-01-01

Significant updates in numerical quadratures have warranted investigation with 3D Sn discrete ordinates transport. We show new applications of quadrature departing from level symmetric ( 2 o) and Pn-Tn (>S 2 o). investigating 3 recently developed quadratures: Even-Odd (EO), Linear-Discontinuous Finite Element - Surface Area (LDFE-SA), and the non-symmetric Icosahedral Quadrature (IC). We discuss implementation changes to 3D Sn codes (applied to Hybrid MOC-Sn TITAN and 3D parallel PENTRAN) that can be performed to accommodate Icosahedral Quadrature, as this quadrature is not 90-degree rotation invariant. In particular, as demonstrated using PENTRAN, the properties of Icosahedral Quadrature are suitable for trivial application using periodic BCs versus that of reflective BCs. In addition to implementing periodic BCs for 3D Sn PENTRAN, we implemented a technique termed 'angular re-sweep' which properly conditions periodic BCs for outer eigenvalue iterative loop convergence. As demonstrated by two simple transport problems (3-group fixed source and 3-group reflected/periodic eigenvalue pin cell), we remark that all of the quadratures we investigated are generally superior to level symmetric quadrature, with Icosahedral Quadrature performing the most efficiently for problems tested. (authors)

Eigenvalue Problems.

Science.gov (United States)

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

Instability of the cored barotropic disc: the linear eigenvalue formulation

Science.gov (United States)

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.

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.

Existence of solutions to fractional boundary-value problems with a parameter

Directory of Open Access Journals (Sweden)

Ya-Ning Li

2013-06-01

Full Text Available This article concerns the existence of solutions to the fractional boundary-value problem $$displaylines{ -frac{d}{dt} ig(frac{1}{2} {}_0D_t^{-eta}+ frac{1}{2}{}_tD_{T}^{-eta}igu'(t=lambda u(t+abla F(t,u(t,quad hbox{a.e. } tin[0,T], cr u(0=0,quad u(T=0. }$$ First for the eigenvalue problem associated with it, we prove that there is a sequence of positive and increasing real eigenvalues; a characterization of the first eigenvalue is also given. Then under different assumptions on the nonlinearity F(t,u, we show the existence of weak solutions of the problem when $lambda$ lies in various intervals. Our main tools are variational methods and critical point theorems.

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

Science.gov (United States)

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

Multiscale finite element methods for high-contrast problems using local spectral basis functions

KAUST Repository

Efendiev, Yalchin

2011-02-01

In this paper we study multiscale finite element methods (MsFEMs) using spectral multiscale basis functions that are designed for high-contrast problems. Multiscale basis functions are constructed using eigenvectors of a carefully selected local spectral problem. This local spectral problem strongly depends on the choice of initial partition of unity functions. The resulting space enriches the initial multiscale space using eigenvectors of local spectral problem. The eigenvectors corresponding to small, asymptotically vanishing, eigenvalues detect important features of the solutions that are not captured by initial multiscale basis functions. Multiscale basis functions are constructed such that they span these eigenfunctions that correspond to small, asymptotically vanishing, eigenvalues. We present a convergence study that shows that the convergence rate (in energy norm) is proportional to (H/Λ*)1/2, where Λ* is proportional to the minimum of the eigenvalues that the corresponding eigenvectors are not included in the coarse space. Thus, we would like to reach to a larger eigenvalue with a smaller coarse space. This is accomplished with a careful choice of initial multiscale basis functions and the setup of the eigenvalue problems. Numerical results are presented to back-up our theoretical results and to show higher accuracy of MsFEMs with spectral multiscale basis functions. We also present a hierarchical construction of the eigenvectors that provides CPU savings. © 2010.

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)

Computations of zeros of special functions and eigenvalues of differential equations by matrix method

OpenAIRE

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

Modification of the MORSE code for Monte Carlo eigenvalue problems by coarse-mesh rebalance acceleration

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

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

Science.gov (United States)

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.

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.

High-order modulation on a single discrete eigenvalue for optical communications based on nonlinear Fourier transform.

Science.gov (United States)

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.

Iminobisphosphines to (non-)symmetrical diphosphinoamine ligands : Metal-induced synthesis of diphosphorus nickel complexes and application in ethylene oligomerisation reactions

NARCIS (Netherlands)

Boulens, Pierre; Lutz, Martin|info:eu-repo/dai/nl/304828971; Jeanneau, Erwann; Olivier-Bourbigou, Hélène; Reek, Joost N H; Breuil, Pierre Alain R

2014-01-01

We describe the synthesis of a range of novel iminobisphosphine ligands based on a sulfonamido moiety [R1SO2N=P(R 2)2-P(R3)2]. These molecules rearrange in the presence of nickel by metal-induced breakage of the P-P bond to yield symmetrical and nonsymmetrical diphosphinoamine nickel complexes of

To the confinement problem

International Nuclear Information System (INIS)

Savvidi, G.K.

1985-01-01

Such a viewpoint is proposed for separation of the physical quantities into observable and unobservable ones, when the latters are connected with the Hermitian operator for which the eigenvalue problem is unsolvable

Leak detection of complex pipelines based on the filter diagonalization method: robust technique for eigenvalue assessment

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

Calculation of the ground-state energy and average distance between particles for the nonsymmetric muonic 3He atom

International Nuclear Information System (INIS)

Eskandari, M.R.; Rezaie, B.

2005-01-01

A calculation of the ground-state energy and average distance between particles in the nonsymmetric muonic 3 He atom is given. We have used a wave function with one free parameter, which satisfies boundary conditions such as the behavior of the wave function when two particles are close to each other or far away. In the proposed wave function, the electron-muon correlation function is also considered. It has a correct behavior for r 12 tending to zero and infinity. The calculated values for the energy and expectation values of r 2n are compared with the multibox variational approach and the correlation function hyperspherical harmonic method. In addition, to show the importance and accuracy of approach used, the method is applied to evaluate the ground-state energy and average distance between the particles of nonsymmetric muonic 4 He atom. Our obtained results are very close to the values calculated by the mentioned methods and giving strong indications that the proposed wave functions, in addition to being very simple, provide relatively accurate values for the energy and expectation values of r 2n , emphasizing the importance of the local properties of the wave function

A non-symmetric pillar[5]arene based on triazole-linked 8-oxyquinolines as a sequential sensor for thorium(IV) followed by fluoride ions.

Science.gov (United States)

Fang, Yuyu; Li, Caixia; Wu, Lei; Bai, Bing; Li, Xing; Jia, Yiming; Feng, Wen; Yuan, Lihua

2015-09-07

A novel non-symmetric pillar[5]arene bearing triazole-linked 8-oxyquinolines at one rim was synthesized and demonstrated as a sequential fluorescence sensor for thorium(iv) followed by fluoride ions with high sensitivity and selectivity.

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

Eigenvalue pinching on spinc manifolds

Science.gov (United States)

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.

Analysis of eigenvalue correction applied to biometrics

NARCIS (Netherlands)

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

First-order optical systems with unimodular eigenvalues

NARCIS (Netherlands)

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

Reaction of Non-Symmetric Schiff Base Metallo-Ligand Complexes Possessing an Oxime Function with Ln Ions

Directory of Open Access Journals (Sweden)

Jean-Pierre Costes

2018-03-01

Full Text Available The preparation of non-symmetric Schiff base ligands possessing one oxime function that is associated to a second function such as pyrrole or phenol function is first described. These ligands, which possess inner N4 or N3O coordination sites, allow formation of cationic or neutral non-symmetric CuII or NiII metallo-ligand complexes under their mono- or di-deprotonated forms. In presence of Lanthanide ions the neutral complexes do not coordinate to the LnIII ions, the oxygen atom of the oxime function being only hydrogen-bonded to a water molecule that is linked to the LnIII ion. This surprising behavior allows for the isolation of LnIII ions by non-interacting metal complexes. Reaction of cationic NiII complexes possessing a protonated oxime function with LnIII ions leads to the formation of original and dianionic (Gd(NO352− entities that are well separated from each other. This work highlights the preparation of well isolated mononuclear LnIII entities into a matrix of diamagnetic metal complexes. These new complexes complete our previous work dealing with the complexing ability of the oxime function toward Lanthanide ions. It could open the way to the synthesis of new entities with interesting properties, such as single-ion magnets for example.

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.

Suppression of chaos by weak resonant excitations in a non-linear oscillator with a non-symmetric potential

International Nuclear Information System (INIS)

Litak, Grzegorz; Syta, Arkadiusz; Borowiec, Marek

2007-01-01

We examine the Melnikov criterion for transition to chaos in case of one degree of freedom non-linear oscillator with non-symmetric potential. This system, when subjected to an external periodic force, shows homoclinic transition from regular vibrations to chaos just before escape from a potential well. We focus especially on the effect of a second resonant excitation with a different phase on the system transition to chaos. We propose a way of its control

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

Exact results for the many-body problem in one dimension with repulsive delta-function interaction

International Nuclear Information System (INIS)

Yang, C.N.

1983-01-01

The repulsive δ interaction problem in one dimension for N particles is reduced, through the use of Bethe's hypothesis, to an eigenvalue problem of matrices of the same sizes as the irreducible representations R of the permutation group S/sub N/. For some R's this eigenvalue problem itself is solved by a second use of Bethe's hypothesis, in a generalized form. In particular, the ground-state problem of spin-1/2 fermions is reduced to a generalized Fredholm equation

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.

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.

Right-Hand Side Dependent Bounds for GMRES Applied to Ill-Posed Problems

KAUST Repository

Pestana, Jennifer

2014-01-01

© IFIP International Federation for Information Processing 2014. In this paper we apply simple GMRES bounds to the nearly singular systems that arise in ill-posed problems. Our bounds depend on the eigenvalues of the coefficient matrix, the right-hand side vector and the nonnormality of the system. The bounds show that GMRES residuals initially decrease, as residual components associated with large eigenvalues are reduced, after which semi-convergence can be expected because of the effects of small eigenvalues.

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

Symmetry-adapted basis sets automatic generation for problems in chemistry and physics

CERN Document Server

Avery, John Scales; Avery, James Emil

2012-01-01

In theoretical physics, theoretical chemistry and engineering, one often wishes to solve partial differential equations subject to a set of boundary conditions. This gives rise to eigenvalue problems of which some solutions may be very difficult to find. For example, the problem of finding eigenfunctions and eigenvalues for the Hamiltonian of a many-particle system is usually so difficult that it requires approximate methods, the most common of which is expansion of the eigenfunctions in terms of basis functions that obey the boundary conditions of the problem. The computational effort needed

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

OPERATOR-RELATED FORMULATION OF THE EIGENVALUE PROBLEM FOR THE BOUNDARY PROBLEM OF ANALYSIS OF A THREE-DIMENSIONAL STRUCTURE WITH PIECEWISE-CONSTANT PHYSICAL AND GEOMETRICAL PARAMETERS ALONGSIDE THE BASIC DIRECTION WITHIN THE FRAMEWORK OF THE DISCRETE-CON

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.

Thick restarting of the Davidson method: An extension to implicit restarting

Energy Technology Data Exchange (ETDEWEB)

Stathopoulos, A.; Yousef Saad; Wu, Kesheng [Univ. of Minnesota, Minneapolis, MN (United States)

1996-12-31

The solution of the large, sparse, eigenvalue problem Ax = {lambda}x, for a few eigenpairs is central to many scientific applications. The Arnoldi method, and its equivalent in the symmetric case the Lanczos method, have been the traditional approach to solving these problems. Preconditioning, through some shift-and-invert technique, is frequently employed, because of the difficulty of these problems. A different approach is followed by the Generalized Davidson (GD) method which is a popular preconditioned variant of the Lanczos iteration. Instead of using a three-term recurrence to build an orthonormal basis for the Krylov subspace, the GD algorithm obtains the next basis vector by explicitly orthogonalizing the preconditioned residual (M - {lambda}I){sup -1} (A - {lambda}I)x against the existing basis. A straightforward extension to the non-symmetric case has also been studied in. The GD method can be regarded as a way of improving convergence and robustness at the expense of a more complicated step.

ILUBCG2-11: Solution of 11-banded nonsymmetric linear equation systems by a preconditioned biconjugate gradient routine

Science.gov (United States)

Chen, Y.-M.; Koniges, A. E.; Anderson, D. V.

1989-10-01

The biconjugate gradient method (BCG) provides an attractive alternative to the usual conjugate gradient algorithms for the solution of sparse systems of linear equations with nonsymmetric and indefinite matrix operators. A preconditioned algorithm is given, whose form resembles the incomplete L-U conjugate gradient scheme (ILUCG2) previously presented. Although the BCG scheme requires the storage of two additional vectors, it converges in a significantly lesser number of iterations (often half), while the number of calculations per iteration remains essentially the same.

An asymptotic expression for the eigenvalues of the normalization kernel of the resonating group method

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

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)

Effective Perron-Frobenius eigenvalue for a correlated random map

Science.gov (United States)

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.

An inverse Sturm–Liouville problem with a fractional derivative

KAUST Repository

Jin, Bangti; Rundell, William

2012-01-01

In this paper, we numerically investigate an inverse problem of recovering the potential term in a fractional Sturm-Liouville problem from one spectrum. The qualitative behaviors of the eigenvalues and eigenfunctions are discussed, and numerical

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

Science.gov (United States)

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.

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

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.

Application of Higher Order Fission Matrix for Real Variance Estimation in McCARD Monte Carlo Eigenvalue Calculation

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.

Sensitivity analysis for large-scale problems

Science.gov (United States)

Noor, Ahmed K.; Whitworth, Sandra L.

1987-01-01

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

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.

Problems in the theory of point explosions

Science.gov (United States)

Korobeinikov, V. P.

The book is concerned with the development of the theory of point explosions, which is relevant to the study of such phenomena as the initiation of detonation, high-power explosions, electric discharges, cosmic explosions, laser blasts, and hypersonic aerodynamics. The discussion covers the principal equations and the statement of problems; linearized non-self-similar one-dimensional problems; spherical, cylindrical, and plane explosions with allowance for counterpressure under conditions of constant initial density; explosions in a combustible mixture of gases; and point explosions in inhomogeneous media with nonsymmetric energy release. Attention is also given to point explosions in an electrically conducting gas with allowance for the effect of the magnetic field and to the propagation of perturbations from solar flares.

Dual plane problems for creeping flow of power-law incompressible medium

Directory of Open Access Journals (Sweden)

Dmitriy S. Petukhov

2016-09-01

Full Text Available In this paper, we consider the class of solutions for a creeping plane flow of incompressible medium with power-law rheology, which are written in the form of the product of arbitrary power of the radial coordinate by arbitrary function of the angular coordinate of the polar coordinate system covering the plane. This class of solutions represents the asymptotics of fields in the vicinity of singular points in the domain occupied by the examined medium. We have ascertained the duality of two problems for a plane with wedge-shaped notch, at which boundaries in one of the problems the vector components of the surface force vanish, while in the other—the vanishing components are the vector components of velocity, We have investigated the asymptotics and eigensolutions of the dual nonlinear eigenvalue problems in relation to the rheological exponent and opening angle of the notch for the branch associated with the eigenvalue of the Hutchinson–Rice–Rosengren problem learned from the problem of stress distribution over a notched plane for a power law medium. In the context of the dual problem we have determined the velocity distribution in the flow of power-law medium at the vertex of a rigid wedge, We have also found another two eigenvalues, one of which was determined by V. V. Sokolovsky for the problem of power-law fluid flow in a convergent channel.

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.

Algorithm 589. SICEDR: a FORTRAN subroutine for improving the accuracy of computed matrix eigenvalues

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

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.

Numerical Aspects of Eigenvalue and Eigenfunction Computations for Chaotic Quantum Systems

Science.gov (United States)

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.

Limiting Accuracy of Segregated Solution Methods for Nonsymmetric Saddle Point Problems

Czech Academy of Sciences Publication Activity Database

Jiránek, P.; Rozložník, Miroslav

Roc. 215, c. 1 (2008), s. 28-37 ISSN 0377-0427 R&D Projects: GA MŠk 1M0554; GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : saddle point problems * Schur complement reduction method * null-space projection method * rounding error analysis Subject RIV: BA - General Mathematics Impact factor: 1.048, year: 2008

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

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

A Universal Quantum Circuit Scheme For Finding Complex Eigenvalues

OpenAIRE

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.

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

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.

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

Science.gov (United States)

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.

Random matrices, Frobenius eigenvalues, and monodromy

CERN Document Server

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.

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

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

Unprecedented Hexanuclear Cobalt(II Nonsymmetrical Salamo-Based Coordination Compound: Synthesis, Crystal Structure, and Photophysical Properties

Directory of Open Access Journals (Sweden)

Zong-Li Ren

2018-03-01

Full Text Available A novel hexanuclear Co(II coordination compound with a nonsymmetrical Salamo-type bisoxime ligandH4L, namely [{Co3(HL(MeO(MeOH2(OAc2}2]·2MeOH, was prepared and characterized by elemental analyses, UV–vis, IR and fluorescence spectra, and X-ray single-crystal diffraction analysis. Each Co(II is hexacoordinated, and possesses a distorted CoO6 or CoO4N2 octahedrons. The Co(II coordination compound possesses a self-assembled infinite 2D supramolecular structure with the help of the intermolecular C–H···O interactions. Meanwhile, the photophysical properties of the Co(II coordination compound were studied.

A theoretical study on a convergence problem of nodal methods

Energy Technology Data Exchange (ETDEWEB)

Shaohong, Z.; Ziyong, L. [Shanghai Jiao Tong Univ., 1954 Hua Shan Road, Shanghai, 200030 (China); Chao, Y. A. [Westinghouse Electric Company, P. O. Box 355, Pittsburgh, PA 15230-0355 (United States)

2006-07-01

The effectiveness of modern nodal methods is largely due to its use of the information from the analytical flux solution inside a homogeneous node. As a result, the nodal coupling coefficients depend explicitly or implicitly on the evolving Eigen-value of a problem during its solution iteration process. This poses an inherently non-linear matrix Eigen-value iteration problem. This paper points out analytically that, whenever the half wave length of an evolving node interior analytic solution becomes smaller than the size of that node, this non-linear iteration problem can become inherently unstable and theoretically can always be non-convergent or converge to higher order harmonics. This phenomenon is confirmed, demonstrated and analyzed via the simplest 1-D problem solved by the simplest analytic nodal method, the Analytic Coarse Mesh Finite Difference (ACMFD, [1]) method. (authors)

On Euler's problem

International Nuclear Information System (INIS)

Egorov, Yurii V

2013-01-01

We consider the classical problem on the tallest column which was posed by Euler in 1757. Bernoulli-Euler theory serves today as the basis for the design of high buildings. This problem is reduced to the problem of finding the potential for the Sturm-Liouville equation corresponding to the maximum of the first eigenvalue. The problem has been studied by many mathematicians but we give the first rigorous proof of the existence and uniqueness of the optimal column and we give new formulae which let us find it. Our method is based on a new approach consisting in the study of critical points of a related nonlinear functional. Bibliography: 6 titles.

Overview of the ArbiTER edge plasma eigenvalue code

Science.gov (United States)

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.

Convergence estimates for iterative methods via the Kriess Matrix Theorem on a general complex domain

Energy Technology Data Exchange (ETDEWEB)

Toh, K.C.; Trefethen, L.N. [Cornell Univ., Ithaca, NY (United States)

1994-12-31

What properties of a nonsymmetric matrix A determine the convergence rate of iterations such as GMRES, QMR, and Arnoldi? If A is far from normal, should one replace the usual Ritz values {r_arrow} eigenvalues notion of convergence of Arnoldi by alternative notions such as Arnoldi lemniscates {r_arrow} pseudospectra? Since Krylov subspace iterations can be interpreted as minimization processes involving polynomials of matrices, the answers to questions such as these depend upon mathematical problems of the following kind. Given a polynomial p(z), how can one bound the norm of p(A) in terms of (1) the size of p(z) on various sets in the complex plane, and (2) the locations of the spectrum and pseudospectra of A? This talk reports some progress towards solving these problems. In particular, the authors present theorems that generalize the Kreiss matrix theorem from the unit disk (for the monomial A{sup n}) to a class of general complex domains (for polynomials p(A)).

On the calculation of the eigenvalues of the Faddeev equation kernel on the nonphysical sheet of energy

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)

On the ratio probability of the smallest eigenvalues in the Laguerre unitary ensemble

Science.gov (United States)

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.

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

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)

Construction of accuracy-preserving surrogate for the eigenvalue radiation diffusion and/or transport problem

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)

A balancing domain decomposition method by constraints for advection-diffusion problems

Energy Technology Data Exchange (ETDEWEB)

Tu, Xuemin; Li, Jing

2008-12-10

The balancing domain decomposition methods by constraints are extended to solving nonsymmetric, positive definite linear systems resulting from the finite element discretization of advection-diffusion equations. A pre-conditioned GMRES iteration is used to solve a Schur complement system of equations for the subdomain interface variables. In the preconditioning step of each iteration, a partially sub-assembled finite element problem is solved. A convergence rate estimate for the GMRES iteration is established, under the condition that the diameters of subdomains are small enough. It is independent of the number of subdomains and grows only slowly with the subdomain problem size. Numerical experiments for several two-dimensional advection-diffusion problems illustrate the fast convergence of the proposed algorithm.

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

International Nuclear Information System (INIS)

Blomquist, Roger N.; Gelbard, Ely M.

2003-01-01

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

Anderson localization of ballooning modes, quantum chaos and the stability of compact quasiaxially symmetric stellarators

International Nuclear Information System (INIS)

Redi, M.H.; Johnson, J.L.; Klasky, S.; Canik, J.; Dewar, R.L.; Cooper, W.A.

2002-01-01

The radially local magnetohydrodynamic (MHD) ballooning stability of a compact, quasiaxially symmetric stellarator (QAS), is examined just above the ballooning beta limit with a method that can lead to estimates of global stability. Here MHD stability is analyzed through the calculation and examination of the ballooning mode eigenvalue isosurfaces in the 3-space (s,α,θ k ); s is the edge normalized toroidal flux, α is the field line variable, and θ k is the perpendicular wave vector or ballooning parameter. Broken symmetry, i.e., deviations from axisymmetry, in the stellarator magnetic field geometry causes localization of the ballooning mode eigenfunction, and gives rise to new types of nonsymmetric eigenvalue isosurfaces in both the stable and unstable spectrum. For eigenvalues far above the marginal point, isosurfaces are topologically spherical, indicative of strong 'quantum chaos'. The complexity of QAS marginal isosurfaces suggests that finite Larmor radius stabilization estimates will be difficult and that fully three-dimensional, high-n MHD computations are required to predict the beta limit

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

Boundary integral equation methods in eigenvalue problems of elastodynamics and thin plates

CERN Document Server

Kitahara, M

1985-01-01

The boundary integral equation (BIE) method has been used more and more in the last 20 years for solving various engineering problems. It has important advantages over other techniques for numerical treatment of a wide class of boundary value problems and is now regarded as an indispensable tool for potential problems, electromagnetism problems, heat transfer, fluid flow, elastostatics, stress concentration and fracture problems, geomechanical problems, and steady-state and transient electrodynamics.In this book, the author gives a complete, thorough and detailed survey of the method. It pro

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.

Domain decomposition methods for the mixed dual formulation of the critical neutron diffusion problem; Methodes de decomposition de domaine pour la formulation mixte duale du probleme critique de la diffusion des neutrons

Energy Technology Data Exchange (ETDEWEB)

Guerin, P

2007-12-15

The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)

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.

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.

Lévy flights in an infinite potential well as a hypersingular Fredholm problem.

Science.gov (United States)

Kirichenko, Elena V; Garbaczewski, Piotr; Stephanovich, Vladimir; Żaba, Mariusz

2016-05-01

We study Lévy flights with arbitrary index 0potential well of infinite depth. Such a problem appears in many physical systems ranging from stochastic interfaces to fracture dynamics and multifractality in disordered quantum systems. The major technical tool is a transformation of the eigenvalue problem for initial fractional Schrödinger equation into that for Fredholm integral equation with hypersingular kernel. The latter equation is then solved by means of expansion over the complete set of orthogonal functions in the domain D, reducing the problem to the spectrum of a matrix of infinite dimensions. The eigenvalues and eigenfunctions are then obtained numerically with some analytical results regarding the structure of the spectrum.

Reflectance variability of surface coatings reveals characteristic eigenvalue spectra

Science.gov (United States)

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.

Domain decomposition methods for the mixed dual formulation of the critical neutron diffusion problem

International Nuclear Information System (INIS)

Guerin, P.

2007-12-01

The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)

Test-particle motion in the nonsymmetric gravitation theory

International Nuclear Information System (INIS)

Moffat, J.W.

1987-01-01

A derivation of the motion of test particles in the nonsymmetric gravitational theory (NGT) is given using the field equations in the presence of matter. The motion of the particle is governed by the Christoffel symbols, which are formed from the symmetric part of the fundamental tensor g/sub μ//sub ν/, as well as by a tensorial piece determined by the skew part of the contracted curvature tensor R/sub μ//sub ν/. Given the energy-momentum tensor for a perfect fluid and the definition of a test particle in the NGT, the equations of motion follow from the conservation laws. The tensorial piece in the equations of motion describes a new force in nature that acts on the conserved charge in a body. Particles that carry this new charge do not follow geodesic world lines in the NGT, whereas photons do satisfy geodesic equations of motion and the equivalence principle of general relativity. Astronomical predictions, based on the exact static, spherically symmetric solution of the field equations in a vacuum and the test-particle equations of motion, are derived in detail. The maximally extended coordinates that remove the event-horizon singularities in the static, spherically symmetric solution are presented. It is shown how an inward radially falling test particle can be prevented from forming an event horizon for a value greater than a specified critical value of the source charge. If a test particle does fall through an event horizon, then it must continue to fall until it reaches the singularity at r = 0

Test-particle motion in the nonsymmetric gravitation theory

Science.gov (United States)

Moffat, J. W.

1987-06-01

A derivation of the motion of test particles in the nonsymmetric gravitational theory (NGT) is given using the field equations in the presence of matter. The motion of the particle is governed by the Christoffel symbols, which are formed from the symmetric part of the fundamental tensor gμν, as well as by a tensorial piece determined by the skew part of the contracted curvature tensor Rμν. Given the energy-momentum tensor for a perfect fluid and the definition of a test particle in the NGT, the equations of motion follow from the conservation laws. The tensorial piece in the equations of motion describes a new force in nature that acts on the conserved charge in a body. Particles that carry this new charge do not follow geodesic world lines in the NGT, whereas photons do satisfy geodesic equations of motion and the equivalence principle of general relativity. Astronomical predictions, based on the exact static, spherically symmetric solution of the field equations in a vacuum and the test-particle equations of motion, are derived in detail. The maximally extended coordinates that remove the event-horizon singularities in the static, spherically symmetric solution are presented. It is shown how an inward radially falling test particle can be prevented from forming an event horizon for a value greater than a specified critical value of the source charge. If a test particle does fall through an event horizon, then it must continue to fall until it reaches the singularity at r=0.

Computing eigenvalue sensitivity coefficients to nuclear data based on the CLUTCH method with RMC code

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

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.

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

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.

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

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.

Investigation, development and application of optimal output feedback theory. Vol. 4: Measures of eigenvalue/eigenvector sensitivity to system parameters and unmodeled dynamics

Science.gov (United States)

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.

Topics in bound-state dynamical processes: semiclassical eigenvalues, reactive scattering kernels and gas-surface scattering models

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

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)

On the convex closed set-valued operators in Banach spaces and their applications in control problems

International Nuclear Information System (INIS)

Vu Ngoc Phat; Jong Yeoul Park

1995-10-01

The paper studies a class of set-values operators with emphasis on properties of their adjoints and existence of eigenvalues and eigenvectors of infinite-dimensional convex closed set-valued operators. Sufficient conditions for existence of eigenvalues and eigenvectors of set-valued convex closed operators are derived. These conditions specify possible features of control problems. The results are applied to some constrained control problems of infinite-dimensional systems described by discrete-time inclusions whose right-hand-sides are convex closed set- valued functions. (author). 8 refs

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

Science.gov (United States)

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 comparison of maximum likelihood and other estimators of eigenvalues from several correlated Monte Carlo samples

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

Multi-catalysis cascade reactions based on the methoxycarbonylketene platform: diversity-oriented synthesis of functionalized non-symmetrical malonates for agrochemicals and pharmaceuticals.

Science.gov (United States)

Ramachary, Dhevalapally B; Venkaiah, Chintalapudi; Reddy, Y Vijayendar; Kishor, Mamillapalli

2009-05-21

In this paper we describe new multi-catalysis cascade (MCC) reactions for the one-pot synthesis of highly functionalized non-symmetrical malonates. These metal-free reactions are either five-step (olefination/hydrogenation/alkylation/ketenization/esterification) or six-step (olefination/hydrogenation/alkylation/ketenization/esterification/alkylation), and employ aldehydes/ketones, Meldrum's acid, 1,4-dihydropyridine/o-phenylenediamine, diazomethane, alcohols and active ethylene/acetylenes, and involve iminium-, self-, self-, self- and base-catalysis, respectively. Many of the products have direct application in agricultural and pharmaceutical chemistry.

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)

MIMO Channel Model with Propagation Mechanism and the Properties of Correlation and Eigenvalue in Mobile Environments

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.

Gravitational lensing by eigenvalue distributions of random matrix models

Science.gov (United States)

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 Euler's problem

Energy Technology Data Exchange (ETDEWEB)

Egorov, Yurii V [Institute de Mathematique de Toulouse, Toulouse (France)

2013-04-30

We consider the classical problem on the tallest column which was posed by Euler in 1757. Bernoulli-Euler theory serves today as the basis for the design of high buildings. This problem is reduced to the problem of finding the potential for the Sturm-Liouville equation corresponding to the maximum of the first eigenvalue. The problem has been studied by many mathematicians but we give the first rigorous proof of the existence and uniqueness of the optimal column and we give new formulae which let us find it. Our method is based on a new approach consisting in the study of critical points of a related nonlinear functional. Bibliography: 6 titles.

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

Science.gov (United States)

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

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)

X-ray Structural Investigation of Nonsymmetrically and Symmetrically Alkylated [1]Benzothieno[3,2-b]benzothiophene Derivatives in Bulk and Thin Films.

OpenAIRE

Gbabode , Gabin; Dohr , Michael; Niebel , Claude; Balandier , Jean-Yves; Ruzié , Christian; Négrier , Philippe; Mondieig , Denise; Geerts , Yves H; Resel , Roland; Sferrazza , Michele

2014-01-01

International audience; A detailed structural study of the bulk and thin film phases observed for two potential high-performance organic semiconductors has been carried out. The molecules are based on [1]benzothieno[3,2-b]benzothiophene (BTBT) as conjugated core and octyl side groups, which are anchored either symmetrically at both sides of the BTBT core (C8-BTBT-C8) or nonsymmetrically at one side only (C8-BTBT). Thin films of different thickness (8-85 nm) have been prepared by spin-coating ...

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.

On a residual freedom of the next-to-leading BFKL eigenvalue in color adjoint representation in planar N=4 SYM

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.

Solving ground eigenvalue and eigenfunction of spheroidal wave equation at low frequency by supersymmetric quantum mechanics method

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.

Thermal Behaviour of Beams with Slant End-Plate Connection Subjected to Nonsymmetric Gravity Load

Directory of Open Access Journals (Sweden)

Farshad Zahmatkesh

2014-01-01

Full Text Available Research on the steel structures with confining of axial expansion in fixed beams has been quite intensive in the past decade. It is well established that the thermal behaviour has a key influence on steel structural behaviours. This paper describes mechanical behaviour of beams with bolted slant end-plate connection with nonsymmetric gravity load, subjected to temperature increase. Furthermore, the performance of slant connections of beams in steel moment frame structures in the elastic field is investigated. The proposed model proved that this flexible connection system could successfully decrease the extra thermal induced axial force by both of the friction force dissipation among two faces of slant connection and a small upward movement on the slant plane. The applicability of primary assumption is illustrated. The results from the proposed model are examined within various slant angles, thermal and friction factors. It can be concluded that higher thermal conditions are tolerable when slanting connection is used.

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

A scalable geometric multigrid solver for nonsymmetric elliptic systems with application to variable-density flows

Science.gov (United States)

Esmaily, M.; Jofre, L.; Mani, A.; Iaccarino, G.

2018-03-01

A geometric multigrid algorithm is introduced for solving nonsymmetric linear systems resulting from the discretization of the variable density Navier-Stokes equations on nonuniform structured rectilinear grids and high-Reynolds number flows. The restriction operation is defined such that the resulting system on the coarser grids is symmetric, thereby allowing for the use of efficient smoother algorithms. To achieve an optimal rate of convergence, the sequence of interpolation and restriction operations are determined through a dynamic procedure. A parallel partitioning strategy is introduced to minimize communication while maintaining the load balance between all processors. To test the proposed algorithm, we consider two cases: 1) homogeneous isotropic turbulence discretized on uniform grids and 2) turbulent duct flow discretized on stretched grids. Testing the algorithm on systems with up to a billion unknowns shows that the cost varies linearly with the number of unknowns. This O (N) behavior confirms the robustness of the proposed multigrid method regarding ill-conditioning of large systems characteristic of multiscale high-Reynolds number turbulent flows. The robustness of our method to density variations is established by considering cases where density varies sharply in space by a factor of up to 104, showing its applicability to two-phase flow problems. Strong and weak scalability studies are carried out, employing up to 30,000 processors, to examine the parallel performance of our implementation. Excellent scalability of our solver is shown for a granularity as low as 104 to 105 unknowns per processor. At its tested peak throughput, it solves approximately 4 billion unknowns per second employing over 16,000 processors with a parallel efficiency higher than 50%.

Asymptotics of the Perron-Frobenius eigenvalue of nonnegative Hessenberg-Toeplitz matrices

NARCIS (Netherlands)

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

An Inverse Eigenvalue Problem for a Vibrating String with Two Dirichlet Spectra

KAUST Repository

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

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

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

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

The analysis by several neutron transport methods of a small PWR model problem

International Nuclear Information System (INIS)

Halsall, M.J.

1980-09-01

A small model problem in x-y co-ordinate geometry is specified in detail to permit readers to make their own calculations. The problem is analysed using diffusion theory, differential and integral transport methods and a Monte Carlo code, and a best estimate eigenvalue is deduced. (author)

A Problem-Centered Approach to Canonical Matrix Forms

Science.gov (United States)

Sylvestre, Jeremy

2014-01-01

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

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

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.

Variational variance reduction for particle transport eigenvalue calculations using Monte Carlo adjoint simulation

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

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

Science.gov (United States)

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

2017-10-01

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

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

State space approach to mixed boundary value problems.

Science.gov (United States)

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

1973-01-01

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

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

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

Numerical solutions to critical problem of reflected cylindrical reactor

International Nuclear Information System (INIS)

Horie, Junnosuke

1977-01-01

The multi-region critical problem can be transformed into an eigenvalue problem in the classical sense by using the method of Kuscer and Corngold and of Wing. This transformation is applied to derive a variational formulation for a reflected reactor. An approximate critical value of the multiplying factor is determined by maximizing the Rayleigh quotient for radially and totally reflected cylindrical reactors. It is shown that this approximate critical value is an upper bound of the true critical value. From the facts that the operator is self-adjoint and the eigenfunction is positive, an expression is derived for the upper and lower bounds of the true eigenvalue, by making use of the approximate distribution. The difference of the upper and lower bounds is an uncertainty of the presumption of the true critical value. It is found that we can compute the bounds to any required precision. The narrow bounds are calculated for two radially and one totally reflected cylindrical reactors. (auth.)

Substantiating problems of quantum mechanics

International Nuclear Information System (INIS)

Gottlieb, J.

1978-05-01

Some basic problems, related to the spaces and the operators necessary to describe quantum-mechanical phenomena, are entered upon from a new axiomatic standpoint. Some generalizations are operated, required by convergence criteria, concerning the Fourier transform, the Fourier product and the equation of eigen-values. Physical arguments are brought to support such generalizations and an analysis in view of organizing the structure of the proposed spaces is undertaken. (author)

Cauchy problem for differential operators with double characteristics non-effectively hyperbolic characteristics

CERN Document Server

Nishitani, Tatsuo

2017-01-01

Combining geometrical and microlocal tools, this monograph gives detailed proofs of many well/ill-posed results related to the Cauchy problem for differential operators with non-effectively hyperbolic double characteristics. Previously scattered over numerous different publications, the results are presented from the viewpoint that the Hamilton map and the geometry of bicharacteristics completely characterizes the well/ill-posedness of the Cauchy problem. A doubly characteristic point of a differential operator P of order m (i.e. one where Pm = dPm = 0) is effectively hyperbolic if the Hamilton map FPm has real non-zero eigenvalues. When the characteristics are at most double and every double characteristic is effectively hyperbolic, the Cauchy problem for P can be solved for arbitrary lower order terms. If there is a non-effectively hyperbolic characteristic, solvability requires the subprincipal symbol of P to lie between − Pµj and P µj , where iµj are the positive imaginary eigenvalues of FPm ....

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)

Solving eigenvalue problems on curved surfaces using the Closest Point Method

KAUST Repository

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

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)

On the Convergence of Q-OR and Q-MR Krylov Methods for Solving Nonsymmetric Linear Systems

Czech Academy of Sciences Publication Activity Database

Duintjer Tebbens, Jurjen; Meurant, G.

2016-01-01

Roč. 56, č. 1 (2016), s. 77-97 ISSN 0006-3835 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : Krylov method * Q-OR method * Q-MR method * BiCG * QMR * CMRH * eigenvalue influence * prescribed convergence Subject RIV: BA - General Mathematics Impact factor: 1.670, year: 2016

Diffusion with Varying Drag; the Runaway Problem.

Science.gov (United States)

Rollins, David Kenneth

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

Diffusion with varying drag; the runaway problem

International Nuclear Information System (INIS)

Rollins, D.K.

1986-01-01

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

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

Science.gov (United States)

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-weighted moments in the problems of fragmentation

International Nuclear Information System (INIS)

Kuz'min, V.A.

1986-01-01

The problem of fragmentation of simple nuclear states on the complex ones is reduced to real symmetrical matrix eigenvectors and eigenvalue problem. Based on spectral decomposition of this matrix the simple and economical from computing point of view algorithm to calculate energetically-weighted strength function moments is obtained. This permitted one to investigate the sensitivity of solving the fragmentation problem to reducing the basis of complex states. It is shown that the full width of strength function is determined only by the complex states connected directly with the simple ones

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

Non-symmetric approach to single-screw expander and compressor modeling

Science.gov (United States)

Ziviani, Davide; Groll, Eckhard A.; Braun, James E.; Horton, W. Travis; De Paepe, M.; van den Broek, M.

2017-08-01

Single-screw type volumetric machines are employed both as compressors in refrigeration systems and, more recently, as expanders in organic Rankine cycle (ORC) applications. The single-screw machine is characterized by having a central grooved rotor and two mating toothed starwheels that isolate the working chambers. One of the main features of such machine is related to the simultaneous occurrence of the compression or expansion processes on both sides of the main rotor which results in a more balanced loading on the main shaft bearings with respect to twin-screw machines. However, the meshing between starwheels and main rotor is a critical aspect as it heavily affects the volumetric performance of the machine. To allow flow interactions between the two sides of the rotor, a non-symmetric modelling approach has been established to obtain a more comprehensive model of the single-screw machine. The resulting mechanistic model includes in-chamber governing equations, leakage flow models, heat transfer mechanisms, viscous and mechanical losses. Forces and moments balances are used to estimate the loads on the main shaft bearings as well as on the starwheel bearings. An 11 kWe single-screw expander (SSE) adapted from an air compressor operating with R245fa as working fluid is used to validate the model. A total of 60 steady-steady points at four different rotational speeds have been collected to characterize the performance of the machine. The maximum electrical power output and overall isentropic efficiency measured were 7.31 kW and 51.91%, respectively.

Problems and solutions in thermoelasticity and magneto-thermoelasticity

CERN Document Server

Das, B

2017-01-01

This book presents problems and solutions of the mathematical theories of thermoelasticity and magnetothermoelasticity. The classical, coupled and generalized theories are solved using the eigenvalue methodology. Different methods of numerical inversion of the Laplace transform are presented and their direct applications are illustrated. The book is very useful to those interested in continuum mechanics.

On Polya's inequality for torsional rigidity and first Dirichlet eigenvalue

OpenAIRE

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

Density profiles of small Dirac operator eigenvalues for two color QCD at nonzero chemical potential compared to matrix models

OpenAIRE

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.

Density profiles of small Dirac operator eigenvalues for two color QCD at nonzero chemical potential compared to matrix models

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

Physics-based models for measurement correlations: application to an inverse Sturm–Liouville problem

International Nuclear Information System (INIS)

Bal, Guillaume; Ren Kui

2009-01-01

In many inverse problems, the measurement operator, which maps objects of interest to available measurements, is a smoothing (regularizing) operator. Its inverse is therefore unbounded and as a consequence, only the low-frequency component of the object of interest is accessible from inevitably noisy measurements. In many inverse problems however, the neglected high-frequency component may significantly affect the measured data. Using simple scaling arguments, we characterize the influence of the high-frequency component. We then consider situations where the correlation function of such an influence may be estimated by asymptotic expansions, for instance as a random corrector in homogenization theory. This allows us to consistently eliminate the high-frequency component and derive a closed form, more accurate, inverse problem for the low-frequency component of the object of interest. We present the asymptotic expression of the correlation matrix of the eigenvalues in a Sturm–Liouville problem with unknown potential. We propose an iterative algorithm for the reconstruction of the potential from knowledge of the eigenvalues and show that using the approximate correlation matrix significantly improves the reconstructions

A comparison of the eigenvalue equations in kappa, α, lambda and γ in reactor theory. Application to fast and thermal systems in unreflected and reflected configurations

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)

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.

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)

Inverse resonance problems for the Schrödinger operator on the real line with mixed given data

Science.gov (United States)

Xu, Xiao-Chuan; Yang, Chuan-Fu

2018-01-01

In this work, we study inverse resonance problems for the Schrödinger operator on the real line with the potential supported in [0, 1]. In general, all eigenvalues and resonances cannot uniquely determine the potential. (i) It is shown that if the potential is known a priori on [0, 1 / 2], then the unique recovery of the potential on the whole interval from all eigenvalues and resonances is valid. (ii) If the potential is known a priori on [0, a], then for the case a>1/2, infinitely many eigenvalues and resonances can be missing for the unique determination of the potential, and for the case alogarithmic derivative values of eigenfunctions and wave-functions at 1 / 2, can uniquely determine the potential.

Evaluation of upper and lower bounds to energy eigenvalues in Shoenberg's perturbation-theory ground state by means of partitioning technique

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

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.

The Fourier-grid formalism: philosophy and application to scattering problems using R-matrix theory

International Nuclear Information System (INIS)

Layton, E.G.

1993-01-01

The Fourier-grid (FG) method is a recent L 2 variational treatment of the quantum mechanical eigenvalue problem that does not require the use of a set of basis functions; it is rather a discrete variable representation approach. In this article we restate the FG philosophy in more general terms, examine and compare this method with other approaches to the eigenvalue problem, and begin the development of an FG R-matrix method for scattering. The philosophy of the FG method is to use the simplest representation for each of the kinetic and potential energy operators of the Hamiltonian, and use a generalized Fourier transform to put the matrix elements of one of the above operators in the same representation as the other, so the Hamiltonian has a single representation. (author)

Application of bias factor method using random sampling technique for prediction accuracy improvement of critical eigenvalue of BWR

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)

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.

The Non–Symmetric s–Step Lanczos Algorithm: Derivation of Efficient Recurrences and Synchronization–Reducing Variants of BiCG and QMR

Directory of Open Access Journals (Sweden)

Feuerriegel Stefan

2015-12-01

Full Text Available The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG and quasi-minimal residual (QMR methods for solving large sparse non-symmetric systems of linear equations. It is well known that, when implemented on distributed-memory computers with a huge number of processes, the synchronization time spent on computing dot products increasingly limits the parallel scalability. Therefore, we propose synchronization-reducing variants of the Lanczos, as well as BiCG and QMR methods, in an attempt to mitigate these negative performance effects. These so-called s-step algorithms are based on grouping dot products for joint execution and replacing time-consuming matrix operations by efficient vector recurrences. The purpose of this paper is to provide a rigorous derivation of the recurrences for the s-step Lanczos algorithm, introduce s-step BiCG and QMR variants, and compare the parallel performance of these new s-step versions with previous algorithms.

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.

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

Science.gov (United States)

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.

Random quantum operations

International Nuclear Information System (INIS)

Bruzda, Wojciech; Cappellini, Valerio; Sommers, Hans-Juergen; Zyczkowski, Karol

2009-01-01

We define a natural ensemble of trace preserving, completely positive quantum maps and present algorithms to generate them at random. Spectral properties of the superoperator Φ associated with a given quantum map are investigated and a quantum analogue of the Frobenius-Perron theorem is proved. We derive a general formula for the density of eigenvalues of Φ and show the connection with the Ginibre ensemble of real non-symmetric random matrices. Numerical investigations of the spectral gap imply that a generic state of the system iterated several times by a fixed generic map converges exponentially to an invariant state

On the solution of the differential equation occurring in the problem of heat convection in laminar flow through a tube with slip—flow

Directory of Open Access Journals (Sweden)

Xanming Wang

1996-01-01

Full Text Available A technique is developed for evaluation of eigenvalues in solution of the differential equation d2y/dr2+(1/rdy/dr+λ2(β−r2y=0 which occurs in the problem of heat convection in laminar flow through a circular tube with silp-flow (β>1. A series solution requires the expansions of coeffecients involving extremely large numbers. No work has been reported in the case of β>1, because of its computational complexity in the evaluation of the eigenvalues. In this paper, a matrix was constructed and a computational algorithm was obtained to calculate the first four eigenvalues. Also, an asymptotic formula was developed to generate the full spectrum of eigenvalues. The computational results for various values of β were obtained.

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

Science.gov (United States)

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

METHOD OF COMPENSATING LOADS FOR SHALLOW SHELLS. VIBRATION AND STABILITY PROBLEMS

OpenAIRE

Tran Duc Chinh

2015-01-01

Based on the integral representation of the displacements functions through Green's functions, the author proposed a method to solve the system of differential equations of the given problem. The equations were solved approximately by reducing to algebraic equations by finite difference techniques in Samarsky scheme. Some examples are given for calculation of eigenvalues of shallow shell vibration problem, which are compared with results received by Onyashvili using Galerkin method.

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)

Representations of the exceptional and other Lie algebras with integral eigenvalues of the Casimir operator

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

An efficient method for solving fractional Sturm-Liouville problems

International Nuclear Information System (INIS)

Al-Mdallal, Qasem M.

2009-01-01

The numerical approximation of the eigenvalues and the eigenfunctions of the fractional Sturm-Liouville problems, in which the second order derivative is replaced by a fractional derivative, is considered. The present results can be implemented on the numerical solution of the fractional diffusion-wave equation. The results show the simplicity and efficiency of the numerical method.

An iterative method for the solution of nonlinear systems using the Faber polynomials for annular sectors

Energy Technology Data Exchange (ETDEWEB)

Myers, N.J. [Univ. of Durham (United Kingdom)

1994-12-31

The author gives a hybrid method for the iterative solution of linear systems of equations Ax = b, where the matrix (A) is nonsingular, sparse and nonsymmetric. As in a method developed by Starke and Varga the method begins with a number of steps of the Arnoldi method to produce some information on the location of the spectrum of A. This method then switches to an iterative method based on the Faber polynomials for an annular sector placed around these eigenvalue estimates. The Faber polynomials for an annular sector are used because, firstly an annular sector can easily be placed around any eigenvalue estimates bounded away from zero, and secondly the Faber polynomials are known analytically for an annular sector. Finally the author gives three numerical examples, two of which allow comparison with Starke and Varga`s results. The third is an example of a matrix for which many iterative methods would fall, but this method converges.

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

The spectral problem of global microinstabilities in tokamak-like plasmas using a gyrokinetic model

International Nuclear Information System (INIS)

Brunner, S.; Vaclavik, J.; Fivaz, M.; Appert, K.

1996-01-01

Tokamak-like plasmas are modeled by a periodic cylindrical system with magnetic shear and realistic density and temperature profiles. Linear electrostatic microinstabilities in such plasmas are studied by solving the eigenvalue problem starting from gyrokinetic theory. The actual eigenvalue equation is then of integral type. With this approach, finite Larmor radius (FLR) effects to all orders are taken into account. FLR effects provide for the only radial coupling in a cylinder and to lowest order correspond to polarization drift. This effectively one-dimensional problem helped us to gain useful knowledge for solving gyrokinetic equations in a curved system. When searching for the eigenfrequencies of the global modes, two different methods have been tested and compared. Either the true eigenvalue problem is solved by finding the zeros of the characteristic equation, or one considers a system driven by an antenna and looks for resonances in the power response of the plasma. In addition, mode structures were computed as well in direct as in Fourier space. The advantages and disadvantages of these various approaches are discussed. Ion temperature gradient (ITG) instabilities are studied over a wide range of parameters and for wavelengths perpendicular to the magnetic field down to the scale of ion Larmor radii. Flute instabilities driven by magnetic curvature drifts are also considered. Some of these results are compared with a time evolution PIC code. Such comparisons are valuable as the convergence of PIC results is often questioned. Work considering true toroidal geometry is in progress

An inverse Sturm–Liouville problem with a fractional derivative

KAUST Repository

Jin, Bangti

2012-05-01

In this paper, we numerically investigate an inverse problem of recovering the potential term in a fractional Sturm-Liouville problem from one spectrum. The qualitative behaviors of the eigenvalues and eigenfunctions are discussed, and numerical reconstructions of the potential with a Newton method from finite spectral data are presented. Surprisingly, it allows very satisfactory reconstructions for both smooth and discontinuous potentials, provided that the order . α∈. (1,. 2) of fractional derivative is sufficiently away from 2. © 2012 Elsevier Inc.

First step of the project for implementation of two non-symmetric cooling loops modeled by the ALMOD3 code

International Nuclear Information System (INIS)

Dominguez, L.; Camargo, C.T.M.

1984-09-01

The first step of the project for implementation of two non-symmetric cooling loops modeled by the ALMOD3 computer code is presented. This step consists of the introduction of a simplified model for simulating the steam generator. This model is the GEVAP computer code, integrant part of LOOP code, which simulates the primary coolant circuit of PWR nuclear power plants during transients. The ALMOD3 computer code has a model for the steam generator, called UTSG, which is very detailed. This model has spatial dependence, correlations for 2-phase flow, distinguished correlations for different heat transfer process. The GEVAP model has thermal equilibrium between phases (gaseous and liquid homogeneous mixture), no spatial dependence and uses only one generalized correlation to treat several heat transfer processes. (Author) [pt

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)

NUMERICAL SOLUTION OF SINGULAR INVERSE NODAL PROBLEM BY USING CHEBYSHEV POLYNOMIALS

OpenAIRE

NEAMATY, ABDOLALI; YILMAZ, EMRAH; AKBARPOOR, SHAHRBANOO; DABBAGHIAN, ABDOLHADI

2017-01-01

In this study, we consider Sturm-Liouville problem in two cases: the first case having no singularity and the second case having a singularity at zero. Then, we calculate the eigenvalues and the nodal points and present the uniqueness theorem for the solution of the inverse problem by using a dense subset of the nodal points in two given cases. Also, we use Chebyshev polynomials of the first kind for calculating the approximate solution of the inverse nodal problem in these cases. Finally, we...

METHOD OF COMPENSATING LOADS FOR SHALLOW SHELLS. VIBRATION AND STABILITY PROBLEMS

Directory of Open Access Journals (Sweden)

Tran Duc Chinh

2015-12-01

Full Text Available Based on the integral representation of the displacements functions through Green's functions, the author proposed a method to solve the system of differential equations of the given problem. The equations were solved approximately by reducing to algebraic equations by finite difference techniques in Samarsky scheme. Some examples are given for calculation of eigenvalues of shallow shell vibration problem, which are compared with results received by Onyashvili using Galerkin method.

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

Science.gov (United States)

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.

Uniqueness Theorem for the Inverse Aftereffect Problem and Representation the Nodal Points Form

OpenAIRE

A. Neamaty; Sh. Akbarpoor; A. Dabbaghian

2015-01-01

In this paper, we consider a boundary value problem with aftereffect on a finite interval. Then, the asymptotic behavior of the solutions, eigenvalues, the nodal points and the associated nodal length are studied. We also calculate the numerical values of the nodal points and the nodal length. Finally, we prove the uniqueness theorem for the inverse aftereffect problem by applying any dense subset of the nodal points.

Separable expansion for realistic multichannel scattering problems

International Nuclear Information System (INIS)

Canton, L.; Cattapan, G.; Pisent, G.

1987-01-01

A new approach to the multichannel scattering problem with realistic local or nonlocal interactions is developed. By employing the negative-energy solutions of uncoupled Sturmian eigenvalue problems referring to simple auxiliary potentials, the coupling interactions appearing to the original multichannel problem are approximated by finite-rank potentials. By resorting to integral-equation tecniques the coupled-channel equations are then reduced to linear algebraic equations which can be straightforwardly solved. Compact algebraic expressions for the relevant scattering matrix elements are thus obtained. The convergence of the method is tasted in the single-channel case with realistic optical potentials. Excellent agreement is obtained with a few terms in the separable expansion for both real and absorptive interactions

Dependence of the fundamental time eigenvalue of linear transport operator on the system size and other parameters - An application of the Perron-Frobenius theorem

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

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

Vragov’s boundary value problem for an implicit equation of mixed type

Science.gov (United States)

Egorov, I. E.

2017-10-01

We study a Vragov boundary value problem for a third-order implicit equation of mixed type with an arbitrary manifold of type switch. These Sobolev-type equations arise in many important applied problems. Given certain constraints on the coefficients and the right-hand side of the equation, we demonstrate, using nonstationary Galerkin method and regularization method, the unique regular solvability of the boundary value problem. We also obtain an error estimate for approximate solutions of the boundary value problem in terms of the regularization parameter and the eigenvalues of the Dirichlet spectral problem for the Laplace operator.

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Science.gov (United States)

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.

Absolute Monotonicity of Functions Related To Estimates of First Eigenvalue of Laplace Operator on Riemannian Manifolds

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.

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

Science.gov (United States)

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

Activation and thermodynamic parameter study of the heteronuclear C=O···H-N hydrogen bonding of diphenylurethane isomeric structures by FT-IR spectroscopy using the regularized inversion of an eigenvalue problem.

Science.gov (United States)

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.

Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold.

Science.gov (United States)

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.

Uniqueness Theorem for the Inverse Aftereffect Problem and Representation the Nodal Points Form

Directory of Open Access Journals (Sweden)

A. Neamaty

2015-03-01

Full Text Available In this paper, we consider a boundary value problem with aftereffect on a finite interval. Then, the asymptotic behavior of the solutions, eigenvalues, the nodal points and the associated nodal length are studied. We also calculate the numerical values of the nodal points and the nodal length. Finally, we prove the uniqueness theorem for the inverse aftereffect problem by applying any dense subset of the nodal points.

An Inverse Eigenvalue Problem for a Vibrating String with Two Dirichlet Spectra

KAUST Repository

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.

Comment on 'analytic solution of the relativistic Coulomb problem for a spinless Salpeter equation'

International Nuclear Information System (INIS)

Lucha, W.; Schoeberl, F.F.

1994-01-01

We demonstrate that the analytic solution for the set of energy eigenvalues of the semi-relativistic Coulomb problem reported by B. and L. Durand is in clear conflict with an upper bound on the ground-state energy level derived by some straightforward variational procedure. (authors)

The finite element solution of two-dimensional transverse magnetic scattering problems on the connection machine

International Nuclear Information System (INIS)

Hutchinson, S.; Costillo, S.; Dalton, K.; Hensel, E.

1990-01-01

A study is conducted of the finite element solution of the partial differential equations governing two-dimensional electromagnetic field scattering problems on a SIMD computer. A nodal assembly technique is introduced which maps a single node to a single processor. The physical domain is first discretized in parallel to yield the node locations of an O-grid mesh. Next, the system of equations is assembled and then solved in parallel using a conjugate gradient algorithm for complex-valued, non-symmetric, non-positive definite systems. Using this technique and Thinking Machines Corporation's Connection Machine-2 (CM-2), problems with more than 250k nodes are solved. Results of electromagnetic scattering, governed by the 2-d scalar Hemoholtz wave equations are presented in this paper. Solutions are demonstrated for a wide range of objects. A summary of performance data is given for the set of test problems

Functional form for the leading correction to the distribution of the largest eigenvalue in the GUE and LUE

Science.gov (United States)

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.

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