Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Spline-based Rayleigh-Ritz methods for the approximation of the natural modes of vibration for flexible beams with tip bodies

Rayleigh-Ritz methods for the approximation of the natural modes for a class of vibration problems involving flexible beams with tip bodies using subspaces of piecewise polynomial spline functions are developed. An abstract operator-theoretic formulation of the eigenvalue problem is derived and spectral properties investigated. The existing theory for spline-based Rayleigh-Ritz methods applied to elliptic differential operators and the approximation properties of interpolatory splines are used to argue convergence and establish rates of convergence. An example and numerical results are discussed.

Rosen, I. G.↗
DOE OSTI2022

pnnl/eqc

EQC is a software framework for smart distributed quantum computer management and organization for variational quantum algorithms. EQC utilizes smart real time management of multiple independent quantum processors to maximize variational quantum algorithm throughput, for improved converged performance and improved rate of convergance.

Central, PNNL Developer↗
NASA NTRS1990

The augmented Lagrangian method for parameter estimation in elliptic systems

In this paper a new technique for the estimation of parameters in elliptic partial differential equations is developed. It is a hybrid method combining the output-least-squares and the equation error method. The new method is realized by an augmented Lagrangian formulation, and convergence as well as rate of convergence proofs are provided. Technically the critical step is the verification of a coercivity estimate of an appropriately defined Lagrangian functional. To obtain this coercivity estimate a seminorm regularization technique is used.

Ito, Kazufumi↗
NASA NTRS1990

An error analysis of least-squares finite element method of velocity-pressure-vorticity formulation for Stokes problem

A theoretical proof of the optimal rate of convergence for the least-squares method is developed for the Stokes problem based on the velocity-pressure-vorticity formula. The 2D Stokes problem is analyzed to define the product space and its inner product, and the a priori estimates are derived to give the finite-element approximation. The least-squares method is found to converge at the optimal rate for equal-order interpolation.

Chang, Ching L.↗
NASA NTRS1995

Modified Interior Distance Functions (Theory and Methods)

