Search NASA⌕ Search

SEARCH · Search NASA

Results for “Structure preserving algorithms”

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 163 records · Page 9

Refactoring and Its Benefits

Refactoring is a disciplined technique for restructuring an existing body of code, altering its internal structure without changing its external behavior. It improves internal code structure without altering its external functionality by transforming functions and rethinking algorithms. It is an iterative process. Refactoring include reducing scope, replacing complex instructions with simpler or built-in instructions, and combining multiple statements into one statement. By transforming the code with refactoring techniques it will be faster to change, execute, and download. It is an excellent best practice to adopt for programmers wanting to improve their productivity. Refactoring is similar to things like performance optimizations, which are also behavior- preserving transformations. It also helps us find bugs when we are trying to fix a bug in difficult-to-understand code. By cleaning things up, we make it easier to expose the bug. Refactoring improves the quality of application design and implementation. In general, three cases concerning refactoring. Iterative refactoring, Refactoring when is necessary, Not refactor.Mr. Martin Fowler identifies four key reasons to refractor. Refactoring improves the design of software, makes software easier to understand, helps us find bugs and also helps in executing the program faster. There is an additional benefit of refactoring. It changes the way a developer thinks about the implementation when not refactoring. There are the three types of refactorings. 1) Code refactoring: It often referred to simply as refactoring. This is the refactoring of programming source code. 2) Database refactoring: It is a simple change to a database schema that improves its design while retaining both its behavioral and informational semantics. 3) User interface (UI) refactoring: It is a simple change to the UI which retains its semantics. Finally, we conclude the benefits of Refactoring are: Improves the design of software, Makes software easier to understand, Software gets cleaned up and Helps us to find bugs and Helps us to program faster.

99 GENERAL AND MISCELLANEOUS↗

Deep learning symmetries and their Lie groups, algebras, and subalgebras from first principles

Abstract We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the symmetry transformations and the corresponding generators. The constructed loss functions ensure that the applied transformations are symmetries and the corresponding set of generators forms a closed (sub)algebra. Our procedure is validated with several examples illustrating different types of conserved quantities preserved by symmetry. In the process of deriving the full set of symmetries, we analyze the complete subgroup structure of the rotation groups SO (2), SO (3), and SO (4), and of the Lorentz group S O ( 1 , 3 ) . Other examples include squeeze mapping, piecewise discontinuous labels, and SO (10), demonstrating that our method is completely general, with many possible applications in physics and data science. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.

97 MATHEMATICS AND COMPUTING↗

Quantum state reduction: Generalized bipartitions from algebras of observables

Reduced density matrices are a powerful tool in the analysis of entanglement structure, approximate or coarse-grained dynamics, decoherence, and the emergence of classicality. It is straightforward to produce a reduced density matrix with the partial-trace map by tracing out part of the quantum state, but in many natural situations this reduction may not be achievable. We investigate the general problem of identifying how the quantum state is reduced given a restriction on the observables. For example, in an experimental setting, the set of observables that can actually be measured is usually modest (compared to the set of all possible observables) and their resolution is limited. In such situations, the appropriate state-reduction map can be defined via a generalized bipartition, which is associated with the structure of irreducible representations of the algebra generated by the restricted set of observables. One of our main technical results is a general, not inherently numeric, algorithm for finding irreducible representations of matrix algebras. In our work, we demonstrate the viability of this approach with two examples of limited-resolution observables. The definition of quantum state reductions can also be extended beyond algebras of observables. To accomplish this task we introduce a more flexible notion of bipartition, the partial bipartition, which describes coarse grainings preserving information about a limited set (not necessarily algebra) of observables. We describe a variational method to choose the coarse grainings most compatible with a specified Hamiltonian, which exhibit emergent classicality in the reduced state space. We apply this construction to the concrete example of the one-dimensional Ising model. Our results have relevance for quantum information, bulk reconstruction in holography, and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiscale geometric modeling of macromolecules I: Cartesian representation

This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace–Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the polarized curvature, for the prediction of protein binding sites.

97 MATHEMATICS AND COMPUTING↗

EvoDiffMol: evolutionary diffusion framework for 3D molecular design with optimized properties

