Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convergence analysis”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

IDAES-PSE 2.4.0 Release

The Institute for the Design of Advanced Energy Systems (IDAES) Integrated Platform is a versatile computational environment offering extensive process systems engineering (PSE) capabilities for optimizing the design and operation of complex, interacting technologies and systems. IDAES enables users to efficiently search vast, complex design spaces to discover the lowest cost, most environmentally sustainable solutions while supporting the full process modeling lifecycle, from conceptual design to dynamic optimization and control. The extensible, open platform empowers users to create models of novel processes and rapidly develop custom analyses, workflows, and end-user applications.. Deprecations • Convergence Analysis tool (idaes/core/util/convergence): deprecated in favor of new Parameter Sweep tools. To be removed in v3.0.0. New Beta Capabilities • Parameter Sweep Tool (idaes.core.util.parameter_sweep) o A new API for defining and performing parameter sweep studies on IDAES models has been developed • Diagnostics Tools (idaes.core.util.model_diagnostics) o New methods for identifying duplicate variables and constraints have been added to the diagnostics toolbox o New tools for detecting ill conditioning in Jacobians have been developed and are available in the model_diagnostics module. These provide alternatives to the existing DegeneracyHunter toolbox, and will eventually be merged with this capability, but initial working versions have been provided as beta capabilities for interested users o IpoptConvergenceAnalysis (replaces deprecated Convergence Analysis tool):  A new tool for performing convergence analysis studies that leverages the new Parameter Sweep tools has been developed. This tool allows users to define the input parameters to their model and sampling methods for these (leveraging Pysmo's sampling tools) and to then solve their model across the sampled domains and return a summary of the solver performance (IPOPT only) Improved Models • Thickener model (idaes.models.unit_models.solid_liquid.thickener) o Improved model to include predictive correlations for unit sizing based on settling velocity measurements (steady-state only) • Modular Property Packages o Added general support for calculating critical properties of mixtures using defined Equation of State modules. New API defined for Equation of State modules in order to define the necessary constraints for calculating critical properties (most EoS modules DO NOT support calculation of critical properties (yet)) o Added new methods to Cubic Equation of State module to support calculation of critical properties

DiagnosticsToolbox↗
NASA NTRS2018

The Convergence of Analysis Produced by Overlapping Assimilation Streams

When conducting a reanalysis for a long period, it is common to do so using multiple, parallel computational schemes. A period of overlap is included to foster continuity between successive streams. At the GMAO, the overlap period is one year. By the end of that period, the time mean anlysis for corresponding overlapped months are almost identical, as desired. The variances of differences at corresponding analysis times within each month, however, do not converge to zero. Instead their monthly variances converge to values that are a significant fraction of the the estimated variances of analysis errors. This occurs although the overlapping streams use the same observations, assimilation model, and assimilation algorithm, differing only in the background applied information applied at the beginning of the overlap period.

Errico, Ronald M.↗
DOE OSTI2018

On the convergence and convergence order of finite volume gradient schemes for oblique derivative boundary value problems

This work is an improvement of the previous note (Bradji in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) which dealt with the convergence analysis of a finite volume scheme for the Poisson’s equation with a linear oblique derivative boundary condition. The formulation of the finite volume scheme given in Bradji (in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) involves the discrete gradient introduced recently in Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010). In this paper, we consider the convergence analysis of finite volume schemes involving the discrete gradient of Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010) for elliptic and parabolic equations with linear oblique derivative boundary conditions. Linear oblique derivative boundary conditions arise for instance in the study of the motion of water in a canal, cf. Lesnic (Commun Numer Methods Eng 23(12):1071–1080, 2007). We derive error estimates in several norms which allow us to get error estimates for the approximations of the exact solutions and its first derivatives. In particular, we provide an error estimate between the gradient of the exact solutions and the discrete gradient of the approximate solutions. Convergence of the family of finite volume approximate solutions towards the exact solution under weak regularity assumption is also investigated. In the case of parabolic equations with oblique derivative boundary conditions, we develop a new discrete a priori estimate result. The proof of this result is based on the use of a discrete mean Poincaré–Wirtinger inequality. Thanks to the stated a priori estimate and to a comparison with an appropriately chosen auxiliary finite volume scheme, we derive the convergence results. This work can be viewed as a continuation of the previous work (Bradji and Gallouët in Int J Finite Vol 3(2):1–35, 2006) where a convergence analysis for a finite volume scheme, based on the admissible mesh of Eymard et al. (In: Ciarlet and Lions, Handbook of numerical analysis, North-Holland, Amsterdam, 2000), for the Poisson’s equation with a linear oblique derivative boundary conditions is given. The obtained convergence results do not require any relation between the mesh sizes of the spatial and time discretizations. Some numerical tests are presented for both elliptic and parabolic equations. In particular, we present three methods to compute the discrete solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A convex pseudolikelihood framework for high dimensional partial correlation estimation with convergence guarantees

Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l1-penalties to either parametric likelihoods, or regularized regression/pseudolikelihoods, with the latter having the distinct advantage that they do not explicitly assume Gaussianity. As none of the popular methods proposed for solving pseudolikelihood-based objective functions have provable convergence guarantees, it is not clear whether corresponding estimators exist or are even computable, or if they actually yield correct partial correlation graphs. We propose a new pseudolikelihood-based graphical model selection method that aims to overcome some of the shortcomings of current methods, but at the same time retain all their respective strengths. In particular, we introduce a novel framework that leads to a convex formulation of the partial covariance regression graph problem, resulting in an objective function comprised of quadratic forms. The objective is then optimized via a coordinate wise approach. The specific functional form of the objective function facilitates rigorous convergence analysis leading to convergence guarantees; an important property that cannot be established by using standard results, when the dimension is larger than the sample size, as is often the case in high dimensional applications. These convergence guarantees ensure that estimators are well defined under very general conditions and are always computable. In addition, the approach yields estimators that have good large sample properties and also respect symmetry. Furthermore, application to simulated and real data, timing comparisons and numerical convergence is demonstrated. We also present a novel unifying framework that places all graphical pseudolikelihood methods as special cases of a more general formulation, leading to important insights.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A nonsmooth nonconvex optimization algorithm for two-stage optimization problems