In this paper we introduced and developed the theory of Modified Interior Distance Functions (MIDF's). The MIDF is a Classical Lagrangian (CL) for a constrained optimization problem which is equivalent to the initial one and can be obtained from the latter by monotone transformation both the objective function and constraints. In contrast to the Interior Distance Functions (IDF's), which played a fundamental role in Interior Point Methods (IPM's), the MIDF's are defined on an extended feasible set and along with center, have two extra tools, which control the computational process: the barrier parameter and the vector of Lagrange multipliers. The extra tools allow to attach to the MEDF's very important properties of Augmented Lagrangeans. One can consider the MIDFs as Interior Augmented Lagrangeans. It makes MIDF's similar in spirit to Modified Barrier Functions (MBF's), although there is a fundamental difference between them both in theory and methods. Based on MIDF's theory, Modified Center Methods (MCM's) have been developed and analyzed. The MCM's find an unconstrained minimizer in primal space and update the Lagrange multipliers, while both the center and the barrier parameter can be fixed or updated at each step. The MCM's convergence was investigated, and their rate of convergence was estimated. The extension of the feasible set and the special role of the Lagrange multipliers allow to develop MCM's, which produce, in case of nondegenerate constrained optimization, a primal and dual sequences that converge to the primal-dual solutions with linear rate, even when both the center and the barrier parameter are fixed. Moreover, every Lagrange multipliers update shrinks the distance to the primal dual solution by a factor 0 less than gamma less than 1 which can be made as small as one wants by choosing a fixed interior point as a 'center' and a fixed but large enough barrier parameter. The numericai realization of MCM leads to the Newton MCM (NMCM). The approximation for the primal minimizer one finds by Newton Method followed by the Lagrange multipliers update. Due to the MCM convergence, when both the center and the barrier parameter are fixed, the condition of the MDF Hessism and the neighborhood of the primal ninimizer where Newton method is 'well' defined remains stable. It contributes to both the complexity and the numerical stability of the NMCM.

Polyak, Roman A.↗
NASA NTRS1993

An automatic multigrid method for the solution of sparse linear systems

An automatic version of the multigrid method for the solution of linear systems arising from the discretization of elliptic PDE's is presented. This version is based on the structure of the algebraic system solely, and does not use the original partial differential operator. Numerical experiments show that for the Poisson equation the rate of convergence of our method is equal to that of classical multigrid methods. Moreover, the method is robust in the sense that its high rate of convergence is conserved for other classes of problems: non-symmetric, hyperbolic (even with closed characteristics) and problems on non-uniform grids. No double discretization or special treatment of sub-domains (e.g. boundaries) is needed. When supplemented with a vector extrapolation method, high rates of convergence are achieved also for anisotropic and discontinuous problems and also for indefinite Helmholtz equations. A new double discretization strategy is proposed for finite and spectral element schemes and is found better than known strategies.

Shapira, Yair↗
NASA NTRS1987

Steady state computations for wave propagation problems

The behavior of difference approximations of hyperbolic partial differential equations as time t goes to infinity is studied. The rate of convergence to steady state is analyzed theoretically and experimentally for the advection equation and the linearized Euler equations. The choice of difference formulas and boundary conditions strongly influences the rate of convergence in practical steady-state calculations. In particular it is shown that upwind difference methods and characteristic boundary conditions have very attractive convergence properties.

Engquist, Bjorn↗
NASA NTRS1991

Orderings for conjugate gradient preconditionings

The effect of orderings on the rate of convergence of the conjugate gradient method with SSOR or incomplete Cholesky preconditioning is examined. Some results also are presented that help to explain why red/black ordering gives an inferior rate of convergence.

Ortega, James M.↗
NASA NTRS1992

A hybrid multigrid technique for computing steady-state solutions to supersonic flows

Recently, Li and Sanders have introduced a class of finite difference schemes to approximate generally discontinuous solutions to hyperbolic systems of conservation laws. These equations have the form together with relevant boundary conditions. When modelling hypersonic spacecraft reentry, the differential equations above are frequently given by the compressible Euler equations coupled with a nonequilibrium chemistry model. For these applications, steady state solutions are often sought. Many tens (to hundreds) of super computer hours can be devoted to a single three space dimensional simulation. The primary difficulty is the inability to rapidly and reliably capture the steady state. In these notes, we demonstrate that a particular variant from the schemes presented can be combined with a particular multigrid approach to capture steady state solutions to the compressible Euler equations in one space dimension. We show that the rate of convergence to steady state coming from this multigrid implementation is vastly superior to the traditional approach of artificial time relaxation. Moreover, we demonstrate virtual grid independence. That is, the rate of convergence does not depend on the degree of spatial grid refinement.

Sanders, Richard↗
NASA NTRS1975

Perturbation theory for charged-particle transport in one dimension

Perturbation theory, when applied to charged-particle transport, generates a series solution that requires a double quadrature per term. The continuity of higher-order terms leads to numerical evaluation of the series. The high rate of convergence of the series makes the method a practical tool for charged-particle transport problems. The coupling of the neutron component in the case of proton transport in tissue does not greatly alter the rate of convergence. The method holds promise for a practical high-energy proton transport theory.

Wilson, J. W.↗
NASA NTRS1991

Acceleration of convergence by shifting the spectrum of implicit finite difference operators associated with the equations of gas dynamics

Eigensystem analysis techniques are applied to finite difference formulations of the Navier-Stokes equations in one dimension. Spectra of the resulting implicit difference operators are computed. The largest eigenvalues are calculated by using a combination of the Frechet derivative of the operators and Arnoldi's method. The accuracy of Arnoldi's method is tested by comparing the rate of convergence of the iterative method with the dominant eigenvalue of the original iteration matrix. On the basis of the pattern of eigenvalue distributions for various flow configurations, a shifting of the implicit operators in question is devised. This procedure has improved the rates of convergence of CFD codes by 20 - 50 percent.

Cheer, A.↗
DOE OSTI2021

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗
DOE OSTI2023

Convergence analysis of single rate and multirate fixed stress split iterative coupling schemes in heterogeneous poroelastic media

Recently, the accurate modeling of flow–structure interactions has gained more attention and importance for both petroleum and environmental engineering applications. Of particular interest is the coupling between subsurface flow and reservoir geomechanics. Different single rate and multirate iterative and explicit coupling schemes have been proposed and analyzed in the past. In addition, Banach fixed point contraction results were obtained for iterative coupling schemes, and conditionally stable results were obtained for explicit coupling schemes. In this work, we will consider the mathematical analysis of the single rate and multirate fixed stress split iterative coupling schemes for spatially heterogeneous poroelastic media. We will re–establish the contractivity for both schemes in the localized case, and we will show that heterogeneities come at the expense of imposing more restricted conditions on the number of fine flow time steps that can be taken within one coarse mechanics time step in the multirate case. Our mathematical analysis is supplemented by numerical simulations validating our derived upper bounds. Finally, to the best of our knowledge, this is the first rigorous mathematical analysis of the multirate fixed–stress split iterative coupling scheme in heterogeneous poroelastic media.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Efficient ptychographic phase retrieval via a matrix-free Levenberg-Marquardt algorithm

The phase retrieval problem, where one aims to recover a complex-valued image from far-field intensity measurements, is a classic problem encountered in a range of imaging applications. Modern phase retrieval approaches usually rely on gradient descent methods in a nonlinear minimization framework. Calculating closed-form gradients for use in these methods is tedious work, and formulating second order derivatives is even more laborious. Additionally, second order techniques often require the storage and inversion of large matrices of partial derivatives, with memory requirements that can be prohibitive for data-rich imaging modalities. We use a reverse-mode automatic differentiation (AD) framework to implement an efficient matrix-free version of the Levenberg-Marquardt (LM) algorithm, a longstanding method that finds popular use in nonlinear least-square minimization problems but which has seen little use in phase retrieval. Furthermore, we extend the basic LM algorithm so that it can be applied for more general constrained optimization problems (including phase retrieval problems) beyond just the least-square applications. Since we use AD, we only need to specify the physics-based forward model for a specific imaging application; the first and second-order derivative terms are calculated automatically through matrix-vector products, without explicitly forming the large Jacobian or Gauss-Newton matrices typically required for the LM method. We demonstrate that this algorithm can be used to solve both the unconstrained ptychographic object retrieval problem and the constrained “blind” ptychographic object and probe retrieval problems, under the popular Gaussian noise model as well as the Poisson noise model. We compare this algorithm to state-of-the-art first order ptychographic reconstruction methods to demonstrate empirically that this method outperforms best-in-class first-order methods: it provides excellent convergence guarantees with (in many cases) a superlinear rate of convergence, all with a computational cost comparable to, or lower than, the tested first-order algorithms.

36 MATERIALS SCIENCE↗
NASA NTRS1991

Speeding Convergence In Simulations Of Hypersonic Flow

Report describes study aimed at accelerating rates of convergence of iterative schemes for numerical integration of equations of hypersonic flow of viscous and inviscid fluids. Richardson-type overrelaxation method applied.

Flores, J.↗
NASA NTRS2005

Real-Time Principal-Component Analysis

A recently written computer program implements dominant-element-based gradient descent and dynamic initial learning rate (DOGEDYN), which was described in Method of Real-Time Principal-Component Analysis (NPO-40034) NASA Tech Briefs, Vol. 29, No. 1 (January 2005), page 59. To recapitulate: DOGEDYN is a method of sequential principal-component analysis (PCA) suitable for such applications as data compression and extraction of features from sets of data. In DOGEDYN, input data are represented as a sequence of vectors acquired at sampling times. The learning algorithm in DOGEDYN involves sequential extraction of principal vectors by means of a gradient descent in which only the dominant element is used at each iteration. Each iteration includes updating of elements of a weight matrix by amounts proportional to a dynamic initial learning rate chosen to increase the rate of convergence by compensating for the energy lost through the previous extraction of principal components. In comparison with a prior method of gradient-descent-based sequential PCA, DOGEDYN involves less computation and offers a greater rate of learning convergence. The sequential DOGEDYN computations require less memory than would parallel computations for the same purpose. The DOGEDYN software can be executed on a personal computer.

Duong, Vu↗