Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 757 records · Page 42

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗

Compression Algorithm Analysis of In-Situ (S)TEM Video: Towards Automatic Event Detection and Characterization

Precise analysis of both (S)TEM images and video are time and labor intensive processes. As an example, determining when crystal growth and shrinkage occurs during the dynamic process of Li dendrite deposition and stripping involves manually scanning through each frame in the video to extract a specific set of frames/images. For large numbers of images, this process can be very time consuming, so a fast and accurate automated method is desirable. Given this need, we developed software that uses analysis of video compression statistics for detecting and characterizing events in large data sets. This software works by converting the data into a series of images which it compresses into an MPEG-2 video using the open source “avconv” utility [1]. The software does not use the video itself, but rather analyzes the video statistics from the first pass of the video encoding that avconv records in the log file. This file contains statistics for each frame of the video including the frame quality, intra-texture and predicted texture bits, forward and backward motion vector resolution, among others. In all, avconv records 15 statistics for each frame. By combining different statistics, we have been able to detect events in various types of data. We have developed an interactive tool for exploring the data and the statistics that aids the analyst in selecting useful statistics for each analysis. Going forward, an algorithm for detecting and possibly describing events automatically can be written based on statistic(s) for each data type.

algorithm analysis↗

Ancilla-entangling Floquet kicks for accelerating quantum algorithms

Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and thus places an annealing rate bottleneck for high success probability. Here, in this study, we accelerate quantum simulation using digital multiqubit gates that entangle primary system qubits with ancillary qubits. The practical benefits originate from tuning the ancillary gauge degrees of freedom to enhance the quantum algorithm's original functionality in the system registry. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent but with higher accuracy through exact state-vector numerical simulation in a digital-analog setting. The findings are further supported by time-averaged Hamiltonian theory.

97 MATHEMATICS AND COMPUTING↗

Classical spin glass system in external field with taking into account relaxation effects

We study statistical properties of disordered spin systems under the influence of an external field with taking into account relaxation effects. For description of system the spatial 1D Heisenberg spin-glass Hamiltonian is used. In addition, we suppose that interactions occur between nearest-neighboring spins and they are random. Exact solutions which define angular configuration of the spin in nodes were obtained from the equations of stationary points of Hamiltonian and the corresponding conditions for the energy local minimum. On the basis of these recurrent solutions an effective parallel algorithm is developed for simulation of stabile spin-chains of an arbitrary length. It is shown that by way of an independent order of N{sup 2} numerical simulations (where N is number of spin in each chain) it is possible to generate ensemble of spin-chains, which is completely ergodic which is equivalent to full self-averaging of spin-chains' vector polarization. Distributions of different parameters (energy, average polarization by coordinates, and spin-spin interaction constant) of unperturbed system are calculated. In particular, analytically is proved and numerically is shown, that for the Heisenberg nearest-neighboring Hamiltonian model, the distribution of spin-spin interaction constants as opposed to widely used Gauss-Edwards-Anderson distribution satisfies Levy alpha-stable distribution law. This distribution is nonanalytic function and does not have variance. In the work we have in detail studied critical properties of an ensemble depending on value of external field parameters (from amplitude and frequency) and have shown that even at weak external fields the spin-glass systemis strongly frustrated. It is shown that frustrations have fractal behavior, they are selfsimilar and do not disappear at scale decreasing of area. By the numerical computation is shown that the average polarization of spin-glass on a different coordinates can have values which can lead to catastrophes in the equation ofClausius-Mossotti for dielectric constant. In other words, for some values of external field parameter, a critical phenomenon occurs in the system which is impossible to describe by the real-valued Heisenberg spin-glass Hamiltonian. For the solution of this problem at first the complex-valued disordered Hamiltonian is used. Physically this type of extension of Hamiltonian allows to consider relaxation effects which occur in the system under the influence of an external field. On the basis of developed approach an effective parallel algorithm is developed for simulation of statistic parameters of spin-glass system under the influence of an external field.

74 ATOMIC AND MOLECULAR PHYSICS↗

When less is more: How increasing the complexity of machine learning strategies for geothermal energy assessments may not lead toward better estimates