An optimization algorithm for a group of nonsmooth nonconvex problems inspired by two-stage stochastic programming problems is proposed. The main challenges for these problems include (1) the problems lack the popular lower-type properties such as prox-regularity assumed in many nonsmooth nonconvex optimization algorithms, (2) the objective can not be analytically expressed and (3) the evaluation of function values and subgradients are computationally expensive. To address these challenges, this report first examines the properties that exist in many two-stage problems, specifically upper-C 2 objectives. Then, we show that quadratic penalty method for securityconstrained alternating current optimal power flow (SCACOPF) contingency problems can make the contingency solution functions upper-C 2 . Based on these observations, a simplified bundle algorithm that bears similarity to sequential quadratic programming (SQP) method is proposed. It is more efficient in implementation and computation compared to conventional bundle methods. Global convergence analysis of the algorithm is presented under novel and reasonable assumptions. The proposed algorithm therefore fills the gap of theoretical convergence for smoothed SCACOPF problems. The inconsistency that might arise in our treatment of the constraints are addressed through a penalty algorithm whose convergence analysis is also provided. Finally, theoretical capabilities and numerical performance of the algorithm are demonstrated through numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Verification of the Coupled Fluid/Solid Transfer in a CASL Grid-to-Rod-Fretting Simulation: A Technical Brief on the Analysis of Convergence Behavior and Demonstration of Software Tools for Verification

