Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “general linear methods”

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

Underlying one-step methods and nonautonomous stability of general linear methods

We generalize the theory of underlying one-step methods to strictly stable general linear methods (GLMs) solving nonautonomous ordinary differential equations (ODEs) that satisfy a global Lipschitz condition. Here, we combine this theory with the Lyapunov and Sacker-Sell spectral stability theory for one-step methods developed in [34,35,36] to analyze the stability of a strictly stable GLM solving a nonautonomous linear ODE. These results are applied to develop a stability diagnostic for the solution of nonautonomous linear ODEs by strictly stable GLMs.

97 MATHEMATICS AND COMPUTING↗

Optimal explicit strong-stability-preserving general linear methods.

This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods generalize both Runge-Kutta (RK) and linear multistep schemes. They have high stage orders and hence are less susceptible than RK methods to order reduction from source terms or nonhomogeneous boundary conditions. A global optimization strategy is used to find the most efficient schemes that have low storage requirements. Numerical results illustrate the theoretical findings.

97 MATHEMATICS AND COMPUTING↗

A review of high order strong stability preserving two-derivative explicit, implicit, and IMEX methods

High order strong stability preserving time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs in a wide variety of application areas including fluid dynamics, magnetohydrodynamics, semiconductor devices, electromagnetics, and astrophysics. Over the past decade multiderivative time-stepping have been increasingly used for the time-evolution hyperbolic PDEs, so that the strong stability properties of these methods have become important. In this work we review sufficient conditions for a two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and different conditions on the second derivative. In particular we present the strong stability preserving theory for explicit and implicit two-derivative Runge–Kutta schemes, including a special condition on the second derivative under which these implicit methods may be unconditionally strong stability preserving. This special condition is natural for the stiff component of wide range of plasma physics problems, and can be useful in the context of strong stability preserving implicit-explicit multi-derivative Runge–Kutta schemes, where the time-step restriction is then independent of the stiff term. Lastly, we present the strong stability preserving theory for implicit-explicit multi-derivative general linear methods, and some novel second and third order methods where the time-step restriction is independent of the stiff term.

97 MATHEMATICS AND COMPUTING↗

Generalized Jacobi method for linear bounded operators system

In this paper, we construct a generalization of the Jacobi iterative method adapted to a system of linear bounded operators. This new method is used with product integration method to solve a linear Fredholm integral equation of the second kind with a weakly singular kernel. The convergence analysis is proved. The numerical tests developed show its effectiveness.

97 MATHEMATICS AND COMPUTING↗

Efficient second derivative methods with extended stability regions for non-stiff IVPs

We describe the construction of explicit Nordsieck sequential second derivative general linear methods with a large region of absolute stability. The constructed methods are of order p=q=s, where q and s are the stage order and the number of internal stages, respectively. To compare, we also construct methods in this class which possess Runge–Kutta stability property. Implementation of the constructed methods in a variable stepsize mode is discussed and efficiency of these methods is verified by some numerical experiments in fixed and variable stepsize environment.

97 MATHEMATICS AND COMPUTING↗

Construction of the Nordsieck second derivative methods with RK stability for stiff ODEs

In this paper, we study the construction and implementation of special Nordsieck second derivative general linear methods of order p and stage order q=p in which the number of input and output values is r=p rather than r=p+1. We will construct A- and L-stable methods of orders three and four in this form with Runge–Kutta stability properties. The efficiency of the constructed methods and reliability of the proposed error estimates are shown by implementing of the methods in a variable stepsize environment on some well-known stiff problems.

97 MATHEMATICS AND COMPUTING↗

Generalizing global error estimation for ordinary differential equations by using coupled time-stepping methods