Previous moderate- and high-temperature geothermal resource assessments of the western United States utilized data-driven methods and expert decisions to estimate resource favorability. Although expert decisions can add confidence to the modeling process by ensuring reasonable models are employed, expert decisions also introduce human and, thereby, model bias. This bias can present a source of error that reduces the predictive performance of the models and confidence in the resulting resource estimates. Our study aims to develop robust data-driven methods with the goals of reducing bias and improving predictive ability. We present and compare nine favorability maps for geothermal resources in the western United States using data from the U.S. Geological Survey's 2008 geothermal resource assessment. Two favorability maps are created using the expert decision-dependent methods from the 2008 assessment (i.e., weight-of-evidence and logistic regression). With the same data, we then create six different favorability maps using logistic regression (without underlying expert decisions), XGBoost, and support-vector machines paired with two training strategies. The training strategies are customized to address the inherent challenges of applying machine learning to the geothermal training data, which have no negative examples and severe class imbalance. We also create another favorability map using an artificial neural network. We demonstrate that modern machine learning approaches can improve upon systems built with expert decisions. We also find that XGBoost, a non-linear algorithm, produces greater agreement with the 2008 results than linear logistic regression without expert decisions, because the expert decisions in the 2008 assessment rendered the otherwise linear approaches non-linear despite the fact that the 2008 assessment used only linear methods. The F1 scores for all approaches appear low (F1 score < 0.10), do not improve with increasing model complexity, and, therefore, indicate the fundamental limitations of the input features (i.e., training data). Until improved feature data are incorporated into the assessment process, simple non-linear algorithms (e.g., XGBoost) perform equally well or better than more complex methods (e.g., artificial neural networks) and remain easier to interpret.

15 GEOTHERMAL ENERGY↗

Real-time chiral dynamics at finite temperature from quantum simulation

In this study, we explore the real-time dynamics of the chiral magnetic effect (CME) at a finite temperature in the (1+1)-dimensional QED, the massive Schwinger model. By introducing a chiral chemical potential μ 5 through a quench process, we drive the system out of equilibrium and analyze the induced vector currents and their evolution over time. The Hamiltonian is modified to include the time-dependent chiral chemical potential, thus allowing the investigation of the CME within a quantum computing framework. We employ the quantum imaginary time evolution (QITE) algorithm to study the thermal states, and utilize the Suzuki-Trotter decomposition for the real-time evolution. This study provides insights into the quantum simulation capabilities for modeling the CME and offers a pathway for studying chiral dynamics in low-dimensional quantum field theories.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

End-To-End Decentralized Transmission Line Protection in IBR-Dominated Weak Grids Using Interpretable Data-Driven Methods

Traditional transmission line protection relies on predictable synchronous-based fault signatures, which frequently fail under the non-standard, current-limited fault characteristics of Inverter-Based Resources (IBRs). This study investigates how to achieve secure, communication-free fault isolation in IBR-dominated weak grids without relying on opaque, computationally heavy "black-box" machine learning algorithms. To address this, we propose a novel, standalone, and inherently interpretable data-driven protection framework. Unlike centralized methods requiring multi-terminal communication, this decentralized approach relies solely on local measurements using a hierarchical linear-kernel Support Vector Machine (SVM). The methodology decomposes the protection task into four sequential stages that mimic traditional protection elements: fault detection and fault direction identification, fault type classification, zone classification, and location estimation. This multi-stage architecture allows for specialized feature engineering at each stage, combining high computational efficiency with logic traceability. The framework's end-to-end performance was validated via C-code and PSCAD/EMTDC co-simulation, utilizing a real-world utility network and an OEM black-box IBR model. The proposed relay achieves 97.2% overall accuracy and provides a reliable trip decision within a 2.5-cycle window. The results confirm 100% accuracy in fundamental fault detection, reliable zone selectivity across low to moderate fault resistances, and robust security against non-fault transients, proving its immediate viability for integration into commercial numerical relays.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Single-energy computed tomography-based pulmonary perfusion imaging: Proof-of-principle in a canine model

