Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence rates”

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

Convergence Rate of Model Reference Adaptive Control with Application to Building HVAC Systems

Model reference adaptive control (MRAC) has been studied for decades and successfully applied in multiple areas, including heating, ventilation, and air conditioning (HVAC) systems for buildings. MRAC is efficient in capturing the time-varying characteristics of buildings' indoor temperatures and outdoor weather environments. In this paper, the rate of convergence of MRAC is investigated, where a direct adaptive control with temperature set point reference tracking is used to regulate the indoor temperatures for buildings. Numerical results show that by controlling the HVAC systems of residential buildings using MRAC, the indoor temperatures converge Q-sublinearly to the desired temperature set points. In addition, the rate of convergence for MRAC is compared with a baseline adaptive model-free control method.

Wu, Tumin↗

Convergence Rates for Empirical Estimation of Binary Classification Bounds

Bounding the best achievable error probability for binary classification problems is relevant to many applications including machine learning, signal processing, and information theory. Many bounds on the Bayes binary classification error rate depend on information divergences between the pair of class distributions. Recently, the Henze–Penrose (HP) divergence has been proposed for bounding classification error probability. We consider the problem of empirically estimating the HP-divergence from random samples. We derive a bound on the convergence rate for the Friedman–Rafsky (FR) estimator of the HP-divergence, which is related to a multivariate runs statistic for testing between two distributions. The FR estimator is derived from a multicolored Euclidean minimal spanning tree (MST) that spans the merged samples. We obtain a concentration inequality for the Friedman–Rafsky estimator of the Henze–Penrose divergence. We validate our results experimentally and illustrate their application to real datasets.

97 MATHEMATICS AND COMPUTING↗

An Initial Study of the Convergence Rate of Griffin’s Pebble Bed Reactors Algorithm

This paper presents an initial study of the convergence properties of an iterative algorithm for computing the burnup distribution in a pebble bed reactor (PBR) in its equilibrium core condition. The algorithm is implemented in the Griffin code. Griffin is a reactor multiphysics analysis application jointly developed by Idaho National Laboratory (INL) and Argonne National Laboratory (ANL). Griffin’s PBR algorithm is discussed and simulation data are presented. An alternative matrix formulation of the algorithm is presented that facilitates analysis of the iterative algorithm. The dependence of the spectral radius of the iterative algorithm on operational and discretization parameters is investigated.

97 MATHEMATICS AND COMPUTING↗

Improving the Convergence Rate of Parareal-in-time Power System Simulation using the Krylov Subspace

The performance of parareal-in-time algorithms is determined on the number of sequential, coarse step iterations. A common tradeoff in designing an efficient parareal-in-time algorithm is between accuracy of the coarse solver and the number of iterations. Traditional parareal implementation for the power system simulation can also have difficulties handling complex power systems. In this paper, we propose a Krylov subspace enhanced parareal algorithm to reduce the number of coarse iterations. The proposed approach is demonstrated on a single-machine-infinite-bus system and the IEEE 10-machine 39-bus system. Noticeable decrease of number of iterations is observed in both cases.

Duan, Nan↗

Cluster perturbation theory. IV. Convergence of cluster perturbation series for energies and molecular properties

The theoretical foundation has been developed for establishing whether cluster perturbation (CP) series for the energy, molecular properties, and excitation energies are convergent or divergent and for using a two-state model to describe the convergence rate and convergence patterns of the higher-order terms in the CP series. To establish whether the perturbation series are convergent or divergent, a fictitious system is introduced, for which the perturbation is multiplied by a complex scaling parameter z . The requirement for convergent perturbation series becomes that the energy or molecular property, including an excitation energy, for the fictitious system is an analytic, algebraic function of z that has no singularities when the norm | z | is smaller than one. Examples of CP series for the energy and molecular properties, including excitation energies, are also presented, and the two-state model is used for the interpretation of the convergence rate and the convergence patterns of the higher-order terms in these series. Finally, the calculations show that the perturbation series effectively become a two-state model at higher orders.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the rate of convergence in von Neumann's ergodic theorem with continuous time

The rate of convergence in von Neumann's mean ergodic theorem is studied for continuous time. The condition that the rate of convergence of the ergodic averages be of power-law type is shown to be equivalent to requiring that the spectral measure of the corresponding dynamical system have a power-type singularity at 0. This forces the estimates for the convergence rate in the above ergodic theorem to be necessarily spectral. All the results obtained have obvious exact analogues for wide-sense stationary processes. Bibliography: 7 titles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence analysis of two-node CMFD method for two-group neutron diffusion eigenvalue problem