Here, this study introduces new time-stepping strategies with built-in global error estimators. The new methods propagate the defect along with the numerical solution much like solving for the correction or Zadunaisky’s procedure; however, the proposed approach allows for overlapped internal computations and, therefore, represents a generalization of the classical numerical schemes for solving differential equations with global error estimation. The resulting algorithms can be effectively represented as general linear methods. Finally, several explicit self-starting schemes akin to Runge–Kutta methods with global error estimation are introduced, and the theoretical considerations are illustrated in several examples.

97 MATHEMATICS AND COMPUTING↗

Association between radiation, glaucoma subtype, and retinal vessel diameter in atomic bomb survivors

We examined the relationship between glaucoma subtype and retinal vascular caliber as markers of ocular circulation. Subjects were Japanese atomic bomb survivors in Hiroshima and Nagasaki. After a screening examination, potential cases were subjected to further defnitive examination. The diameters of central retinal artery and vein equivalents (CRAE and CRVE) on digitized retinal photographs were measured using an established method. Generalized linear regression analyses were used to examine the associations among vessel diameters, radiation exposure, and prevalence of glaucoma subtypes among the study subjects. We identifed 196 cases of glaucoma (12%) based on optic disc appearance, perimetry results, and other ocular fndings. The main subtypes were primary angle-closure glaucoma, primary open-angle glaucoma and normal-tension glaucoma (NTG). NTG was the dominant subtype (78%). NTG was negatively associated with CRAE and CRVE, and positively associated with radiation dose. CRVE was negatively associated with radiation dose and the association was unclear for CRAE. The smaller retinal vessel caliber in NTG patients than in subjects without glaucoma may indicate an association between ocular blood fow and the pathogenesis of NTG. However, signifcant relationships among vessel calibers, NTG and radiation exposure were not clear.

60 APPLIED LIFE SCIENCES↗

Bayesian Monte Carlo Evaluation of Imperfect (n, 233 U) Data and Model

Conventional nuclear data evaluation methods using generalized linear least squares make the following assumptions: prior and posterior probability distribution functions (PDFs) of all model parameters and data are normal (Gaussian); the linear approximation is sufficiently accurate to minimize the cost function (even for nonlinear models); the model (e.g., of neutron cross section) and experimental data (including covariance data) are without defect and prior PDFs of parameters and measured data are known perfectly. Neglect of covariance between model parameters and measured data in conventional evaluations contributes to imperfections. These assumptions are inherent to the generalized linear least squares minimization method commonly used for resolved resonance region neutron cross section evaluations but are often not justified due to the presence of non-normal PDFs, nonlinear models (e.g., R-matrix formalism), and inherent imperfections in data and models (e.g., imperfect covariance data). Here, these assumptions are removed in a mathematical framework of Bayes’ theorem, which is implemented using the Metropolis-Hastings Monte Carlo method. Most importantly, new parameters are introduced to parameterize discrepancies between the theoretical model and measured data to quantify judgement about discrepancies or imperfections in a reproducible manner. An evaluation of 233U in the eV region using the ENDF-B/VIII.0 library and transmission data (Guber et al.) is presented, and posterior parameters are compared to those obtained by conventional evaluation methods. This example illustrates the effects of removing the most harmful assumption: that of model-data perfection.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Generalized trigonometric Fourier-series method with automatic time step control for non-linear point kinetics equations

The trigonometric Fourier-series method (TFS) is generalized to provide approximate solutions for non-linear point kinetics equations with feedback using varying step sizes. This method can provide a very stable solution against the size of the discrete time step allowing much larger step sizes to be used. Systems of the point kinetics equations are solved using Fourier-series expansion over a partition of the total time interval. The approximate solution requires determining the series coefficients over each time step in that partition. These coefficients are determined using the high-order derivatives of the solution vector at the beginning of the time step introducing a system of linear algebraic equations to be solved at each step. This system is similar to the Vandermonde system. Two successive orders of the partial sums are used to estimate the local truncation error. This error and some other constrains are used to produce the largest step size allowable at each step while keeping the error within a specific tolerance. The process of calculating suitable step sizes should be automatic and inexpensive. Convergence and stability of the proposed method are discussed and a new formula is introduced to maintain stability. The proposed method solves the general linear and non-linear kinetics problems. The method has been applied to five different types of reactivities including step/ramp insertions with temperature feedback. The method is seemed to be valid for larger time intervals than those used in the conventional numerical integration, and is thus useful in reducing computing time. Computational results are found to be consistent with the analysis, they demonstrate that the convergence of the iteration scheme can be accelerated and the resulting computing times can be greatly reduced while maintain computational accuracy.