Purpose: Radiotherapy (RT) that selectively avoids irradiating highly functional lung regions may reduce pulmonary toxicity, which is substantial in lung cancer RT. Single-energy computed tomography (CT) pulmonary perfusion imaging has several advantages (e.g., higher resolution) over other modalities and has great potential for widespread clinical implementation, particularly in RT. The purpose of this study was to establish proof-of-principle for single-energy CT perfusion imaging. Methods: Single-energy CT perfusion imaging is based on the following: (1) acquisition of end-inspiratory breath-hold CT scans before and after intravenous injection of iodinated contrast agents, (2) deformable image registration (DIR) for spatial mapping of those two CT image data sets, and (3) subtraction of the precontrast image data set from the postcontrast image data set, yielding a map of regional Hounsfield unit (HU) enhancement, a surrogate for regional perfusion. In a protocol approved by the institutional animal care and use committee, the authors acquired CT scans in the prone position for a total of 14 anesthetized canines (seven canines with normal lungs and seven canines with diseased lungs). The elastix algorithm was used for DIR. The accuracy of DIR was evaluated based on the target registration error (TRE) of 50 anatomic pulmonary landmarks per subject for 10 randomly selected subjects as well as on singularities (i.e., regions where the displacement vector field is not bijective). Prior to perfusion computation, HUs of the precontrast end-inspiratory image were corrected for variation in the lung inflation level between the precontrast and postcontrast end-inspiratory CT scans, using a model built from two additional precontrast CT scans at end-expiration and midinspiration. The authors also assessed spatial heterogeneity and gravitationally directed gradients of regional perfusion for normal lung subjects and diseased lung subjects using a two-sample two-tailed t-test. Results: The mean TRE (and standard deviation) was 0.6 ± 0.7 mm (smaller than the voxel dimension) for DIR between pre contrast and postcontrast end-inspiratory CT image data sets. No singularities were observed in the displacement vector fields. The mean HU enhancement (and standard deviation) was 37.3 ± 10.5 HU for normal lung subjects and 30.7 ± 13.5 HU for diseased lung subjects. Spatial heterogeneity of regional perfusion was found to be higher for diseased lung subjects than for normal lung subjects, i.e., a mean coefficient of variation of 2.06 vs 1.59 (p = 0.07). The average gravitationally directed gradient was strong and significant (R{sup 2} = 0.99, p < 0.01) for normal lung dogs, whereas it was moderate and nonsignificant (R{sup 2} = 0.61, p = 0.12) for diseased lung dogs. Conclusions: This canine study demonstrated the accuracy of DIR with subvoxel TREs on average, higher spatial heterogeneity of regional perfusion for diseased lung subjects than for normal lung subjects, and a strong gravitationally directed gradient for normal lung subjects, providing proof-of-principle for single-energy CT pulmonary perfusion imaging. Further studies such as comparison with other perfusion imaging modalities will be necessary to validate the physiological significance.

60 APPLIED LIFE SCIENCES↗

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗

kynema-fmb [SWR-23-07]

