Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hierarchical models”

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 487 records · Page 27

Expanding Repository Data Available For Sharing And Knowledge Discovery

Some of the hardest space biology and space health challenges require data-intensive, bioinformatic, meta-analytical, and computer-assisted research approaches. These challenges include examining interdisciplinary space life science research across experiments and across interacting spaceflight hazards (radiation, altered gravity, confinement, hostile-closed environments, distance-duration from Earth). The approaches to confront these challenges involve mining multiple datasets simultaneously from various hierarchical organizations of biological complexity, all while concurrently evaluating how experimental design factors affect endpoints of standard assays. To enable this field, it is essential that principal investigators (PIs) submit data in a structure so it can be maximally re-used. The purpose of the NASA Ames Life Sciences Data Archive (ALSDA) is to collect, curate, and make publicly available all non-human space-relevant biological data. ALSDA must also ensure data are open-access, and maximally findable, accessible, interoperable, and reusable (FAIR). The scope of ALSDA data collected and submitted by PIs include subject and study design metadata, assay metadata parameters, raw and processed assay data, assay imagery/video, and subject-experienced mission data telemetry (radiation, temperature, humidity, acoustics, vibrations, etc.). ALSDA recently integrated into a collaborative group of Open Science projects to facilitate a suite of new tools and workflows that will improve data submission, accessibility, and reusability by implementing digital data submission agreements, and adopting the data management system originally developed by NASA GeneLab. ALSDA intends to bring current biological repository data and all future collected data into this new scientific data reuse reality. This new suite of tools will enable ALSDA to deploy a science curation system using scientific assay configurations for the data submission portal. It will capture essential assay parameters according to established standards in each sub-field within biology. The submission portal expedites data collection by enhancing ease of PI data submission, providing a user interface and specificity for which data is to be submitted. Data submissions can be brought into cutting-edge informatic analysis portals to enable mining of physiological, behavioral, biochemical, and imaging datasets in conjunction with ‘omics-level datasets. As ALSDA datasets are submitted, curated, and published (e.g., micro-computed tomography, histology, pulse oximetry, serum metabolites, magnetic resonance imaging, intraocular pressure, novel object recognition, etc.), the merging together of spaceflight data along this multi-hierarchical complexity of biology will enable informatics and data-intensive approaches resulting in knowledge discoveries across missions, space hazards, and biological disciplines.

life science↗

Generic Equations for Constructing Smooth Paths Along Circles and Tangent Lines With Application to Airport Ground Paths

The primary purpose of this publication is to develop a mathematical model to describe smooth paths along any combination of circles and tangent lines. Two consecutive circles in a path are either tangent (externally or internally) or they appear on the same (lateral) or opposite (transverse) sides of a connecting tangent line. A path may start or end on either a segment or circle. The approach is to use mathematics common to robotics to design the path as a multilink manipulator. This approach allows a hierarchical view of the problem and keeps the notation manageable. A user simply specifies a few parameters to configure a path. Necessary and sufficient conditions automatically ensure the consistency of the inputs for a smooth path. Two example runway exit paths are given, and an angle to go assists in knowing when to switch from one path element to the next.

Barker, L. Keith↗

An O(Nm(sup 2)) Plane Solver for the Compressible Navier-Stokes Equations

A hierarchical multigrid algorithm for efficient steady solutions to the two-dimensional compressible Navier-Stokes equations is developed and demonstrated. The algorithm applies multigrid in two ways: a Full Approximation Scheme (FAS) for a nonlinear residual equation and a Correction Scheme (CS) for a linearized defect correction implicit equation. Multigrid analyses which include the effect of boundary conditions in one direction are used to estimate the convergence rate of the algorithm for a model convection equation. Three alternating-line- implicit algorithms are compared in terms of efficiency. The analyses indicate that full multigrid efficiency is not attained in the general case; the number of cycles to attain convergence is dependent on the mesh density for high-frequency cross-stream variations. However, the dependence is reasonably small and fast convergence is eventually attained for any given frequency with either the FAS or the CS scheme alone. The paper summarizes numerical computations for which convergence has been attained to within truncation error in a few multigrid cycles for both inviscid and viscous ow simulations on highly stretched meshes.

