Solutions of systems of nonlinear equations Final report
Method and computer program for solving arbitrary simultaneous system of nonlinear algebraic and transcendental equations
NONLINEAR EQUATION↗
SEARCH · Search NASA
Results for “Computer Algebra”
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.
Bringing randomized algorithms to mainstream numerical linear algebra
Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.
97 MATHEMATICS AND COMPUTING↗
Classification of quantum groups and Belavin–Drinfeld cohomologies for orthogonal and symplectic Lie algebras
In this paper we continue to study Belavin–Drinfeld cohomology introduced in Kadets et al., Commun. Math. Phys. 344(1), 1-24 (2016) and related to the classification of quantum groups whose quasi-classical limit is a given simple complex Lie algebra #Mathematical Fraktur Small G#. Here we compute Belavin–Drinfeld cohomology for all non-skewsymmetric r-matrices on the Belavin–Drinfeld list for simple Lie algebras of type B, C, and D.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels
To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.
36 MATERIALS SCIENCE↗
Optimal sensor network design for multi-scale, time-varying differential algebraic equation systems: Application to an entrained-flow gasifier refractory brick
An algorithm for optimal sensor network design for multi-scale, time-varying differential algebraic equation systems with non-separable dynamics is presented. As the process is time-varying, an integral normalized posterior error covariance of a multi-scale filter is minimized to obtain the optimal sensor locations. For reducing the computational cost, an adaptive sampling rate approach is considered for the slowly-varying variables. The algorithm is applied to a smart refractory brick with embedded sensors as part of an entrained-flow gasifier. Thermistors and interdigital capacitors are considered as candidate measurement technologies for estimating temperature and slag penetration profile along the gasifier wall. Finally, when the optimal set of sensors obtained from the algorithm is used for estimating temperature and slag penetration profiles in a multi-scale Kalman filter framework, satisfactory estimates are obtained despite high measurement noise and model mismatch.
42 ENGINEERING↗
SO(3)-invariant PCA with application to molecular data
Principal component analysis (PCA) is a fundamental technique for dimensionality reduction and denoising; however, its application to three-dimensional data with arbitrary orientations -- common in structural biology -- presents significant challenges. A naive approach requires augmenting the dataset with many rotated copies of each sample, incurring prohibitive computational costs. In this paper, we extend PCA to 3D volumetric datasets with unknown orientations by developing an efficient and principled framework for SO(3)-invariant PCA that implicitly accounts for all rotations without explicit data augmentation. By exploiting underlying algebraic structure, we demonstrate that the computation involves only the square root of the total number of covariance entries, resulting in a substantial reduction in complexity. We validate the method on real-world molecular datasets, demonstrating its effectiveness and opening up new possibilities for large-scale, high-dimensional reconstruction problems.
Fraiman, Michael [Tel Aviv Univ., Tel Aviv (Israel↗
Parallel performance of algebraic multigrid domain decomposition
Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.
97 MATHEMATICS AND COMPUTING↗
Constraints on sequential discontinuities from the geometry of on-shell spaces
We present several classes of constraints on the discontinuities of Feynman integrals that go beyond the Steinmann relations. These constraints follow from a geometric formulation of the Landau equations that was advocated by Pham, in which the singularities of Feynman integrals correspond to critical points of maps between on-shell spaces. To establish our results, we review elements of Picard-Lefschetz theory, which connect the homotopy properties of the space of complexified external momenta to the homology of the combined space of on-shell internal and external momenta. An important concept that emerges from this analysis is the question of whether or not a pair of Landau singularities is compatible — namely, whether or not the Landau equations for the two singularities can be satisfied simultaneously. Under conditions we describe, sequential discontinuities with respect to non-compatible Landau singularities must vanish. Although we only rigorously prove results for Feynman integrals with generic masses in this paper, we expect the geometric and algebraic insights that we gain will also assist in the analysis of more general Feynman integrals.
97 MATHEMATICS AND COMPUTING↗
A computing method for sound propagation through a nonuniform jet stream
The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.
Padula, S. L.↗
A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
A Parallel, Fully Coupled, Fully Implicit Solution to Reactive Transport in Porous Media Using the Preconditioned Jacobian-Free Newton-Krylov Method
Modeling large multicomponent reactive transport systems in porous media is particularly challenging when the governing partial differential algebraic equations (PDAEs) are highly nonlinear and tightly coupled due to complex nonlinear reactions and strong solution-media interactions. Here we present a preconditioned Jacobian-Free Newton-Krylov (JFNK) solution approach to solve the governing PDAEs in a fully coupled and fully implicit manner. A well-known advantage of the JFNK method is that it does not require explicitly computing and storing the Jacobian matrix during Newton nonlinear iterations. Our approach further enhances the JFNK method by utilizing physics-based, block preconditioning and a multigrid algorithm for efficient inversion of the preconditioner. This preconditioning strategy accounts for self- and optionally, cross-coupling between primary variables using diagonal and off-diagonal blocks of an approximate Jacobian, respectively. Numerical results are presented demonstrating the efficiency and massive scalability of the solution strategy for reactive transport problems involving strong solution-mineral interactions and fast kinetics. We found that the physics-based, block preconditioner significantly decreases the number of linear iterations, directly reducing computational cost; and the strongly scalable algebraic multigrid algorithm for approximate inversion of the preconditioner leads to excellent parallel scaling performance.
97 MATHEMATICS AND COMPUTING↗
Automatic computation of Euler-marching and subsonic grids for wing-fuselage configurations
Algebraic procedures are described for the automatic generation of structured, single-block flow computation grids for relatively simple configurations (wing, fuselage, and fin). For supersonic flows, a quasi two-dimensional grid for Euler-marching codes is developed, and some sample results in graphical form are included. A type of grid for subsonic flow calculation is also described. The techniques are algebraic and are based on a generalization of the method of transfinite interpolation.
Barger, Raymond L.↗
Quasi-Optimal Elimination Trees for 2D Grids with Singularities
We construct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.
Paszyńska, A.↗
Green’s Function Coupled-Cluster Approach: Simulating Photoelectron Spectra for Realistic Molecular Systems
In this paper we present an efficient implementation for the analytical energy- dependent coupled cluster Green’s function with singles and doubles (GFCCSD) approach with our first practice being computing spectral functions of real molecular systems. Due to its algebraic structure, the presented method is highly scalable, and is capable of computing spectral function for a given molecular system in any energy region. Several typical examples have been given to demonstrate its capability of computing spectral functions not only in the valence band, but also in the core-level energy region. Satellite peaks have been observed in the inner valence band and core-level energy region where many-body effect becomes significant and single particle picture of ionization often breaks down. The accuracy test has been carried out by extensively comparing our GFCCSD results with experimental results as well as the theoretical results from other methods. It turns out GFCCSD method is able to provide qualitative or semi-quantitative level of description of ionization processes in both the core and valence regimes. To significantly improve the GFCCSD results for the main states, larger basis set can usually be employed, whereas the improvement of the GFCCSD results for the satellite states needs higher order many-body terms to be included in the GFCC implementation.
electronic structure theory↗
Reduced scaling formulation of CASPT2 analytical gradients using the supporting subspace method
We present a reduced scaling and exact reformulation of state specific complete active space second-order perturbation (CASPT2) analytical gradients in terms of the MP2 and Fock derivatives using the supporting subspace method. This work follows naturally from the supporting subspace formulation of the CASPT2 energy in terms of the MP2 energy using dressed orbitals and Fock builds. For a given active space configuration, the terms corresponding to the MP2-gradient can be evaluated with O(N5) operations, while the rest of the calculations can be computed with O(N3) operations using Fock builds, Fock gradients, and linear algebra. When tensor-hyper-contraction is applied simultaneously, the computational cost can be further reduced to O(N4) for a fixed active space size. The new formulation enables efficient implementation of CASPT2 analytical gradients by leveraging the existing graphical processing unit (GPU)-based MP2 and Fock routines. We present benchmark results that demonstrate the accuracy and performance of the new method. Example applications of the new method in ab initio molecular dynamics simulation and constrained geometry optimization are given.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Fully-Explicit and Self-Consistent Algebraic Reynolds Stress Models
A fully-explicit, self-consistent algebraic expression for the Reynolds stress, which is the exact solution to the Reynolds stress transport equation in the 'weak equilibrium' limit for two-dimensional mean flows for all linear and some quasi-linear pressure-strain models, is derived. Current explicit algebraic Reynolds stress models derived by employing the 'weak equilibrium' assumption treat the production-to-dissipation (P/epsilon) ratio implicitly, resulting in an effective viscosity that can be singular away from the equilibrium limit. In the present paper, the set of simultaneous algebraic Reynolds stress equations are solved in the full non-linear form and the eddy viscosity is found to be non-singular. Preliminary tests indicate that the model performs adequately, even for three dimensional mean flow cases. Due to the explicit and non-singular nature of the effective viscosity, this model should mitigate many of the difficulties encountered in computing complex turbulent flows with the algebraic Reynolds stress models.
Girimaji, Sharath S.↗
A computer program for calculating the perfect gas inviscid flow field about blunt axisymmetric bodies at an angle of attack of 0 deg
A method for the rapid calculation of the inviscid shock layer about blunt axisymmetric bodies at an angle of attack of 0 deg has been developed. The procedure is of an inverse nature, that is, a shock wave is assumed and calculations proceed along rays normal to the shock. The solution is iterated until the given body is computed. The flow field solution procedure is programed at the Langley Research Center for the Control Data 6600 computer. The geometries specified in the program are sphores, ellipsoids, paraboloids, and hyperboloids which may conical afterbodies. The normal momentum equation is replaced with an approximate algebraic expression. This simplification significantly reduces machine computation time. Comparisons of the present results with shock shapes and surface pressure distributions obtained by the more exact methods indicate that the program provides reasonably accurate results for smooth bodies in axisymmetric flow. However, further research is required to establish the proper approximate form of the normal momentum equation for the two-dimensional case.
Zoby, E. V.↗
A Computing Method for Sound Propagation Through a Nonuniform Jet Stream
Understanding the principles of jet noise propagation is an essential ingredient of systematic noise reduction research. High speed computer methods offer a unique potential for dealing with complex real life physical systems whereas analytical solutions are restricted to sophisticated idealized models. The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions and a more suitable approach was needed. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.
Padula, S. L.↗