Kynema-FMB (FKA: Kynema) is an open-source performance portable flexible multibody (FMB) dynamics solver designed for time-domain simulations. While originally tailored for wind turbine structural dynamics, the formulation and implementation are those of a general flexible-multidbody dynamics solver that can readily be applied to a wide range of systems. Kynema was designed with a narrow focus, namely to provide a lightweight, fast, accurate FMD solver for coupling to computational-fluid-dynamics (CFD) codes, especially the CFD codes in the Kynema suite, for fluid-structure-interaction (FSI) simulations. Kynema-FMB is equipped to model systems that can be represented as a collection of beams and rigid bodies that are connected through constraints. Degrees of freedom are defined in the inertial/global frame of reference and include displacements and rotations (formally as rotation matrices, but stored as quaternions). The underlying formulation is built on a Lie-group time integrator designed for index-3 differential-algebraic equations, which is second-order accurate in time (Bruls et al., 2012). Beam models are based on geometrically exact beam theory and are discretized as high-order spectral finite elements similar to those in BeamDyn (Wang et al., 2017). The governing equations for a FMD system like a wind turbine constitute a highly nonlinear system of constrained partial-differential equations. Kynema-FMB uses analytical Jacobians in the nonlinear-system solves in each time step. Linear systems use sparse storage and several third-party sparse-linear-system solvers are enabled. Ill conditioning of linear systems is mitigated with preconditioning described in Bottasso et al, 2008. Kynema-FMB is integrated with a simple open-source controller (ROSCO). There is an application programming interface (API) for coupling to geometry-resolved CFD (like that in Sharma et al., 2023) and actuator-force CFD (like that in Kuhn et al., 2025). In the latter, for actuator-line models, Kynema-FMB includes an internal blade-element solver that depends on user-provided lookup tables for coefficients of lift and drag, i.e., aerodynamic polars. Kynema-FMB is written in C++ and leverages Kokkos and Kokkos-Kernels (KokkosEcosystem) as its performance portability layer enabling simulations on both CPU and GPU systems. The repository is equipped with extensive automated testing at the unit and regression/system levels. The following describes the high-level development objectives conceived for Kynema: *Kynema will follow modern software development best practices, including test-driven development (TDD), version control, hierarchical automated testing, and continuous integration (CI) for a robust development environment. *The core data structures are memory efficient and enable vectorization and parallelization at multiple levels. *Data structures are data-oriented to exploit methods for accelerated computing including high utilization of chip resources (e.g., single instruction multiple data (SIMD) instruction sets) and parallelization using GP-GPUs. *The computational algorithms incorporate robust open-source libraries for mathematical operations, resource allocation, and data management. *The API design considers multiple stakeholder needs and ensure integration with existing and future ecosystems for data science, machine learning, and AI. *Kynema-FMB is written in modern C++ and leverages Kokkos as its performance-portability library with inspiration from the kynema stack.

Sprague, MichaelA.↗

Advancing the central role of non-model biorepositories in predictive modeling of emerging pathogens

The COVID-19 pandemic demonstrated the insufficiency of a reactive approach to emerging zoonotic pathogens. With spillover increasing in frequency as environments change and the human footprint continues to grow, pandemic prevention will require predictive models that can identify (i) potential zoonoses with a high likelihood of emergence and (ii) environmental or other features that may trigger a shift in host, vector, or pathogen baselines associated with emergence and/or spillover. Artificial intelligence (AI), and particularly its machine learning and deep learning branches, holds enormous potential for detecting shifts in large-scale biodiversity and disease datasets (genomic, ecological, geospatial, etc.). Such algorithms can be trained to identify subtle patterns in large volumes of data to yield insights into complex phenomena for which we have limited knowledge of the true cause(s) or predictor(s), as is the case for emerging infectious diseases.

59 BASIC BIOLOGICAL SCIENCES↗

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗

Failure Impact Analysis of Key Management in AMI Using Cybernomic Situational Assessment (CSA)

In earlier work, we presented a computational framework for quantifying the security of a system in terms of the average loss a stakeholder stands to sustain as a result of threats to the system. We named this system, the Cyberspace Security Econometrics System (CSES). In this paper, we refine the framework and apply it to cryptographic key management within the Advanced Metering Infrastructure (AMI) as an example. The stakeholders, requirements, components, and threats are determined. We then populate the matrices with justified values by addressing the AMI at a higher level, rather than trying to consider every piece of hardware and software involved. We accomplish this task by leveraging the recently established NISTR 7628 guideline for smart grid security. This allowed us to choose the stakeholders, requirements, components, and threats realistically. We reviewed the literature and selected an industry technical working group to select three representative threats from a collection of 29 threats. From this subset, we populate the stakes, dependency, and impact matrices, and the threat vector with realistic numbers. Each Stakeholder s Mean Failure Cost is then computed.

Algorithms↗

SHAD: the Scalable High-performance Algorithms and Data-structures Library

