Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized eigenvalue problem”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

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

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗

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

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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

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)

97 MATHEMATICS AND COMPUTING↗

Band-gap boundaries and fundamental solitons in complex two-dimensional nonlinear lattices

Nonlinear Schroedinger (NLS) equation with external potentials (lattices) possessing crystal and quasicrystal structures are studied. The fundamental solitons and band gaps are computed using a spectral fixed-point numerical scheme. Nonlinear and linear stability properties of the fundamental solitons are investigated by direct simulations and the linear stability properties of the fundamental solitons are confirmed by analysis the linearized eigenvalue problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exact and Model Exchange-Correlation Potentials for Open-Shell Systems

The conventional approaches to the inverse density functional theory problem typically assume nondegeneracy of the Kohn–Sham (KS) eigenvalues, greatly hindering their use in open-shell systems. Here, we present a generalization of the inverse density functional theory problem that can seamlessly admit degenerate KS eigenvalues. Additionally, we allow for fractional occupancy of the Kohn–Sham orbitals to also handle noninteracting ensemble-v-representable densities, as opposed to just noninteracting pure-v-representable densities. We present the exact exchange-correlation (XC) potentials for six open-shell systems–four atoms (Li, C, N, and O) and two molecules (CN and CH 2 )–using accurate ground-state densities from configuration interaction calculations. We compare these exact XC potentials with model XC potentials obtained using nonlocal (B3LYP, SCAN0) and local/semilocal (SCAN, PBE, PW92) XC functionals. Although the relative errors in the densities obtained from these DFT functionals are of $O$(10 –3 to 10 –2 ), the relative errors in the model XC potentials remain substantially large–$O$(10 –1 to 10 0 ).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗

(U) SENSMG: First-Order Sensitivities of Neutron Reaction Rates, Reaction-Rate Ratios, Leakage, k eff , α , and Subcritical Multiplication Using PARTISN

SENSMG is a tool for computing first-order sensitivities of neutron reaction rates, reaction-rate ratios, leakage, k eff , α, and subcritical multiplication using the PARTISN multigroup discrete-ordinates code. SENSMG computes sensitivities to all of the transport cross sections and data (total, fission, a nu, chi, and all scattering moments), two edit cross sections (absorption and capture), and the density for every nuclide and energy group. It also computes sensitivities to the mass density for every material and derivatives with respect to all interface locations and outer boundaries. It computes sensitivities to user specified reactions whose cross sections are available in a user-supplied NJOY output file. The tool can be used for one-dimensional spherical and slab (r) and two-dimensional cylindrical (r-z) geometries. The tool can be used for fixed-source and eigenvalue problems. For most responses, the tool implements Generalized Perturbation Theory (GPT) as discussed by Williams and Stacey. The tool is thus limited to computing sensitivities only for GPT-allowable responses. For subcritical multiplication, the tool implements sensitivities derived by O’Brien and Clark. SENSMG has a similar role as the old SWANLAKE (Ref. 8), FORSS (Ref. 9), and SENSIT (Ref. 10) codes. It has capabilities similar to those of SUSD3D (Refs. 11 and 12), which also uses PARTISN. Section II of this report describes the theory behind adjoint-based sensitivities, gives the equations that SENSMG solves, and defines the sensitivities that are output. Section III describes the user interface, including the input file and command line options. Section IV describes the output. Section V gives some notes about the coding that may be of interest. Section VI presents some sample problems and discusses verification, which is ongoing. Section VII lists needs and ideas for future work. Appendix A lists most of the input files whose results are presented in Sec. VI. Appendix B provides some useful details on one of the cross-section libraries that SENSMG supports.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Eigensensitivity analysis for space structures

The main thrust of this paper is to study eigensensitivity analysis techniques and their applications to design optimization of space structures. It is found that in general, space structures show four types of eigenvalue problems most of which are related to repeated eigenvalues. This paper first gives a detailed derivation of eigensensitivity equations. Later, numerical examples are provided to verify the derived sensitivity equations as well as to demonstrate the applicability of those sensitivity equations in an iterative design environment.

Hou, Jean W.↗

Solution of A. Einstein’s Problem on the Density of Matter in the Universe

On the basis of the special theory of relativity and a solution of the Schwarzschild equations of general relativity, a generalized equation of Friedmann–Einstein–de Sitter type has been obtained for the expanding Universe. As a result of our work on the boundary value problem for this equation, we have found the eigenvalue of the resulting eigenvalue problem, linking the density of the Universe in the comoving coordinates, the Hubble constant, and the gravitational constant. We have calculated a value for the density of matter in the Universe which is in agreement with the observational data. We have shown that the missing dark energy is the relativistic kinematic and potential energy of the expanding Universe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient design sensitivity analysis of eigenvectors