Designing molecules with specific target properties remains a fundamental challenge in computational chemistry. While existing approaches show promise, most rely on simplified representations like SMILES strings or 2D graphs that lack essential three-dimensional geometric information. We present EvoDiffMol, a computational framework that integrates evolutionary algorithms with three-dimensional diffusion models for property-driven molecular generation. The method operates through adaptive evolutionary optimization, where population-based selection guides the generation process toward desired property landscapes. EvoDiffMol supports both unconstrained molecular design and scaffold-constrained generation that preserves fixed substructures while optimizing complementary regions. Comprehensive evaluation demonstrates exceptional performance, achieving the highest drug-likeness score (0.94) among all compared state-of-the-art methods while maintaining excellent validity, uniqueness, and novelty. Beyond single property optimization, the framework demonstrates flexible multi-property optimization capabilities, simultaneously controlling multiple molecular descriptors including synthetic accessibility, lipophilicity, topological polar surface area, and clinically relevant ADMET properties such as cardiotoxicity (hERG) and intestinal permeability (Caco-2). This adaptability spans from simple descriptors to practical pharmaceutical endpoints without requiring complete model retraining. The framework achieves precise control over target property values, generating molecules with properties closely matching specified targets for both single and multiple descriptors. Scaffold-constrained experiments preserve fixed molecular cores while maintaining effective property optimization. The three-dimensional representation offers advantages in maintaining structural validity during iterative optimization, with potential for geometry-aware applications in materials science and drug discovery.

3D molecular generation↗

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗

Constraining the Multiscale Structure of Geophysical Fields in Machine Learning: The Case of Precipitation

The use of deep-learning algorithms for estimating the value of geophysical variables from remotely sensed information is rapidly expanding. The typical objective function minimized in such algorithms is the mean square error (MSE), which is known to lead to smooth estimates with compressed dynamical range as compared to the true distribution of the variable of interest. Here, we introduce and evaluate alternative objective functions, focusing on the retrieval of precipitation rates from satellite passive microwave radiometric measurements using a deep convolutional neural network. For this testbed application, the results show that explicitly imposing the preservation of the statistical distribution and spatial wavelet power spectrum of the target variable allows to accurately reproduce extreme values and sharp gradients across multiple scales in this study.

58 GEOSCIENCES↗

Performance and Feature Improvements in Parareal-based Power System Dynamic Simulation

In recent years, a novel Parareal-based approach has been developed for fast transient simulations of large power system interconnections. Parareal belongs to the class of Parallel-in-time algorithms for solution of systems of differential-algebraic equations in parallel over an interval of time. The selection of a reasonably fast and accurate coarse solution is crucial to improve the performance of Parareal algorithm. Semi-analytical solution methods are one promising approach to achieve this goal. They have been investigated, and some preliminary results are presented here. In addition, Parareal-based simulator has been expanded to enable co-simulation with OpenDSS, a widely used open-source distribution system simulator. Preserving the parallel nature of the Parareal approach and taking advantage of the parallel capabilities of the latest versions of OpenDSS, each distribution system can be solved in their entirety on different processors in parallel within the main Parareal simulator. This paper also presents the structure of the transmission and distribution co-simulation and some results with different dynamic models of inverter-based resources in the distribution systems.

Park, Byungkwon↗

Scaling relations of the properties for CO resolved structures in nearby spiral galaxies

Complementing the observations on the eastern part of galaxy NGC 6946 presented in a previous work, we report high spatial resolution observations of giant molecular clouds (GMCs) in the nearby spiral galaxies M101 and NGC 628 obtained with the Combined Array for Research in Millimeter-wave Astronomy (CARMA). We observed CO(1→0) over regions with active star formation extending from 2 to 15 kpc galactocentric radius. Higher resolution observations of CO(2→1) toward the brightest regions observed in CO(1→0) have allowed us to resolve some of the largest GMCs. We have recovered short-spacing u–v components by using single dish observations from the Nobeyama 45 m and IRAM 30 m telescopes. Using the automated CPROPS algorithm we identified 112 CO complexes in the CO(1→0) maps and 144 GMCs in the CO(2→1) maps. Using a Bayesian fitting approach, we generate scaling relations for the sizes, line widths, and virial masses of the structures identified in this work. We do not find evidence for a tight power-law relation between size and line width, although the limited dynamic range in cloud size remains a clear issue in our analysis. Additionally, we use a Bayesian approach to analyze the scaling relation between the star formation and molecular gas surface density, known as the Kennicutt–Schmidt relation. When we perform our analysis using the boundaries of the structures identified by CPROPS, we find that the distribution of slopes are broadly distributed, mainly due to the limited dynamic range of our measured Σ{sub H{sub 2}}. In the case of the CO(1→0) complexes, the slope distributions are most consistent with super-linear relations, although sub-linear relations cannot be excluded for NGC 628 and NGC 6946. The GMCs from higher resolution CO(2→1) maps follow a similar behavior, but with larger scatter. As a complementary study, we use the Bayesian approach to analyze the Kennicutt–Schmidt relation for a uniform grid covering the areas surveyed, and with Σ{sub H{sub 2}} non-detections included in the analysis. The distributions of slopes is consistent with sub-linear relations for NGC 6946 and NGC 628, but is less constrained for M101. This picture is preserved after a 24 μm background component is subtracted from the Σ{sub SFR} measurements. On-arm regions tend to have higher star formation rates than inter-arm regions. Similar to what we find in our study of the eastern part of NGC 6946, in M101 we find regions where the star formation efficiency (SFE) shows marked peaks at specific galoctocentric radii. On the other hand, the distribution of SFE in NGC 628 is more contiguous. We hypothesize that differences in the distribution of SFE may be indicative of different processes driving the spiral structure.

