Search NASA⌕ Search

SEARCH · Search NASA

Results for “algebraic methods”

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 253 records · Page 14

Analytic Expressions for Derivatives from Series Solutions to the Three Body Problem

This paper presents a notation system to facilitate to solution of differential equations via Taylor series expansions and applies it to solve the circular restricted three body problem. Unlike previous Taylor series methods in the astrodynamics literature, computer algebra solvers are not used. Instead the notation system allows one to solve a system of differential equations analytically “by hand” without resorting to computer algebra software. This method produces recurrence relations explicitly in terms of a sequence of derivatives of the state with respect to time for the coefficients of Taylor Series solutions that can be evaluated numerically or manipulated further to investigate properties of the solution. For example, additional derivatives with respect to other parameters may also be found, including those that describe the dependence of the solution on initial conditions.

Strange, Nathan↗

MueLu Multigrid Preconditioning Package

MueLu is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software provides multigrid source code, test programs, and short example programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueLu currently provides an implementation of smoothed aggregation algebraic multigrid method and interfaces to many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueLu also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. All algorithms and methods in MueLu have been or will be published in the open scientific literature.

Source record↗

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗

Toward Generalized Tensor Algebra for ab initio Quantum Chemistry Methods

The widespread use of tensor operations in describing electronic structure calculations has motivated the design of software frameworks for productive development of scalable optimized tensor-based electronic structure methods. Whereas prior work focused on Cartesian abstractions for dense tensors, we present an algebra to specify and perform tensor operations on a larger class of block-sparse tensors. We illustrate the use of this framework in expressing real-world computational chemistry calculations beyond the reach of existing frameworks.

Mutlu, Erdal↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Total photoionization cross-sections of excited electronic states by the algebraic diagrammatic construction-Stieltjes-Lanczos method

Here, we extend the L{sup 2} ab initio method for molecular photoionization cross-sections introduced in Gokhberg et al. [J. Chem. Phys. 130, 064104 (2009)] and benchmarked in Ruberti et al. [J. Chem. Phys. 139, 144107 (2013)] to the calculation of total photoionization cross-sections of molecules in electronically excited states. The method is based on the ab initio description of molecular electronic states within the many-electron Green's function approach, known as algebraic diagrammatic construction (ADC), and on the application of Stieltjes-Chebyshev moment theory to Lanczos pseudospectra of the ADC electronic Hamiltonian. The intermediate state representation of the dipole operator in the ADC basis is used to compute the transition moments between the excited states of the molecule. We compare the results obtained using different levels of the many-body theory, i.e., ADC(1), ADC(2), and ADC(2)x for the first two excited states of CO, N{sub 2}, and H{sub 2}O both at the ground state and the excited state equilibrium or saddle point geometries. We find that the single excitation ADC(1) method is not adequate even at the qualitative level and that the inclusion of double electronic excitations for description of excited state photoionization is essential. Moreover, we show that the use of the extended ADC(2)x method leads to a substantial systematic difference from the strictly second-order ADC(2). Our calculations demonstrate that a theoretical modelling of photoionization of excited states requires an intrinsically double excitation theory with respect to the ground state and cannot be achieved by the standard single excitation methods with the ground state as a reference.

74 ATOMIC AND MOLECULAR PHYSICS↗

Some Aspects of Multigrid Methods on Non-Structured Meshes

To solve a given fine mesh problem, the design of a multigrid method requires the definition of coarse levels, associated coarse grid operators and inter-grid transfer operators. For non-structured simplified meshes, these definitions can rely on the use of non-nested triangulations. These definitions can also be founded on agglomeration/aggregation techniques in a purely algebraic manner. This paper analyzes these two options, shows the connections of the volume-agglomeration method with algebraic methods and proposes a new definition of prolongation operator suitable for the application of the volume-agglomeration method to elliptic problems.

Guillard, H.↗

On the relation between rigging inner product and master constraint direct integral decomposition