Thomas, J. L.↗

Molecular cloud evolution and star formation

The present state of knowledge of the relationship between molecular clouds and young stars is reviewed. The determination of physical parameters from molecular line observations is summarized, and evidence for fragmentation of molecular clouds is discussed. Hierarchical fragmentation is reviewed, minimum fragment scales are derived, and the stability against fragmentation of both spherically and anisotropically collapsing clouds is discussed. Observational evidence for high-velocity flows in clouds is summarized, and the effects of winds from pre-main sequence stars on molecular gas are discussed. The triggering of cloud collapse by enhanced pressure is addressed, as is the formation of dense shells by spherical outflows and their subsequent breakup. A model for low-mass star formation is presented, and constraints on star formation from the initial mass function are examined. The properties of giant molecular clouds and massive star formation are described. The implications of magnetic fields for cloud evolution and star formation are addressed.

Silk, J.↗

Discovery of a possible X-ray triple - 4U 1915-05

The optical counterpart of the 50 minute binary and X-ray burst source 4U 1915-05 has been identified with a 21st mag blue object. Extensive CCD photometric observations show that the optical modulation of the system defines a period of 50.4567 minutes with high precision and is thus probably the true orbital period, whereas the range of X-ray ray dip period values (49.7-50.1 minutes) reported previously are excluded. A model is described whereby the optical modulation is due to partial eclipse of the rim of the accretion disk by a low-mass companion star and the X-ray dips are due to absorption and scattering by blobs of material above and below the disk plane and with density proportional to the current mass transfer rate from the companion star. The 1 percent difference in periods may suggest that the system is a hierarchical triple with a third companion star of low-mass orbiting the binary ion in an about 2.5 day retrograde orbit. The possible origin of such a system by tidal capture in a globular cluster, since disrupted, is briefly discussed.

Grindlay, J. E.↗

Design and Analysis Tools for Concurrent Blackboard Systems

A blackboard system consists of a set of knowledge sources, a blackboard data structure, and a control strategy used to activate the knowledge sources. The blackboard model of problem solving is best described by Dr. H. Penny Nii of the Stanford University AI Laboratory: "A Blackboard System can be viewed as a collection of intelligent agents who are gathered around a blackboard, looking at pieces of information written on it, thinking about the current state of the solution, and writing their conclusions on the blackboard as they generate them. " The blackboard is a centralized global data structure, often partitioned in a hierarchical manner, used to represent the problem domain. The blackboard is also used to allow inter-knowledge source communication and acts as a shared memory visible to all of the knowledge sources. A knowledge source is a highly specialized, highly independent process that takes inputs from the blackboard data structure, performs a computation, and places the results of the computation in the blackboard data structure. This design allows for an opportunistic control strategy. The opportunistic problem-solving technique allows a knowledge source to contribute towards the solution of the current problem without knowing which of the other knowledge sources will use the information. The use of opportunistic problem-solving allows the data transfers on the blackboard to determine which processes are active at a given time. Designing and developing blackboard systems is a difficult process. The designer is trying to balance several conflicting goals and achieve a high degree of concurrent knowledge source execution while maintaining both knowledge and semantic consistency on the blackboard. Blackboard systems have not attained their apparent potential because there are no established tools or methods to guide in their construction or analyze their performance.

McManus, John W.↗

The Pursuit of K: Reflections on the Current State-of-the-Art in Stress Intensity Factor Solutions for Practical Aerospace Applications