79 ASTRONOMY AND ASTROPHYSICS↗

A multiscale MDCT image-based breathing lung model with time-varying regional ventilation

A novel algorithm is presented that links local structural variables (regional ventilation and deforming central airways) to global function (total lung volume) in the lung over three imaged lung volumes, to derive a breathing lung model for computational fluid dynamics simulation. The algorithm constitutes the core of an integrative, image-based computational framework for subject-specific simulation of the breathing lung. For the first time, the algorithm is applied to three multi-detector row computed tomography (MDCT) volumetric lung images of the same individual. A key technique in linking global and local variables over multiple images is an in-house mass-preserving image registration method. Throughout breathing cycles, cubic interpolation is employed to ensure C{sub 1} continuity in constructing time-varying regional ventilation at the whole lung level, flow rate fractions exiting the terminal airways, and airway deformation. The imaged exit airway flow rate fractions are derived from regional ventilation with the aid of a three-dimensional (3D) and one-dimensional (1D) coupled airway tree that connects the airways to the alveolar tissue. An in-house parallel large-eddy simulation (LES) technique is adopted to capture turbulent-transitional-laminar flows in both normal and deep breathing conditions. The results obtained by the proposed algorithm when using three lung volume images are compared with those using only one or two volume images. The three-volume-based lung model produces physiologically-consistent time-varying pressure and ventilation distribution. The one-volume-based lung model under-predicts pressure drop and yields un-physiological lobar ventilation. The two-volume-based model can account for airway deformation and non-uniform regional ventilation to some extent, but does not capture the non-linear features of the lung.

42 ENGINEERING↗

SU-E-I-87: Automated Liver Segmentation Method for CBCT Dataset by Combining Sparse Shape Composition and Probabilistic Atlas Construction

Purpose: The aiming of this study was to extract liver structures for daily Cone beam CT (CBCT) images automatically. Methods: Datasets were collected from 50 intravenous contrast planning CT images, which were regarded as training dataset for probabilistic atlas and shape prior model construction. Firstly, probabilistic atlas and shape prior model based on sparse shape composition (SSC) were constructed by iterative deformable registration. Secondly, the artifacts and noise were removed from the daily CBCT image by an edge-preserving filtering using total variation with L1 norm (TV-L1). Furthermore, the initial liver region was obtained by registering the incoming CBCT image with the atlas utilizing edge-preserving deformable registration with multi-scale strategy, and then the initial liver region was converted to surface meshing which was registered with the shape model where the major variation of specific patient was modeled by sparse vectors. At the last stage, the shape and intensity information were incorporated into joint probabilistic model, and finally the liver structure was extracted by maximum a posteriori segmentation.Regarding the construction process, firstly the manually segmented contours were converted into meshes, and then arbitrary patient data was chosen as reference image to register with the rest of training datasets by deformable registration algorithm for constructing probabilistic atlas and prior shape model. To improve the efficiency of proposed method, the initial probabilistic atlas was used as reference image to register with other patient data for iterative construction for removing bias caused by arbitrary selection. Results: The experiment validated the accuracy of the segmentation results quantitatively by comparing with the manually ones. The volumetric overlap percentage between the automatically generated liver contours and the ground truth were on an average 88%–95% for CBCT images. Conclusion: The experiment demonstrated that liver structures of CBCT with artifacts can be extracted accurately for following adaptive radiation therapy. This work is supported by National Natural Science Foundation of China (No. 61201441), Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province (No. BS2012DX038), Project of Shandong Province Higher Educational Science and Technology Program (No. J12LN23), Jinan youth science and technology star (No.20120109)

60 APPLIED LIFE SCIENCES↗

AMReX: Block-structured adaptive mesh refinement for multiphysics applications