The unprecedented amount of data that needs to be processed in emerging data analytics applications poses novel challenges to industry and academia. Scalability and high performance become more than a desirable feature because, due to the scale and the nature of the problems, they draw the line between what is achievable and what is unfeasible. In this paper, we propose SHAD, the Scalable High-performance Algorithms and Data-structures library. SHAD adopts a modular design that confines low level details and promotes reuse. SHAD's core is built on an Abstract Runtime Interface which enhances portability and identifies the minimal set of features of the underlying system required by the framework. The core library includes common data-structures such as: Array, Vector, Map and Set. These are designed to accommodate significant amount of data which can be accessed in massively parallel environments, and used as building blocks for SHAD extensions, i.e. higher level software libraries. We have validated and evaluated our design with a performance and scalability study of the core components of the library. We have validated the design flexibility by proposing a Graph Library as an example of SHAD extension, which implements two different graph data-structures; we evaluate their performance with a set of graph applications. Experimental results show that the approach is promising in terms of both performance and scalability. On a distributed system with 320 cores, SHAD Arrays are able to sustain a throughput of 65 billion operations per second, while SHAD Maps sustain 1 billion of operations per second. Algorithms implemented using the Graph Library exhibit performance and scalability comparable to a custom solution, but with smaller development effort.

Castellana, Vito G.↗

Integration and Optimization of a Waste Heat Driven Organic Rankine Cycle for Power Generation in Wastewater Treatment Plants

The study focuses on achieving energy self-sufficiency in Wastewater Treatment Plants by proposing a comprehensive model for integrating, sizing, and optimizing an Organic Rankine Cycle system. The Organic Rankine Cycle system is designed to utilize waste heat from the gensets at As Samra Wastewater Treatment Plant in Jordan, where it will contribute to the overall electrical energy supply of the plant. Real data from As Samra Wastewater Treatment Plant is used to model and calculate the available waste heat using TRNSYS® software. The Organic Rankine Cycle model is then developed using ASPEN PLUS® software to explore the impact of operational parameters and determine their optimal values for maximizing the plant's energy profile. An economic analysis is conducted to assess the feasibility of the proposed model, considering system components, installation, operation, and maintenance costs. To optimize the Organic Rankine Cycle system, the study employs the Multi-Output Support Vector Regression technique to capture nonlinear relationships between independent variables (fluid type, turbine inlet pressure, turbine inlet temperature, turbine outlet pressure, and mass flow rate) and dependent variables (pump power input, waste heat input, and turbine specific work). The Osprey optimization algorithm is used to address the multi-objective optimization problem, with the proposed Pareto-based Osprey Optimization Algorithm and the Multi-Objective Particle Swarm Optimization technique being employed to evaluate critical performance and economic parameters such as system thermal efficiency, net power output, and the levelized cost of electricity. The results of the optimization strategies indicate that the M-SVR model's prediction accuracy is significantly improved after parameter optimization, with the model returning high R 2 and low Mean Square Error values of 0.991 and 0.00216, respectively. The Pareto-Based Osprey Optimization Algorithm optimizer identifies the best working fluid as Isobutane/Isopentane in a ratio of 66:34, with optimal turbine inlet pressure and temperature of 15 bars and 218 °C, respectively. In conclusion, the Organic Rankine Cycle model at these optimal conditions achieves a cycle efficiency of 19.93% and an Levelized Cost of Electricity value of 0.0353 USD/kWh.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Detecting damage in composites using volume decomposition analysis of tomographic data

Detection of damage in a single tow ceramic matrix composite specimen has been achieved using orthogonal decomposition of volumetric tomographic datasets collected at four tensile loads. This decomposition approach has been applied at two different length scales: (i) individual fibres and (ii) bulk volumes containing fibres and matrix material. Volumes were first decomposed to feature vectors, orders of magnitude smaller than the original volume they describe, and then comparisons between datasets at different load levels were made in feature vector space. The results show quantitative measurements of damage location, damage morphology and the relative growth of this damage with increased load when compared with a dataset with less or no damage. No prior knowledge of the dataset or training of algorithms is required for damage to be detected, it is only necessary that at least two datasets are available for comparison, e.g. from in situ or repeated scanning measurements. Results are generated on significantly shorter timescales when compared with previous automated approaches to tomography data processing. This approach has the potential to be applied to damage detection in a range of materials through comparisons of volumetric datasets from a range of measurement or computational techniques.

Middleton, Ceri A.↗

Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting

This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.

97 MATHEMATICS AND COMPUTING↗