Search NASA⌕ Search

SEARCH · Search NASA

Results for “Balanced convergence rate”

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 19 records

Self-adaptive weights based on balanced residual decay rate for physics-informed neural networks and deep operator networks

Physics-informed deep learning has emerged as a promising alternative for solving partial differential equations. However, for complex problems, training these networks can still be challenging, often resulting in unsatisfactory accuracy and efficiency. In this work, we demonstrate that the failure of plain physics-informed neural networks arises from the significant discrepancy in the convergence rate of residuals at different training points, where the slowest convergence rate dominates the overall solution convergence. Based on these observations, we propose a pointwise adaptive weighting method that balances the residual decay rate across different training points. The performance of our proposed adaptive weighting method is compared with current state-of-the-art adaptive weighting methods on benchmark problems for both physics-informed neural networks and physics-informed deep operator networks. In conclusion, through extensive numerical results we demonstrate that our proposed approach of balanced residual decay rates offers several advantages, including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Balanced convergence rate↗

Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics

Most of the recently proposed computational methods for solving partial differential equations on multiprocessor architectures stem from the 'divide and conquer' paradigm and involve some form of domain decomposition. For those methods which also require grids of points or patches of elements, it is often necessary to explicitly partition the underlying mesh, especially when working with local memory parallel processors. In this paper, a family of cost-effective algorithms for the automatic partitioning of arbitrary two- and three-dimensional finite element and finite difference meshes is presented and discussed in view of a domain decomposed solution procedure and parallel processing. The influence of the algorithmic aspects of a solution method (implicit/explicit computations), and the architectural specifics of a multiprocessor (SIMD/MIMD, startup/transmission time), on the design of a mesh partitioning algorithm are discussed. The impact of the partitioning strategy on load balancing, operation count, operator conditioning, rate of convergence and processor mapping is also addressed. Finally, the proposed mesh decomposition algorithms are demonstrated with realistic examples of finite element, finite volume, and finite difference meshes associated with the parallel solution of solid and fluid mechanics problems on the iPSC/2 and iPSC/860 multiprocessors.

Farhat, Charbel↗

Indirect addressing and load balancing for faster solution to Mandelbrot Set on SIMD architectures

SIMD computers with local indirect addressing allow programs to have queues and buffers, making certain kinds of problems much more efficient. Examined here are a class of problems characterized by computations on data points where the computation is identical, but the convergence rate is data dependent. Normally, in this situation, the algorithm time is governed by the maximum number of iterations required by each point. Using indirect addressing allows a processor to proceed to the next data point when it is done, reducing the overall number of iterations required to approach the mean convergence rate when a sufficiently large problem set is solved. Load balancing techniques can be applied for additional performance improvement. Simulations of this technique applied to solving Mandelbrot Sets indicate significant performance gains.

Tomboulian, Sherryl↗

Domain decomposition methods for nonconforming finite element spaces of Lagrange-type

In this article, we consider the application of three popular domain decomposition methods to Lagrange-type nonconforming finite element discretizations of scalar, self-adjoint, second order elliptic equations. The additive Schwarz method of Dryja and Widlund, the vertex space method of Smith, and the balancing method of Mandel applied to nonconforming elements are shown to converge at a rate no worse than their applications to the standard conforming piecewise linear Galerkin discretization. Essentially, the theory for the nonconforming elements is inherited from the existing theory for the conforming elements with only modest modification by constructing an isomorphism between the nonconforming finite element space and a space of continuous piecewise linear functions.

Cowsar, Lawrence C.↗

Effects of diabatic heating on the ageostrophic circulation of an upper tropospheric jet streak

Interaction between the mass circulation within a mesoscale convective complex (MCC) and a direct mass circulation in the entrance region of an upper tropospheric polar jet streak was examined within the isentropic structure to investigate mechanisms responsible for linking these two scales of motion. The results establish that latent heating in the MCC modifies the direct mass circulation in the jet streak entrance region through the diabatically induced components of ageostrophic motion analyzed within isentropic coordinates. Within the strong mesoscale mass circulation of each MCC, strong horizontal mass flux convergence into the MCC at low levels is balanced by strong horizontal mass flux divergence away from the convergence at upper levels. Locations of large diabatic heating rates correspond well to the MCC position for each case; diabatic heating forces the upward vertical branch for the mesoscale mass circulation.

Keyser, D. A.↗

Nonrecursive formulations of multibody dynamics and concurrent multiprocessing