For a CASL grid-to-rod fretting problem, Sandia's Percept software was used in conjunction with the Sierra Mechanics suite to analyze the convergence behavior of the data transfer from a fluid simulation to a solid mechanics simulation. An analytic function, with properties relatively close to numerically computed fluid approximations, was chosen to represent the pressure solution in the fluid domain. The analytic pressure was interpolated on a sequence of grids on the fluid domain, and transferred onto a separate sequence of grids in the solid domain. The error in the resulting pressure in the solid domain was measured with respect to the analytic pressure. The error in pressure approached zero as both the fluid and solids meshes were refined. The convergence of the transfer algorithm was limited by whether the source grid resolution was the same or finer than the target grid resolution. In addition, using a feature coverage analysis, we found gaps in the solid mechanics code verification test suite directly relevant to the prototype CASL GTRF simulations.

99 GENERAL AND MISCELLANEOUS↗
NASA NTRS1984

Numerical modeling of D-mappings with applications to chemical kinetics

Numerical modeling of D-mappings was studied and applied to solving nonlinear stiff systems. These mappings were locally linearized for convergence analysis, and some applications were made to chemical kinetics. The technique avoids using multistep implicit codes that require inversion of Jacobian matrices, but depends on the Jacobians for its convergence analysis.

Dey, S. K.↗
DOE OSTI2021

Examination of probability distribution of mixture fraction in LES/FDF modelling of a turbulent partially premixed jet flame

An accurate prediction of the probability density function (PDF) of the mixture fraction is crucial to the prediction of combustion since mixing plays an important role in turbulent non-premixed and partially premixed flames. This work provides an assessment of the large-eddy simulation (LES)/filtered density function (FDF) method for the prediction of the PDF of the mixture fraction. The advantage of the LES/FDF method is that it provides the full predictions of the statistical distribution of scalars including the mixture fraction. The predictive accuracy of the method for the PDF is yet to be fully validated. Assessing the prediction of the PDF of the mixture fraction, a conserved scalar, is an important starting point. The Sydney/Sandia inhomogeneous inlet jet flame is used as a test case. A quick comparison shows that the LES/FDF predicted PDF shapes of the mixture fraction deviate significantly from the commonly presumed Beta-PDF as well as from the experimental data in the flame. Here, to examine the source of the discrepancy, we clarify the different PDF definitions used in the comparison among the predictions, measurements, and the presumed shape PDFs. The discrepancy observed from the comparison is largely reconciled by clarifying the difference between the PDFs that are examined. The PDF of the resolved mixture fraction is shown to be close to the Beta-PDF in both the measurements and predictions, while the PDF directly deduced from the LES/FDF particles deviates significantly from the Beta-PDF. A multimodal PDF analysis and a pseudo convergence analysis are conducted to provide plausible evidence to support the predicted multimodal PDF shapes. The sub-filter scale FDF is shown to be close to the Beta-PDF too through the construction of a synthesized PDF, which supports the common presumed Beta-PDF assumption used in the presumed PDF methods when combined with LES.

42 ENGINEERING↗
NASA NTRS1979

Convergent perturbation analysis of intense coherent multiphoton interactions

Use has been made of flow graphs to deduce Feenberg perturbation expansions for radiative interactions. It is demonstrated that these expansions can in certain cases be summed to provide closed form expressions for the molecular response. In particular, it is shown that the coherent state response can be obtained by the summation of a continued fraction perturbation expansion for the harmonic oscillator. Anharmonicity in the lower levels is treated and its shown to introduce Rabi flopping identifiable with multiphoton transitions among isolated tightly coupled subsystems of levels. Relevance to laser induced multiphoton excitation and energy level shift calculations in the presence of a strong field are also discussed.

Gower, M. C.↗
NASA NTRS1991

Analysis and convergence of the MAC scheme. Part 1: The linear problem

The MAC discretization of fluid flow is analyzed for the stationary Stokes equations. It is proved that the discrete approximations do in fact converge to the exact solutions of the flow equations. Estimates using mesh dependent norms analogous to the standard H(sup 1) and L(sup 2) norms are given for the velocity and pressure, respectively.

Nicolaides, R. A.↗
DOE OSTI2025

Conditional Pseudo-Reversible Normalizing Flow for Surrogate Modeling in Quantifying Uncertainty Propagation