The elastic stress intensity factor (SIF, commonly denoted as K) is the foundation of practical fracture mechanics (FM) analysis for aircraft structures. This single parameter describes the first-order effects of stress magnitude and distribution as well as the geometry of both structure/component and crack. Hence, the calculation of K is often the most significant step in fatigue analysis based on FM. This presentation will provide several reflections on the current state-of-the-art in SIF solution methods used for practical aerospace applications, including a brief historical perspective, descriptions of some recent and ongoing advances, and comments on some remaining challenges. Newman and Raju made significant early contributions to practical structural analysis by developing closed-form SIF equations for surface and corner cracks in simplified geometries, often based on empirical fits of finite element (FE) solutions. Those solutions (and others like them) were sometimes revised as new analyses were conducted or limitations discovered. The foundational solutions have exhibited striking longevity, despite the relatively "coarse" FE models employed many decades ago. However, in recent years, the accumulation of different generations of solutions for the same nominal geometry has led to some confusion (which solution is correct?), and steady increases in computational capabilities have facilitated the discovery of inaccuracies in some (not all!) of the legacy solutions. Some examples of problems and solutions are presented and discussed, including the challenge of maintaining consistency with legacy design applications. As computational power has increased, the prospect of calculating large numbers of SIF solutions for specific complex geometries with advanced numerical methods has grown more attractive. Fawaz and Andersson, for example, have been generating literally millions of new SIF solutions for different combinations of multiple cracks under simplified loading schemes using p-version FE methods. These data are invaluable, but questions remain about their practical use, because the tabular databases of key results needed to support practical life analysis can occupy gigabytes of storage for only a few classes of geometries. The prospect of using such advanced numerical methods to calculate in real time only those K solutions actually needed to support a specific crack growth analysis is also tempting, but the stark reality is that the computational cost is still so high that the approach is not practical except for specific, critical application problems. Some thoughts are offered about alternative paradigms. Compounding approaches are some of the earliest building blocks of SIF development for more complex geometries. These approaches are especially attractive because of their very low computational cost and their conceptual robustness; they are, in some ways, an intriguing contrast and complement to the brute-force numerical methods. In recent years, researchers at NRC-Canada have published remarkable results showing how compounding approaches can be used to generate accurate solutions for very difficult problems. Examples are provided of some successes--and some limitations--using this approach. These closed-form, tabulated numerical, and compounding approaches have typically been used for simple remote loading with simple load paths to the crack. However, many significant cracks occur in complex stress gradient fields. This is a job for weight function (WF) methods, where the arbitrary stress distribution on the crack plane in the corresponding uncracked body (typically determined using FE methods) is used to determine K. Several significant recent advances in WF methods and solutions are highlighted here. Fueled by advanced 3D numerical methods, many new solutions have been generated for classic geometries such as surface and corner cracks with wide ranges of geometrical validity. A new WF formulation has also be developed for part-through cracks considering the arbitrary stress gradients in all directions in the crack plane (so-called bivariant solutions). Basic WF methods have recently been combined with analytical expressions for crack plane stresses to develop a large family of accurate SIF solutions for corner, surface, and through cracks at internal or external notches with very wide ranges of shapes, sizes, acuities, and offsets. Finally, WF solutions are much faster than FE or boundary element solutions, but can still be much slower than simple closed-form solutions, especially for bivariant solutions that can require 2D numerical integration. Novel pre-integration and dynamic tabular methods have been developed that substantially increase the speed of these advanced WF solutions. The practical utility of advanced SIF methods, including both WF and direct numerical methods, is greatly enhanced if the FM life analysis can be directly and efficiently linked with digital models of the actual structure or component (e.g., FE models for stress analysis). Two recent advances of this type will be described. One approach directly interfaces the FM life analysis with the FE model of the uncracked component (including stress results). Through a powerful graphical user interface, simplified FM life models can be constructed (and visualized) directly on the component model, with the computer collecting the geometry and stress gradient information needed for the life calculation. An even more powerful paradigm uses expert logic to automatically build an optimum simple fracture model at any and every desired location in the component model, perform the life calculation, and even generate fatigue crack growth life contour maps, all with minimal user intervention. This paradigm has also been extended to the automatic calculation of fracture risk, considering uncertainty or variability in key input parameters such as initial crack size or location. Another new integrated approach links the engineering life analysis, the component model, and a 3D numerical fracture analysis built with the same component model to generate a table of SIF values at a specific location that can then be employed efficiently to perform the life calculation. Some attention must be given to verification and validation (V&V) issues and challenges: how good are these SIF solutions, how good is good enough, and does anyone believe the life answer? It is important to think critically about the different sources of error or uncertainty and to perform V&V in a hierarchal, building-block manner. Some accuracy issues for SIF solutions, for example, may actually involve independent material behavior issues, such as constraint loss effects for crack fronts near component surfaces, and can be a source of confusion. Recommendations are proposed for improved V&V approaches. This presentation will briefly but critically survey the range of issues and advances mentioned above, with a particular view towards assembling an integrated approach that combines different methods to create practical tools for real-world design and analysis problems. Examples will be selectively drawn from the recent literature, from recent enhancements in the NASGRO and DARWIN computer codes, and from previously unpublished research

