Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic clustering algorithm”

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 307 records · Page 17

Towards Resilient Critical Infrastructures: Application of Type-2 Fuzzy Logic in Embedded Network Security Cyber Sensor

Resiliency and cyber security of modern critical infrastructures is becoming increasingly important with the growing number of threats in the cyber-environment. This paper proposes an extension to a previously developed fuzzy logic based anomaly detection network security cyber sensor via incorporating Type-2 Fuzzy Logic (T2 FL). In general, fuzzy logic provides a framework for system modeling in linguistic form capable of coping with imprecise and vague meanings of words. T2 FL is an extension of Type-1 FL which proved to be successful in modeling and minimizing the effects of various kinds of dynamic uncertainties. In this paper, T2 FL provides a basis for robust anomaly detection and cyber security state awareness. In addition, the proposed algorithm was specifically developed to comply with the constrained computational requirements of low-cost embedded network security cyber sensors. The performance of the system was evaluated on a set of network data recorded from an experimental cyber-security test-bed.

97 MATHEMATICS AND COMPUTING↗

Short- and medium-range orders in Al90Tb10 glass and their relation to the structures of competing crystalline phases

Molecular dynamics simulations using an interatomic potential developed by artificial neural network deep machine learning are performed to study the local structural order in Al90Tb10 metallic glass. We show that more than 80% of the Tb-centered clusters in Al90Tb10 glass have short-range order (SRO) with their 17 first coordination shell atoms stacked in a ‘3661’ or ‘15551’ sequence. Medium-range order (MRO) in Bergman-type packing extended out to the second and third coordination shells is also clearly observed. Analysis of the network formed by the ‘3661’ and ‘15551’ clusters show that ~82% of such SRO units share their faces or vertexes, while only ~6% of neighboring SRO pairs are interpenetrating. Such a network topology is consistent with the Bergman-type MRO around the Tb-centers. Moreover, crystal structure searches using genetic algorithm and the neural network interatomic potential reveal several low-energy metastable crystalline structures in the composition range close to Al 90 Tb 10 . Some of these crystalline structures have the ‘3661’ SRO while others have the ‘15551’ SRO. While the crystalline structures with the ‘3661’ SRO also exhibit the MRO very similar to that observed in the glass, the ones with the ‘15551’ SRO have very different atomic packing in the second and third shells around the Tb centers from that of the Bergman-type MRO observed in the glassy phase.

36 MATERIALS SCIENCE↗

Continuous-variable quantum computation of the O(3) model in 1+1 dimensions

We formulate the $O(3)$ non-linear sigma model in $1+1$ dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous variable (CV) approach to quantum computing. Here we construct the ground state and excited states using the coupled cluster ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates, estimate the discretization error, and present numerical results obtained from a photonic quantum simulator. We expect that the methods developed in this work will be useful for exploring interesting dynamics for a wide class of sigma models and gauge theories, as well as for simulating scattering events on quantum hardware in the coming decade.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated analysis for detecting beams in laser wakefield simulations

Laser wakefield particle accelerators have shown the potential to generate electric fields thousands of times higher than those of conventional accelerators. The resulting extremely short particle acceleration distance could yield a potential new compact source of energetic electrons and radiation, with wide applications from medicine to physics. Physicists investigate laser-plasma internal dynamics by running particle-in-cell simulations; however, this generates a large dataset that requires time-consuming, manual inspection by experts in order to detect key features such as beam formation. This paper describes a framework to automate the data analysis and classification of simulation data. First, we propose a new method to identify locations with high density of particles in the space-time domain, based on maximum extremum point detection on the particle distribution. We analyze high density electron regions using a lifetime diagram by organizing and pruning the maximum extrema as nodes in a minimum spanning tree. Second, we partition the multivariate data using fuzzy clustering to detect time steps in a experiment that may contain a high quality electron beam. Finally, we combine results from fuzzy clustering and bunch lifetime analysis to estimate spatially confined beams. We demonstrate our algorithms successfully on four different simulation datasets.

43 PARTICLE ACCELERATORS↗

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗

Direct pore-level modeling of incompressible fluid flow in porous media

