Fourier convergence analysis applied to neutron diffusion Eigenvalue problem
International Nuclear Information System (INIS)
Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook
2004-01-01
Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Though the methods can be applied to Eigenvalue problems too, all the Fourier convergence analyses have been performed only for fixed source problems and a Fourier convergence analysis for Eigenvalue problem has never been reported. Lee et al proposed new 2-D/1-D coupling methods and they showed that the new ones are unconditionally stable while one of the two existing ones is unstable at a small mesh size and that the new ones are better than the existing ones in terms of the convergence rate. In this paper the convergence of method A in reference 4 for the diffusion Eigenvalue problem was analyzed by the Fourier analysis. The Fourier convergence analysis presented in this paper is the first one applied to a neutronics eigenvalue problem to the best of our knowledge
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)
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.
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.
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
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
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)
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
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.)
Sturm--Liouville eigenvalue problem
International Nuclear Information System (INIS)
Bailey, P.B.
1977-01-01
The viewpoint is taken that Sturn--Liouville problem is specified and the problem of computing one or more of the eigenvalues and possibly the corresponding eigenfunctions is presented for solution. The procedure follows the construction of a computer code, although such a code is not constructed, intended to solve Sturn--Liouville eigenvalue problems whether singular or nonsingular
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)
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
Spectral nodal method for one-speed X,Y-geometry Eigenvalue diffusion problems
International Nuclear Information System (INIS)
Dominguez, Dany S.; Lorenzo, Daniel M.; Hernandez, Carlos G.; Barros, Ricardo C.; Silva, Fernando C. da
2001-01-01
Presented here is a new numerical nodal method for steady-state multidimensional neutron diffusion equation in rectangular geometry. Our method is based on a spectral analysis of the transverse-integrated nodal diffusion equations. These equations are obtained by integrating the diffusion equation in X and Y directions, and then considering flat approximations for the transverse leakage terms. These flat approximations are the only approximations that we consider in this method; as a result the numerical solutions are completely free from truncation errors in slab geometry. We show numerical results to illustrate the method's accuracy for coarse mesh calculations in a heterogeneous medium. (author)
Highly indefinite multigrid for eigenvalue problems
Energy Technology Data Exchange (ETDEWEB)
Borges, L.; Oliveira, S.
1996-12-31
Eigenvalue problems are extremely important in understanding dynamic processes such as vibrations and control systems. Large scale eigenvalue problems can be very difficult to solve, especially if a large number of eigenvalues and the corresponding eigenvectors need to be computed. For solving this problem a multigrid preconditioned algorithm is presented in {open_quotes}The Davidson Algorithm, preconditioning and misconvergence{close_quotes}. Another approach for solving eigenvalue problems is by developing efficient solutions for highly indefinite problems. In this paper we concentrate on the use of new highly indefinite multigrid algorithms for the eigenvalue problem.
International Nuclear Information System (INIS)
Chang, Jonghwa
2014-01-01
Today, we can use a computer cluster consist of a few hundreds CPUs with reasonable budget. Such computer system enables us to do detailed modeling of reactor core. The detailed modeling will improve the safety and the economics of a nuclear reactor by eliminating un-necessary conservatism or missing consideration. To take advantage of such a cluster computer, efficient parallel algorithms must be developed. Mechanical structure analysis community has studied the domain decomposition method to solve the stress-strain equation using the finite element methods. One of the most successful domain decomposition method in terms of robustness is FETI-DP. We have modified the original FETI-DP to solve the eigenvalue problem for the multi-group diffusion problem in previous study. In this study, we report the result of recent modification to handle the three-dimensional subdomain partitioning, and the sub-domain multi-group problem. Modified FETI-DP algorithm has been successfully applied for the eigenvalue problem of multi-group neutron diffusion equation. The overall CPU time is decreasing as number of sub-domains (partitions) is increasing. However, there may be a limit in decrement due to increment of the number of primal points will increase the CPU time spent by the solution of the global equation. Even distribution of computational load (criterion a) is important to achieve fast computation. The subdomain partition can be effectively performed using suitable graph theory partition package such as MeTIS
Energy Technology Data Exchange (ETDEWEB)
Chang, Jonghwa [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2014-10-15
Today, we can use a computer cluster consist of a few hundreds CPUs with reasonable budget. Such computer system enables us to do detailed modeling of reactor core. The detailed modeling will improve the safety and the economics of a nuclear reactor by eliminating un-necessary conservatism or missing consideration. To take advantage of such a cluster computer, efficient parallel algorithms must be developed. Mechanical structure analysis community has studied the domain decomposition method to solve the stress-strain equation using the finite element methods. One of the most successful domain decomposition method in terms of robustness is FETI-DP. We have modified the original FETI-DP to solve the eigenvalue problem for the multi-group diffusion problem in previous study. In this study, we report the result of recent modification to handle the three-dimensional subdomain partitioning, and the sub-domain multi-group problem. Modified FETI-DP algorithm has been successfully applied for the eigenvalue problem of multi-group neutron diffusion equation. The overall CPU time is decreasing as number of sub-domains (partitions) is increasing. However, there may be a limit in decrement due to increment of the number of primal points will increase the CPU time spent by the solution of the global equation. Even distribution of computational load (criterion a) is important to achieve fast computation. The subdomain partition can be effectively performed using suitable graph theory partition package such as MeTIS.
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
Research” and the use of copyright material. Approved by Major Professor(s): Approved by: Head of the Departmental Graduate Program Date Alicia Marie... matrix . . . . . . . . . . . . . . . . . 106 8.15 Sparsity patterns for the Nastran benchmark of order 1.5 million . . . . 108 8.16 Sparsity patterns...magnitude eigenvalues of a given matrix pencil (A,B) along with their associated eigenvectors. Computing the smallest eigenvalues is more difficult
Covariance expressions for eigenvalue and eigenvector problems
Liounis, Andrew J.
There are a number of important scientific and engineering problems whose solutions take the form of an eigenvalue--eigenvector problem. Some notable examples include solutions to linear systems of ordinary differential equations, controllability of linear systems, finite element analysis, chemical kinetics, fitting ellipses to noisy data, and optimal estimation of attitude from unit vectors. In many of these problems, having knowledge of the eigenvalue and eigenvector Jacobians is either necessary or is nearly as important as having the solution itself. For instance, Jacobians are necessary to find the uncertainty in a computed eigenvalue or eigenvector estimate. This uncertainty, which is usually represented as a covariance matrix, has been well studied for problems similar to the eigenvalue and eigenvector problem, such as singular value decomposition. There has been substantially less research on the covariance of an optimal estimate originating from an eigenvalue-eigenvector problem. In this thesis we develop two general expressions for the Jacobians of eigenvalues and eigenvectors with respect to the elements of their parent matrix. The expressions developed make use of only the parent matrix and the eigenvalue and eigenvector pair under consideration. In addition, they are applicable to any general matrix (including complex valued matrices, eigenvalues, and eigenvectors) as long as the eigenvalues are simple. Alongside this, we develop expressions that determine the uncertainty in a vector estimate obtained from an eigenvalue-eigenvector problem given the uncertainty of the terms of the matrix. The Jacobian expressions developed are numerically validated with forward finite, differencing and the covariance expressions are validated using Monte Carlo analysis. Finally, the results from this work are used to determine covariance expressions for a variety of estimation problem examples and are also applied to the design of a dynamical system.
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
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
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.
Modern algorithms for large sparse eigenvalue problems
International Nuclear Information System (INIS)
Meyer, A.
1987-01-01
The volume is written for mathematicians interested in (numerical) linear algebra and in the solution of large sparse eigenvalue problems, as well as for specialists in engineering, who use the considered algorithms in the investigation of eigenoscillations of structures, in reactor physics, etc. Some variants of the algorithms based on the idea of a gradient-type direction of movement are presented and their convergence properties are discussed. From this, a general strategy for the direct use of preconditionings for the eigenvalue problem is derived. In this new approach the necessity of the solution of large linear systems is entirely avoided. Hence, these methods represent a new alternative to some other modern eigenvalue algorithms, as they show a slightly slower convergence on the one hand but essentially lower numerical and data processing problems on the other hand. A brief description and comparison of some well-known methods (i.e. simultaneous iteration, Lanczos algorithm) completes this volume. (author)
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.
The eigenvalue problem in phase space.
Cohen, Leon
2018-06-30
We formulate the standard quantum mechanical eigenvalue problem in quantum phase space. The equation obtained involves the c-function that corresponds to the quantum operator. We use the Wigner distribution for the phase space function. We argue that the phase space eigenvalue equation obtained has, in addition to the proper solutions, improper solutions. That is, solutions for which no wave function exists which could generate the distribution. We discuss the conditions for ascertaining whether a position momentum function is a proper phase space distribution. We call these conditions psi-representability conditions, and show that if these conditions are imposed, one extracts the correct phase space eigenfunctions. We also derive the phase space eigenvalue equation for arbitrary phase space distributions functions. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.
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
Frequency response as a surrogate eigenvalue problem in topology optimization
DEFF Research Database (Denmark)
Andreassen, Erik; Ferrari, Federico; Sigmund, Ole
2018-01-01
This article discusses the use of frequency response surrogates for eigenvalue optimization problems in topology optimization that may be used to avoid solving the eigenvalue problem. The motivation is to avoid complications that arise from multiple eigenvalues and the computational complexity as...
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 a quadratic inverse eigenvalue problem
International Nuclear Information System (INIS)
Cai, Yunfeng; Xu, Shufang
2009-01-01
This paper concerns the quadratic inverse eigenvalue problem (QIEP) of constructing real symmetric matrices M, C and K of size n × n, with M nonsingular, so that the quadratic matrix polynomial Q(λ) ≡ λ 2 M + λC + K has a completely prescribed set of eigenvalues and eigenvectors. It is shown via construction that the QIEP has a solution if and only if r 0, where r and δ are computable from the prescribed spectral data. A necessary and sufficient condition for the existence of a solution to the QIEP with M being positive definite is also established in a constructive way. Furthermore, two algorithms are developed: one is to solve the QIEP; another is to find a particular solution to the QIEP with the leading coefficient matrix being positive definite, which also provides us an approach to a simultaneous reduction of real symmetric matrix triple (M, C, K) by real congruence. Numerical results show that the two algorithms are feasible and numerically reliable
MAIA, Eigenvalues for MHD Equation of Tokamak Plasma Stability Problems
International Nuclear Information System (INIS)
Tanaka, Y.; Azumi, M.; Kurita, G.; Tsunematsu, T.; Takeda, T.
1986-01-01
1 - Description of program or function: This program solves an eigenvalue problem zBx=Ax where A and B are real block tri-diagonal matrices. This eigenvalue problem is derived from a reduced set of linear resistive MHD equations which is often employed to study tokamak plasma stability problem. 2 - Method of solution: Both the determinant and inverse iteration methods are employed. 3 - Restrictions on the complexity of the problem: The eigenvalue z must be real
Application of collocation meshless method to eigenvalue problem
International Nuclear Information System (INIS)
Saitoh, Ayumu; Matsui, Nobuyuki; Itoh, Taku; Kamitani, Atsushi; Nakamura, Hiroaki
2012-01-01
The numerical method for solving the nonlinear eigenvalue problem has been developed by using the collocation Element-Free Galerkin Method (EFGM) and its performance has been numerically investigated. The results of computations show that the approximate solution of the nonlinear eigenvalue problem can be obtained stably by using the developed method. Therefore, it can be concluded that the developed method is useful for solving the nonlinear eigenvalue problem. (author)
Efficient solutions to the NDA-NCA low-order eigenvalue problem
International Nuclear Information System (INIS)
Willert, J. A.; Kelley, C. T.
2013-01-01
Recent algorithmic advances combine moment-based acceleration and Jacobian-Free Newton-Krylov (JFNK) methods to accelerate the computation of the dominant eigenvalue in a k-eigenvalue calculation. In particular, NDA-NCA [1], builds a sequence of low-order (LO) diffusion-based eigenvalue problems in which the solution converges to the true eigenvalue solution. Within NDA-NCA, the solution to the LO k-eigenvalue problem is computed by solving a system of nonlinear equation using some variant of Newton's method. We show that we can speed up the solution to the LO problem dramatically by abandoning the JFNK method and exploiting the structure of the Jacobian matrix. (authors)
Wu, Sheng-Jhih; Chu, Moody T.
2017-08-01
An inverse eigenvalue problem usually entails two constraints, one conditioned upon the spectrum and the other on the structure. This paper investigates the problem where triple constraints of eigenvalues, singular values, and diagonal entries are imposed simultaneously. An approach combining an eclectic mix of skills from differential geometry, optimization theory, and analytic gradient flow is employed to prove the solvability of such a problem. The result generalizes the classical Mirsky, Sing-Thompson, and Weyl-Horn theorems concerning the respective majorization relationships between any two of the arrays of main diagonal entries, eigenvalues, and singular values. The existence theory fills a gap in the classical matrix theory. The problem might find applications in wireless communication and quantum information science. The technique employed can be implemented as a first-step numerical method for constructing the matrix. With slight modification, the approach might be used to explore similar types of inverse problems where the prescribed entries are at general locations.
International Nuclear Information System (INIS)
Wu, Sheng-Jhih; Chu, Moody T
2017-01-01
An inverse eigenvalue problem usually entails two constraints, one conditioned upon the spectrum and the other on the structure. This paper investigates the problem where triple constraints of eigenvalues, singular values, and diagonal entries are imposed simultaneously. An approach combining an eclectic mix of skills from differential geometry, optimization theory, and analytic gradient flow is employed to prove the solvability of such a problem. The result generalizes the classical Mirsky, Sing–Thompson, and Weyl-Horn theorems concerning the respective majorization relationships between any two of the arrays of main diagonal entries, eigenvalues, and singular values. The existence theory fills a gap in the classical matrix theory. The problem might find applications in wireless communication and quantum information science. The technique employed can be implemented as a first-step numerical method for constructing the matrix. With slight modification, the approach might be used to explore similar types of inverse problems where the prescribed entries are at general locations. (paper)
Estimates for lower order eigenvalues of a clamped plate problem
Cheng, Qing-Ming; Huang, Guangyue; Wei, Guoxin
2009-01-01
For a bounded domain $\\Omega$ in a complete Riemannian manifold $M^n$, we study estimates for lower order eigenvalues of a clamped plate problem. We obtain universal inequalities for lower order eigenvalues. We would like to remark that our results are sharp.
Jacobi-Davidson methods for generalized MHD-eigenvalue problems
J.G.L. Booten; D.R. Fokkema; G.L.G. Sleijpen; H.A. van der Vorst (Henk)
1995-01-01
textabstractA Jacobi-Davidson algorithm for computing selected eigenvalues and associated eigenvectors of the generalized eigenvalue problem $Ax = lambda Bx$ is presented. In this paper the emphasis is put on the case where one of the matrices, say the B-matrix, is Hermitian positive definite. The
A 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
Solving complex band structure problems with the FEAST eigenvalue algorithm
Laux, S. E.
2012-08-01
With straightforward extension, the FEAST eigenvalue algorithm [Polizzi, Phys. Rev. B 79, 115112 (2009)] is capable of solving the generalized eigenvalue problems representing traveling-wave problems—as exemplified by the complex band-structure problem—even though the matrices involved are complex, non-Hermitian, and singular, and hence outside the originally stated range of applicability of the algorithm. The obtained eigenvalues/eigenvectors, however, contain spurious solutions which must be detected and removed. The efficiency and parallel structure of the original algorithm are unaltered. The complex band structures of Si layers of varying thicknesses and InAs nanowires of varying radii are computed as test problems.
Inequalities among eigenvalues of Sturm–Liouville problems
Directory of Open Access Journals (Sweden)
Kong Q
1999-01-01
Full Text Available There are well-known inequalities among the eigenvalues of Sturm–Liouville problems with periodic, semi-periodic, Dirichlet and Neumann boundary conditions. In this paper, for an arbitrary coupled self-adjoint boundary condition, we identify two separated boundary conditions corresponding to the Dirichlet and Neumann conditions in the classical case, and establish analogous inequalities. It is also well-known that the lowest periodic eigenvalue is simple; here we prove a similar result for the general case. Moreover, we show that the algebraic and geometric multiplicities of the eigenvalues of self-adjoint regular Sturm–Liouville problems with coupled boundary conditions are the same. An important step in our approach is to obtain a representation of the fundamental solutions for sufficiently negative values of the spectral parameter. Our approach yields the existence and boundedness from below of the eigenvalues of arbitrary self-adjoint regular Sturm–Liouville problems without using operator theory.
Energy Technology Data Exchange (ETDEWEB)
Ceolin, Celina; Schramm, Marcelo; Bodmann, Bardo Ernst Josef; Vilhena, Marco Tullio Mena Barreto de [Universidade Federal do Rio Grande do Sul, Porto Alegre (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica; Bogado Leite, Sergio de Queiroz [Comissao Nacional de Energia Nuclear, Rio de Janeiro (Brazil)
2014-11-15
In this work the authors solved the steady state neutron diffusion equation for a multi-layer slab assuming the multi-group energy model. The method to solve the equation system is based on an expansion in Taylor Series resulting in an analytical expression. The results obtained can be used as initial condition for neutron space kinetics problems. The neutron scalar flux was expanded in a power series, and the coefficients were found by using the ordinary differential equation and the boundary and interface conditions. The effective multiplication factor k was evaluated using the power method. We divided the domain into several slabs to guarantee the convergence with a low truncation order. We present the formalism together with some numerical simulations.
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)
The nonconforming virtual element method for eigenvalue problems
Energy Technology Data Exchange (ETDEWEB)
Gardini, Francesca [Univ. of Pavia (Italy). Dept. of Mathematics; Manzini, Gianmarco [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Vacca, Giuseppe [Univ. of Milano-Bicocca, Milan (Italy). Dept. of Mathematics and Applications
2018-02-05
We analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allow to treat in the same formulation the two- and three-dimensional case.We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the L^{2}-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problems. The proposed schemes provide a correct approximation of the spectrum and we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.
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.
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
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 ...
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)
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)
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
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.
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)
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.
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)
Eigenvalue solutions in finite element thermal transient problems
International Nuclear Information System (INIS)
Stoker, J.R.
1975-01-01
The eigenvalue economiser concept can be useful in solving large finite element transient heat flow problems in which the boundary heat transfer coefficients are constant. The usual economiser theory is equivalent to applying a unit thermal 'force' to each of a small sub-set of nodes on the finite element mesh, and then calculating sets of resulting steady state temperatures. Subsequently it is assumed that the required transient temperature distributions can be approximated by a linear combination of this comparatively small set of master temperatures. The accuracy of a reduced eigenvalue calculation depends upon a good choice of master nodes, which presupposes at least a little knowledge about what sort of shape is expected in the unknown temperature distributions. There are some instances, however, where a reasonably good idea exists of the required shapes, permitting a modification to the economiser process which leads to greater economy in the number of master temperatures. The suggested new approach is to use manually prescribed temperature distributions as the master distributions, rather than using temperatures resulting from unit thermal forces. Thus, with a little pre-knowledge one may write down a set of master distributions which, as a linear combination, can represent the required solution over the range of interest to a reasonable engineering accuracy, and using the minimum number of variables. The proposed modified eigenvalue economiser technique then uses the master distributions in an automatic way to arrive at the required solution. The technique is illustrated by some simple finite element examples
New exact approaches to the nuclear eigenvalue problem
International Nuclear Information System (INIS)
Andreozzi, F.; Lo Iudice, N.; Porrino, A.; Knapp, F.; Kvasil, J.
2005-01-01
In a recent past some of us have developed a new algorithm for diagonalizing the shell model Hamiltonian which consists of an iterative sequence of diagonalization of sub-matrices of small dimensions. The method, apart from being easy to implement, is robust, yielding always stable numerical solutions, and free of ghost eigenvalues. Subsequently, we have endowed the algorithm with an importance sampling, which leads to a drastic truncation of the shell model space, while keeping the accuracy of the solutions under control. Applications to typical nuclei show that the sampling yields also an extrapolation law to the exact eigenvalues. Complementary to the shell model algorithm is a method we are developing for studying collective and non collective excitations. To this purpose we solve the nuclear eigenvalue problem in a space which is the direct sum of Tamm-Dancoff n-phonon subspaces (n=0,1, ...N). The multiphonon basis is constructed by an iterative equation of motion method, which generates an over complete set of n-phonon states from the (n-1)-phonon basis. The redundancy is removed completely and exactly by a method based on the Choleski decomposition. The full Hamiltonian matrix comes out to have a simple structure and, therefore, can be drastically truncated before diagonalization by the mentioned importance sampling method. The phonon composition of the basis states allows removing naturally and maximally the spurious admixtures induced by the centre of mass motion. An application of the method to 16 O will be given for illustrative purposes. (authors)
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.
Nonlinear Eigenvalue Problems in Elliptic Variational Inequalities: a local study
International Nuclear Information System (INIS)
Conrad, F.; Brauner, C.; Issard-Roch, F.; Nicolaenko, B.
1985-01-01
The authors consider a class of Nonlinear Eigenvalue Problems (N.L.E.P.) associated with Elliptic Variational Inequalities (E.V.I.). First the authors introduce the main tools for a local study of branches of solutions; the authors extend the linearization process required in the case of equations. Next the authors prove the existence of arcs of solutions close to regular vs singular points, and determine their local behavior up to the first order. Finally, the authors discuss the connection between their regularity condition and some stability concept. 37 references, 6 figures
A parallel algorithm for the non-symmetric eigenvalue problem
International Nuclear Information System (INIS)
Sidani, M.M.
1991-01-01
An algorithm is presented for the solution of the non-symmetric eigenvalue problem. The algorithm is based on a divide-and-conquer procedure that provides initial approximations to the eigenpairs, which are then refined using Newton iterations. Since the smaller subproblems can be solved independently, and since Newton iterations with different initial guesses can be started simultaneously, the algorithm - unlike the standard QR method - is ideal for parallel computers. The author also reports on his investigation of deflation methods designed to obtain further eigenpairs if needed. Numerical results from implementations on a host of parallel machines (distributed and shared-memory) are presented
Eigenvalue problems for degenerate nonlinear elliptic equations in anisotropic media
Directory of Open Access Journals (Sweden)
Vicenţiu RăDulescu
2005-06-01
Full Text Available We study nonlinear eigenvalue problems of the type Ã¢ÂˆÂ’div(a(xÃ¢ÂˆÂ‡u=g(ÃŽÂ»,x,u in Ã¢Â„ÂN, where a(x is a degenerate nonnegative weight. We establish the existence of solutions and we obtain information on qualitative properties as multiplicity and location of solutions. Our approach is based on the critical point theory in Sobolev weighted spaces combined with a Caffarelli-Kohn-Nirenberg-type inequality. A specific minimax method is developed without making use of Palais-Smale condition.
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
Directory of Open Access Journals (Sweden)
Fatemeh Mohammad
2014-05-01
Full Text Available In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem $Ax = \\lambda Bx$[Q.~Ye and P.~Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011 1697-1715]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
Dynamic Eigenvalue Problem of Concrete Slab Road Surface
Pawlak, Urszula; Szczecina, Michał
2017-10-01
The paper presents an analysis of the dynamic eigenvalue problem of concrete slab road surface. A sample concrete slab was modelled using Autodesk Robot Structural Analysis software and calculated with Finite Element Method. The slab was set on a one-parameter elastic subsoil, for which the modulus of elasticity was separately calculated. The eigen frequencies and eigenvectors (as maximal vertical nodal displacements) were presented. On the basis of the results of calculations, some basic recommendations for designers of concrete road surfaces were offered.
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)
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)
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)
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.
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.
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.
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
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.))
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.
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.
On a Non-Symmetric Eigenvalue Problem Governing Interior Structural–Acoustic Vibrations
Directory of Open Access Journals (Sweden)
Heinrich Voss
2016-06-01
Full Text Available Small amplitude vibrations of a structure completely filled with a fluid are considered. Describing the structure by displacements and the fluid by its pressure field, the free vibrations are governed by a non-self-adjoint eigenvalue problem. This survey reports on a framework for taking advantage of the structure of the non-symmetric eigenvalue problem allowing for a variational characterization of its eigenvalues. Structure-preserving iterative projection methods of the the Arnoldi and of the Jacobi–Davidson type and an automated multi-level sub-structuring method are reviewed. The reliability and efficiency of the methods are demonstrated by a numerical example.
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)
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.
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.
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.
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.
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.)
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.
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.
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.
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)
Diffusion with Varying Drag; the Runaway Problem.
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
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...
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.
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
Schwartz, L M; Bergman, D J; Dunn, K J; Mitra, P P
1996-01-01
Random walk computer simulations are an important tool in understanding magnetic resonance measurements in porous media. In this paper we focus on the description of pulsed field gradient spin echo (PGSE) experiments that measure the probability, P(R,t), that a diffusing water molecule will travel a distance R in a time t. Because PGSE simulations are often limited by statistical considerations, we will see that valuable insight can be gained by working with simple periodic geometries and comparing simulation data to the results of exact eigenvalue expansions. In this connection, our attention will be focused on (1) the wavevector, k, and time dependent magnetization, M(k, t); and (2) the normalized probability, Ps(delta R, t), that a diffusing particle will return to within delta R of the origin after time t.
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.
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.
Photonic Band Structure of Dispersive Metamaterials Formulated as a Hermitian Eigenvalue Problem
Raman, Aaswath; Fan, Shanhui
2010-01-01
We formulate the photonic band structure calculation of any lossless dispersive photonic crystal and optical metamaterial as a Hermitian eigenvalue problem. We further show that the eigenmodes of such lossless systems provide an orthonormal basis, which can be used to rigorously describe the behavior of lossy dispersive systems in general. © 2010 The American Physical Society.
Parallel algorithms for 2-D cylindrical transport equations of Eigenvalue problem
International Nuclear Information System (INIS)
Wei, J.; Yang, S.
2013-01-01
In this paper, aimed at the neutron transport equations of eigenvalue problem under 2-D cylindrical geometry on unstructured grid, the discrete scheme of Sn discrete ordinate and discontinuous finite is built, and the parallel computation for the scheme is realized on MPI systems. Numerical experiments indicate that the designed parallel algorithm can reach perfect speedup, it has good practicality and scalability. (authors)
Photonic Band Structure of Dispersive Metamaterials Formulated as a Hermitian Eigenvalue Problem
Raman, Aaswath
2010-02-26
We formulate the photonic band structure calculation of any lossless dispersive photonic crystal and optical metamaterial as a Hermitian eigenvalue problem. We further show that the eigenmodes of such lossless systems provide an orthonormal basis, which can be used to rigorously describe the behavior of lossy dispersive systems in general. © 2010 The American Physical Society.
Bonito, Andrea; Guermond, Jean-Luc
2011-01-01
We propose and analyze an approximation technique for the Maxwell eigenvalue problem using H1-conforming finite elements. The key idea consists of considering a mixed method controlling the divergence of the electric field in a fractional Sobolev space H-α with α ∈ (1/2, 1). The method is shown to be convergent and spectrally correct. © 2011 American Mathematical Society.
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
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} (|\
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.
Tensor eigenvalues and their applications
Qi, Liqun; Chen, Yannan
2018-01-01
This book offers an introduction to applications prompted by tensor analysis, especially by the spectral tensor theory developed in recent years. It covers applications of tensor eigenvalues in multilinear systems, exponential data fitting, tensor complementarity problems, and tensor eigenvalue complementarity problems. It also addresses higher-order diffusion tensor imaging, third-order symmetric and traceless tensors in liquid crystals, piezoelectric tensors, strong ellipticity for elasticity tensors, and higher-order tensors in quantum physics. This book is a valuable reference resource for researchers and graduate students who are interested in applications of tensor eigenvalues.
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.
A Projection free method for Generalized Eigenvalue Problem with a nonsmooth Regularizer.
Hwang, Seong Jae; Collins, Maxwell D; Ravi, Sathya N; Ithapu, Vamsi K; Adluru, Nagesh; Johnson, Sterling C; Singh, Vikas
2015-12-01
Eigenvalue problems are ubiquitous in computer vision, covering a very broad spectrum of applications ranging from estimation problems in multi-view geometry to image segmentation. Few other linear algebra problems have a more mature set of numerical routines available and many computer vision libraries leverage such tools extensively. However, the ability to call the underlying solver only as a "black box" can often become restrictive. Many 'human in the loop' settings in vision frequently exploit supervision from an expert, to the extent that the user can be considered a subroutine in the overall system. In other cases, there is additional domain knowledge, side or even partial information that one may want to incorporate within the formulation. In general, regularizing a (generalized) eigenvalue problem with such side information remains difficult. Motivated by these needs, this paper presents an optimization scheme to solve generalized eigenvalue problems (GEP) involving a (nonsmooth) regularizer. We start from an alternative formulation of GEP where the feasibility set of the model involves the Stiefel manifold. The core of this paper presents an end to end stochastic optimization scheme for the resultant problem. We show how this general algorithm enables improved statistical analysis of brain imaging data where the regularizer is derived from other 'views' of the disease pathology, involving clinical measurements and other image-derived representations.
Solving eigenvalue problems on curved surfaces using the Closest Point Method
Macdonald, Colin B.
2011-06-01
Eigenvalue problems are fundamental to mathematics and science. We present a simple algorithm for determining eigenvalues and eigenfunctions of the Laplace-Beltrami operator on rather general curved surfaces. Our algorithm, which is based on the Closest Point Method, relies on an embedding of the surface in a higher-dimensional space, where standard Cartesian finite difference and interpolation schemes can be easily applied. We show that there is a one-to-one correspondence between a problem defined in the embedding space and the original surface problem. For open surfaces, we present a simple way to impose Dirichlet and Neumann boundary conditions while maintaining second-order accuracy. Convergence studies and a series of examples demonstrate the effectiveness and generality of our approach. © 2011 Elsevier Inc.
Applications of elliptic operator theory to the isotropic interior transmission eigenvalue problem
Lakshtanov, E.; Vainberg, B.
2013-10-01
The paper concerns the isotropic interior transmission eigenvalue (ITE) problem. This problem is not elliptic, but we show that, using the Dirichlet-to-Neumann map, it can be reduced to an elliptic one. This leads to the discreteness of the spectrum as well as to certain results on a possible location of the transmission eigenvalues. If the index of refraction \\sqrt{n(x)} is real, then we obtain a result on the existence of infinitely many positive ITEs and the Weyl-type lower bound on its counting function. All the results are obtained under the assumption that n(x) - 1 does not vanish at the boundary of the obstacle or it vanishes identically, but its normal derivative does not vanish at the boundary. We consider the classical transmission problem as well as the case when the inhomogeneous medium contains an obstacle. Some results on the discreteness and localization of the spectrum are obtained for complex valued n(x).
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.
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
Eigenfunctions and Eigenvalues for a Scalar Riemann-Hilbert Problem Associated to Inverse Scattering
Pelinovsky, Dmitry E.; Sulem, Catherine
A complete set of eigenfunctions is introduced within the Riemann-Hilbert formalism for spectral problems associated to some solvable nonlinear evolution equations. In particular, we consider the time-independent and time-dependent Schrödinger problems which are related to the KdV and KPI equations possessing solitons and lumps, respectively. Non-standard scalar products, orthogonality and completeness relations are derived for these problems. The complete set of eigenfunctions is used for perturbation theory and bifurcation analysis of eigenvalues supported by the potentials under perturbations. We classify two different types of bifurcations of new eigenvalues and analyze their characteristic features. One type corresponds to thresholdless generation of solitons in the KdV equation, while the other predicts a threshold for generation of lumps in the KPI equation.
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
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
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.
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
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).
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.
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.)
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.
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
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)
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.
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.
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.
Metastability in reversible diffusion processes II. Precise asymptotics for small eigenvalues
Bovier, A; Klein, M
2002-01-01
We continue the analysis of the problem of metastability for reversible diffusion processes, initiated in \\cite{BEGK3}, with a precise analysis of the low-lying spectrum of the generator. Recall that we are considering processes with generators of the form $-\\e \\Delta +\
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.)
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.
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
International Nuclear Information System (INIS)
Hanna, S.R.
1976-01-01
It is hoped that urban diffusion models of air pollutants can eventually confidently be used to make major decisions, such as in planning the layout of a new industrial park, determining the effects of a new highway on air quality, or estimating the results of a new automobile emissions exhaust system. The urban diffusion model itself should be able to account for point, line, and area sources, and the local aerodynamic effects of street canyons and building wakes. Removal or transformations due to dry or wet deposition and chemical reactions are often important. It would be best if the model included meteorological parameters such as wind speed and temperature as dependent variables, since these parameters vary significantly when air passes from rural surfaces over urban surfaces
Bourne, D.P.; Elman, H.; Osborn, J.E.
2009-01-01
This paper is the second part of a two-part paper treating a non-self-adjoint quadratic eigenvalue problem for the linear stability of solutions to the Taylor-Couette problem for flow of a viscous liquid in a deformable cylinder, with the cylinder modelled as a membrane. The first part formulated
International Nuclear Information System (INIS)
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.
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)
International Nuclear Information System (INIS)
Barucq, Helene; Bekkey, Chokri; Djellouli, Rabia
2004-01-01
We present a general procedure based on the pseudo-differential calculus for deriving artificial boundary conditions for an eigenvalue problem that characterizes the propagation of guided modes in optical waveguides. This new approach allows the construction of local conditions that (a) are independent of the frequency regime, (b) preserve the sparsity pattern of the finite element discretization, and (c) are applicable to arbitrarily shaped convex artificial boundaries. The last feature has the potential for reducing the size of the computational domain. Numerical results are presented to highlight the potential of conditions of order 1/2 and 1, for improving significantly the computational efficiency of finite element methods for the solution of optical waveguide problems
Directory of Open Access Journals (Sweden)
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.
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 nonlinear eigenvalue problem for self-similar spherical force-free magnetic fields
Energy Technology Data Exchange (ETDEWEB)
Lerche, I. [Institut für Geowissenschaften, Naturwissenschaftliche Fakultät III, Martin-Luther Universität, D-06099 Halle (Germany); Low, B. C. [High Altitude Observatory, National Center for Atmospheric Research, Boulder, Colorado 80307 (United States)
2014-10-15
An axisymmetric force-free magnetic field B(r, θ) in spherical coordinates is defined by a function r sin θB{sub φ}=Q(A) relating its azimuthal component to its poloidal flux-function A. The power law r sin θB{sub φ}=aA|A|{sup 1/n}, n a positive constant, admits separable fields with A=(A{sub n}(θ))/(r{sup n}) , posing a nonlinear boundary-value problem for the constant parameter a as an eigenvalue and A{sub n}(θ) as its eigenfunction [B. C. Low and Y. Q Lou, Astrophys. J. 352, 343 (1990)]. A complete analysis is presented of the eigenvalue spectrum for a given n, providing a unified understanding of the eigenfunctions and the physical relationship between the field's degree of multi-polarity and rate of radial decay via the parameter n. These force-free fields, self-similar on spheres of constant r, have basic astrophysical applications. As explicit solutions they have, over the years, served as standard benchmarks for testing 3D numerical codes developed to compute general force-free fields in the solar corona. The study presented includes a set of illustrative multipolar field solutions to address the magnetohydrodynamics (MHD) issues underlying the observation that the solar corona has a statistical preference for negative and positive magnetic helicities in its northern and southern hemispheres, respectively; a hemispherical effect, unchanging as the Sun's global field reverses polarity in successive eleven-year cycles. Generalizing these force-free fields to the separable form B=(H(θ,φ))/(r{sup n+2}) promises field solutions of even richer topological varieties but allowing for φ-dependence greatly complicates the governing equations that have remained intractable. The axisymmetric results obtained are discussed in relation to this generalization and the Parker Magnetostatic Theorem. The axisymmetric solutions are mathematically related to a family of 3D time-dependent ideal MHD solutions for a polytropic fluid of index γ = 4
Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem
International Nuclear Information System (INIS)
Du, X.; Liu, T.; Ji, W.; Xu, X. G.; Brown, F. B.
2013-01-01
Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER GPU code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)
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
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)
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)
Emissivity of discretized diffusion problems
International Nuclear Information System (INIS)
Densmore, Jeffery D.; Davidson, Gregory; Carrington, David B.
2006-01-01
The numerical modeling of radiative transfer by the diffusion approximation can produce artificially damped radiation propagation if spatial cells are too optically thick. In this paper, we investigate this nonphysical behavior at external problem boundaries by examining the emissivity of the discretized diffusion approximation. We demonstrate that the standard cell-centered discretization produces an emissivity that is too low for optically thick cells, a situation that leads to the lack of radiation propagation. We then present a modified boundary condition that yields an accurate emissivity regardless of cell size. This modified boundary condition can be used with a deterministic calculation or as part of a hybrid transport-diffusion method for increasing the efficiency of Monte Carlo simulations. We also discuss the range of applicability, as a function of cell size and material properties, when this modified boundary condition is employed in a hybrid technique. With a set of numerical calculations, we demonstrate the accuracy and usefulness of this modified boundary condition
International Nuclear Information System (INIS)
Abreu, M.P. de
1994-01-01
The use of exact albedo boundary conditions in numerical methods applied to one-dimensional one-speed discrete ordinates (S n ) eigenvalue problems for nuclear reactor global calculations is described. An albedo operator that treats the reflector region around a nuclear reactor core implicitly is described and exactly was derived. To illustrate the method's efficiency and accuracy, it was used conventional linear diamond method with the albedo option to solve typical model problems. (author)
International Nuclear Information System (INIS)
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)
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)
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
Linear finite element method for one-dimensional diffusion problems
Energy Technology Data Exchange (ETDEWEB)
Brandao, Michele A.; Dominguez, Dany S.; Iglesias, Susana M., E-mail: micheleabrandao@gmail.com, E-mail: dany@labbi.uesc.br, E-mail: smiglesias@uesc.br [Universidade Estadual de Santa Cruz (LCC/DCET/UESC), Ilheus, BA (Brazil). Departamento de Ciencias Exatas e Tecnologicas. Laboratorio de Computacao Cientifica
2011-07-01
We describe in this paper the fundamentals of Linear Finite Element Method (LFEM) applied to one-speed diffusion problems in slab geometry. We present the mathematical formulation to solve eigenvalue and fixed source problems. First, we discretized a calculus domain using a finite set of elements. At this point, we obtain the spatial balance equations for zero order and first order spatial moments inside each element. Then, we introduce the linear auxiliary equations to approximate neutron flux and current inside the element and architect a numerical scheme to obtain the solution. We offer numerical results for fixed source typical model problems to illustrate the method's accuracy for coarse-mesh calculations in homogeneous and heterogeneous domains. Also, we compare the accuracy and computational performance of LFEM formulation with conventional Finite Difference Method (FDM). (author)
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.
Eigenvalue problem and nonlinear evolution of kink modes in a toroidal plasma
International Nuclear Information System (INIS)
Ogino, T.; Takeda, S.; Sanuki, H.; Kamimura, T.
1979-04-01
The internal kink modes of a cylindrical plasma are investigated by a linear eigen value problem and their nonlinear evolution is studied by 3-dimensional MHD simulation based on the rectangular column model under the fixed boundary condition. The growth rates in two cases, namely uniform and diffused current profiles are analyzed in detail, which agree with the analytical estimation by Shafranov. The time evolution of the m = 1 mode showed that q > 1 is satisfied at the relaxation time (q safety factor), a stable configuration like a horse shoe (a new equilibrium) was formed. Also, the time evolution of the pressure p for the m = 2 mode showed that a stable configuration like a pair of anchors was formed. (author)
International Nuclear Information System (INIS)
Bottcher, C.; Strayer, M.R.; Werby, M.F.
1993-01-01
The Helmholtz-Poincare Wave Equation (H-PWE) arises in many areas of classical wave scattering theory. In particular it can be found for the cases of acoustical scattering from submerged bounded objects and electromagnetic scattering from objects. The extended boundary integral equations (EBIE) method is derived from considering both the exterior and interior solutions of the H-PWE's. This coupled set of expressions has the advantage of not only offering a prescription for obtaining a solution for the exterior scattering problem, but it also obviates the problem of irregular values corresponding to fictitious interior eigenvalues. Once the coupled equations are derived, they can by obtained in matrix form be expanding all relevant terms in partial wave expansions, including a biorthogonal expansion of the Green function. However some freedom of choice in the choice of the surface expansion is available since the unknown surface quantities may be expanded in a variety of ways to long as closure is obtained. Out of many possible choices, we develop an optimal method to obtain such expansions which is based on the optimum eigenfunctions related to the surface of the object. In effect, we convert part of the problem (that associated with the Fredholms integral equation of the first kind) an eigenvalue problem of a related Hermition operator. The methodology will be explained in detail and examples will be presented
International Nuclear Information System (INIS)
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)
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)
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.)
Domain decomposition methods for the neutron diffusion problem
International Nuclear Information System (INIS)
Guerin, P.; Baudron, A. M.; Lautard, J. J.
2010-01-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, simplified transport (SPN) or diffusion approximations are often used. The MINOS solver developed at CEA Saclay uses a mixed dual finite element method for the resolution of these problems. and has shown his efficiency. In order to take into account the heterogeneities of the geometry, a very fine mesh is generally required, and leads to expensive calculations for industrial applications. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose here two domain decomposition methods based on the MINOS solver. The first approach is a component mode synthesis method on overlapping sub-domains: several Eigenmodes solutions of a local problem 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 an iterative method based on a non-overlapping domain decomposition with Robin interface conditions. At each iteration, we solve the problem on each sub-domain with the interface conditions given by the solutions on the adjacent sub-domains estimated at the previous iteration. Numerical results on parallel computers are presented for the diffusion model on realistic 2D and 3D cores. (authors)
Identification of the Diffusion Parameter in Nonlocal Steady Diffusion Problems
Energy Technology Data Exchange (ETDEWEB)
D’Elia, M., E-mail: mdelia@fsu.edu, E-mail: mdelia@sandia.gov [Sandia National Laboratories (United States); Gunzburger, M. [Florida State University (United States)
2016-04-15
The problem of identifying the diffusion parameter appearing in a nonlocal steady diffusion equation is considered. The identification problem is formulated as an optimal control problem having a matching functional as the objective of the control and the parameter function as the control variable. The analysis makes use of a nonlocal vector calculus that allows one to define a variational formulation of the nonlocal problem. In a manner analogous to the local partial differential equations counterpart, we demonstrate, for certain kernel functions, the existence of at least one optimal solution in the space of admissible parameters. We introduce a Galerkin finite element discretization of the optimal control problem and derive a priori error estimates for the approximate state and control variables. Using one-dimensional numerical experiments, we illustrate the theoretical results and show that by using nonlocal models it is possible to estimate non-smooth and discontinuous diffusion parameters.
Boundary integral equation methods in eigenvalue problems of elastodynamics and thin plates
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
An Inverse Eigenvalue Problem for a Vibrating String with Two Dirichlet Spectra
Rundell, William; Sacks, Paul
2013-01-01
A classical inverse problem is "can you hear the density of a string clamped at both ends?" The mathematical model gives rise to an inverse Sturm-Liouville problem for the unknown density ñ, and it is well known that the answer is negative
Solving eigenvalue problems on curved surfaces using the Closest Point Method
Macdonald, Colin B.; Brandman, Jeremy; Ruuth, Steven J.
2011-01-01
defined in the embedding space and the original surface problem. For open surfaces, we present a simple way to impose Dirichlet and Neumann boundary conditions while maintaining second-order accuracy. Convergence studies and a series of examples
Hamed, Haikel Ben; Bennacer, Rachid
2008-08-01
This work consists in evaluating algebraically and numerically the influence of a disturbance on the spectral values of a diagonalizable matrix. Thus, two approaches will be possible; to use the theorem of disturbances of a matrix depending on a parameter, due to Lidskii and primarily based on the structure of Jordan of the no disturbed matrix. The second approach consists in factorizing the matrix system, and then carrying out a numerical calculation of the roots of the disturbances matrix characteristic polynomial. This problem can be a standard model in the equations of the continuous media mechanics. During this work, we chose to use the second approach and in order to illustrate the application, we choose the Rayleigh-Bénard problem in Darcy media, disturbed by a filtering through flow. The matrix form of the problem is calculated starting from a linear stability analysis by a finite elements method. We show that it is possible to break up the general phenomenon into other elementary ones described respectively by a disturbed matrix and a disturbance. A good agreement between the two methods was seen. To cite this article: H.B. Hamed, R. Bennacer, C. R. Mecanique 336 (2008).
Energy Technology Data Exchange (ETDEWEB)
Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics
1997-11-01
The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.
The Schrodinger Eigenvalue March
Tannous, C.; Langlois, J.
2011-01-01
A simple numerical method for the determination of Schrodinger equation eigenvalues is introduced. It is based on a marching process that starts from an arbitrary point, proceeds in two opposite directions simultaneously and stops after a tolerance criterion is met. The method is applied to solving several 1D potential problems including symmetric…
An Inverse Eigenvalue Problem for a Vibrating String with Two Dirichlet Spectra
Rundell, William
2013-04-23
A classical inverse problem is "can you hear the density of a string clamped at both ends?" The mathematical model gives rise to an inverse Sturm-Liouville problem for the unknown density ñ, and it is well known that the answer is negative: the Dirichlet spectrum from the clamped end-point conditions is insufficient. There are many known ways to add additional information to gain a positive answer, and these include changing one of the boundary conditions and recomputing the spectrum or giving the energy in each eigenmode-the so-called norming constants. We make the assumption that neither of these changes are possible. Instead we will add known mass-densities to the string in a way we can prescribe and remeasure the Dirichlet spectrum. We will not be able to answer the uniqueness question in its most general form, but will give some insight to what "added masses" should be chosen and how this can lead to a reconstruction of the original string density. © 2013 Society for Industrial and Applied Mathematics.
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)
Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems
Jia, C. J.; Wang, Y.; Mendl, C. B.; Moritz, B.; Devereaux, T. P.
2018-03-01
We describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the "checkerboard" decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.
Electrodynamics as a problem of eigenvalues. III. Maxwell operator and perturbation theory
International Nuclear Information System (INIS)
Yudin, L.A.; Kapchinsky, M.I.; Korenev, I.L.; Efimov, S.P.
1996-01-01
This part of the work deals with perturbation theory. The standard technique permits us to solve problems of volume disturbances in free space, waveguides, and cavities, of disturbances of boundary conditions caused by finite conductivity of walls, and of disturbances of the boundary shape. Expressions for frequency and wave number shifts caused by the perturbation are obtained by the unified method. Several examples are presented: wave amplification in the waveguide filled with a resonant medium like an electron beam in a longitudinal magnetic field, the frequency shift (and increment/decrement) of a cavity loaded by an electron beam, and the field disturbance in the waveguide caused by finite conductivity of the walls. copyright 1996 American Institute of Physics
Recent advances in computational-analytical integral transforms for convection-diffusion problems
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.
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.
Problems with Discontinuous Diffusion/Dispersion Coefficients
Directory of Open Access Journals (Sweden)
Stefano Ferraris
2012-01-01
accurate on smooth solutions and based on a special numerical treatment of the diffusion/dispersion coefficients that makes its application possible also when such coefficients are discontinuous. Numerical experiments confirm the convergence of the numerical approximation and show a good behavior on a set of benchmark problems in two space dimensions.
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.
International Nuclear Information System (INIS)
Filio Lopez, Carlos.
1979-01-01
A calculation program (URA 6.F4) was elaborated on FORTRAN IV language, that through finite differences solves the unidimensional scalar Helmholtz equation, assuming only one energy group, in spherical cylindrical or plane geometry. The purpose is the determination of the flow distribution in a reactor of spherical cylindrical or plane geometry and the critical dimensions. Feeding as entrance datas to the program the geometry, diffusion coefficients and macroscopic transversals cross sections of absorption and fission for each region. The differential diffusion equation is converted with its boundary conditions, to one system of homogeneous algebraic linear equations using the box integration technique. The investigation on criticality is converted then in a succession of eigenvalue problems for the critical eigenvalue. In general, only is necessary to solve the first eigenvalue and its corresponding eigenvector, employing the power method. The obtained results by the program for the critical dimensions of the clean reactors are admissible, the existing error as respect to the analytic is less of 0.5%; by the analysed reactors of three regions, the relative error with respect to the semianalytic result is less of 0.2%. With this program is possible to obtain one quantitative description of one reactor if the transversal sections that appears in the monoenergetic model are adequatedly averaged by the energy group used. (author)
Analytical solutions to matrix diffusion problems
Energy Technology Data Exchange (ETDEWEB)
Kekäläinen, Pekka, E-mail: pekka.kekalainen@helsinki.fi [Laboratory of Radiochemistry, Department of Chemistry, P.O. Box 55, FIN-00014 University of Helsinki (Finland)
2014-10-06
We report an analytical method to solve in a few cases of practical interest the equations which have traditionally been proposed for the matrix diffusion problem. In matrix diffusion, elements dissolved in ground water can penetrate the porous rock surronuding the advective flow paths. In the context of radioactive waste repositories this phenomenon provides a mechanism by which the area of rock surface in contact with advecting elements is greatly enhanced, and can thus be an important delay mechanism. The cases solved are relevant for laboratory as well for in situ experiments. Solutions are given as integral representations well suited for easy numerical solution.
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
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)
Fast solution of neutron diffusion problem by reduced basis finite element method
International Nuclear Information System (INIS)
Chunyu, Zhang; Gong, Chen
2018-01-01
Highlights: •An extremely efficient method is proposed to solve the neutron diffusion equation with varying the cross sections. •Three orders of speedup is achieved for IAEA benchmark problems. •The method may open a new possibility of efficient high-fidelity modeling of large scale problems in nuclear engineering. -- Abstract: For the important applications which need carry out many times of neutron diffusion calculations such as the fuel depletion analysis and the neutronics-thermohydraulics coupling analysis, fast and accurate solutions of the neutron diffusion equation are demanding but necessary. In the present work, the certified reduced basis finite element method is proposed and implemented to solve the generalized eigenvalue problems of neutron diffusion with variable cross sections. The order reduced model is built upon high-fidelity finite element approximations during the offline stage. During the online stage, both the k eff and the spatical distribution of neutron flux can be obtained very efficiently for any given set of cross sections. Numerical tests show that a speedup of around 1100 is achieved for the IAEA two-dimensional PWR benchmark problem and a speedup of around 3400 is achieved for the three-dimensional counterpart with the fission cross-sections, the absorption cross-sections and the scattering cross-sections treated as parameters.
Energy Technology Data Exchange (ETDEWEB)
Silva, Davi Jose M.; Alves Filho, Hermes; Barros, Ricardo C., E-mail: davijmsilva@yahoo.com.br, E-mail: halves@iprj.uerj.br, E-mail: rcbarros@pq.cnpq.br [Universidade do Estado do Rio de Janeiro (UERJ), Nova Friburgo, RJ (Brazil). Programa de Pos-Graduacao em Modelagem Computacional
2015-07-01
A spectral nodal method is developed for multigroup x,y-geometry discrete ordinates (S{sub N}) eigenvalue problems for nuclear reactor global calculations. This method uses the conventional multigroup SN discretized spatial balance nodal equations with two non-standard auxiliary equations: the spectral diamond (SD) auxiliary equations for the discretization nodes inside the fuel regions, and the spectral Green's function (SGF) auxiliary equations for the non-multiplying regions, such as the baffle and the reactor. This spectral nodal method is derived from the analytical general solution of the SN transverse integrated nodal equations with constant approximations for the transverse leakage terms within each discretization node. The SD and SGF auxiliary equations have parameters, which are determined to preserve the homogeneous and the particular components of these local general solutions. Therefore, we refer to the offered method as the hybrid SD-SGF-Constant Nodal (SD-SGF-CN) method. The S{sub N} discretized spatial balance equations, together with the SD and the SGF auxiliary equations form the SD-SGF-CN equations. We solve the SD-SGF-CN equations by using the one-node block inversion inner iterations (NBI), wherein the most recent estimates for the incoming group node-edge average or prescribed boundary conditions are used to evaluate the outgoing group node-edge average fluxes in the directions of the S{sub N} transport sweeps, for each estimate of the dominant eigenvalue in the conventional Power outer iterations. We show in numerical calculations that the SD-SGF-CN method is very accurate for coarse-mesh multigroup S{sub N} eigenvalue problems, even though the transverse leakage terms are approximated rather simply. (author)
International Nuclear Information System (INIS)
Silva, Davi Jose M.; Alves Filho, Hermes; Barros, Ricardo C.
2015-01-01
A spectral nodal method is developed for multigroup x,y-geometry discrete ordinates (S N ) eigenvalue problems for nuclear reactor global calculations. This method uses the conventional multigroup SN discretized spatial balance nodal equations with two non-standard auxiliary equations: the spectral diamond (SD) auxiliary equations for the discretization nodes inside the fuel regions, and the spectral Green's function (SGF) auxiliary equations for the non-multiplying regions, such as the baffle and the reactor. This spectral nodal method is derived from the analytical general solution of the SN transverse integrated nodal equations with constant approximations for the transverse leakage terms within each discretization node. The SD and SGF auxiliary equations have parameters, which are determined to preserve the homogeneous and the particular components of these local general solutions. Therefore, we refer to the offered method as the hybrid SD-SGF-Constant Nodal (SD-SGF-CN) method. The S N discretized spatial balance equations, together with the SD and the SGF auxiliary equations form the SD-SGF-CN equations. We solve the SD-SGF-CN equations by using the one-node block inversion inner iterations (NBI), wherein the most recent estimates for the incoming group node-edge average or prescribed boundary conditions are used to evaluate the outgoing group node-edge average fluxes in the directions of the S N transport sweeps, for each estimate of the dominant eigenvalue in the conventional Power outer iterations. We show in numerical calculations that the SD-SGF-CN method is very accurate for coarse-mesh multigroup S N eigenvalue problems, even though the transverse leakage terms are approximated rather simply. (author)
Liu, Tianyu; Du, Xining; Ji, Wei; Xu, X. George; Brown, Forrest B.
2014-06-01
For nuclear reactor analysis such as the neutron eigenvalue calculations, the time consuming Monte Carlo (MC) simulations can be accelerated by using graphics processing units (GPUs). However, traditional MC methods are often history-based, and their performance on GPUs is affected significantly by the thread divergence problem. In this paper we describe the development of a newly designed event-based vectorized MC algorithm for solving the neutron eigenvalue problem. The code was implemented using NVIDIA's Compute Unified Device Architecture (CUDA), and tested on a NVIDIA Tesla M2090 GPU card. We found that although the vectorized MC algorithm greatly reduces the occurrence of thread divergence thus enhancing the warp execution efficiency, the overall simulation speed is roughly ten times slower than the history-based MC code on GPUs. Profiling results suggest that the slow speed is probably due to the memory access latency caused by the large amount of global memory transactions. Possible solutions to improve the code efficiency are discussed.
International Nuclear Information System (INIS)
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)
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...
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
Dynamic problem of generalized thermoelastic diffusive medium
Energy Technology Data Exchange (ETDEWEB)
Kumar, Rajneesh; Kansal, Tarun [Kurukshetra University, Kurukshetra (India)
2010-01-15
The equations of generalized thermoelastic diffusion, based on the theory of Lord and Shulman with one relaxation time, are derived for anisotropic media with rotation. The variational principle and reciprocity theorem for the governing equations are derived. The propagation of leaky Rayleigh waves in a viscous fluid layer overlying a homogeneous isotropic, generalized thermoelastic diffusive half space with rotating frame of reference is studied
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
Study of ODE limit problems for reaction-diffusion equations
Directory of Open Access Journals (Sweden)
Jacson Simsen
2018-01-01
Full Text Available In this work we study ODE limit problems for reaction-diffusion equations for large diffusion and we study the sensitivity of nonlinear ODEs with respect to initial conditions and exponent parameters. Moreover, we prove continuity of the flow and weak upper semicontinuity of a family of global attractors for reaction-diffusion equations with spatially variable exponents when the exponents go to 2 in \\(L^{\\infty}(\\Omega\\ and the diffusion coefficients go to infinity.
Nonlinear diffusion problem arising in plasma physics
International Nuclear Information System (INIS)
Berryman, J.G.; Holland, C.J.
1978-01-01
In earlier studies of plasma diffusion with Okuda-Dawson scaling (D approx. n/sup -1/2/), perturbation theory indicated that arbitrary initial data should evolve rapidly toward the separation solution of the relevant nonlinear diffusion equation. Now a Lyapunov functional has been found which is strictly decreasing in time and bounded below. The rigorous proof that arbitrary initial data evolve toeard the separable solution is summarized. Rigorous bounds on the decay time are also presented
Eigenstructure of of singular systems. Perturbation analysis of simple eigenvalues
García Planas, María Isabel; Tarragona Romero, Sonia
2014-01-01
The problem to study small perturbations of simple eigenvalues with a change of parameters is of general interest in applied mathematics. After to introduce a systematic way to know if an eigenvalue of a singular system is simple or not, the aim of this work is to study the behavior of a simple eigenvalue of singular linear system family
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}.$
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 complex variable meshless method for advection—diffusion problems
International Nuclear Information System (INIS)
Wang Jian-Fei; Cheng Yu-Min
2013-01-01
In this paper, an improved complex variable meshless method (ICVMM) for two-dimensional advection—diffusion problems is developed based on improved complex variable moving least-square (ICVMLS) approximation. The equivalent functional of two-dimensional advection—diffusion problems is formed, the variation method is used to obtain the equation system, and the penalty method is employed to impose the essential boundary conditions. The difference method for two-point boundary value problems is used to obtain the discrete equations. Then the corresponding formulas of the ICVMM for advection—diffusion problems are presented. Two numerical examples with different node distributions are used to validate and inestigate the accuracy and efficiency of the new method in this paper. It is shown that ICVMM is very effective for advection—diffusion problems, and has a good convergent character, accuracy, and computational efficiency
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).
A new analytical solution to the diffusion problem: Fourier series ...
African Journals Online (AJOL)
This paper reviews briefly the origin of Fourier Series Method. The paper then gives a vivid description of how the method can be applied to solve a diffusion problem, subject to some boundary conditions. The result obtained is quite appealing as it can be used to solve similar examples of diffusion equations. JONAMP Vol.
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
International Nuclear Information System (INIS)
Couto, Nozimar do
2003-01-01
Diffusion theory is traditionally applied to nuclear reactor global calculations. Based on the good results generated by the one-dimensional spectral nodal diffusion (SND) method for benchmark problems, we offer the SND method for nuclear reactor global calculations in X,Y geometry. In this method, the continuity equation and Flick law are transverse integrated in each spatial direction leading to a system of two 'one-dimensional' equations coupled by the transverse leakage terms. We then apply the SND method to numerically solve this system with constant approximations for the transverse leakage terms. We perform a spectral analysis to determine the local general solution of each 'one-dimensional' nodal equation with flat approximation for the transverse leakages. We used special auxiliary equations with parameters that are to be determined in order to preserve the analytical general solutions in the numerical algorithm. By considering continuity conditions at the node interfaces and appropriate boundary conditions, we obtain a solvable system of discretized equations involving the node-edge average scalar fluxes at each estimate of the dominant eigenvalue (k eff ) in the outer power iterations. As we considered approximations to the transverse leakages, the SND method is not free of spatial truncation errors. Nevertheless, it generated good results for the typical model problems that we considered. (author)
RKC time-stepping for advection-diffusion-reaction problems
International Nuclear Information System (INIS)
Verwer, J.G.; Sommeijer, B.P.; Hundsdorfer, W.
2004-01-01
The original explicit Runge-Kutta-Chebyshev (RKC) method is a stabilized second-order integration method for pure diffusion problems. Recently, it has been extended in an implicit-explicit manner to also incorporate highly stiff reaction terms. This implicit-explicit RKC method thus treats diffusion terms explicitly and the highly stiff reaction terms implicitly. The current paper deals with the incorporation of advection terms for the explicit method, thus aiming at the implicit-explicit RKC integration of advection-diffusion-reaction equations in a manner that advection and diffusion terms are treated simultaneously and explicitly and the highly stiff reaction terms implicitly
Diffusion-synthetic acceleration methods for discrete-ordinates problems
International Nuclear Information System (INIS)
Larsen, E.W.
1984-01-01
The diffusion-synthetic acceleration (DSA) method is an iterative procedure for obtaining numerical solutions of discrete-ordinates problems. The DSA method is operationally more complicated than the standard source-iteration (SI) method, but if encoded properly it converges much more rapidly, especially for problems with diffusion-like regions. In this article we describe the basic ideas behind the DSA method and give a (roughly chronological) review of its long development. We conclude with a discussion which covers additional topics, including some remaining open problems an the status of current efforts aimed at solving these problems
International Nuclear Information System (INIS)
Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.
1975-10-01
The computer code block VENTURE, designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P 1 ) in up to three-dimensional geometry is described. A variety of types of problems may be solved: the usual eigenvalue problem, a direct criticality search on the buckling, on a reciprocal velocity absorber (prompt mode), or on nuclide concentrations, or an indirect criticality search on nuclide concentrations, or on dimensions. First-order perturbation analysis capability is available at the macroscopic cross section level
A tutorial on inverse problems for anomalous diffusion processes
International Nuclear Information System (INIS)
Jin, Bangti; Rundell, William
2015-01-01
Over the last two decades, anomalous diffusion processes in which the mean squares variance grows slower or faster than that in a Gaussian process have found many applications. At a macroscopic level, these processes are adequately described by fractional differential equations, which involves fractional derivatives in time or/and space. The fractional derivatives describe either history mechanism or long range interactions of particle motions at a microscopic level. The new physics can change dramatically the behavior of the forward problems. For example, the solution operator of the time fractional diffusion diffusion equation has only limited smoothing property, whereas the solution for the space fractional diffusion equation may contain weak singularity. Naturally one expects that the new physics will impact related inverse problems in terms of uniqueness, stability, and degree of ill-posedness. The last aspect is especially important from a practical point of view, i.e., stably reconstructing the quantities of interest. In this paper, we employ a formal analytic and numerical way, especially the two-parameter Mittag-Leffler function and singular value decomposition, to examine the degree of ill-posedness of several ‘classical’ inverse problems for fractional differential equations involving a Djrbashian–Caputo fractional derivative in either time or space, which represent the fractional analogues of that for classical integral order differential equations. We discuss four inverse problems, i.e., backward fractional diffusion, sideways problem, inverse source problem and inverse potential problem for time fractional diffusion, and inverse Sturm–Liouville problem, Cauchy problem, backward fractional diffusion and sideways problem for space fractional diffusion. It is found that contrary to the wide belief, the influence of anomalous diffusion on the degree of ill-posedness is not definitive: it can either significantly improve or worsen the conditioning
Perturbation on diffusion problems in domain with interfaces
International Nuclear Information System (INIS)
Watson, F.V.
1985-01-01
A perturbative type algorithm for the solution of linear diffusion equation at two dimensions, in domain with interfaces is presented. The perturbative scheme should be assembled in the weak formulation of diffusion equation, even if the strong solution exists, and when it is taken in terms superiors to first order, it should be calculated analytically, in one of the dimensions to avoid problems of slow convergence. (M.C.K.) [pt
Matrix-dependent multigrid-homogenization for diffusion problems
Energy Technology Data Exchange (ETDEWEB)
Knapek, S. [Institut fuer Informatik tu Muenchen (Germany)
1996-12-31
We present a method to approximately determine the effective diffusion coefficient on the coarse scale level of problems with strongly varying or discontinuous diffusion coefficients. It is based on techniques used also in multigrid, like Dendy`s matrix-dependent prolongations and the construction of coarse grid operators by means of the Galerkin approximation. In numerical experiments, we compare our multigrid-homogenization method with homogenization, renormalization and averaging approaches.
The Dirichlet problem of a conformable advection-diffusion equation
Directory of Open Access Journals (Sweden)
Avci Derya
2017-01-01
Full Text Available The fractional advection-diffusion equations are obtained from a fractional power law for the matter flux. Diffusion processes in special types of porous media which has fractal geometry can be modelled accurately by using these equations. However, the existing nonlocal fractional derivatives seem complicated and also lose some basic properties satisfied by usual derivatives. For these reasons, local fractional calculus has recently been emerged to simplify the complexities of fractional models defined by nonlocal fractional operators. In this work, the conformable, a local, well-behaved and limit-based definition, is used to obtain a local generalized form of advection-diffusion equation. In addition, this study is devoted to give a local generalized description to the combination of diffusive flux governed by Fick’s law and the advection flux associated with the velocity field. As a result, the constitutive conformable advection-diffusion equation can be easily achieved. A Dirichlet problem for conformable advection-diffusion equation is derived by applying fractional Laplace transform with respect to time t and finite sin-Fourier transform with respect to spatial coordinate x. Two illustrative examples are presented to show the behaviours of this new local generalized model. The dependence of the solution on the fractional order of conformable derivative and the changing values of problem parameters are validated using graphics held by MATLcodes.
An Adaptive Approach to Variational Nodal Diffusion Problems
International Nuclear Information System (INIS)
Zhang Hui; Lewis, E.E.
2001-01-01
An adaptive grid method is presented for the solution of neutron diffusion problems in two dimensions. The primal hybrid finite elements employed in the variational nodal method are used to reduce the diffusion equation to a coupled set of elemental response matrices. An a posteriori error estimator is developed to indicate the magnitude of local errors stemming from the low-order elemental interface approximations. An iterative procedure is implemented in which p refinement is applied locally by increasing the polynomial order of the interface approximations. The automated algorithm utilizes the a posteriori estimator to achieve local error reductions until an acceptable level of accuracy is reached throughout the problem domain. Application to a series of X-Y benchmark problems indicates the reduction of computational effort achievable by replacing uniform with adaptive refinement of the spatial approximations
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...
An inverse diffusivity problem for the helium production–diffusion equation
International Nuclear Information System (INIS)
Bao, Gang; Xu, Xiang
2012-01-01
Thermochronology is a technique for the extraction of information about the thermal history of rocks. Such information is crucial for determining the depth below the surface at which rocks were located at a given time (Bao G et al 2011 Commun. Comput. Phys. 9 129). Mathematically, extracting the time–temperature path can be formulated as an inverse diffusivity problem for the helium production–diffusion equation which is the underlying process of thermochronology. In this paper, to reconstruct the diffusivity which depends on space only and accounts for the structural information of rocks, a local Hölder conditional stability is obtained by a Carleman estimate. A uniqueness result is also proven for extracting the thermal history, i.e. identifying the time-dependant part of the diffusion coefficient, provided that it is analytical with respect to time. Numerical examples are presented to illustrate the validity and effectiveness of the proposed regularization scheme. (paper)
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)
Eigenvalue ratio detection based on exact moments of smallest and largest eigenvalues
Shakir, Muhammad; Tang, Wuchen; Rao, Anlei; Imran, Muhammad Ali; Alouini, Mohamed-Slim
2011-01-01
Detection based on eigenvalues of received signal covariance matrix is currently one of the most effective solution for spectrum sensing problem in cognitive radios. However, the results of these schemes always depend on asymptotic assumptions since the close-formed expression of exact eigenvalues ratio distribution is exceptionally complex to compute in practice. In this paper, non-asymptotic spectrum sensing approach to approximate the extreme eigenvalues is introduced. In this context, the Gaussian approximation approach based on exact analytical moments of extreme eigenvalues is presented. In this approach, the extreme eigenvalues are considered as dependent Gaussian random variables such that the joint probability density function (PDF) is approximated by bivariate Gaussian distribution function for any number of cooperating secondary users and received samples. In this context, the definition of Copula is cited to analyze the extent of the dependency between the extreme eigenvalues. Later, the decision threshold based on the ratio of dependent Gaussian extreme eigenvalues is derived. The performance analysis of our newly proposed approach is compared with the already published asymptotic Tracy-Widom approximation approach. © 2011 ICST.
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.
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....
Multiple Scale Reaction-Diffusion-Advection Problems with Moving Fronts
Nefedov, Nikolay
2016-06-01
In this work we discuss the further development of the general scheme of the asymptotic method of differential inequalities to investigate stability and motion of sharp internal layers (fronts) for nonlinear singularly perturbed parabolic equations, which are called in applications reaction-diffusion-advection equations. Our approach is illustrated for some new important cases of initial boundary value problems. We present results on stability and on the motion of the fronts.
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)
Eigenvalue study of a chaotic resonator
Energy Technology Data Exchange (ETDEWEB)
Banova, Todorka [Technische Universitaet Darmstadt, Institut fuer Theorie Elektromagnetischer Felder (TEMF), Schlossgartenstrasse 8, D-64289 Darmstadt (Germany); Technische Universitaet Darmstadt, Graduate School of Computational Engineering, Dolivostrasse 15, D-64293 Darmstadt (Germany); Ackermann, Wolfgang; Weiland, Thomas [Technische Universitaet Darmstadt, Institut fuer Theorie Elektromagnetischer Felder (TEMF), Schlossgartenstrasse 8, D-64289 Darmstadt (Germany)
2013-07-01
The field of quantum chaos comprises the study of the manifestations of classical chaos in the properties of the corresponding quantum systems. Within this work, we compute the eigenfrequencies that are needed for the level spacing analysis of a microwave resonator with chaotic characteristics. The major challenges posed by our work are: first, the ability of the approaches to tackle the large scale eigenvalue problem and second, the capability to extract many, i.e. order of thousands, eigenfrequencies for the considered cavity. The first proposed approach for an accurate eigenfrequency extraction takes into consideration the evaluated electric field computations in time domain of a superconducting cavity and by means of signal-processing techniques extracts the eigenfrequencies. The second approach is based on the finite element method with curvilinear elements, which transforms the continuous eigenvalue problem to a discrete generalized eigenvalue problem. Afterwards, the Lanczos algorithm is used for the solution of the generalized eigenvalue problem. In the poster, a summary of the applied algorithms, as well as, critical implementation details together with the simulation results are provided.
Eigenvalues 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.
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
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
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.
Numerical approach to the inverse convection-diffusion problem
International Nuclear Information System (INIS)
Yang, X-H; She, D-X; Li, J-Q
2008-01-01
In this paper, the inverse problem on source term identification in convection-diffusion equation is transformed into an optimization problem. To reduce the computational cost and improve computational accuracy for the optimization problem, a new algorithm, chaos real-coded hybrid-accelerating evolution algorithm (CRHAEA), is proposed, in which an initial population is generated by chaos mapping, and new chaos mutation and simplex evolution operation are used. With the shrinking of searching range, CRHAEA gradually directs to an optimal result with the excellent individuals obtained by real-coded evolution algorithm. Its convergence is analyzed. Its efficiency is demonstrated by 15 test functions. Numerical simulation shows that CRHAEA has some advantages over the real-coded accelerated evolution algorithm, the chaos algorithm and the pure random search algorithm
Parallel preconditioned conjugate gradient algorithm applied to neutron diffusion problem
International Nuclear Information System (INIS)
Majumdar, A.; Martin, W.R.
1992-01-01
Numerical solution of the neutron diffusion problem requires solving a linear system of equations such as Ax = b, where A is an n x n symmetric positive definite (SPD) matrix; x and b are vectors with n components. The preconditioned conjugate gradient (PCG) algorithm is an efficient iterative method for solving such a linear system of equations. In this paper, the authors describe the implementation of a parallel PCG algorithm on a shared memory machine (BBN TC2000) and on a distributed workstation (IBM RS6000) environment created by the parallel virtual machine parallelization software
Numerical solution of non-linear diffusion problems
International Nuclear Information System (INIS)
Carmen, A. del; Ferreri, J.C.
1998-01-01
This paper presents a method for the numerical solution of non-linear diffusion problems using finite-differences in moving grids. Due to the presence of steep fronts in the solution domain and to the presence of advective terms originating in the grid movement, an implicit TVD scheme, first order in time and second order in space has been developed. Some algebraic details of the derivation are given. Results are shown for the pure advection of a scalar as a test case and an example dealing with the slow spreading of viscous fluids over plane surfaces. The agreement between numerical and analytical solutions is excellent. (author). 8 refs., 3 figs
A method for the solution of the RPA eigenvalue
International Nuclear Information System (INIS)
Hoffman, M.J.H.; De Kock, P.R.
1986-01-01
The RPA eigenvalue problem requires the diagonalization of a 2nx2n matrix. In practical calculations, n (the number of particle-hole basis states) can be a few hundred and the diagonalization of such a large non-symmetric matrix may take quite a long time. In this report we firstly discuss sufficient conditions for real and non-zero RPA eigenvalues. The presence of zero or imaginary eigenvalues is related to the relative importance of the groundstate correlations to the total interaction energy. We then rewrite the RPA eigenvalue problem for the cases where these conditions are fulfilled in a form which only requires the diagonalization of two symmetric nxn matrices. The extend to which this method can be applied when zero eigenvalues occur, is also discussed
Variational methods applied to problems of diffusion and reaction
Strieder, William
1973-01-01
This monograph is an account of some problems involving diffusion or diffusion with simultaneous reaction that can be illuminated by the use of variational principles. It was written during a period that included sabbatical leaves of one of us (W. S. ) at the University of Minnesota and the other (R. A. ) at the University of Cambridge and we are grateful to the Petroleum Research Fund for helping to support the former and the Guggenheim Foundation for making possible the latter. We would also like to thank Stephen Prager for getting us together in the first place and for showing how interesting and useful these methods can be. We have also benefitted from correspondence with Dr. A. M. Arthurs of the University of York and from the counsel of Dr. B. D. Coleman the general editor of this series. Table of Contents Chapter 1. Introduction and Preliminaries . 1. 1. General Survey 1 1. 2. Phenomenological Descriptions of Diffusion and Reaction 2 1. 3. Correlation Functions for Random Suspensions 4 1. 4. Mean Free ...
A novel family of DG methods for diffusion problems
Johnson, Philip; Johnsen, Eric
2017-11-01
We describe and demonstrate a novel family of numerical schemes for handling elliptic/parabolic PDE behavior within the discontinuous Galerkin (DG) framework. Starting from the mixed-form approach commonly applied for handling diffusion (examples include Local DG and BR2), the new schemes apply the Recovery concept of Van Leer to handle cell interface terms. By applying recovery within the mixed-form approach, we have designed multiple schemes that show better accuracy than other mixed-form approaches while being more flexible and easier to implement than the Recovery DG schemes of Van Leer. While typical mixed-form approaches converge at rate 2p in the cell-average or functional error norms (where p is the order of the solution polynomial), many of our approaches achieve order 2p +2 convergence. In this talk, we will describe multiple schemes, including both compact and non-compact implementations; the compact approaches use only interface-connected neighbors to form the residual for each element, while the non-compact approaches add one extra layer to the stencil. In addition to testing the schemes on purely parabolic PDE problems, we apply them to handle the diffusive flux terms in advection-diffusion systems, such as the compressible Navier-Stokes equations.
An inverse problem for a one-dimensional time-fractional diffusion problem
Jin, Bangti; Rundell, William
2012-01-01
We study an inverse problem of recovering a spatially varying potential term in a one-dimensional time-fractional diffusion equation from the flux measurements taken at a single fixed time corresponding to a given set of input sources. The unique
Mimetic Discretization of Vector-valued Diffusion Problems
DEFF Research Database (Denmark)
Olesen, Kennet
this is the balance of the change of mass in a finite volume with mass fluxes across the surfaces bounding this volume? In the FDM and FEM the derivatives in the gradient-, curl- and divergence operator are approximated by formulating expressions with respect to a finite number of selected points. The continuous...... gradient-, curl- and divergence operators are derived based on geometrical considerations on finite domains, and by introducing geometry into the numerical scheme these operators can be replicated exactly. To incorporate the geometry into the PDEs the field of differential geometry is applied, which has...... of different dimensions through Stokes' theorem. - A clear separation of balance/equilibrium equations and constitutive equations is possible. As mentioned the emphasis is put on diffusion dominated problems containing second order tensors. Earlier work has developed a rigorous framework for problems involving...
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)
A Bootstrap Approach to Eigenvalue Correction
Hendrikse, A.J.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.
2009-01-01
Eigenvalue analysis is an important aspect in many data modeling methods. Unfortunately, the eigenvalues of the sample covariance matrix (sample eigenvalues) are biased estimates of the eigenvalues of the covariance matrix of the data generating process (population eigenvalues). We present a new
A robust multilevel simultaneous eigenvalue solver
Costiner, Sorin; Taasan, Shlomo
1993-01-01
Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.
Performance modeling of parallel algorithms for solving neutron diffusion problems
International Nuclear Information System (INIS)
Azmy, Y.Y.; Kirk, B.L.
1995-01-01
Neutron diffusion calculations are the most common computational methods used in the design, analysis, and operation of nuclear reactors and related activities. Here, mathematical performance models are developed for the parallel algorithm used to solve the neutron diffusion equation on message passing and shared memory multiprocessors represented by the Intel iPSC/860 and the Sequent Balance 8000, respectively. The performance models are validated through several test problems, and these models are used to estimate the performance of each of the two considered architectures in situations typical of practical applications, such as fine meshes and a large number of participating processors. While message passing computers are capable of producing speedup, the parallel efficiency deteriorates rapidly as the number of processors increases. Furthermore, the speedup fails to improve appreciably for massively parallel computers so that only small- to medium-sized message passing multiprocessors offer a reasonable platform for this algorithm. In contrast, the performance model for the shared memory architecture predicts very high efficiency over a wide range of number of processors reasonable for this architecture. Furthermore, the model efficiency of the Sequent remains superior to that of the hypercube if its model parameters are adjusted to make its processors as fast as those of the iPSC/860. It is concluded that shared memory computers are better suited for this parallel algorithm than message passing computers
A symmetrized quasi-diffusion method for solving multidimensional transport problems
International Nuclear Information System (INIS)
Miften, M.M.; Larsen, E.W.
1992-01-01
In this paper, the authors propose a 'symmetrized' QD (SQD) method in which the non-self-adjoint QD diffusion problem is replaced by two self-adjoint diffusion problems. These problems are more easily discretized and more efficiently solved than in the standard QD method. They also give SQD calculational results for transport problems in x-y geometry
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
Finite element method for neutron diffusion problems in hexagonal geometry
International Nuclear Information System (INIS)
Wei, T.Y.C.; Hansen, K.F.
1975-06-01
The use of the finite element method for solving two-dimensional static neutron diffusion problems in hexagonal reactor configurations is considered. It is investigated as a possible alternative to the low-order finite difference method. Various piecewise polynomial spaces are examined for their use in hexagonal problems. The central questions which arise in the design of these spaces are the degree of incompleteness permissible and the advantages of using a low-order space fine-mesh approach over that of a high-order space coarse-mesh one. There is also the question of the degree of smoothness required. Two schemes for the construction of spaces are described and a number of specific spaces, constructed with the questions outlined above in mind, are presented. They range from a complete non-Lagrangian, non-Hermite quadratic space to an incomplete ninth order space. Results are presented for two-dimensional problems typical of a small high temperature gas-cooled reactor. From the results it is concluded that the space used should at least include the complete linear one. Complete spaces are to be preferred to totally incomplete ones. Once function continuity is imposed any additional degree of smoothness is of secondary importance. For flux shapes typical of the small high temperature gas-cooled reactor the linear space fine-mesh alternative is to be preferred to the perturbation quadratic space coarse-mesh one and the low-order finite difference method is to be preferred over both finite element schemes
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
Organization and diffusion in biological and material fabrication problems
Mangan, Niall Mari
This thesis is composed of two problems. The first is a systems level analysis of the carbon concentrating mechanism in cyanobacteria. The second presents a theoretical analysis of femtosecond laser melting for the purpose of hyperdoping silicon with sulfur. While these systems are very distant, they are both relevant to the development of alternative energy (production of biofuels and methods for fabricating photovoltaics respectively). Both problems are approached through analysis of the underlying diffusion equations. Cyanobacteria are photosynthetic bacteria with a unique carbon concentrating mechanism (CCM) which enhances carbon fixation. A greater understanding of this mechanism would offer new insights into the basic biology and methods for bioengineering more efficient biochemical reactions. The molecular components of the CCM have been well characterized in the last decade, with genetic analysis uncovering both variation and commonalities in CCMs across cyanobacteria strains. Analysis of CCMs on a systems level, however, is based on models formulated prior to the molecular characterization. We present an updated model of the cyanobacteria CCM, and analytic solutions in terms of the various molecular components. The solutions allow us to find the parameter regime (expression levels, catalytic rates, permeability of carboxysome shell) where carbon fixation is maximized and oxygenation is minimized. Saturation of RuBisCO, maximization of the ratio of CO2 to O2, and staying below or at the saturation level for carbonic anhydrase are all needed for maximum efficacy. These constraints limit the parameter regime where the most effective carbon fixation can occur. There is an optimal non-specific carboxysome shell permeability, where trapping of CO2 is maximized, but HCO3 - is not detrimentally restricted. The shell also shields carbonic anhydrase activity and CO2 → HCO3- conversion at the thylakoid and cell membrane from one another. Co-localization of carbonic
Generalized Eigenvalues for pairs on heritian matrices
Rublein, George
1988-01-01
A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.
Eigenvalues of Words in Two Positive Definite Letters
Hillar, Christopher J; Johnson, Charles R
2005-01-01
The question of whether all words in two real positive definite letters have only positive eigenvalues is addressed and settled (negatively). This question was raised some time ago in connection with a long-standing problem in theoretical physics. A large class of words that do guarantee positive eigenvalues is identified, and considerable evidence is given for the conjecture that no other words do. In the process, a fundamental question about solvability of symmetric word equations is encoun...
Indian Academy of Sciences (India)
The vibrating string problem is the source of much mathe- matics and physics. ... ing this science [mechanics],and the art of solving the problems pertaining to it, to .... used tools for finding maxima and minima of functions of several variables.
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)
Analysis of Diffusion Problems using Homotopy Perturbation and Variational Iteration Methods
DEFF Research Database (Denmark)
Barari, Amin; Poor, A. Tahmasebi; Jorjani, A.
2010-01-01
In this paper, variational iteration method and homotopy perturbation method are applied to different forms of diffusion equation. The diffusion equations have found wide applications in heat transfer problems, theory of consolidation and many other problems in engineering. The methods proposed...
International Nuclear Information System (INIS)
Alvarenga, M.A.B.
1980-12-01
An analytical procedure to solve the neutron diffusion equation in two dimensions and two energy groups was developed. The response matrix method was used coupled with an expansion of the neutron flux in finite Fourier series. A computer code 'MRF2D' was elaborated to implement the above mentioned procedure for PWR reactor core calculations. Different core symmetry options are allowed by the code, which is also flexible enough to allow for improvements by means of algorithm optimization. The code performance was compared with a corner mesh finite difference code named TVEDIM by using a International Atomic Energy Agency (IAEA) standard problem. Computer processing time 12,7% smaller is required by the MRF2D code to reach the same precision on criticality eigenvalue. (Author) [pt
An inverse problem for a one-dimensional time-fractional diffusion problem
Jin, Bangti
2012-06-26
We study an inverse problem of recovering a spatially varying potential term in a one-dimensional time-fractional diffusion equation from the flux measurements taken at a single fixed time corresponding to a given set of input sources. The unique identifiability of the potential is shown for two cases, i.e. the flux at one end and the net flux, provided that the set of input sources forms a complete basis in L 2(0, 1). An algorithm of the quasi-Newton type is proposed for the efficient and accurate reconstruction of the coefficient from finite data, and the injectivity of the Jacobian is discussed. Numerical results for both exact and noisy data are presented. © 2012 IOP Publishing Ltd.
Generalized eigenvalue based spectrum sensing
Shakir, Muhammad
2012-01-01
Spectrum sensing is one of the fundamental components in cognitive radio networks. In this chapter, a generalized spectrum sensing framework which is referred to as Generalized Mean Detector (GMD) has been introduced. In this context, we generalize the detectors based on the eigenvalues of the received signal covariance matrix and transform the eigenvalue based spectrum sensing detectors namely: (i) the Eigenvalue Ratio Detector (ERD) and two newly proposed detectors which are referred to as (ii) the GEometric Mean Detector (GEMD) and (iii) the ARithmetic Mean Detector (ARMD) into an unified framework of generalize spectrum sensing. The foundation of the proposed framework is based on the calculation of exact analytical moments of the random variables of the decision threshold of the respective detectors. The decision threshold has been calculated in a closed form which is based on the approximation of Cumulative Distribution Functions (CDFs) of the respective test statistics. In this context, we exchange the analytical moments of the two random variables of the respective test statistics with the moments of the Gaussian (or Gamma) distribution function. The performance of the eigenvalue based detectors is compared with the several traditional detectors including the energy detector (ED) to validate the importance of the eigenvalue based detectors and the performance of the GEMD and the ARMD particularly in realistic wireless cognitive radio network. Analytical and simulation results show that the newly proposed detectors yields considerable performance advantage in realistic spectrum sensing scenarios. Moreover, the presented results based on proposed approximation approaches are in perfect agreement with the empirical results. © 2012 Springer Science+Business Media Dordrecht.
The Method of Lines for Ternary Diffusion Problems
Directory of Open Access Journals (Sweden)
Henryk Leszczyński
2014-01-01
Full Text Available The method of lines (MOL for diffusion equations with Neumann boundary conditions is considered. These equations are transformed by a discretization in space variables into systems of ordinary differential equations. The proposed ODEs satisfy the mass conservation law. The stability of solutions of these ODEs with respect to discrete L2 norms and discrete W1,∞ norms is investigated. Numerical examples confirm the parabolic behaviour of this model and very regular dynamics.
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.
NEWBOX: A computer program for parameter estimation in diffusion problems
International Nuclear Information System (INIS)
Nestor, C.W. Jr.; Godbee, H.W.; Joy, D.S.
1989-01-01
In the analysis of experiments to determine amounts of material transferred form 1 medium to another (e.g., the escape of chemically hazardous and radioactive materials from solids), there are at least 3 important considerations. These are (1) is the transport amenable to treatment by established mass transport theory; (2) do methods exist to find estimates of the parameters which will give a best fit, in some sense, to the experimental data; and (3) what computational procedures are available for evaluating the theoretical expressions. The authors have made the assumption that established mass transport theory is an adequate model for the situations under study. Since the solutions of the diffusion equation are usually nonlinear in some parameters (diffusion coefficient, reaction rate constants, etc.), use of a method of parameter adjustment involving first partial derivatives can be complicated and prone to errors in the computation of the derivatives. In addition, the parameters must satisfy certain constraints; for example, the diffusion coefficient must remain positive. For these reasons, a variant of the constrained simplex method of M. J. Box has been used to estimate parameters. It is similar, but not identical, to the downhill simplex method of Nelder and Mead. In general, they calculate the fraction of material transferred as a function of time from expressions obtained by the inversion of the Laplace transform of the fraction transferred, rather than by taking derivatives of a calculated concentration profile. With the above approaches to the 3 considerations listed at the outset, they developed a computer program NEWBOX, usable on a personal computer, to calculate the fractional release of material from 4 different geometrical shapes (semi-infinite medium, finite slab, finite circular cylinder, and sphere), accounting for several different boundary conditions
A problem of atomic diffusion in a moving boundary
International Nuclear Information System (INIS)
Bezerra, M.C.C.
1985-01-01
It is analysed the convergence of a numerical scheme for calculating approximate solutions of a model used for evaluating concentration of atoms in a diffusion process in the walls of nuclear reactors. The ion trapping process is admitted to be reversible and the wall corrosion process is also considered in the model so that must deal with a moving boundary. Some conditions for the motion of the boundary are established in such a way that convergence can be assured in more general settings than those of previous papers. (Author) [pt
De Meulemeester, Celine; Lowyck, Benedicte; Vermote, Rudi; Verhaest, Yannic; Luyten, Patrick
2017-12-01
Individuals with borderline personality disorder (BPD) are characterized by problems in interpersonal functioning and their long-term social integration often remains problematic. Extant theories have linked identity diffusion to many of the interpersonal problems characteristic of BPD patients. Recent theoretical accounts have suggested that identity diffusion results from problems with mentalizing or reflective functioning, that is, the capacity to understand oneself and others in terms of intentional mental states. In this study we tested these assumptions, i.e., whether identity diffusion plays a mediating role in the relationship between mentalizing difficulties and interpersonal problems, in a sample of 167 BPD patients. Highly significant correlations were found between mentalizing impairments, identity diffusion and interpersonal problems. Mediation analyses showed that identity diffusion fully mediated the relationship between mentalizing difficulties and interpersonal problems. This study provides preliminary evidence that impairments in mentalizing are related to identity diffusion, which in turn is related to interpersonal problems in BPD. Further longitudinal research is needed to further substantiate these conclusions. Copyright © 2017 Elsevier B.V. All rights reserved.
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.
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
A chaotic model for advertising diffusion problem with competition
Ip, W. H.; Yung, K. L.; Wang, Dingwei
2012-08-01
In this article, the author extends Dawid and Feichtinger's chaotic advertising diffusion model into the duopoly case. A computer simulation system is used to test this enhanced model. Based on the analysis of simulation results, it is found that the best advertising strategy in duopoly is to increase the advertising investment to reach the best Win-Win situation where the oscillation of market portion will not occur. In order to effectively arrive at the best situation, we define a synthetic index and two thresholds. An estimation method for the parameters of the index and thresholds is proposed in this research. We can reach the Win-Win situation by simply selecting the control parameters to make the synthetic index close to the threshold of min-oscillation state. The numerical example and computational results indicated that the proposed chaotic model is useful to describe and analyse advertising diffusion process in duopoly, it is an efficient tool for the selection and optimisation of advertising strategy.
Methods of intermediate problems for eigenvalues
Weinstein, Alexander
1972-01-01
In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank mat
Organization and diffusion in biological and material fabrication problems
Mangan, Niall Mari
2013-01-01
This thesis is composed of two problems. The first is a systems level analysis of the carbon concentrating mechanism in cyanobacteria. The second presents a theoretical analysis of femtosecond laser melting for the purpose of hyperdoping silicon with sulfur. While these systems are very distant, they are both relevant to the development of alternative energy (production of biofuels and methods for fabricating photovoltaics respectively). Both problems are approached through analysis of the un...
An Optimal Lower Eigenvalue System
Directory of Open Access Journals (Sweden)
Yingfan Liu
2011-01-01
Full Text Available An optimal lower eigenvalue system is studied, and main theorems including a series of necessary and suffcient conditions concerning existence and a Lipschitz continuity result concerning stability are obtained. As applications, solvability results to some von-Neumann-type input-output inequalities, growth, and optimal growth factors, as well as Leontief-type balanced and optimal balanced growth paths, are also gotten.
Eigenvalue pinching on spinc manifolds
Roos, Saskia
2017-02-01
We derive various pinching results for small Dirac eigenvalues using the classification of spinc and spin manifolds admitting nontrivial Killing spinors. For this, we introduce a notion of convergence for spinc manifolds which involves a general study on convergence of Riemannian manifolds with a principal S1-bundle. We also analyze the relation between the regularity of the Riemannian metric and the regularity of the curvature of the associated principal S1-bundle on spinc manifolds with Killing spinors.
TRANSIENT ANOMALOUS SUB-DIFFUSION ON BOUNDED DOMAINS
MEERSCHAERT, MARK M.; NANE, ERKAN; VELLAISAMY, P.
2012-01-01
This paper develops strong solutions and stochastic solutions for the tempered fractional diffusion equation on bounded domains. First the eigenvalue problem for tempered fractional derivatives is solved. Then a separation of variables, and eigenfunction expansions in time and space, are used to write strong solutions. Finally, stochastic solutions are written in terms of an inverse subordinator.
Eigenvalues of the Transferences of Gaussian Optical Systems
Directory of Open Access Journals (Sweden)
W.F. Harris
2005-12-01
Full Text Available The problem of how to define an average eye leads to the question of what eigenvalues are possible for ray transferences. This paper examines the set of possible eigenvalues in the simplest possible case, that of optical systems consisting of elements that are stigmatic and centred on a common axis.
A subspace preconditioning algorithm for eigenvector/eigenvalue computation
Energy Technology Data Exchange (ETDEWEB)
Bramble, J.H.; Knyazev, A.V.; Pasciak, J.E.
1996-12-31
We consider the problem of computing a modest number of the smallest eigenvalues along with orthogonal bases for the corresponding eigen-spaces of a symmetric positive definite matrix. In our applications, the dimension of a matrix is large and the cost of its inverting is prohibitive. In this paper, we shall develop an effective parallelizable technique for computing these eigenvalues and eigenvectors utilizing subspace iteration and preconditioning. Estimates will be provided which show that the preconditioned method converges linearly and uniformly in the matrix dimension when used with a uniform preconditioner under the assumption that the approximating subspace is close enough to the span of desired eigenvectors.
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)
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.
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.
Solving the RPA eigenvalue equation in real-space
Muta, A; Hashimoto, Y; Yabana, K
2002-01-01
We present a computational method to solve the RPA eigenvalue equation employing a uniform grid representation in three-dimensional Cartesian coordinates. The conjugate gradient method is used for this purpose as an interactive method for a generalized eigenvalue problem. No construction of unoccupied orbitals is required in the procedure. We expect this method to be useful for systems lacking spatial symmetry to calculate accurate eigenvalues and transition matrix elements of a few low-lying excitations. Some applications are presented to demonstrate the feasibility of the method, considering the simplified mean-field model as an example of a nuclear physics system and the electronic excitations in molecules with time-dependent density functional theory as an example of an electronic system. (author)
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
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
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.
Eigenvalue distributions of Wilson loops
International Nuclear Information System (INIS)
Lohmayer, Robert
2010-01-01
In the first part of this thesis, we focus on the distribution of the eigenvalues of the unitary Wilson loop matrix in the two-dimensional case at arbitrary finite N. To characterize the distribution of the eigenvalues, we introduce three density functions (the ''symmetric'', the ''antisymmetric'', and the ''true'' eigenvalue density) which differ at finite N but possess the same infinite-N limit, exhibiting the Durhuus-Olesen phase transition. Using expansions of determinants and inverse determinants in characters of totally symmetric or totally antisymmetric representations of SU(N), the densities at finite N can be expressed in terms of simple sums involving only dimensions and quadratic Casimir invariants of certain irreducible representations of SU(N), allowing for a numerical computation of the densities at arbitrary N to any desired accuracy. We find that the true eigenvalue density, adding N oscillations to the monotonic symmetric density, is in some sense intermediate between the symmetric and the antisymmetric density, which in turn is given by a sum of N delta peaks located at the zeros of the average of the characteristic polynomial. Furthermore, we show that the dependence on N can be made explicit by deriving integral representations for the resolvents associated to the three eigenvalue densities. Using saddle-point approximations, we confirm that all three densities reduce to the Durhuus-Olesen result in the infinite-N limit. In the second part, we study an exponential form of the multiplicative random complex matrix model introduced by Gudowska-Nowak et al. Varying a parameter which can be identified with the area of the Wilson loop in the unitary case, the region of non-vanishing eigenvalue density of the N-dimensional complex product matrix undergoes a topological change at a transition point in the infinite-N limit. We study the transition by a detailed analysis of the average of the modulus square of the characteristic polynomial. Furthermore
Eigenvalue distributions of Wilson loops
Energy Technology Data Exchange (ETDEWEB)
Lohmayer, Robert
2010-07-01
In the first part of this thesis, we focus on the distribution of the eigenvalues of the unitary Wilson loop matrix in the two-dimensional case at arbitrary finite N. To characterize the distribution of the eigenvalues, we introduce three density functions (the ''symmetric'', the ''antisymmetric'', and the ''true'' eigenvalue density) which differ at finite N but possess the same infinite-N limit, exhibiting the Durhuus-Olesen phase transition. Using expansions of determinants and inverse determinants in characters of totally symmetric or totally antisymmetric representations of SU(N), the densities at finite N can be expressed in terms of simple sums involving only dimensions and quadratic Casimir invariants of certain irreducible representations of SU(N), allowing for a numerical computation of the densities at arbitrary N to any desired accuracy. We find that the true eigenvalue density, adding N oscillations to the monotonic symmetric density, is in some sense intermediate between the symmetric and the antisymmetric density, which in turn is given by a sum of N delta peaks located at the zeros of the average of the characteristic polynomial. Furthermore, we show that the dependence on N can be made explicit by deriving integral representations for the resolvents associated to the three eigenvalue densities. Using saddle-point approximations, we confirm that all three densities reduce to the Durhuus-Olesen result in the infinite-N limit. In the second part, we study an exponential form of the multiplicative random complex matrix model introduced by Gudowska-Nowak et al. Varying a parameter which can be identified with the area of the Wilson loop in the unitary case, the region of non-vanishing eigenvalue density of the N-dimensional complex product matrix undergoes a topological change at a transition point in the infinite-N limit. We study the transition by a detailed analysis of the average of the
Sorting waves and associated eigenvalues
Carbonari, Costanza; Colombini, Marco; Solari, Luca
2017-04-01
The presence of mixed sediment always characterizes gravel bed rivers. Sorting processes take place during bed load transport of heterogeneous sediment mixtures. The two main elements necessary to the occurrence of sorting are the heterogeneous character of sediments and the presence of an active sediment transport. When these two key ingredients are simultaneously present, the segregation of bed material is consistently detected both in the field [7] and in laboratory [3] observations. In heterogeneous sediment transport, bed altimetric variations and sorting always coexist and both mechanisms are independently capable of driving the formation of morphological patterns. Indeed, consistent patterns of longitudinal and transverse sorting are identified almost ubiquitously. In some cases, such as bar formation [2] and channel bends [5], sorting acts as a stabilizing effect and therefore the dominant mechanism driving pattern formation is associated with bed altimetric variations. In other cases, such as longitudinal streaks, sorting enhances system instability and can therefore be considered the prevailing mechanism. Bedload sheets, first observed by Khunle and Southard [1], represent another classic example of a morphological pattern essentially triggered by sorting, as theoretical [4] and experimental [3] results suggested. These sorting waves cause strong spatial and temporal fluctuations of bedload transport rate typical observed in gravel bed rivers. The problem of bed load transport of a sediment mixture is formulated in the framework of a 1D linear stability analysis. The base state consists of a uniform flow in an infinitely wide channel with active bed load transport. The behaviour of the eigenvalues associated with fluid motion, bed evolution and sorting processes in the space of the significant flow and sediment parameters is analysed. A comparison is attempted with the results of the theoretical analysis of Seminara Colombini and Parker [4] and Stecca
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
A nodal method applied to a diffusion problem with generalized coefficients
International Nuclear Information System (INIS)
Laazizi, A.; Guessous, N.
1999-01-01
In this paper, we consider second order neutrons diffusion problem with coefficients in L ∞ (Ω). Nodal method of the lowest order is applied to approximate the problem's solution. The approximation uses special basis functions in which the coefficients appear. The rate of convergence obtained is O(h 2 ) in L 2 (Ω), with a free rectangular triangulation. (authors)
Polyanin, A. D.; Sorokin, V. G.
2017-12-01
The paper deals with nonlinear reaction-diffusion equations with one or several delays. We formulate theorems that allow constructing exact solutions for some classes of these equations, which depend on several arbitrary functions. Examples of application of these theorems for obtaining new exact solutions in elementary functions are provided. We state basic principles of construction, selection, and use of test problems for nonlinear partial differential equations with delay. Some test problems which can be suitable for estimating accuracy of approximate analytical and numerical methods of solving reaction-diffusion equations with delay are presented. Some examples of numerical solutions of nonlinear test problems with delay are considered.
International Nuclear Information System (INIS)
Kubaschewski, O.
1983-01-01
The diffusion rate values of titanium, its compounds and alloys are summarized and tabulated. The individual chemical diffusion coefficients and self-diffusion coefficients of certain isotopes are given. Experimental methods are listed which were used for the determination of diffusion coefficients. Some values have been taken over from other studies. Also given are graphs showing the temperature dependences of diffusion and changes in the diffusion coefficient with concentration changes
How to approximate the heat equation with Neumann boundary conditions by nonlocal diffusion problems
Cortazar, C.; Elgueta, M.; Rossi, J. D.; Wolanski, N.
2006-01-01
We present a model for nonlocal diffusion with Neumann boundary conditions in a bounded smooth domain prescribing the flux through the boundary. We study the limit of this family of nonlocal diffusion operators when a rescaling parameter related to the kernel of the nonlocal operator goes to zero. We prove that the solutions of this family of problems converge to a solution of the heat equation with Neumann boundary conditions.
First-Order Hyperbolic System Method for Time-Dependent Advection-Diffusion Problems
2014-03-01
accuracy, with rapid convergence over each physical time step, typically less than five Newton iter - ations. 1 Contents 1 Introduction 3 2 Hyperbolic...however, we employ the Gauss - Seidel (GS) relaxation, which is also an O(N) method for the discretization arising from hyperbolic advection-diffusion system...advection-diffusion scheme. The linear dependency of the iterations on Table 1: Boundary layer problem ( Convergence criteria: Residuals < 10−8.) log10Re
Shape functions for separable solutions to cross-field diffusion problems
International Nuclear Information System (INIS)
Luning, C.D.; Perry, W.L.
1984-01-01
The shape function S(x), which arises in the study of nonlinear diffusion for cross-field diffusion in plasmas, satisfies the equation S''(x)+lambdaa(x)S/sup α/(x) = 0, 0 0. In the cases of physical interest a(x) possesses an integrable singularity at some point in (0,1) but is otherwise continuous. Existence of a positive solution to this problem is established
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.
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
The problem of birth of autowaves in parabolic systems with small diffusion
International Nuclear Information System (INIS)
Kolesov, A Yu; Rozov, N Kh; Sadovnichii, V A
2007-01-01
A parabolic reaction-diffusion system with zero Neumann boundary conditions at the end-points of a finite interval is considered under the following basic assumptions. First, the matrix diffusion coefficient in the system is proportional to a small parameter ε>0, and the system itself possesses a spatially homogeneous cycle (independent of the space variable) of amplitude of order √ε born by a zero equilibrium at an Andronov-Hopf bifurcation. Second, it is assumed that the matrix diffusion depends on an additional small parameter μ≥0, and for μ=0 there occurs in the stability problem for the homogeneous cycle the critical case of characteristic multiplier 1 of multiplicity 2 without Jordan block. Under these constraints and for independently varied parameters ε and μ the problem of the existence and the stability of spatially inhomogeneous auto-oscillations branching from the homogeneous cycle is analysed. Bibliography: 16 titles.
Discrete maximum principle for FE solutions of the diffusion-reaction problem on prismatic meshes
Czech Academy of Sciences Publication Activity Database
Hannukainen, A.; Korotov, S.; Vejchodský, Tomáš
2009-01-01
Roč. 226, č. 2 (2009), s. 275-287 ISSN 0377-0427 R&D Projects: GA AV ČR IAA100760702 Institutional research plan: CEZ:AV0Z10190503 Keywords : diffusion-reaction problem * maximum principle * prismatic finite elements Subject RIV: BA - General Mathematics Impact factor: 1.292, year: 2009
The Induced Dimension Reduction method applied to convection-diffusion-reaction problems
Astudillo, R.; Van Gijzen, M.B.
2016-01-01
Discretization of (linearized) convection-diffusion-reaction problems yields a large and sparse non symmetric linear system of equations, Ax = b. (1) In this work, we compare the computational behavior of the Induced Dimension Reduction method (IDR(s)) [10], with other short-recurrences Krylov
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
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.)
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
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.
Nefedov, Nikolay
2017-02-01
This is an extended variant of the paper presented at MURPHYS-HSFS 2016 conference in Barcelona. We discuss further development of the asymptotic method of differential inequalities to investigate existence and stability of sharp internal layers (fronts) for nonlinear singularly perturbed periodic parabolic problems and initial boundary value problems with blow-up of fronts for reaction-diffusion-advection equations. In particular, we consider periodic solutions with internal layer in the case of balanced reaction. For the initial boundary value problems we prove the existence of fronts and give their asymptotic approximation including the new case of blowing-up fronts. This case we illustrate by the generalised Burgers equation.
Development of a coarse mesh code for the solution of two group static diffusion problems
International Nuclear Information System (INIS)
Barros, R.C. de.
1985-01-01
This new coarse mesh code designed for the solution of 2 and 3 dimensional static diffusion problems, is based on an alternating direction method which consists in the solution of one dimensional problem along each coordinate direction with leakage terms for the remaining directions estimated from previous interactions. Four versions of this code have been developed: AD21 - 2D - 1/4, AD21 - 2D - 4/4, AD21 - 3D - 1/4 and AD21 - 3D - 4/4; these versions have been designed for 2 and 3 dimensional problems with or without 1/4 symmetry. (Author) [pt
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.
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)
Nonlinear acceleration of transport criticality problems
International Nuclear Information System (INIS)
Park, H.; Knoll, D.A.; Newman, C.K.
2011-01-01
We present a nonlinear acceleration algorithm for the transport criticality problem. The algorithm combines the well-known nonlinear diffusion acceleration (NDA) with a recently developed, Newton-based, nonlinear criticality acceleration (NCA) algorithm. The algorithm first employs the NDA to reduce the system to scalar flux, then the NCA is applied to the resulting drift-diffusion system. We apply a nonlinear elimination technique to eliminate the eigenvalue from the Jacobian matrix. Numerical results show that the algorithm reduces the CPU time a factor of 400 in a very diffusive system, and a factor of 5 in a non-diffusive system. (author)
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.
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
Chen, Meng-Huo; Greenbaum, Anne
2015-01-01
Summary: A two-grid convergence analysis based on the paper [Algebraic analysis of aggregation-based multigrid, by A. Napov and Y. Notay, Numer. Lin. Alg. Appl. 18 (2011), pp. 539-564] is derived for various aggregation schemes applied to a finite element discretization of a rotated anisotropic diffusion equation. As expected, it is shown that the best aggregation scheme is one in which aggregates are aligned with the anisotropy. In practice, however, this is not what automatic aggregation procedures do. We suggest approaches for determining appropriate aggregates based on eigenvectors associated with small eigenvalues of a block splitting matrix or based on minimizing a quantity related to the spectral radius of the iteration matrix. © 2015 John Wiley & Sons, Ltd.
Chen, Meng-Huo
2015-03-18
Summary: A two-grid convergence analysis based on the paper [Algebraic analysis of aggregation-based multigrid, by A. Napov and Y. Notay, Numer. Lin. Alg. Appl. 18 (2011), pp. 539-564] is derived for various aggregation schemes applied to a finite element discretization of a rotated anisotropic diffusion equation. As expected, it is shown that the best aggregation scheme is one in which aggregates are aligned with the anisotropy. In practice, however, this is not what automatic aggregation procedures do. We suggest approaches for determining appropriate aggregates based on eigenvectors associated with small eigenvalues of a block splitting matrix or based on minimizing a quantity related to the spectral radius of the iteration matrix. © 2015 John Wiley & Sons, Ltd.
An iterative algorithm for the finite element approximation to convection-diffusion problems
International Nuclear Information System (INIS)
Buscaglia, Gustavo; Basombrio, Fernando
1988-01-01
An iterative algorithm for steady convection-diffusion is presented, which avoids unsymmetric matrices by means of an equivalent mixed formulation. Upwind is introduced by adding a balancing dissipation in the flow direction, but there is no dependence of the global matrix on the velocity field. Convergence is shown in habitual test cases. Advantages of its use in coupled calculation of more complex problems are discussed. (Author)
Moving-boundary problems for the time-fractional diffusion equation
Directory of Open Access Journals (Sweden)
Sabrina D. Roscani
2017-02-01
Full Text Available We consider a one-dimensional moving-boundary problem for the time-fractional diffusion equation. The time-fractional derivative of order $\\alpha\\in (0,1$ is taken in the sense of Caputo. We study the asymptotic behaivor, as t tends to infinity, of a general solution by using a fractional weak maximum principle. Also, we give some particular exact solutions in terms of Wright functions.
International Nuclear Information System (INIS)
Kim, M.G.
1980-01-01
The multigroup neutron diffusion equations with the constraint of specified power distributions are investigated by the application of the straight-line method which can be considered as the limiting case of zero mesh space in the finite difference method. The standard partial differential form of the diffusion equation is reduced to sets of ordinary differential equations and then converted into sets of integral equations by using Green's functions defined on the pseudo straight lines. Coupling of each straight line to the adjacent lines arises from the application of a three-point central difference formula. The interfaces encountered between two regions are taken into account by imposing the continuity conditions for the grown fluxes and net currents with Taylor expansions of internal fluxes at the interface positions. A few sample problems are selected to test the validity of the method. It is found that the proposed method of solution is similar to the finite Fourier sine transform. Numerical results for the solutions obtained by the method of straight lines are compared with the results of the exact analytical solutions for simple geometries. These comparisons indicate that the proposed method is compatible with the analytical method, and in some problems considered the straight-line solutions are much more efficient than the exact solutions. The method is also extended to the reactor kinetics problem by expressing the kinetics parameters in terms of the basis functions which are used to obtain the solutions of the steady-state neutron diffusion equations
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)
Two-dimensional boundary-value problem for ion-ion diffusion
International Nuclear Information System (INIS)
Tuszewski, M.; Lichtenberg, A.J.
1977-01-01
Like-particle diffusion is usually negligible compared with unlike-particle diffusion because it is two orders higher in spatial derivatives. When the ratio of the ion gyroradius to the plasma transverse dimension is of the order of the fourth root of the mass ratio, previous one-dimensional analysis indicated that like-particle diffusion is significant. A two-dimensional boundary-value problem for ion-ion diffusion is investigated. Numerical solutions are found with models for which the nonlinear partial differential equation reduces to an ordinary fourth-order differential equation. These solutions indicate that the ion-ion losses are higher by a factor of six for a slab geometry, and by a factor of four for circular geometry, than estimated from dimensional analysis. The solutions are applied to a multiple mirror experiment stabilized with a quadrupole magnetic field which generates highly elliptical flux surfaces. It is found that the ion-ion losses dominate the electron-ion losses and that these classical radial losses contribute to a significant decrease of plasma lifetime, in qualitiative agreement with the experimental results
Total variation regularization for a backward time-fractional diffusion problem
International Nuclear Information System (INIS)
Wang, Liyan; Liu, Jijun
2013-01-01
Consider a two-dimensional backward problem for a time-fractional diffusion process, which can be considered as image de-blurring where the blurring process is assumed to be slow diffusion. In order to avoid the over-smoothing effect for object image with edges and to construct a fast reconstruction scheme, the total variation regularizing term and the data residual error in the frequency domain are coupled to construct the cost functional. The well posedness of this optimization problem is studied. The minimizer is sought approximately using the iteration process for a series of optimization problems with Bregman distance as a penalty term. This iteration reconstruction scheme is essentially a new regularizing scheme with coupling parameter in the cost functional and the iteration stopping times as two regularizing parameters. We give the choice strategy for the regularizing parameters in terms of the noise level of measurement data, which yields the optimal error estimate on the iterative solution. The series optimization problems are solved by alternative iteration with explicit exact solution and therefore the amount of computation is much weakened. Numerical implementations are given to support our theoretical analysis on the convergence rate and to show the significant reconstruction improvements. (paper)
The measurement problem on classical diffusion process: inverse method on stochastic processes
International Nuclear Information System (INIS)
Bigerelle, M.; Iost, A.
2004-01-01
In a high number of diffusive systems, measures are processed to calculate material parameters such as diffusion coefficients, or to verify the accuracy of mathematical models. However, the precision of the parameter determination or of the model relevance depends on the location of the measure itself. The aim of this paper is first to analyse, for a mono-dimensional system, the precision of the measure in relation with its location by an inverse problem algorithm and secondly to examine the physical meaning of the results. Statistical mechanic considerations show that, passing over a time-distance criterion, measurement becomes uncertain whatever the initial conditions. The criterion proves that this chaotic mode is related to the production of anti-entropy at a mesoscopique scale that is in violation to quantum theory about measurement
Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems
Almeida, Regina C.
2010-08-01
A goal-oriented analysis of linear, stochastic advection-diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem. © 2010 Elsevier B.V.
Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems
Almeida, Regina C.; Oden, J. Tinsley
2010-01-01
A goal-oriented analysis of linear, stochastic advection-diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem. © 2010 Elsevier B.V.
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.
International Nuclear Information System (INIS)
Cartier, J.
2006-04-01
This thesis focuses on mathematical analysis, numerical resolution and modelling of the transport equations. First of all, we deal with numerical approximation of the solution of the transport equations by using a mixed-hybrid scheme. We derive and study a mixed formulation of the transport equation, then we analyse the related variational problem and present the discretization and the main properties of the scheme. We particularly pay attention to the behavior of the scheme and we show its efficiency in the diffusion limit (when the mean free path is small in comparison with the characteristic length of the physical domain). We present academical benchmarks in order to compare our scheme with other methods in many physical configurations and validate our method on analytical test cases. Unstructured and very distorted meshes are used to validate our scheme. The second part of this thesis deals with two transport problems. The first one is devoted to the study of diffusion due to boundary conditions in a transport problem between two plane plates. The second one consists in modelling and simulating radiative transfer phenomenon in case of the industrial context of inertial confinement fusion. (author)
Conjugate Gradient like methods and their application to fixed source neutron diffusion problems
International Nuclear Information System (INIS)
Suetomi, Eiichi; Sekimoto, Hiroshi
1989-01-01
This paper presents a number of fast iterative methods for solving systems of linear equations appearing in fixed source problems for neutron diffusion. We employed the conjugate gradient and conjugate residual methods. In order to accelerate the conjugate residual method, we proposed the conjugate residual squared method by transforming the residual polynomial of the conjugate residual method. Since the convergence of these methods depends on the spectrum of coefficient matrix, we employed the incomplete Choleski (IC) factorization and the modified IC (MIC) factorization as preconditioners. These methods were applied to some neutron diffusion problems and compared with the successive overrelaxation (SOR) method. The results of these numerical experiments showed superior convergence characteristics of the conjugate gradient like method with MIC factorization to the SOR method, especially for a problem involving void region. The CPU time of the MICCG, MICCR and MICCRS methods showed no great difference. In order to vectorize the conjugate gradient like methods based on (M)IC factorization, the hyperplane method was used and implemented on the vector computers, the HITAC S-820/80 and ETA10-E (one processor mode). Significant decrease of the CPU times was observed on the S-820/80. Since the scaled conjugate gradient (SCG) method can be vectorized with no manipulation, it was also compared with the above methods. It turned out the SCG method was the fastest with respect to the CPU times on the ETA10-E. These results suggest that one should implement suitable algorithm for different vector computers. (author)
[Outstanding problems of normal and pathological morphology of the diffuse endocrine system].
Iaglov, V V; Iaglova, N V
2011-01-01
The diffuse endocrine system (DES)--a mosaic-cellular endoepithelial gland--is the biggest part of the human endocrine system. Scientists used to consider cells of DES as neuroectodermal. According to modem data cells of DES are different cytogenetic types because they develop from the different embryonic blastophyllum. So that any hormone-active tumors originated from DES of the digestive, respiratory and urogenital system shouldn't be considered as neuroendocrinal tumors. The basic problems of DES morphology and pathology are the creation of scientifically substantiated histogenetic classification of DES tumors.
On one model problem for the reaction-diffusion-advection equation
Davydova, M. A.; Zakharova, S. A.; Levashova, N. T.
2017-09-01
The asymptotic behavior of the solution with boundary layers in the time-independent mathematical model of reaction-diffusion-advection arising when describing the distribution of greenhouse gases in the surface atmospheric layer is studied. On the basis of the asymptotic method of differential inequalities, the existence of a boundary-layer solution and its asymptotic Lyapunov stability as a steady-state solution of the corresponding parabolic problem is proven. One of the results of this work is the determination of the local domain of the attraction of a boundary-layer solution.
Exact and approximate interior corner problem in neutron diffusion by integral transform methods
International Nuclear Information System (INIS)
Bareiss, E.H.; Chang, K.S.J.; Constatinescu, D.A.
1976-09-01
The mathematical solution of the neutron diffusion equation exhibits singularities in its derivatives at material corners. A mathematical treatment of the nature of these singularities and its impact on coarse network approximation methods in computational work is presented. The mathematical behavior is deduced from Green's functions, based on a generalized theory for two space dimensions, and the resulting systems of integral equations, as well as from the Kontorovich--Lebedev Transform. The effect on numerical calculations is demonstrated for finite difference and finite element methods for a two-region corner problem
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
Energy Technology Data Exchange (ETDEWEB)
Couto, Nozimar do
2003-07-01
Diffusion theory is traditionally applied to nuclear reactor global calculations. Based on the good results generated by the one-dimensional spectral nodal diffusion (SND) method for benchmark problems, we offer the SND method for nuclear reactor global calculations in X,Y geometry. In this method, the continuity equation and Flick law are transverse integrated in each spatial direction leading to a system of two 'one-dimensional' equations coupled by the transverse leakage terms. We then apply the SND method to numerically solve this system with constant approximations for the transverse leakage terms. We perform a spectral analysis to determine the local general solution of each 'one-dimensional' nodal equation with flat approximation for the transverse leakages. We used special auxiliary equations with parameters that are to be determined in order to preserve the analytical general solutions in the numerical algorithm. By considering continuity conditions at the node interfaces and appropriate boundary conditions, we obtain a solvable system of discretized equations involving the node-edge average scalar fluxes at each estimate of the dominant eigenvalue (k{sub eff}) in the outer power iterations. As we considered approximations to the transverse leakages, the SND method is not free of spatial truncation errors. Nevertheless, it generated good results for the typical model problems that we considered. (author)
Energy Technology Data Exchange (ETDEWEB)
Couto, Nozimar do
2003-07-01
Diffusion theory is traditionally applied to nuclear reactor global calculations. Based on the good results generated by the one-dimensional spectral nodal diffusion (SND) method for benchmark problems, we offer the SND method for nuclear reactor global calculations in X,Y geometry. In this method, the continuity equation and Flick law are transverse integrated in each spatial direction leading to a system of two 'one-dimensional' equations coupled by the transverse leakage terms. We then apply the SND method to numerically solve this system with constant approximations for the transverse leakage terms. We perform a spectral analysis to determine the local general solution of each 'one-dimensional' nodal equation with flat approximation for the transverse leakages. We used special auxiliary equations with parameters that are to be determined in order to preserve the analytical general solutions in the numerical algorithm. By considering continuity conditions at the node interfaces and appropriate boundary conditions, we obtain a solvable system of discretized equations involving the node-edge average scalar fluxes at each estimate of the dominant eigenvalue (k{sub eff}) in the outer power iterations. As we considered approximations to the transverse leakages, the SND method is not free of spatial truncation errors. Nevertheless, it generated good results for the typical model problems that we considered. (author)
Broadband Utilization of Eigenvalue Techniques
Directory of Open Access Journals (Sweden)
Z. Kus
1996-06-01
Full Text Available A large number of signal processing problems are concerned with estimating unknown parameters from sensor array measurement. This paper presents simple algorithm for estimating spatio-temporal spectrum of signals received by passive array derivated from MUSIC algorithm, based on eigenstructure of covariance matrices of received signals. Some simulation results are presented.
Boundary element methods applied to two-dimensional neutron diffusion problems
International Nuclear Information System (INIS)
Itagaki, Masafumi
1985-01-01
The Boundary element method (BEM) has been applied to two-dimensional neutron diffusion problems. The boundary integral equation and its discretized form have been derived. Some numerical techniques have been developed, which can be applied to critical and fixed-source problems including multi-region ones. Two types of test programs have been developed according to whether the 'zero-determinant search' or the 'source iteration' technique is adopted for criticality search. Both programs require only the fluxes and currents on boundaries as the unknown variables. The former allows a reduction in computing time and memory in comparison with the finite element method (FEM). The latter is not always efficient in terms of computing time due to the domain integral related to the inhomogeneous source term; however, this domain integral can be replaced by the equivalent boundary integral for a region with a non-multiplying medium or with a uniform source, resulting in a significant reduction in computing time. The BEM, as well as the FEM, is well suited for solving irregular geometrical problems for which the finite difference method (FDM) is unsuited. The BEM also solves problems with infinite domains, which cannot be solved by the ordinary FEM and FDM. Some simple test calculations are made to compare the BEM with the FEM and FDM, and discussions are made concerning the relative merits of the BEM and problems requiring future solution. (author)
International Nuclear Information System (INIS)
Leaf, G.K.; Minkoff, M.
1982-01-01
1 - Description of problem or function: DISPL1 is a software package for solving second-order nonlinear systems of partial differential equations including parabolic, elliptic, hyperbolic, and some mixed types. The package is designed primarily for chemical kinetics- diffusion problems, although not limited to these problems. Fairly general nonlinear boundary conditions are allowed as well as inter- face conditions for problems in an inhomogeneous medium. The spatial domain is one- or two-dimensional with rectangular Cartesian, cylindrical, or spherical (in one dimension only) geometry. 2 - Method of solution: The numerical method is based on the use of Galerkin's procedure combined with the use of B-Splines (C.W.R. de-Boor's B-spline package) to generate a system of ordinary differential equations. These equations are solved by a sophisticated ODE software package which is a modified version of Hindmarsh's GEAR package, NESC Abstract 592. 3 - Restrictions on the complexity of the problem: The spatial domain must be rectangular with sides parallel to the coordinate geometry. Cross derivative terms are not permitted in the PDE. The order of the B-Splines is at most 12. Other parameters such as the number of mesh points in each coordinate direction, the number of PDE's etc. are set in a macro table used by the MORTRAn2 preprocessor in generating the object code
Comparison of finite-difference and variational solutions to advection-diffusion problems
International Nuclear Information System (INIS)
Lee, C.E.; Washington, K.E.
1984-01-01
Two numerical solution methods are developed for 1-D time-dependent advection-diffusion problems on infinite and finite domains. Numerical solutions are compared with analytical results for constant coefficients and various boundary conditions. A finite-difference spectrum method is solved exactly in time for periodic boundary conditions by a matrix operator method and exhibits excellent accuracy compared with other methods, especially at late times, where it is also computationally more efficient. Finite-system solutions are determined from a conservational variational principle with cubic spatial trial functions and solved in time by a matrix operator method. Comparisons of problems with few nodes show excellent agreement with analytical solutions and exhibit the necessity of implementing Lagrangian conservational constraints for physically-correct solutions. (author)
Shakir, Muhammad
2011-12-01
In this paper, we introduce a new detector referred to as Geometric mean detector (GEMD) which is based on the ratio of the largest eigenvalue to the Geometric mean of the eigenvalues for collaborative spectrum sensing. The decision threshold has been derived by employing Gaussian approximation approach. In this approach, the two random variables, i.e. The largest eigenvalue and the Geometric mean of the eigenvalues are considered as independent Gaussian random variables such that their cumulative distribution functions (CDFs) are approximated by a univariate Gaussian distribution function for any number of cooperating secondary users and received samples. The approximation approach is based on the calculation of exact analytical moments of the largest eigenvalue and the Geometric mean of the eigenvalues of the received covariance matrix. The decision threshold has been calculated by exploiting the CDF of the ratio of two Gaussian distributed random variables. In this context, we exchange the analytical moments of the two random variables with the moments of the Gaussian distribution function. The performance of the detector is compared with the performance of the energy detector and eigenvalue ratio detector. Analytical and simulation results show that our newly proposed detector yields considerable performance advantage in realistic spectrum sensing scenarios. Moreover, our results based on proposed approximation approach are in perfect agreement with the empirical results. © 2011 IEEE.
A new approach to the problem of bulk-mediated surface diffusion.
Berezhkovskii, Alexander M; Dagdug, Leonardo; Bezrukov, Sergey M
2015-08-28
This paper is devoted to bulk-mediated surface diffusion of a particle which can diffuse both on a flat surface and in the bulk layer above the surface. It is assumed that the particle is on the surface initially (at t = 0) and at time t, while in between it may escape from the surface and come back any number of times. We propose a new approach to the problem, which reduces its solution to that of a two-state problem of the particle transitions between the surface and the bulk layer, focusing on the cumulative residence times spent by the particle in the two states. These times are random variables, the sum of which is equal to the total observation time t. The advantage of the proposed approach is that it allows for a simple exact analytical solution for the double Laplace transform of the conditional probability density of the cumulative residence time spent on the surface by the particle observed for time t. This solution is used to find the Laplace transform of the particle mean square displacement and to analyze the peculiarities of its time behavior over the entire range of time. We also establish a relation between the double Laplace transform of the conditional probability density and the Fourier-Laplace transform of the particle propagator over the surface. The proposed approach treats the cases of both finite and infinite bulk layer thicknesses (where bulk-mediated surface diffusion is normal and anomalous at asymptotically long times, respectively) on equal footing.
Energy Technology Data Exchange (ETDEWEB)
Xu, Z., E-mail: zhanjie.xu@kit.ed [Forschungszentrum Karlsruhe, P.O. Box 3640, 76021 Karlsruhe (Germany); Travis, J.R. [Ingenieurbuero DuBois-Pitzer-Travis, 63071 Offenbach (Germany); Breitung, W.; Jordan, T. [Forschungszentrum Karlsruhe, P.O. Box 3640, 76021 Karlsruhe (Germany)
2010-12-15
Potentially explosive dust aerosol mobilization in the vacuum vessel is an important safety issue of the ITER facility, especially in scenarios of loss of vacuum accidents. Therefore dust mobilization modeling is ongoing in Research Center Karlsuhe. At first the aerosol particle model in the GASFLOW computer code is introduced briefly. To verify the particle model, a series of particle diffusion problems are simulated in one-, two- and three-dimensions. In each problem a particle source is initially exposed to an advective gas flow. Then a dust cloud is formed in the down stream. To obtain the theoretical solution about the particle concentration in the dust cloud, the governing diffusion partial differential equations with an additional advection term are solved by using Green's function method. Different spatial and temporal characters about the particle sources are also considered, e.g., instantaneous or continuous sources, line, or volume sources and so forth. The GASFLOW simulation results about the particle concentrations and the corresponding Green's function solutions are compared case by case. Very good agreements are found between the theoretical solutions and the GASGLOW simulations, when the drag force between the micron-sized particles and the conveying gas flow meets the Stokes' law about resistance. This situation is corresponding to a very small Reynolds number based on the particle diameter, with a negligible inertia effect of the particles. This verification work shows that the particle model of the GASFLOW code can reproduce numerically particle transport and diffusion in a good way.
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
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)
Eigenvalues and expansion of bipartite graphs
DEFF Research Database (Denmark)
Høholdt, Tom; Janwa, Heeralal
2012-01-01
We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...
Analysis of eigenvalue correction applied to biometrics
Hendrikse, A.J.; Veldhuis, Raymond N.J.; Spreeuwers, Lieuwe Jan; Bazen, A.M.
Eigenvalue estimation plays an important role in biometrics. However, if the number of samples is limited, estimates are significantly biased. In this article we analyse the influence of this bias on the error rates of PCA/LDA based verification systems, using both synthetic data with realistic
A 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.
Transmission eigenvalues and thermoacoustic tomography
International Nuclear Information System (INIS)
Finch, David; Hickmann, Kyle S
2013-01-01
The spectrum of the interior transmission problem is related to the unique determination of the acoustic properties of a body in thermoacoustic imaging. Under a non-trapping hypothesis, we show that sparsity of the interior transmission spectrum implies a range separation condition for the thermoacoustic operator. In odd dimensions greater than or equal to 3, we prove that the interior transmission spectrum for a pair of radially symmetric non-trapping sound speeds is countable, and conclude that the ranges of the associated thermoacoustic maps have only trivial intersection. (paper)
Solution of two energy-group neutron diffusion equation by triangular elements
International Nuclear Information System (INIS)
Correia Filho, A.
1981-01-01
The application of the triangular finite elements of first order in the solution of two energy-group neutron diffusion equation in steady-state conditions is aimed at. The EFTDN (triangular finite elements in neutrons diffusion) computer code in FORTRAN IV language is developed. The discrete formulation of the diffusion equation is obtained applying the Galerkin method. The power method is used to solve the eigenvalues' problem and the convergence is accelerated through the use of Chebshev polynomials. For the equation systems solution the Gauss method is applied. The results of the analysis of two test-problems are presented. (Author) [pt
International Nuclear Information System (INIS)
Zhang, M.; Takeda, M.; Nakajima, H.
2006-01-01
Laboratory diffusion testing as well as batch experiments are well established and widely adopted techniques for characterizing the diffusive and adsorptive properties of geological, geotechnical, and synthetic materials in both scientific and applied fields, including geological disposal of radioactive waste. Although several types of diffusion test, such as the through- diffusion test, in-diffusion test, out-diffusion test, and column test, are currently available, different methods may have different advantages and disadvantages. In addition, traditional methods may have limitations, such as the need for relatively long test times, cumbersome test procedures, and the possibility of errors due to differences between analytical assumptions and actual test conditions. Furthermore, traditional batch experiments using mineral powders are known to overestimate the sorption coefficient. In part 1 of this report, we present a brief overview of laboratory diffusion and batch experiments. The advantages, disadvantages, limitations, and/or potential problems associated with individual tests were compared and summarized. This comprehensive report will provide practical references for reviewing the results obtained from relevant experiments, especially from the viewpoint of regulation. To solve and/or eliminate the potential problems associated with conventional methods, and to obtain the diffusion coefficient and rock capacity factor from a laboratory test both rapidly and accurately, part 2 of this study discusses possible strategies involving the development of rigorous solutions to some relevant test methods, and sensitivity analyses for the related tests that may be helpful to judge the accuracy of the two parameters to be determined from individual tests. (authors)
Li, Zhiyuan; Yamamoto, Masahiro
2014-01-01
This article proves the uniqueness for two kinds of inverse problems of identifying fractional orders in diffusion equations with multiple time-fractional derivatives by pointwise observation. By means of eigenfunction expansion and Laplace transform, we reduce the uniqueness for our inverse problems to the uniqueness of expansions of some special function and complete the proof.
Yuste, S Bravo; Borrego, R; Abad, E
2010-02-01
We consider various anomalous d -dimensional diffusion problems in the presence of an absorbing boundary with radial symmetry. The motion of particles is described by a fractional diffusion equation. Their mean-square displacement is given by r(2) proportional, variant t(gamma)(0divergent series appear when the concentration or survival probabilities are evaluated via the method of separation of variables. While the solution for normal diffusion problems is, at most, divergent as t-->0 , the emergence of such series in the long-time domain is a specific feature of subdiffusion problems. We present a method to regularize such series, and, in some cases, validate the procedure by using alternative techniques (Laplace transform method and numerical simulations). In the normal diffusion case, we find that the signature of the initial condition on the approach to the steady state rapidly fades away and the solution approaches a single (the main) decay mode in the long-time regime. In remarkable contrast, long-time memory of the initial condition is present in the subdiffusive case as the spatial part Psi1(r) describing the long-time decay of the solution to the steady state is determined by a weighted superposition of all spatial modes characteristic of the normal diffusion problem, the weight being dependent on the initial condition. Interestingly, Psi1(r) turns out to be independent of the anomalous diffusion exponent gamma .
Uniqueness for cross-diffusion systems issuing from seawater intrusion problems
Directory of Open Access Journals (Sweden)
Catherine Choquet
2017-10-01
Full Text Available We consider a model mixing sharp and diffuse interface approaches for seawater intrusion phenomenons in confined and unconfined aquifers. More precisely, a phase field model is introduced in the boundary conditions on the virtual sharp interfaces. We thus include in the model the existence of diffuse transition zones but we preserve the simplified structure allowing front tracking. The three-dimensional problem then reduces to a two-dimensional model involving a strongly coupled system of partial differential equations of parabolic and elliptic type describing the evolution of the depth of the interface between salt- and freshwater and the evolution of the freshwater hydraulic head. Assuming a low hydraulic conductivity inside the aquifer, we prove the uniqueness of a weak solution for the model completed with initial and boundary conditions. Thanks to a generalization of a Meyer's regularity result, we establish that the gradient of the solution belongs to the space $L^r$, r>2. This additional regularity combined with the Gagliardo-Nirenberg inequality for r=4 allows to handle the nonlinearity of the system in the proof of uniqueness.
The self-similar field and its application to a diffusion problem
International Nuclear Information System (INIS)
Michelitsch, Thomas M
2011-01-01
We introduce a continuum approach which accounts for self-similarity as a symmetry property of an infinite medium. A self-similar Laplacian operator is introduced which is the source of self-similar continuous fields. In this way ‘self-similar symmetry’ appears in an analogous manner as transverse isotropy or cubic symmetry of a medium. As a consequence of the self-similarity the Laplacian is a non-local fractional operator obtained as the continuum limit of the discrete self-similar Laplacian introduced recently by Michelitsch et al (2009 Phys. Rev. E 80 011135). The dispersion relation of the Laplacian and its Green’s function is deduced in closed forms. As a physical application of the approach we analyze a self-similar diffusion problem. The statistical distributions, which constitute the solutions of this problem, turn out to be Lévi-stable distributions with infinite variances characterizing the statistics of one-dimensional Lévi flights. The self-similar continuum approach introduced in this paper has the potential to be applied on a variety of scale invariant and fractal problems in physics such as in continuum mechanics, electrodynamics and in other fields. (paper)
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.
International Nuclear Information System (INIS)
Kuzovkov, V N
2011-01-01
The goal of this paper is twofold. First, based on the interpretation of a quantum tight-binding model in terms of a classical Hamiltonian map, we consider the Anderson localization (AL) problem as the Fermi-Pasta-Ulam (FPU) effect in a modified dynamical system containing both stable and unstable (inverted) modes. Delocalized states in the AL are analogous to the stable quasi-periodic motion in FPU, whereas localized states are analogous to thermalization, respectively. The second aim is to use the classical Hamilton map for a simplified derivation of exact equations for the localization operator H(z). The latter was presented earlier (Kuzovkov et al 2002 J. Phys.: Condens. Matter 14 13777) treating the AL as a generalized diffusion in a dynamical system. We demonstrate that counter-intuitive results of our studies of the AL are similar to the FPU counter-intuitivity.
International Nuclear Information System (INIS)
Wang, Wenyan; Han, Bo; Yamamoto, Masahiro
2013-01-01
We propose a new numerical method for reproducing kernel Hilbert space to solve an inverse source problem for a two-dimensional fractional diffusion equation, where we are required to determine an x-dependent function in a source term by data at the final time. The exact solution is represented in the form of a series and the approximation solution is obtained by truncating the series. Furthermore, a technique is proposed to improve some of the existing methods. We prove that the numerical method is convergent under an a priori assumption of the regularity of solutions. The method is simple to implement. Our numerical result shows that our method is effective and that it is robust against noise in L 2 -space in reconstructing a source function. (paper)
Kuzovkov, V. N.
2011-12-01
The goal of this paper is twofold. First, based on the interpretation of a quantum tight-binding model in terms of a classical Hamiltonian map, we consider the Anderson localization (AL) problem as the Fermi-Pasta-Ulam (FPU) effect in a modified dynamical system containing both stable and unstable (inverted) modes. Delocalized states in the AL are analogous to the stable quasi-periodic motion in FPU, whereas localized states are analogous to thermalization, respectively. The second aim is to use the classical Hamilton map for a simplified derivation of exact equations for the localization operator H(z). The latter was presented earlier (Kuzovkov et al 2002 J. Phys.: Condens. Matter 14 13777) treating the AL as a generalized diffusion in a dynamical system. We demonstrate that counter-intuitive results of our studies of the AL are similar to the FPU counter-intuitivity.
Eigenvalue routines in NASTRAN: A comparison with the Block Lanczos method
Tischler, V. A.; Venkayya, Vipperla B.
1993-01-01
The NASA STRuctural ANalysis (NASTRAN) program is one of the most extensively used engineering applications software in the world. It contains a wealth of matrix operations and numerical solution techniques, and they were used to construct efficient eigenvalue routines. The purpose of this paper is to examine the current eigenvalue routines in NASTRAN and to make efficiency comparisons with a more recent implementation of the Block Lanczos algorithm by Boeing Computer Services (BCS). This eigenvalue routine is now available in the BCS mathematics library as well as in several commercial versions of NASTRAN. In addition, CRAY maintains a modified version of this routine on their network. Several example problems, with a varying number of degrees of freedom, were selected primarily for efficiency bench-marking. Accuracy is not an issue, because they all gave comparable results. The Block Lanczos algorithm was found to be extremely efficient, in particular, for very large size problems.
Liu, Yikan
2015-01-01
In this paper, we establish a strong maximum principle for fractional diffusion equations with multiple Caputo derivatives in time, and investigate a related inverse problem of practical importance. Exploiting the solution properties and the involved multinomial Mittag-Leffler functions, we improve the weak maximum principle for the multi-term time-fractional diffusion equation to a stronger one, which is parallel to that for its single-term counterpart as expected. As a direct application, w...
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)
Eigenvalue translation method for mode calculations
International Nuclear Information System (INIS)
Gerck, E.; Cruz, C.H.B.
1978-11-01
A new method is described for the first few modes calculations in a interferometer that has several advantages over the ALLMAT subroutine, the Prony Method and the Fox and Li Method. In the illustrative results shown for the same cases it can be seen that the eigenvalue translation method is typically 100 fold times faster than the usual Fox and Li Method and 10 times faster than ALLMAT [pt
New approach to calculate bound state eigenvalues
International Nuclear Information System (INIS)
Gerck, E.; Gallas, J.A.C.
1983-01-01
A method of solving the radial Schrodinger equation for bound states is discussed. The method is based on a new piecewise representation of the second derivative operator on a set of functions that obey the boundary conditions. This representation is trivially diagonalised and leads to closed form expressions of the type E sub(n)=E(ab+b+c/n+...) for the eigenvalues. Examples are given for the power-law and logarithmic potentials. (Author) [pt
Sensitivity analysis of numerical results of one- and two-dimensional advection-diffusion problems
International Nuclear Information System (INIS)
Motoyama, Yasunori; Tanaka, Nobuatsu
2005-01-01
Numerical simulation has been playing an increasingly important role in the fields of science and engineering. However, every numerical result contains errors such as modeling, truncation, and computing errors, and the magnitude of the errors that are quantitatively contained in the results is unknown. This situation causes a large design margin in designing by analyses and prevents further cost reduction by optimizing design. To overcome this situation, we developed a new method to numerically analyze the quantitative error of a numerical solution by using the sensitivity analysis method and modified equation approach. If a reference case of typical parameters is calculated once by this method, then no additional calculation is required to estimate the results of other numerical parameters such as those of parameters with higher resolutions. Furthermore, we can predict the exact solution from the sensitivity analysis results and can quantitatively evaluate the error of numerical solutions. Since the method incorporates the features of the conventional sensitivity analysis method, it can evaluate the effect of the modeling error as well as the truncation error. In this study, we confirm the effectiveness of the method through some numerical benchmark problems of one- and two-dimensional advection-diffusion problems. (author)
Recurrence quantity analysis based on matrix eigenvalues
Yang, Pengbo; Shang, Pengjian
2018-06-01
Recurrence plots is a powerful tool for visualization and analysis of dynamical systems. Recurrence quantification analysis (RQA), based on point density and diagonal and vertical line structures in the recurrence plots, is considered to be alternative measures to quantify the complexity of dynamical systems. In this paper, we present a new measure based on recurrence matrix to quantify the dynamical properties of a given system. Matrix eigenvalues can reflect the basic characteristics of the complex systems, so we show the properties of the system by exploring the eigenvalues of the recurrence matrix. Considering that Shannon entropy has been defined as a complexity measure, we propose the definition of entropy of matrix eigenvalues (EOME) as a new RQA measure. We confirm that EOME can be used as a metric to quantify the behavior changes of the system. As a given dynamical system changes from a non-chaotic to a chaotic regime, the EOME will increase as well. The bigger EOME values imply higher complexity and lower predictability. We also study the effect of some factors on EOME,including data length, recurrence threshold, the embedding dimension, and additional noise. Finally, we demonstrate an application in physiology. The advantage of this measure lies in a high sensitivity and simple computation.
EISPACK, Subroutines for Eigenvalues, Eigenvectors, Matrix Operations
International Nuclear Information System (INIS)
Garbow, Burton S.; Cline, A.K.; Meyering, J.
1993-01-01
1 - Description of problem or function: EISPACK3 is a collection of 75 FORTRAN subroutines, both single- and double-precision, that compute the eigenvalues and eigenvectors of nine classes of matrices. The package can determine the Eigen-system of complex general, complex Hermitian, real general, real symmetric, real symmetric band, real symmetric tridiagonal, special real tridiagonal, generalized real, and generalized real symmetric matrices. In addition, there are two routines which use the singular value decomposition to solve certain least squares problem. The individual subroutines are - Identification/Description: BAKVEC: Back transform vectors of matrix formed by FIGI; BALANC: Balance a real general matrix; BALBAK: Back transform vectors of matrix formed by BALANC; BANDR: Reduce sym. band matrix to sym. tridiag. matrix; BANDV: Find some vectors of sym. band matrix; BISECT: Find some values of sym. tridiag. matrix; BQR: Find some values of sym. band matrix; CBABK2: Back transform vectors of matrix formed by CBAL; CBAL: Balance a complex general matrix; CDIV: Perform division of two complex quantities; CG: Driver subroutine for a complex general matrix; CH: Driver subroutine for a complex Hermitian matrix; CINVIT: Find some vectors of complex Hess. matrix; COMBAK: Back transform vectors of matrix formed by COMHES; COMHES: Reduce complex matrix to complex Hess. (elementary); COMLR: Find all values of complex Hess. matrix (LR); COMLR2: Find all values/vectors of cmplx Hess. matrix (LR); CCMQR: Find all values of complex Hessenberg matrix (QR); COMQR2: Find all values/vectors of cmplx Hess. matrix (QR); CORTB: Back transform vectors of matrix formed by CORTH; CORTH: Reduce complex matrix to complex Hess. (unitary); CSROOT: Find square root of complex quantity; ELMBAK: Back transform vectors of matrix formed by ELMHES; ELMHES: Reduce real matrix to real Hess. (elementary); ELTRAN: Accumulate transformations from ELMHES (for HQR2); EPSLON: Estimate unit roundoff
Anisotropy of self-diffusion and α-zirconium radiation growth problems
International Nuclear Information System (INIS)
Smirnov, E.A.; Subbotin, A.V.
1996-01-01
Temperature dependence of α-zirconium seft-diffusion anisotropy coefficients is obtained within the framework of linear extrapolation of self-diffusion anisotropy characteristics for metal HCP with c/a ration of [ru
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
Error quantification of the axial nodal diffusion kernel of the DeCART code
International Nuclear Information System (INIS)
Cho, J. Y.; Kim, K. S.; Lee, C. C.
2006-01-01
This paper is to quantify the transport effects involved in the axial nodal diffusion kernel of the DeCART code. The transport effects are itemized into three effects, the homogenization, the diffusion, and the nodal effects. A five pin model consisting of four fuel pins and one non-fuel pin is demonstrated to quantify the transport effects. The transport effects are analyzed for three problems, the single pin (SP), guide tube (GT) and control rod (CR) problems by replacing the non-fuel pin with the fuel pin, a guide-tube and a control rod pins, respectively. The homogenization and diffusion effects are estimated to be about -4 and -50 pcm for the eigenvalue, and less than 2 % for the node power. The nodal effect on the eigenvalue is evaluated to be about -50 pcm in the SP and GT problems, and +350 pcm in the CR problem. Regarding the node power, this effect induces about a 3 % error in the SP and GT problems, and about a 20 % error in the CR problem. The large power error in the CR problem is due to the plane thickness, and it can be decreased by using the adaptive plane size. From the error quantification, it is concluded that the homogenization and the diffusion effects are not controllable if DeCART maintains the diffusion kernel for the axial solution, but the nodal effect is controllable by introducing the adaptive plane size scheme. (authors)
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.
International Nuclear Information System (INIS)
Deswal, Sunita; Kalkal, Kapil Kumar; Sheoran, Sandeep Singh
2016-01-01
A mathematical model of fractional order two-temperature generalized thermoelasticity with diffusion and initial stress is proposed to analyze the transient wave phenomenon in an infinite thermoelastic half-space. The governing equations are derived in cylindrical coordinates for a two dimensional axi-symmetric problem. The analytical solution is procured by employing the Laplace and Hankel transforms for time and space variables respectively. The solutions are investigated in detail for a time dependent heat source. By using numerical inversion method of integral transforms, we obtain the solutions for displacement, stress, temperature and diffusion fields in physical domain. Computations are carried out for copper material and displayed graphically. The effect of fractional order parameter, two-temperature parameter, diffusion, initial stress and time on the different thermoelastic and diffusion fields is analyzed on the basis of analytical and numerical results. Some special cases have also been deduced from the present investigation.
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
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.
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.
The method of fundamental solutions for computing acoustic interior transmission eigenvalues
Kleefeld, Andreas; Pieronek, Lukas
2018-03-01
We analyze the method of fundamental solutions (MFS) in two different versions with focus on the computation of approximate acoustic interior transmission eigenvalues in 2D for homogeneous media. Our approach is mesh- and integration free, but suffers in general from the ill-conditioning effects of the discretized eigenoperator, which we could then successfully balance using an approved stabilization scheme. Our numerical examples cover many of the common scattering objects and prove to be very competitive in accuracy with the standard methods for PDE-related eigenvalue problems. We finally give an approximation analysis for our framework and provide error estimates, which bound interior transmission eigenvalue deviations in terms of some generalized MFS output.
A Decentralized Eigenvalue Computation Method for Spectrum Sensing Based on Average Consensus
Mohammadi, Jafar; Limmer, Steffen; Stańczak, Sławomir
2016-07-01
This paper considers eigenvalue estimation for the decentralized inference problem for spectrum sensing. We propose a decentralized eigenvalue computation algorithm based on the power method, which is referred to as generalized power method GPM; it is capable of estimating the eigenvalues of a given covariance matrix under certain conditions. Furthermore, we have developed a decentralized implementation of GPM by splitting the iterative operations into local and global computation tasks. The global tasks require data exchange to be performed among the nodes. For this task, we apply an average consensus algorithm to efficiently perform the global computations. As a special case, we consider a structured graph that is a tree with clusters of nodes at its leaves. For an accelerated distributed implementation, we propose to use computation over multiple access channel (CoMAC) as a building block of the algorithm. Numerical simulations are provided to illustrate the performance of the two algorithms.
Directory of Open Access Journals (Sweden)
Pratibha Joshi
2014-12-01
Full Text Available In this paper, we have achieved high order solution of a three dimensional nonlinear diffusive-convective problem using modified variational iteration method. The efficiency of this approach has been shown by solving two examples. All computational work has been performed in MATHEMATICA.
Random matrices, Frobenius eigenvalues, and monodromy
Katz, Nicholas M
1998-01-01
The main topic of this book is the deep relation between the spacings between zeros of zeta and L-functions and spacings between eigenvalues of random elements of large compact classical groups. This relation, the Montgomery-Odlyzko law, is shown to hold for wide classes of zeta and L-functions over finite fields. The book draws on and gives accessible accounts of many disparate areas of mathematics, from algebraic geometry, moduli spaces, monodromy, equidistribution, and the Weil conjectures, to probability theory on the compact classical groups in the limit as their dimension goes to infinit
Maximal imaginery eigenvalues in optimal systems
Directory of Open Access Journals (Sweden)
David Di Ruscio
1991-07-01
Full Text Available In this note we present equations that uniquely determine the maximum possible imaginary value of the closed loop eigenvalues in an LQ-optimal system, irrespective of how the state weight matrix is chosen, provided a real symmetric solution of the algebraic Riccati equation exists. In addition, the corresponding state weight matrix and the solution to the algebraic Riccati equation are derived for a class of linear systems. A fundamental lemma for the existence of a real symmetric solution to the algebraic Riccati equation is derived for this class of linear systems.
Analysis of the Diffuse Domain Method for Second Order Elliptic Boundary Value Problems
Burger, Martin; Elvetun, Ole; Schlottbom, Matthias
2017-01-01
The diffuse domain method for partial differential equations on complicated geometries recently received strong attention in particular from practitioners, but many fundamental issues in the analysis are still widely open. In this paper, we study the diffuse domain method for approximating second
Determination of the zincate diffusion coefficient and its application to alkaline battery problems
May, C. E.; Kautz, H. E.
1978-01-01
The diffusion coefficient for the zincate ion at 24 C was found to be 9.9 x 10 to the -7th power sq cm/sec + or - 30% in 45% potassium hydroxide and 1.4 x 10 to the -7th power sq cm/sec + or - 25% in 40% sodium hydroxide. Comparison of these values with literature values at different potassium hydroxide concentrations show that the Stokes-Einstein equation is obeyed. The diffusion coefficient is characteristic of the zincate ion (not the cation) and independent of its concentration. Calculations with the measured value of the diffusion coefficient show that the zinc concentration in an alkaline zincate half-cell becomes uniform throughout in tens of hours by diffusion alone. Diffusion equations are derived which are applicable to finite-size chambers. Details and discussion of the experimental method are also given.
Diffusive instabilities in hyperbolic reaction-diffusion equations
Zemskov, Evgeny P.; Horsthemke, Werner
2016-03-01
We investigate two-variable reaction-diffusion systems of the hyperbolic type. A linear stability analysis is performed, and the conditions for diffusion-driven instabilities are derived. Two basic types of eigenvalues, real and complex, are described. Dispersion curves for both types of eigenvalues are plotted and their behavior is analyzed. The real case is related to the Turing instability, and the complex one corresponds to the wave instability. We emphasize the interesting feature that the wave instability in the hyperbolic equations occurs in two-variable systems, whereas in the parabolic case one needs three reaction-diffusion equations.
Instability of the cored barotropic disc: the linear eigenvalue formulation
Polyachenko, E. V.
2018-05-01
Gaseous rotating razor-thin discs are a testing ground for theories of spiral structure that try to explain appearance and diversity of disc galaxy patterns. These patterns are believed to arise spontaneously under the action of gravitational instability, but calculations of its characteristics in the gas are mostly obscured. The paper suggests a new method for finding the spiral patterns based on an expansion of small amplitude perturbations over Lagrange polynomials in small radial elements. The final matrix equation is extracted from the original hydrodynamical equations without the use of an approximate theory and has a form of the linear algebraic eigenvalue problem. The method is applied to a galactic model with the cored exponential density profile.
International Nuclear Information System (INIS)
Mendonca, A.G.
1980-01-01
Two computer codes that are available at IPEN for analyses of static neutron diffusion problems are studied and applied. The CITATION code is animed at analyses of criticality, fuel burnup, flux and power distributions etc, in one, two, and three spatial dimensions in multigroup. The EXTERMINATOR code can be used for the same purposes as for CITATION with a limitation to one or two spatial dimensions. Basic theories and numerical techniques used in the codes are studied and summarized. Benchmark problems have been solved using the codes. Comparisons of the results show that both codes can be used with confidence in the analyses of nuclear reactor problems. (author) [pt
Jiang, Daijun; Li, Zhiyuan; Liu, Yikan; Yamamoto, Masahiro
2017-05-01
In this paper, we first establish a weak unique continuation property for time-fractional diffusion-advection equations. The proof is mainly based on the Laplace transform and the unique continuation properties for elliptic and parabolic equations. The result is weaker than its parabolic counterpart in the sense that we additionally impose the homogeneous boundary condition. As a direct application, we prove the uniqueness for an inverse problem on determining the spatial component in the source term by interior measurements. Numerically, we reformulate our inverse source problem as an optimization problem, and propose an iterative thresholding algorithm. Finally, several numerical experiments are presented to show the accuracy and efficiency of the algorithm.
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.
Group theoretic approach for solving the problem of diffusion of a drug through a thin membrane
Abd-El-Malek, Mina B.; Kassem, Magda M.; Meky, Mohammed L. M.
2002-03-01
The transformation group theoretic approach is applied to study the diffusion process of a drug through a skin-like membrane which tends to partially absorb the drug. Two cases are considered for the diffusion coefficient. The application of one parameter group reduces the number of independent variables by one, and consequently the partial differential equation governing the diffusion process with the boundary and initial conditions is transformed into an ordinary differential equation with the corresponding conditions. The obtained differential equation is solved numerically using the shooting method, and the results are illustrated graphically and in tables.
Phase-space diffusion in turbulent plasmas: The random acceleration problem revisited
DEFF Research Database (Denmark)
Pécseli, H.L.; Trulsen, J.
1991-01-01
Phase-space diffusion of test particles in turbulent plasmas is studied by an approach based on a conditional statistical analysis of fluctuating electrostatic fields. Analytical relations between relevant conditional averages and higher-order correlations, , and triple...
A minimally-resolved immersed boundary model for reaction-diffusion problems
Pal Singh Bhalla, A; Griffith, BE; Patankar, NA; Donev, A
2013-01-01
We develop an immersed boundary approach to modeling reaction-diffusion processes in dispersions of reactive spherical particles, from the diffusion-limited to the reaction-limited setting. We represent each reactive particle with a minimally-resolved "blob" using many fewer degrees of freedom per particle than standard discretization approaches. More complicated or more highly resolved particle shapes can be built out of a collection of reactive blobs. We demonstrate numerically that the blo...
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
Energy Technology Data Exchange (ETDEWEB)
Dawes, Alan Sidney [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Malone, Christopher M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Shashkov, Mikhail Jurievich [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-07-07
In this report a number of new verification test problems for multimaterial diffusion will be shown. Using them we will show that homogenization of multimaterial cells in either Arbitrary Lagrangian Eulerian (ALE) or Eulerian simulations can lead to errors in the energy flow at the interfaces. Results will be presented that show that significant improvements and predictive capability can be gained by using either a surrogate supermesh, such as Thin Mesh in FLAG, or the emerging method based on Static Condensation.
Dinesh Kumar, S.; Nageshwar Rao, R.; Pramod Chakravarthy, P.
2017-11-01
In this paper, we consider a boundary value problem for a singularly perturbed delay differential equation of reaction-diffusion type. We construct an exponentially fitted numerical method using Numerov finite difference scheme, which resolves not only the boundary layers but also the interior layers arising from the delay term. An extensive amount of computational work has been carried out to demonstrate the applicability of the proposed method.
Asymptotic solutions of numerical transport problems in optically thick, diffusive regimes
International Nuclear Information System (INIS)
Larsen, E.W.; Morel, J.E.; Miller, W.F. Jr.
1987-01-01
We present an asymptotic analysis of spatial differencing schemes for the discrete-ordinates equations, for diffusive media with spatial cells that are not optically thin. Our theoretical tool is an asymptotic expansion that has previously been used to describe the transform from analytic transport to analytic diffusion theory for such media. To introduce this expansion and its physical rationale, we first describe it for the analytic discrete-ordinates equations. Then, we apply the expansion to the spatially discretized discrete-ordinates equations, with the spatial mesh scaled in either of two physically relevant ways such that the optical thickness of the spatial cells is not small. If the result of either expansion is a legitimate diffusion description for either the cell-averaged or cell-edge fluxes, then we say that the approximate flux has the appropriate diffusion limit; otherwise, we say it does not. We consider several transport differencing schemes that are applicable in neutron transport and thermal radiation applications. We also include numerical results which demonstrate the validity of our theory and show that differencing schemes that do have a particular diffusion limit are substantially more accurate, in the regime described by the limit, than those that do not. copyright 1987 Academic Press, Inc
International Nuclear Information System (INIS)
Warsa, James S.; Wareing, Todd A.; Morel, Jim E.
2004-01-01
A loss in the effectiveness of diffusion synthetic acceleration (DSA) schemes has been observed with certain S N discretizations on two-dimensional Cartesian grids in the presence of material discontinuities. We will present more evidence supporting the conjecture that DSA effectiveness will degrade for multidimensional problems with discontinuous total cross sections, regardless of the particular physical configuration or spatial discretization. Fourier analysis and numerical experiments help us identify a set of representative problems for which established DSA schemes are ineffective, focusing on diffusive problems for which DSA is most needed. We consider a lumped, linear discontinuous spatial discretization of the S N transport equation on three-dimensional, unstructured tetrahedral meshes and look at a fully consistent and a 'partially consistent' DSA method for this discretization. The effectiveness of both methods is shown to degrade significantly. A Fourier analysis of the fully consistent DSA scheme in the limit of decreasing cell optical thickness supports the view that the DSA itself is failing when material discontinuities are present in a problem. We show that a Krylov iterative method, preconditioned with DSA, is an effective remedy that can be used to efficiently compute solutions for this class of problems. We show that as a preconditioner to the Krylov method, a partially consistent DSA method is more than adequate. In fact, it is preferable to a fully consistent method because the partially consistent method is based on a continuous finite element discretization of the diffusion equation that can be solved relatively easily. The Krylov method can be implemented in terms of the original S N source iteration coding with only slight modification. Results from numerical experiments show that replacing source iteration with a preconditioned Krylov method can efficiently solve problems that are virtually intractable with accelerated source iteration
On the Eigenvalue Problem in Multipartite Quantum Systems
International Nuclear Information System (INIS)
Enríquez, M
2016-01-01
We show that the Hamiltonian of a multiqudit system can be diagonalized through a sequence of unitary transformations written in terms of Hubbard operators. As an application this formalism is applied to particular cases of two and three-qubit systems. (paper)
On solving energy-dependent partitioned eigenvalue problem by ...
Indian Academy of Sciences (India)
unknown stationary state wave functions (ψ) are expanded, viz. ψ = ∑N ... λ being a user-defined scalar that takes care of exponential overflow or underflow. Clearly, as ... Two new strings Si and Sk (the children strings) are then created by an.
On the nonnegative inverse eigenvalue problem of traditional matrices
Directory of Open Access Journals (Sweden)
Alimohammad Nazari
2014-07-01
Full Text Available In this paper, at first for a given set of real or complex numbers $\\sigma$ with nonnegativesummation, we introduce some special conditions that with them there is no nonnegativetridiagonal matrix in which $\\sigma$ is its spectrum. In continue we present some conditions forexistence such nonnegative tridiagonal matrices.
A generalized Fucik type eigenvalue problem for p-Laplacian
Directory of Open Access Journals (Sweden)
Yuanji Cheng
2009-03-01
\\left\\{\\begin{array}{lll} - (\\varphi( u' ' = \\psi(u, \\quad -T1.$ We obtain a explicit characterization of Fucik spectrum $(\\alpha, \\beta, \\lambda, \\mu,$ i.e., for which the (* has a nontrivial solution.
Existence of Positive Solutions for Nonlinear Eigenvalue Problems
Directory of Open Access Journals (Sweden)
Wong Fu-Hsiang
2010-01-01
Full Text Available We use a fixed point theorem in a cone to obtain the existence of positive solutions of the differential equation, , , with some suitable boundary conditions, where is a parameter.
Existence of Positive Solutions for Nonlinear Eigenvalue Problems
Directory of Open Access Journals (Sweden)
Fan-Kai Kung
2010-01-01
Full Text Available We use a fixed point theorem in a cone to obtain the existence of positive solutions of the differential equation, u″+λf(t,u=0, 0
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.
Schwarz, Karsten; Rieger, Heiko
2013-03-01
We present an efficient Monte Carlo method to simulate reaction-diffusion processes with spatially varying particle annihilation or transformation rates as it occurs for instance in the context of motor-driven intracellular transport. Like Green's function reaction dynamics and first-passage time methods, our algorithm avoids small diffusive hops by propagating sufficiently distant particles in large hops to the boundaries of protective domains. Since for spatially varying annihilation or transformation rates the single particle diffusion propagator is not known analytically, we present an algorithm that generates efficiently either particle displacements or annihilations with the correct statistics, as we prove rigorously. The numerical efficiency of the algorithm is demonstrated with an illustrative example.
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
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)
Shetty, Anil N; Chiang, Sharon; Maletic-Savatic, Mirjana; Kasprian, Gregor; Vannucci, Marina; Lee, Wesley
2014-01-01
In this article, we discuss the theoretical background for diffusion weighted imaging and diffusion tensor imaging. Molecular diffusion is a random process involving thermal Brownian motion. In biological tissues, the underlying microstructures restrict the diffusion of water molecules, making diffusion directionally dependent. Water diffusion in tissue is mathematically characterized by the diffusion tensor, the elements of which contain information about the magnitude and direction of diffusion and is a function of the coordinate system. Thus, it is possible to generate contrast in tissue based primarily on diffusion effects. Expressing diffusion in terms of the measured diffusion coefficient (eigenvalue) in any one direction can lead to errors. Nowhere is this more evident than in white matter, due to the preferential orientation of myelin fibers. The directional dependency is removed by diagonalization of the diffusion tensor, which then yields a set of three eigenvalues and eigenvectors, representing the magnitude and direction of the three orthogonal axes of the diffusion ellipsoid, respectively. For example, the eigenvalue corresponding to the eigenvector along the long axis of the fiber corresponds qualitatively to diffusion with least restriction. Determination of the principal values of the diffusion tensor and various anisotropic indices provides structural information. We review the use of diffusion measurements using the modified Stejskal-Tanner diffusion equation. The anisotropy is analyzed by decomposing the diffusion tensor based on symmetrical properties describing the geometry of diffusion tensor. We further describe diffusion tensor properties in visualizing fiber tract organization of the human brain.
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
Discontinuous Galerkin methods and a posteriori error analysis for heterogenous diffusion problems
International Nuclear Information System (INIS)
Stephansen, A.F.
2007-12-01
In this thesis we analyse a discontinuous Galerkin (DG) method and two computable a posteriori error estimators for the linear and stationary advection-diffusion-reaction equation with heterogeneous diffusion. The DG method considered, the SWIP method, is a variation of the Symmetric Interior Penalty Galerkin method. The difference is that the SWIP method uses weighted averages with weights that depend on the diffusion. The a priori analysis shows optimal convergence with respect to mesh-size and robustness with respect to heterogeneous diffusion, which is confirmed by numerical tests. Both a posteriori error estimators are of the residual type and control the energy (semi-)norm of the error. Local lower bounds are obtained showing that almost all indicators are independent of heterogeneities. The exception is for the non-conforming part of the error, which has been evaluated using the Oswald interpolator. The second error estimator is sharper in its estimate with respect to the first one, but it is slightly more costly. This estimator is based on the construction of an H(div)-conforming Raviart-Thomas-Nedelec flux using the conservativeness of DG methods. Numerical results show that both estimators can be used for mesh-adaptation. (author)
International Nuclear Information System (INIS)
Hall, S.K.; Eaton, M.D.; Williams, M.M.R.
2012-01-01
Highlights: ► Isogeometric analysis used to obtain solutions to the neutron diffusion equation. ► Exact geometry captured for a circular fuel pin within a square moderator. ► Comparisons are made between the finite element method and isogeometric analysis. ► Error and observed order of convergence found using an analytic solution. -- Abstract: In this paper the neutron diffusion equation is solved using Isogeometric Analysis (IGA), which is an attempt to generalise Finite Element Analysis (FEA) to include exact geometries. In contrast to FEA, the basis functions are rational functions instead of polynomials. These rational functions, called non-uniform rational B-splines, are used to capture both the geometry and approximate the solution. The method of manufactured solutions is used to verify a MatLab implementation of IGA, which is then applied to a pincell problem. This is a circular uranium fuel pin within a square block of graphite moderator. A new method is used to compute an analytic solution to a simplified version of this problem, and is then used to observe the order of convergence of the numerical scheme. Comparisons are made against quadratic finite elements for the pincell problem, and it is found that the disadvantage factor computed using IGA is less accurate. This is due to a cancellation of errors in the FEA solution. A modified pincell problem with vacuum boundary conditions is then considered. IGA is shown to outperform FEA in this situation.
Multicomponent diffusion in basaltic melts at 1350 °C
Guo, Chenghuan; Zhang, Youxue
2018-05-01
Nine successful diffusion couple experiments were conducted in an 8-component SiO2-TiO2-Al2O3-FeO-MgO-CaO-Na2O-K2O system at ∼1350 °C and at 1 GPa, to study multicomponent diffusion in basaltic melts. At least 3 traverses were measured to obtain diffusion profiles for each experiment. Multicomponent diffusion matrix at 1350 °C was obtained by simultaneously fitting diffusion profiles of diffusion couple experiments. Furthermore, in order to better constrain the diffusion matrix and reconcile mineral dissolution data, mineral dissolution experiments in the literature and diffusion couple experiments from this study, were fit together. All features of diffusion profiles in both diffusion couple and mineral dissolution experiments were well reproduced by the diffusion matrix. Diffusion mechanism is inferred from eigenvectors of the diffusion matrix, and it shows that the diffusive exchange between network-formers SiO2 and Al2O3 is the slowest, the exchange of SiO2 with other oxide components is the second slowest with an eigenvalue that is only ∼10% larger, then the exchange between divalent oxide components and all the other oxide components is the third slowest with an eigenvalue that is twice the smallest eigenvalue, then the exchange of FeO + K2O with all the other oxide components is the fourth slowest with an eigenvalue that is 5 times the smallest eigenvalue, then the exchange of MgO with FeO + CaO is the third fastest with an eigenvalue that is 6.3 times the smallest eigenvalue, then the exchange of CaO + K2O with all the other oxide components is the second fastest with an eigenvalue that is 7.5 times the smallest eigenvalue, and the exchange of Na2O with all other oxide components is the fastest with an eigenvalue that is 31 times the smallest eigenvalue. The slowest and fastest eigenvectors are consistent with those for simpler systems in most literature. The obtained diffusion matrix was successfully applied to predict diffusion profiles during
Arbogast, Todd
2010-05-01
Tracer transport is governed by a convection-diffusion problem modeling mass conservation of both tracer and ambient fluids. Numerical methods should be fully conservative, enforcing both conservation principles on the discrete level. Locally conservative characteristics methods conserve the mass of tracer, but may not conserve the mass of the ambient fluid. In a recent paper by the authors [T. Arbogast, C. Huang, A fully mass and volume conserving implementation of a characteristic method for transport problems, SIAM J. Sci. Comput. 28 (2006) 2001-2022], a fully conservative characteristic method, the Volume Corrected Characteristics Mixed Method (VCCMM), was introduced for potential flows. Here we extend and apply the method to problems with a solenoidal (i.e., divergence-free) flow field. The modification is a computationally inexpensive simplification of the original VCCMM, requiring a simple adjustment of trace-back regions in an element-by-element traversal of the domain. Our numerical results show that the method works well in practice, is less numerically diffuse than uncorrected characteristic methods, and can use up to at least about eight times the CFL limited time step. © 2010 Elsevier Inc.
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)
Iterative solutions of finite difference diffusion equations
International Nuclear Information System (INIS)
Menon, S.V.G.; Khandekar, D.C.; Trasi, M.S.
1981-01-01
The heterogeneous arrangement of materials and the three-dimensional character of the reactor physics problems encountered in the design and operation of nuclear reactors makes it necessary to use numerical methods for solution of the neutron diffusion equations which are based on the linear Boltzmann equation. The commonly used numerical method for this purpose is the finite difference method. It converts the diffusion equations to a system of algebraic equations. In practice, the size of this resulting algebraic system is so large that the iterative methods have to be used. Most frequently used iterative methods are discussed. They include : (1) basic iterative methods for one-group problems, (2) iterative methods for eigenvalue problems, and (3) iterative methods which use variable acceleration parameters. Application of Chebyshev theorem to iterative methods is discussed. The extension of the above iterative methods to multigroup neutron diffusion equations is also considered. These methods are applicable to elliptic boundary value problems in reactor design studies in particular, and to elliptic partial differential equations in general. Solution of sample problems is included to illustrate their applications. The subject matter is presented in as simple a manner as possible. However, a working knowledge of matrix theory is presupposed. (M.G.B.)
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.
Optimal Reinsurance-Investment Problem for an Insurer and a Reinsurer with Jump-Diffusion Process
Directory of Open Access Journals (Sweden)
Hanlei Hu
2018-01-01
Full Text Available The optimal reinsurance-investment strategies considering the interests of both the insurer and reinsurer are investigated. The surplus process is assumed to follow a jump-diffusion process and the insurer is permitted to purchase proportional reinsurance from the reinsurer. Applying dynamic programming approach and dual theory, the corresponding Hamilton-Jacobi-Bellman equations are derived and the optimal strategies for exponential utility function are obtained. In addition, several sensitivity analyses and numerical illustrations in the case with exponential claiming distributions are presented to analyze the effects of parameters about the optimal strategies.
Aggressive time step selection for the time asymptotic velocity diffusion problem
International Nuclear Information System (INIS)
Hewett, D.W.; Krapchev, V.B.; Hizanidis, K.; Bers, A.
1984-12-01
An aggressive time step selector for an ADI algorithm is preseneted that is applied to the linearized 2-D Fokker-Planck equation including an externally imposed quasilinear diffusion term. This method provides a reduction in CPU requirements by factors of two or three compared to standard ADI. More important, the robustness of the procedure greatly reduces the work load of the user. The procedure selects a nearly optimal Δt with a minimum of intervention by the user thus relieving the need to supervise the algorithm. In effect, the algorithm does its own supervision by discarding time steps made with Δt too large
Li, Zhiyuan; Huang, Xinchi; Yamamoto, Masahiro
2018-01-01
In this paper, we discuss an initial-boundary value problem (IBVP) for the multi-term time-fractional diffusion equation with x-dependent coefficients. By means of the Mittag-Leffler functions and the eigenfunction expansion, we reduce the IBVP to an equivalent integral equation to show the unique existence and the analyticity of the solution for the equation. Especially, in the case where all the coefficients of the time-fractional derivatives are non-negative, by the Laplace and inversion L...
Extreme eigenvalues of sample covariance and correlation matrices
DEFF Research Database (Denmark)
Heiny, Johannes
This thesis is concerned with asymptotic properties of the eigenvalues of high-dimensional sample covariance and correlation matrices under an infinite fourth moment of the entries. In the first part, we study the joint distributional convergence of the largest eigenvalues of the sample covariance...... matrix of a p-dimensional heavy-tailed time series when p converges to infinity together with the sample size n. We generalize the growth rates of p existing in the literature. Assuming a regular variation condition with tail index ... eigenvalues are essentially determined by the extreme order statistics from an array of iid random variables. The asymptotic behavior of the extreme eigenvalues is then derived routinely from classical extreme value theory. The resulting approximations are strikingly simple considering the high dimension...
Complex eigenvalue analysis of railway wheel/rail squeal
African Journals Online (AJOL)
DR OKE
Squeal noise from wheel/rail and brake disc/pad frictional contact is typical in railways. ... squeal noise by multibody simulation of a rail car running on rigid rails. ... system, traditional complex eigenvalue analysis by finite element was used.
An eigenvalue localization set for tensors and its applications
Directory of Open Access Journals (Sweden)
Jianxing Zhao
2017-03-01
Full Text Available Abstract A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Li et al. (Linear Algebra Appl. 481:36-53, 2015 and Huang et al. (J. Inequal. Appl. 2016:254, 2016. As an application of this set, new bounds for the minimum eigenvalue of M $\\mathcal{M}$ -tensors are established and proved to be sharper than some known results. Compared with the results obtained by Huang et al., the advantage of our results is that, without considering the selection of nonempty proper subsets S of N = { 1 , 2 , … , n } $N=\\{1,2,\\ldots,n\\}$ , we can obtain a tighter eigenvalue localization set for tensors and sharper bounds for the minimum eigenvalue of M $\\mathcal{M}$ -tensors. Finally, numerical examples are given to verify the theoretical results.
An eigenvalue localization set for tensors and its applications.
Zhao, Jianxing; Sang, Caili
2017-01-01
A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Li et al . (Linear Algebra Appl. 481:36-53, 2015) and Huang et al . (J. Inequal. Appl. 2016:254, 2016). As an application of this set, new bounds for the minimum eigenvalue of [Formula: see text]-tensors are established and proved to be sharper than some known results. Compared with the results obtained by Huang et al ., the advantage of our results is that, without considering the selection of nonempty proper subsets S of [Formula: see text], we can obtain a tighter eigenvalue localization set for tensors and sharper bounds for the minimum eigenvalue of [Formula: see text]-tensors. Finally, numerical examples are given to verify the theoretical results.
D'Ambrosio, Raffaele; Moccaldi, Martina; Paternoster, Beatrice
2018-05-01
In this paper, an adapted numerical scheme for reaction-diffusion problems generating periodic wavefronts is introduced. Adapted numerical methods for such evolutionary problems are specially tuned to follow prescribed qualitative behaviors of the solutions, making the numerical scheme more accurate and efficient as compared with traditional schemes already known in the literature. Adaptation through the so-called exponential fitting technique leads to methods whose coefficients depend on unknown parameters related to the dynamics and aimed to be numerically computed. Here we propose a strategy for a cheap and accurate estimation of such parameters, which consists essentially in minimizing the leading term of the local truncation error whose expression is provided in a rigorous accuracy analysis. In particular, the presented estimation technique has been applied to a numerical scheme based on combining an adapted finite difference discretization in space with an implicit-explicit time discretization. Numerical experiments confirming the effectiveness of the approach are also provided.
International Nuclear Information System (INIS)
Gado, J.
1986-02-01
The four group, 2D and 3D hexagonal geometry HTGR benchmark problems and a 2D hexagonal geometry PWR (WWER) benchmark problem have been solved by using the finite element diffusion code DIFGEN. The hexagons (or hexagonal prisms) were subdivided into first order or second order triangles or quadrilaterals (or triangular or quadrilateral prisms). In the 2D HTGR case of the number of the inserted absorber rods was also varied (7, 6, 0 or 37 rods). The calculational results are in a good agreement with the results of other calculations. The larger systematic series of DIFGEN calculations have given a quantitative picture on the convergence properties of various finite element modellings of hexagonal grids in DIFGEN. (orig.)
Complex eigenvalues for neutron transport equation with quadratically anisotropic scattering
International Nuclear Information System (INIS)
Sjoestrand, N.G.
1981-01-01
Complex eigenvalues for the monoenergetic neutron transport equation in the buckling approximation have been calculated for various combinations of linearly and quadratically anisotropic scattering. The results are discussed in terms of the time-dependent case. Tables are given of complex bucklings for real decay constants and of complex decay constants for real bucklings. The results fit nicely into the pattern of real and purely imaginary eigenvalues obtained earlier. (author)
Bound-state Dirac eigenvalues for scalar potentials
International Nuclear Information System (INIS)
Ram, B.; Arafah, M.
1981-01-01
The Dirac equation is solved with a linear and a quadratic scalar potential using an approach in which the Dirac equation is first transformed to a one-dimensional Schroedinger equation with an effective potential. The WKB method is used to obtain the energy eigenvalues. The eigenvalues for the quadratic scalar potential are real just as they are for the linear potential. The results with the linear potential agree well with those obtained by Critchfield. (author)
Applying the response matrix method for solving coupled neutron diffusion and transport problems
International Nuclear Information System (INIS)
Sibiya, G.S.
1980-01-01
The numerical determination of the flux and power distribution in the design of large power reactors is quite a time-consuming procedure if the space under consideration is to be subdivided into very fine weshes. Many computing methods applied in reactor physics (such as the finite-difference method) require considerable computing time. In this thesis it is shown that the response matrix method can be successfully used as an alternative approach to solving the two-dimension diffusion equation. Furthermore it is shown that sufficient accuracy of the method is achieved by assuming a linear space dependence of the neutron currents on the boundaries of the geometries defined for the given space. (orig.) [de
International Nuclear Information System (INIS)
Bernal, A.; Roman, J.E.; Miró, R.; Verdú, G.
2016-01-01
Highlights: • A method is proposed to solve the eigenvalue problem of the Neutron Diffusion Equation in BWR. • The Neutron Diffusion Equation is discretized with the Finite Volume Method. • The currents are calculated by using a polynomial expansion of the neutron flux. • The current continuity and boundary conditions are defined implicitly to reduce the size of the matrices. • Different structured and unstructured meshes were used to discretize the BWR. - Abstract: The neutron flux spatial distribution in Boiling Water Reactors (BWRs) can be calculated by means of the Neutron Diffusion Equation (NDE), which is a space- and time-dependent differential equation. In steady state conditions, the time derivative terms are zero and this equation is rewritten as an eigenvalue problem. In addition, the spatial partial derivatives terms are transformed into algebraic terms by discretizing the geometry and using numerical methods. As regards the geometrical discretization, BWRs are complex systems containing different components of different geometries and materials, but they are usually modelled as parallelepiped nodes each one containing only one homogenized material to simplify the solution of the NDE. There are several techniques to correct the homogenization in the node, but the most commonly used in BWRs is that based on Assembly Discontinuity Factors (ADFs). As regards numerical methods, the Finite Volume Method (FVM) is feasible and suitable to be applied to the NDE. In this paper, a FVM based on a polynomial expansion method has been used to obtain the matrices of the eigenvalue problem, assuring the accomplishment of the ADFs for a BWR. This eigenvalue problem has been solved by means of the SLEPc library.
Overview of the ArbiTER edge plasma eigenvalue code
Baver, Derek; Myra, James; Umansky, Maxim
2011-10-01
The Arbitrary Topology Equation Reader, or ArbiTER, is a flexible eigenvalue solver that is currently under development for plasma physics applications. The ArbiTER code builds on the equation parser framework of the existing 2DX code, extending it to include a topology parser. This will give the code the capability to model problems with complicated geometries (such as multiple X-points and scrape-off layers) or model equations with arbitrary numbers of dimensions (e.g. for kinetic analysis). In the equation parser framework, model equations are not included in the program's source code. Instead, an input file contains instructions for building a matrix from profile functions and elementary differential operators. The program then executes these instructions in a sequential manner. These instructions may also be translated into analytic form, thus giving the code transparency as well as flexibility. We will present an overview of how the ArbiTER code is to work, as well as preliminary results from early versions of this code. Work supported by the U.S. DOE.
Effective Perron-Frobenius eigenvalue for a correlated random map
Pool, Roman R.; Cáceres, Manuel O.
2010-09-01
We investigate the evolution of random positive linear maps with various type of disorder by analytic perturbation and direct simulation. Our theoretical result indicates that the statistics of a random linear map can be successfully described for long time by the mean-value vector state. The growth rate can be characterized by an effective Perron-Frobenius eigenvalue that strongly depends on the type of correlation between the elements of the projection matrix. We apply this approach to an age-structured population dynamics model. We show that the asymptotic mean-value vector state characterizes the population growth rate when the age-structured model has random vital parameters. In this case our approach reveals the nontrivial dependence of the effective growth rate with cross correlations. The problem was reduced to the calculation of the smallest positive root of a secular polynomial, which can be obtained by perturbations in terms of Green’s function diagrammatic technique built with noncommutative cumulants for arbitrary n -point correlations.
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
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)
Towards a deterministic KPZ equation with fractional diffusion: the stationary problem
Abdellaoui, Boumediene; Peral, Ireneo
2018-04-01
In this work, we investigate by analysis the possibility of a solution to the fractional quasilinear problem: where is a bounded regular domain ( is sufficient), , 1 2s. The authors were partially supported by Ministerio de Economia y Competitividad under grants MTM2013-40846-P and MTM2016-80474-P (Spain).
International Nuclear Information System (INIS)
Carmo, E.G.D. do; Galeao, A.C.N.R.
1986-01-01
A new method specially designed to solve highly convective transport problems is proposed. Using a variational approach it is shown that this weighted residual method belongs to a class of Petrov-Galerkin's approximation. Some examples are presented in order to demonstrate the adequacy of this method in predicting internal or external boundary layers. (Author) [pt
The induced dimension reduction method applied to convection-diffusion-reaction problems
Astudillo Rengifo, R.A.; van Gijzen, M.B.
2016-01-01
Discretization of (linearized) convection-diusion-reaction problems yields
a large and sparse non symmetric linear system of equations,
Ax = b: (1)
In this work, we compare the computational behavior of the Induced Dimension
Reduction method (IDR(s)) [10], with other
International Nuclear Information System (INIS)
Tanaka, Yuho; Uruma, Kazunori; Furukawa, Toshihiro; Nakao, Tomoki; Izumi, Kenya; Utsumi, Hiroaki
2017-01-01
This paper deals with an analysis problem for diffusion-ordered NMR spectroscopy (DOSY). DOSY is formulated as a matrix factorization problem of a given observed matrix. In order to solve this problem, a direct exponential curve resolution algorithm (DECRA) is well known. DECRA is based on singular value decomposition; the advantage of this algorithm is that the initial value is not required. However, DECRA requires a long calculating time, depending on the size of the given observed matrix due to the singular value decomposition, and this is a serious problem in practical use. Thus, this paper proposes a new analysis algorithm for DOSY to achieve a short calculating time. In order to solve matrix factorization for DOSY without using singular value decomposition, this paper focuses on the size of the given observed matrix. The observed matrix in DOSY is also a rectangular matrix with more columns than rows, due to limitation of the measuring time; thus, the proposed algorithm transforms the given observed matrix into a small observed matrix. The proposed algorithm applies the eigenvalue decomposition and the difference approximation to the small observed matrix, and the matrix factorization problem for DOSY is solved. The simulation and a data analysis show that the proposed algorithm achieves a lower calculating time than DECRA as well as similar analysis result results to DECRA. (author)
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
Fuller, Nathaniel J.; Licata, Nicholas A.
2018-05-01
Obtaining a detailed understanding of the physical interactions between a cell and its environment often requires information about the flow of fluid surrounding the cell. Cells must be able to effectively absorb and discard material in order to survive. Strategies for nutrient acquisition and toxin disposal, which have been evolutionarily selected for their efficacy, should reflect knowledge of the physics underlying this mass transport problem. Motivated by these considerations, in this paper we discuss the results from an undergraduate research project on the advection-diffusion equation at small Reynolds number and large Péclet number. In particular, we consider the problem of mass transport for a Stokesian spherical swimmer. We approach the problem numerically and analytically through a rescaling of the concentration boundary layer. A biophysically motivated first-passage problem for the absorption of material by the swimming cell demonstrates quantitative agreement between the numerical and analytical approaches. We conclude by discussing the connections between our results and the design of smart toxin disposal systems.
Numerical computation of the linear stability of the diffusion model for crystal growth simulation
Energy Technology Data Exchange (ETDEWEB)
Yang, C.; Sorensen, D.C. [Rice Univ., Houston, TX (United States); Meiron, D.I.; Wedeman, B. [California Institute of Technology, Pasadena, CA (United States)
1996-12-31
We consider a computational scheme for determining the linear stability of a diffusion model arising from the simulation of crystal growth. The process of a needle crystal solidifying into some undercooled liquid can be described by the dual diffusion equations with appropriate initial and boundary conditions. Here U{sub t} and U{sub a} denote the temperature of the liquid and solid respectively, and {alpha} represents the thermal diffusivity. At the solid-liquid interface, the motion of the interface denoted by r and the temperature field are related by the conservation relation where n is the unit outward pointing normal to the interface. A basic stationary solution to this free boundary problem can be obtained by writing the equations of motion in a moving frame and transforming the problem to parabolic coordinates. This is known as the Ivantsov parabola solution. Linear stability theory applied to this stationary solution gives rise to an eigenvalue problem of the form.
Stochastic mechanics and the Kepler problem: Diffusions generated by the quantum motion
International Nuclear Information System (INIS)
Garbaczewski, P.
1986-01-01
We construct a class of solutions of the Schroedinger equation for the Coulomb-Kepler problem. Their ψ = ρ 1/2 exp(iS/ℎ) structure implies that the quantal dynamics of wave functions is completely determined by the related classical Hamiltonian system. A construction of the associated controlled stochastic processes is then possible, their drift velocity being entirely defined in terms of (explicitly known) probability density ρ(x,y,z,t) and phase S(x,y,z,t). In particular, for the stationary states of the quantum problem, in its four-oscillator reconstruction, we identify the regime in which the related classical Hamiltonian can be effectively replaced by the Hamiltonian of the classical Kepler motion. (orig.)
Bazile , Alban; Hachem , Elie; Larroya-Huguet , Juan-Carlos; Mesri , Youssef
2018-01-01
International audience; In this work, we present a new a posteriori error estimator based on the Variational Multiscale method for anisotropic adaptive fluid mechanics problems. The general idea is to combine the large scale error based on the solved part of the solution with the sub-mesh scale error based on the unresolved part of the solution. We compute the latter with two different methods: one using the stabilizing parameters and the other using bubble functions. We propose two different...
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.
Nature of complex time eigenvalues of the one speed transport equation in a homogeneous sphere
International Nuclear Information System (INIS)
Dahl, E.B.; Sahni, D.C.
1990-01-01
The complex time eigenvalues of the transport equation have been studied for one speed neutrons, scattered isotropically in a homogeneous sphere with vacuum boundary conditions. It is shown that the complex decay constants vary continuously with the radius of the sphere. Our earlier conjecture (Dahl and Sahni (1983-84)) regarding disjoint arcs is thus shown to be true. We also indicate that complex decay constants exist even for large assemblies, though with rapid oscillations in the corresponding eigenvectors. These modes cannot be predicted by the diffusion equation as this behaviour of the eigenvectors contradicts the assumption of 'slowly varying flux' needed to derive the diffusion approximation from the transport equation. For an infinite system, the existence of complex modes is related to the solution of a homogeneous equation. (author)
International Nuclear Information System (INIS)
Ishiguro, Misako; Higuchi, Kenji
1983-01-01
The finite element method is applied in Galerkin-type approximation to three-dimensional neutron diffusion equations of fast reactors. A hexagonal element scheme is adopted for treating the hexagonal lattice which is typical for fast reactors. The validity of the scheme is verified by applying the scheme as well as alternative schemes to the neutron diffusion calculation of a gas-cooled fast reactor of actual scale. The computed results are compared with corresponding values obtained using the currently applied triangular-element and also with conventional finite difference schemes. The hexagonal finite element scheme is found to yield a reasonable solution to the problem taken up here, with some merit in terms of saving in computing time, but the resulting multiplication factor differs by 1% and the flux by 9% compared with the triangular mesh finite difference scheme. The finite element method, even in triangular element scheme, would appear to incur error in inadmissible amount and which could not be easily eliminated by refining the nodes. (author)
Maldonado, Sergio; Borthwick, Alistair G L
2018-02-01
We derive a two-layer depth-averaged model of sediment transport and morphological evolution for application to bedload-dominated problems. The near-bed transport region is represented by the lower (bedload) layer which has an arbitrarily constant, vanishing thickness (of approx. 10 times the sediment particle diameter), and whose average sediment concentration is free to vary. Sediment is allowed to enter the upper layer, and hence the total load may also be simulated, provided that concentrations of suspended sediment remain low. The model conforms with established theories of bedload, and is validated satisfactorily against empirical expressions for sediment transport rates and the morphodynamic experiment of a migrating mining pit by Lee et al. (1993 J. Hydraul. Eng. 119 , 64-80 (doi:10.1061/(ASCE)0733-9429(1993)119:1(64))). Investigation into the effect of a local bed gradient on bedload leads to derivation of an analytical, physically meaningful expression for morphological diffusion induced by a non-zero local bed slope. Incorporation of the proposed morphological diffusion into a conventional morphodynamic model (defined as a coupling between the shallow water equations, Exner equation and an empirical formula for bedload) improves model predictions when applied to the evolution of a mining pit, without the need either to resort to special numerical treatment of the equations or to use additional tuning parameters.
Maldonado, Sergio; Borthwick, Alistair G. L.
2018-02-01
We derive a two-layer depth-averaged model of sediment transport and morphological evolution for application to bedload-dominated problems. The near-bed transport region is represented by the lower (bedload) layer which has an arbitrarily constant, vanishing thickness (of approx. 10 times the sediment particle diameter), and whose average sediment concentration is free to vary. Sediment is allowed to enter the upper layer, and hence the total load may also be simulated, provided that concentrations of suspended sediment remain low. The model conforms with established theories of bedload, and is validated satisfactorily against empirical expressions for sediment transport rates and the morphodynamic experiment of a migrating mining pit by Lee et al. (1993 J. Hydraul. Eng. 119, 64-80 (doi:10.1061/(ASCE)0733-9429(1993)119:1(64))). Investigation into the effect of a local bed gradient on bedload leads to derivation of an analytical, physically meaningful expression for morphological diffusion induced by a non-zero local bed slope. Incorporation of the proposed morphological diffusion into a conventional morphodynamic model (defined as a coupling between the shallow water equations, Exner equation and an empirical formula for bedload) improves model predictions when applied to the evolution of a mining pit, without the need either to resort to special numerical treatment of the equations or to use additional tuning parameters.
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.
Hessian eigenvalue distribution in a random Gaussian landscape
Yamada, Masaki; Vilenkin, Alexander
2018-03-01
The energy landscape of multiverse cosmology is often modeled by a multi-dimensional random Gaussian potential. The physical predictions of such models crucially depend on the eigenvalue distribution of the Hessian matrix at potential minima. In particular, the stability of vacua and the dynamics of slow-roll inflation are sensitive to the magnitude of the smallest eigenvalues. The Hessian eigenvalue distribution has been studied earlier, using the saddle point approximation, in the leading order of 1/ N expansion, where N is the dimensionality of the landscape. This approximation, however, is insufficient for the small eigenvalue end of the spectrum, where sub-leading terms play a significant role. We extend the saddle point method to account for the sub-leading contributions. We also develop a new approach, where the eigenvalue distribution is found as an equilibrium distribution at the endpoint of a stochastic process (Dyson Brownian motion). The results of the two approaches are consistent in cases where both methods are applicable. We discuss the implications of our results for vacuum stability and slow-roll inflation in the landscape.
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.
The Cn method applied to problems with an anisotropic diffusion law
International Nuclear Information System (INIS)
Grandjean, P.M.
A 2-dimensional Cn calculation has been applied to homogeneous media subjected to the Rayleigh impact law. Results obtained with collision probabilities and Chandrasekhar calculations are compared to those from Cn method. Introducing in the expression of the transport equation, an expansion truncated on a polynomial basis for the outgoing angular flux (or possibly entrance flux) gives two Cn systems of algebraic linear equations for the expansion coefficients. The matrix elements of these equations are the moments of the Green function in infinite medium. The search for the Green function is effected through the Fourier transformation of the integrodifferential equation and its moments are derived from their Fourier transforms through a numerical integration in the complex plane. The method has been used for calculating the albedo in semi-infinite media, the extrapolation length of the Milne problem, and the albedo and transmission factor of a slab (a concise study of convergence is presented). A system of integro-differential equations bearing on the moments of the angular flux inside the medium has been derived, for the collision probability method. It is numerically solved with approximately the bulk flux by step functions. The albedo in semi-infinite medium has also been computed through the semi-analytical Chandrasekhar method. In the latter, the outgoing flux is expressed as a function of the entrance flux by means of a integral whose kernel is numerically derived [fr
Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices
Böttcher, A.; Bogoya, J. M.; Grudsky, S. M.; Maximenko, E. A.
2017-11-01
Analysis of the asymptotic behaviour of the spectral characteristics of Toeplitz matrices as the dimension of the matrix tends to infinity has a history of over 100 years. For instance, quite a number of versions of Szegő's theorem on the asymptotic behaviour of eigenvalues and of the so-called strong Szegő theorem on the asymptotic behaviour of the determinants of Toeplitz matrices are known. Starting in the 1950s, the asymptotics of the maximum and minimum eigenvalues were actively investigated. However, investigation of the individual asymptotics of all the eigenvalues and eigenvectors of Toeplitz matrices started only quite recently: the first papers on this subject were published in 2009-2010. A survey of this new field is presented here. Bibliography: 55 titles.
Joint density of eigenvalues in spiked multivariate models.
Dharmawansa, Prathapasinghe; Johnstone, Iain M
2014-01-01
The classical methods of multivariate analysis are based on the eigenvalues of one or two sample covariance matrices. In many applications of these methods, for example to high dimensional data, it is natural to consider alternative hypotheses which are a low rank departure from the null hypothesis. For rank one alternatives, this note provides a representation for the joint eigenvalue density in terms of a single contour integral. This will be of use for deriving approximate distributions for likelihood ratios and 'linear' statistics used in testing.
Recent developments in semiclassical mechanics: eigenvalues and reaction rate constants
International Nuclear Information System (INIS)
Miller, W.H.
1976-04-01
A semiclassical treatment of eigenvalues for a multidimensional non-separable potential function and of the rate constant for a chemical reaction with an activation barrier is presented. Both phenomena are seen to be described by essentially the same semiclassical formalism, which is based on a construction of the total Hamiltonian in terms of the complete set of ''good'' action variables (or adiabatic invariants) associated with the minimum in the potential energy surface for the eigenvalue case, or the saddle point in the potential energy surface for the case of chemical reaction
A teaching proposal for the study of Eigenvectors and Eigenvalues
Directory of Open Access Journals (Sweden)
María José Beltrán Meneu
2017-03-01
Full Text Available In this work, we present a teaching proposal which emphasizes on visualization and physical applications in the study of eigenvectors and eigenvalues. These concepts are introduced using the notion of the moment of inertia of a rigid body and the GeoGebra software. The proposal was motivated after observing students’ difficulties when treating eigenvectors and eigenvalues from a geometric point of view. It was designed following a particular sequence of activities with the schema: exploration, introduction of concepts, structuring of knowledge and application, and considering the three worlds of mathematical thinking provided by Tall: embodied, symbolic and formal.
Maximization of eigenvalues using topology optimization
DEFF Research Database (Denmark)
Pedersen, Niels Leergaard
2000-01-01
to localized modes in low density areas. The topology optimization problem is formulated using the SIMP method. Special attention is paid to a numerical method for removing localized eigenmodes in low density areas. The method is applied to numerical examples of maximizing the first eigenfrequency, One example...
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
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.
Benson, Christopher R; Maffeo, Christopher; Fatila, Elisabeth M; Liu, Yun; Sheetz, Edward G; Aksimentiev, Aleksei; Singharoy, Abhishek; Flood, Amar H
2018-05-07
The coordinated motion of many individual components underpins the operation of all machines. However, despite generations of experience in engineering, understanding the motion of three or more coupled components remains a challenge, known since the time of Newton as the "three-body problem." Here, we describe, quantify, and simulate a molecular three-body problem of threading two molecular rings onto a linear molecular thread. Specifically, we use voltage-triggered reduction of a tetrazine-based thread to capture two cyanostar macrocycles and form a [3]pseudorotaxane product. As a consequence of the noncovalent coupling between the cyanostar rings, we find the threading occurs by an unexpected and rare inchworm-like motion where one ring follows the other. The mechanism was derived from controls, analysis of cyclic voltammetry (CV) traces, and Brownian dynamics simulations. CVs from two noncovalently interacting rings match that of two covalently linked rings designed to thread via the inchworm pathway, and they deviate considerably from the CV of a macrocycle designed to thread via a stepwise pathway. Time-dependent electrochemistry provides estimates of rate constants for threading. Experimentally derived parameters (energy wells, barriers, diffusion coefficients) helped determine likely pathways of motion with rate-kinetics and Brownian dynamics simulations. Simulations verified intercomponent coupling could be separated into ring-thread interactions for kinetics, and ring-ring interactions for thermodynamics to reduce the three-body problem to a two-body one. Our findings provide a basis for high-throughput design of molecular machinery with multiple components undergoing coupled motion.
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.
Miyazaki, Yoshinori
2000-01-01
This paper is strongly based on two powerful general theorems proved by Ikebe, et. al in 1993[15] and 1996[13], which will be referred to as Theorem A and Theorem B in this paper. They were recently published and justify the approximate computations of simple eigenvalues of infinite matrices of certain types by truncation, giving an extremely accurate error estimates. So far, they have applied to some important problems in engineering, such as computing the zeros of some special functions, an...
Computation of Double Eigenvalues for Infinite Matrices of a Certain Class
宮崎, 佳典; Yoshinori, MIYAZAKI; 静岡産業大学 国際情報学部; Faculty of Communications and Informatics, Shizuoka Sangyo University
2001-01-01
It has been shown that a series of three-term recurrence relations of a certain class is a powerful tool for solving zeros of some special functions and eigenvalue problems (EVPs) of certain differential equations. Such cases include: the zeros of J_v(z); the zeros of zJ′_v(z)+HJ_v(z); the EVP of the Mathieu differential equation; and the EVP of the spheroidal wave equation. Previously by the author, it was demonstrated that the three-term recurrence relations of the class may be reformulated...
Positive Eigenvalues of Generalized Words in Two Hermitian Positive Definite Matrices
Hillar, Christopher; Johnson, Charles R.
2005-01-01
We define a word in two positive definite (complex Hermitian) matrices $A$ and $B$ as a finite product of real powers of $A$ and $B$. The question of which words have only positive eigenvalues is addressed. This question was raised some time ago in connection with a long-standing problem in theoretical physics, and it was previously approached by the authors for words in two real positive definite matrices with positive integral exponents. A large class of words that do guarantee positive eig...
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)
A Universal Quantum Circuit Scheme For Finding Complex Eigenvalues
Daskin, Anmer; Grama, Ananth; Kais, Sabre
2013-01-01
We present a general quantum circuit design for finding eigenvalues of non-unitary matrices on quantum computers using the iterative phase estimation algorithm. In particular, we show how the method can be used for the simulation of resonance states for quantum systems.
Eigenvalue estimates for submanifolds with bounded f-mean curvature
Indian Academy of Sciences (India)
GUANGYUE HUANG
1College of Mathematics and Information Science, Henan Normal University,. Xinxiang 453007 ... submanifolds in a hyperbolic space with the norm of their mean curvature vector bounded above by a constant. ..... [2] Batista M, Cavalcante M P and Pyo J, Some isoperimetric inequalities and eigenvalue estimates in ...
First-order optical systems with unimodular eigenvalues
Bastiaans, M.J.; Alieva, T.
2006-01-01
It is shown that a lossless first-order optical system whose real symplectic ray transformation matrix can be diagonalized and has only unimodular eigenvalues, is similar to a separable fractional Fourier transformer in the sense that the ray transformation matrices of the unimodular system and the
Eigenvalue estimates of positive integral operators with analytic ...
Indian Academy of Sciences (India)
Eigenvalue estimates of positive integral operators. 337 will be used to denote, respectively, the complex line integral of f along γ and the integral of f with respect to arc-length measure. In the first case we assume γ has an orientation. The notation Lp(γ ) will denote the Lp space of normalized arc length measure on γ with.
International Nuclear Information System (INIS)
Li, Gongsheng; Zhang, Dali; Jia, Xianzheng; Yamamoto, Masahiro
2013-01-01
This paper deals with an inverse problem of simultaneously identifying the space-dependent diffusion coefficient and the fractional order in the 1D time-fractional diffusion equation with smooth initial functions by using boundary measurements. The uniqueness results for the inverse problem are proved on the basis of the inverse eigenvalue problem, and the Lipschitz continuity of the solution operator is established. A modified optimal perturbation algorithm with a regularization parameter chosen by a sigmoid-type function is put forward for the discretization of the minimization problem. Numerical inversions are performed for the diffusion coefficient taking on different functional forms and the additional data having random noise. Several factors which have important influences on the realization of the algorithm are discussed, including the approximate space of the diffusion coefficient, the regularization parameter and the initial iteration. The inversion solutions are good approximations to the exact solutions with stability and adaptivity demonstrating that the optimal perturbation algorithm with the sigmoid-type regularization parameter is efficient for the simultaneous inversion. (paper)
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.
Scientific computing vol II - eigenvalues and optimization
Trangenstein, John A
2017-01-01
This is the second of three volumes providing a comprehensive presentation of the fundamentals of scientific computing. This volume discusses more advanced topics than volume one, and is largely not a prerequisite for volume three. This book and its companions show how to determine the quality of computational results, and how to measure the relative efficiency of competing methods. Readers learn how to determine the maximum attainable accuracy of algorithms, and how to select the best method for computing problems. This book also discusses programming in several languages, including C++, Fortran and MATLAB. There are 49 examples, 110 exercises, 66 algorithms, 24 interactive JavaScript programs, 77 references to software programs and 1 case study. Topics are introduced with goals, literature references and links to public software. There are descriptions of the current algorithms in LAPACK, GSLIB and MATLAB. This book could be used for a second course in numerical methods, for either upper level undergraduate...
ARGO, 1-D Neutron Diffusion in Slab, Cylindrical, Spherical Geometry from JAERI Fast-Set, ABBN, RCBN
International Nuclear Information System (INIS)
Ikawa, Koji
1971-01-01
1 - Nature of physical problem solved: ARGO is a one-dimensional (slab, cylinder or sphere), multigroup diffusion code for use in fast reactor criticality and kinetic parameter analysis. Three cross section sets, i.e., JAERI-Fast-Set, ABBN-Set and RCBN-Set, of 25 groups are prepared for the code as its library tapes. 2 - Method of solution: Eigenvalues are computed by ordinary source-iteration techniques with ordinary acceleration methods for convergence. 3 - Restrictions on the complexity of the problem: Sphere geometry
Diffusion escape through a cluster of small absorbing windows
Energy Technology Data Exchange (ETDEWEB)
Holcman, D [Department of Mathematics, Weizmann Institute of Science, Rehovot 76100 (Israel); Schuss, Z [Department of Mathematics, Tel-Aviv University, Tel-Aviv 69978 (Israel)
2008-04-18
We study the first eigenvalue of the Laplace equation in a bounded domain in R{sup d} (d=2,3) with mixed Neumann-Dirichlet (Zaremba) boundary conditions. The Neumann condition is imposed on most of the boundary and the Dirichlet boundary consists of a cluster of small windows. When the windows are well separated the first eigenvalue is asymptotically the sum of eigenvalues of mixed problems with a single Dirichlet window. However, when two or more Dirichlet windows cluster tightly together they interact nonlinearly. We compare our asymptotic approximation of the eigenvalue to the escape rate of simulated Brownian particles through the small windows.
Eigenvalue distribution of large random matrices
Pastur, Leonid
2011-01-01
Random matrix theory is a wide and growing field with a variety of concepts, results, and techniques and a vast range of applications in mathematics and the related sciences. The book, written by well-known experts, offers beginners a fairly balanced collection of basic facts and methods (Part 1 on classical ensembles) and presents experts with an exposition of recent advances in the subject (Parts 2 and 3 on invariant ensembles and ensembles with independent entries). The text includes many of the authors' results and methods on several main aspects of the theory, thus allowing them to present a unique and personal perspective on the subject and to cover many topics using a unified approach essentially based on the Stieltjes transform and orthogonal polynomials. The exposition is supplemented by numerous comments, remarks, and problems. This results in a book that presents a detailed and self-contained treatment of the basic random matrix ensembles and asymptotic regimes. This book will be an important refer...
International Nuclear Information System (INIS)
Obradovic, D.
1970-04-01
In the study of the nuclear reactors space-time behaviour the modal analysis is very often used though some basic mathematical problems connected with application of this methods are still unsolved. In this paper the modal analysis is identified as a set of the methods in the mathematical literature known as the Galerkin methods (or projection methods, or sometimes direct methods). Using the results of the mathematical investigations of these methods the applicability of the Galerkin type methods to the calculations of the eigenvalue and eigenvectors of the stationary and non-stationary diffusion operator, as well as for the solutions of the corresponding functional equations, is established (author)
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.
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)
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.
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
International Nuclear Information System (INIS)
Itagaki, Masafumi; Sahashi, Naoki.
1997-01-01
The multiple reciprocity boundary element method has been applied to three-dimensional two-group neutron diffusion problems. A matrix-type boundary integral equation has been derived to solve the first and the second group neutron diffusion equations simultaneously. The matrix-type fundamental solutions used here satisfy the equation which has a point source term and is adjoint to the neutron diffusion equations. A multiple reciprocity method has been employed to transform the matrix-type domain integral related to the fission source into an equivalent boundary one. The higher order fundamental solutions required for this formulation are composed of a series of two types of analytic functions. The eigenvalue itself is also calculated using only boundary integrals. Three-dimensional test calculations indicate that the present method provides stable and accurate solutions for criticality problems. (author)
Gravitational lensing by eigenvalue distributions of random matrix models
Martínez Alonso, Luis; Medina, Elena
2018-05-01
We propose to use eigenvalue densities of unitary random matrix ensembles as mass distributions in gravitational lensing. The corresponding lens equations reduce to algebraic equations in the complex plane which can be treated analytically. We prove that these models can be applied to describe lensing by systems of edge-on galaxies. We illustrate our analysis with the Gaussian and the quartic unitary matrix ensembles.
On Polya's inequality for torsional rigidity and first Dirichlet eigenvalue
Berg, M. van den; Ferone, V.; Nitsch, C.; Trombetti, C.
2016-01-01
Let $\\Omega$ be an open set in Euclidean space with finite Lebesgue measure $|\\Omega|$. We obtain some properties of the set function $F:\\Omega\\mapsto \\R^+$ defined by $$ F(\\Omega)=\\frac{T(\\Omega)\\lambda_1(\\Omega)}{|\\Omega|} ,$$ where $T(\\Omega)$ and $\\lambda_1(\\Omega)$ are the torsional rigidity and the first eigenvalue of the Dirichlet Laplacian respectively. We improve the classical P\\'olya bound $F(\\Omega)\\le 1,$ and show that $$F(\\Omega)\\le 1- \
A method for eigenvalues of sparse lambda-matrices
International Nuclear Information System (INIS)
Yang, W.H.
1982-01-01
The matrix N(lambda) whose elements are functions of a parameter lambda is called the lambda-matrix. Those values of lambda that make the matrix singular are of great interest in many applied fields. An efficient method for those eigenvalues of a lambda-matrix is presented. A simple explicit convergence criterion is given as well as the algorithm and two numerical examples
Eigenvalue inequalities for the Laplacian with mixed boundary conditions
Czech Academy of Sciences Publication Activity Database
Lotoreichik, Vladimir; Rohleder, J.
2017-01-01
Roč. 263, č. 1 (2017), s. 491-508 ISSN 0022-0396 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : Laplace operator * mixed boundary conditions * eigenvalue inequality * polyhedral domain * Lipschitz domain Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 1.988, year: 2016
Schaefer, P W
2000-10-01
This article addresses syndromes that clinically and/or radiologically resemble acute stroke. These syndromes generally fall into four categories. (1) Patients with acute neurological deficits with nonischemic lesions and no acute abnormality on diffusion-weighted images. These patients may have peripheral vertigo, migraines, seizures, dementia, functional disorders, amyloid angiopathy, or metabolic disorders. When these patients present, we can confidently predict that they are not undergoing infarction. (2) Patients with ischemic lesions with reversible clinical deficits. Nearly 50% of patients with transient ischemic attacks have lesions with restricted diffusion. Patients with transient global amnesia may have punctate lesions with restricted diffusion in the medial hippocampus, parahippocampal gyms, and corpus callosum. (3) Vasogenic edema syndromes that may mimic acute infarction clinically and on conventional imaging. These include eclampsia/hypertensive encephalopathy, other posterior leukoencephalopathies, human immunodeficiency virus encephalopathy, hyperperfusion syndrome following carotid endarterectomy, venous sinus thrombosis, acute demyelination, and neoplasm. These syndromes demonstrate elevated diffusion rather than the restricted diffusion associated with acute ischemic stroke. (4) Entities in which restricted diffusion may resemble acute infarction. These include pyogenic infections, herpes virus encephalitis, Creutzfeldt-Jakob disease, diffuse axonal injury, tumors with dense cell packing, and rare acute demyelinative lesions.
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.
On two-spectra inverse problems
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.
Accounting for Sampling Error in Genetic Eigenvalues Using Random Matrix Theory.
Sztepanacz, Jacqueline L; Blows, Mark W
2017-07-01
The distribution of genetic variance in multivariate phenotypes is characterized by the empirical spectral distribution of the eigenvalues of the genetic covariance matrix. Empirical estimates of genetic eigenvalues from random effects linear models are known to be overdispersed by sampling error, where large eigenvalues are biased upward, and small eigenvalues are biased downward. The overdispersion of the leading eigenvalues of sample covariance matrices have been demonstrated to conform to the Tracy-Widom (TW) distribution. Here we show that genetic eigenvalues estimated using restricted maximum likelihood (REML) in a multivariate random effects model with an unconstrained genetic covariance structure will also conform to the TW distribution after empirical scaling and centering. However, where estimation procedures using either REML or MCMC impose boundary constraints, the resulting genetic eigenvalues tend not be TW distributed. We show how using confidence intervals from sampling distributions of genetic eigenvalues without reference to the TW distribution is insufficient protection against mistaking sampling error as genetic variance, particularly when eigenvalues are small. By scaling such sampling distributions to the appropriate TW distribution, the critical value of the TW statistic can be used to determine if the magnitude of a genetic eigenvalue exceeds the sampling error for each eigenvalue in the spectral distribution of a given genetic covariance matrix. Copyright © 2017 by the Genetics Society of America.
Cluster structure in the correlation coefficient matrix can be characterized by abnormal eigenvalues
Nie, Chun-Xiao
2018-02-01
In a large number of previous studies, the researchers found that some of the eigenvalues of the financial correlation matrix were greater than the predicted values of the random matrix theory (RMT). Here, we call these eigenvalues as abnormal eigenvalues. In order to reveal the hidden meaning of these abnormal eigenvalues, we study the toy model with cluster structure and find that these eigenvalues are related to the cluster structure of the correlation coefficient matrix. In this paper, model-based experiments show that in most cases, the number of abnormal eigenvalues of the correlation matrix is equal to the number of clusters. In addition, empirical studies show that the sum of the abnormal eigenvalues is related to the clarity of the cluster structure and is negatively correlated with the correlation dimension.
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.
Solution of the Fokker-Planck equation with a logarithmic potential and mixed eigenvalue spectrum
Guarnieri, F.; Moon, W.; Wettlaufer, J. S.
2017-09-01
Motivated by a problem in climate dynamics, we investigate the solution of a Bessel-like process with a negative constant drift, described by a Fokker-Planck equation with a potential V (x ) =-[b ln(x ) +a x ] , for b >0 and a finance. The Bessel-like process we consider can be solved by seeking solutions through an expansion into a complete set of eigenfunctions. The associated imaginary-time Schrödinger equation exhibits a mix of discrete and continuous eigenvalue spectra, corresponding to the quantum Coulomb potential describing the bound states of the hydrogen atom. We present a technique to evaluate the normalization factor of the continuous spectrum of eigenfunctions that relies solely upon their asymptotic behavior. We demonstrate the technique by solving the Brownian motion problem and the Bessel process both with a constant negative drift. We conclude with a comparison to other analytical methods and with numerical solutions.
Calculation of the power factor using the neutron diffusion hybrid equation
International Nuclear Information System (INIS)
Costa da Silva, Adilson; Carvalho da Silva, Fernando; Senra Martinez, Aquilino
2013-01-01
Highlights: ► A neutron diffusion hybrid equation with an external neutron source was used. ► Nodal expansion method to obtain the neutron flux was used. ► Nuclear power factors in each fuel element in the reactor core were calculated. ► The results obtained were very accurate. -- Abstract: In this paper, we used a neutron diffusion hybrid equation with an external neutron source to calculate nuclear power factors in each fuel element in the reactor core. We used the nodal expansion method to obtain the neutron flux for a given control rods bank position. The results were compared with results obtained for eigenvalue problem near criticality condition and fixed source problem during the start-up of the reactor, where external neutron sources are extremely important for the stabilization of external neutron detectors.
An eigenvalue approach to quantum plasmonics based on a self-consistent hydrodynamics method.
Ding, Kun; Chan, C T
2018-02-28
Plasmonics has attracted much attention not only because it has useful properties such as strong field enhancement, but also because it reveals the quantum nature of matter. To handle quantum plasmonics effects, ab initio packages or empirical Feibelman d-parameters have been used to explore the quantum correction of plasmonic resonances. However, most of these methods are formulated within the quasi-static framework. The self-consistent hydrodynamics model offers a reliable approach to study quantum plasmonics because it can incorporate the quantum effect of the electron gas into classical electrodynamics in a consistent manner. Instead of the standard scattering method, we formulate the self-consistent hydrodynamics method as an eigenvalue problem to study quantum plasmonics with electrons and photons treated on the same footing. We find that the eigenvalue approach must involve a global operator, which originates from the energy functional of the electron gas. This manifests the intrinsic nonlocality of the response of quantum plasmonic resonances. Our model gives the analytical forms of quantum corrections to plasmonic modes, incorporating quantum electron spill-out effects and electrodynamical retardation. We apply our method to study the quantum surface plasmon polariton for a single flat interface.
Energy Technology Data Exchange (ETDEWEB)
Ganev, K; Yordanov, D
1983-01-01
The formulation of a diffusion problem for numerical models, in which the near earth layer of the atmosphere (PSA) is considered parametrically relative to the zones of pollution (the protected zones) which are also located in the near earth layer of atmosphere, is examined. In modeling atmospheric pollution, the semiempirical equation of turublent diffusion is the starting point. The results are cited of numerical calculations of the functions of the effect for the city of Sofia (the case of an even relief and the disposition of the protected zone totally within the region for which the problem is being solved). The isolines of the integral function of the effect relative to the near earth layer of the atmosphere above the city of Sofia are cited for different meteorological conditions.
Energy Technology Data Exchange (ETDEWEB)
Stephansen, A.F
2007-12-15
In this thesis we analyse a discontinuous Galerkin (DG) method and two computable a posteriori error estimators for the linear and stationary advection-diffusion-reaction equation with heterogeneous diffusion. The DG method considered, the SWIP method, is a variation of the Symmetric Interior Penalty Galerkin method. The difference is that the SWIP method uses weighted averages with weights that depend on the diffusion. The a priori analysis shows optimal convergence with respect to mesh-size and robustness with respect to heterogeneous diffusion, which is confirmed by numerical tests. Both a posteriori error estimators are of the residual type and control the energy (semi-)norm of the error. Local lower bounds are obtained showing that almost all indicators are independent of heterogeneities. The exception is for the non-conforming part of the error, which has been evaluated using the Oswald interpolator. The second error estimator is sharper in its estimate with respect to the first one, but it is slightly more costly. This estimator is based on the construction of an H(div)-conforming Raviart-Thomas-Nedelec flux using the conservativeness of DG methods. Numerical results show that both estimators can be used for mesh-adaptation. (author)
International Nuclear Information System (INIS)
Yuste, Santos Bravo; Abad, Enrique
2011-01-01
We present an iterative method to obtain approximations to Bessel functions of the first kind J p (x) (p > -1) via the repeated application of an integral operator to an initial seed function f 0 (x). The class of seed functions f 0 (x) leading to sets of increasingly accurate approximations f n (x) is considerably large and includes any polynomial. When the operator is applied once to a polynomial of degree s, it yields a polynomial of degree s + 2, and so the iteration of this operator generates sets of increasingly better polynomial approximations of increasing degree. We focus on the set of polynomial approximations generated from the seed function f 0 (x) = 1. This set of polynomials is useful not only for the computation of J p (x) but also from a physical point of view, as it describes the long-time decay modes of certain fractional diffusion and diffusion-wave problems.
International Nuclear Information System (INIS)
Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.
1977-11-01
The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P 1 ) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently
Energy Technology Data Exchange (ETDEWEB)
Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.
1977-11-01
The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P/sub 1/) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently.
Diffusion archeology for diffusion progression history reconstruction.
Sefer, Emre; Kingsford, Carl
2016-11-01
Diffusion through graphs can be used to model many real-world processes, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring - perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need to reconstruct how the present state of the diffusion came to be from partial diffusion data. Here, we tackle the problem of reconstructing a diffusion history from one or more snapshots of the diffusion state. This ability can be invaluable to learn when certain computer nodes are infected or which people are the initial disease spreaders to control future diffusions. We formulate this problem over discrete-time SEIRS-type diffusion models in terms of maximum likelihood. We design methods that are based on submodularity and a novel prize-collecting dominating-set vertex cover (PCDSVC) relaxation that can identify likely diffusion steps with some provable performance guarantees. Our methods are the first to be able to reconstruct complete diffusion histories accurately in real and simulated situations. As a special case, they can also identify the initial spreaders better than the existing methods for that problem. Our results for both meme and contaminant diffusion show that the partial diffusion data problem can be overcome with proper modeling and methods, and that hidden temporal characteristics of diffusion can be predicted from limited data.
TVEDIM, 2-D Homogeneous and Inhomogeneous Neutron Diffusion for X-Y, R-Z, R-Theta Geometry
International Nuclear Information System (INIS)
Kristiansen, G.K.
1987-01-01
1 - Nature of physical problem solved: The two-dimensional neutron diffusion equation (x-y, r-z, or r-theta geometry is solved, either in the inhomogeneous (source calculation) or the homogeneous form (K eff calculation or absorber adjustment). The boundary conditions specify each group current as a linear homogeneous function of the group fluxes (gamma matrix concept). For each material, the fission matrix is assumed to by dyadic. 2 - Method of solution: Finite difference formulation (5 point scheme, mesh corner variant) is used. Solution technique: multi-line SOR. Eigenvalue estimate by neutron balance
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
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.
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.
Solution of the Multigroup-Diffusion equation by the response matrix method
International Nuclear Information System (INIS)
Oliveira, C.R.E.
1980-10-01
A preliminary analysis of the response matrix method is made, considering its application to the solution of the multigroup diffusion equations. The one-dimensional formulation is presented and used to test some flux expansions, seeking the application of the method to the two-dimensional problem. This formulation also solves the equations that arise from the integro-differential synthesis algorithm. The slow convergence of the power method, used to solve the eigenvalue problem, and its acceleration by means of the Chebyshev polynomial method, are also studied. An algorithm for the estimation of the dominance ratio is presented, based on the residues of two successive iteration vectors. This ratio, which is not known a priori, is fundamental for the efficiency of the method. Some numerical problems are solved, testing the 1D formulation of the response matrix method, its application to the synthesis algorithm and also, at the same time, the algorithm to accelerate the source problem. (Author) [pt
International Nuclear Information System (INIS)
Santos, Frederico P.; Alves Filho, Hermes; Barros, Ricardo C.; Xavier, Vinicius S.
2011-01-01
The scattering source iterative (SI) scheme is traditionally applied to converge fine-mesh numerical solutions to fixed-source discrete ordinates (S N ) neutron transport problems. The SI scheme is very simple to implement under a computational viewpoint. However, the SI scheme may show very slow convergence rate, mainly for diffusive media (low absorption) with several mean free paths in extent. In this work we describe an acceleration technique based on an improved initial guess for the scattering source distribution within the slab. In other words, we use as initial guess for the fine-mesh scattering source, the coarse-mesh solution of the neutron diffusion equation with special boundary conditions to account for the classical S N prescribed boundary conditions, including vacuum boundary conditions. Therefore, we first implement a spectral nodal method that generates coarse-mesh diffusion solution that is completely free from spatial truncation errors, then we reconstruct this coarse-mesh solution within each spatial cell of the discretization grid, to further yield the initial guess for the fine-mesh scattering source in the first S N transport sweep (μm > 0 and μm < 0, m = 1:N) across the spatial grid. We consider a number of numerical experiments to illustrate the efficiency of the offered diffusion synthetic acceleration (DSA) technique. (author)
Iterative schemes for obtaining dominant alpha-modes of the neutron diffusion equation
International Nuclear Information System (INIS)
Singh, K.P.; Modak, R.S.; Degweker, S.B.; Singh, Kanchhi
2009-01-01
Two new methods of obtaining dominant prompt alpha-modes (sometimes referred to as time-eigenfunctions) of the multigroup neutron diffusion equation are discussed. In the first of these, we initially compute the dominant K-eigenfunctions and K-eigenvalues (denoted by λ 1 , λ 2 , λ 3 ...λ 1 being equal to the K eff ) for the given nuclear reactor model, by existing method based on sub-space iteration (SSI) which is an improved version of power iteration method. Subsequently, a uniformly distributed (positive or negative) 1/v absorber of sufficient concentration is added so as to make a particular eigenvalue λ i equal to unity. This gives ith alpha-mode. This procedure is repeated to find all the required alpha-modes. In the second method, we solve the alpha-eigenvalue problem directly by SSI method. This is clearly possible for a sub-critical reactor for which the inverse of the dominant alpha-eigenvalues are also the largest in magnitude as required by the SSI method. Here, the procedure is made applicable even to a super-critical reactor by making the reactor model sub-critical by the addition of a 1/v absorber. Results of these calculations for a 3-D two group PHWR test-case are given. These results are validated against the results as obtained by a completely different approach based on Orthomin(1) algorithm published earlier. The direct method based on the sub-space iteration strategy is found to be a simple and reliable method for obtaining any number of alpha-modes. Also comments have been made on the relationship between fundamental α and k values.
Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold.
Palacios, Jonathan; Yeh, Harry; Wang, Wenping; Zhang, Yue; Laramee, Robert S; Sharma, Ritesh; Schultz, Thomas; Zhang, Eugene
2016-03-01
Three-dimensional symmetric tensor fields have a wide range of applications in solid and fluid mechanics. Recent advances in the (topological) analysis of 3D symmetric tensor fields focus on degenerate tensors which form curves. In this paper, we introduce a number of feature surfaces, such as neutral surfaces and traceless surfaces, into tensor field analysis, based on the notion of eigenvalue manifold. Neutral surfaces are the boundary between linear tensors and planar tensors, and the traceless surfaces are the boundary between tensors of positive traces and those of negative traces. Degenerate curves, neutral surfaces, and traceless surfaces together form a partition of the eigenvalue manifold, which provides a more complete tensor field analysis than degenerate curves alone. We also extract and visualize the isosurfaces of tensor modes, tensor isotropy, and tensor magnitude, which we have found useful for domain applications in fluid and solid mechanics. Extracting neutral and traceless surfaces using the Marching Tetrahedra method can cause the loss of geometric and topological details, which can lead to false physical interpretation. To robustly extract neutral surfaces and traceless surfaces, we develop a polynomial description of them which enables us to borrow techniques from algebraic surface extraction, a topic well-researched by the computer-aided design (CAD) community as well as the algebraic geometry community. In addition, we adapt the surface extraction technique, called A-patches, to improve the speed of finding degenerate curves. Finally, we apply our analysis to data from solid and fluid mechanics as well as scalar field analysis.
Intergenerational Correlation in Monte Carlo k-Eigenvalue Calculation
International Nuclear Information System (INIS)
Ueki, Taro
2002-01-01
This paper investigates intergenerational correlation in the Monte Carlo k-eigenvalue calculation of a neutron effective multiplicative factor. To this end, the exponential transform for path stretching has been applied to large fissionable media with localized highly multiplying regions because in such media an exponentially decaying shape is a rough representation of the importance of source particles. The numerical results show that the difference between real and apparent variances virtually vanishes for an appropriate value of the exponential transform parameter. This indicates that the intergenerational correlation of k-eigenvalue samples could be eliminated by the adjoint biasing of particle transport. The relation between the biasing of particle transport and the intergenerational correlation is therefore investigated in the framework of collision estimators, and the following conclusion has been obtained: Within the leading order approximation with respect to the number of histories per generation, the intergenerational correlation vanishes when immediate importance is constant, and the immediate importance under simulation can be made constant by the biasing of particle transport with a function adjoint to the source neutron's distribution, i.e., the importance over all future generations
Reflectance variability of surface coatings reveals characteristic eigenvalue spectra
Medina, José M.; Díaz, José A.; Barros, Rui
2012-10-01
We have examined the trial-to-trial variability of the reflectance spectra of surface coatings containing effect pigments. Principal component analysis of reflectances was done at each detection angle separately. A method for classification of principal components is applied based on the eigenvalue spectra. It was found that the eigenvalue spectra follow characteristic power laws and depend on the detection angle. Three different subsets of principal components were examined to separate the relevant spectral features related to the pigments from other noise sources. Reconstruction of the reflectance spectra by taking only the first subset indicated that reflectance variability was higher at near-specular reflection, suggesting a correlation with the trial-to-trial deposition of effect pigments. Reconstruction by using the second subset indicates that variability was higher at short wavelengths. Finally, reconstruction by using only the third subset indicates that reflectance variability was not totally random as a function of the wavelength. The methods employed can be useful in the evaluation of color variability in industrial paint application processes.
Eigenvalue-dependent neutron energy spectra: Definitions, analyses, and applications
International Nuclear Information System (INIS)
Cacuci, D.G.; Ronen, Y.; Shayer, Z.; Wagschal, J.J.; Yeivin, Y.
1982-01-01
A general qualitative analysis of spectral effects that arise from solving the kappa-, α-, γ-, and sigma-eigenvalue formulations of the neutron transport equation for nuclear systems that deviate (to first order) from criticality is presented. Hierarchies of neutron spectra softness are established and expressed concisely in terms of the newly introduced spatialdependent local spectral indices for the core and for the reflector. It is shown that each hierarchy is preserved, regardless of the nature of the specific physical mechanism that cause the system to deviate from criticality. Qualitative conclusions regarding the general behavior of the spectrum-dependent integral spectral indices and ICRs corresponding to the kappa-, α-, γ-, and sigma-eigenvalue formalisms are also presented. By defining spectral indices separately for the core and for the reflector, it is possible to account for the characteristics of neutron spectra in both the core and the reflector. The distinctions between the spectra in the core and in the reflector could not have been accounted for by using a single type of spectral index (e.g., a spectral index for the entire system or a spectral index solely for the core)
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 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.)
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
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.)
On the ratio probability of the smallest eigenvalues in the Laguerre unitary ensemble
Atkin, Max R.; Charlier, Christophe; Zohren, Stefan
2018-04-01
We study the probability distribution of the ratio between the second smallest and smallest eigenvalue in the Laguerre unitary ensemble. The probability that this ratio is greater than r > 1 is expressed in terms of an Hankel determinant with a perturbed Laguerre weight. The limiting probability distribution for the ratio as is found as an integral over containing two functions q 1(x) and q 2(x). These functions satisfy a system of two coupled Painlevé V equations, which are derived from a Lax pair of a Riemann-Hilbert problem. We compute asymptotic behaviours of these functions as and , as well as large n asymptotics for the associated Hankel determinants in several regimes of r and x.
Homogenization of neutronic diffusion models
International Nuclear Information System (INIS)
Capdebosq, Y.
1999-09-01
In order to study and simulate nuclear reactor cores, one needs to access the neutron distribution in the core. In practice, the description of this density of neutrons is given by a system of diffusion equations, coupled by non differential exchange terms. The strong heterogeneity of the medium constitutes a major obstacle to the numerical computation of this models at reasonable cost. Homogenization appears as compulsory. Heuristic methods have been developed since the origin by nuclear physicists, under a periodicity assumption on the coefficients. They consist in doing a fine computation one a single periodicity cell, to solve the system on the whole domain with homogeneous coefficients, and to reconstruct the neutron density by multiplying the solutions of the two computations. The objectives of this work are to provide mathematically rigorous basis to this factorization method, to obtain the exact formulas of the homogenized coefficients, and to start on geometries where two periodical medium are placed side by side. The first result of this thesis concerns eigenvalue problem models which are used to characterize the state of criticality of the reactor, under a symmetry assumption on the coefficients. The convergence of the homogenization process is proved, and formulas of the homogenized coefficients are given. We then show that without symmetry assumptions, a drift phenomenon appears. It is characterized by the mean of a real Bloch wave method, which gives the homogenized limit in the general case. These results for the critical problem are then adapted to the evolution model. Finally, the homogenization of the critical problem in the case of two side by side periodic medium is studied on a one dimensional on equation model. (authors)
A Geršgorin-type eigenvalue localization set with n parameters for stochastic matrices
Directory of Open Access Journals (Sweden)
Wang Xiaoxiao
2018-04-01
Full Text Available A set in the complex plane which involves n parameters in [0, 1] is given to localize all eigenvalues different from 1 for stochastic matrices. As an application of this set, an upper bound for the moduli of the subdominant eigenvalues of a stochastic matrix is obtained. Lastly, we fix n parameters in [0, 1] to give a new set including all eigenvalues different from 1, which is tighter than those provided by Shen et al. (Linear Algebra Appl. 447 (2014 74-87 and Li et al. (Linear and Multilinear Algebra 63(11 (2015 2159-2170 for estimating the moduli of subdominant eigenvalues.
Periodic Solutions, Eigenvalue Curves, and Degeneracy of the Fractional Mathieu Equation
International Nuclear Information System (INIS)
Parra-Hinojosa, A; Gutiérrez-Vega, J C
2016-01-01
We investigate the eigenvalue curves, the behavior of the periodic solutions, and the orthogonality properties of the Mathieu equation with an additional fractional derivative term using the method of harmonic balance. The addition of the fractional derivative term breaks the hermiticity of the equation in such a way that its eigenvalues need not be real nor its eigenfunctions orthogonal. We show that for a certain choice of parameters the eigenvalue curves reveal the appearance of degenerate eigenvalues. We offer a detailed discussion of the matrix representation of the differential operator corresponding to the fractional Mathieu equation, as well as some numerical examples of its periodic solutions. (paper)
An algorithm of α-and γ-mode eigenvalue calculations by Monte Carlo method
International Nuclear Information System (INIS)
Yamamoto, Toshihiro; Miyoshi, Yoshinori
2003-01-01
A new algorithm for Monte Carlo calculation was developed to obtain α- and γ-mode eigenvalues. The α is a prompt neutron time decay constant measured in subcritical experiments, and the γ is a spatial decay constant measured in an exponential method for determining the subcriticality. This algorithm can be implemented into existing Monte Carlo eigenvalue calculation codes with minimum modifications. The algorithm was implemented into MCNP code and the performance of calculating the both mode eigenvalues were verified through comparison of the calculated eigenvalues with the ones obtained by fixed source calculations. (author)
Form of multicomponent Fickian diffusion coefficients matrix
International Nuclear Information System (INIS)
Wambui Mutoru, J.; Firoozabadi, Abbas
2011-01-01
Highlights: → Irreversible thermodynamics establishes form of multicomponent diffusion coefficients. → Phenomenological coefficients and thermodynamic factors affect sign of diffusion coefficients. → Negative diagonal elements of diffusion coefficients matrix can occur in non-ideal mixtures. → Eigenvalues of the matrix of Fickian diffusion coefficients may not be all real. - Abstract: The form of multicomponent Fickian diffusion coefficients matrix in thermodynamically stable mixtures is established based on the form of phenomenological coefficients and thermodynamic factors. While phenomenological coefficients form a symmetric positive definite matrix, the determinant of thermodynamic factors matrix is positive. As a result, the Fickian diffusion coefficients matrix has a positive determinant, but its elements - including diagonal elements - can be negative. Comprehensive survey of reported diffusion coefficients data for ternary and quaternary mixtures, confirms that invariably the determinant of the Fickian diffusion coefficients matrix is positive.
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
International Nuclear Information System (INIS)
Yin Chen; Xu Mingyu
2009-01-01
We set up a one-dimensional mathematical model with a Caputo fractional operator of a drug released from a polymeric matrix that can be dissolved into a solvent. A two moving boundaries problem in fractional anomalous diffusion (in time) with order α element of (0, 1] under the assumption that the dissolving boundary can be dissolved slowly is presented in this paper. The two-parameter regular perturbation technique and Fourier and Laplace transform methods are used. A dimensionless asymptotic analytical solution is given in terms of the Wright function
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
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.
Multivariate analysis of eigenvalues and eigenvectors in tensor based morphometry
Rajagopalan, Vidya; Schwartzman, Armin; Hua, Xue; Leow, Alex; Thompson, Paul; Lepore, Natasha
2015-01-01
We develop a new algorithm to compute voxel-wise shape differences in tensor-based morphometry (TBM). As in standard TBM, we non-linearly register brain T1-weighed MRI data from a patient and control group to a template, and compute the Jacobian of the deformation fields. In standard TBM, the determinants of the Jacobian matrix at each voxel are statistically compared between the two groups. More recently, a multivariate extension of the statistical analysis involving the deformation tensors derived from the Jacobian matrices has been shown to improve statistical detection power.7 However, multivariate methods comprising large numbers of variables are computationally intensive and may be subject to noise. In addition, the anatomical interpretation of results is sometimes difficult. Here instead, we analyze the eigenvalues and the eigenvectors of the Jacobian matrices. Our method is validated on brain MRI data from Alzheimer's patients and healthy elderly controls from the Alzheimer's Disease Neuro Imaging Database.
Perturbation of embedded eigenvalue by a near-lying resonance
Energy Technology Data Exchange (ETDEWEB)
Belyaev, V B; Motovilov, A K
1997-12-31
The case of quantum-mechanical system (including electronic molecules) is considered where Hamiltonian allows a separation, in particular by the Faddeev method, of a weakly coupled channel. Width (i.e. the imaginary part) of the resonance generated by a discrete spectrum eigenvalue of the separated channel is studied in the case where main part of the Hamiltonian gives itself another resonance. It is shown that if real parts of these resonances coincide and, at the same time, a coupling between the separated and main channels is sufficiently small then the width of the resonance generated by the separated (molecular) channel is inversely proportional to the width of the main (nuclear) channel resonance. This phenomenon being a kind of universal law, may play an important role increasing the `cold fusion` probability in electronic molecules whose nuclear constituents have narrow pre-threshold resonances. 21 refs.
Greiner, R; Herr, A; Brodie, J; Haynes, D
2005-01-01
This paper presents a multi-criteria based tool for assessing the relative impact of diffuse-source pollution to the Great Barrier Reef (GBR) from the river basins draining into the GBR lagoon. The assessment integrates biophysical and ecological data of water quality and pollutant concentrations with socio-economic information pertaining to non-point source pollution and (potential) pollutant impact. The tool generates scores for each river basin against four criteria, thus profiling the basins and enabling prioritization of management alternatives between and within basins. The results support policy development for pollution control through community participation, scientific data integration and expert knowledge contributed by people from across the catchment. The results specifically provided support for the Reef Water Quality Protection Plan, released in October 2003. The aim of the plan is to provide a framework for reducing discharge of sediment, nutrient and other diffuse-source loads and (potential) impact of that discharge and for prioritising management actions both between and within river basins.
International Nuclear Information System (INIS)
Watson, F.V.
1982-01-01
An adaptation of the alternate direction method for coarse mesh calculation, is presented. The algorithm is applicable to two-and three dimensional problems, the last being the more interesting one. (E.G.) [pt
International Nuclear Information System (INIS)
Jagannathan, V.
1985-01-01
A modular computer code system called FEMSYN has been developed to solve the multigroup diffusion theory equations. The various methods that are incorporated in FEMSYN are (i) finite difference method (FDM) (ii) finite element method (FEM) and (iii) single channel flux synthesis method (SCFS). These methods are described in detail in parts II, III and IV of the present report. In this report, a comparison of the accuracy and the speed of different methods of solution for some benchmark problems are reported. The input preparation and listing of sample input and output are included in the Appendices. The code FEMSYN has been used to solve a wide variety of reactor core problems. It can be used for both LWR and PHWR applications. (author)
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
DIF3D: a code to solve one-, two-, and three-dimensional finite-difference diffusion theory problems
International Nuclear Information System (INIS)
Derstine, K.L.
1984-04-01
The mathematical development and numerical solution of the finite-difference equations are summarized. The report provides a guide for user application and details the programming structure of DIF3D. Guidelines are included for implementing the DIF3D export package on several large scale computers. Optimized iteration methods for the solution of large-scale fast-reactor finite-difference diffusion theory calculations are presented, along with their theoretical basis. The computational and data management considerations that went into their formulation are discussed. The methods utilized include a variant of the Chebyshev acceleration technique applied to the outer fission source iterations and an optimized block successive overrelaxation method for the within-group iterations. A nodal solution option intended for analysis of LMFBR designs in two- and three-dimensional hexagonal geometries is incorporated in the DIF3D package and is documented in a companion report, ANL-83-1
Absence of positive eigenvalues for hard-core N-body systems
DEFF Research Database (Denmark)
Ito, K.; Skibsted, Erik
We show absence of positive eigenvalues for generalized 2-body hard-core Schrödinger operators under the condition of bounded strictly convex obstacles. A scheme for showing absence of positive eigenvalues for generalized N-body hard-core Schrödinger operators, N≥ 2, is presented. This scheme inv...
Estimates of the first Dirichlet eigenvalue from exit time moment spectra
DEFF Research Database (Denmark)
Hurtado, Ana; Markvorsen, Steen; Palmer, Vicente
2013-01-01
We compute the first Dirichlet eigenvalue of a geodesic ball in a rotationally symmetric model space in terms of the moment spectrum for the Brownian motion exit times from the ball. This expression implies an estimate as exact as you want for the first Dirichlet eigenvalue of a geodesic ball...
Ground eigenvalue and eigenfunction of a spin-weighted spheroidal wave equation in low frequencies
Institute of Scientific and Technical Information of China (English)
Tang Wen-Lin; Tian Gui-Hua
2011-01-01
Spin-weighted spheroidal wave functions play an important role in the study of the linear stability of rotating Kerr black holes and are studied by the perturbation method in supersymmetric quantum mechanics. Their analytic ground eigenvalues and eigenfunctions are obtained by means of a series in low frequency. The ground eigenvalue and eigenfunction for small complex frequencies are numerically determined.
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.)
An inverse Sturm–Liouville problem with a fractional derivative
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