CraigMcClung, R.↗

Inductive Approaches to Improving Diagnosis and Design for Diagnosability

The first research area under this grant addresses the problem of classifying time series according to their morphological features in the time domain. A supervised learning system called CALCHAS, which induces a classification procedure for signatures from preclassified examples, was developed. For each of several signature classes, the system infers a model that captures the class's morphological features using Bayesian model induction and the minimum message length approach to assign priors. After induction, a time series (signature) is classified in one of the classes when there is enough evidence to support that decision. Time series with sufficiently novel features, belonging to classes not present in the training set, are recognized as such. A second area of research assumes two sources of information about a system: a model or domain theory that encodes aspects of the system under study and data from actual system operations over time. A model, when it exists, represents strong prior expectations about how a system will perform. Our work with a diagnostic model of the RCS (Reaction Control System) of the Space Shuttle motivated the development of SIG, a system which combines information from a model (or domain theory) and data. As it tracks RCS behavior, the model computes quantitative and qualitative values. Induction is then performed over the data represented by both the 'raw' features and the model-computed high-level features. Finally, work on clustering for operating mode discovery motivated some important extensions to the clustering strategy we had used. One modification appends an iterative optimization technique onto the clustering system; this optimization strategy appears to be novel in the clustering literature. A second modification improves the noise tolerance of the clustering system. In particular, we adapt resampling-based pruning strategies used by supervised learning systems to the task of simplifying hierarchical clusterings, thus making post-clustering analysis easier.

Fisher, Douglas H.↗

The evolution of voids in the adhesion approximation

We apply the adhesion approximation to study the formation and evolution of voids in the universe. Our simulations-carried out using 128(exp 3) particles in a cubical box with side 128 Mpc-indicate that the void spectrum evolves with time and that the mean void size in the standard Cosmic Background Explorer Satellite (COBE)-normalized cold dark matter (CDM) model with H(sub 50) = 1 scals approximately as bar D(z) = bar D(sub zero)/(1+2)(exp 1/2), where bar D(sub zero) approximately = 10.5 Mpc. Interestingly, we find a strong correlation between the sizes of voids and the value of the primordial gravitational potential at void centers. This observation could in principle, pave the way toward reconstructing the form of the primordialpotential from a knowledge of the observed void spectrum. Studying the void spectrum at different cosmological epochs, for spectra with a built in k-space cutoff we find that the number of voids in a representative volume evolves with time. The mean number of voids first increases until a maximum value is reached (indicating that the formation of cellular structure is complete), and then begins to decrease as clumps and filaments erge leading to hierarchical clustering and the subsequent elimination of small voids. The cosmological epoch characterizing the completion of cellular structure occurs when the length scale going nonlinear approaches the mean distance between peaks of the gravitaional potential. A central result of this paper is that voids can be populated by substructure such as mini-sheets and filaments, which run through voids. The number of such mini-pancakes that pass through a given void can be measured by the genus characteristic of an individual void which is an indicator of the topology of a given void in intial (Lagrangian) space. Large voids have on an average a larger measure than smaller voids indicating more substructure within larger voids relative to smaller ones. We find that the topology of individual voids is strongly epoch dependent, with void topologies generally simplifying with time. This means that as voids grow older they become progressively more empty and have less structure within them. We evaluate the genus measure both for individual voids as well as for the entire ensemble of voids predicted by CDM model. As a result we find that the topology of voids when taken together with the void spectrum is a very useful statistical indicator of the evolution of the structure of the universe on large scales.

Sahni, Varun↗

Approximation methods for stochastic petri nets

Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay equivalence often fails to converge, while flow equivalent aggregation can lead to potentially bad results if a strong dependence of the mean completion time on the interarrival process exists.

Jungnitz, Hauke Joerg↗

Hierarchical Velocity Structure in the Core of Abell 2597