Block-structured adaptive mesh refinement (AMR) provides the basis for the temporal and spatial discretization strategy for a number of Exascale Computing Project applications in the areas of accelerator design, additive manufacturing, astrophysics, combustion, cosmology, multiphase flow, and wind plant modeling. AMReX is a software framework that provides a unified infrastructure with the functionality needed for these and other AMR applications to be able to effectively and efficiently utilize machines from laptops to exascale architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multiphysics algorithms. AMReX supports algorithms that solve systems of partial differential equations in simple or complex geometries and those that use particles and/or particle–mesh operations to represent component physical processes. In this article, we will discuss the core elements of the AMReX framework such as data containers and iterators as well as several specialized operations to meet the needs of the application projects. In addition, we will highlight the strategy that the AMReX team is pursuing to achieve highly performant code across a range of accelerator-based architectures for a variety of different applications.

Zhang, Weiqun↗

A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations I: Derivation and algorithms

We propose a dynamically bi-orthogonal method (DyBO) to solve time dependent stochastic partial differential equations (SPDEs). The objective of our method is to exploit some intrinsic sparse structure in the stochastic solution by constructing the sparsest representation of the stochastic solution via a bi-orthogonal basis. It is well-known that the Karhunen–Loeve expansion (KLE) minimizes the total mean squared error and gives the sparsest representation of stochastic solutions. However, the computation of the KL expansion could be quite expensive since we need to form a covariance matrix and solve a large-scale eigenvalue problem. The main contribution of this paper is that we derive an equivalent system that governs the evolution of the spatial and stochastic basis in the KL expansion. Unlike other reduced model methods, our method constructs the reduced basis on-the-fly without the need to form the covariance matrix or to compute its eigendecomposition. In the first part of our paper, we introduce the derivation of the dynamically bi-orthogonal formulation for SPDEs, discuss several theoretical issues, such as the dynamic bi-orthogonality preservation and some preliminary error analysis of the DyBO method. We also give some numerical implementation details of the DyBO methods, including the representation of stochastic basis and techniques to deal with eigenvalue crossing. In the second part of our paper [11], we will present an adaptive strategy to dynamically remove or add modes, perform a detailed complexity analysis, and discuss various generalizations of this approach. An extensive range of numerical experiments will be provided in both parts to demonstrate the effectiveness of the DyBO method.

97 MATHEMATICS AND COMPUTING↗

Theory of Trotter Error with Commutator Scaling

The Lie-Trotter formula, together with its higher-order generalizations, provides a simple approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, nearly matching or even outperforming the best previous results. Our applications include: (i) a simulation of second-quantized plane-wave electronic structure, nearly matching the interaction-picture algorithm of Low and Wiebe; (ii) a simulation of $k$-local Hamiltonians almost with induced one-norm scaling, faster than the qubitization algorithm of Low and Chuang; (iii) a simulation of rapidly decaying power-law interactions, outperforming the Lieb-Robinson-based approach of Tran et al.; (iv) a hybrid simulation of clustered Hamiltonians, dramatically improving the result of Peng, Harrow, Ozols, and Wu; and (v) quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets, tightening previous analyses of Bravyi and Gosset. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound nearly matching a recent result of Tran et al. Our analysis reproduces known tight bounds for first- and second-order formulas. We further investigate the tightness of our bounds for higher-order formulas. For quantum simulation of a one-dimensional Heisenberg model with an even-odd ordering of terms, our result overestimates the complexity by only a factor of $5$. Our bound is also close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both the asymptotic scaling and the constant prefactor.

quantum computing, numerical analysis↗

Fast, clash-free RNA conformational morphing using molecular junctions

Non-coding ribonucleic acids (ncRNA) are functional RNA molecules that are not translated into protein. They are extremely dynamic, adopting diverse conformational substates, which enables them to modulate their interaction with a large number of other molecules. The flexibility of ncRNA provides a challenge for probing their complex 3D conformational landscape, both experimentally and computationally. As a result, despite their conformational diversity, ncRNAs mostly preserve their secondary structure throughout the dynamic ensemble. Here we present a kinematics-based procedure to morph an RNA molecule between conformational substates, while avoiding inter-atomic clashes. We represent an RNA as a kinematic linkage, with fixed groups of atoms as rigid bodies and rotatable bonds as degrees of freedom. Our procedure maintains RNA secondary structure by treating hydrogen bonds between base pairs as constraints. The constraints define a lower-dimensional, secondary-structure constraint manifold in conformation space, where motions are largely governed by molecular junctions of unpaired nucleotides. On a large benchmark set, we show that our morphing procedure compares favorably to peer algorithms, and can approach goal conformations to within a low all-atom RMSD by directing fewer than 1% of its atoms. Furthermore, our results suggest that molecular junctions can modulate 3D structural rearrangements, while secondary structure elements guide large parts of the molecule along the transition to the correct final conformation.