Since the late 1980's, research in recursive formulations of multibody dynamics has flourished. Historically, much of this research can be traced to applications of low dimensionality in mechanism and vehicle dynamics. Indeed, there is little doubt that recursive order N methods are the method of choice for this class of systems. This approach has the advantage that a minimal number of coordinates are utilized, parallelism can be induced for certain system topologies, and the method is of order N computational cost for systems of N rigid bodies. Despite the fact that many authors have dismissed redundant coordinate formulations as being of order N(exp 3), and hence less attractive than recursive formulations, we present recent research that demonstrates that at least three distinct classes of redundant, nonrecursive multibody formulations consistently achieve order N computational cost for systems of rigid and/or flexible bodies. These formulations are as follows: (1) the preconditioned range space formulation; (2) penalty methods; and (3) augmented Lagrangian methods for nonlinear multibody dynamics. The first method can be traced to its foundation in equality constrained quadratic optimization, while the last two methods have been studied extensively in the context of coercive variational boundary value problems in computational mechanics. Until recently, however, they have not been investigated in the context of multibody simulation, and present theoretical questions unique to nonlinear dynamics. All of these nonrecursive methods have additional advantages with respect to recursive order N methods: (1) the formalisms retain the highly desirable order N computational cost; (2) the techniques are amenable to concurrent simulation strategies; (3) the approaches do not depend upon system topology to induce concurrency; and (4) the methods can be derived to balance the computational load automatically on concurrent multiprocessors. In addition to the presentation of the fundamental formulations, this paper presents new theoretical results regarding the rate of convergence of order N constraint stabilization schemes associated with the newly introduced class of methods.

Kurdila, Andrew J.↗

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗

Self-regulating behavior of hybrid membrane systems as demonstrated in an element-scale forward osmosis-reverse osmosis hybrid system

Hybrid membrane systems can be difficult to design due to the requisite flow rate matching between up- and downstream unit operations. In this work, we use a forward osmosis-reverse osmosis (FO-RO) hybrid system to demonstrate how some membrane systems can exhibit self-regulating behavior due to osmotic coupling. This can reduce the need for complex control systems for flow balancing. We show this behavior using a module-scale test bed that can mimic the behavior of larger scale operations. The system shows permeate flow rate near-convergence between the FO and RO modules after startup or when perturbed by a change in RO module pressure. The behavior of this hybrid system demonstrates that some membrane operations can exploit osmotic interdependence, rather than expensive control systems, to achieve steady state operation.

Debottlenecking↗

Maintenance of strong rotational winds in Venus' middle atmosphere by thermal tides

The cloud-level atmosphere of Venus takes little more than four days to complete one rotation, whereas the solid planet below has a 243-day period. Computer simulations of the circulation of the Venus middle atmosphere between 40 and 85 kilometers, as driven by solar radiation absorbed in the clouds, reproduce (1) the observed cloud-level rotation rate, (2) strong vertical shears above and below the cloud tops, and (3) midlatitude jets and strong poleward flow on the day side. Simulated circulations converge to yield nearly the same zonal winds when initialized with both stronger or weaker rotation rates. These results support the hypothesis that the observed cloud-top rotation rate is maintained by statistical balance between fluxes of momentum by thermal tides and momentum advection by mean meridional circulation.

Newman, Matthew↗

Uniform convergence of an upwind discontinuous Galerkin method for solving scaled discrete-ordinate radiative transfer equations with isotropic scattering

Here we present an error analysis for the discontinuous Galerkin (DG) method applied to the discrete-ordinate discretization of the steady-state radiative transfer equation with isotropic scattering. Under some mild assumptions, we show that the DG method converges uniformly with respect to a scaling parameter which characterizes the strength of scattering in the system. However, the rate is not optimal and can be polluted by the presence of boundary layers. In one-dimensional slab geometries, we demonstrate optimal convergence when boundary layers are not present and analyze a simple strategy for balance interior and boundary layer errors. Some numerical tests are also provided in this reduced setting.

97 MATHEMATICS AND COMPUTING↗

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

Modifications to the nozzle test chamber to extend nozzle static-test capability

The nozzle test chamber was modified to provide a high-pressure-ratio nozzle static-test capability. Experiments were conducted to determine the range of the ratio of nozzle total pressure to chamber pressure and to make direct nozzle thrust measurements using a three-component strain-gage force balance. Pressure ratios from 3 to 285 were measured with several axisymmetric nozzles at a nozzle total pressure of 15 to 190 psia. Devices for measuring system mass flow were calibrated using standard axisymmetric convergent choked nozzles. System mass-flow rates up to 10 lbm/sec are measured. The measured thrust results of these nozzles are in good agreement with one-dimensional theoretical predictions for convergent nozzles.

Keyes, J. W.↗

Precipitation Efficiency in the Tropical Deep Convective Regime

Precipitation efficiency in the tropical deep convective regime is analyzed based on a 2-D cloud resolving simulation. The cloud resolving model is forced by the large-scale vertical velocity and zonal wind and large-scale horizontal advections derived from TOGA COARE for a 20-day period. Precipitation efficiency may be defined as a ratio of surface rain rate to sum of surface evaporation and moisture convergence (LSPE) or a ratio of surface rain rate to sum of condensation and deposition rates of supersaturated vapor (CMPE). Moisture budget shows that the atmosphere is moistened (dryed) when the LSPE is less (more) than 100 %. The LSPE could be larger than 100 % for strong convection. This indicates that the drying processes should be included in cumulus parameterization to avoid moisture bias. Statistical analysis shows that the sum of the condensation and deposition rates is bout 80 % of the sum of the surface evaporation rate and moisture convergence, which ads to proportional relation between the two efficiencies when both efficiencies are less han 100 %. The CMPE increases with increasing mass-weighted mean temperature and creasing surface rain rate. This suggests that precipitation is more efficient for warm environment and strong convection. Approximate balance of rates among the condensation, deposition, rain, and the raindrop evaporation is used to derive an analytical solution of the CMPE.