We present a dynamic particle-based model for direct pore-level modeling of incompressible viscous fluid flow in disordered porous media. The model is capable of simulating flow directly in three-dimensional high-resolution micro-CT images of rock samples. It is based on moving particle semi-implicit (MPS) method. We modify this technique in order to improve its stability for flow in porous media problems. Using the micro-CT image of a rock sample, the entire medium, i.e., solid and fluid, is discretized into particles. The incompressible Navier-Stokes equations are then solved for each particle using the MPS summations. The model handles highly irregular fluid-solid boundaries effectively. An algorithm to split and merge fluid particles is also introduced. To handle the computational load, we present a parallel version of the model that runs on distributed memory computer clusters. The accuracy of the model is validated against the analytical, numerical, and experimental data available in the literature. The validated model is then used to simulate both unsteady- and steady-state flow of an incompressible fluid directly in a representative elementary volume (REV) size micro-CT image of a naturally-occurring sandstone with 3.398 {mu}m resolution. We analyze the quality and consistency of the predicted flow behavior and calculate absolute permeability using the steady-state flow rate.

97 MATHEMATICS AND COMPUTING↗

Conserved unique peptide patterns (CUPP) online platform 2.0: implementation of +1000 JGI fungal genomes

Carbohydrate-processing enzymes, CAZymes, are classified into families based on sequence and three-dimensional fold. Because many CAZyme families contain members of diverse molecular function (different EC-numbers), sophisticated tools are required to further delineate these enzymes. Such delineation is provided by the peptide-based clustering method CUPP, Conserved Unique Peptide Patterns. CUPP operates synergistically with the CAZy family/subfamily categorizations to allow systematic exploration of CAZymes by defining small protein groups with shared sequence motifs. The updated CUPP library contains 21,930 of such motif groups including 3,842,628 proteins. The new implementation of the CUPP-webserver, https://cupp.info/, now includes all published fungal and algal genomes from the Joint Genome Institute (JGI), genome resources MycoCosm and PhycoCosm, dynamically subdivided into motif groups of CAZymes. This allows users to browse the JGI portals for specific predicted functions or specific protein families from genome sequences. Thus, a genome can be searched for proteins having specific characteristics. All JGI proteins have a hyperlink to a summary page which links to the predicted gene splicing including which regions have RNA support. The new CUPP implementation also includes an update of the annotation algorithm that uses only a fourth of the RAM while enabling multi-threading, providing an annotation speed below 1 ms/protein.

59 BASIC BIOLOGICAL SCIENCES↗

Model Based Validation of Intelligent Powertrain Strategies for Connected and Automated Vehicles

Systems incorporating Vehicle to Everything (V2X) and conventional cellular based communication in vehicles can significantly help improve energy consumption via a combination of intelligent powertrain control strategies, smarter routing algorithms and driving in such a way as to minimize fuel economy and the emission of carbon dioxide, known as "eco-driving." In projects led by the Southwest Research Institute (SwRI), large-scale traffic simulations are created to model real-world scenarios with dynamic behavior that is reactive to imposed changes. Coupled with high fidelity powertrain models, the closed loop framework enables research and development of such Connected and Automated Vehicle (CAV) enabled technologies at scale. This paper will discuss a traffic system simulation environment that was built based on the High Street urban corridor in Columbus, Ohio. Eco-driving strategies were tested at scale on a variety of powertrain platforms – internal combustion engines, hybrid electric and fully electric vehicles. Furthermore, the paper will focus on hybrid electric powertrain modeling along with details on how the powertrain model was leveraged to develop a sophisticated clustering scheme to help down-select speed traces from large scale simulation studies for validation on vehicle dynamometer. Nominal energy consumption improvement around 12% was observed with good match between simulation studies and vehicle testing.

33 ADVANCED PROPULSION SYSTEMS↗

A Hardware-in-the-Loop Testbed for Spacecraft Formation Flying Applications