97 MATHEMATICS AND COMPUTING↗

Advancing Inverse Sensitivity/Uncertainty Methods for Nuclear Fuel Cycle Applications

The inverse sensitivity/uncertainty quantification (IS/UQ) method has recently been implemented in the Inverse Sensitivity/UnceRtainty Estimator (INSURE) module of the AMPX cross section processing system [M.E. Dunn and N.M. Greene, “AMPX-2000: A Cross-Section Processing System for Generating Nuclear Data for Criticality Safety Applications,” Trans. Am. Nucl. Soc. 86, 118–119 (2002)]. The IS/UQ method aims to quantify and prioritize the cross section measurements along with uncertainties needed to yield a given nuclear application(s) target response uncertainty, and doing this at a minimum cost. Since in some cases the extant uncertainties of the differential cross section data are already near the limits of the present-day state-of-the-art measurements, requiring significantly smaller uncertainties may be unrealistic. Therefore, we have incorporated integral benchmark experiments (IBEs) data into the IS/UQ method using the generalized linear least-squares method, and have implemented it in the INSURE module. We show how the IS/UQ method could be applied to systematic and statistical uncertainties in a self-consistent way and how it could be used to optimize uncertainties of IBEs and differential cross section data simultaneously. We itemize contributions to the cost of differential data measurements needed to define a realistic cost function.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Advancing Inverse Sensitivity/Uncertainty Methods for Nuclear Fuel Cycle Applications

The inverse sensitivity/uncertainty quantification (IS/UQ) method has recently been implemented in the Inverse Sensitivity/UnceRtainty Estimiator (INSURE) module of the AMPX system [1]. The IS/UQ method aims to quantify and prioritize the cross section measurements along with uncertainties needed to yield a given nuclear application(s) target response uncertainty, and doing this at a minimum cost. Since in some cases the extant uncertainties of the differential cross section data are already near the limits of the present-day state-of-the-art measurements, requiring significantly smaller uncertainties may be unrealistic. Therefore we have incorporated integral benchmark experiments (IBEs) data into the IS/UQ method using the generalized linear least-squares method, and have implemented it in the INSURE module. We show how the IS/UQ method could be applied to systematic and statistical uncertainties in a self-consistent way. We show how the IS/UQ method could be used to optimize uncertainties of IBEs and differential cross section data simultaneously.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Analysis of overlapping count data

Counts of a specific characteristic were obtained within regions defined on an object that was manufactured in a proprietary setting. The count regions were altered during production and resulted in misaligned or overlapping count data. A closed-formula maximum likelihood estimator (MLE) of the new region means is derived using all of the available count data and an independent Poisson model. The MLE is shown to be preferable to estimators constructed using generalized linear models for the overlapping data setting. This closed-form estimator extends to over-dispersed overlapping count data as the quasi-MLE and also performs well with correlated overlapping count data. Standard errors for the estimator are approximated and are validated with a simulation study. Additionally, the methods are extended to overlapping multinomial data. Illustrative examples of the methods are provided throughout the paper and are reproducible with the supplemental R code. Additionally, proofs of the paper’s results are also included in the supplemental material.

97 MATHEMATICS AND COMPUTING↗

Additive Polynomial Time Integrators, Part I: Framework and Fully Implicit-Explicit Collocation Methods

