92 resultados para predictor-corrector methods
em Cambridge University Engineering Department Publications Database
Resumo:
Monte Carlo burnup codes use various schemes to solve the coupled criticality and burnup equations. Previous studies have shown that the simplest methods, such as the beginning-of-step and middle-of-step constant flux approximations, are numerically unstable in fuel cycle calculations of critical reactors. Here we show that even the predictor-corrector methods that are implemented in established Monte Carlo burnup codes can be numerically unstable in cycle calculations of large systems. © 2013 Elsevier Ltd. All rights reserved.
Resumo:
This paper investigates the effect of the burnup coupling scheme on the numerical stability and accuracy of coupled Monte-Carlo depletion calculations. We show that in some cases, even the Predictor Corrector method with relatively short time steps can be numerically unstable. In addition, we present two possible extensions to the Euler predictor-corrector (PC) method, which is typically used in coupled burnup calculations. These modifications allow using longer time steps, while maintaining numerical stability and accuracy. © 2013 Elsevier Ltd. All rights reserved.
Resumo:
The Hoberman 'switch-pitch ' ball is a transformable structure with a single folding and unfolding path. The underlying cubic structure has a novel mechanism that retains tetrahedral symmetry during folding. Here, we propose a generalized class of structures of a similar type that retain their full symmetry during folding. The key idea is that we require two orbits of nodes for the structure: within each orbit, any node can be copied to any other node by a symmetry operation. Each member is connected to two nodes, which may be in different orbits, by revolute joints. We will describe the symmetry analysis that reveals the symmetry of the internal mechanism modes for a switch-pitch structure. To follow the complete folding path of the structure, a nonlinear iterative predictor-corrector algorithm based on the Newton method is adopted. First, a simple tetrahedral example of the class of two-orbit structures is presented. Typical configurations along the folding path are shown. Larger members of the class of structures are also presented, all with cubic symmetry. These switch-pitch structures could have useful applications as deployable structures.
Resumo:
The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges superlinearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression. © 2013 Society for Industrial and Applied Mathematics.