The Formation Flying Test Bed (FFTB) at NASA Goddard Space Flight Center (GSFC) is being developed as a modular, hybrid dynamic simulation facility employed for end-to-end guidance, navigation, and control (GN&C) analysis and design for formation flying clusters and constellations of satellites. The FFTB will support critical hardware and software technology development to enable current and future missions for NASA, other government agencies, and external customers for a wide range of missions, particularly those involving distributed spacecraft operations. The initial capabilities of the FFTB are based upon an integration of high fidelity hardware and software simulation, emulation, and test platforms developed at GSFC in recent years; including a high-fidelity GPS simulator which has been a fundamental component of the Guidance, Navigation, and Control Center's GPS Test Facility. The FFTB will be continuously evolving over the next several years from a too[ with initial capabilities in GPS navigation hardware/software- in-the- loop analysis and closed loop GPS-based orbit control algorithm assessment to one with cross-link communications and relative navigation analysis and simulation capability. Eventually the FFT13 will provide full capability to support all aspects of multi-sensor, absolute and relative position determination and control, in all (attitude and orbit) degrees of freedom, as well as information management for satellite clusters and constellations. In this paper we focus on the architecture for the FFT13 as a general GN&C analysis environment for the spacecraft formation flying community inside and outside of NASA GSFC and we briefly reference some current and future activities which will drive the requirements and development.

Leitner, Jesse↗

Gradients in giant branch morphology in the core of 47 Tucanae

I describe an algorithm which uses the high spatial resolution of the Hubble Space Telescope to complement the high spatial-to-noise, approximately symmetric point response function, relatively large spatial coverage, and standard filters available from ground based images of crowded fields. Applying this technique to the central regions of the globular cluster 47 Tucanae, I find that the morphology of the giant branch in the core is significantly different from that in more distant regions (r approximately equals 5 to 10 core radii) of the cluster. In particular, there appear to be fewer bright giants in the core, along with an enhanced `asymptotic giant branch' (AGB) sequence. Depletion of giants has been observed in the cores of other dense clusters, and may be due to `stripping' of large stars by stellar encounters and/or mass transfer in binary systems. Central concentrations of true asymptotic giant branch stars are not expected to result from dynamical processes; possibly some of these stars may be evolved blue stragglers.

Bailyn, Charles D.↗

A Generative Model for Realistic Galaxy Cluster X-Ray Morphologies

Abstract The X-ray morphologies of clusters of galaxies display significant variations, reflecting their dynamical histories and the nonlinear dependence of X-ray emissivity on the density of the intracluster gas. Qualitative and quantitative assessments of X-ray morphology have long been considered a proxy for determining whether clusters are dynamically active or “relaxed.” Conversely, the use of circularly or elliptically symmetric models for cluster emission can be complicated by the variety of complex features realized in nature, spanning scales from megaparsecs down to the resolution limit of current X-ray observatories. In this work, we use mock X-ray images from simulated clusters from The Three Hundred project to define a basis set of cluster image features. We take advantage of the clusters’ approximate self-similarity to minimize the differences between images before encoding the remaining diversity through a distribution of high-order polynomial coefficients. Principal component analysis then provides an orthogonal basis for this distribution, corresponding to natural perturbations from an average model. This representation allows novel, realistically complex X-ray cluster images to be easily generated, and we provide code to do so. The approach provides a simple way to generate training data for cluster image analysis algorithms and could be straightforwardly adapted to generate clusters displaying specific types of features or selected by physical characteristics available in the original simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Performance Evaluation of NWChem Ab-Initio Molecular Dynamics (AIMD) Simulations on the Intel® Xeon Phi™ Processor

Ab-initio Molecular Dynamics (AIMD) methods are an important class of algorithms, as they enable scientists to understand the chemistry and dynamics of molecular and condensed phase systems while retaining a first-principles-based description of their interactions. Many-core architectures such as the Intel® Xeon Phi™ processor are an interesting and promising target for these algorithms, as they can provide the computational power that is needed to solve interesting problems in chemistry. In this paper, we describe the efforts of refactoring the existing AIMD plane-wave method of NWChem from an MPI-only implementation to a scalable, hybrid code that employs MPI and OpenMP to exploit the capabilities of current and future many-core architectures. We describe the optimizations required to get close to optimal performance for the multiplication of the tall-and-skinny matrices that form the core of the computational algorithm. We present strong scaling results on the complete AIMD simulation for a test case that simulates 256 water molecules and that strong-scales well on a cluster of 1024 nodes of Intel Xeon Phi processors. We compare the performance obtained with a cluster of dual-socket Intel® Xeon® E5–2698v3 processors.