We present XMM-Newton RGS and EPIC data of the putative cooling flow cluster Abell 2597. Velocities of the low-ionization emission lines in the spectrum are blue shifted with respect to the high-ionization lines by 1320 (sup +660) (sub -210) kilometers per second, which is consistent with the difference in the two peaks of the galaxy velocity distribution and may be the signature of bulk turbulence, infall, rotation or damped oscillation in the cluster. A hierarchical velocity structure such as this could be the direct result of galaxy mergers in the cluster core, or the injection of power into the cluster gas from a central engine. The uniform X-ray morphology of the cluster, the absence of fine scale temperature structure and the random distribution of the the galaxy positions, independent of velocity, suggests that our line of sight is close to the direction of motion. These results have strong implications for cooling flow models of the cluster Abell 2597. They give impetus to those models which account for the observed temperature structure of some clusters using mergers instead of cooling flows.

Still, Martin↗

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

The newly developed Trajectory Option Set (TOS), a preference-weighted set of alternative routes submitted by flight operators, is a capability in the U.S. traffic flow management system that enables automated trajectory negotiation between flight operators and Air Navigation Service Providers. The objective of this paper is to describe and demonstrate an approach for automatically generating pre-departure and airborne TOSs that have a high probability of operational acceptance. The approach uses hierarchical clustering of historical route data to identify route candidates. The probability of operational acceptance is then estimated using predictors trained on historical flight plan amendment data using supervised machine learning algorithms, allowing the routes with highest probability of operational acceptance to be selected for the TOS. Features used describe historical route usage, difference in flight time and downstream demand to capacity imbalance. A random forest was found to be the best performing algorithm for learning operational acceptability, with a model accuracy of 0.96. The approach is demonstrated for an historical pre-departure flight from Dallas/Fort Worth International Airport to Newark Liberty International Airport.

Evans, Antony↗

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

The newly developed Trajectory Option Set (TOS), a preference-weighted set of alternative routes submitted by flight operators, is a capability in the U.S. traffic flow management system that enables automated trajectory negotiation between flight operators and Air Navigation Service Providers. The objective of this paper is to describe and demonstrate an approach for automatically generating pre-departure and airborne TOSs that have a high probability of operational acceptance. The approach uses hierarchical clustering of historical route data to identify route candidates. The probability of operational acceptance is then estimated using predictors trained on historical flight plan amendment data using supervised machine learning algorithms, allowing the routes with highest probability of operational acceptance to be selected for the TOS. Features used describe historical route usage, difference in flight time and downstream demand to capacity imbalance. A random forest was found to be the best performing algorithm for learning operational acceptability, with a model accuracy of 0.96. The approach is demonstrated for an historical pre-departure flight from Dallas/Fort Worth International Airport to Newark Liberty International Airport.

Evans, Antony↗

MAPL3: A Hierarchical Framework Based on ESMF

MAPL is a hierarchical, ESMF-based, coupling framework developed to support NASA's GEOS data assimilation system, but also now supports some external applications from partner institutions. The framework continues to evolve in response novel coupling requirements and is currently undergoing a substantial re-engineering effort to improve extensibility and maintainability. Some of the major new features that will be provided in the upcoming release of MAPL3 include the following: (1) "weak" NUOPC compliance that expresses a MAPL hierarchy as single NUOPC model, (2) component extensions that represent an improvement over conventional component couplers in many contexts, (3) an expansion of the concept of import and export to include component "services" such as advection, turbulence, etc., (4) automated OpenMP threading of column-based component subtrees, (5) and (5) improved I/O scalability.

GEOS↗

Designers' models of the human-computer interface

Understanding design models of the human-computer interface (HCI) may produce two types of benefits. First, interface development often requires input from two different types of experts: human factors specialists and software developers. Given the differences in their backgrounds and roles, human factors specialists and software developers may have different cognitive models of the HCI. Yet, they have to communicate about the interface as part of the design process. If they have different models, their interactions are likely to involve a certain amount of miscommunication. Second, the design process in general is likely to be guided by designers' cognitive models of the HCI, as well as by their knowledge of the user, tasks, and system. Designers do not start with a blank slate; rather they begin with a general model of the object they are designing. The author's approach to a design model of the HCI was to have three groups make judgments of categorical similarity about the components of an interface: human factors specialists with HCI design experience, software developers with HCI design experience, and a baseline group of computer users with no experience in HCI design. The components of the user interface included both display components such as windows, text, and graphics, and user interaction concepts, such as command language, editing, and help. The judgments of the three groups were analyzed using hierarchical cluster analysis and Pathfinder. These methods indicated, respectively, how the groups categorized the concepts, and network representations of the concepts for each group. The Pathfinder analysis provides greater information about local, pairwise relations among concepts, whereas the cluster analysis shows global, categorical relations to a greater extent.