Li, Xiaofan↗

Concurrent Probabilistic Simulation of High Temperature Composite Structural Response

A computational structural/material analysis and design tool which would meet industry's future demand for expedience and reduced cost is presented. This unique software 'GENOA' is dedicated to parallel and high speed analysis to perform probabilistic evaluation of high temperature composite response of aerospace systems. The development is based on detailed integration and modification of diverse fields of specialized analysis techniques and mathematical models to combine their latest innovative capabilities into a commercially viable software package. The technique is specifically designed to exploit the availability of processors to perform computationally intense probabilistic analysis assessing uncertainties in structural reliability analysis and composite micromechanics. The primary objectives which were achieved in performing the development were: (1) Utilization of the power of parallel processing and static/dynamic load balancing optimization to make the complex simulation of structure, material and processing of high temperature composite affordable; (2) Computational integration and synchronization of probabilistic mathematics, structural/material mechanics and parallel computing; (3) Implementation of an innovative multi-level domain decomposition technique to identify the inherent parallelism, and increasing convergence rates through high- and low-level processor assignment; (4) Creating the framework for Portable Paralleled architecture for the machine independent Multi Instruction Multi Data, (MIMD), Single Instruction Multi Data (SIMD), hybrid and distributed workstation type of computers; and (5) Market evaluation. The results of Phase-2 effort provides a good basis for continuation and warrants Phase-3 government, and industry partnership.

Abdi, Frank↗

Elevated nocturnal respiratory rates in the mitochondria of CAM plants: current knowledge and unanswered questions

Abstract Crassulacean acid metabolism (CAM) is a metabolic adaptation that has evolved convergently in 38 plant families to aid survival in water-limited niches. Whilst primarily considered a photosynthetic adaptation, CAM also has substantial consequences for nocturnal respiratory metabolism. Here, we outline the history, current state and future of nocturnal respiration research in CAM plants, with a particular focus on the energetics of nocturnal respiratory oxygen consumption. Throughout the 20th century, research interest in nocturnal respiration occurred alongside initial discoveries of CAM, although the energetic and mechanistic implications of nocturnal oxygen consumption and links to the operation of the CAM cycle were not fully understood. Recent flux balance analysis (FBA) models have provided new insights into the role that mitochondria play in the CAM cycle. Several FBA models have predicted that CAM requires elevated nocturnal respiratory rates, compared to C3 species, to power vacuolar malic acid accumulation. We provide physiological data, from the genus Clusia, to corroborate these modelling predictions, thereby reinforcing the importance of elevated nocturnal respiratory rates for CAM. Finally, we outline five unanswered questions pertaining to nocturnal respiration which must be addressed if we are to fully understand and utilize CAM plants in a hotter, drier world.

59 BASIC BIOLOGICAL SCIENCES↗

Determining best practices for using genetic algorithms in molecular discovery

Genetic algorithms (GAs) are a powerful tool to search large chemical spaces for inverse molecular design. However, GAs have multiple hyperparameters that have not been thoroughly investigated for chemical space searches. In this tutorial, we examine the general effects of a number of hyperparameters, such as population size, elitism rate, selection method, mutation rate, and convergence criteria, on key GA performance metrics. Here, we show that using a self-termination method with a minimum Spearman’s rank correlation coefficient of 0.8 between generations maintained for 50 consecutive generations along with a population size of 32, a 50% elitism rate, three-way tournament selection, and a 40% mutation rate provides the best balance of finding the overall champion, maintaining good coverage of elite targets, and improving relative speedup for general use in molecular design GAs.

36 MATERIALS SCIENCE↗

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗

Energetics of a sudden stratospheric warming simulated with a three-dimensional, spectral, quasi-geostrophic model

The energetics of a three dimensional, quasi-geostrophic simulation of a sudden stratospheric warming which developed spontaneously during an annual cycle simulation are described. Daily values of the stratospheric temperatures, zonal winds, heating rates, energies, and energy conversions are discussed and compared with those for observed warmings. It is shown that, like observed warmings, the simulated warming was preceded by an increased vertical flux of eddy kinetic energy from the troposphere and the polar heating resulted because of the strong convergence of the horizontal, eddy heat flux which was only partially balanced by adiabatic and diabatic cooling. There is a significant similarity between the energetics of the simulated and observed warmings. In addition, the warming was spontaneous and the model did not develop a major warming in each winter of the simulation. These facts suggest that this model may be useful for studying not only the warming process but also the conditions that favor its development.

Haggard, K. V.↗