Environmental Molecular Sciences Laboratory↗

Annual Report: Carbon Capture Simulation Initiative (CCSI) (30 September 2013)

The Carbon Capture Simulation Initiative (CCSI) is a partnership among national laboratories, industry and academic institutions that is developing and deploying state-of-the-art computational modeling and simulation tools to accelerate the commercialization of carbon capture technologies from discovery to development, demonstration, and ultimately the widespread deployment to hundreds of power plants. The CCSI Toolset will provide end users in industry with a comprehensive, integrated suite of scientifically validated models, with uncertainty quantification (UQ), optimization, risk analysis and decision making capabilities. The CCSI Toolset incorporates commercial and open-source software currently in use by industry and is also developing new software tools as necessary to fill technology gaps identified during execution of the project. Ultimately, the CCSI Toolset will (1) enable promising concepts to be more quickly identified through rapid computational screening of devices and processes; (2) reduce the time to design and troubleshoot new devices and processes; (3) quantify the technical risk in taking technology from laboratory-scale to commercial-scale; and (4) stabilize deployment costs more quickly by replacing some of the physical operational tests with virtual power plant simulations. CCSI is led by the National Energy Technology Laboratory (NETL) and leverages the Department of Energy (DOE) national laboratories’ core strengths in modeling and simulation, bringing together the best capabilities at NETL, Los Alamos National Laboratory (LANL), Lawrence Berkeley National Laboratory (LBNL), Lawrence Livermore National Laboratory (LLNL), and Pacific Northwest National Laboratory (PNNL). The CCSI’s industrial partners provide representation from the power generation industry, equipment manufacturers, technology providers and engineering and construction firms. The CCSI’s academic participants (Carnegie Mellon University, Princeton University, West Virginia University, Boston University and the University of Texas at Austin) bring unparalleled expertise in multiphase flow reactors, combustion, process synthesis and optimization, planning and scheduling, and process control techniques for energy processes. During Fiscal Year (FY) 13, CCSI announced the initial release of its first set of computational tools and models during the October 2012 meeting of its Industry Advisory Board. This initial release led to five companies licensing the CCSI Toolset under a Test and Evaluation Agreement this year. By the end of FY13, the CCSI Technical Team had completed development of an updated suite of computational tools and models. The list below summarizes the new and enhanced toolset components that were released following comprehensive testing during October 2013. 1. FOQUS. Framework for Optimization and Quantification of Uncertainty and Sensitivity. Package includes: FOQUS Graphic User Interface (GUI), simulation-based optimization engine, Turbine Client, and heat integration capabilities. There is also an updated simulation interface and new configuration GUI for connecting Aspen Plus or Aspen Custom Modeler (ACM) simulations to FOQUS and the Turbine Science Gateway. 2. A new MFIX-based Computational Fluid Dynamics (CFD) model to predict particle attrition. 3. A new dynamic reduced model (RM) builder, which generates computationally efficient RMs of the behavior of a dynamic system. 4. A completely re-written version of the algebraic surrogate model builder for optimization (ALAMO). The new version is several orders of magnitude faster than the initial release and eliminates the MATLAB dependency. 5. A new suite of high resolution filtered models for the hydrodynamics associated with horizontal cylindrical objects in a flow path. 6. The new Turbine Science Gateway (Cluster), which supports FOQUS for running multiple simulations for optimization or UQ using a local computer or cluster. 7. A new statistical tool (BSS-ANOVA-UQ) for calibration and validation of CFD models. 8. A new basic data submodel in Aspen Plus format for a representative high viscosity capture solvent, 2-MPZ system. 9. An updated RM tool for CFD (REVEAL) that can create a RM from MFIX. A new lightweight, stand-alone version will be available in late 2013. 10. An updated RM integration tool to convert the RM from REVEAL into a CAPE-OPEN or ACM model for use in a process simulator. 11. An updated suite of unified steady-state and dynamic process models for solid sorbent carbon capture included bubbling fluidized bed and moving bed reactors. 12. An updated and unified set of compressor models including steady-state design point model and dynamic model with surge detection. 13. A new framework for the synthesis and optimization of coal oxycombustion power plants using advanced optimization algorithms. This release focuses on modeling and optimization of a cryogenic air separation unit (ASU). 14. A new technical risk model in spreadsheet format. 15. An updated version of the sorbent kinetic/equilibrium model for parameter estimation for the 1st generation sorbent model. 16. An updated process synthesis superstructure model to determine optimal process configurations utilizing surrogate models from ALAMO for adsorption and regeneration in a solid sorbent process. 17. Validation models for NETL Carbon Capture Unit utilizing sorbent AX. Additional validation models will be available for sorbent 32D in 2014. 18. An updated hollow fiber membrane model and system example for carbon capture. 19. An updated reference power plant model in Thermoflex that includes additional steam extraction and reinjection points to enable heat integration module. 20. An updated financial risk model in spreadsheet format.