In this paper, the nonlinear coarse-mesh finite difference method with two-node local problem (CMFD2N) is proven to be unconditionally stable for neutron diffusion eigenvalue problems. The explicit current correction factor (CCF) is derived based on the two-node analytic nodal method (ANM2N), and a Fourier stability analysis is applied to the linearized algorithm. It is shown that the analytic convergence rate obtained by the Fourier analysis compares very well with the numerically measured convergence rate. It is also shown that the theoretical convergence rate is only governed by the converged second harmonic buckling and the mesh size. It is also noted that the convergence rate of the CCF of the CMFD2N algorithm is dependent on the mesh size, but not on the total problem size. This is contrary to expectation for eigenvalue problem. The novel points of this paper are the analytical derivation of the convergence rate of the CMFD2N algorithm for eigenvalue problem, and the convergence analysis based on the analytic derivations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constants in estimates for the rates of convergence in von Neumann's and Birkhoff's ergodic theorems

The paper investigates estimates which relate two equivalent phenomena: the power-type rate of convergence in von Neumann's ergodic theorem and the power-type singularity at zero (with the same exponent) exhibited by the spectral measure of the function being averaged with respect to the corresponding dynamical system. The same rate of convergence is also estimated in terms of the rate of decrease of the correlation coefficients. Also, constants are found in analogous estimates for the power-type convergence in Birkhoff's ergodic theorem. All the results have exact analogues for wide-sense stationary stochastic processes. Bibliography: 15 titles.

97 MATHEMATICS AND COMPUTING↗

Model-Free Control of Indoor Temperatures in Residential Buildings: Convergence Analysis

Model-free control (MFC) has recently been applied in multiple fields, including indoor air temperature regulation in buildings. It is a data-enabled feedback tracking control strategy for complex systems using a simplified representation of the ultra-local approximation model through the unique information of input-output behavior. MFC is a prevailing control strategy for systems with unknown or poorly known system dynamic models. Thus, it is a relatively simple, but efficient, trajectory tracking controller. In this paper, we investigate the convergence rate of MFC when applied to controlling indoor temperatures in residential buildings subject to outdoor weather disturbances. Numerical results show that MFC is quite robust to external disturbances, and its rate of convergence is almost one, i.e., it converges Q-sublinearly (slower than linearly).

Wu, Tumin↗

Accelerated fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction

Purpose: The development of iterative image reconstruction algorithms for cone-beam computed tomography (CBCT) remains an active and important research area. Even with hardware acceleration, the overwhelming majority of the available 3D iterative algorithms that implement nonsmooth regularizers remain computationally burdensome and have not been translated for routine use in time-sensitive applications such as image-guided radiation therapy (IGRT). In this work, two variants of the fast iterative shrinkage thresholding algorithm (FISTA) are proposed and investigated for accelerated iterative image reconstruction in CBCT. Methods: Algorithm acceleration was achieved by replacing the original gradient-descent step in the FISTAs by a subproblem that is solved by use of the ordered subset simultaneous algebraic reconstruction technique (OS-SART). Due to the preconditioning matrix adopted in the OS-SART method, two new weighted proximal problems were introduced and corresponding fast gradient projection-type algorithms were developed for solving them. We also provided efficient numerical implementations of the proposed algorithms that exploit the massive data parallelism of multiple graphics processing units. Results: The improved rates of convergence of the proposed algorithms were quantified in computer-simulation studies and by use of clinical projection data corresponding to an IGRT study. The accelerated FISTAs were shown to possess dramatically improved convergence properties as compared to the standard FISTAs. For example, the number of iterations to achieve a specified reconstruction error could be reduced by an order of magnitude. Volumetric images reconstructed from clinical data were produced in under 4 min. Conclusions: The FISTA achieves a quadratic convergence rate and can therefore potentially reduce the number of iterations required to produce an image of a specified image quality as compared to first-order methods. We have proposed and investigated accelerated FISTAs for use with two nonsmooth penalty functions that will lead to further reductions in image reconstruction times while preserving image quality. Moreover, with the help of a mixed sparsity-regularization, better preservation of soft-tissue structures can be potentially obtained. The algorithms were systematically evaluated by use of computer-simulated and clinical data sets.

60 APPLIED LIFE SCIENCES↗

Discontinuous Galerkin sparse grids methods for time domain Maxwell’s equations

In this paper, we present a time-explicit sparse grid discontinuous Galerkin method for solving the three-dimensional time-domain Maxwell equations. The conservation properties and convergence rates are established for different choices of numerical fluxes. The convergence rates are proved theoretically and then verified by several numerical examples. Even though our scheme does not preserve the divergence, but by implying the higher order polynomial, one can observe the same convergence rate as numerical solution. Several numerical tests are presented to validate these conclusions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