Subspace iteration has been a major advance in solving large eigen problems when only a subset of eigen-pairs is required. The essence of this method is a transformation from displacement coordinates of an n-th order eigensystem to generalized coordinates of a smaller q-th order. The eigenvalue problem is then solved in the reduced space. The method was first developed by Clint and Jennings for real symmetric systems and was then called 'simultaneous iteration'. The success of the method prompted further research along this line and there have been many improved algorithms developed. This approach has been widely used by structural engineers for extracting the most useful natural frequencies and mode shapes of large-scale dynamic systems. This paper exploits into a new direction which is in the form of iterative process for simultaneously calculating eigenvector derivatives of many eigenvectors with respect to multi-variables. The method fully uses all the available information from preceding eigenvalue solution and, thus, effectively economizes computational efforts. It iterates through two equations derived from the first variation of the two fundamental equations used in subspace iteration method. There is no expensive large matrix decomposition required and the process converges to acceptable solution in a finite number of iterations. Therefore, the procedure increases its efficiency superiority over the others as the system size or the number of interested eigenvectors become larger and larger.

Ting, T.↗

A short proof of Weyl's law for fractional differential operators

We study spectral asymptotics for a large class of differential operators on an open subset of R{sup d} with finite volume. This class includes the Dirichlet Laplacian, the fractional Laplacian, and also fractional differential operators with non-homogeneous symbols. Based on a sharp estimate for the sum of the eigenvalues we establish the first term of the semiclassical asymptotics. This generalizes Weyl's law for the Laplace operator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time series analysis and Monte Carlo methods for eigenvalue separation in neutron multiplication problems

A time series approach has been applied to the nuclear fission source distribution generated by Monte Carlo (MC) particle transport in order to calculate the non-fundamental mode eigenvalues of the system. The novel aspect is the combination of the general technical principle of projection pursuit for multivariate data with the neutron multiplication eigenvalue problem in the nuclear engineering discipline. Proof is thoroughly provided that the stationary MC process is linear to first order approximation and that it transforms into one-dimensional autoregressive processes of order one (AR(1)) via the automated choice of projection vectors. The autocorrelation coefficient of the resulting AR(1) process corresponds to the ratio of the desired mode eigenvalue to the fundamental mode eigenvalue. All modern MC codes for nuclear criticality calculate the fundamental mode eigenvalue, so the desired mode eigenvalue can be easily determined. This time series approach was tested for a variety of problems including multi-dimensional ones. Numerical results show that the time series approach has strong potential for three dimensional whole reactor core. The eigenvalue ratio can be updated in an on-the-fly manner without storing the nuclear fission source distributions at all previous iteration cycles for the mean subtraction. Lastly, the effects of degenerate eigenvalues are investigated and solutions are provided.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Survey of methods for calculating sensitivity of general eigenproblems

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

Murthy, Durbha V.↗

Extension of the PINN diffusion model to k-eigenvalue problems

This paper extends our recent work on the Physics-Informed Neural Networks (PINN) approach for the fixed source diffusion models and applies it to the diffusion theory based k-eigenvalue problems. To make the PINN equitable for the eigenvalue problems, we introduce a novel integral regularization term to the loss function in the framework, and allow the direct inference of the principal eigenvalue and the associated eigenfunction. The regularization term enforces a pre-defined value on the integration of the model predictions, and this value can be directly related to a physical property of the system. We also introduce an additional learnable parameter to approximate the principal eigenvalue. As a proof of principle, we solve the one-group two-dimensional k-eigenvalue neutron diffusion equation in this work. We then provide two numerical examples to demonstrate the applicability of the PINN approach. In each example, we solve the k-eigenvalue diffusion equation in a multi-region configuration constrained with a set of Robin boundary conditions for generality. We use a FEM solution based on the power-iteration method to verify the results of the PINN solution. The results showed relative percentage error in the predicted eigenvalue of about 0.77% and about 1.2% for example 1 and example 2, respectively. The mean absolute error in the predicted flux for example 1 is ∼ 0.002 and for example 2 is ∼ 0.0024. These results indicate some preliminary successes of the PINN application to k-eigenvalue problems. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Generalized Mercier stability criterion for stellarators

The Mercier criterion is a well-known stability criterion for tokamaks. It is derived from a 2 × 2 matrix eigenvalue problem arising from the expansion of resonant solutions about a singular surface where m−nq=0, with m and n being the poloidal and toroidal mode numbers, respectively, and q being the safety factor. The stability criterion is that the eigenvalues must be real, otherwise, the solution oscillates, violating the Newcomb crossing criterion. Because of the non-axisymmetry of stellarators, different toroidal as well as poloidal harmonics couple to each other. It follows that each singular surface can have multiple resonant harmonics, with multiplicity M≥1. The corresponding matrix eigenvalue problem involves a 2M×2M matrix, resulting in M pairs of positive and negative eigenvalues. The generalized stability criterion is that all eigenvalues must be real. While the original Mercier criterion can be expressed in terms of quadratures of equilibrium quantities over the singular surface, which can be evaluated anywhere, the generalized Mercier criterion can only be evaluated on rational q surfaces with a given set of resonant harmonics.

Physics↗

Eigenvalues of singular differential operators by finite difference methods. I.

Approximation of the eigenvalues of certain self-adjoint operators defined by a formal differential operator in a Hilbert space. In general, two problems are studied. The first is the problem of defining a suitable Hilbert space operator that has eigenvalues. The second problem concerns the finite difference operators to be used.

Baxley, J. V.↗