Canonical quantization of constrained systems with first-class constraints via Dirac's operator constraint method proceeds by the theory of Rigged Hilbert spaces, sometimes also called refined algebraic quantization. This method can work when the constraints form a Lie algebra. When the constraints only close with nontrivial structure functions, the Rigging map can no longer be defined. To overcome this obstacle, the master constraint method has been proposed which replaces the individual constraints by a weighted sum of absolute squares of the constraints. Now the direct integral decomposition (DID) methods, which are closely related to Rigged Hilbert spaces, become available and have been successfully tested in various situations. It is relatively straightforward to relate the rigging inner product to the path integral that one obtains via reduced phase space methods. However, for the master constraint, this is not at all obvious. In this paper we find sufficient conditions under which such a relation can be established. Key to our analysis is the possibility to pass to equivalent, Abelian constraints, at least locally in phase space. Then the master constraint DID for those Abelian constraints can be directly related to the rigging map and therefore has a path integral formulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scale-adaptive tensor algebra for local many-body methods of electronic structure theory

While the formalism of multiresolution analysis (MRA), based on wavelets and adaptive integral representations of operators, is actively progressing in electronic structure theory (mostly on the independent-particle level and, recently, second-order perturbation theory), the concepts of multiresolution and adaptivity can also be utilized within the traditional formulation of correlated (many-particle) theory which is based on second quantization and the corresponding (generally nonorthogonal) tensor algebra. In this paper, we present a formalism called scale-adaptive tensor algebra (SATA) which exploits an adaptive representation of tensors of many-body operators via the local adjustment of the basis set quality. Given a series of locally supported fragment bases of a progressively lower quality, we formulate the explicit rules for tensor algebra operations dealing with adaptively resolved tensor operands. The formalism suggested is expected to enhance the applicability and reliability of local correlated many-body methods of electronic structure theory, especially those directly based on atomic orbitals (or any other localized basis functions).

Liakh, Dmitry I↗

Faddeev random-phase approximation for molecules

The Faddeev random-phase approximation is a Green's function technique that makes use of Faddeev equations to couple the motion of a single electron to the two-particle-one-hole and two-hole-one-particle excitations. This method goes beyond the frequently used third-order algebraic diagrammatic construction method: all diagrams involving the exchange of phonons in the particle-hole and particle-particle channel are retained, but the phonons are now described at the level of the random-phase approximation, which includes ground-state correlations, rather than at the Tamm-Dancoff approximation level, where ground-state correlations are excluded. Previously applied to atoms, this paper presents results for small molecules at equilibrium geometry.

74 ATOMIC AND MOLECULAR PHYSICS↗

Superintegrable systems from block separation of variables and unified derivation of their quadratic algebras

Highlights: • A new method for constructing D-dimensional minimally superintegrable systems. • Superintegrable systems from block coordinate separation of variables. • Unified derivation of quadratic symmetry algebras via gauge transformations. - Abstract: We present a new method for constructing D-dimensional minimally superintegrable systems based on block coordinate separation of variables. We give two new families of superintegrable systems with N (N≤D) singular terms of the partitioned coordinates and involving arbitrary functions. These Hamiltonians generalize the singular oscillator and Coulomb systems. We derive their exact energy spectra via separation of variables. We also obtain the quadratic algebras satisfied by the integrals of motion of these models. We show how the quadratic symmetry algebras can be constructed by novel application of the gauge transformations from those of the non-partitioned cases. We demonstrate that these quadratic algebraic structures display a universal nature to the extent that their forms are independent of the functions in the singular potentials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Propagator quantum chemical study of S-cis-(Z)-2-(2-formylethenyl)pyrrole: electronic structure and aspects of intramolecular hydrogen bond manifestation in ionization spectra

For the purpose of investigation of the electronic structures of functionalized pyrroles with potential biological activity the electronic structures and ionization spectra of S-cis-(Z)-2-(2-formylethenyl)pyrrole (FP) were calculated by the propagator quantum chemical method. The calculations were performed using the third-order algebraic diagrammatic construction method (ADC(3)) for one-particle Green´s function (electronic propagator) and the 6–31G** basis set. Going from FP (possessing the intramolecular hydrogen bond H⋯O) to its conformation FPR (without H⋯O bonding), the O1s-ionization energy and the ionization energy of the σ-type lone electron pair orbital of the O atom decrease by ~0.2 eV, which is a consequence of stopping the electron density transfer from the O atom. A strong electron density transfer through the hydrogen bond from the O atom to the NH group occurs in the nitrogen core level ionization spectrum as evidenced by a lower N1s-ionization energy of FP (by ~0.7 eV ) compared to that of FPR. The valence shell ionization spectra of FP and FPR calculated using the ADC(3) method are characterized by a high density of the satellite states. The results obtained indicate that the electronic structures of the compounds of the considered class are characterized by pronounced effects of electron correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Algebraic Stabilization of Explicit Numerical Integration for Extremely Stiff Reaction Networks