01 COAL, LIGNITE, AND PEAT↗

Catalogs of compact groups of galaxies from the enhanced SDSS DR12

We apply a friends-of-friends algorithm to an enhanced SDSS DR12 spectroscopic catalog, including redshift from the literature to construct a catalog of 1588 N⩾3 compact groups of galaxies containing 5178 member galaxies and covering the redshift range 0.01 < z < 0.19. This catalog contains 18 times as many systems and reaches 3 times the depth of the similar catalog of Barton et al. We construct catalogs from both magnitude-limited and volume-limited galaxy samples. Like Barton et al. we omit the frequently applied isolation criterion in the compact group selection algorithm. Thus the groups selected by fixed projected spatial and rest-frame line-of-sight velocity separation produce a catalog of groups with a redshift-independent median size. In contrast to previous catalogs, the enhanced SDSS DR12 catalog (including galaxies with r < 14.5) includes many systems with z ≲ 0.05. The volume-limited samples are unique to this study. The compact group candidates in these samples have a median stellar mass independent of redshift. Groups with velocity dispersion ≲100 km s{sup −1} show abundant evidence for ongoing dynamical interactions among the members. The number density of the volume-limited catalogs agrees with previous catalogs at the lowest redshifts but decreases as the redshift increases. The SDSS fiber placement constraints limit the catalog’s completeness. In spite of this issue, the volume-limited catalogs provide a promising basis for detailed spatially resolved probes of the impact of galaxy–galaxy interactions within similar dense systems over a broad redshift range.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational strategies for three-dimensional flow simulations on distributed computer systems

This research effort is directed towards an examination of issues involved in porting large computational fluid dynamics codes in use within the industry to a distributed computing environment. This effort addresses strategies for implementing the distributed computing in a device independent fashion and load balancing. A flow solver called TEAM presently in use at Lockheed Aeronautical Systems Company was acquired to start this effort. The following tasks were completed: (1) The TEAM code was ported to a number of distributed computing platforms including a cluster of HP workstations located in the School of Aerospace Engineering at Georgia Tech; a cluster of DEC Alpha Workstations in the Graphics visualization lab located at Georgia Tech; a cluster of SGI workstations located at NASA Ames Research Center; and an IBM SP-2 system located at NASA ARC. (2) A number of communication strategies were implemented. Specifically, the manager-worker strategy and the worker-worker strategy were tested. (3) A variety of load balancing strategies were investigated. Specifically, the static load balancing, task queue balancing and the Crutchfield algorithm were coded and evaluated. (4) The classical explicit Runge-Kutta scheme in the TEAM solver was replaced with an LU implicit scheme. And (5) the implicit TEAM-PVM solver was extensively validated through studies of unsteady transonic flow over an F-5 wing, undergoing combined bending and torsional motion. These investigations are documented in extensive detail in the dissertation, 'Computational Strategies for Three-Dimensional Flow Simulations on Distributed Computing Systems', enclosed as an appendix.