In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with arbitrary order-of-accuracy and varying degree of implicitness. In this first work, we focus on a new class of implicit-explicit polynomial block methods that are based on fully implicit Runge–Kutta methods with Radau nodes and that possess high stage order. Here, we show that the new fully implicit-explicit (FIMEX) integrators have improved stability compared to existing IMEX Runge–Kutta methods, while also being more computationally efficient due to recent developments in preconditioning techniques for solving the associated systems of nonlinear equations. For PDEs on periodic domains where the implicit component is trivial to invert, we will show how parallelization of the right-hand side evaluations can be exploited to obtain significant speedup compared to existing serial IMEX Runge–Kutta methods. For parallel (in space) finite element discretizations, the new methods can achieve orders of magnitude better accuracy than existing IMEX Runge–Kutta methods and/or achieve a given accuracy several times times faster in terms of computational runtime.

97 MATHEMATICS AND COMPUTING↗

A non-linear discontinuous Petrov-Galerkin method for removing oscillations in the solution of the time-dependent transport equation

This paper describes a Non-Linear Discontinuous Petrov-Galerkin method and its application to the one-speed Boltzmann Transport Equation (BTE) for space-time problems. The purpose of the method is to remove unwanted oscillations in the transport solution which occur in the vicinity of sharp flux gradients, while improving computational efficiency and numerical accuracy. This is achieved by applying artificial dissipation in the solution gradient direction, internal to an element using a novel finite element (FE) Riemann approach. The added dissipation is calculated at each node of the finite element mesh based on local behaviour of the transport solution on both the spatial and temporal axes of the problem. Thus a different dissipation is used in different elements. The magnitude of dissipation that is used is obtained from a gradient-informed scaling of the advection velocities in the stabilisation term. This makes the method in its most general form non-linear. The method is implemented within a very general finite element Riemann framework. This makes it completely independent of choice of angular basis function allowing one to use different descriptions of the angular variation. Results show the non-linear scheme performs consistently well in demanding time-dependent multi-dimensional neutron transport problems. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

SAIGE-GPU: accelerating genome- and phenome-wide association studies using GPUs

Genome-wide association studies (GWAS) at biobank scale are computationally intensive, especially for admixed populations requiring robust statistical models. SAIGE is a widely used method for generalized linear mixed-model GWAS but is limited by its CPU-based implementation, making phenome-wide association studies impractical for many research groups. We developed SAIGE-GPU, a GPU-accelerated version of SAIGE that replaces CPU-intensive matrix operations with GPU-optimized kernels. The core innovation is distributing genetic relationship matrix calculations across GPUs and communication layers. Applied to 2068 phenotypes from 635 969 participants in the Million Veteran Program, including diverse and admixed populations, SAIGE-GPU achieved a 5-fold speedup in mixed model fitting on supercomputing infrastructure and cloud platforms. We further optimized the variant association testing step through multi-core and multi-trait parallelization. Deployed on Google Cloud Platform and Azure, the method provided substantial cost and time savings. Source code and binaries are available for download at https://github.com/saigegit/SAIGE/tree/SAIGE-GPU-1.3.3. A code snapshot is archived at Zenodo for reproducibility (DOI: [10.5281/zenodo.17642591]). SAIGE-GPU is available in a containerized format for use across HPC and cloud environments and is implemented in R/C++ and runs on Linux systems.

Rodriguez, Alex [Argonne National Laboratory (ANL)↗

Enhanced quantum communication via optical refocusing

We consider the problem of quantum communication mediated by a passive optical refocusing system. The model captures the basic features of all those situations in which a signal is either refocused by a repeater for long-distance communication, or it is focused on a detector prior to the information decoding process. Introducing a general method for linear passive optical systems, we determine the conditions under which optical refocusing implies information transmission gain. Although the finite aperture of the repeater may cause loss of information, we show that the presence of the refocusing system can substantially enhance the rate of reliable communication with respect to the free-space propagation. We explicitly address the transferring of classical messages over the quantum channel, but the results can be easily extended to include the case of transferring quantum messages as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