We introduce a conditional pseudo-reversible normalizing flow (PR-NF) that directly learns conditional probability distributions from noisy physical models to efficiently quantify both forward and inverse uncertainty propagation. Traditional surrogate modeling approaches approximate only the deterministic component of physical models, requiring separate noise characterization and computationally expensive sampling methods for inverse problems. Here, in this work, we develop the conditional PR-NF model to directly learn and efficiently generate samples from the conditional probability density functions (PDFs). The training process utilizes dataset consisting of input-output pairs without requiring prior knowledge about the noise and the function. Once trained, our model efficiently generates samples from conditional PDFs for any input within the training domain. Moreover, the pseudo-reversibility feature allows for the use of fully connected neural network architectures, which simplifies the implementation and enables theoretical analysis. We provide a rigorous convergence analysis of the conditional PR-NF model, showing its ability to converge to the target conditional PDF using the Kullback−Leibler divergence. To demonstrate the effectiveness of our method, we apply it to several benchmark tests and a real-world geologic carbon storage problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Multirate Exponential Rosenbrock Methods

In this paper we propose a novel class of methods for high-order accurate integration of multirate systems of ordinary differential equation initial-value problems. The proposed methods construct multirate schemes by approximating the action of matrix φ functions within explicit exponential Rosenbrock (ExpRB) methods, thereby called multirate ExpRB (MERB) methods. They consist of the solution to a sequence of modified “fast” initial-value problems, which may themselves be approximated through subcycling any desired initial-value problem solver. In addition to proving how to construct MERB methods from certain classes of ExpRB methods, we provide rigorous convergence analysis of these methods and derive efficient MERB schemes of orders 2 through 6 (the highest-order infinitesimal multirate methods to date). Lastly, we then present numerical simulations to confirm these theoretical convergence rates and to compare the efficiency of MERB methods against other recently introduced high-order multirate methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Assessing convergence in global sensitivity analysis: a review of methods for assessing and monitoring convergence

In global sensitivity analysis (GSA) of a model, a proper convergence analysis of metrics is essential for ensuring a level of confidence or trustworthiness in sensitivity results obtained, yet is somewhat deficient in practice. The level of confidence in sensitivity measures, particularly in relation to their influence and support for decisions from scientific, social and policy perspectives, is heavily reliant on the convergence of GSA. We review the literature and summarize the available methods for monitoring and assessing convergence of sensitivity measures based on application purposes. The aim is to expose the various choices for convergence assessment and encourage further testing of available methods to clarify their level of robustness. Furthermore, the review identifies a pressing need for comparative studies on convergence assessment methods to establish a clear hierarchy of effectiveness and encourages the adoption of systematic approaches for enhanced robustness in sensitivity analysis.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

A Legendre spectral quadrature tau method for the multi-term time-fractional diffusion equations

In this study, a Legendre spectral tau method is revisited to handle the multi-term time-fractional diffusion equations (MTT-FDEs). An error estimate and rigorous convergence analysis are carried out using some critical theorems. The applicability and accuracy of the solution method are demonstrated by a numerical example to verify the theoretical analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Summary of Results for Converging Shock Wave Problems

The purpose of this note is to provide a brief overview of an attempt to simulate a Guderley-like imploding shock problem in xRAGE. Prior to this study, the following have been completed with respect to the Guderley problem itself: A canonical definition for use with ASC codes has been proposed (LA-UR-11-02765); 1D simulations with spherical symmetry on uniform grids have been performed, with associated spatial convergence analysis. The xRAGE code showed near 1st order convergence for this problem in the initial studies (LA-UR-10-06435); A version of the Guderley problem as been added to the xRAGE regression test suite. More recently, a large number of simulations have been performed for the Guderley problem (and a similar problem) using xRAGE’s (v. 1009.02) AMR capability.

Mathematics & Computing(97)↗
DOE OSTI2025

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1983

Acceleration of convergence of vector sequences

A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iteratively. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.

Sidi, A.↗