Sankar, Lakshmi N.↗

HipBone: A performance-portable graphics processing unit-accelerated C++ version of the NekBone benchmark

We present hipBone, an open-source performance-portable proxy application for the Nek5000 (and NekRS) computational fluid dynamics applications. HipBone is a fully GPU-accelerated C++ implementation of the original NekBone CPU proxy application with several novel algorithmic and implementation improvements which optimize its performance on modern fine-grain parallel GPU accelerators. Our optimizations include a conversion to store the degrees of freedom of the problem in assembled form in order to reduce the amount of data moved during the main iteration and a portable implementation of the main Poisson operator kernel. We demonstrate near-roofline performance of the operator kernel on three different modern GPU accelerators from two different vendors. We present a novel algorithm for splitting the application of the Poisson operator on GPUs which aggressively hides MPI communication required for both halo exchange and assembly. Our implementation of nearest-neighbor MPI communication then leverages several different routing algorithms and GPU-Direct RDMA capabilities, when available, which improves scalability of the benchmark. We demonstrate the performance of hipBone on three different clusters housed at Oak Ridge National Laboratory, namely, the Summit supercomputer and the Frontier early-access clusters, Spock and Crusher. Our tests demonstrate both portability across different clusters and very good scaling efficiency, especially on large problems.

Computer Science↗

Simulation of Guidance, Navigation, and Control Systems for Formation Flying Missions

Concepts for missions of distributed spacecraft flying in formation abound. From high resolution interferometry to spatially distributed in-situ measurements, these mission concepts levy a myriad of guidance, navigation, and control (GNC) requirements on the spacecraft/formation as a single system. A critical step toward assessing and meeting these challenges lies in realistically simulating distributed spacecraft systems. The Formation Flying TestBed (FFTB) at NASA Goddard Space Flight Center's (GSFC) Guidance, Navigation, and Control Center is a hardware-in-the-loop simulation and development facility focused on GNC issues relevant to formation flying systems. The FFTB provides a realistic simulation of the vehicle dynamics and control for formation flying missions in order to: (1) conduct feasibility analyses of mission requirements, (2) conduct and answer mission and spacecraft design trades, and (3) serve as a host for GNC software and hardware development and testing. The initial capabilities of the FFTB are based upon an integration of high fidelity hardware and software simulation, emulation, and test platforms developed or employed at GSFC in recent years, including a high-fidelity Global Positioning System (GPS) simulator which has been a fundamental component of the GNC Center's GPS Test Facility. The FFTB will be continuously evolving over the next several years from a tool with capabilities in GPS navigation hardware/software-in-the-loop analysis and closed loop GPS-based orbit control algorithm assessment. Eventually, it will include full capability to support all aspects of multi-sensor, absolute and relative state determination and control, in all (attitude and orbit) degrees of freedom, as well as information management for satellite clusters and constellations. A detailed description of the FFTB architecture is presented in the paper.

Burns, Rich↗

Interlaced coarse-graining for the dynamic cluster approximation

The dynamical cluster approximation (DCA) and its DCA + extension use coarse-graining of the momentum space to reduce the complexity of quantum many-body problems, thereby mapping the bulk lattice to a cluster embedded in a dynamical mean-field host. In this work, we introduce a new form of an interlaced coarse-graining and compare it with the traditional coarse-graining. While it gives a more localized self-energy for a given cluster size, we show that it leads to more controlled results with weaker cluster shape and smoother cluster size dependence, which converge to the results obtained from the standard coarse-graining with increasing cluster size. Most importantly, the new coarse-graining reduces the severity of the fermionic sign problem of the underlying quantum Monte Carlo cluster solver and thus allows for calculations on larger clusters. This enables the treatment of correlations longer ranged than those accessible with the standard coarse-graining and thus can allow for the evaluation of the exact infinite cluster size result via finite size scaling. As a demonstration, we study the hole-doped two-dimensional Hubbard model and show that the interlaced coarse-graining in combination with the extended DCA + algorithm permits the determination of the superconducting T c on cluster sizes for which the results can be fit with a Kosterlitz-Thouless scaling law.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