In contrast to the prevailing view in the literature, it is shown that even extremely stiff sets of ordinary differential equations may be solved efficiently by explicit methods if limiting algebraic solutions are used to stabilize the numerical integration. The stabilizing algebra differs essentially for systems well removed from equilibrium and those near equilibrium. Explicit asymptotic and quasi-steady-state methods that are appropriate when the system is only weakly equilibrated are examined first. These methods are then extended to the case of close approach to equilibrium through a new implementation of partial equilibrium approximations. Using stringent tests with astrophysical thermonuclear networks, evidence is provided that these methods can deal with the stiffest networks, even in the approach to equilibrium, with accuracy and integration timestepping comparable to that of implicit methods. Because explicit methods can execute a timestep faster and scale more favorably with network size than implicit algorithms, our results suggest that algebraically stabilized explicit methods might enable integration of larger reaction networks coupled to fluid dynamics than has been feasible previously for a variety of disciplines.

differential equations↗

Regularity of group algebras

A Carleman-type test for the Shilov regularity of weighted L{sup p}-algebras (with convolution as multiplication) on groups is extended to wider classes of Banach algebras of measurable functions on locally compact Abelian groups. Only simplest analytic methods and general algebraic ideas are used. In conclusion several questions are posed. Bibliography: 18 titles.

97 MATHEMATICS AND COMPUTING↗

Hydrologic Model Analyses for Decision Support at the Los Alamos National Laboratory Site - 18363

Modeling hydrologic flow and transport in the subsurface presents a number of challenges including large datasets that contain limited information about the properties of the subsurface and models with a large number of parameters characterizing the properties of the subsurface and the ambient hydrologic conditions (e.g., groundwater recharge). This, in turn, leads to substantial uncertainty in predictions about quantities of interest (e.g., the concentration of a contaminant at points of compliance). We present a number of methods and tools that have recently been developed to address these problems. The model calibration tools are capable of assimilating large datasets (for example, on the order of 1,000,000 model calibration targets) into numerical models, calibrating models with a large number of model parameters (on the order of 1,000,000), or both. These tools leverage recently developed methods in numerical linear algebra such as matrix-free methods and randomized matrix sketching. The uncertainty quantification tools are highly-parallel and enable us to robustly quantify the uncertainties in model parameters (and therefore uncertainty in quantities of interest). Having these capabilities in model analysis tools enables more informed decision making related to remediation of groundwater contaminants. The model analyses that we present are related to the Los Alamos National Laboratory (LANL) chromium site. The analyses are performed by MADS (Model Analysis and Decision Support; http://mads.lanl.gov). (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Using computational singular perturbation as a diagnostic tool in ODE and DAE systems: a case study in heterogeneous catalysis

We have extended the computational singular perturbation (CSP) method to differential algebraic equation (DAE) systems and demonstrated its application in a heterogeneous-catalysis problem. The extended method obtains the CSP basis vectors for DAEs from a reduced Jacobian matrix that takes the algebraic constraints into account. Here we use a canonical problem in heterogeneous catalysis, the transient continuous stirred tank reactor (T-CSTR), for illustration. The T-CSTR problem is modelled fundamentally as an ordinary differential equation (ODE) system, but it can be transformed to a DAE system if one approximates typically fast surface processes using algebraic constraints for the surface species. We demonstrate the application of CSP analysis for both ODE and DAE constructions of a T-CSTR problem, illustrating the dynamical response of the system in each case. We also highlight the utility of the analysis in commenting on the quality of any particular DAE approximation built using the quasi-steady state approximation (QSSA), relative to the ODE reference case.

97 MATHEMATICS AND COMPUTING↗