59 BASIC BIOLOGICAL SCIENCES↗

SU-E-I-82: Improving CT Image Quality for Radiation Therapy Using Iterative Reconstruction Algorithms and Slightly Increasing Imaging Doses

Purpose: Iterative reconstruction (IR) algorithms are developed to improve CT image quality (IQ) by reducing noise without diminishing spatial resolution or contrast. For CT in radiation therapy (RT), slightly increasing imaging dose to improve IQ may be justified if it can substantially enhance structure delineation. The purpose of this study is to investigate and to quantify the IQ enhancement as a result of increasing imaging doses and using IR algorithms. Methods: CT images were acquired for phantoms, built to evaluate IQ metrics including spatial resolution, contrast and noise, with a variety of imaging protocols using a CT scanner (Definition AS Open, Siemens) installed inside a Linac room. Representative patients were scanned once the protocols were optimized. Both phantom and patient scans were reconstructed using the Sinogram Affirmed Iterative Reconstruction (SAFIRE) and the Filtered Back Projection (FBP) methods. IQ metrics of the obtained CTs were compared. Results: IR techniques are demonstrated to preserve spatial resolution as measured by the point spread function and reduce noise in comparison to traditional FBP. Driven by the reduction in noise, the contrast to noise ratio is doubled by adopting the highest SAFIRE strength. As expected, increasing imaging dose reduces noise for both SAFIRE and FBP reconstructions. The contrast to noise increases from 3 to 5 by increasing the dose by a factor of 4. Similar IQ improvement was observed on the CTs for selected patients with pancreas and prostrate cancers. Conclusion: The IR techniques produce a measurable enhancement to CT IQ by reducing the noise. Increasing imaging dose further reduces noise independent of the IR techniques. The improved CT enables more accurate delineation of tumors and/or organs at risk during RT planning and delivery guidance.

60 APPLIED LIFE SCIENCES↗

Covariant phase space with boundaries

The covariant phase space method of Iyer, Lee, Wald, and Zoupas gives an elegant way to understand the Hamiltonian dynamics of Lagrangian field theories without breaking covariance. The original literature however does not systematically treat total derivatives and boundary terms, which has led to some confusion about how exactly to apply the formalism in the presence of boundaries. In particular the original construction of the canonical Hamiltonian relies on the assumed existence of a certain boundary quantity “B”, whose physical interpretation has not been clear. We here give an algorithmic procedure for applying the covariant phase space formalism to field theories with spatial boundaries, from which the term in the Hamiltonian involving B emerges naturally. Our procedure also produces an additional boundary term, which was not present in the original literature and which so far has only appeared implicitly in specific examples, and which is already nonvanishing even in general relativity with sufficiently permissive boundary conditions. The only requirement we impose is that at solutions of the equations of motion the action is stationary modulo future/past boundary terms under arbitrary variations obeying the spatial boundary conditions; from this the symplectic structure and the Hamiltonian for any diffeomorphism that preserves the theory are unambiguously constructed. We show in examples that the Hamiltonian so constructed agrees with previous results. We also show that the Poisson bracket on covariant phase space directly coincides with the Peierls bracket, without any need for non-covariant intermediate steps, and we discuss possible implications for the entropy of dynamical black hole horizons.

36 MATERIALS SCIENCE↗

Solvers for $\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit

Here we present a hybrid OpenMP/Charm\tt++ framework for solving the $\mathcal{O} (N)$ self-consistent-field eigenvalue problem with parallelism in the strong scaling regime, $P\gg{N}$, where $P$ is the number of cores, and $N$ is a measure of system size, i.e., the number of matrix rows/columns, basis functions, atoms, molecules, etc. This result is achieved with a nested approach to spectral projection and the sparse approximate matrix multiply [Bock and Challacombe, SIAM J. Sci. Comput., 35 (2013), pp. C72--C98], and involves a recursive, task-parallel algorithm, often employed by generalized $N$-Body solvers, to occlusion and culling of negligible products in the case of matrices with decay. Lastly, employing classic technologies associated with generalized $N$-Body solvers, including overdecomposition, recursive task parallelism, orderings that preserve locality, and persistence-based load balancing, we obtain scaling beyond hundreds of cores per molecule for small water clusters ([H${}_2$O]${}_N$, $N \in \{ 30, 90, 150 \}$, $P/N \approx \{ 819, 273, 164 \}$) and find support for an increasingly strong scalability with increasing system size $N$.

97 MATHEMATICS AND COMPUTING↗