Gillan, Douglas J.↗

Trustworthy Autonomy for Gateway Vehicle System Manager

The Vehicle System Manager (VSM) is the highest-level software control system in the Gateway hierarchical Autonomous System Management Architecture. The VSM provides four function categories: Mission Management and Timeline Execution, Resource Management, Fault Management, Vehicle Control and Operation. VSM provides various levels of automation ranging from fully autonomous operations with no flight crew and minimal ground monitoring to advisory automation when Gateway is crewed and has full ground monitoring. Trustworthiness is achieved via verified specification, comprehensive development verification, and real-time verification using assume-guarantee contracts. Development verification includes semantic verification of the data model via peer review and testing and assume-guarantee contracts implemented using the PlusCal/TLA+ environment. VSM also uses runtime assume-guarantee contracts, implemented in R2U2 via a runtime monitor that feeds the necessary telemetry data to R2U2 and which receives and responds to the R2U2 verdict stream. The full lifecycle verification approach and use of assume-guarantee contracts provides increased trustworthiness to VSM. Preliminary results provide encouragement that VSM can be both autonomous and trustworthy.

Assume-guarantee contracts↗

The Rise and Fall of Star Formation Histories of Blue Galaxies at Redshifts 0.2 < z < 1.4

Popular cosmological scenarios predict that galaxies form hierarchically from the merger of many progenitor, each with their own unique star formation history (SFH). We use the approach recently developed by Pacifici et al. to constrain the SFHs of 4517 blue (presumably star-forming) galaxies with spectroscopic redshifts in the range O.2 < z < 1:4 from the All-Wavelength Extended Groth Strip International Survey (AEGIS). This consists in the Bayesian analysis of the observed galaxy spectral ' energy distributions with a comprehensive library of synthetic spectra assembled using state-of-the-art models of star formation and chemical enrichment histories, stellar population synthesis, nebular emission and attenuation by dust. We constrain the SFH of each galaxy in our sample by comparing the observed fluxes in the B, R,l and K(sub s) bands and rest-frame optical emission-line luminosities with those of one million model spectral energy distributions. We explore the dependence of the resulting SFH on galaxy stellar mass and redshift. We find that the average SFHs of high-mass galaxies rise and fall in a roughly symmetric bell-shaped manner, while those of low-mass galaxies rise progressively in time, consistent with the typically stronger activity of star formation in low-mass compared to high-mass galaxies. For galaxies of all masses, the star formation activity rises more rapidly at high than at low redshift. These findings imply that the standard approximation of exponentially declining SFHs wIdely used to interpret observed galaxy spectral energy distributions is not appropriate to constrain the physical parameters of star-forming galaxies at intermediate redshifts.

Pacifici, Camilla↗

Improved Convergence and Robustness of USM3D Solutions on Mixed Element Grids (Invited)

Several improvements to the mixed-element USM3D discretization and defect-correction schemes have been made. A new methodology for nonlinear iterations, called the Hierarchical Adaptive Nonlinear Iteration Scheme (HANIS), has been developed and implemented. It provides two additional hierarchies around a simple and approximate preconditioner of USM3D. The hierarchies are a matrix-free linear solver for the exact linearization of Reynolds-averaged Navier Stokes (RANS) equations and a nonlinear control of the solution update. Two variants of the new methodology are assessed on four benchmark cases, namely, a zero-pressure gradient flat plate, a bump-in-channel configuration, the NACA 0012 airfoil, and a NASA Common Research Model configuration. The new methodology provides a convergence acceleration factor of 1.4 to 13 over the baseline solver technology.

Pandya, Mohagna J.↗