Iterative convergence acceleration of neutral particle transport methods via adjacent-cell preconditioners

International Nuclear Information System (INIS)

Azmy, Y.Y.

1999-01-01

The author proposes preconditioning as a viable acceleration scheme for the inner iterations of transport calculations in slab geometry. In particular he develops Adjacent-Cell Preconditioners (AP) that have the same coupling stencil as cell-centered diffusion schemes. For lowest order methods, e.g., Diamond Difference, Step, and 0-order Nodal Integral Method (ONIM), cast in a Weighted Diamond Difference (WDD) form, he derives AP for thick (KAP) and thin (NAP) cells that for model problems are unconditionally stable and efficient. For the First-Order Nodal Integral Method (INIM) he derives a NAP that possesses similarly excellent spectral properties for model problems. The two most attractive features of the new technique are:(1) its cell-centered coupling stencil, which makes it more adequate for extension to multidimensional, higher order situations than the standard edge-centered or point-centered Diffusion Synthetic Acceleration (DSA) methods; and (2) its decreasing spectral radius with increasing cell thickness to the extent that immediate pointwise convergence, i.e., in one iteration, can be achieved for problems with sufficiently thick cells. He implemented these methods, augmented with appropriate boundary conditions and mixing formulas for material heterogeneities, in the test code APID that he uses to successfully verify the analytical spectral properties for homogeneous problems. Furthermore, he conducts numerical tests to demonstrate the robustness of the KAP and NAP in the presence of sharp mesh or material discontinuities. He shows that the AP for WDD is highly resilient to such discontinuities, but for INIM a few cases occur in which the scheme does not converge; however, when it converges, AP greatly reduces the number of iterations required to achieve convergence

Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems.

Science.gov (United States)

Wang, An; Cao, Yang; Shi, Quan

2018-01-01

In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl. 23:629-641, 2016). New convergence conditions are presented when the system matrix is a positive-definite matrix and an [Formula: see text]-matrix, respectively.

A necessary and sufficient condition for the convergence of an AOR iterative method

International Nuclear Information System (INIS)

Hu Jiagan

1992-01-01

In this paper, a necessary and sufficient condition for the convergence of an AOR iterative method is given under the condition that the coefficient matrix A is consistently ordered and the eigenvalues of the Jacobi matrix of A are all real. With the same method the condition for the convergence of t he extrapolation Gauss-Seidel (EGS) method is also obtained. As an example, the conditions for the model problem are given. The rate of convergence of the EGS method is about twice that of the GS method

Convergence and resolution recovery of block-iterative EM algorithms modeling 3D detector response in SPECT

International Nuclear Information System (INIS)

Lalush, D.S.; Tsui, B.M.W.; Karimi, S.S.

1996-01-01

We evaluate fast reconstruction algorithms including ordered subsets-EM (OS-EM) and Rescaled Block Iterative EM (RBI-EM) in fully 3D SPECT applications on the basis of their convergence and resolution recovery properties as iterations proceed. Using a 3D computer-simulated phantom consisting of 3D Gaussian objects, we simulated projection data that includes only the effects of sampling and detector response of a parallel-hole collimator. Reconstructions were performed using each of the three algorithms (ML-EM, OS-EM, and RBI-EM) modeling the 3D detector response in the projection function. Resolution recovery was evaluated by fitting Gaussians to each of the four objects in the iterated image estimates at selected intervals. Results show that OS-EM and RBI-EM behave identically in this case; their resolution recovery results are virtually indistinguishable. Their resolution behavior appears to be very similar to that of ML-EM, but accelerated by a factor of twenty. For all three algorithms, smaller objects take more iterations to converge. Next, we consider the effect noise has on convergence. For both noise-free and noisy data, we evaluate the log likelihood function at each subiteration of OS-EM and RBI-EM, and at each iteration of ML-EM. With noisy data, both OS-EM and RBI-EM give results for which the log-likelihood function oscillates. Especially for 180-degree acquisitions, RBI-EM oscillates less than OS-EM. Both OS-EM and RBI-EM appear to converge to solutions, but not to the ML solution. We conclude that both OS-EM and RBI-EM can be effective algorithms for fully 3D SPECT reconstruction. Both recover resolution similarly to ML-EM, only more quickly

Robust Monotonically Convergent Iterative Learning Control for Discrete-Time Systems via Generalized KYP Lemma

Directory of Open Access Journals (Sweden)

Jian Ding

2014-01-01

Full Text Available This paper addresses the problem of P-type iterative learning control for a class of multiple-input multiple-output linear discrete-time systems, whose aim is to develop robust monotonically convergent control law design over a finite frequency range. It is shown that the 2 D iterative learning control processes can be taken as 1 D state space model regardless of relative degree. With the generalized Kalman-Yakubovich-Popov lemma applied, it is feasible to describe the monotonically convergent conditions with the help of linear matrix inequality technique and to develop formulas for the control gain matrices design. An extension to robust control law design against systems with structured and polytopic-type uncertainties is also considered. Two numerical examples are provided to validate the feasibility and effectiveness of the proposed method.

Uniform convergence of multigrid V-cycle iterations for indefinite and nonsymmetric problems

Science.gov (United States)

Bramble, James H.; Kwak, Do Y.; Pasciak, Joseph E.

1993-01-01

In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems. In this multigrid method various types of smoothers may be used. One type of smoother which we consider is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. We also study smoothers based entirely on the original operator. One is based on the normal form, that is, the product of the operator and its transpose. Other smoothers studied include point and line, Jacobi, and Gauss-Seidel. We show that the uniform estimates for symmetric positive definite problems carry over to these algorithms. More precisely, the multigrid iteration for the nonsymmetric and/or indefinite problem is shown to converge at a uniform rate provided that the coarsest grid in the multilevel iteration is sufficiently fine (but not depending on the number of multigrid levels).

Improving Convergence of Iterative Feedback Tuning using Optimal External Perturbations

DEFF Research Database (Denmark)

Huusom, Jakob Kjøbsted; Hjalmarsson, Håkon; Poulsen, Niels Kjølstad

2008-01-01

Iterative feedback tuning constitutes an attractive control loop tuning method for processes in the absence of sufficient process insight. It is a purely data driven approach to optimization of the loop performance. The standard formulation ensures an unbiased estimate of the loop performance cost...... function gradient, which is used in a search algorithm. A slow rate of convergence of the tuning method is often experienced when tuning for disturbance rejection. This is due to a poor signal to noise ratio in the process data. A method is proposed for increasing the information content in data...

On the Convergence of Implicit Iterative Processes for Asymptotically Pseudocontractive Mappings in the Intermediate Sense

Directory of Open Access Journals (Sweden)

Xiaolong Qin

2011-01-01

Full Text Available An implicit iterative process is considered. Strong and weak convergence theorems of common fixed points of a finite family of asymptotically pseudocontractive mappings in the intermediate sense are established in a real Hilbert space.

A new proof for the convergent iterative solution of the degenerate quantum double-well potential and its generalization

International Nuclear Information System (INIS)

Friedberg, R.; Lee, T.D.

2003-01-01

We present a new and simpler proof for the convergent iterative solution of the one-dimensional degenerate double-well potential. This new proof depends on a general theorem, called the hierarchy theorem, that shows the successive stages in the iteration to form a monotonically increasing sequence of approximations to the energy and to the wavefunction at any point x. This important property makes possible a much simpler proof of convergence than the one given before in the literature. The hierarchy theorem proven in this paper is applicable to a much wider class of potentials which includes the quartic potential

Convergence problems associated with the iteration of adjoint equations in nuclear reactor theory

International Nuclear Information System (INIS)

Ngcobo, E.

2003-01-01

Convergence problems associated with the iteration of adjoint equations based on two-group neutron diffusion theory approximations in slab geometry are considered. For this purpose first-order variational techniques are adopted to minimise numerical errors involved. The importance of deriving the adjoint source from a breeding ratio is illustrated. The results obtained are consistent with the expected improvement in accuracy

Convergence estimates for iterative methods via the Kriess Matrix Theorem on a general complex domain

Energy Technology Data Exchange (ETDEWEB)

Toh, K.C.; Trefethen, L.N. [Cornell Univ., Ithaca, NY (United States)

1994-12-31

What properties of a nonsymmetric matrix A determine the convergence rate of iterations such as GMRES, QMR, and Arnoldi? If A is far from normal, should one replace the usual Ritz values {r_arrow} eigenvalues notion of convergence of Arnoldi by alternative notions such as Arnoldi lemniscates {r_arrow} pseudospectra? Since Krylov subspace iterations can be interpreted as minimization processes involving polynomials of matrices, the answers to questions such as these depend upon mathematical problems of the following kind. Given a polynomial p(z), how can one bound the norm of p(A) in terms of (1) the size of p(z) on various sets in the complex plane, and (2) the locations of the spectrum and pseudospectra of A? This talk reports some progress towards solving these problems. In particular, the authors present theorems that generalize the Kreiss matrix theorem from the unit disk (for the monomial A{sup n}) to a class of general complex domains (for polynomials p(A)).

Natural Preconditioning and Iterative Methods for Saddle Point Systems

KAUST Repository

Pestana, Jennifer

2015-01-01

© 2015 Society for Industrial and Applied Mathematics. The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints gives rise to linear systems in saddle point form. This is true whether in the continuous or the discrete setting, so saddle point systems arising from the discretization of partial differential equation problems, such as those describing electromagnetic problems or incompressible flow, lead to equations with this structure, as do, for example, interior point methods and the sequential quadratic programming approach to nonlinear optimization. This survey concerns iterative solution methods for these problems and, in particular, shows how the problem formulation leads to natural preconditioners which guarantee a fast rate of convergence of the relevant iterative methods. These preconditioners are related to the original extremum problem and their effectiveness - in terms of rapidity of convergence - is established here via a proof of general bounds on the eigenvalues of the preconditioned saddle point matrix on which iteration convergence depends.

Robust iterative learning control for multi-phase batch processes: an average dwell-time method with 2D convergence indexes

Science.gov (United States)

Wang, Limin; Shen, Yiteng; Yu, Jingxian; Li, Ping; Zhang, Ridong; Gao, Furong

2018-01-01

In order to cope with system disturbances in multi-phase batch processes with different dimensions, a hybrid robust control scheme of iterative learning control combined with feedback control is proposed in this paper. First, with a hybrid iterative learning control law designed by introducing the state error, the tracking error and the extended information, the multi-phase batch process is converted into a two-dimensional Fornasini-Marchesini (2D-FM) switched system with different dimensions. Second, a switching signal is designed using the average dwell-time method integrated with the related switching conditions to give sufficient conditions ensuring stable running for the system. Finally, the minimum running time of the subsystems and the control law gains are calculated by solving the linear matrix inequalities. Meanwhile, a compound 2D controller with robust performance is obtained, which includes a robust extended feedback control for ensuring the steady-state tracking error to converge rapidly. The application on an injection molding process displays the effectiveness and superiority of the proposed strategy.

Effects of high-frequency damping on iterative convergence of implicit viscous solver

Science.gov (United States)

Nishikawa, Hiroaki; Nakashima, Yoshitaka; Watanabe, Norihiko

2017-11-01

This paper discusses effects of high-frequency damping on iterative convergence of an implicit defect-correction solver for viscous problems. The study targets a finite-volume discretization with a one parameter family of damped viscous schemes. The parameter α controls high-frequency damping: zero damping with α = 0, and larger damping for larger α (> 0). Convergence rates are predicted for a model diffusion equation by a Fourier analysis over a practical range of α. It is shown that the convergence rate attains its minimum at α = 1 on regular quadrilateral grids, and deteriorates for larger values of α. A similar behavior is observed for regular triangular grids. In both quadrilateral and triangular grids, the solver is predicted to diverge for α smaller than approximately 0.5. Numerical results are shown for the diffusion equation and the Navier-Stokes equations on regular and irregular grids. The study suggests that α = 1 and 4/3 are suitable values for robust and efficient computations, and α = 4 / 3 is recommended for the diffusion equation, which achieves higher-order accuracy on regular quadrilateral grids. Finally, a Jacobian-Free Newton-Krylov solver with the implicit solver (a low-order Jacobian approximately inverted by a multi-color Gauss-Seidel relaxation scheme) used as a variable preconditioner is recommended for practical computations, which provides robust and efficient convergence for a wide range of α.

Convergence analysis of the nonlinear iterative method for two-phase flow in porous media associated with nanoparticle injection

KAUST Repository

El-Amin, Mohamed

2017-08-29

Purpose In this paper, we introduce modeling, numerical simulation, and convergence analysis of the problem nanoparticles transport carried by a two-phase flow in a porous medium. The model consists of equations of pressure, saturation, nanoparticles concentration, deposited nanoparticles concentration on the pore-walls, and entrapped nanoparticles concentration in pore-throats. Design/methodology/approach Nonlinear iterative IMPES-IMC (IMplicit Pressure Explicit Saturation–IMplicit Concentration) scheme is used to solve the problem under consideration. The governing equations are discretized using the cell-centered finite difference (CCFD) method. The pressure and saturation equations are coupled to calculate the pressure, then the saturation is updated explicitly. Therefore, the equations of nanoparticles concentration, the deposited nanoparticles concentration on the pore walls and the entrapped nanoparticles concentration in pore throats are computed implicitly. Then, the porosity and the permeability variations are updated. Findings We stated and proved three lemmas and one theorem for the convergence of the iterative method under the natural conditions and some continuity and boundedness assumptions. The theorem is proved by induction states that after a number of iterations the sequences of the dependent variables such as saturation and concentrations approach solutions on the next time step. Moreover, two numerical examples are introduced with convergence test in terms of Courant–Friedrichs–Lewy (CFL) condition and a relaxation factor. Dependent variables such as pressure, saturation, concentration, deposited concentrations, porosity and permeability are plotted as contours in graphs, while the error estimations are presented in table for different values of number of time steps, number of iterations and mesh size. Research limitations/implications The domain of the computations is relatively small however, it is straightforward to extend this method

Rigorous approximation of stationary measures and convergence to equilibrium for iterated function systems

International Nuclear Information System (INIS)

Galatolo, Stefano; Monge, Maurizio; Nisoli, Isaia

2016-01-01

We study the problem of the rigorous computation of the stationary measure and of the rate of convergence to equilibrium of an iterated function system described by a stochastic mixture of two or more dynamical systems that are either all uniformly expanding on the interval, either all contracting. In the expanding case, the associated transfer operators satisfy a Lasota–Yorke inequality, we show how to compute a rigorous approximations of the stationary measure in the L "1 norm and an estimate for the rate of convergence. The rigorous computation requires a computer-aided proof of the contraction of the transfer operators for the maps, and we show that this property propagates to the transfer operators of the IFS. In the contracting case we perform a rigorous approximation of the stationary measure in the Wasserstein–Kantorovich distance and rate of convergence, using the same functional analytic approach. We show that a finite computation can produce a realistic computation of all contraction rates for the whole parameter space. We conclude with a description of the implementation and numerical experiments. (paper)

Software testing for evolutionary iterative rapid prototyping

OpenAIRE

Davis, Edward V., Jr.

1990-01-01

Approved for public release; distribution unlimited. Rapid prototyping is emerging as a promising software development paradigm. It provides a systematic and automatable means of developing a software system under circumstances where initial requirements are not well known or where requirements change frequently during development. To provide high software quality assurance requires sufficient software testing. The unique nature of evolutionary iterative prototyping is not well-suited for ...

On One-Point Iterations and DIIS

DEFF Research Database (Denmark)

Østerby, Ole; Sørensen, Hans Henrik Brandenborg

2009-01-01

We analyze various iteration procedures in many dimensions inspired by the SCF iteration used in first principles electronic structure calculations. We show that the simple mixing of densities can turn a divergent (or slowly convergent) iteration into a (faster) convergent process provided all...

Block Iterative Methods for Elliptic and Parabolic Difference Equations.

Science.gov (United States)

1981-09-01

S V PARTER, M STEUERWALT N0OO14-7A-C-0341 UNCLASSIFIED CSTR -447 NL ENN.EEEEEN LLf SCOMPUTER SCIENCES c~DEPARTMENT SUniversity of Wisconsin- SMadison...suggests that iterative algorithms that solve for several points at once will converge more rapidly than point algorithms . The Gaussian elimination... algorithm is seen in this light to converge in one step. Frankel [14], Young [34], Arms, Gates, and Zondek [1], and Varga [32], using the algebraic structure

A Design Algorithm using External Perturbation to Improve Iterative Feedback Tuning Convergence

DEFF Research Database (Denmark)

Huusom, Jakob Kjøbsted; Hjalmarsson, Håkan; Poulsen, Niels Kjølstad

2011-01-01

Iterative Feedback Tuning constitutes an attractive control loop tuning method for processes in the absence of process insight. It is a purely data driven approach for optimization of the loop performance. The standard formulation ensures an unbiased estimate of the loop performance cost function...... gradient, which is used in a search algorithm for minimizing the performance cost. A slow rate of convergence of the tuning method is often experienced when tuning for disturbance rejection. This is due to a poor signal to noise ratio in the process data. A method is proposed for increasing the data...

Laser simulation applying Fox-Li iteration: investigation of reason for non-convergence

Science.gov (United States)

Paxton, Alan H.; Yang, Chi

2017-02-01

Fox-Li iteration is often used to numerically simulate lasers. If a solution is found, the complex field amplitude is a good indication of the laser mode. The case of a semiconductor laser, for which the medium possesses a self-focusing nonlinearity, was investigated. For a case of interest, the iterations did not yield a converged solution. Another approach was needed to explore the properties of the laser mode. The laser was treated (unphysically) as a regenerative amplifier. As the input to the amplifier, we required a smooth complex field distribution that matched the laser resonator. To obtain such a field, we found what would be the solution for the laser field if the strength of the self focusing nonlinearity were α = 0. This was used as the input to the laser, treated as an amplifier. Because the beam deteriorated as it propagated multiple passes in the resonator and through the gain medium (for α = 2.7), we concluded that a mode with good beam quality could not exist in the laser.

Strong Convergence Iterative Algorithms for Equilibrium Problems and Fixed Point Problems in Banach Spaces

Directory of Open Access Journals (Sweden)

Shenghua Wang

2013-01-01

Full Text Available We first introduce the concept of Bregman asymptotically quasinonexpansive mappings and prove that the fixed point set of this kind of mappings is closed and convex. Then we construct an iterative scheme to find a common element of the set of solutions of an equilibrium problem and the set of common fixed points of a countable family of Bregman asymptotically quasinonexpansive mappings in reflexive Banach spaces and prove strong convergence theorems. Our results extend the recent ones of some others.

Multi-level iteration optimization for diffusive critical calculation

International Nuclear Information System (INIS)

Li Yunzhao; Wu Hongchun; Cao Liangzhi; Zheng Youqi

2013-01-01

In nuclear reactor core neutron diffusion calculation, there are usually at least three levels of iterations, namely the fission source iteration, the multi-group scattering source iteration and the within-group iteration. Unnecessary calculations occur if the inner iterations are converged extremely tight. But the convergence of the outer iteration may be affected if the inner ones are converged insufficiently tight. Thus, a common scheme suit for most of the problems was proposed in this work to automatically find the optimized settings. The basic idea is to optimize the relative error tolerance of the inner iteration based on the corresponding convergence rate of the outer iteration. Numerical results of a typical thermal neutron reactor core problem and a fast neutron reactor core problem demonstrate the effectiveness of this algorithm in the variational nodal method code NODAL with the Gauss-Seidel left preconditioned multi-group GMRES algorithm. The multi-level iteration optimization scheme reduces the number of multi-group and within-group iterations respectively by a factor of about 1-2 and 5-21. (authors)

Advances in iterative methods

International Nuclear Information System (INIS)

Beauwens, B.; Arkuszewski, J.; Boryszewicz, M.

1981-01-01

Results obtained in the field of linear iterative methods within the Coordinated Research Program on Transport Theory and Advanced Reactor Calculations are summarized. The general convergence theory of linear iterative methods is essentially based on the properties of nonnegative operators on ordered normed spaces. The following aspects of this theory have been improved: new comparison theorems for regular splittings, generalization of the notions of M- and H-matrices, new interpretations of classical convergence theorems for positive-definite operators. The estimation of asymptotic convergence rates was developed with two purposes: the analysis of model problems and the optimization of relaxation parameters. In the framework of factorization iterative methods, model problem analysis is needed to investigate whether the increased computational complexity of higher-order methods does not offset their increased asymptotic convergence rates, as well as to appreciate the effect of standard relaxation techniques (polynomial relaxation). On the other hand, the optimal use of factorization iterative methods requires the development of adequate relaxation techniques and their optimization. The relative performances of a few possibilities have been explored for model problems. Presently, the best results have been obtained with optimal diagonal-Chebyshev relaxation

Application of a repetitive process setting to design of monotonically convergent iterative learning control

Science.gov (United States)

Boski, Marcin; Paszke, Wojciech

2015-11-01

This paper deals with the problem of designing an iterative learning control algorithm for discrete linear systems using repetitive process stability theory. The resulting design produces a stabilizing output feedback controller in the time domain and a feedforward controller that guarantees monotonic convergence in the trial-to-trial domain. The results are also extended to limited frequency range design specification. New design procedure is introduced in terms of linear matrix inequality (LMI) representations, which guarantee the prescribed performances of ILC scheme. A simulation example is given to illustrate the theoretical developments.

Various Newton-type iterative methods for solving nonlinear equations

Directory of Open Access Journals (Sweden)

Manoj Kumar

2013-10-01

Full Text Available The aim of the present paper is to introduce and investigate new ninth and seventh order convergent Newton-type iterative methods for solving nonlinear equations. The ninth order convergent Newton-type iterative method is made derivative free to obtain seventh-order convergent Newton-type iterative method. These new with and without derivative methods have efficiency indices 1.5518 and 1.6266, respectively. The error equations are used to establish the order of convergence of these proposed iterative methods. Finally, various numerical comparisons are implemented by MATLAB to demonstrate the performance of the developed methods.

Semi-convergence properties of Kaczmarz’s method

DEFF Research Database (Denmark)

Elfving, Tommy; Hansen, Per Christian; Nikazad, Touraj

2014-01-01

Kaczmarz’s method—sometimes referred to as the algebraic reconstruction technique—is an iterative method that is widely used in tomographic imaging due to its favorable semi-convergence properties. Specifically, when applied to a problem with noisy data, during the early iterations it converges......-convergence of Kaczmarz’s method as well as its projected counterpart (and their block versions). To do this we study how the data errors propagate into the iteration vectors and we derive upper bounds for this noise propagation. Our bounds are compared with numerical results obtained from tomographic imaging....

Effect of aspect ratio and number of meshes on convergence of steady-state flow calculation using Newton-Raphson iterative procedure

International Nuclear Information System (INIS)

Shimizu, Takeshi

1997-01-01

In this paper, we discuss the stability of the convergence of a nonlinear iteration procedure which may be affected by a large number of numerical factors in a complicated way. A numerical parallel channel flow problem is solved using the finite element method and the Newton-Raphson iteration procedure. The numerical factors, on which we focus attention in this study, are the aspect ratio of the channel and the number of divided meshes. We propose a nondimensional value, which is obtained from the Reynolds number, the aspect ratio and the number of meshes. The results of the numerical experiment show that the threshold of divergence in the iteration is indicated clearly by the present nondimensional value. (author)

Strong Convergence Theorems of a New General Iterative Process with Meir-Keeler Contractions for a Countable Family of -Strict Pseudocontractions in -Uniformly Smooth Banach Spaces

Directory of Open Access Journals (Sweden)

Song Yanlai

2010-01-01

Full Text Available We introduce a new iterative scheme with Meir-Keeler contractions for strict pseudocontractions in -uniformly smooth Banach spaces. We also discuss the strong convergence theorems for the new iterative scheme in -uniformly smooth Banach space. Our results improve and extend the corresponding results announced by many others.

Convergence of an implicit iteration process for a finite family of asymptotically quasi-nonexpansive mappings in convex metric spaces

Directory of Open Access Journals (Sweden)

Gurucharan Singh Saluja

2010-01-01

Full Text Available In this paper, we give some necessary and sufficient conditions for an implicit iteration process with errors for a finite family of asymptotically quasi-nonexpansive mappings converging to a common fixed of the mappings in convex metric spaces. Our results extend and improve some recent results of Sun, Wittmann, Xu and Ori, and Zhou and Chang.

A rapid and convergent synthesis of the integrastatin core

KAUST Repository

Tadross, Pamela M.; Bugga, Pradeep; Stoltz, Brian M.

2011-01-01

The tetracyclic core of the integrastatin natural products has been prepared in a convergent and rapid manner. Our strategy relies upon a palladium(ii)-catalyzed oxidative cyclization to form the central [3.3.1]-dioxabicycle of the natural product core. Overall, the core has been completed in only 4 linear steps from known compounds. © 2011 The Royal Society of Chemistry.

Flyback CCM inverter for AC module applications: iterative learning control and convergence analysis

Science.gov (United States)

Lee, Sung-Ho; Kim, Minsung

2017-12-01

This paper presents an iterative learning controller (ILC) for an interleaved flyback inverter operating in continuous conduction mode (CCM). The flyback CCM inverter features small output ripple current, high efficiency, and low cost, and hence it is well suited for photovoltaic power applications. However, it exhibits the non-minimum phase behaviour, because its transfer function from control duty to output current has the right-half-plane (RHP) zero. Moreover, the flyback CCM inverter suffers from the time-varying grid voltage disturbance. Thus, conventional control scheme results in inaccurate output tracking. To overcome these problems, the ILC is first developed and applied to the flyback inverter operating in CCM. The ILC makes use of both predictive and current learning terms which help the system output to converge to the reference trajectory. We take into account the nonlinear averaged model and use it to construct the proposed controller. It is proven that the system output globally converges to the reference trajectory in the absence of state disturbances, output noises, or initial state errors. Numerical simulations are performed to validate the proposed control scheme, and experiments using 400-W AC module prototype are carried out to demonstrate its practical feasibility.

Local Convergence and Radius of Convergence for Modified Newton Method

Directory of Open Access Journals (Sweden)

Măruşter Ştefan

2017-12-01

Full Text Available We investigate the local convergence of modified Newton method, i.e., the classical Newton method in which the derivative is periodically re-evaluated. Based on the convergence properties of Picard iteration for demicontractive mappings, we give an algorithm to estimate the local radius of convergence for considered method. Numerical experiments show that the proposed algorithm gives estimated radii which are very close to or even equal with the best ones.

Properties of a class of block-iterative methods

International Nuclear Information System (INIS)

Elfving, Tommy; Nikazad, Touraj

2009-01-01

We study a class of block-iterative (BI) methods proposed in image reconstruction for solving linear systems. A subclass, symmetric block-iteration (SBI), is derived such that for this subclass both semi-convergence analysis and stopping-rules developed for fully simultaneous iteration apply. Also results on asymptotic convergence are given, e.g., BI exhibit cyclic convergence irrespective of the consistency of the linear system. Further it is shown that the limit points of SBI satisfy a weighted least-squares problem. We also present numerical results obtained using a trained stopping rule on SBI

Strong convergence of modified Ishikawa iterations for nonlinear ...

Indian Academy of Sciences (India)

interval [0, 1]. The second iteration process is referred to as Ishikawa's iteration process [11] which is .... Let E be a smooth Banach space with dual E∗ ..... and applications, in: Theory and Applications of Nonlinear Operators of Accretive and.

A fast iterative soft-thresholding algorithm for few-view CT reconstruction

Energy Technology Data Exchange (ETDEWEB)

Wu, Junfeng; Mou, Xuanqin; Zhang, Yanbo [Jiaotong Univ., Xi' an (China). Inst. of Image Processing and Pattern Recognition

2011-07-01

Iterative soft-thresholding algorithms with total variation regularization can produce high-quality reconstructions from few views and even in the presence of noise. However, these algorithms are known to converge quite slowly, with a proven theoretically global convergence rate O(1/k), where k is iteration number. In this paper, we present a fast iterative soft-thresholding algorithm for few-view fan beam CT reconstruction with a global convergence rate O(1/k{sup 2}), which is significantly faster than the iterative soft-thresholding algorithm. Simulation results demonstrate the superior performance of the proposed algorithm in terms of convergence speed and reconstruction quality. (orig.)

Convergence of mayer expansions

International Nuclear Information System (INIS)

Brydges, D.C.

1986-01-01

The tree graph bound of Battle and Federbush is extended and used to provide a simple criterion for the convergence of (iterated) Mayer expansions. As an application estimates on the radius of convergence of the Mayer expansion for the two-dimensional Yukawa gas (nonstable interaction) are obtained

Strong convergence with a modified iterative projection method for hierarchical fixed point problems and variational inequalities

Directory of Open Access Journals (Sweden)

Ibrahim Karahan

2016-04-01

Full Text Available Let C be a nonempty closed convex subset of a real Hilbert space H. Let {T_{n}}:C›H be a sequence of nearly nonexpansive mappings such that F:=?_{i=1}^{?}F(T_{i}?Ø. Let V:C›H be a ?-Lipschitzian mapping and F:C›H be a L-Lipschitzian and ?-strongly monotone operator. This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem. It is shown that under certain approximate assumptions on the operators and parameters, the modified iterative sequence {x_{n}} converges strongly to x^{*}?F which is also the unique solution of the following variational inequality: ?0, ?x?F. As a special case, this projection method can be used to find the minimum norm solution of above variational inequality; namely, the unique solution x^{*} to the quadratic minimization problem: x^{*}=argmin_{x?F}?x?². The results here improve and extend some recent corresponding results of other authors.

Strong Convergence of Hybrid Algorithm for Asymptotically Nonexpansive Mappings in Hilbert Spaces

Directory of Open Access Journals (Sweden)

Juguo Su

2012-01-01

Full Text Available The hybrid algorithms for constructing fixed points of nonlinear mappings have been studied extensively in recent years. The advantage of this methods is that one can prove strong convergence theorems while the traditional iteration methods just have weak convergence. In this paper, we propose two types of hybrid algorithm to find a common fixed point of a finite family of asymptotically nonexpansive mappings in Hilbert spaces. One is cyclic Mann's iteration scheme, and the other is cyclic Halpern's iteration scheme. We prove the strong convergence theorems for both iteration schemes.

Semi-convergence properties of Kaczmarz’s method

International Nuclear Information System (INIS)

Elfving, Tommy; Hansen, Per Christian; Nikazad, Touraj

2014-01-01

Kaczmarz’s method—sometimes referred to as the algebraic reconstruction technique—is an iterative method that is widely used in tomographic imaging due to its favorable semi-convergence properties. Specifically, when applied to a problem with noisy data, during the early iterations it converges very quickly toward a good approximation of the exact solution, and thus produces a regularized solution. While this property is generally accepted and utilized, there is surprisingly little theoretical justification for it. The purpose of this paper is to present insight into the semi-convergence of Kaczmarz’s method as well as its projected counterpart (and their block versions). To do this we study how the data errors propagate into the iteration vectors and we derive upper bounds for this noise propagation. Our bounds are compared with numerical results obtained from tomographic imaging. (paper)

A hyperpower iterative method for computing the generalized Drazin ...

Indian Academy of Sciences (India)

A quadratically convergent Newton-type iterative scheme is proposed for approximating the generalized Drazin inverse bd of the Banach algebra element b. Further, its extension into the form of the hyperpower iterative method of arbitrary order p ≤ 2 is presented. Convergence criteria along with the estimation of error ...

Iterative quantum-classical path integral with dynamically consistent state hopping

Energy Technology Data Exchange (ETDEWEB)

Walters, Peter L.; Makri, Nancy [Department of Chemistry, University of Illinois, Urbana, Illinois 61801 (United States)

2016-01-28

We investigate the convergence of iterative quantum-classical path integral calculations in sluggish environments strongly coupled to a quantum system. The number of classical trajectories, thus the computational cost, grows rapidly (exponentially, unless filtering techniques are employed) with the memory length included in the calculation. We argue that the choice of the (single) trajectory branch during the time preceding the memory interval can significantly affect the memory length required for convergence. At short times, the trajectory branch associated with the reactant state improves convergence by eliminating spurious memory. We also introduce an instantaneous population-based probabilistic scheme which introduces state-to-state hops in the retained pre-memory trajectory branch, and which is designed to choose primarily the trajectory branch associated with the reactant at early times, but to favor the product state more as the reaction progresses to completion. Test calculations show that the dynamically consistent state hopping scheme leads to accelerated convergence and a dramatic reduction of computational effort.

Convergence testing for MCNP5 Monte Carlo eigenvalue calculations

International Nuclear Information System (INIS)

Brown, F.; Nease, B.; Cheatham, J.

2007-01-01

Determining convergence of Monte Carlo criticality problems is complicated by the statistical noise inherent in the random, walks of the neutrons in each generation. The latest version of MCNP5 incorporates an important new tool for assessing convergence: the Shannon entropy of the fission source distribution, H src . Shannon entropy is a well-known concept from information theory and provides a single number for each iteration to help characterize convergence trends for the fission source distribution. MCNP5 computes H src for each iteration, and these values may be plotted to examine convergence trends. Convergence testing should include both k eff and H src , since the fission distribution will converge more slowly than k eff , especially when the dominance ratio is close to 1.0. (authors)

Strong Convergence for Hybrid Implicit S-Iteration Scheme of Nonexpansive and Strongly Pseudocontractive Mappings

Directory of Open Access Journals (Sweden)

Shin Min Kang

2014-01-01

Full Text Available Let K be a nonempty closed convex subset of a real Banach space E, let S:K→K be nonexpansive, and let  T:K→K be Lipschitz strongly pseudocontractive mappings such that p∈FS∩FT=x∈K:Sx=Tx=x and x-Sy≤Sx-Sy and x-Ty≤Tx-Ty for all x, y∈K. Let βn be a sequence in 0, 1 satisfying (i ∑n=1∞βn=∞; (ii limn→∞⁡βn=0. For arbitrary x0∈K, let xn be a sequence iteratively defined by xn=Syn, yn=1-βnxn-1+βnTxn, n≥1. Then the sequence xn converges strongly to a common fixed point p of S and T.

A general class of preconditioners for statistical iterative reconstruction of emission computed tomography

International Nuclear Information System (INIS)

Chinn, G.; Huang, S.C.

1997-01-01

A major drawback of statistical iterative image reconstruction for emission computed tomography is its high computational cost. The ill-posed nature of tomography leads to slow convergence for standard gradient-based iterative approaches such as the steepest descent or the conjugate gradient algorithm. In this paper new theory and methods for a class of preconditioners are developed for accelerating the convergence rate of iterative reconstruction. To demonstrate the potential of this class of preconditioners, a preconditioned conjugate gradient (PCG) iterative algorithm for weighted least squares reconstruction (WLS) was formulated for emission tomography. Using simulated positron emission tomography (PET) data of the Hoffman brain phantom, it was shown that the convergence rate of the PCG can reduce the number of iterations of the standard conjugate gradient algorithm by a factor of 2--8 times depending on the convergence criterion

Rapid alignment of nanotomography data using joint iterative reconstruction and reprojection.

Science.gov (United States)

Gürsoy, Doğa; Hong, Young P; He, Kuan; Hujsak, Karl; Yoo, Seunghwan; Chen, Si; Li, Yue; Ge, Mingyuan; Miller, Lisa M; Chu, Yong S; De Andrade, Vincent; He, Kai; Cossairt, Oliver; Katsaggelos, Aggelos K; Jacobsen, Chris

2017-09-18

As x-ray and electron tomography is pushed further into the nanoscale, the limitations of rotation stages become more apparent, leading to challenges in the alignment of the acquired projection images. Here we present an approach for rapid post-acquisition alignment of these projections to obtain high quality three-dimensional images. Our approach is based on a joint estimation of alignment errors, and the object, using an iterative refinement procedure. With simulated data where we know the alignment error of each projection image, our approach shows a residual alignment error that is a factor of a thousand smaller, and it reaches the same error level in the reconstructed image in less than half the number of iterations. We then show its application to experimental data in x-ray and electron nanotomography.

A Gradient Based Iterative Solutions for Sylvester Tensor Equations

Directory of Open Access Journals (Sweden)

Zhen Chen

2013-01-01

proposed by Ding and Chen, 2005, and by using tensor arithmetic concepts, an iterative algorithm and its modification are established to solve the Sylvester tensor equation. Convergence analysis indicates that the iterative solutions always converge to the exact solution for arbitrary initial value. Finally, some examples are provided to show that the proposed algorithms are effective.

Advances in iterative methods for nonlinear equations

CERN Document Server

Busquier, Sonia

2016-01-01

This book focuses on the approximation of nonlinear equations using iterative methods. Nine contributions are presented on the construction and analysis of these methods, the coverage encompassing convergence, efficiency, robustness, dynamics, and applications. Many problems are stated in the form of nonlinear equations, using mathematical modeling. In particular, a wide range of problems in Applied Mathematics and in Engineering can be solved by finding the solutions to these equations. The book reveals the importance of studying convergence aspects in iterative methods and shows that selection of the most efficient and robust iterative method for a given problem is crucial to guaranteeing a good approximation. A number of sample criteria for selecting the optimal method are presented, including those regarding the order of convergence, the computational cost, and the stability, including the dynamics. This book will appeal to researchers whose field of interest is related to nonlinear problems and equations...

Iterative solution of large linear systems

CERN Document Server

Young, David Matheson

1971-01-01

This self-contained treatment offers a systematic development of the theory of iterative methods. Its focal point resides in an analysis of the convergence properties of the successive overrelaxation (SOR) method, as applied to a linear system with a consistently ordered matrix. The text explores the convergence properties of the SOR method and related techniques in terms of the spectral radii of the associated matrices as well as in terms of certain matrix norms. Contents include a review of matrix theory and general properties of iterative methods; SOR method and stationary modified SOR meth

Iterative Schemes for Convex Minimization Problems with Constraints

Directory of Open Access Journals (Sweden)

Lu-Chuan Ceng

2014-01-01

Full Text Available We first introduce and analyze one implicit iterative algorithm for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: the generalized mixed equilibrium problem, the system of generalized equilibrium problems, and finitely many variational inclusions in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another implicit iterative algorithm for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.

Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear Systems.

Science.gov (United States)

Wei, Qinglai; Liu, Derong; Lin, Hanquan

2016-03-01

In this paper, a value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon undiscounted optimal control problems for discrete-time nonlinear systems. The present value iteration ADP algorithm permits an arbitrary positive semi-definite function to initialize the algorithm. A novel convergence analysis is developed to guarantee that the iterative value function converges to the optimal performance index function. Initialized by different initial functions, it is proven that the iterative value function will be monotonically nonincreasing, monotonically nondecreasing, or nonmonotonic and will converge to the optimum. In this paper, for the first time, the admissibility properties of the iterative control laws are developed for value iteration algorithms. It is emphasized that new termination criteria are established to guarantee the effectiveness of the iterative control laws. Neural networks are used to approximate the iterative value function and compute the iterative control law, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.

A transport synthetic acceleration method for transport iterations

International Nuclear Information System (INIS)

Ramone, G.L.; Adams, M.L.

1997-01-01

A family of transport synthetic acceleration (TSA) methods for iteratively solving within group scattering problems is presented. A single iteration in these schemes consists of a transport sweep followed by a low-order calculation, which itself is a simplified transport problem. The method for isotropic-scattering problems in X-Y geometry is described. The Fourier analysis of a model problem for equations with no spatial discretization shows that a previously proposed TSA method is unstable in two dimensions but that the modifications make it stable and rapidly convergent. The same procedure for discretized transport equations, using the step characteristic and two bilinear discontinuous methods, shows that discretization enhances TSA performance. A conjugate gradient algorithm for the low-order problem is described, a crude quadrature set for the low-order problem is proposed, and the number of low-order iterations per high-order sweep is limited to a relatively small value. These features lead to simple and efficient improvements to the method. TSA is tested on a series of problems, and a set of parameters is proposed for which the method behaves especially well. TSA achieves a substantial reduction in computational cost over source iteration, regardless of discretization parameters or material properties, and this reduction increases with the difficulty of the problem

Krylov iterative methods and synthetic acceleration for transport in binary statistical media

International Nuclear Information System (INIS)

Fichtl, Erin D.; Warsa, James S.; Prinja, Anil K.

2009-01-01

In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S 2 synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.

Comparison results on preconditioned SOR-type iterative method for Z-matrices linear systems

Science.gov (United States)

Wang, Xue-Zhong; Huang, Ting-Zhu; Fu, Ying-Ding

2007-09-01

In this paper, we present some comparison theorems on preconditioned iterative method for solving Z-matrices linear systems, Comparison results show that the rate of convergence of the Gauss-Seidel-type method is faster than the rate of convergence of the SOR-type iterative method.

Preconditioned iterations to calculate extreme eigenvalues

Energy Technology Data Exchange (ETDEWEB)

Brand, C.W.; Petrova, S. [Institut fuer Angewandte Mathematik, Leoben (Austria)

1994-12-31

Common iterative algorithms to calculate a few extreme eigenvalues of a large, sparse matrix are Lanczos methods or power iterations. They converge at a rate proportional to the separation of the extreme eigenvalues from the rest of the spectrum. Appropriate preconditioning improves the separation of the eigenvalues. Davidson`s method and its generalizations exploit this fact. The authors examine a preconditioned iteration that resembles a truncated version of Davidson`s method with a different preconditioning strategy.

Iterative numerical solution of scattering problems

International Nuclear Information System (INIS)

Tomio, L.; Adhikari, S.K.

1995-05-01

An iterative Neumann series method, employing a real auxiliary scattering integral equation, is used to calculate scattering lengths and phase shifts for the atomic Yukawa and exponential potentials. For these potentials the original Neumann series diverges. The present iterative method yields results that are far better, in convergence, stability and precision, than other momentum space methods. Accurate result is obtained in both cases with an estimated error of about 1 in 10 10 after some-8-10 iterations. (author). 31 refs, 2 tabs

Limited-angle three-dimensional reconstructions using Fourier transform iterations and Radon transform iterations

International Nuclear Information System (INIS)

Tam, K.C.; Perez-Mendez, V.

1981-01-01

The principles of limited-angle reconstruction of space-limited objects using the concepts of allowed cone and missing cone in Fourier space are discussed. The distortion of a point source resulting from setting the Fourier components in the missing cone to zero has been calculated mathematically, and its bearing on the convergence of an iteration scheme involving Fourier transforms has been analyzed in detail. it was found that the convergence rate is fairly insensitive to the position of the point source within the boundary of the object, apart from an edge effect which tends to enhance some parts of the boundary in reconstructing the object. Another iteration scheme involving Radon transforms was introduced and compared to the Fourier transform method in such areas as root mean square error, stability with respect to noise, and computer reconstruction time

Limited-angle 3-D reconstructions using Fourier transform iterations and Radon transform iterations

International Nuclear Information System (INIS)

Tam, K.C.; Perez-Mendez, V.

1979-12-01

The principles of limited-angle reconstruction of space-limited objects using the concepts of allowed cone and missing cone in Fourier space are discussed. The distortion of a point source resulting from setting the Fourier components in the missing cone to zero was calculated mathematically, and its bearing on the convergence of an iteration scheme involving Fourier transforms was analyzed in detail. It was found that the convergence rate is fairly insensitive to the position of the point source within the boundary of the object, apart from an edge effect that tends to enhance some parts of the boundary in reconstructing the object. Another iteration scheme involving Radon transforms was introduced and compared to the Fourier transform method in such areas as root mean square error, stability with respect to noise, and computer reconstruction time. 8 figures, 2 tables

Adaptive ILC with an adaptive iterative learnign gain

International Nuclear Information System (INIS)

Ashraf, S.; Muhammad, E.

2008-01-01

This paper describes the design of an adaptive ILC (Iterative Learning Controller) with an iterative learning gain. The basic idea behind ILC is that the information obtained from one trial can be used to improve the control input for the next trial. This proposed scheme extends the idea further and suggests that the information obtained from one trial could also be used to improve control algorithm parameters (gain matrices). The scheme converges faster than the conventional ILC. This convergence and hence number of iterations has always been an issue with ILC. This scheme because of its simple mathematical structure can easily be implemented with lower memory and simpler hardware as opposed to other such adaptive schemes which are computationally expensive. (author)

Unmatched Projector/Backprojector Pairs: Perturbation and Convergence Analysis

DEFF Research Database (Denmark)

Elfving, Tommy; Hansen, Per Christian

2018-01-01

methods in order to understand the role played by the nonmatch of the matrices. We also study the convergence properties of linear stationary iterations based on unmatched matrix pairs, leading to insight into the behavior of some important row-and column-oriented algebraic iterative methods. We conclude...

AIR Tools - A MATLAB package of algebraic iterative reconstruction methods

DEFF Research Database (Denmark)

Hansen, Per Christian; Saxild-Hansen, Maria

2012-01-01

We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods are impleme......We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods...... are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...

Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems

Czech Academy of Sciences Publication Activity Database

Morikuni, Keiichi; Hayami, K.

2015-01-01

Roč. 36, č. 1 (2015), s. 225-250 ISSN 0895-4798 Institutional support: RVO:67985807 Keywords : least squares problem * iterative methods * preconditioner * inner-outer iteration * GMRES method * stationary iterative method * rank-deficient problem Subject RIV: BA - General Mathematics Impact factor: 1.883, year: 2015

Iterative methods for weighted least-squares

Energy Technology Data Exchange (ETDEWEB)

Bobrovnikova, E.Y.; Vavasis, S.A. [Cornell Univ., Ithaca, NY (United States)

1996-12-31

A weighted least-squares problem with a very ill-conditioned weight matrix arises in many applications. Because of round-off errors, the standard conjugate gradient method for solving this system does not give the correct answer even after n iterations. In this paper we propose an iterative algorithm based on a new type of reorthogonalization that converges to the solution.

Iteration of ultrasound aberration correction methods

Science.gov (United States)

Maasoey, Svein-Erik; Angelsen, Bjoern; Varslot, Trond

2004-05-01

Aberration in ultrasound medical imaging is usually modeled by time-delay and amplitude variations concentrated on the transmitting/receiving array. This filter process is here denoted a TDA filter. The TDA filter is an approximation to the physical aberration process, which occurs over an extended part of the human body wall. Estimation of the TDA filter, and performing correction on transmit and receive, has proven difficult. It has yet to be shown that this method works adequately for severe aberration. Estimation of the TDA filter can be iterated by retransmitting a corrected signal and re-estimate until a convergence criterion is fulfilled (adaptive imaging). Two methods for estimating time-delay and amplitude variations in receive signals from random scatterers have been developed. One method correlates each element signal with a reference signal. The other method use eigenvalue decomposition of the receive cross-spectrum matrix, based upon a receive energy-maximizing criterion. Simulations of iterating aberration correction with a TDA filter have been investigated to study its convergence properties. A weak and strong human-body wall model generated aberration. Both emulated the human abdominal wall. Results after iteration improve aberration correction substantially, and both estimation methods converge, even for the case of strong aberration.

Iterative numerical solution of scattering problems

Energy Technology Data Exchange (ETDEWEB)

Tomio, L; Adhikari, S K

1995-05-01

An iterative Neumann series method, employing a real auxiliary scattering integral equation, is used to calculate scattering lengths and phase shifts for the atomic Yukawa and exponential potentials. For these potentials the original Neumann series diverges. The present iterative method yields results that are far better, in convergence, stability and precision, than other momentum space methods. Accurate result is obtained in both cases with an estimated error of about 1 in 10{sup 10} after some-8-10 iterations. (author). 31 refs, 2 tabs.

Face and Convergent Validity of Persian Version of Rapid Office Strain Assessment (ROSA Checklist

Directory of Open Access Journals (Sweden)

Afrouz Armal

2016-01-01

Full Text Available Objective: The aim of this work was the translation, cultural adaptation and validation of the Persian version of the Rapid Office Stress Assessment (ROSA checklist. Material & Methods: This methodological study was conducted according of IQOLA method. 100 office worker were selected in order to carry out a psychometric evaluation of the ROSA checklist by performing validity (face and convergent analyses. The convergent validity was evaluated using RULA checklist. Results: Upon major changes made to the ROSA checklist during the translation/cultural adaptation process, face validity of the Persian version was obtained. Spearman correlation coefficient between total score of ROSA check list and RULA checklist was significant (r=0.76, p<0.0001. Conclusion: The results indicated that the translated version of the ROSA checklist is acceptable in terms of face validity, convergent validity in target society, and hence provides a useful instrument for assessing Iranian office workers

A Framework for Generalising the Newton Method and Other Iterative Methods from Euclidean Space to Manifolds

OpenAIRE

Manton, Jonathan H.

2012-01-01

The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised Newton iteration needed establishing from first principles. The present paper presents a framework for generalising iterative methods from Euclidean space to manifolds that ensures local convergence rates are preserved. It applies to any (memoryless) iterative m...

Convergent WKB Series--How Can It be ?

International Nuclear Information System (INIS)

Ezawa, Hiroshi; Nakamura, Toru; Watanabe, Keiji

2008-01-01

Schroedinger equation for a polynomial potential with the highest order term having an even power and a positive coefficient is solved for high eigenvalues E n in two different ways after Liouville transformation, (a) converting the differential equation into integral equation and solving it iteratively and (b) by the WKB method. While the series solution in powers of 1/√(E n ) from (b) is known to diverge, we show that the one from (a) converges. We show then that asymptotic re-expansion of the convergent series from (a) agrees with the divergent series from (b). Actually, we have been able to show the agreement only up to order (1/√(E n )) 5 , but we believe that it holds to all orders. If this is true, the divergent WKB series can be reorganized into a convergent series, which is in fact obtained by the method of iteration (a)

Optimized iterative decoding method for TPC coded CPM

Science.gov (United States)

Ma, Yanmin; Lai, Penghui; Wang, Shilian; Xie, Shunqin; Zhang, Wei

2018-05-01

Turbo Product Code (TPC) coded Continuous Phase Modulation (CPM) system (TPC-CPM) has been widely used in aeronautical telemetry and satellite communication. This paper mainly investigates the improvement and optimization on the TPC-CPM system. We first add the interleaver and deinterleaver to the TPC-CPM system, and then establish an iterative system to iteratively decode. However, the improved system has a poor convergence ability. To overcome this issue, we use the Extrinsic Information Transfer (EXIT) analysis to find the optimal factors for the system. The experiments show our method is efficient to improve the convergence performance.

ITER towards the construction

International Nuclear Information System (INIS)

Shimomura, Y.

2005-01-01

The ITER Project has been significantly developed in the last few years in preparation for its construction. The ITER Participant's Negotiators have developed the Joint Implementation Agreement (JIA), ready for finalisation following selection of the construction site and nomination of the project's Director General. The ITER International Team and Participant Teams have continued technical and organisational preparations. Construction will be able to start immediately after the international ITER organisation is established, following signature of the JIA. The Project is strongly supported by the governments of the Participants as well as by the scientific community. The real negotiations, including siting and the final details of cost sharing, started in December 2003. The EU, with Cadarache, and Japan, with Rokkasho, have both promised large contributions to the project to strongly support their construction site proposals. Their wish to host ITER construction is too strong to allow convergence to a single site considering the ITER device in isolation. A broader collaboration among the Parties is therefore being contemplated, covering complementary activities to help accelerate fusion development towards a viable power source, and allow the Participants to reach a conclusion on ITER siting. This report reviews these preparations, and the status of negotiations

Convergence analysis of neutronic/thermohydraulic coupling behavior of SCWR

International Nuclear Information System (INIS)

Liu, Shichang; Cai, Jiejin

2013-01-01

The neutronic/thermohydraulic coupling (N–T coupling) calculations play an important role in core design and stability analysis. The traditional iterative method is not applicable for some new reactors (such as supercritical water-cooled reactor) which have intense N–T coupling behavior. In this paper, the mathematical model of N–T coupling based on fixed point theory is established firstly, with the convergent criterion, which can show the real-time convergence situation of iteration. Secondly, the self-adaptive relaxation factor and corresponding algorithm are proposed. Thirdly, the convergence analysis of the method of self-adaptive relaxation factor and common relaxation iteration has been performed, based on three calculation examples of SCWR fuel assembly. The results show that the proposed algorithm can efficiently reduce the calculation time and be adapted to different coupling cases and different initial distribution. It is easy to program, providing convenience for reactor design and analysis. This research also provides the theoretical basis for further study of N–T coupling behavior of new reactors such as SCWR

On iteration-separable method on the multichannel scattering theory

International Nuclear Information System (INIS)

Zubarev, A.L.; Ivlieva, I.N.; Podkopaev, A.P.

1975-01-01

The iteration-separable method for solving the equations of the Lippman-Schwinger type is suggested. Exponential convergency of the method of proven. Numerical convergency is clarified on the e + H scattering. Application of the method to the theory of multichannel scattering is formulated

Rapid divergence and convergence of life-history in experimentally evolved Drosophila melanogaster.

Science.gov (United States)

Burke, Molly K; Barter, Thomas T; Cabral, Larry G; Kezos, James N; Phillips, Mark A; Rutledge, Grant A; Phung, Kevin H; Chen, Richard H; Nguyen, Huy D; Mueller, Laurence D; Rose, Michael R

2016-09-01

Laboratory selection experiments are alluring in their simplicity, power, and ability to inform us about how evolution works. A longstanding challenge facing evolution experiments with metazoans is that significant generational turnover takes a long time. In this work, we present data from a unique system of experimentally evolved laboratory populations of Drosophila melanogaster that have experienced three distinct life-history selection regimes. The goal of our study was to determine how quickly populations of a certain selection regime diverge phenotypically from their ancestors, and how quickly they converge with independently derived populations that share a selection regime. Our results indicate that phenotypic divergence from an ancestral population occurs rapidly, within dozens of generations, regardless of that population's evolutionary history. Similarly, populations sharing a selection treatment converge on common phenotypes in this same time frame, regardless of selection pressures those populations may have experienced in the past. These patterns of convergence and divergence emerged much faster than expected, suggesting that intermediate evolutionary history has transient effects in this system. The results we draw from this system are applicable to other experimental evolution projects, and suggest that many relevant questions can be sufficiently tested on shorter timescales than previously thought. © 2016 The Author(s). Evolution © 2016 The Society for the Study of Evolution.

Convergence theorems for quasi-contractive mappings

International Nuclear Information System (INIS)

Chidume, C.E.

1992-01-01

It is proved that each of two well known fixed point iteration methods (the Mann and Ishikawa iteration methods) converges strongly, without any compactness assumption on the domain of the map, to the unique fixed point of a quasi-contractive map in real Banach spacers with property (U, α, m+1, m). These Banach spaces include the L p (or l p ) spaces, p ≥ 2. Our theorems generalize important known results. (author). 29 refs

Iterative optimization of quantum error correcting codes

International Nuclear Information System (INIS)

Reimpell, M.; Werner, R.F.

2005-01-01

We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit 'channel fidelity' in every step

Non-homogeneous updates for the iterative coordinate descent algorithm

Science.gov (United States)

Yu, Zhou; Thibault, Jean-Baptiste; Bouman, Charles A.; Sauer, Ken D.; Hsieh, Jiang

2007-02-01

Statistical reconstruction methods show great promise for improving resolution, and reducing noise and artifacts in helical X-ray CT. In fact, statistical reconstruction seems to be particularly valuable in maintaining reconstructed image quality when the dosage is low and the noise is therefore high. However, high computational cost and long reconstruction times remain as a barrier to the use of statistical reconstruction in practical applications. Among the various iterative methods that have been studied for statistical reconstruction, iterative coordinate descent (ICD) has been found to have relatively low overall computational requirements due to its fast convergence. This paper presents a novel method for further speeding the convergence of the ICD algorithm, and therefore reducing the overall reconstruction time for statistical reconstruction. The method, which we call nonhomogeneous iterative coordinate descent (NH-ICD) uses spatially non-homogeneous updates to speed convergence by focusing computation where it is most needed. Experimental results with real data indicate that the method speeds reconstruction by roughly a factor of two for typical 3D multi-slice geometries.

An efficient iteration strategy for the solution of the Euler equations

Science.gov (United States)

Walters, R. W.; Dwoyer, D. L.

1985-01-01

A line Gauss-Seidel (LGS) relaxation algorithm in conjunction with a one-parameter family of upwind discretizations of the Euler equations in two-dimensions is described. The basic algorithm has the property that convergence to the steady-state is quadratic for fully supersonic flows and linear otherwise. This is in contrast to the block ADI methods (either central or upwind differenced) and the upwind biased relaxation schemes, all of which converge linearly, independent of the flow regime. Moreover, the algorithm presented here is easily enhanced to detect regions of subsonic flow embedded in supersonic flow. This allows marching by lines in the supersonic regions, converging each line quadratically, and iterating in the subsonic regions, thus yielding a very efficient iteration strategy. Numerical results are presented for two-dimensional supersonic and transonic flows containing both oblique and normal shock waves which confirm the efficiency of the iteration strategy.

Iterative algorithms to approximate canonical Gabor windows: Computational aspects

DEFF Research Database (Denmark)

Janssen, A.J.E.M; Søndergaard, Peter Lempel

in the iteration step: norm scaling, where in each step the windows are normalized, and initial scaling where we only scale in the very beginning. Norm scaling leads to fast, but conditionally convergent methods, while initial scaling leads to unconditionally convergent methods, but with possibly suboptimal...

AIR Tools II: algebraic iterative reconstruction methods, improved implementation

DEFF Research Database (Denmark)

Hansen, Per Christian; Jørgensen, Jakob Sauer

2017-01-01

with algebraic iterative methods and their convergence properties. The present software is a much expanded and improved version of the package AIR Tools from 2012, based on a new modular design. In addition to improved performance and memory use, we provide more flexible iterative methods, a column-action method...

Estimation of POL-iteration methods in fast running DNBR code

Energy Technology Data Exchange (ETDEWEB)

Kwon, Hyuk; Kim, S. J.; Seo, K. W.; Hwang, D. H. [KAERI, Daejeon (Korea, Republic of)

2016-05-15

In this study, various root finding methods are applied to the POL-iteration module in SCOMS and POLiteration efficiency is compared with reference method. On the base of these results, optimum algorithm of POL iteration is selected. The POL requires the iteration until present local power reach limit power. The process to search the limiting power is equivalent with a root finding of nonlinear equation. POL iteration process involved in online monitoring system used a variant bisection method that is the most robust algorithm to find the root of nonlinear equation. The method including the interval accelerating factor and escaping routine out of ill-posed condition assured the robustness of SCOMS system. POL iteration module in SCOMS shall satisfy the requirement which is a minimum calculation time. For this requirement of calculation time, non-iterative algorithm, few channel model, simple steam table are implemented into SCOMS to improve the calculation time. MDNBR evaluation at a given operating condition requires the DNBR calculation at all axial locations. An increasing of POL-iteration number increased a calculation load of SCOMS significantly. Therefore, calculation efficiency of SCOMS is strongly dependent on the POL iteration number. In case study, the iterations of the methods have a superlinear convergence for finding limiting power but Brent method shows a quardratic convergence speed. These methods are effective and better than the reference bisection algorithm.

Convergence Analysis of the Preconditioned Group Splitting Methods in Boundary Value Problems

Directory of Open Access Journals (Sweden)

Norhashidah Hj. Mohd Ali

2012-01-01

Full Text Available The construction of a specific splitting-type preconditioner in block formulation applied to a class of group relaxation iterative methods derived from the centred and rotated (skewed finite difference approximations has been shown to improve the convergence rates of these methods. In this paper, we present some theoretical convergence analysis on this preconditioner specifically applied to the linear systems resulted from these group iterative schemes in solving an elliptic boundary value problem. We will theoretically show the relationship between the spectral radiuses of the iteration matrices of the preconditioned methods which affects the rate of convergence of these methods. We will also show that the spectral radius of the preconditioned matrices is smaller than that of their unpreconditioned counterparts if the relaxation parameter is in a certain optimum range. Numerical experiments will also be presented to confirm the agreement between the theoretical and the experimental results.

A simple eigenfunction convergence acceleration method for Monte Carlo

International Nuclear Information System (INIS)

Booth, Thomas E.

2011-01-01

Monte Carlo transport codes typically use a power iteration method to obtain the fundamental eigenfunction. The standard convergence rate for the power iteration method is the ratio of the first two eigenvalues, that is, k_2/k_1. Modifications to the power method have accelerated the convergence by explicitly calculating the subdominant eigenfunctions as well as the fundamental. Calculating the subdominant eigenfunctions requires using particles of negative and positive weights and appropriately canceling the negative and positive weight particles. Incorporating both negative weights and a ± weight cancellation requires a significant change to current transport codes. This paper presents an alternative convergence acceleration method that does not require modifying the transport codes to deal with the problems associated with tracking and cancelling particles of ± weights. Instead, only positive weights are used in the acceleration method. (author)

A fast iterative scheme for the linearized Boltzmann equation

Science.gov (United States)

Wu, Lei; Zhang, Jun; Liu, Haihu; Zhang, Yonghao; Reese, Jason M.

2017-06-01

Iterative schemes to find steady-state solutions to the Boltzmann equation are efficient for highly rarefied gas flows, but can be very slow to converge in the near-continuum flow regime. In this paper, a synthetic iterative scheme is developed to speed up the solution of the linearized Boltzmann equation by penalizing the collision operator L into the form L = (L + Nδh) - Nδh, where δ is the gas rarefaction parameter, h is the velocity distribution function, and N is a tuning parameter controlling the convergence rate. The velocity distribution function is first solved by the conventional iterative scheme, then it is corrected such that the macroscopic flow velocity is governed by a diffusion-type equation that is asymptotic-preserving into the Navier-Stokes limit. The efficiency of this new scheme is assessed by calculating the eigenvalue of the iteration, as well as solving for Poiseuille and thermal transpiration flows. We find that the fastest convergence of our synthetic scheme for the linearized Boltzmann equation is achieved when Nδ is close to the average collision frequency. The synthetic iterative scheme is significantly faster than the conventional iterative scheme in both the transition and the near-continuum gas flow regimes. Moreover, due to its asymptotic-preserving properties, the synthetic iterative scheme does not need high spatial resolution in the near-continuum flow regime, which makes it even faster than the conventional iterative scheme. Using this synthetic scheme, with the fast spectral approximation of the linearized Boltzmann collision operator, Poiseuille and thermal transpiration flows between two parallel plates, through channels of circular/rectangular cross sections and various porous media are calculated over the whole range of gas rarefaction. Finally, the flow of a Ne-Ar gas mixture is solved based on the linearized Boltzmann equation with the Lennard-Jones intermolecular potential for the first time, and the difference

Picard iterations for nonlinear Lipschitz strong pseudo-contractions in uniformly smooth Banach spaces

International Nuclear Information System (INIS)

Chidume, C.E.

1995-06-01

Suppose E is a real uniformly smooth Banach space and K is a nonempty closed convex and bounded subset of E, T:K → K is a Lipschitz pseudo-contraction. It is proved that the Picard iterates of a suitably defined operator converges strongly to the unique fixed point of T. Furthermore, this result also holds for the slightly larger class of Lipschitz strong hemi-contractions. Related results deal with strong convergence of the Picard iterates to the unique solution of operator equations involving Lipschitz strongly accretive maps. Apart from establishing strong convergence, our theorems give existence, uniqueness and convergence-rate which is at least as fast as a geometric progression. (author). 51 refs

Iterative solution of a nonlinear system arising in phase change problems

International Nuclear Information System (INIS)

Williams, M.A.

1987-01-01

We consider several iterative methods for solving the nonlinear system arising from an enthalpy formulation of a phase change problem. We present the formulation of the problem. Implicit discretization of the governing equations results in a mildly nonlinear system at each time step. We discuss solving this system using Jacobi, Gauss-Seidel, and SOR iterations and a new modified preconditioned conjugate gradient (MPCG) algorithm. The new MPCG algorithm and its properties are discussed in detail. Numerical results are presented comparing the performance of the SOR algorithm and the MPCG algorithm with 1-step SSOR preconditioning. The MPCG algorithm exhibits a superlinear rate of convergence. The SOR algorithm exhibits a linear rate of convergence. Thus, the MPCG algorithm requires fewer iterations to converge than the SOR algorithm. However in most cases, the SOR algorithm requires less total computation time than the MPCG algorithm. Hence, the SOR algorithm appears to be more appropriate for the class of problems considered. 27 refs., 11 figs

Fractal aspects and convergence of Newton`s method

Energy Technology Data Exchange (ETDEWEB)

Drexler, M. [Oxford Univ. Computing Lab. (United Kingdom)

1996-12-31

Newton`s Method is a widely established iterative algorithm for solving non-linear systems. Its appeal lies in its great simplicity, easy generalization to multiple dimensions and a quadratic local convergence rate. Despite these features, little is known about its global behavior. In this paper, we will explain a seemingly random global convergence pattern using fractal concepts and show that the behavior of the residual is entirely explicable. We will also establish quantitative results for the convergence rates. Knowing the mechanism of fractal generation, we present a stabilization to the orthodox Newton method that remedies the fractal behavior and improves convergence.

Semi-convergence and relaxation parameters for a class of SIRT algorithms

DEFF Research Database (Denmark)

Elfving, Tommy; Nikazad, Touraj; Hansen, Per Christian

2010-01-01

This paper is concerned with the Simultaneous Iterative Reconstruction Technique (SIRT) class of iterative methods for solving inverse problems. Based on a careful analysis of the semi-convergence behavior of these methods, we propose two new techniques to specify the relaxation parameters...

Convergence criteria for systems of nonlinear elliptic partial differential equations

International Nuclear Information System (INIS)

Sharma, R.K.

1986-01-01

This thesis deals with convergence criteria for a special system of nonlinear elliptic partial differential equations. A fixed-point algorithm is used, which iteratively solves one linearized elliptic partial differential equation at a time. Conditions are established that help foresee the convergence of the algorithm. Under reasonable hypotheses it is proved that the algorithm converges for such nonlinear elliptic systems. Extensive experimental results are reported and they show the algorithm converges in a wide variety of cases and the convergence is well correlated with the theoretical conditions introduced in this thesis

OpenMC In Situ Source Convergence Detection

Energy Technology Data Exchange (ETDEWEB)

Aldrich, Garrett Allen [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Univ. of California, Davis, CA (United States); Dutta, Soumya [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); The Ohio State Univ., Columbus, OH (United States); Woodring, Jonathan Lee [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2016-05-07

We designed and implemented an in situ version of particle source convergence for the OpenMC particle transport simulator. OpenMC is a Monte Carlo based-particle simulator for neutron criticality calculations. For the transport simulation to be accurate, source particles must converge on a spatial distribution. Typically, convergence is obtained by iterating the simulation by a user-settable, fixed number of steps, and it is assumed that convergence is achieved. We instead implement a method to detect convergence, using the stochastic oscillator for identifying convergence of source particles based on their accumulated Shannon Entropy. Using our in situ convergence detection, we are able to detect and begin tallying results for the full simulation once the proper source distribution has been confirmed. Our method ensures that the simulation is not started too early, by a user setting too optimistic parameters, or too late, by setting too conservative a parameter.

Iterative learning control with sampled-data feedback for robot manipulators

Directory of Open Access Journals (Sweden)

Delchev Kamen

2014-09-01

Full Text Available This paper deals with the improvement of the stability of sampled-data (SD feedback control for nonlinear multiple-input multiple-output time varying systems, such as robotic manipulators, by incorporating an off-line model based nonlinear iterative learning controller. The proposed scheme of nonlinear iterative learning control (NILC with SD feedback is applicable to a large class of robots because the sampled-data feedback is required for model based feedback controllers, especially for robotic manipulators with complicated dynamics (6 or 7 DOF, or more, while the feedforward control from the off-line iterative learning controller should be assumed as a continuous one. The robustness and convergence of the proposed NILC law with SD feedback is proven, and the derived sufficient condition for convergence is the same as the condition for a NILC with a continuous feedback control input. With respect to the presented NILC algorithm applied to a virtual PUMA 560 robot, simulation results are presented in order to verify convergence and applicability of the proposed learning controller with SD feedback controller attached

Some Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations

OpenAIRE

Soleimani, Farahnaz; Stanimirovi´c, Predrag; Soleymani, Fazlollah

2015-01-01

An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing generalized inverses is introduced and applied. The improvements of the hyper-power iterative scheme are based on its proper factorization, as well as on the possibility to accelerate the iterations in the initial phase of the convergence. Although the ...

Unmatched Projector/Backprojector Pairs: Perturbation and Convergence Analysis

DEFF Research Database (Denmark)

Elfving, Tommy; Hansen, Per Christian

2018-01-01

are not each other's transpose. Surprisingly, the influence of such errors in algebraic iterative reconstruction methods has received little attention in the literature. The goal of this paper is to perform a rigorous first-order perturbation analysis of the minimization problems underlying the algebraic...... methods in order to understand the role played by the nonmatch of the matrices. We also study the convergence properties of linear stationary iterations based on unmatched matrix pairs, leading to insight into the behavior of some important row-and column-oriented algebraic iterative methods. We conclude...

Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver

Science.gov (United States)

Shao, Meiyue; Aktulga, H. Metin; Yang, Chao; Ng, Esmond G.; Maris, Pieter; Vary, James P.

2018-01-01

We describe a number of recently developed techniques for improving the performance of large-scale nuclear configuration interaction calculations on high performance parallel computers. We show the benefit of using a preconditioned block iterative method to replace the Lanczos algorithm that has traditionally been used to perform this type of computation. The rapid convergence of the block iterative method is achieved by a proper choice of starting guesses of the eigenvectors and the construction of an effective preconditioner. These acceleration techniques take advantage of special structure of the nuclear configuration interaction problem which we discuss in detail. The use of a block method also allows us to improve the concurrency of the computation, and take advantage of the memory hierarchy of modern microprocessors to increase the arithmetic intensity of the computation relative to data movement. We also discuss the implementation details that are critical to achieving high performance on massively parallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to three times faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.

Online Classrooms: Powerful Tools for Rapid-Iteration Pedagogical Improvements

Science.gov (United States)

Horodyskyj, L.; Semken, S.; Anbar, A.; Buxner, S.

2015-11-01

Online education offers the opportunity to reach a variety of students including non-traditional and geographically diverse students. Research has shown that online courses modeled after traditional lecture-exam courses are ineffective. Over the past three years, Arizona State University developed and offered Habitable Worlds, an online-only astrobiology lab course featuring active learning tools. The course is offered in an intelligent tutoring system (ITS) that records a wealth of student data. In analyzing data from the Fall 2013 offering of the course, we were able to identify pre-post quiz results that were suboptimal and where in the lesson and how precisely students were missing concepts. The problem areas were redesigned, and the improved lessons were deployed a few months later. We saw significant improvements in our pre-post quiz results due to the implemented changes. This demonstrates the effectiveness of using robust ITS not only to present content online, but to provide instantaneous data for rapid iteration and improvement of existing content.

A theoretical study on a convergence problem of nodal methods

Energy Technology Data Exchange (ETDEWEB)

Shaohong, Z.; Ziyong, L. [Shanghai Jiao Tong Univ., 1954 Hua Shan Road, Shanghai, 200030 (China); Chao, Y. A. [Westinghouse Electric Company, P. O. Box 355, Pittsburgh, PA 15230-0355 (United States)

2006-07-01

The effectiveness of modern nodal methods is largely due to its use of the information from the analytical flux solution inside a homogeneous node. As a result, the nodal coupling coefficients depend explicitly or implicitly on the evolving Eigen-value of a problem during its solution iteration process. This poses an inherently non-linear matrix Eigen-value iteration problem. This paper points out analytically that, whenever the half wave length of an evolving node interior analytic solution becomes smaller than the size of that node, this non-linear iteration problem can become inherently unstable and theoretically can always be non-convergent or converge to higher order harmonics. This phenomenon is confirmed, demonstrated and analyzed via the simplest 1-D problem solved by the simplest analytic nodal method, the Analytic Coarse Mesh Finite Difference (ACMFD, [1]) method. (authors)

A multi-level surface rebalancing approach for efficient convergence acceleration of 3D full core multi-group fine grid nodal diffusion iterations

International Nuclear Information System (INIS)

Geemert, René van

2014-01-01

Highlights: • New type of multi-level rebalancing approach for nodal transport. • Generally improved and more mesh-independent convergence behavior. • Importance for intended regime of 3D pin-by-pin core computations. - Abstract: A new multi-level surface rebalancing (MLSR) approach has been developed, aimed at enabling an improved non-linear acceleration of nodal flux iteration convergence in 3D steady-state and transient reactor simulation. This development is meant specifically for anticipating computational needs for solving envisaged multi-group diffusion-like SP N calculations with enhanced mesh resolution (i.e. 3D multi-box up to 3D pin-by-pin grid). For the latter grid refinement regime, the previously available multi-level coarse mesh rebalancing (MLCMR) strategy has been observed to become increasingly inefficient with increasing 3D mesh resolution. Furthermore, for very fine 3D grids that feature a very fine axial mesh as well, non-convergence phenomena have been observed to emerge. In the verifications pursued up to now, these problems have been resolved by the new approach. The novelty arises from taking the interface current balance equations defined over all Cartesian box edges, instead of the nodal volume-integrated process-rate balance equation, as an appropriate restriction basis for setting up multi-level acceleration of fine grid interface current iterations. The new restriction strategy calls for the use of a newly derived set of adjoint spectral equations that are needed for computing a limited set of spectral response vectors per node. This enables a straightforward determination of group-condensed interface current spectral coupling operators that are of crucial relevance in the new rebalancing setup. Another novelty in the approach is a new variational method for computing the neutronic eigenvalue. Within this context, the latter is treated as a control parameter for driving another, newly defined and numerically more fundamental

Multistep Hybrid Iterations for Systems of Generalized Equilibria with Constraints of Several Problems

Directory of Open Access Journals (Sweden)

Lu-Chuan Ceng

2014-01-01

Full Text Available We first introduce and analyze one multistep iterative algorithm by hybrid shrinking projection method for finding a solution of the system of generalized equilibria with constraints of several problems: the generalized mixed equilibrium problem, finitely many variational inclusions, the minimization problem for a convex and continuously Fréchet differentiable functional, and the fixed-point problem of an asymptotically strict pseudocontractive mapping in the intermediate sense in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another multistep iterative algorithm involving no shrinking projection method and derive its weak convergence under mild assumptions.

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

Directory of Open Access Journals (Sweden)

Fatemeh Mohammad

2014-05-01

Full Text Available In this paper‎, ‎we represent an inexact inverse‎ ‎subspace iteration method for computing a few eigenpairs of the‎ ‎generalized eigenvalue problem $Ax = \\lambda Bx$[Q.~Ye and P.~Zhang‎, ‎Inexact inverse subspace iteration for generalized eigenvalue‎ ‎problems‎, ‎Linear Algebra and its Application‎, ‎434 (2011 1697-1715‎‎]‎. ‎In particular‎, ‎the linear convergence property of the inverse‎ ‎subspace iteration is preserved‎.

Parallel S/sub n/ iteration schemes

International Nuclear Information System (INIS)

Wienke, B.R.; Hiromoto, R.E.

1986-01-01

The iterative, multigroup, discrete ordinates (S/sub n/) technique for solving the linear transport equation enjoys widespread usage and appeal. Serial iteration schemes and numerical algorithms developed over the years provide a timely framework for parallel extension. On the Denelcor HEP, the authors investigate three parallel iteration schemes for solving the one-dimensional S/sub n/ transport equation. The multigroup representation and serial iteration methods are also reviewed. This analysis represents a first attempt to extend serial S/sub n/ algorithms to parallel environments and provides good baseline estimates on ease of parallel implementation, relative algorithm efficiency, comparative speedup, and some future directions. The authors examine ordered and chaotic versions of these strategies, with and without concurrent rebalance and diffusion acceleration. Two strategies efficiently support high degrees of parallelization and appear to be robust parallel iteration techniques. The third strategy is a weaker parallel algorithm. Chaotic iteration, difficult to simulate on serial machines, holds promise and converges faster than ordered versions of the schemes. Actual parallel speedup and efficiency are high and payoff appears substantial

Predictive Variable Gain Iterative Learning Control for PMSM

Directory of Open Access Journals (Sweden)

Huimin Xu

2015-01-01

Full Text Available A predictive variable gain strategy in iterative learning control (ILC is introduced. Predictive variable gain iterative learning control is constructed to improve the performance of trajectory tracking. A scheme based on predictive variable gain iterative learning control for eliminating undesirable vibrations of PMSM system is proposed. The basic idea is that undesirable vibrations of PMSM system are eliminated from two aspects of iterative domain and time domain. The predictive method is utilized to determine the learning gain in the ILC algorithm. Compression mapping principle is used to prove the convergence of the algorithm. Simulation results demonstrate that the predictive variable gain is superior to constant gain and other variable gains.

Inexact Newton–Landweber iteration for solving nonlinear inverse problems in Banach spaces

International Nuclear Information System (INIS)

Jin, Qinian

2012-01-01

By making use of duality mappings, we formulate an inexact Newton–Landweber iteration method for solving nonlinear inverse problems in Banach spaces. The method consists of two components: an outer Newton iteration and an inner scheme providing the increments by applying the Landweber iteration in Banach spaces to the local linearized equations. It has the advantage of reducing computational work by computing more cheap steps in each inner scheme. We first prove a convergence result for the exact data case. When the data are given approximately, we terminate the method by a discrepancy principle and obtain a weak convergence result. Finally, we test the method by reporting some numerical simulations concerning the sparsity recovery and the noisy data containing outliers. (paper)

A Method for Speeding Up Value Iteration in Partially Observable Markov Decision Processes

OpenAIRE

Zhang, Nevin Lianwen; Lee, Stephen S.; Zhang, Weihong

2013-01-01

We present a technique for speeding up the convergence of value iteration for partially observable Markov decisions processes (POMDPs). The underlying idea is similar to that behind modified policy iteration for fully observable Markov decision processes (MDPs). The technique can be easily incorporated into any existing POMDP value iteration algorithms. Experiments have been conducted on several test problems with one POMDP value iteration algorithm called incremental pruning. We find that th...

Iterative approach to effective interactions in nuclei

International Nuclear Information System (INIS)

Heiss, W.D.

1982-01-01

Starting from a non-linear equation for the effective interaction in a model space, various iteration procedures converge to a correct solution irrespective of the presence of intruder states. The physical significance of the procedures and the respective solution is discussed

Modified Spectral Projected Subgradient Method: Convergence Analysis and Momentum Parameter Heuristics

Directory of Open Access Journals (Sweden)

Milagros Loreto

2016-09-01

Full Text Available The Modified Spectral Projected Subgradient (MSPS was proposed to solve Langrangen Dual Problems, and its convergence was shown when the momentum term was zero. The MSPS uses a momentum term in order to speed up its convergence. The momentum term is built on the multiplication of a momentum parameter and the direction of the previous iterate. In this work, we show convergence when the momentum parameter is a non-zero constant. We also propose heuristics to choose the momentum parameter intended to avoid the Zigzagging Phenomenon of Kind I. This phenomenon is present in the MSPS when at an iterate the subgradient forms an obtuse angle with the previous direction. We identify and diminish the Zigzagging Phenomenon of Kind I on Setcovering problems, and compare our numerical results to those of the original MSPS algorithm.

A Fast Newton-Shamanskii Iteration for a Matrix Equation Arising from M/G/1-Type Markov Chains

Directory of Open Access Journals (Sweden)

Pei-Chang Guo

2017-01-01

Full Text Available For the nonlinear matrix equations arising in the analysis of M/G/1-type and GI/M/1-type Markov chains, the minimal nonnegative solution G or R can be found by Newton-like methods. We prove monotone convergence results for the Newton-Shamanskii iteration for this class of equations. Starting with zero initial guess or some other suitable initial guess, the Newton-Shamanskii iteration provides a monotonically increasing sequence of nonnegative matrices converging to the minimal nonnegative solution. A Schur decomposition method is used to accelerate the Newton-Shamanskii iteration. Numerical examples illustrate the effectiveness of the Newton-Shamanskii iteration.

Convergence analysis for column-action methods in image reconstruction

DEFF Research Database (Denmark)

Elfving, Tommy; Hansen, Per Christian; Nikazad, Touraj

2016-01-01

Column-oriented versions of algebraic iterative methods are interesting alternatives to their row-version counterparts: they converge to a least squares solution, and they provide a basis for saving computational work by skipping small updates. In this paper we consider the case of noise-free data....... We present a convergence analysis of the column algorithms, we discuss two techniques (loping and flagging) for reducing the work, and we establish some convergence results for methods that utilize these techniques. The performance of the algorithms is illustrated with numerical examples from...

AIR Tools - A MATLAB Package of Algebraic Iterative Reconstruction Techniques

DEFF Research Database (Denmark)

Hansen, Per Christian; Saxild-Hansen, Maria

This collection of MATLAB software contains implementations of several Algebraic Iterative Reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods...... are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...

Adaptive dynamic programming for discrete-time linear quadratic regulation based on multirate generalised policy iteration

Science.gov (United States)

Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho

2018-06-01

In this paper, we propose two multirate generalised policy iteration (GPI) algorithms applied to discrete-time linear quadratic regulation problems. The proposed algorithms are extensions of the existing GPI algorithm that consists of the approximate policy evaluation and policy improvement steps. The two proposed schemes, named heuristic dynamic programming (HDP) and dual HDP (DHP), based on multirate GPI, use multi-step estimation (M-step Bellman equation) at the approximate policy evaluation step for estimating the value function and its gradient called costate, respectively. Then, we show that these two methods with the same update horizon can be considered equivalent in the iteration domain. Furthermore, monotonically increasing and decreasing convergences, so called value iteration (VI)-mode and policy iteration (PI)-mode convergences, are proved to hold for the proposed multirate GPIs. Further, general convergence properties in terms of eigenvalues are also studied. The data-driven online implementation methods for the proposed HDP and DHP are demonstrated and finally, we present the results of numerical simulations performed to verify the effectiveness of the proposed methods.

Iterative procedures for wave propagation in the frequency domain

Energy Technology Data Exchange (ETDEWEB)

Kim, Seongjai [Rice Univ., Houston, TX (United States); Symes, W.W.

1996-12-31

A parallelizable two-grid iterative algorithm incorporating a domain decomposition (DD) method is considered for solving the Helmholtz problem. Since a numerical method requires choosing at least 6 to 8 grid points per wavelength, the coarse-grid problem itself is not an easy task for high frequency applications. We solve the coarse-grid problem using a nonoverlapping DD method. To accelerate the convergence of the iteration, an artificial damping technique and relaxation parameters are introduced. Automatic strategies for finding efficient parameters are discussed. Numerical results are presented to show the effectiveness of the method. It is numerically verified that the rate of convergence of the algorithm depends on the wave number sub-linearly and does not deteriorate as the mesh size decreases.

Convergence of iterative image reconstruction algorithms for Digital Breast Tomosynthesis

DEFF Research Database (Denmark)

Sidky, Emil; Jørgensen, Jakob Heide; Pan, Xiaochuan

2012-01-01

Most iterative image reconstruction algorithms are based on some form of optimization, such as minimization of a data-fidelity term plus an image regularizing penalty term. While achieving the solution of these optimization problems may not directly be clinically relevant, accurate optimization s...

A convergent blind deconvolution method for post-adaptive-optics astronomical imaging

International Nuclear Information System (INIS)

Prato, M; Camera, A La; Bertero, M; Bonettini, S

2013-01-01

In this paper, we propose a blind deconvolution method which applies to data perturbed by Poisson noise. The objective function is a generalized Kullback–Leibler (KL) divergence, depending on both the unknown object and unknown point spread function (PSF), without the addition of regularization terms; constrained minimization, with suitable convex constraints on both unknowns, is considered. The problem is non-convex and we propose to solve it by means of an inexact alternating minimization method, whose global convergence to stationary points of the objective function has been recently proved in a general setting. The method is iterative and each iteration, also called outer iteration, consists of alternating an update of the object and the PSF by means of a fixed number of iterations, also called inner iterations, of the scaled gradient projection (SGP) method. Therefore, the method is similar to other proposed methods based on the Richardson–Lucy (RL) algorithm, with SGP replacing RL. The use of SGP has two advantages: first, it allows one to prove global convergence of the blind method; secondly, it allows the introduction of different constraints on the object and the PSF. The specific constraint on the PSF, besides non-negativity and normalization, is an upper bound derived from the so-called Strehl ratio (SR), which is the ratio between the peak value of an aberrated versus a perfect wavefront. Therefore, a typical application, but not a unique one, is to the imaging of modern telescopes equipped with adaptive optics systems for the partial correction of the aberrations due to atmospheric turbulence. In the paper, we describe in detail the algorithm and we recall the results leading to its convergence. Moreover, we illustrate its effectiveness by means of numerical experiments whose results indicate that the method, pushed to convergence, is very promising in the reconstruction of non-dense stellar clusters. The case of more complex astronomical targets

Iterative reconstruction methods for Thermo-acoustic Tomography

International Nuclear Information System (INIS)

Marinesque, Sebastien

2012-01-01

We define, study and implement various iterative reconstruction methods for Thermo-acoustic Tomography (TAT): the Back and Forth Nudging (BFN), easy to implement and to use, a variational technique (VT) and the Back and Forth SEEK (BF-SEEK), more sophisticated, and a coupling method between Kalman filter (KF) and Time Reversal (TR). A unified formulation is explained for the sequential techniques aforementioned that defines a new class of inverse problem methods: the Back and Forth Filters (BFF). In addition to existence and uniqueness (particularly for backward solutions), we study many frameworks that ensure and characterize the convergence of the algorithms. Thus we give a general theoretical framework for which the BFN is a well-posed problem. Then, in application to TAT, existence and uniqueness of its solutions and geometrical convergence of the algorithm are proved, and an explicit convergence rate and a description of its numerical behaviour are given. Next, theoretical and numerical studies of more general and realistic framework are led, namely different objects, speeds (with or without trapping), various sensor configurations and samplings, attenuated equations or external sources. Then optimal control and best estimate tools are used to characterize the BFN convergence and converging feedbacks for BFF, under observability assumptions. Finally, we compare the most flexible and efficient current techniques (TR and an iterative variant) with our various BFF and the VT in several experiments. Thus, robust, with different possible complexities and flexible, the methods that we propose are very interesting reconstruction techniques, particularly in TAT and when observations are degraded. (author) [fr

Milestones in the Development of Iterative Solution Methods

Directory of Open Access Journals (Sweden)

Owe Axelsson

2010-01-01

Full Text Available Iterative solution methods to solve linear systems of equations were originally formulated as basic iteration methods of defect-correction type, commonly referred to as Richardson's iteration method. These methods developed further into various versions of splitting methods, including the successive overrelaxation (SOR method. Later, immensely important developments included convergence acceleration methods, such as the Chebyshev and conjugate gradient iteration methods and preconditioning methods of various forms. A major strive has been to find methods with a total computational complexity of optimal order, that is, proportional to the degrees of freedom involved in the equation. Methods that have turned out to have been particularly important for the further developments of linear equation solvers are surveyed. Some of them are presented in greater detail.

An Iteration Scheme for Contraction Mappings with an Application to Synchronization of Discrete Logistic Maps

Directory of Open Access Journals (Sweden)

Ke Ding

2017-01-01

Full Text Available This paper deals with designing a new iteration scheme associated with a given scheme for contraction mappings. This new scheme has a similar structure to that of the given scheme, in which those two iterative schemes converge to the same fixed point of the given contraction mapping. The positive influence of feedback parameters on the convergence rate of this new scheme is investigated. Moreover, the derived convergence and comparison results can be extended to nonexpansive mappings. As an application, the derived results are utilized to study the synchronization of logistic maps. Two illustrated examples are used to reveal the effectiveness of our results.

Rapid Convergence and Subduction at the Intersections of Fronts

Science.gov (United States)

D'Asaro, E. A.

2016-12-01

An array of 300 surface drifters drogued to follow the top 0.6m of the ocean were deployed in the northern Gulf of Mexico near the Deep Water Horizon spill site in January of 2016. As expected, the array spread from its initial 15x15km scale with the second moment increasing at a rate roughly consistent with historical dispersion curves. More surprisingly, a large fraction of the drifters accumulated within a km-scale submesoscale eddy and grouped into clusters often only a few meters apart. This occurred due to surface convergence, as opposed to purely confluence, with convergence rates of many f feeding downward-going subduction zones with vertical velocities of a few centimeters per second. These convergences preferentially occurred at density fronts and in particular at junctions of density fronts on the periphery of submesoscale eddies. These observations complement the traditional view of lateral dispersion of surface particles by mesoscale eddies with a competing submesocale convergence and provide direct observations of the strong vertical exchanges associated with submesoscale eddies and fronts.

Iterative integral parameter identification of a respiratory mechanics model.

Science.gov (United States)

Schranz, Christoph; Docherty, Paul D; Chiew, Yeong Shiong; Möller, Knut; Chase, J Geoffrey

2012-07-18

Patient-specific respiratory mechanics models can support the evaluation of optimal lung protective ventilator settings during ventilation therapy. Clinical application requires that the individual's model parameter values must be identified with information available at the bedside. Multiple linear regression or gradient-based parameter identification methods are highly sensitive to noise and initial parameter estimates. Thus, they are difficult to apply at the bedside to support therapeutic decisions. An iterative integral parameter identification method is applied to a second order respiratory mechanics model. The method is compared to the commonly used regression methods and error-mapping approaches using simulated and clinical data. The clinical potential of the method was evaluated on data from 13 Acute Respiratory Distress Syndrome (ARDS) patients. The iterative integral method converged to error minima 350 times faster than the Simplex Search Method using simulation data sets and 50 times faster using clinical data sets. Established regression methods reported erroneous results due to sensitivity to noise. In contrast, the iterative integral method was effective independent of initial parameter estimations, and converged successfully in each case tested. These investigations reveal that the iterative integral method is beneficial with respect to computing time, operator independence and robustness, and thus applicable at the bedside for this clinical application.

Projection-iteration methods for solving nonlinear operator equations

International Nuclear Information System (INIS)

Nguyen Minh Chuong; Tran thi Lan Anh; Tran Quoc Binh

1989-09-01

In this paper, the authors investigate a nonlinear operator equation in uniformly convex Banach spaces as in metric spaces by using stationary and nonstationary generalized projection-iteration methods. Convergence theorems in the strong and weak sense were established. (author). 7 refs

Iterative Runge–Kutta-type methods for nonlinear ill-posed problems

International Nuclear Information System (INIS)

Böckmann, C; Pornsawad, P

2008-01-01

We present a regularization method for solving nonlinear ill-posed problems by applying the family of Runge–Kutta methods to an initial value problem, in particular, to the asymptotical regularization method. We prove that the developed iterative regularization method converges to a solution under certain conditions and with a general stopping rule. Some particular iterative regularization methods are numerically implemented. Numerical results of the examples show that the developed Runge–Kutta-type regularization methods yield stable solutions and that particular implicit methods are very efficient in saving iteration steps

Discounted Markov games : generalized policy iteration method

NARCIS (Netherlands)

Wal, van der J.

1978-01-01

In this paper, we consider two-person zero-sum discounted Markov games with finite state and action spaces. We show that the Newton-Raphson or policy iteration method as presented by Pollats-chek and Avi-Itzhak does not necessarily converge, contradicting a proof of Rao, Chandrasekaran, and Nair.

Comparison of Non-overlapping and Overlapping Local/Global Iteration Schemes for Whole-Core Deterministic Transport Calculation

International Nuclear Information System (INIS)

Yuk, Seung Su; Cho, Bumhee; Cho, Nam Zin

2013-01-01

In the case of deterministic transport model, fixed-k problem formulation is necessary and the overlapping local domain is chosen. However, as mentioned in, the partial current-based Coarse Mesh Finite Difference (p-CMFD) procedure enables also non-overlapping local/global (NLG) iteration. In this paper, NLG iteration is combined with p-CMFD and with CMFD (augmented with a concept of p-CMFD), respectively, and compared to OLG iteration on a 2-D test problem. Non-overlapping local/global iteration with p-CMFD and CMFD global calculation is introduced and tested on a 2-D deterministic transport problem. The modified C5G7 problem is analyzed with both NLG and OLG methods and the solutions converge to the reference solution except for some cases of NLG with CMFD. NLG with CMFD gives the best performance if the solution converges. But if fission-source iteration in local calculation is not enough, it is prone to diverge. The p-CMFD global solver gives unconditional convergence (for both OLG and NLG). A study of switching scheme is in progress, where NLG/p-CMFD is used as 'starter' and then switched to NLG/CMFD to render the whole-core transport calculation more efficient and robust. Parallel computation is another obvious future work

The General Iterative Methods for Asymptotically Nonexpansive Semigroups in Banach Spaces

Directory of Open Access Journals (Sweden)

Rabian Wangkeeree

2012-01-01

Full Text Available We introduce the general iterative methods for finding a common fixed point of asymptotically nonexpansive semigroups which is a unique solution of some variational inequalities. We prove the strong convergence theorems of such iterative scheme in a reflexive Banach space which admits a weakly continuous duality mapping. The main result extends various results existing in the current literature.

Milestones in the Development of Iterative Solution Methods

Czech Academy of Sciences Publication Activity Database

Axelsson, Owe

2010-01-01

Roč. 2010, - (2010), s. 1-33 ISSN 2090-0147 Institutional research plan: CEZ:AV0Z30860518 Keywords : iterative solution methods * convergence acceleration methods * linear systems Subject RIV: JC - Computer Hardware ; Software http://www.hindawi.com/journals/jece/2010/972794.html

Formulations to overcome the divergence of iterative method of fixed-point in nonlinear equations solution

Directory of Open Access Journals (Sweden)

Wilson Rodríguez Calderón

2015-04-01

Full Text Available When we need to determine the solution of a nonlinear equation there are two options: closed-methods which use intervals that contain the root and during the iterative process reduce the size of natural way, and, open-methods that represent an attractive option as they do not require an initial interval enclosure. In general, we know open-methods are more efficient computationally though they do not always converge. In this paper we are presenting a divergence case analysis when we use the method of fixed point iteration to find the normal height in a rectangular channel using the Manning equation. To solve this problem, we propose applying two strategies (developed by authors that allow to modifying the iteration function making additional formulations of the traditional method and its convergence theorem. Although Manning equation is solved with other methods like Newton when we use the iteration method of fixed-point an interesting divergence situation is presented which can be solved with a convergence higher than quadratic over the initial iterations. The proposed strategies have been tested in two cases; a study of divergence of square root of real numbers was made previously by authors for testing. Results in both cases have been successful. We present comparisons because are important for seeing the advantage of proposed strategies versus the most representative open-methods.

Low-memory iterative density fitting.

Science.gov (United States)

Grajciar, Lukáš

2015-07-30

A new low-memory modification of the density fitting approximation based on a combination of a continuous fast multipole method (CFMM) and a preconditioned conjugate gradient solver is presented. Iterative conjugate gradient solver uses preconditioners formed from blocks of the Coulomb metric matrix that decrease the number of iterations needed for convergence by up to one order of magnitude. The matrix-vector products needed within the iterative algorithm are calculated using CFMM, which evaluates them with the linear scaling memory requirements only. Compared with the standard density fitting implementation, up to 15-fold reduction of the memory requirements is achieved for the most efficient preconditioner at a cost of only 25% increase in computational time. The potential of the method is demonstrated by performing density functional theory calculations for zeolite fragment with 2592 atoms and 121,248 auxiliary basis functions on a single 12-core CPU workstation. © 2015 Wiley Periodicals, Inc.

The solution of radiative transfer problems in molecular bands without the LTE assumption by accelerated lambda iteration methods

Science.gov (United States)

Kutepov, A. A.; Kunze, D.; Hummer, D. G.; Rybicki, G. B.

1991-01-01

An iterative method based on the use of approximate transfer operators, which was designed initially to solve multilevel NLTE line formation problems in stellar atmospheres, is adapted and applied to the solution of the NLTE molecular band radiative transfer in planetary atmospheres. The matrices to be constructed and inverted are much smaller than those used in the traditional Curtis matrix technique, which makes possible the treatment of more realistic problems using relatively small computers. This technique converges much more rapidly than straightforward iteration between the transfer equation and the equations of statistical equilibrium. A test application of this new technique to the solution of NLTE radiative transfer problems for optically thick and thin bands (the 4.3 micron CO2 band in the Venusian atmosphere and the 4.7 and 2.3 micron CO bands in the earth's atmosphere) is described.

Impact of element-level static condensation on iterative solver performance

KAUST Repository

Pardo, D.

2015-10-02

This paper provides theoretical estimates that quantify and clarify the savings associated to the use of element-level static condensation as a first step of an iterative solver. These estimates are verified numerically. The numerical evidence shows that static condensation at the element level is beneficial for higher-order methods. For lower-order methods or when the number of iterations required for convergence is low, the setup cost of the elimination as well as its implementation may offset the benefits obtained during the iteration process. However, as the iteration count (e.g., above 50) or the polynomial order (e.g., above cubics) grows, the benefits of element-level static condensation are significant.

An efficient iterative grand canonical Monte Carlo algorithm to determine individual ionic chemical potentials in electrolytes.

Science.gov (United States)

Malasics, Attila; Boda, Dezso

2010-06-28

Two iterative procedures have been proposed recently to calculate the chemical potentials corresponding to prescribed concentrations from grand canonical Monte Carlo (GCMC) simulations. Both are based on repeated GCMC simulations with updated excess chemical potentials until the desired concentrations are established. In this paper, we propose combining our robust and fast converging iteration algorithm [Malasics, Gillespie, and Boda, J. Chem. Phys. 128, 124102 (2008)] with the suggestion of Lamperski [Mol. Simul. 33, 1193 (2007)] to average the chemical potentials in the iterations (instead of just using the chemical potentials obtained in the last iteration). We apply the unified method for various electrolyte solutions and show that our algorithm is more efficient if we use the averaging procedure. We discuss the convergence problems arising from violation of charge neutrality when inserting/deleting individual ions instead of neutral groups of ions (salts). We suggest a correction term to the iteration procedure that makes the algorithm efficient to determine the chemical potentials of individual ions too.

NUFFT-Based Iterative Image Reconstruction via Alternating Direction Total Variation Minimization for Sparse-View CT

Directory of Open Access Journals (Sweden)

Bin Yan

2015-01-01

Full Text Available Sparse-view imaging is a promising scanning method which can reduce the radiation dose in X-ray computed tomography (CT. Reconstruction algorithm for sparse-view imaging system is of significant importance. The adoption of the spatial iterative algorithm for CT image reconstruction has a low operation efficiency and high computation requirement. A novel Fourier-based iterative reconstruction technique that utilizes nonuniform fast Fourier transform is presented in this study along with the advanced total variation (TV regularization for sparse-view CT. Combined with the alternating direction method, the proposed approach shows excellent efficiency and rapid convergence property. Numerical simulations and real data experiments are performed on a parallel beam CT. Experimental results validate that the proposed method has higher computational efficiency and better reconstruction quality than the conventional algorithms, such as simultaneous algebraic reconstruction technique using TV method and the alternating direction total variation minimization approach, with the same time duration. The proposed method appears to have extensive applications in X-ray CT imaging.

On the convergence of nonconvex minimization methods for image recovery.

Science.gov (United States)

Xiao, Jin; Ng, Michael Kwok-Po; Yang, Yu-Fei

2015-05-01

Nonconvex nonsmooth regularization method has been shown to be effective for restoring images with neat edges. Fast alternating minimization schemes have also been proposed and developed to solve the nonconvex nonsmooth minimization problem. The main contribution of this paper is to show the convergence of these alternating minimization schemes, based on the Kurdyka-Łojasiewicz property. In particular, we show that the iterates generated by the alternating minimization scheme, converges to a critical point of this nonconvex nonsmooth objective function. We also extend the analysis to nonconvex nonsmooth regularization model with box constraints, and obtain similar convergence results of the related minimization algorithm. Numerical examples are given to illustrate our convergence analysis.

Convergence theorems for a class of nonlinear maps in uniformly smooth Banach spaces

International Nuclear Information System (INIS)

Chidume, C.E.; Osilike, M.O.

1992-05-01

Let K be a nonempty closed and convex subset of a real uniformly smooth Banach space, E, with modulus of smoothness of power type q>1. Let T be a mapping of K into itself, T is an element of C (in the notion of Browder and Petryshyn; and Rhoades). It is proved that the Mann iteration process, under suitable conditions, converges strongly to the unique fixed point of T. If K is also bounded, then the Ishikawa iteration process converges to the fixed point of T. While our theorems generalize important known results, our method is also of independent interest. (author). 14 refs

Exact solitary wave solution for higher order nonlinear Schrodinger equation using He's variational iteration method

Science.gov (United States)

Rani, Monika; Bhatti, Harbax S.; Singh, Vikramjeet

2017-11-01

In optical communication, the behavior of the ultrashort pulses of optical solitons can be described through nonlinear Schrodinger equation. This partial differential equation is widely used to contemplate a number of physically important phenomena, including optical shock waves, laser and plasma physics, quantum mechanics, elastic media, etc. The exact analytical solution of (1+n)-dimensional higher order nonlinear Schrodinger equation by He's variational iteration method has been presented. Our proposed solutions are very helpful in studying the solitary wave phenomena and ensure rapid convergent series and avoid round off errors. Different examples with graphical representations have been given to justify the capability of the method.

Some Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations

Directory of Open Access Journals (Sweden)

Farahnaz Soleimani

2015-11-01

Full Text Available An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing generalized inverses is introduced and applied. The improvements of the hyper-power iterative scheme are based on its proper factorization, as well as on the possibility to accelerate the iterations in the initial phase of the convergence. Although the effectiveness of our approach is confirmed on the basis of the theoretical point of view, some numerical comparisons in balancing chemical equations, as well as on randomly-generated matrices are furnished.

Convergence theorems for certain classes of nonlinear mappings

International Nuclear Information System (INIS)

Chidume, C.E.

1992-01-01

Recently, Xinlong Weng announced a convergence theorem for the iterative approximation of fixed points of local strictly pseudo-contractive mappings in uniformly smooth Banach spaces, (Proc. Amer. Math. Soc. Vol.113, No.3 (1991) 727-731). An example is presented which shows that this theorem of Weng is false. Then, a convergence theorem is proved, in certain real Banach spaces, for approximation a solution of the inclusion f is an element of x + Tx, where T is a set-valued monotone operator. An explicit error estimate is also presented. (author). 26 refs

Fourier convergence analysis applied to neutron diffusion Eigenvalue problem

International Nuclear Information System (INIS)

Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook

2004-01-01

Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Though the methods can be applied to Eigenvalue problems too, all the Fourier convergence analyses have been performed only for fixed source problems and a Fourier convergence analysis for Eigenvalue problem has never been reported. Lee et al proposed new 2-D/1-D coupling methods and they showed that the new ones are unconditionally stable while one of the two existing ones is unstable at a small mesh size and that the new ones are better than the existing ones in terms of the convergence rate. In this paper the convergence of method A in reference 4 for the diffusion Eigenvalue problem was analyzed by the Fourier analysis. The Fourier convergence analysis presented in this paper is the first one applied to a neutronics eigenvalue problem to the best of our knowledge

Iterative integral parameter identification of a respiratory mechanics model

Directory of Open Access Journals (Sweden)

Schranz Christoph

2012-07-01

Full Text Available Abstract Background Patient-specific respiratory mechanics models can support the evaluation of optimal lung protective ventilator settings during ventilation therapy. Clinical application requires that the individual’s model parameter values must be identified with information available at the bedside. Multiple linear regression or gradient-based parameter identification methods are highly sensitive to noise and initial parameter estimates. Thus, they are difficult to apply at the bedside to support therapeutic decisions. Methods An iterative integral parameter identification method is applied to a second order respiratory mechanics model. The method is compared to the commonly used regression methods and error-mapping approaches using simulated and clinical data. The clinical potential of the method was evaluated on data from 13 Acute Respiratory Distress Syndrome (ARDS patients. Results The iterative integral method converged to error minima 350 times faster than the Simplex Search Method using simulation data sets and 50 times faster using clinical data sets. Established regression methods reported erroneous results due to sensitivity to noise. In contrast, the iterative integral method was effective independent of initial parameter estimations, and converged successfully in each case tested. Conclusion These investigations reveal that the iterative integral method is beneficial with respect to computing time, operator independence and robustness, and thus applicable at the bedside for this clinical application.

A semi-analytical iterative technique for solving chemistry problems

Directory of Open Access Journals (Sweden)

Majeed Ahmed AL-Jawary

2017-07-01

Full Text Available The main aim and contribution of the current paper is to implement a semi-analytical iterative method suggested by Temimi and Ansari in 2011 namely (TAM to solve two chemical problems. An approximate solution obtained by the TAM provides fast convergence. The current chemical problems are the absorption of carbon dioxide into phenyl glycidyl ether and the other system is a chemical kinetics problem. These problems are represented by systems of nonlinear ordinary differential equations that contain boundary conditions and initial conditions. Error analysis of the approximate solutions is studied using the error remainder and the maximal error remainder. Exponential rate for the convergence is observed. For both problems the results of the TAM are compared with other results obtained by previous methods available in the literature. The results demonstrate that the method has many merits such as being derivative-free, and overcoming the difficulty arising in calculating Adomian polynomials to handle the non-linear terms in Adomian Decomposition Method (ADM. It does not require to calculate Lagrange multiplier in Variational Iteration Method (VIM in which the terms of the sequence become complex after several iterations, thus, analytical evaluation of terms becomes very difficult or impossible in VIM. No need to construct a homotopy in Homotopy Perturbation Method (HPM and solve the corresponding algebraic equations. The MATHEMATICA® 9 software was used to evaluate terms in the iterative process.

Laplace transform overcoming principle drawbacks in application of the variational iteration method to fractional heat equations

Directory of Open Access Journals (Sweden)

Wu Guo-Cheng

2012-01-01

Full Text Available This note presents a Laplace transform approach in the determination of the Lagrange multiplier when the variational iteration method is applied to time fractional heat diffusion equation. The presented approach is more straightforward and allows some simplification in application of the variational iteration method to fractional differential equations, thus improving the convergence of the successive iterations.

Regarding overrelaxation for accelerating an iteration process

International Nuclear Information System (INIS)

Vondy, D.R.

1984-06-01

The solution for a vector that satisfies a set of coupled equations is often obtained economically in iteration. Application of an overrelaxation coefficient to augment the calculated iterate changes is done to accelerate the rate of convergence. This scheme is simple to implement and often effective. Much is known theoretically about the iterative behavior when the system of equations is linear, although there are complexities that are not widely known. Extensive use is made of the scheme even to non-linear systems of equations where behavior depends on the situation. Of much concern to the developer of solution methods (typically an engineer or applied mathematician) is implementing an effective procedure at a modest investment in development and testing. Applications are described to thermal cell and neutron diffusion modeling

A comparison theorem for the SOR iterative method

Science.gov (United States)

Sun, Li-Ying

2005-09-01

In 1997, Kohno et al. have reported numerically that the improving modified Gauss-Seidel method, which was referred to as the IMGS method, is superior to the SOR iterative method. In this paper, we prove that the spectral radius of the IMGS method is smaller than that of the SOR method and Gauss-Seidel method, if the relaxation parameter [omega][set membership, variant](0,1]. As a result, we prove theoretically that this method is succeeded in improving the convergence of some classical iterative methods. Some recent results are improved.

A superlinear convergence estimate for an iterative method for the biharmonic equation

Energy Technology Data Exchange (ETDEWEB)

Horn, M.A. [Wichita State Univ., Wichita, KS (United States)

1996-12-31

In [CDH] a method for the solution of boundary value problems for the biharmonic equation using conformal mapping was investigated. The method is an implementation of the classical method of Muskhelishvili. In [CDH] it was shown, using the Hankel structure, that the linear system in [Musk] is the discretization of the identify plus a compact operator, and therefore the conjugate gradient method will converge superlinearly. The purpose of this paper is to give an estimate of the superlinear convergence in the case when the boundary curve is in a Hoelder class.

Reliable method for fission source convergence of Monte Carlo criticality calculation with Wielandt's method

International Nuclear Information System (INIS)

Yamamoto, Toshihiro; Miyoshi, Yoshinori

2004-01-01

A new algorithm of Monte Carlo criticality calculations for implementing Wielandt's method, which is one of acceleration techniques for deterministic source iteration methods, is developed, and the algorithm can be successfully implemented into MCNP code. In this algorithm, part of fission neutrons emitted during random walk processes are tracked within the current cycle, and thus a fission source distribution used in the next cycle spread more widely. Applying this method intensifies a neutron interaction effect even in a loosely-coupled array where conventional Monte Carlo criticality methods have difficulties, and a converged fission source distribution can be obtained with fewer cycles. Computing time spent for one cycle, however, increases because of tracking fission neutrons within the current cycle, which eventually results in an increase of total computing time up to convergence. In addition, statistical fluctuations of a fission source distribution in a cycle are worsened by applying Wielandt's method to Monte Carlo criticality calculations. However, since a fission source convergence is attained with fewer source iterations, a reliable determination of convergence can easily be made even in a system with a slow convergence. This acceleration method is expected to contribute to prevention of incorrect Monte Carlo criticality calculations. (author)

ITER Status and Plans

Science.gov (United States)

Greenfield, Charles M.

2017-10-01

The US Burning Plasma Organization is pleased to welcome Dr. Bernard Bigot, who will give an update on progress in the ITER Project. Dr. Bigot took over as Director General of the ITER Organization in early 2015 following a distinguished career that included serving as Chairman and CEO of the French Alternative Energies and Atomic Energy Commission and as High Commissioner for ITER in France. During his tenure at ITER the project has moved into high gear, with rapid progress evident on the construction site and preparation of a staged schedule and a research plan leading from where we are today through all the way to full DT operation. In an unprecedented international effort, seven partners ``China, the European Union, India, Japan, Korea, Russia and the United States'' have pooled their financial and scientific resources to build the biggest fusion reactor in history. ITER will open the way to the next step: a demonstration fusion power plant. All DPP attendees are welcome to attend this ITER town meeting.

Elliptic Preconditioner for Accelerating the Self-Consistent Field Iteration in Kohn--Sham Density Functional Theory

Energy Technology Data Exchange (ETDEWEB)

Lin, Lin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division; Yang, Chao [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division

2013-10-28

We discuss techniques for accelerating the self consistent field (SCF) iteration for solving the Kohn-Sham equations. These techniques are all based on constructing approximations to the inverse of the Jacobian associated with a fixed point map satisfied by the total potential. They can be viewed as preconditioners for a fixed point iteration. We point out different requirements for constructing preconditioners for insulating and metallic systems respectively, and discuss how to construct preconditioners to keep the convergence rate of the fixed point iteration independent of the size of the atomistic system. We propose a new preconditioner that can treat insulating and metallic system in a unified way. The new preconditioner, which we call an elliptic preconditioner, is constructed by solving an elliptic partial differential equation. The elliptic preconditioner is shown to be more effective in accelerating the convergence of a fixed point iteration than the existing approaches for large inhomogeneous systems at low temperature.

Green function iterative solution of ground state wave function for Yukawa potential

International Nuclear Information System (INIS)

Zhang Zhao

2003-01-01

The newly developed single trajectory quadrature method is applied to solve central potentials. First, based on the series expansion method an exact analytic solution of the ground state for Hulthen potential and an approximate solution for Yukawa potential are obtained respectively. Second, the newly developed iterative method based on Green function defined by quadratures along the single trajectory is applied to solve Yukawa potential using the Coulomb solution and Hulthen solution as the trial functions respectively. The results show that a more proper choice of the trial function will give a better convergence. To further improve the convergence the iterative method is combined with the variational method to solve the ground state wave function for Yukawa potential, using variational solutions of the Coulomb and Hulthen potentials as the trial functions. The results give much better convergence. Finally, the obtained critical screen coefficient is applied to discuss the dissociate temperature of J/ψ in high temperature QGP

Accurate and Fast Convergent Initial-Value Belief Propagation for Stereo Matching.

Science.gov (United States)

Wang, Xiaofeng; Liu, Yiguang

2015-01-01

The belief propagation (BP) algorithm has some limitations, including ambiguous edges and textureless regions, and slow convergence speed. To address these problems, we present a novel algorithm that intrinsically improves both the accuracy and the convergence speed of BP. First, traditional BP generally consumes time due to numerous iterations. To reduce the number of iterations, inspired by the crucial importance of the initial value in nonlinear problems, a novel initial-value belief propagation (IVBP) algorithm is presented, which can greatly improve both convergence speed and accuracy. Second, .the majority of the existing research on BP concentrates on the smoothness term or other energy terms, neglecting the significance of the data term. In this study, a self-adapting dissimilarity data term (SDDT) is presented to improve the accuracy of the data term, which incorporates an additional gradient-based measure into the traditional data term, with the weight determined by the robust measure-based control function. Finally, this study explores the effective combination of local methods and global methods. The experimental results have demonstrated that our method performs well compared with the state-of-the-art BP and simultaneously holds better edge-preserving smoothing effects with fast convergence speed in the Middlebury and new 2014 Middlebury datasets.

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

Science.gov (United States)

Maghami, Peiman G.; Sparks, Dean W., Jr.

1997-01-01

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Iterative solutions of nonlinear equations with strongly accretive or strongly pseudocontractive maps

International Nuclear Information System (INIS)

Chidume, C.E.

1994-03-01

Let E be a real q-uniformly smooth Banach space. Suppose T is a strongly pseudo-contractive map with open domain D(T) in E. Suppose further that T has a fixed point in D(T). Under various continuity assumptions on T it is proved that each of the Mann iteration process or the Ishikawa iteration method converges strongly to the unique fixed point of T. Related results deal with iterative solutions of nonlinear operator equations involving strongly accretive maps. Explicit error estimates are also provided. (author). 38 refs

Impact of element-level static condensation on iterative solver performance

KAUST Repository

Pardo, D.; Á lvarez-Aramberri, J.; Paszynski, M.; Dalcin, Lisandro; Calo, Victor M.

2015-01-01

that static condensation at the element level is beneficial for higher-order methods. For lower-order methods or when the number of iterations required for convergence is low, the setup cost of the elimination as well as its implementation may offset

An iterative homogenization technique that preserves assembly core exchanges

International Nuclear Information System (INIS)

Mondot, Ph.; Sanchez, R.

2003-01-01

A new interactive homogenization procedure for reactor core calculations is proposed that requires iterative transport assembly and diffusion core calculations. At each iteration the transport solution of every assembly type is used to produce homogenized cross sections for the core calculation. The converged solution gives assembly fine multigroup transport fluxes that preserve macro-group assembly exchanges in the core. This homogenization avoids the periodic lattice-leakage model approximation and gives detailed assembly transport fluxes without need of an approximated flux reconstruction. Preliminary results are given for a one-dimensional core model. (authors)

An iterative method for determination of a minimal eigenvalue

DEFF Research Database (Denmark)

Kristiansen, G.K.

1968-01-01

Kristiansen (1963) has discussed the convergence of a group of iterative methods (denoted the Equipoise methods) for the solution of reactor criticality problems. The main result was that even though the methods are said to work satisfactorily in all practical cases, examples of divergence can be...

Iterative solution of the Helmholtz equation

Energy Technology Data Exchange (ETDEWEB)

Larsson, E.; Otto, K. [Uppsala Univ. (Sweden)

1996-12-31

We have shown that the numerical solution of the two-dimensional Helmholtz equation can be obtained in a very efficient way by using a preconditioned iterative method. We discretize the equation with second-order accurate finite difference operators and take special care to obtain non-reflecting boundary conditions. We solve the large, sparse system of equations that arises with the preconditioned restarted GMRES iteration. The preconditioner is of {open_quotes}fast Poisson type{close_quotes}, and is derived as a direct solver for a modified PDE problem.The arithmetic complexity for the preconditioner is O(n log{sub 2} n), where n is the number of grid points. As a test problem we use the propagation of sound waves in water in a duct with curved bottom. Numerical experiments show that the preconditioned iterative method is very efficient for this type of problem. The convergence rate does not decrease dramatically when the frequency increases. Compared to banded Gaussian elimination, which is a standard solution method for this type of problems, the iterative method shows significant gain in both storage requirement and arithmetic complexity. Furthermore, the relative gain increases when the frequency increases.

Convergence theorems for strictly hemi-contractive maps

International Nuclear Information System (INIS)

Chidume, C.E.; Osilike, M.O.

1992-04-01

It is proved that each of two well-known fixed point iteration methods (the Mann and the Ishikawa iteration methods) converges strongly to the fixed point of strictly hemi-contractive map in real Banach spaces with property (U, λ, m+1,m), λ is an element of R, m is an element of IN. The class of strictly hemi-contractive maps includes all strictly pseudo-contractive maps with nonempty fixed point sets; and Banach spaces with property (U, λ, m+1, m), λ is an element of R, m is an element of IN include the L p (or l p ) spaces, p≥2. Our theorems generalize important known results. (author). 22 refs

Investigating Convergence Patterns for Numerical Methods Using Data Analysis

Science.gov (United States)

Gordon, Sheldon P.

2013-01-01

The article investigates the patterns that arise in the convergence of numerical methods, particularly those in the errors involved in successive iterations, using data analysis and curve fitting methods. In particular, the results obtained are used to convey a deeper level of understanding of the concepts of linear, quadratic, and cubic…

Does Rapid and Sustained Economic Growth Lead to Convergence in Health Resources: The Case of China From 1980 to 2010.

Science.gov (United States)

Liang, Di; Zhang, Donglan; Huang, Jiayan; Schweitzer, Stuart

2016-01-01

China's rapid and sustained economic growth offers an opportunity to ask whether the advantages of growth diffuse throughout an economy, or remain localized in areas where the growth has been the greatest. A critical policy area in China has been the health system, and health inequality has become an issue that has led the government to broaden national health insurance programs. This study investigates whether health system resources and performance have converged over the past 30 years across China's 31 provinces. To examine geographic variation of health system resources and performance at the provincial level, we measure the degree of sigma convergence and beta convergence in indicators of health system resources (structure), health services utilization (process), and outcome. All data are from officially published sources: the China Health Statistics Year Book and the China Statistics Year Book. Sigma convergence is found for resource indicators, whereas it is not observed for either process or outcome indicators, indicating that disparities only narrowed in health system resources. Beta convergence is found in most indicators, except for 2 procedure indicators, reflecting that provinces with poorer resources were catching up. Convergence found in this study probably reflects the mixed outcome of government input, and market forces. Thus, left alone, the equitable distribution of health care resources may not occur naturally during a period of economic growth. Governmental and societal efforts are needed to reduce geographic health variation and promote health equity. © The Author(s) 2016.

Accelerated convergence of the steepest-descent method for magnetohydrodynamic equilibria

International Nuclear Information System (INIS)

Handy, C.R.; Hirshman, S.P.

1984-06-01

Iterative schemes based on the method of steepest descent have recently been used to obtain magnetohydrodynamic (MHD) equilibria. Such schemes generate asymptotic geometric vector sequences whose convergence rate can be improved through the use of the epsilon-algorithm. The application of this nonlinear recursive technique to stiff systems is discussed. In principle, the epsilon-algorithm is capable of yielding quadratic convergence and therefore represents an attractive alternative to other quadratic convergence schemes requiring Jacobian matrix inversion. Because the damped MHD equations have eigenvalues with negative real parts (in the neighborhood of a stable equilibrium), the epsilon-algorithm will generally be stable. Concern for residual monotonic sequences leads to consideration of alternative methods for implementing the algorithm

Convergence theorems for quasi-contractive maps in uniformly convex spaces

International Nuclear Information System (INIS)

Chidume, C.E.; Osilike, M.O.

1992-04-01

Let K be a nonempty closed convex and bounded subset of a real uniformly convex Banach space E of modulus of convexity of power type q≥2. Let T by a quasi-contractive mapping of K into itself. It is proved that each of two well known fixed point iteration methods (the Mann and the Ishikawa iteration methods) converges strongly, without any compactness assumption on the domain of the map, to the unique fixed point of T in K. Our theorems generalize important known results. (author). 22 refs

A comparative study of iterative solutions to linear systems arising in quantum mechanics

International Nuclear Information System (INIS)

Jing Yanfei; Huang Tingzhu; Duan Yong; Carpentieri, Bruno

2010-01-01

This study is mainly focused on iterative solutions with simple diagonal preconditioning to two complex-valued nonsymmetric systems of linear equations arising from a computational chemistry model problem proposed by Sherry Li of NERSC. Numerical experiments show the feasibility of iterative methods to some extent when applied to the problems and reveal the competitiveness of our recently proposed Lanczos biconjugate A-orthonormalization methods to other classic and popular iterative methods. By the way, experiment results also indicate that application specific preconditioners may be mandatory and required for accelerating convergence.

Rapid prototyping of the Central Safety System for Nuclear Risk in ITER

Energy Technology Data Exchange (ETDEWEB)

Scibile, L. [ITER Organization, CS 90 046, St. Paul-lez-Durance, Cedex (France); Ambrosino, G. [Consorzio CREATE, Universita degli Studi di Napoli Federico II, via Claudio 21, 80125, Napoli (Italy); De Tommasi, G., E-mail: detommas@unina.i [Consorzio CREATE, Universita degli Studi di Napoli Federico II, via Claudio 21, 80125, Napoli (Italy); Pironti, A. [Consorzio CREATE, Universita degli Studi di Napoli Federico II, via Claudio 21, 80125, Napoli (Italy)

2010-07-15

The Central Safety System for Nuclear Risk (CSS-N) coordinates the safety control systems to ensure nuclear safety for the ITER complex. Since the CSS-N is a safety critical system, its validation and commissioning play a very important role; in particular the required level of reliability must be demonstrated. In such a scenario, it is strongly recommended to use modeling and simulation tools since the early design phase. Indeed, the modeling tools will help in the definition of the control system requirements. Furthermore the models can than be used for the rapid prototyping of the safety system. Hardware-in-the-loop simulations can also be performed in order to assess the performance of the control hardware against a plant simulator. The proposed approach relies on the availability of a plant simulator to develop the prototype of the control system. This paper introduces the methodology used to design and develop both the CSS-N Oriented Plant Simulator and the CSS-N Prototype.

Rapid prototyping of the Central Safety System for Nuclear Risk in ITER

International Nuclear Information System (INIS)

Scibile, L.; Ambrosino, G.; De Tommasi, G.; Pironti, A.

2010-01-01

The Central Safety System for Nuclear Risk (CSS-N) coordinates the safety control systems to ensure nuclear safety for the ITER complex. Since the CSS-N is a safety critical system, its validation and commissioning play a very important role; in particular the required level of reliability must be demonstrated. In such a scenario, it is strongly recommended to use modeling and simulation tools since the early design phase. Indeed, the modeling tools will help in the definition of the control system requirements. Furthermore the models can than be used for the rapid prototyping of the safety system. Hardware-in-the-loop simulations can also be performed in order to assess the performance of the control hardware against a plant simulator. The proposed approach relies on the availability of a plant simulator to develop the prototype of the control system. This paper introduces the methodology used to design and develop both the CSS-N Oriented Plant Simulator and the CSS-N Prototype.

Convergence from divergence

Science.gov (United States)

Costin, Ovidiu; Dunne, Gerald V.

2018-01-01

We show how to convert divergent series, which typically occur in many applications in physics, into rapidly convergent inverse factorial series. This can be interpreted physically as a novel resummation of perturbative series. Being convergent, these new series allow rigorous extrapolation from an asymptotic region with a large parameter, to the opposite region where the parameter is small. We illustrate the method with various physical examples, and discuss how these convergent series relate to standard methods such as Borel summation, and also how they incorporate the physical Stokes phenomenon. We comment on the relation of these results to Dyson’s physical argument for the divergence of perturbation theory. This approach also leads naturally to a wide class of relations between bosonic and fermionic partition functions, and Klein-Gordon and Dirac determinants.

Variation Iteration Method for The Approximate Solution of Nonlinear ...

African Journals Online (AJOL)

In this study, we considered the numerical solution of the nonlinear Burgers equation using the Variational Iteration Method (VIM). The method seeks to examine the convergence of solutions of the Burgers equation at the expense of the parameters x and t of which the amount of errors depends. Numerical experimentation ...

Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction.

Science.gov (United States)

Nikazad, T; Davidi, R; Herman, G T

2012-03-01

We study the convergence of a class of accelerated perturbation-resilient block-iterative projection methods for solving systems of linear equations. We prove convergence to a fixed point of an operator even in the presence of summable perturbations of the iterates, irrespective of the consistency of the linear system. For a consistent system, the limit point is a solution of the system. In the inconsistent case, the symmetric version of our method converges to a weighted least squares solution. Perturbation resilience is utilized to approximate the minimum of a convex functional subject to the equations. A main contribution, as compared to previously published approaches to achieving similar aims, is a more than an order of magnitude speed-up, as demonstrated by applying the methods to problems of image reconstruction from projections. In addition, the accelerated algorithms are illustrated to be better, in a strict sense provided by the method of statistical hypothesis testing, than their unaccelerated versions for the task of detecting small tumors in the brain from X-ray CT projection data.

Iterative method of the parameter variation for solution of nonlinear functional equations

International Nuclear Information System (INIS)

Davidenko, D.F.

1975-01-01

The iteration method of parameter variation is used for solving nonlinear functional equations in Banach spaces. The authors consider some methods for numerical integration of ordinary first-order differential equations and construct the relevant iteration methods of parameter variation, both one- and multifactor. They also discuss problems of mathematical substantiation of the method, study the conditions and rate of convergence, estimate the error. The paper considers the application of the method to specific functional equations

Convergence of quasiparticle self-consistent GW calculations of transition metal monoxides

OpenAIRE

Das, Suvadip; Coulter, John E.; Manousakis, Efstratios

2014-01-01

Finding an accurate ab initio approach for calculating the electronic properties of transition metal oxides has been a problem for several decades. In this paper, we investigate the electronic structure of the transition metal monoxides MnO, CoO, and NiO in their undistorted rock-salt structure within a fully iterated quasiparticle self-consistent GW (QPscGW) scheme. We study the convergence of the QPscGW method, i.e., how the quasiparticle energy eigenvalues and wavefunctions converge as a f...

Convergence analysis of the rebalance methods in multiplying finite slab having periodic boundary conditions

International Nuclear Information System (INIS)

Hong, Ser Gi; Lee, Young Ouk; Song, Jae Seung

2009-01-01

This paper analyzes the convergence of the rebalance iteration methods for the discrete ordinates transport equation in the multiplying finite slab problem. The finite slab is assumed to be homogeneous and it has the periodic boundary conditions. A general formulation is used to include three well-known rebalance methods of the linearized form in a unified way. The rebalance iteration methods considered in this paper are the CMR (Coarse-Mesh Rebalance), the CMFD (Coarse-Mesh Finite Difference), and p-CMFD (Partial Current-Based Coarse Mesh Finite Difference) methods which have been popularly used in the reactor physics. The convergence analysis is performed with the well-known Fourier analysis through a linearization. The analyses are applied for one-group problems. The theoretical analysis shows that there are one fundamental mode and N-1 Eigen-modes which determine the convergence if the finite slab is divided into N uniform meshes. The numerical tests show that the Fourier convergence analysis provides the reasonable estimate of the numerical spectral radii for the model problems and the spectral radius for the finite slab approaches the one for the infinite slab as the thickness of the slab increases. (author)

Generalization of the Fourier Convergence Analysis in the Neutron Diffusion Eigenvalue Problem

International Nuclear Information System (INIS)

Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook

2005-01-01

Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Lee et al proposed new 2- D/1-D coupling methods and demonstrated several advantages of the new methods by performing a Fourier convergence analysis of the methods as well as two existing methods for a fixed source problem. We demonstrated the Fourier convergence analysis of one of the 2-D/1-D coupling methods applied to a neutron diffusion eigenvalue problem. However, the technique cannot be used directly to analyze the convergence of the other 2-D/1-D coupling methods since some algorithm-specific features were used in our previous study. In this paper we generalized the Fourier convergence analysis technique proposed and analyzed the convergence of the 2-D/1-D coupling methods applied to a neutron diffusion Eigenvalue problem using the generalized technique

Fixed point iterations for strictly hemi-contractive maps in uniformly smooth Banach spaces

International Nuclear Information System (INIS)

Chidume, C.E.; Osilike, M.O.

1993-05-01

It is proved that the Mann iteration process converges strongly to the fixed point of a strictly hemi-contractive map in real uniformly smooth Banach spaces. The class of strictly hemi-contractive maps includes all strictly pseudo-contractive maps with nonempty fixed point sets. A related result deals with the Ishikawa iteration scheme when the mapping is Lipschitzian and strictly hemi-contractive. Our theorems generalize important known results. (author). 29 refs

Convergent dynamics for multistable delayed neural networks

International Nuclear Information System (INIS)

Shih, Chih-Wen; Tseng, Jui-Pin

2008-01-01

This investigation aims at developing a methodology to establish convergence of dynamics for delayed neural network systems with multiple stable equilibria. The present approach is general and can be applied to several network models. We take the Hopfield-type neural networks with both instantaneous and delayed feedbacks to illustrate the idea. We shall construct the complete dynamical scenario which comprises exactly 2 n stable equilibria and exactly (3 n − 2 n ) unstable equilibria for the n-neuron network. In addition, it is shown that every solution of the system converges to one of the equilibria as time tends to infinity. The approach is based on employing the geometrical structure of the network system. Positively invariant sets and componentwise dynamical properties are derived under the geometrical configuration. An iteration scheme is subsequently designed to confirm the convergence of dynamics for the system. Two examples with numerical simulations are arranged to illustrate the present theory

Studying the properties of photonic quasi-crystals by the scaling convergence method

International Nuclear Information System (INIS)

Ho, I-Lin; Ng, Ming-Yaw; Mai, Chien Chin; Ko, Peng Yu; Chang, Yia-Chung

2013-01-01

This work introduces the iterative scaling (or inflation) method to systematically approach and analyse the infinite structure of quasi-crystals. The resulting structures preserve local geometric orderings in order to prevent artificial disclination across the boundaries of super-cells, with realistic quasi-crystals coming out under high iteration (infinite super-cell). The method provides an easy way for decorations of quasi-crystalline lattices, and for compact reliefs with a quasi-periodic arrangement to underlying applications. Numerical examples for in-plane and off-plane properties of square-triangle quasi-crystals show fast convergence during iteratively geometric scaling, revealing characteristics that do not appear on regular crystals. (paper)

Dynamics of a new family of iterative processes for quadratic polynomials

Science.gov (United States)

Gutiérrez, J. M.; Hernández, M. A.; Romero, N.

2010-03-01

In this work we show the presence of the well-known Catalan numbers in the study of the convergence and the dynamical behavior of a family of iterative methods for solving nonlinear equations. In fact, we introduce a family of methods, depending on a parameter . These methods reach the order of convergence m+2 when they are applied to quadratic polynomials with different roots. Newton's and Chebyshev's methods appear as particular choices of the family appear for m=0 and m=1, respectively. We make both analytical and graphical studies of these methods, which give rise to rational functions defined in the extended complex plane. Firstly, we prove that the coefficients of the aforementioned family of iterative processes can be written in terms of the Catalan numbers. Secondly, we make an incursion into its dynamical behavior. In fact, we show that the rational maps related to these methods can be written in terms of the entries of the Catalan triangle. Next we analyze its general convergence, by including some computer plots showing the intricate structure of the Universal Julia sets associated with the methods.

Strong Convergence of Monotone Hybrid Method for Maximal Monotone Operators and Hemirelatively Nonexpansive Mappings

Directory of Open Access Journals (Sweden)

Chakkrid Klin-eam

2009-01-01

Full Text Available We prove strong convergence theorems for finding a common element of the zero point set of a maximal monotone operator and the fixed point set of a hemirelatively nonexpansive mapping in a Banach space by using monotone hybrid iteration method. By using these results, we obtain new convergence results for resolvents of maximal monotone operators and hemirelatively nonexpansive mappings in a Banach space.

Accelerated barrier optimization compressed sensing (ABOCS) for CT reconstruction with improved convergence

International Nuclear Information System (INIS)

Niu, Tianye; Fruhauf, Quentin; Petrongolo, Michael; Zhu, Lei; Ye, Xiaojing

2014-01-01

Recently, we proposed a new algorithm of accelerated barrier optimization compressed sensing (ABOCS) for iterative CT reconstruction. The previous implementation of ABOCS uses gradient projection (GP) with a Barzilai–Borwein (BB) step-size selection scheme (GP-BB) to search for the optimal solution. The algorithm does not converge stably due to its non-monotonic behavior. In this paper, we further improve the convergence of ABOCS using the unknown-parameter Nesterov (UPN) method and investigate the ABOCS reconstruction performance on clinical patient data. Comparison studies are carried out on reconstructions of computer simulation, a physical phantom and a head-and-neck patient. In all of these studies, the ABOCS results using UPN show more stable and faster convergence than those of the GP-BB method and a state-of-the-art Bregman-type method. As shown in the simulation study of the Shepp–Logan phantom, UPN achieves the same image quality as those of GP-BB and the Bregman-type methods, but reduces the iteration numbers by up to 50% and 90%, respectively. In the Catphan©600 phantom study, a high-quality image with relative reconstruction error (RRE) less than 3% compared to the full-view result is obtained using UPN with 17% projections (60 views). In the conventional filtered-backprojection reconstruction, the corresponding RRE is more than 15% on the same projection data. The superior performance of ABOCS with the UPN implementation is further demonstrated on the head-and-neck patient. Using 25% projections (91 views), the proposed method reduces the RRE from 21% as in the filtered backprojection (FBP) results to 7.3%. In conclusion, we propose UPN for ABOCS implementation. As compared to GP-BB and the Bregman-type methods, the new method significantly improves the convergence with higher stability and fewer iterations. (paper)

Structural hybrid reliability index and its convergent solving method based on random–fuzzy–interval reliability model

Directory of Open Access Journals (Sweden)

Hai An

2016-08-01

Full Text Available Aiming to resolve the problems of a variety of uncertainty variables that coexist in the engineering structure reliability analysis, a new hybrid reliability index to evaluate structural hybrid reliability, based on the random–fuzzy–interval model, is proposed in this article. The convergent solving method is also presented. First, the truncated probability reliability model, the fuzzy random reliability model, and the non-probabilistic interval reliability model are introduced. Then, the new hybrid reliability index definition is presented based on the random–fuzzy–interval model. Furthermore, the calculation flowchart of the hybrid reliability index is presented and it is solved using the modified limit-step length iterative algorithm, which ensures convergence. And the validity of convergent algorithm for the hybrid reliability model is verified through the calculation examples in literature. In the end, a numerical example is demonstrated to show that the hybrid reliability index is applicable for the wear reliability assessment of mechanisms, where truncated random variables, fuzzy random variables, and interval variables coexist. The demonstration also shows the good convergence of the iterative algorithm proposed in this article.

Iterative methods for tomography problems: implementation to a cross-well tomography problem

Science.gov (United States)

Karadeniz, M. F.; Weber, G. W.

2018-01-01

The velocity distribution between two boreholes is reconstructed by cross-well tomography, which is commonly used in geology. In this paper, iterative methods, Kaczmarz’s algorithm, algebraic reconstruction technique (ART), and simultaneous iterative reconstruction technique (SIRT), are implemented to a specific cross-well tomography problem. Convergence to the solution of these methods and their CPU time for the cross-well tomography problem are compared. Furthermore, these three methods for this problem are compared for different tolerance values.

Improved fixed point iterative method for blade element momentum computations

DEFF Research Database (Denmark)

Sun, Zhenye; Shen, Wen Zhong; Chen, Jin

2017-01-01

The blade element momentum (BEM) theory is widely used in aerodynamic performance calculations and optimization applications for wind turbines. The fixed point iterative method is the most commonly utilized technique to solve the BEM equations. However, this method sometimes does not converge...... are addressed through both theoretical analysis and numerical tests. A term from the BEM equations equals to zero at a critical inflow angle is the source of the convergence problems. When the initial inflow angle is set larger than the critical inflow angle and the relaxation methodology is adopted...

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

International Nuclear Information System (INIS)

Xu, Qiaofeng; Sawatzky, Alex; Anastasio, Mark A.; Yang, Deshan; Tan, Jun

2016-01-01

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 fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction

Science.gov (United States)

Xu, Qiaofeng; Yang, Deshan; Tan, Jun; Sawatzky, Alex; Anastasio, Mark A.

2016-01-01

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

A New General Iterative Method for a Finite Family of Nonexpansive Mappings in Hilbert Spaces

Directory of Open Access Journals (Sweden)

Singthong Urailuk

2010-01-01

Full Text Available We introduce a new general iterative method by using the -mapping for finding a common fixed point of a finite family of nonexpansive mappings in the framework of Hilbert spaces. A strong convergence theorem of the purposed iterative method is established under some certain control conditions. Our results improve and extend the results announced by many others.

Robust Multiscale Iterative Solvers for Nonlinear Flows in Highly Heterogeneous Media

KAUST Repository

Efendiev, Y.

2012-08-01

In this paper, we study robust iterative solvers for finite element systems resulting in approximation of steady-state Richards\\' equation in porous media with highly heterogeneous conductivity fields. It is known that in such cases the contrast, ratio between the highest and lowest values of the conductivity, can adversely affect the performance of the preconditioners and, consequently, a design of robust preconditioners is important for many practical applications. The proposed iterative solvers consist of two kinds of iterations, outer and inner iterations. Outer iterations are designed to handle nonlinearities by linearizing the equation around the previous solution state. As a result of the linearization, a large-scale linear system needs to be solved. This linear system is solved iteratively (called inner iterations), and since it can have large variations in the coefficients, a robust preconditioner is needed. First, we show that under some assumptions the number of outer iterations is independent of the contrast. Second, based on the recently developed iterative methods, we construct a class of preconditioners that yields convergence rate that is independent of the contrast. Thus, the proposed iterative solvers are optimal with respect to the large variation in the physical parameters. Since the same preconditioner can be reused in every outer iteration, this provides an additional computational savings in the overall solution process. Numerical tests are presented to confirm the theoretical results. © 2012 Global-Science Press.

Convergent evolution as natural experiment: the tape of life reconsidered.

Science.gov (United States)

Powell, Russell; Mariscal, Carlos

2015-12-06

Stephen Jay Gould argued that replaying the 'tape of life' would result in radically different evolutionary outcomes. Recently, biologists and philosophers of science have paid increasing attention to the theoretical importance of convergent evolution-the independent origination of similar biological forms and functions-which many interpret as evidence against Gould's thesis. In this paper, we examine the evidentiary relevance of convergent evolution for the radical contingency debate. We show that under the right conditions, episodes of convergent evolution can constitute valid natural experiments that support inferences regarding the deep counterfactual stability of macroevolutionary outcomes. However, we argue that proponents of convergence have problematically lumped causally heterogeneous phenomena into a single evidentiary basket, in effect treating all convergent events as if they are of equivalent theoretical import. As a result, the 'critique from convergent evolution' fails to engage with key claims of the radical contingency thesis. To remedy this, we develop ways to break down the heterogeneous set of convergent events based on the nature of the generalizations they support. Adopting this more nuanced approach to convergent evolution allows us to differentiate iterated evolutionary outcomes that are probably common among alternative evolutionary histories and subject to law-like generalizations, from those that do little to undermine and may even support, the Gouldian view of life.

Development and test of the ITER conductor joints

Energy Technology Data Exchange (ETDEWEB)

Martovetsky, N., LLNL

1998-05-14

Joints for the ITER superconducting Central Solenoid should perform in rapidly varying magnetic field with low losses and low DC resistance. This paper describes the design of the ITER joint and presents its assembly process. Two joints were built and tested at the PTF facility at MIT. Test results are presented, losses in transverse and parallel field and the DC performance are discussed. The developed joint demonstrates sufficient margin for baseline ITER operating scenarios.

Collisional-radiative switching - A powerful technique for converging non-LTE calculations

Science.gov (United States)

Hummer, D. G.; Voels, S. A.

1988-01-01

A very simple technique has been developed to converge statistical equilibrium and model atmospheric calculations in extreme non-LTE conditions when the usual iterative methods fail to converge from an LTE starting model. The proposed technique is based on a smooth transition from a collision-dominated LTE situation to the desired non-LTE conditions in which radiation dominates, at least in the most important transitions. The proposed approach was used to successfully compute stellar models with He abundances of 0.20, 0.30, and 0.50; Teff = 30,000 K, and log g = 2.9.

On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers

Science.gov (United States)

2012-08-01

the less exact one is solved later — assigned as step 4 of Algorithm 2 — because at each iteration , the ADM updates the variables in the Gauss - Seidel ...k) and that of an accelerated version descends at O(1/k2). Then, work [14] establishes the same rates on a Gauss - Seidel version and requires only one... iteration Fig. 5.1. Convergence curves of ADM for the elastic net problem. 17 0 50 100 150 200 0.75 0.8 0.85 0.9 0.95 1 Iteration ‖u k + 1 − u ∗ ‖ 2 G / ‖u k

Improved Savitzky-Golay-method-based fluorescence subtraction algorithm for rapid recovery of Raman spectra.

Science.gov (United States)

Chen, Kun; Zhang, Hongyuan; Wei, Haoyun; Li, Yan

2014-08-20

In this paper, we propose an improved subtraction algorithm for rapid recovery of Raman spectra that can substantially reduce the computation time. This algorithm is based on an improved Savitzky-Golay (SG) iterative smoothing method, which involves two key novel approaches: (a) the use of the Gauss-Seidel method and (b) the introduction of a relaxation factor into the iterative procedure. By applying a novel successive relaxation (SG-SR) iterative method to the relaxation factor, additional improvement in the convergence speed over the standard Savitzky-Golay procedure is realized. The proposed improved algorithm (the RIA-SG-SR algorithm), which uses SG-SR-based iteration instead of Savitzky-Golay iteration, has been optimized and validated with a mathematically simulated Raman spectrum, as well as experimentally measured Raman spectra from non-biological and biological samples. The method results in a significant reduction in computing cost while yielding consistent rejection of fluorescence and noise for spectra with low signal-to-fluorescence ratios and varied baselines. In the simulation, RIA-SG-SR achieved 1 order of magnitude improvement in iteration number and 2 orders of magnitude improvement in computation time compared with the range-independent background-subtraction algorithm (RIA). Furthermore the computation time of the experimentally measured raw Raman spectrum processing from skin tissue decreased from 6.72 to 0.094 s. In general, the processing of the SG-SR method can be conducted within dozens of milliseconds, which can provide a real-time procedure in practical situations.

Approximate convex hull of affine iterated function system attractors

International Nuclear Information System (INIS)

Mishkinis, Anton; Gentil, Christian; Lanquetin, Sandrine; Sokolov, Dmitry

2012-01-01

Highlights: ► We present an iterative algorithm to approximate affine IFS attractor convex hull. ► Elimination of the interior points significantly reduces the complexity. ► To optimize calculations, we merge the convex hull images at each iteration. ► Approximation by ellipses increases speed of convergence to the exact convex hull. ► We present a method of the output convex hull simplification. - Abstract: In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output approximate convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximate convex hull without loss of accuracy.

A new iteration process for finite families of generalized lipschitz pseudo-contractive and generalized lipschitz accretive mappings

International Nuclear Information System (INIS)

Chidume, C.E.; Ofoedu, E.U.

2007-07-01

In this paper, we introduce a new iteration process and prove that it converges strongly to a common fixed point for a finite family of generalized Lipschitz nonlinear mappings in a real reflexive Banach space E with a with uniformly Gateaux differentiable norm if at least one member of the family is pseudo-contractive. We also prove that a slight modification of the process converges to a common zero for a finite family of generalized Lipschitz accretive operators defined on E. Results for nonexpansive families are obtained as easy corollaries. Finally, our new iteration process and our method of proof are of independent interest. (author)

A New Iterative Method for Equilibrium Problems and Fixed Point Problems

Directory of Open Access Journals (Sweden)

Abdul Latif

2013-01-01

Full Text Available Introducing a new iterative method, we study the existence of a common element of the set of solutions of equilibrium problems for a family of monotone, Lipschitz-type continuous mappings and the sets of fixed points of two nonexpansive semigroups in a real Hilbert space. We establish strong convergence theorems of the new iterative method for the solution of the variational inequality problem which is the optimality condition for the minimization problem. Our results improve and generalize the corresponding recent results of Anh (2012, Cianciaruso et al. (2010, and many others.

Recovering a coefficient in a parabolic equation using an iterative approach

Science.gov (United States)

Azhibekova, Aliya S.

2016-06-01

In this paper we are concerned with the problem of determining a coefficient in a parabolic equation using an iterative approach. We investigate an inverse coefficient problem in the difference form. To recover the coefficient, we minimize a residual functional between the observed and calculated values. This is done in a constructive way by fitting a finite-difference approximation to the inverse problem. We obtain some theoretical estimates for a direct and adjoint problem. Using these estimates we prove monotonicity of the objective functional and the convergence of iteration sequences.

On the error estimation and T-stability of the Mann iteration

NARCIS (Netherlands)

Maruster, Laura; Maruster, St.

2015-01-01

A formula of error estimation of Mann iteration is given in the case of strongly demicontractive mappings. Based on this estimation, a condition of strong convergence is obtained for the same class of mappings. T-stability for a particular case of strongly demicontractive mappings is proved. Some

Two-Level Iteration Penalty Methods for the Navier-Stokes Equations with Friction Boundary Conditions

Directory of Open Access Journals (Sweden)

Yuan Li

2013-01-01

Full Text Available This paper presents two-level iteration penalty finite element methods to approximate the solution of the Navier-Stokes equations with friction boundary conditions. The basic idea is to solve the Navier-Stokes type variational inequality problem on a coarse mesh with mesh size H in combining with solving a Stokes, Oseen, or linearized Navier-Stokes type variational inequality problem for Stokes, Oseen, or Newton iteration on a fine mesh with mesh size h. The error estimate obtained in this paper shows that if H, h, and ε can be chosen appropriately, then these two-level iteration penalty methods are of the same convergence orders as the usual one-level iteration penalty method.

Strong coupling strategy for fluid-structure interaction problems in supersonic regime via fixed point iteration

Science.gov (United States)

Storti, Mario A.; Nigro, Norberto M.; Paz, Rodrigo R.; Dalcín, Lisandro D.

2009-03-01

In this paper some results on the convergence of the Gauss-Seidel iteration when solving fluid/structure interaction problems with strong coupling via fixed point iteration are presented. The flow-induced vibration of a flat plate aligned with the flow direction at supersonic Mach number is studied. The precision of different predictor schemes and the influence of the partitioned strong coupling on stability is discussed.

Mean-variance analysis of block-iterative reconstruction algorithms modeling 3D detector response in SPECT

Science.gov (United States)

Lalush, D. S.; Tsui, B. M. W.

1998-06-01

We study the statistical convergence properties of two fast iterative reconstruction algorithms, the rescaled block-iterative (RBI) and ordered subset (OS) EM algorithms, in the context of cardiac SPECT with 3D detector response modeling. The Monte Carlo method was used to generate nearly noise-free projection data modeling the effects of attenuation, detector response, and scatter from the MCAT phantom. One thousand noise realizations were generated with an average count level approximating a typical T1-201 cardiac study. Each noise realization was reconstructed using the RBI and OS algorithms for cases with and without detector response modeling. For each iteration up to twenty, we generated mean and variance images, as well as covariance images for six specific locations. Both OS and RBI converged in the mean to results that were close to the noise-free ML-EM result using the same projection model. When detector response was not modeled in the reconstruction, RBI exhibited considerably lower noise variance than OS for the same resolution. When 3D detector response was modeled, the RBI-EM provided a small improvement in the tradeoff between noise level and resolution recovery, primarily in the axial direction, while OS required about half the number of iterations of RBI to reach the same resolution. We conclude that OS is faster than RBI, but may be sensitive to errors in the projection model. Both OS-EM and RBI-EM are effective alternatives to the EVIL-EM algorithm, but noise level and speed of convergence depend on the projection model used.

Convergent Difference Schemes for Hamilton-Jacobi equations

KAUST Repository

Duisembay, Serikbolsyn

2018-05-07

In this thesis, we consider second-order fully nonlinear partial differential equations of elliptic type. Our aim is to develop computational methods using convergent difference schemes for stationary Hamilton-Jacobi equations with Dirichlet and Neumann type boundary conditions in arbitrary two-dimensional domains. First, we introduce the notion of viscosity solutions in both continuous and discontinuous frameworks. Next, we review Barles-Souganidis approach using monotone, consistent, and stable schemes. In particular, we show that these schemes converge locally uniformly to the unique viscosity solution of the first-order Hamilton-Jacobi equations under mild assumptions. To solve the scheme numerically, we use Euler map with some initial guess. This iterative method gives the viscosity solution as a limit. Moreover, we illustrate our numerical approach in several two-dimensional examples.

Reliability enhancement of Navier-Stokes codes through convergence acceleration

Science.gov (United States)

Merkle, Charles L.; Dulikravich, George S.

1995-01-01

Methods for enhancing the reliability of Navier-Stokes computer codes through improving convergence characteristics are presented. The improving of these characteristics decreases the likelihood of code unreliability and user interventions in a design environment. The problem referred to as a 'stiffness' in the governing equations for propulsion-related flowfields is investigated, particularly in regard to common sources of equation stiffness that lead to convergence degradation of CFD algorithms. Von Neumann stability theory is employed as a tool to study the convergence difficulties involved. Based on the stability results, improved algorithms are devised to ensure efficient convergence in different situations. A number of test cases are considered to confirm a correlation between stability theory and numerical convergence. The examples of turbulent and reacting flow are presented, and a generalized form of the preconditioning matrix is derived to handle these problems, i.e., the problems involving additional differential equations for describing the transport of turbulent kinetic energy, dissipation rate and chemical species. Algorithms for unsteady computations are considered. The extension of the preconditioning techniques and algorithms derived for Navier-Stokes computations to three-dimensional flow problems is discussed. New methods to accelerate the convergence of iterative schemes for the numerical integration of systems of partial differential equtions are developed, with a special emphasis on the acceleration of convergence on highly clustered grids.

Convergence Properties of Projection and Contraction Methods for Variational Inequality Problems

International Nuclear Information System (INIS)

Xiu, N.; Wang, C.; Zhang, J.

2001-01-01

In this paper we develop the convergence theory of a general class of projection and contraction algorithms (PC method), where an extended stepsize rule is used, for solving variational inequality (VI) problems. It is shown that, by defining a scaled projection residue, the PC method forces the sequence of the residues to zero. It is also shown that, by defining a projected function, the PC method forces the sequence of projected functions to zero. A consequence of this result is that if the PC method converges to a nondegenerate solution of the VI problem, then after a finite number of iterations, the optimal face is identified. Finally, we study local convergence behavior of the extragradient algorithm for solving the KKT system of the inequality constrained VI problem

Fourier mode analysis of slab-geometry transport iterations in spatially periodic media

International Nuclear Information System (INIS)

Larsen, E W; Zika, M R

1999-01-01

We describe a Fourier analysis of the diffusion-synthetic acceleration (DSA) and transport-synthetic acceleration (TSA) iteration schemes for a spatially periodic, but otherwise arbitrarily heterogeneous, medium. Both DSA and TSA converge more slowly in a heterogeneous medium than in a homogeneous medium composed of the volume-averaged scattering ratio. In the limit of a homogeneous medium, our heterogeneous analysis contains eigenvalues of multiplicity two at ''resonant'' wave numbers. In the presence of material heterogeneities, error modes corresponding to these resonant wave numbers are ''excited'' more than other error modes. For DSA and TSA, the iteration spectral radius may occur at these resonant wave numbers, in which case the material heterogeneities most strongly affect iterative performance

Linear multifrequency-grey acceleration recast for preconditioned Krylov iterations

International Nuclear Information System (INIS)

Morel, Jim E.; Brian Yang, T.-Y.; Warsa, James S.

2007-01-01

The linear multifrequency-grey acceleration (LMFGA) technique is used to accelerate the iterative convergence of multigroup thermal radiation diffusion calculations in high energy density simulations. Although it is effective and efficient in one-dimensional calculations, the LMFGA method has recently been observed to significantly degrade under certain conditions in multidimensional calculations with large discontinuities in material properties. To address this deficiency, we recast the LMFGA method in terms of a preconditioned system that is solved with a Krylov method (LMFGK). Results are presented demonstrating that the new LMFGK method always requires fewer iterations than the original LMFGA method. The reduction in iteration count increases with both the size of the time step and the inhomogeneity of the problem. However, for reasons later explained, the LMFGK method can cost more per iteration than the LMFGA method, resulting in lower but comparable efficiency in problems with small time steps and weak inhomogeneities. In problems with large time steps and strong inhomogeneities, the LMFGK method is significantly more efficient than the LMFGA method

Convergence Theorem for Finite Family of Total Asymptotically Nonexpansive Mappings

Directory of Open Access Journals (Sweden)

E.U. Ofoedu

2015-11-01

Full Text Available In this paper we introduce an explicit iteration process and prove strong convergence of the scheme in a real Hilbert space $H$ to the common fixed point of finite family of total asymptotically nonexpansive mappings which is nearest to the point $u \\in H$.  Our results improve previously known ones obtained for the class of asymptotically nonexpansive mappings. As application, iterative method for: approximation of solution of variational Inequality problem, finite family of continuous pseudocontractive mappings, approximation of solutions of classical equilibrium problems and approximation of solutions of convex minimization problems are proposed. Our theorems unify and complement many recently announced results.

Distributed weighted least-squares estimation with fast convergence for large-scale systems☆

Science.gov (United States)

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods. PMID:25641976

Distributed weighted least-squares estimation with fast convergence for large-scale systems.

Science.gov (United States)

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods.

Two-level method with coarse space size independent convergence

Energy Technology Data Exchange (ETDEWEB)

Vanek, P.; Brezina, M. [Univ. of Colorado, Denver, CO (United States); Tezaur, R.; Krizkova, J. [UWB, Plzen (Czech Republic)

1996-12-31

The basic disadvantage of the standard two-level method is the strong dependence of its convergence rate on the size of the coarse-level problem. In order to obtain the optimal convergence result, one is limited to using a coarse space which is only a few times smaller than the size of the fine-level one. Consequently, the asymptotic cost of the resulting method is the same as in the case of using a coarse-level solver for the original problem. Today`s two-level domain decomposition methods typically offer an improvement by yielding a rate of convergence which depends on the ratio of fine and coarse level only polylogarithmically. However, these methods require the use of local subdomain solvers for which straightforward application of iterative methods is problematic, while the usual application of direct solvers is expensive. We suggest a method diminishing significantly these difficulties.

On the Convergence of the Iteration Sequence in Primal-Dual Interior-Point Methods

National Research Council Canada - National Science Library

Tapia, Richard A; Zhang, Yin; Ye, Yinyu

1993-01-01

Recently, numerous research efforts, most of them concerned with superlinear convergence of the duality gap sequence to zero in the Kojima-Mizuno-Yoshise primal-dual interior-point method for linear...

Regularization iteration imaging algorithm for electrical capacitance tomography

Science.gov (United States)

Tong, Guowei; Liu, Shi; Chen, Hongyan; Wang, Xueyao

2018-03-01

The image reconstruction method plays a crucial role in real-world applications of the electrical capacitance tomography technique. In this study, a new cost function that simultaneously considers the sparsity and low-rank properties of the imaging targets is proposed to improve the quality of the reconstruction images, in which the image reconstruction task is converted into an optimization problem. Within the framework of the split Bregman algorithm, an iterative scheme that splits a complicated optimization problem into several simpler sub-tasks is developed to solve the proposed cost function efficiently, in which the fast-iterative shrinkage thresholding algorithm is introduced to accelerate the convergence. Numerical experiment results verify the effectiveness of the proposed algorithm in improving the reconstruction precision and robustness.

Mixed error compensation in a heterodyne interferometer using the iterated dual-EKF algorithm

International Nuclear Information System (INIS)

Lee, Woo Ram; Kim, Chang Rai; You, Kwan Ho

2010-01-01

The heterodyne laser interferometer has been widely used in the field of precise measurements. The limited measurement accuracy of a heterodyne laser interferometer arises from the periodic nonlinearity caused by non-ideal laser sources and imperfect optical components. In this paper, the iterated dual-EKF algorithm is used to compensate for the error caused by nonlinearity and external noise. With the iterated dual-EKF algorithm, the weight filter estimates the parameter uncertainties in the state equation caused by nonlinearity errors and has a high convergence rate of weight values due to the iteration process. To verify the performance of the proposed compensation algorithm, we present experimental results obtained by using the iterated dual-EKF algorithm and compare them with the results obtained by using a capacitance displacement sensor.

Mixed error compensation in a heterodyne interferometer using the iterated dual-EKF algorithm

Energy Technology Data Exchange (ETDEWEB)

Lee, Woo Ram; Kim, Chang Rai; You, Kwan Ho [Sungkyunkwan University, Suwon (Korea, Republic of)

2010-10-15

The heterodyne laser interferometer has been widely used in the field of precise measurements. The limited measurement accuracy of a heterodyne laser interferometer arises from the periodic nonlinearity caused by non-ideal laser sources and imperfect optical components. In this paper, the iterated dual-EKF algorithm is used to compensate for the error caused by nonlinearity and external noise. With the iterated dual-EKF algorithm, the weight filter estimates the parameter uncertainties in the state equation caused by nonlinearity errors and has a high convergence rate of weight values due to the iteration process. To verify the performance of the proposed compensation algorithm, we present experimental results obtained by using the iterated dual-EKF algorithm and compare them with the results obtained by using a capacitance displacement sensor.

Iterative learning control an optimization paradigm

CERN Document Server

Owens, David H

2016-01-01

This book develops a coherent theoretical approach to algorithm design for iterative learning control based on the use of optimization concepts. Concentrating initially on linear, discrete-time systems, the author gives the reader access to theories based on either signal or parameter optimization. Although the two approaches are shown to be related in a formal mathematical sense, the text presents them separately because their relevant algorithm design issues are distinct and give rise to different performance capabilities. Together with algorithm design, the text demonstrates that there are new algorithms that are capable of incorporating input and output constraints, enable the algorithm to reconfigure systematically in order to meet the requirements of different reference signals and also to support new algorithms for local convergence of nonlinear iterative control. Simulation and application studies are used to illustrate algorithm properties and performance in systems like gantry robots and other elect...

Iteration of Aitken's Δ2 Process as an alternative to Pade approximants and the problem of using rational fractions to parameterize experimental data

International Nuclear Information System (INIS)

McRae, G.A.

1992-01-01

It is shown that iterating Aitken's Δ 2 process, or equivalently Shanks' ε algorithm on the partial sums of a Taylor series can lead to a dramatic convergence of the series. This method is compared to the standard technique of accelerating the convergence of series by constructing Pade Approximants. Also, the problem of determining Taylor expansion coefficients from experimental data fitted to Pade Approximants is reviewed, and it is suggested that a method based on this iteration scheme may be better. (author). 6 refs., 1 fig

Iterative Algorithm for Solving a Class of Quaternion Matrix Equation over the Generalized (P,Q-Reflexive Matrices

Directory of Open Access Journals (Sweden)

Ning Li

2013-01-01

Full Text Available The matrix equation ∑l=1uAlXBl+∑s=1vCsXTDs=F, which includes some frequently investigated matrix equations as its special cases, plays important roles in the system theory. In this paper, we propose an iterative algorithm for solving the quaternion matrix equation ∑l=1uAlXBl+∑s=1vCsXTDs=F over generalized (P,Q-reflexive matrices. The proposed iterative algorithm automatically determines the solvability of the quaternion matrix equation over generalized (P,Q-reflexive matrices. When the matrix equation is consistent over generalized (P,Q-reflexive matrices, the sequence {X(k} generated by the introduced algorithm converges to a generalized (P,Q-reflexive solution of the quaternion matrix equation. And the sequence {X(k} converges to the least Frobenius norm generalized (P,Q-reflexive solution of the quaternion matrix equation when an appropriate initial iterative matrix is chosen. Furthermore, the optimal approximate generalized (P,Q-reflexive solution for a given generalized (P,Q-reflexive matrix X0 can be derived. The numerical results indicate that the iterative algorithm is quite efficient.

Comparing models of rapidly rotating relativistic stars constructed by two numerical methods

Science.gov (United States)

Stergioulas, Nikolaos; Friedman, John L.

1995-05-01

We present the first direct comparison of codes based on two different numerical methods for constructing rapidly rotating relativistic stars. A code based on the Komatsu-Eriguchi-Hachisu (KEH) method (Komatsu et al. 1989), written by Stergioulas, is compared to the Butterworth-Ipser code (BI), as modified by Friedman, Ipser, & Parker. We compare models obtained by each method and evaluate the accuracy and efficiency of the two codes. The agreement is surprisingly good, and error bars in the published numbers for maximum frequencies based on BI are dominated not by the code inaccuracy but by the number of models used to approximate a continuous sequence of stars. The BI code is faster per iteration, and it converges more rapidly at low density, while KEH converges more rapidly at high density; KEH also converges in regions where BI does not, allowing one to compute some models unstable against collapse that are inaccessible to the BI code. A relatively large discrepancy recently reported (Eriguchi et al. 1994) for models based on Friedman-Pandharipande equation of state is found to arise from the use of two different versions of the equation of state. For two representative equations of state, the two-dimensional space of equilibrium configurations is displayed as a surface in a three-dimensional space of angular momentum, mass, and central density. We find, for a given equation of state, that equilibrium models with maximum values of mass, baryon mass, and angular momentum are (generically) either all unstable to collapse or are all stable. In the first case, the stable model with maximum angular velocity is also the model with maximum mass, baryon mass, and angular momentum. In the second case, the stable models with maximum values of these quantities are all distinct. Our implementation of the KEH method will be available as a public domain program for interested users.

Convergence acceleration of two-phase flow calculations in FLICA-4. A thermal-hydraulic 3D computer code

International Nuclear Information System (INIS)

Toumi, I.

1995-01-01

Time requirements for 3D two-phase flow steady state calculations are generally long. Usually, numerical methods for steady state problems are iterative methods consisting in time-like methods that are marched to a steady state. Based on the eigenvalue spectrum of the iteration matrix for various flow configuration, two convergence acceleration techniques are discussed; over-relaxation and eigenvalue annihilation. This methods were applied to accelerate the convergence of three dimensional steady state two-phase flow calculations within the FLICA-4 computer code. These acceleration methods are easy to implement and no extra computer memory is required. Successful results are presented for various test problems and a saving of 30 to 50 % in CPU time have been achieved. (author). 10 refs., 4 figs

Improvement of the Convergence of the Invariant Imbedding T-Matrix Method

Science.gov (United States)

Zhai, S.; Panetta, R. L.; Yang, P.

2017-12-01

The invariant imbedding T-matrix method (IITM) is based on an electromagnetic volume integral equation to compute the T-matrix of an arbitrary scattering particle. A free-space Green's function is chosen as the integral kernel and thus each source point is placed in an imaginary vacuum spherical shell extending from the center to that source point. The final T-matrix (of the largest circumscribing sphere) is obtained through an iterative relation that, layer by layer, computes the T-matrix from the particle center to the outermost shell. On each spherical shell surface, an integration of the product of the refractive index 𝜀(𝜃, 𝜑) and vector spherical harmonics must be performed, resulting in the so-called U-matrix, which directly leads to the T-matrix on the spherical surface. Our observations indicate that the matrix size and sparseness are determined by the particular refractive index function 𝜀(𝜃, 𝜑). If 𝜀(𝜃, 𝜑) is an analytic function on the surface, then the matrix elements resulting from the integration decay rapidly, leading to sparse matrix; if 𝜀(𝜃, 𝜑) is not (for example, contains jump discontinuities), then the matrix elements decay slowly, leading to a large dense matrix. The intersection between an irregular scatterer and each spherical shell can leave jump discontinuities in 𝜀(𝜃, 𝜑) distributed over the shell surface. The aforementioned feature is analogous to the Gibbs phenomenon appearing in the orthogonal expansion of non-smooth functions with Hermitian eigenfunctions (complex exponential, Legendre, Bessel,...) where poor convergence speed is a direct consequence of the slow decay rate of the expansion coefficients. Various methods have been developed to deal with this slow convergence in the presence of discontinuities. Among the different approaches the most practical one may be a spectral filter: a filter is applied on the

Rapidly converging path integral formalism. Pt. 1

International Nuclear Information System (INIS)

Bender, I.; Gromes, D.; Marquard, U.

1990-01-01

The action to be used in the path integral formalism is expanded in a systematic way in powers of the time spacing ε in order to optimize the convergence to the continuum limit. This modifies and extends the usual formalism in a transparent way. The path integral approximation to the Green function obtained by this method approaches the continuum Green function with a higher power of ε than the usual one. The general theoretical derivations are exemplified analytically for the harmonic oscillator and by Monte Carlo methods for the anharmonic oscillator. We also show how curvilinear coordinates and curved spaces can naturally be treated within this formalism. Work on field theory is in progress. (orig.)

A novel source convergence acceleration scheme for Monte Carlo criticality calculations, part I: Theory

International Nuclear Information System (INIS)

Griesheimer, D. P.; Toth, B. E.

2007-01-01

A novel technique for accelerating the convergence rate of the iterative power method for solving eigenvalue problems is presented. Smoothed Residual Acceleration (SRA) is based on a modification to the well known fixed-parameter extrapolation method for power iterations. In SRA the residual vector is passed through a low-pass filter before the extrapolation step. Filtering limits the extrapolation to the lower order Eigenmodes, improving the stability of the method and allowing the use of larger extrapolation parameters. In simple tests SRA demonstrates superior convergence acceleration when compared with an optimal fixed-parameter extrapolation scheme. The primary advantage of SRA is that it can be easily applied to Monte Carlo criticality calculations in order to reduce the number of discard cycles required before a stationary fission source distribution is reached. A simple algorithm for applying SRA to Monte Carlo criticality problems is described. (authors)

Convergence Guaranteed Nonlinear Constraint Model Predictive Control via I/O Linearization

Directory of Open Access Journals (Sweden)

Xiaobing Kong

2013-01-01

Full Text Available Constituting reliable optimal solution is a key issue for the nonlinear constrained model predictive control. Input-output feedback linearization is a popular method in nonlinear control. By using an input-output feedback linearizing controller, the original linear input constraints will change to nonlinear constraints and sometimes the constraints are state dependent. This paper presents an iterative quadratic program (IQP routine on the continuous-time system. To guarantee its convergence, another iterative approach is incorporated. The proposed algorithm can reach a feasible solution over the entire prediction horizon. Simulation results on both a numerical example and the continuous stirred tank reactors (CSTR demonstrate the effectiveness of the proposed method.

A Novel Iterative Scheme for the Very Fast and Accurate Solution of Non-LTE Radiative Transfer Problems

Science.gov (United States)

Trujillo Bueno, J.; Fabiani Bendicho, P.

1995-12-01

Iterative schemes based on Gauss-Seidel (G-S) and optimal successive over-relaxation (SOR) iteration are shown to provide a dramatic increase in the speed with which non-LTE radiation transfer (RT) problems can be solved. The convergence rates of these new RT methods are identical to those of upper triangular nonlocal approximate operator splitting techniques, but the computing time per iteration and the memory requirements are similar to those of a local operator splitting method. In addition to these properties, both methods are particularly suitable for multidimensional geometry, since they neither require the actual construction of nonlocal approximate operators nor the application of any matrix inversion procedure. Compared with the currently used Jacobi technique, which is based on the optimal local approximate operator (see Olson, Auer, & Buchler 1986), the G-S method presented here is faster by a factor 2. It gives excellent smoothing of the high-frequency error components, which makes it the iterative scheme of choice for multigrid radiative transfer. This G-S method can also be suitably combined with standard acceleration techniques to achieve even higher performance. Although the convergence rate of the optimal SOR scheme developed here for solving non-LTE RT problems is much higher than G-S, the computing time per iteration is also minimal, i.e., virtually identical to that of a local operator splitting method. While the conventional optimal local operator scheme provides the converged solution after a total CPU time (measured in arbitrary units) approximately equal to the number n of points per decade of optical depth, the time needed by this new method based on the optimal SOR iterations is only √n/2√2. This method is competitive with those that result from combining the above-mentioned Jacobi and G-S schemes with the best acceleration techniques. Contrary to what happens with the local operator splitting strategy currently in use, these novel

Convergence of the Distorted Wave Born series

International Nuclear Information System (INIS)

MacMillan, D.S.

1981-01-01

The aim of this thesis is to begin to understand the idea of reaction mechanisms in nonrelativistic scattering systems. If we have a complete reaction theory of a particular scattering system, then we claim that the theory itself must contain information about important reaction mechanisms in the system. This information can be used to decide what reaction mechanisms should be included in an approximate calculation. To investigate this claim, we studied several solvable models. The primary concept employed in studying our models is the convergence of the multistep series generated by iterating the corresponding scattering integral equation. We known that the eigenvalues of the kernel of the Lippmann-Schwinger equation for potential scattering determine the rate of convergence of the Born series. The Born series will converge only if these eigenvalues all life within the unit circle. We extend these results to a study of the distorted wave Born series for inelastic scattering. The convergence criterion tells us when approximations are valid. We learn how the convergence of the distorted wave series depends upon energy, coupling constants, angular momentum, and angular momentum transfer. In one of our models, we look at several possible distorting potentials to see which one gives the best convergence. We have also applied our results to several actual DWBA or coupled channel calculations in the literature. In addition to the study of models of two-body scattering systems, we have considered the case of rearrangement scattering. We have discussed the formulation of (N greater than or equal to 3)-body distorted wave equations in which the interior dynamics have been redistributed by introducing compact N-body distortion potentials

Constructing Frozen Jacobian Iterative Methods for Solving Systems of Nonlinear Equations, Associated with ODEs and PDEs Using the Homotopy Method

Directory of Open Access Journals (Sweden)

Uswah Qasim

2016-03-01

Full Text Available A homotopy method is presented for the construction of frozen Jacobian iterative methods. The frozen Jacobian iterative methods are attractive because the inversion of the Jacobian is performed in terms of LUfactorization only once, for a single instance of the iterative method. We embedded parameters in the iterative methods with the help of the homotopy method: the values of the parameters are determined in such a way that a better convergence rate is achieved. The proposed homotopy technique is general and has the ability to construct different families of iterative methods, for solving weakly nonlinear systems of equations. Further iterative methods are also proposed for solving general systems of nonlinear equations.

Convergence of the iterative solution of loop equations in planar QCD2

International Nuclear Information System (INIS)

Marchesini, G.; Onofri, E.

1985-01-01

A numerical algorithm recently introduced to solve the loop equations in lattice gauge theory is tested on a simple model with a phase transition: the planar limit of QCD in two dimensions. We show that the algorithm reproduces the correct known results in both strong and weak coupling phases, provided that a relaxation parameter a la Gauss-Seidel is introduced in the iteration process. We also give some analytical explanation of the applicability of the method. (orig.)

A fast iterative method for computing particle beams penetrating matter

International Nuclear Information System (INIS)

Boergers, C.

1997-01-01

Beams of microscopic particles penetrating matter are important in several fields. The application motivating our parameter choices in this paper is electron beam cancer therapy. Mathematically, a steady particle beam penetrating matter, or a configuration of several such beams, is modeled by a boundary value problem for a Boltzmann equation. Grid-based discretization of this problem leads to a system of algebraic equations. This system is typically very large because of the large number of independent variables in the Boltzmann equation (six if time independence is the only dimension-reducing assumption). If grid-based methods are to be practical at all, it is therefore necessary to develop fast solvers for the discretized problems. This is the subject of the present paper. For two-dimensional, mono-energetic, linear particle beam problems, we describe an iterative domain decomposition algorithm based on overlapping decompositions of the set of particle directions and computationally demonstrate its rapid, grid independent convergence. There appears to be no fundamental obstacle to generalizing the method to three-dimensional, energy dependent problems. 34 refs., 15 figs., 6 tabs

An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions, Addendum

Science.gov (United States)

Peters, B. C., Jr.; Walker, H. F.

1975-01-01

New results and insights concerning a previously published iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions were discussed. It was shown that the procedure converges locally to the consistent maximum likelihood estimate as long as a specified parameter is bounded between two limits. Bound values were given to yield optimal local convergence.

Comments on new iterative methods for solving linear systems

Directory of Open Access Journals (Sweden)

Wang Ke

2017-06-01

Full Text Available Some new iterative methods were presented by Du, Zheng and Wang for solving linear systems in [3], where it is shown that the new methods, comparing to the classical Jacobi or Gauss-Seidel method, can be applied to more systems and have faster convergence. This note shows that their methods are suitable for more matrices than positive matrices which the authors suggested through further analysis and numerical examples.

Variational iteration method for solving coupled-KdV equations

International Nuclear Information System (INIS)

Assas, Laila M.B.

2008-01-01

In this paper, the He's variational iteration method is applied to solve the non-linear coupled-KdV equations. This method is based on the use of Lagrange multipliers for identification of optimal value of a parameter in a functional. This technique provides a sequence of functions which converge to the exact solution of the coupled-KdV equations. This procedure is a powerful tool for solving coupled-KdV equations

Iterative solution of nonlinear equations with strongly accretive operators

International Nuclear Information System (INIS)

Chidume, C.E.

1991-10-01

Let E be a real Banach space with a uniformly convex dual, and let K be a nonempty closed convex and bounded subset of E. Suppose T:K→K is a strongly accretive map such that for each f is an element of K the equation Tx=f has a solution in K. It is proved that each of the two well known fixed point iteration methods (the Mann and Ishikawa iteration methods) converges strongly to a solution of the equation Tx=f. Furthermore, our method shows that such a solution is necessarily unique. Explicit error estimates are given. Our results resolve in the affirmative two open problems (J. Math. Anal. Appl. Vol 151(2) (1990), p. 460) and generalize important known results. (author). 32 refs

Numerical modeling of the radiative transfer in a turbid medium using the synthetic iteration.

Science.gov (United States)

Budak, Vladimir P; Kaloshin, Gennady A; Shagalov, Oleg V; Zheltov, Victor S

2015-07-27

In this paper we propose the fast, but the accurate algorithm for numerical modeling of light fields in the turbid media slab. For the numerical solution of the radiative transfer equation (RTE) it is required its discretization based on the elimination of the solution anisotropic part and the replacement of the scattering integral by a finite sum. The solution regular part is determined numerically. A good choice of the method of the solution anisotropic part elimination determines the high convergence of the algorithm in the mean square metric. The method of synthetic iterations can be used to improve the convergence in the uniform metric. A significant increase in the solution accuracy with the use of synthetic iterations allows applying the two-stream approximation for the regular part determination. This approach permits to generalize the proposed method in the case of an arbitrary 3D geometry of the medium.

An iterative reconstruction from truncated projection data

International Nuclear Information System (INIS)

Anon.

1985-01-01

Various methods have been proposed for tomographic reconstruction from truncated projection data. In this paper, a reconstructive method is discussed which consists of iterations of filtered back-projection, reprojection and some nonlinear processings. First, the method is so constructed that it converges to a fixed point. Then, to examine its effectiveness, comparisons are made by computer experiments with two existing reconstructive methods for truncated projection data, that is, the method of extrapolation based on the smooth assumption followed by filtered back-projection, and modified additive ART

Performance and Complexity Evaluation of Iterative Receiver for Coded MIMO-OFDM Systems

Directory of Open Access Journals (Sweden)

Rida El Chall

2016-01-01

Full Text Available Multiple-input multiple-output (MIMO technology in combination with channel coding technique is a promising solution for reliable high data rate transmission in future wireless communication systems. However, these technologies pose significant challenges for the design of an iterative receiver. In this paper, an efficient receiver combining soft-input soft-output (SISO detection based on low-complexity K-Best (LC-K-Best decoder with various forward error correction codes, namely, LTE turbo decoder and LDPC decoder, is investigated. We first investigate the convergence behaviors of the iterative MIMO receivers to determine the required inner and outer iterations. Consequently, the performance of LC-K-Best based receiver is evaluated in various LTE channel environments and compared with other MIMO detection schemes. Moreover, the computational complexity of the iterative receiver with different channel coding techniques is evaluated and compared with different modulation orders and coding rates. Simulation results show that LC-K-Best based receiver achieves satisfactory performance-complexity trade-offs.

Simulating prescribed particle densities in the grand canonical ensemble using iterative algorithms.

Science.gov (United States)

Malasics, Attila; Gillespie, Dirk; Boda, Dezso

2008-03-28

We present two efficient iterative Monte Carlo algorithms in the grand canonical ensemble with which the chemical potentials corresponding to prescribed (targeted) partial densities can be determined. The first algorithm works by always using the targeted densities in the kT log(rho(i)) (ideal gas) terms and updating the excess chemical potentials from the previous iteration. The second algorithm extrapolates the chemical potentials in the next iteration from the results of the previous iteration using a first order series expansion of the densities. The coefficients of the series, the derivatives of the densities with respect to the chemical potentials, are obtained from the simulations by fluctuation formulas. The convergence of this procedure is shown for the examples of a homogeneous Lennard-Jones mixture and a NaCl-CaCl(2) electrolyte mixture in the primitive model. The methods are quite robust under the conditions investigated. The first algorithm is less sensitive to initial conditions.

Performance Analysis of Iterative Channel Estimation and Multiuser Detection in Multipath DS-CDMA Channels

Science.gov (United States)

Li, Husheng; Betz, Sharon M.; Poor, H. Vincent

2007-05-01

This paper examines the performance of decision feedback based iterative channel estimation and multiuser detection in channel coded aperiodic DS-CDMA systems operating over multipath fading channels. First, explicit expressions describing the performance of channel estimation and parallel interference cancellation based multiuser detection are developed. These results are then combined to characterize the evolution of the performance of a system that iterates among channel estimation, multiuser detection and channel decoding. Sufficient conditions for convergence of this system to a unique fixed point are developed.

Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks

Science.gov (United States)

Xu, Shuang; Wang, Pei; Lü, Jinhu

2017-01-01

Designing node influence ranking algorithms can provide insights into network dynamics, functions and structures. Increasingly evidences reveal that node’s spreading ability largely depends on its neighbours. We introduce an iterative neighbourinformation gathering (Ing) process with three parameters, including a transformation matrix, a priori information and an iteration time. The Ing process iteratively combines priori information from neighbours via the transformation matrix, and iteratively assigns an Ing score to each node to evaluate its influence. The algorithm appropriates for any types of networks, and includes some traditional centralities as special cases, such as degree, semi-local, LeaderRank. The Ing process converges in strongly connected networks with speed relying on the first two largest eigenvalues of the transformation matrix. Interestingly, the eigenvector centrality corresponds to a limit case of the algorithm. By comparing with eight renowned centralities, simulations of susceptible-infected-removed (SIR) model on real-world networks reveal that the Ing can offer more exact rankings, even without a priori information. We also observe that an optimal iteration time is always in existence to realize best characterizing of node influence. The proposed algorithms bridge the gaps among some existing measures, and may have potential applications in infectious disease control, designing of optimal information spreading strategies.

ITER...ation

International Nuclear Information System (INIS)

Troyon, F.

1997-01-01

Recurrent attacks against ITER, the new generation of tokamak are a mix of political and scientific arguments. This short article draws a historical review of the European fusion program. This program has allowed to build and manage several installations in the aim of getting experimental results necessary to lead the program forwards. ITER will bring together a fusion reactor core with technologies such as materials, superconductive coils, heating devices and instrumentation in order to validate and delimit the operating range. ITER will be a logical and decisive step towards the use of controlled fusion. (A.C.)

Convergent Power Series of sech⁡(x and Solutions to Nonlinear Differential Equations

Directory of Open Access Journals (Sweden)

U. Al Khawaja

2018-01-01

Full Text Available It is known that power series expansion of certain functions such as sech⁡(x diverges beyond a finite radius of convergence. We present here an iterative power series expansion (IPS to obtain a power series representation of sech⁡(x that is convergent for all x. The convergent series is a sum of the Taylor series of sech⁡(x and a complementary series that cancels the divergence of the Taylor series for x≥π/2. The method is general and can be applied to other functions known to have finite radius of convergence, such as 1/(1+x2. A straightforward application of this method is to solve analytically nonlinear differential equations, which we also illustrate here. The method provides also a robust and very efficient numerical algorithm for solving nonlinear differential equations numerically. A detailed comparison with the fourth-order Runge-Kutta method and extensive analysis of the behavior of the error and CPU time are performed.

Computation of fields in an arbitrarily shaped heterogeneous dielectric or biological body by an iterative conjugate gradient method

International Nuclear Information System (INIS)

Wang, J.J.H.; Dubberley, J.R.

1989-01-01

Electromagnetic (EM) fields in a three-dimensional, arbitrarily shaped heterogeneous dielectric or biological body illuminated by a plane wave are computed by an iterative conjugate gradient method. The method is a generalized method of moments applied to the volume integral equation. Because no matrix is explicitly involved or stored, the present iterative method is capable of computing EM fields in objects an order of magnitude larger than those that can be handled by the conventional method of moments. Excellent numerical convergence is achieved. Perfect convergence to the result of the conventional moment method using the same basis and weighted with delta functions is consistently achieved in all the cases computed, indicating that these two algorithms (direct and interactive) are equivalent

Analysis of a block Gauss-Seidel iterative method for a finite element discretization of the neutron transport equation

International Nuclear Information System (INIS)

Lorence, L.J. Jr.; Martin, W.R.; Luskin, M.

1985-01-01

We prove the convergence of a finite element discretization of the neutron transport equation. The iterative solution of the resulting linear system by a block Gauss-Seidel method is also analyzed. This procedure is shown to require less storage than the direct solution by Gaussian elimination, and an estimate for the rate of convergence is used to show that fewer arithmetic operations are required

ADI as a preconditioning for solving the convection-diffusion equation

International Nuclear Information System (INIS)

Chin, R.C.Y.; Manteuffel, T.A.; De Pillis, J.

1984-01-01

The authors examine a splitting of the operator obtained from a steady convection-diffusion equation with variable coefficients in which the convection term dominates. The operator is split into a dominant and subdominant parts consistent with the inherent directional property of the partial differential equation. The equations involving the dominant parts should be easily solved. The authors accelerate the convergence of this splitting or the outer iteration by a Chebyshev semi-iterative method. When the dominant part has constant coefficients, it can be easily solved using alternating direction implicit (ADI) methods. This is called the inner iteration. The optimal parameters for a stationary two-parameter ADI method are obtained when the eigenvalues become complex. This corresponds to either the horizontal or the vertical half-grid Reynolds number larger than unity. The Chebyshev semi-iterative method is used to accelerate the convergence of the inner ADI iteration. A two-fold increase in speed is obtained when the ADI iteration matrix has real eigenvalues, and the increase is less significant when the eigenvalues are complex. If either the horizontal or the vertical half-grid Reynolds number is equal to one, the spectral radius of the optimal ADI iterative matrix is zero. However, a high degree of nilpotency impairs rapid convergence. This problem is removed by introducing a more implicit iterative method called ADI/Gauss-Seidel (ADI/GS). ADI/GS resolves the nilpotency and, thus, converges more rapidly for half-grid Reynolds number near 1. Finally, these methods are compared with several well-known schemes on test problems. 23 references, 5 figures

On choosing a nonlinear initial iterate for solving the 2-D 3-T heat conduction equations

International Nuclear Information System (INIS)

An Hengbin; Mo Zeyao; Xu Xiaowen; Liu Xu

2009-01-01

The 2-D 3-T heat conduction equations can be used to approximately describe the energy broadcast in materials and the energy swapping between electron and photon or ion. To solve the equations, a fully implicit finite volume scheme is often used as the discretization method. Because the energy diffusion and swapping coefficients have a strongly nonlinear dependence on the temperature, and some physical parameters are discontinuous across the interfaces between the materials, it is a challenge to solve the discretized nonlinear algebraic equations. Particularly, as time advances, the temperature varies so greatly in the front of energy that it is difficult to choose an effective initial iterate when the nonlinear algebraic equations are solved by an iterative method. In this paper, a method of choosing a nonlinear initial iterate is proposed for iterative solving this kind of nonlinear algebraic equations. Numerical results show the proposed initial iterate can improve the computational efficiency, and also the convergence behavior of the nonlinear iteration.

D-Iteration: diffusion approach for solving PageRank

OpenAIRE

Hong, Dohy; Huynh, The Dang; Mathieu, Fabien

2015-01-01

In this paper we present a new method that can accelerate the computation of the PageRank importance vector. Our method, called D-Iteration (DI), is based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model and is potentially adapted to asynchronous implementation. We give theoretical results about the convergence of our algorithm and we show through experimentations on a real Web graph that DI can improve the computation efficiency compared to other ...

A Parametric Learning and Identification Based Robust Iterative Learning Control for Time Varying Delay Systems

Directory of Open Access Journals (Sweden)

Lun Zhai

2014-01-01

Full Text Available A parametric learning based robust iterative learning control (ILC scheme is applied to the time varying delay multiple-input and multiple-output (MIMO linear systems. The convergence conditions are derived by using the H∞ and linear matrix inequality (LMI approaches, and the convergence speed is analyzed as well. A practical identification strategy is applied to optimize the learning laws and to improve the robustness and performance of the control system. Numerical simulations are illustrated to validate the above concepts.

Strong Convergence to Common Fixed Points of a Countable Family of Asymptotically Strictly Quasi-ϕ-Pseudocontractions

Directory of Open Access Journals (Sweden)

Wei-Qi Deng

2013-01-01

Full Text Available Based on an original idea, namely, a specific way of choosing the indexes of the involved mappings, we propose a new hybrid shrinking iteration scheme for approximating some common fixed points of a countable family of asymptotically strictly quasi-ϕ-pseudocontractions and obtain a strong convergence theorem in the framework of Banach space. Our result extends other authors, related results existing in the current literature. As application, an iterative solution to a system of equilibrium problems is provided.

A linear iterative unfolding method

International Nuclear Information System (INIS)

László, András

2012-01-01

A frequently faced task in experimental physics is to measure the probability distribution of some quantity. Often this quantity to be measured is smeared by a non-ideal detector response or by some physical process. The procedure of removing this smearing effect from the measured distribution is called unfolding, and is a delicate problem in signal processing, due to the well-known numerical ill behavior of this task. Various methods were invented which, given some assumptions on the initial probability distribution, try to regularize the unfolding problem. Most of these methods definitely introduce bias into the estimate of the initial probability distribution. We propose a linear iterative method (motivated by the Neumann series / Landweber iteration known in functional analysis), which has the advantage that no assumptions on the initial probability distribution is needed, and the only regularization parameter is the stopping order of the iteration, which can be used to choose the best compromise between the introduced bias and the propagated statistical and systematic errors. The method is consistent: 'binwise' convergence to the initial probability distribution is proved in absence of measurement errors under a quite general condition on the response function. This condition holds for practical applications such as convolutions, calorimeter response functions, momentum reconstruction response functions based on tracking in magnetic field etc. In presence of measurement errors, explicit formulae for the propagation of the three important error terms is provided: bias error (distance from the unknown to-be-reconstructed initial distribution at a finite iteration order), statistical error, and systematic error. A trade-off between these three error terms can be used to define an optimal iteration stopping criterion, and the errors can be estimated there. We provide a numerical C library for the implementation of the method, which incorporates automatic

Fast Multi-Symbol Based Iterative Detectors for UWB Communications

Directory of Open Access Journals (Sweden)

Lottici Vincenzo

2010-01-01

Full Text Available Ultra-wideband (UWB impulse radios have shown great potential in wireless local area networks for localization, coexistence with other services, and low probability of interception and detection. However, low transmission power and high multipath effect make the detection of UWB signals challenging. Recently, multi-symbol based detection has caught attention for UWB communications because it provides good performance and does not require explicit channel estimation. Most of the existing multi-symbol based methods incur a higher computational cost than can be afforded in the envisioned UWB systems. In this paper, we propose an iterative multi-symbol based method that has low complexity and provides near optimal performance. Our method uses only one initial symbol to start and applies a decision directed approach to iteratively update a filter template and information symbols. Simulations show that our method converges in only a few iterations (less than 5, and that when the number of symbols increases, the performance of our method approaches that of the ideal Rake receiver.

The irace package: Iterated racing for automatic algorithm configuration

Directory of Open Access Journals (Sweden)

Manuel López-Ibáñez

2016-01-01

Full Text Available Modern optimization algorithms typically require the setting of a large number of parameters to optimize their performance. The immediate goal of automatic algorithm configuration is to find, automatically, the best parameter settings of an optimizer. Ultimately, automatic algorithm configuration has the potential to lead to new design paradigms for optimization software. The irace package is a software package that implements a number of automatic configuration procedures. In particular, it offers iterated racing procedures, which have been used successfully to automatically configure various state-of-the-art algorithms. The iterated racing procedures implemented in irace include the iterated F-race algorithm and several extensions and improvements over it. In this paper, we describe the rationale underlying the iterated racing procedures and introduce a number of recent extensions. Among these, we introduce a restart mechanism to avoid premature convergence, the use of truncated sampling distributions to handle correctly parameter bounds, and an elitist racing procedure for ensuring that the best configurations returned are also those evaluated in the highest number of training instances. We experimentally evaluate the most recent version of irace and demonstrate with a number of example applications the use and potential of irace, in particular, and automatic algorithm configuration, in general.

A new ART iterative method and a comparison of performance among various ART methods

International Nuclear Information System (INIS)

Tan, Yufeng; Sato, Shunsuke

1993-01-01

Many algebraic reconstruction techniques (ART) image reconstruction algorithms, for instance, simultaneous iterative reconstruction technique (SIRT), the relaxation method and multiplicative ART (MART), have been proposed and their convergent properties have been studied. SIRT and the underrelaxed relaxation method converge to the least-squares solution, but the convergent speeds are very slow. The Kaczmarz method converges very quickly, but the reconstructed images contain a lot of noise. The comparative studies between these algorithms have been done by Gilbert and others, but are not adequate. In this paper, we (1) propose a new method which is a modified Kaczmarz method and prove its convergence property, (2) study performance of 7 algorithms including the one proposed here by computer simulation for 3 kinds of typical phantoms. The method proposed here does not give the least-square solution, but the root mean square errors of its reconstructed images decrease very quickly after few interations. The result shows that the method proposed here gives a better reconstructed image. (author)

Criticality calculations by source-collision iteration technique for cylindrical systems

International Nuclear Information System (INIS)

Sundaram, V.K.; Gopinath, D.V.

1977-01-01

A fast-converging iterative technique is presented which uses first collision probabilities developed for obtaining criticality parameters in two-region cylindrical systems with multigroup structure in energy of the neutrons. The space transmission matrix is obtained part analytically and part numerically through evaluation of a single-fold integral. Critical dimensions for condensed systems of uranium and plutonium computed using this method are presented and compared with published values

Non-LTE radiative transfer with lambda-acceleration - Convergence properties using exact full and diagonal lambda-operators

Science.gov (United States)

Macfarlane, J. J.

1992-01-01

We investigate the convergence properties of Lambda-acceleration methods for non-LTE radiative transfer problems in planar and spherical geometry. Matrix elements of the 'exact' A-operator are used to accelerate convergence to a solution in which both the radiative transfer and atomic rate equations are simultaneously satisfied. Convergence properties of two-level and multilevel atomic systems are investigated for methods using: (1) the complete Lambda-operator, and (2) the diagonal of the Lambda-operator. We find that the convergence properties for the method utilizing the complete Lambda-operator are significantly better than those of the diagonal Lambda-operator method, often reducing the number of iterations needed for convergence by a factor of between two and seven. However, the overall computational time required for large scale calculations - that is, those with many atomic levels and spatial zones - is typically a factor of a few larger for the complete Lambda-operator method, suggesting that the approach should be best applied to problems in which convergence is especially difficult.

Extending the reach of strong-coupling: an iterative technique for Hamiltonian lattice models

International Nuclear Information System (INIS)

Alberty, J.; Greensite, J.; Patkos, A.

1983-12-01

The authors propose an iterative method for doing lattice strong-coupling-like calculations in a range of medium to weak couplings. The method is a modified Lanczos scheme, with greatly improved convergence properties. The technique is tested on the Mathieu equation and on a Hamiltonian finite-chain XY model, with excellent results. (Auth.)

A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition

International Nuclear Information System (INIS)

Jin Qinian

2008-01-01

In this paper we consider the iteratively regularized Gauss–Newton method for solving nonlinear ill-posed inverse problems. Under merely the Lipschitz condition, we prove that this method together with an a posteriori stopping rule defines an order optimal regularization method if the solution is regular in some suitable sense

Velocity Tracking Control of Wheeled Mobile Robots by Iterative Learning Control

Directory of Open Access Journals (Sweden)

Xiaochun Lu

2016-05-01

Full Text Available This paper presents an iterative learning control (ILC strategy to resolve the trajectory tracking problem of wheeled mobile robots (WMRs based on dynamic model. In the previous study of WMRs’ trajectory tracking, ILC was usually applied to the kinematical model of WMRs with the assumption that desired velocity can be tracked immediately. However, this assumption cannot be realized in the real world at all. The kinematic and dynamic models of WMRs are deduced in this chapter, and a novel combination of D-type ILC algorithm and dynamic model of WMR with random bounded disturbances are presented. To analyze the convergence of the algorithm, the method of contracting mapping, which shows that the designed controller can make the velocity tracking errors converge to zero completely when the iteration times tend to infinite, is adopted. Simulation results show the effectiveness of D-type ILC in the trajectory tracking problem of WMRs, demonstrating the effectiveness and robustness of the algorithm in the condition of random bounded disturbance. A comparative study conducted between D-type ILC and compound cosine function neural network (NN controller also demonstrates the effectiveness of the ILC strategy.

On a new iterative method for solving linear systems and comparison results

Science.gov (United States)

Jing, Yan-Fei; Huang, Ting-Zhu

2008-10-01

In Ujevic [A new iterative method for solving linear systems, Appl. Math. Comput. 179 (2006) 725-730], the author obtained a new iterative method for solving linear systems, which can be considered as a modification of the Gauss-Seidel method. In this paper, we show that this is a special case from a point of view of projection techniques. And a different approach is established, which is both theoretically and numerically proven to be better than (at least the same as) Ujevic's. As the presented numerical examples show, in most cases, the convergence rate is more than one and a half that of Ujevic.

NUMERICAL WITHOUT ITERATION METHOD OF MODELING OF ELECTROMECHANICAL PROCESSES IN ASYNCHRONOUS ENGINES

Directory of Open Access Journals (Sweden)

D. G. Patalakh

2018-02-01

Full Text Available Purpose. Development of calculation of electromagnetic and electromechanic transients is in asynchronous engines without iterations. Methodology. Numeral methods of integration of usual differential equations, programming. Findings. As the system of equations, describing the dynamics of asynchronous engine, contents the products of rotor and stator currents and product of rotation frequency of rotor and currents, so this system is nonlinear one. The numeral solution of nonlinear differential equations supposes an iteration process on every step of integration. Time-continuing and badly converging iteration process may be the reason of calculation slowing. The improvement of numeral method by the way of an iteration process removing is offered. As result the modeling time is reduced. The improved numeral method is applied for integration of differential equations, describing the dynamics of asynchronous engine. Originality. The improvement of numeral method allowing to execute numeral integrations of differential equations containing product of functions is offered, that allows to avoid an iteration process on every step of integration and shorten modeling time. Practical value. On the basis of the offered methodology the universal program of modeling of electromechanics processes in asynchronous engines could be developed as taking advantage on fast-acting.

Existence and convergence theorems for a class of multi-valued variational inclusions in Banach spaces

International Nuclear Information System (INIS)

Chidume, C.E.; Zegeye, H.; Kazmi, K.R.

2002-07-01

An existence theorem for a new class of multi-valued variational inclusion problems is established in smooth Banach spaces. Further, it is shown that a sequence of a Mann-type iteration algorithm is strongly convergent to the solutions in this class of variational inclusion problems. (author)

A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization

Directory of Open Access Journals (Sweden)

Zhijun Luo

2014-01-01

Full Text Available A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.

Iterative Decoding of Concatenated Codes: A Tutorial

Directory of Open Access Journals (Sweden)

Phillip A. Regalia

2005-05-01

Full Text Available The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo CDMA, among others. Despite an accrued understanding of iterative decoding over the years, the “turbo principle” remains elusive to master analytically, thereby inciting interest from researchers outside the communications domain. In this spirit, we develop a tutorial presentation of iterative decoding for parallel and serial concatenated codes, in terms hopefully accessible to a broader audience. We motivate iterative decoding as a computationally tractable attempt to approach maximum-likelihood decoding, and characterize fixed points in terms of a “consensus” property between constituent decoders. We review how the decoding algorithm for both parallel and serial concatenated codes coincides with an alternating projection algorithm, which allows one to identify conditions under which the algorithm indeed converges to a maximum-likelihood solution, in terms of particular likelihood functions factoring into the product of their marginals. The presentation emphasizes a common framework applicable to both parallel and serial concatenated codes.

Efficient Four-Parametric with-and-without-Memory Iterative Methods Possessing High Efficiency Indices

Directory of Open Access Journals (Sweden)

Alicia Cordero

2018-01-01

Full Text Available We construct a family of derivative-free optimal iterative methods without memory to approximate a simple zero of a nonlinear function. Error analysis demonstrates that the without-memory class has eighth-order convergence and is extendable to with-memory class. The extension of new family to the with-memory one is also presented which attains the convergence order 15.5156 and a very high efficiency index 15.51561/4≈1.9847. Some particular schemes of the with-memory family are also described. Numerical examples and some dynamical aspects of the new schemes are given to support theoretical results.

A systematic iterative approach to the equations of low type

International Nuclear Information System (INIS)

Znojil, M.

1987-01-01

Nonlinear singular integral equations of the Low type appear in the description of π-N scattering amplitude at relativistic energies. The standard iteration solution differs and does not give sufficiently exact results even using the Pade approximation. A new approach is proposed. Its essence lies in a repeated formal simplification of the equation accompanied by a representation of the simplified amplitude in a generalized continued-fractional form. A simple example demonstrate that the new method improves the convergence of previous approach and essentially expands the region of its convergence. From the other side, its nonequivalence to a more complicate Newton-Kantorovich method is shown. In the future more realistic applications of the method one can expect increasing of result reliability

Exponential convergence and acceleration of Hartree-Fock calculations

International Nuclear Information System (INIS)

Bonaccorso, A.; Di Toro, M.; Lomnitz-Adler, J.

1979-01-01

It is shown that one can expect an exponential behaviour for the convergence of the Hartree-Fock solution during the HF iteration procedure. This property is used to extrapolate some collective degrees of freedom, in this case the shape, in order to speed up the self-consistent calculation. For axially deformed nuclei the method is applied to the quadrupole moment which corresponds to a simple scaling transformation on the single particle wave functions. Results are shown for the deformed nuclei 20 Ne and 28 Si with a Skyrme interaction. (Auth.)

An iterative learning controller for nonholonomic mobile robots

International Nuclear Information System (INIS)

Oriolo, G.; Panzieri, S.; Ulivi, G.

1998-01-01

The authors present an iterative learning controller that applies to nonholonomic mobile robots, as well as other systems that can be put in chained form. The learning algorithm exploits the fact that chained-form. The learning algorithm exploits the fact that chained-form systems are linear under piecewise-constant inputs. The proposed control scheme requires the execution of a small number of experiments to drive the system to the desired state in finite time, with nice convergence and robustness properties with respect to modeling inaccuracies as well as disturbances. To avoid the necessity of exactly reinitializing the system at each iteration, the basic method is modified so as to obtain a cyclic controller, by which the system is cyclically steered through an arbitrary sequence of states. As a case study, a carlike mobile robot is considered. Both simulation and experimental results are reported to show the performance of the method

Successive Standardization of Rectangular Arrays

Directory of Open Access Journals (Sweden)

Richard A. Olshen

2012-02-01

Full Text Available In this note we illustrate and develop further with mathematics and examples, the work on successive standardization (or normalization that is studied earlier by the same authors in [1] and [2]. Thus, we deal with successive iterations applied to rectangular arrays of numbers, where to avoid technical difficulties an array has at least three rows and at least three columns. Without loss, an iteration begins with operations on columns: first subtract the mean of each column; then divide by its standard deviation. The iteration continues with the same two operations done successively for rows. These four operations applied in sequence completes one iteration. One then iterates again, and again, and again, ... In [1] it was argued that if arrays are made up of real numbers, then the set for which convergence of these successive iterations fails has Lebesgue measure 0. The limiting array has row and column means 0, row and column standard deviations 1. A basic result on convergence given in [1] is true, though the argument in [1] is faulty. The result is stated in the form of a theorem here, and the argument for the theorem is correct. Moreover, many graphics given in [1] suggest that except for a set of entries of any array with Lebesgue measure 0, convergence is very rapid, eventually exponentially fast in the number of iterations. Because we learned this set of rules from Bradley Efron, we call it “Efron’s algorithm”. More importantly, the rapidity of convergence is illustrated by numerical examples.

Iterated interactions method. Realistic NN potential

International Nuclear Information System (INIS)

Gorbatov, A.M.; Skopich, V.L.; Kolganova, E.A.

1991-01-01

The method of iterated potential is tested in the case of realistic fermionic systems. As a base for comparison calculations of the 16 O system (using various versions of realistic NN potentials) by means of the angular potential-function method as well as operators of pairing correlation were used. The convergence of genealogical series is studied for the central Malfliet-Tjon potential. In addition the mathematical technique of microscopical calculations is improved: new equations for correlators in odd states are suggested and the technique of leading terms was applied for the first time to calculations of heavy p-shell nuclei in the basis of angular potential functions

A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations

KAUST Repository

Bagci, Hakan; Pasciak, Joseph E.; Sirenko, Kostyantyn

2014-01-01

We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.

A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations

KAUST Repository

Bagci, Hakan

2014-11-11

We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.

Ishikawa iteration process for nonlinear Lipschitz strongly accretive mappings

International Nuclear Information System (INIS)

Chidume, C.E.; Osilike, M.O.

1994-05-01

Let E=L p , p≥2 and let T:E→ E be a Lipschitzian and strongly accretive mapping. Let S:E → E be defined by Sx=f-Tx+x. It is proved that under suitable conditions on the real sequences {α n } ∞ n=0 and {β n } ∞ n=0 , the iteration process, x 0 is an element of E, x n+1 =(1-α n ) x n +α n S[(1-β n ) x n +β n Sx n ], n≥0, converges strongly to the unique solution of Tx=f. A related result deals with the iterative approximation of fixed points for Lipschitz strongly pseudocontractive mappings in E. A consequence of our results gives an affirmative answer to a problem posed by one of the authors in 1990. (J. Math. Anal. Appl. 151, 2 (1990) p. 460). (author). 36 refs

The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method

Science.gov (United States)

Niki, Hiroshi; Harada, Kyouji; Morimoto, Munenori; Sakakihara, Michio

2004-03-01

Several preconditioned iterative methods reported in the literature have been used for improving the convergence rate of the Gauss-Seidel method. In this article, on the basis of nonnegative matrix, comparisons between some splittings for such preconditioned matrices are derived. Simple numerical examples are also given.

Effect of inlect swirl on the convergence behavior of a combustor flow computation algorithm

International Nuclear Information System (INIS)

Shyy, W.; Braaten, M.E.; Hwang, T.H.

1987-01-01

The flow in a single sector of gas-turbine combustor with dilution holes has been studied numerically. It is found that there are some distinctive differences between the numerical behavior of the solution algorithm for combusting and noncombusting flows in a single-cup gas turbine combustor enclosed by four-sided solid walls. With the use of an iterative solution procedure and the standard κ-ε turbulence model, converged steady-state solutions are obtained for noncombusting flows with or without the presence of swirl of dilution jets. However, for the combusting flows, the interaction between the strength of the swirl ratio and the jet-to-main flow velocity ratio affects the ability of the algorithm to achieve a converged steady-state solution. Increasing inlet swirl causes the flow field to oscillate as the iterations progress, and to fail to reach a steady-state solution, while increasing the flow through the dilution jets helps achieve a steady-state solution. The above phenomena are not observed for the flows with periodic boundary conditions along two side planes

Iterative discrete ordinates solution of the equation for surface-reflected radiance

Science.gov (United States)

Radkevich, Alexander

2017-11-01

This paper presents a new method of numerical solution of the integral equation for the radiance reflected from an anisotropic surface. The equation relates the radiance at the surface level with BRDF and solutions of the standard radiative transfer problems for a slab with no reflection on its surfaces. It is also shown that the kernel of the equation satisfies the condition of the existence of a unique solution and the convergence of the successive approximations to that solution. The developed method features two basic steps: discretization on a 2D quadrature, and solving the resulting system of algebraic equations with successive over-relaxation method based on the Gauss-Seidel iterative process. Presented numerical examples show good coincidence between the surface-reflected radiance obtained with DISORT and the proposed method. Analysis of contributions of the direct and diffuse (but not yet reflected) parts of the downward radiance to the total solution is performed. Together, they represent a very good initial guess for the iterative process. This fact ensures fast convergence. The numerical evidence is given that the fastest convergence occurs with the relaxation parameter of 1 (no relaxation). An integral equation for BRDF is derived as inversion of the original equation. The potential of this new equation for BRDF retrievals is analyzed. The approach is found not viable as the BRDF equation appears to be an ill-posed problem, and it requires knowledge the surface-reflected radiance on the entire domain of both Sun and viewing zenith angles.

Solving large mixed linear models using preconditioned conjugate gradient iteration.

Science.gov (United States)

Strandén, I; Lidauer, M

1999-12-01

Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.

Alignment Condition-Based Robust Adaptive Iterative Learning Control of Uncertain Robot System

Directory of Open Access Journals (Sweden)

Guofeng Tong

2014-04-01

Full Text Available This paper proposes an adaptive iterative learning control strategy integrated with saturation-based robust control for uncertain robot system in presence of modelling uncertainties, unknown parameter, and external disturbance under alignment condition. An important merit is that it achieves adaptive switching of gain matrix both in conventional PD-type feedforward control and robust adaptive control in the iteration domain simultaneously. The analysis of convergence of proposed control law is based on Lyapunov's direct method under alignment initial condition. Simulation results demonstrate the faster learning rate and better robust performance with proposed algorithm by comparing with other existing robust controllers. The actual experiment on three-DOF robot manipulator shows its better practical effectiveness.

First-Order Hyperbolic System Method for Time-Dependent Advection-Diffusion Problems

Science.gov (United States)

2014-03-01

accuracy, with rapid convergence over each physical time step, typically less than five Newton iter - ations. 1 Contents 1 Introduction 3 2 Hyperbolic...however, we employ the Gauss - Seidel (GS) relaxation, which is also an O(N) method for the discretization arising from hyperbolic advection-diffusion system...advection-diffusion scheme. The linear dependency of the iterations on Table 1: Boundary layer problem ( Convergence criteria: Residuals < 10−8.) log10Re

Do convergent developmental mechanisms underlie convergent phenotypes?

Science.gov (United States)

Wray, Gregory A.

2002-01-01

Convergence is a pervasive evolutionary process, affecting many aspects of phenotype and even genotype. Relatively little is known about convergence in developmental processes, however, nor about the degree to which convergence in development underlies convergence in anatomy. A switch in the ecology of sea urchins from feeding to nonfeeding larvae illustrates how convergence in development can be associated with convergence in anatomy. Comparisons to more distantly related taxa, however, suggest that this association may be limited to relatively close phylogenetic comparisons. Similarities in gene expression during development provide another window into the association between convergence in developmental processes and convergence in anatomy. Several well-studied transcription factors exhibit likely cases of convergent gene expression in distantly related animal phyla. Convergence in regulatory gene expression domains is probably more common than generally acknowledged, and can arise for several different reasons. Copyright 2002 S. Karger AG, Basel.

Boosting iterative stochastic ensemble method for nonlinear calibration of subsurface flow models

KAUST Repository

Elsheikh, Ahmed H.

2013-06-01

A novel parameter estimation algorithm is proposed. The inverse problem is formulated as a sequential data integration problem in which Gaussian process regression (GPR) is used to integrate the prior knowledge (static data). The search space is further parameterized using Karhunen-Loève expansion to build a set of basis functions that spans the search space. Optimal weights of the reduced basis functions are estimated by an iterative stochastic ensemble method (ISEM). ISEM employs directional derivatives within a Gauss-Newton iteration for efficient gradient estimation. The resulting update equation relies on the inverse of the output covariance matrix which is rank deficient.In the proposed algorithm we use an iterative regularization based on the ℓ2 Boosting algorithm. ℓ2 Boosting iteratively fits the residual and the amount of regularization is controlled by the number of iterations. A termination criteria based on Akaike information criterion (AIC) is utilized. This regularization method is very attractive in terms of performance and simplicity of implementation. The proposed algorithm combining ISEM and ℓ2 Boosting is evaluated on several nonlinear subsurface flow parameter estimation problems. The efficiency of the proposed algorithm is demonstrated by the small size of utilized ensembles and in terms of error convergence rates. © 2013 Elsevier B.V.

An iterative algorithm for the finite element approximation to convection-diffusion problems

International Nuclear Information System (INIS)

Buscaglia, Gustavo; Basombrio, Fernando

1988-01-01

An iterative algorithm for steady convection-diffusion is presented, which avoids unsymmetric matrices by means of an equivalent mixed formulation. Upwind is introduced by adding a balancing dissipation in the flow direction, but there is no dependence of the global matrix on the velocity field. Convergence is shown in habitual test cases. Advantages of its use in coupled calculation of more complex problems are discussed. (Author)

A successive over-relaxation for slab geometry Simplified SN method with interface flux iteration

International Nuclear Information System (INIS)

Yavuz, M.

1995-01-01

A Successive Over-Relaxation scheme is proposed for speeding up the solution of one-group slab geometry transport problems using a Simplified S N method. The solution of the Simplified S N method that is completely free from all spatial truncation errors is based on the expansion of the angular flux in spherical-harmonics solutions. One way to obtain the (numerical) solution of the Simplified S N method is to use Interface Flux Iteration, which can be considered as the Gauss-Seidel relaxation scheme; the new information is immediately used in the calculations. To accelerate the convergence, an over relaxation parameter is employed in the solution algorithm. The over relaxation parameters for a number of cases depending on scattering ratios and mesh sizes are determined by Fourier analyzing infinite-medium Simplified S 2 equations. Using such over relaxation parameters in the iterative scheme, a significant increase in the convergence of transport problems can be achieved for coarse spatial cells whose spatial widths are greater than one mean-free-path

Mission of ITER and Challenges for the Young

International Nuclear Information System (INIS)

Ikeda, Kaname

2009-01-01

It is recognized that the ongoing effort to provide sufficient energy for the wellbeing of the globe's population and to power the world economy is of the greatest importance. ITER is a joint international research and development project that aims to demonstrate the scientific and technical feasibility of fusion power. It represents the responsible actions of governments whose countries comprise over half the world's population, to create fusion power as a source of clean, economic, carbon dioxide-free energy. This is the most important science initiative of our time.The partners in the Project--the ITER Parties--are the European Union, Japan, the People's Republic of China, India, the Republic of Korea, the Russian Federation and the USA. ITER will be constructed in Europe, at Cadarache in the South of France. The talk will illustrate the genesis of the ITER Organization, the ongoing work at the Cadarache site and the planned schedule for construction. There will also be an explanation of the unique aspects of international collaboration that have been developed for ITER.Although the present focus of the project is construction activities, ITER is also a major scientific and technological research program, for which the best of the world's intellectual resources is needed. Challenges for the young, imperative for fulfillment of the objective of ITER will be identified. It is important that young students and researchers worldwide recognize the rapid development of the project, and the fundamental issues that must be overcome in ITER.The talk will also cover the exciting career and fellowship opportunities for young people at the ITER Organization.

Solving large test-day models by iteration on data and preconditioned conjugate gradient.

Science.gov (United States)

Lidauer, M; Strandén, I; Mäntysaari, E A; Pösö, J; Kettunen, A

1999-12-01

A preconditioned conjugate gradient method was implemented into an iteration on a program for data estimation of breeding values, and its convergence characteristics were studied. An algorithm was used as a reference in which one fixed effect was solved by Gauss-Seidel method, and other effects were solved by a second-order Jacobi method. Implementation of the preconditioned conjugate gradient required storing four vectors (size equal to number of unknowns in the mixed model equations) in random access memory and reading the data at each round of iteration. The preconditioner comprised diagonal blocks of the coefficient matrix. Comparison of algorithms was based on solutions of mixed model equations obtained by a single-trait animal model and a single-trait, random regression test-day model. Data sets for both models used milk yield records of primiparous Finnish dairy cows. Animal model data comprised 665,629 lactation milk yields and random regression test-day model data of 6,732,765 test-day milk yields. Both models included pedigree information of 1,099,622 animals. The animal model ¿random regression test-day model¿ required 122 ¿305¿ rounds of iteration to converge with the reference algorithm, but only 88 ¿149¿ were required with the preconditioned conjugate gradient. To solve the random regression test-day model with the preconditioned conjugate gradient required 237 megabytes of random access memory and took 14% of the computation time needed by the reference algorithm.

Iterative Solutions of Nonlinear Integral Equations of Hammerstein Type

Directory of Open Access Journals (Sweden)

Abebe R. Tufa

2015-11-01

Full Text Available Let H be a real Hilbert space. Let F,K : H → H be Lipschitz monotone mappings with Lipschtiz constants L1and L2, respectively. Suppose that the Hammerstein type equation u + KFu = 0 has a solution in H. It is our purpose in this paper to construct a new explicit iterative sequence and prove strong convergence of the sequence to a solution of the generalized Hammerstein type equation. The results obtained in this paper improve and extend known results in the literature.

Iterative solutions of nonlinear equations in smooth Banach spaces

International Nuclear Information System (INIS)

Chidume, C.E.

1994-05-01

Let E be a smooth Banach space over the real field, φ not= K is contained in E closed convex and bounded, T:K → K uniformly continuous and strongly pseudo-contractive. It is proved that the Ishikawa iteration process converges strongly to the unique fixed point of T. Applications of this result to the operator equations Au=f or u+Au=f where A is a strongly accretive mapping of E into itself and under various continuity assumptions on A are also given. (author). 41 refs

Convergence of hyperspherical adiabatic expansion for helium-like systems

International Nuclear Information System (INIS)

Abrashkevich, A.G.; Abrashkevich, D.G.; Pojda, V.Yu.; Vinitskij, S.I.; Kaschiev, M.S.; Puzynin, I.V.

1988-01-01

The convergence of hyperspherical adiabatic expansion has been studied numerically. The spectral problems arising after separation of variables are solved by the finite-difference and finite element methods. The energies of the ground and some doubly excited staes of a hydrogen ion are calculated in the six-channel approximation within the 10 -4 a.u. accuracy. Obtained results demonstrate a rapid convergence of the hyperspherical adiabatic expansion. 14 refs.; 5 tabs

An Overview Of The ITER In-Vessel Coil Systems

International Nuclear Information System (INIS)

Heitzenroeder, P.J.; Brooks, A.W.; Chrzanowski, J.H.; Dahlgren, F.; Hawryluk, R.J.; Loesser, G.D.; Neumeyer, C.; Mansfield, C.; Smith, J.P.; Schaffer, M.; Humphreys, D.; Cordier, J.J.; Campbell, D.; Johnson, G.A.; Martin, A.; Rebut, P.H.; Tao, J.O.; Fogarty, P.J.; Nelson, B.E.; Reed, R.P.

2009-01-01

ELM mitigation is of particular importance in ITER in order to prevent rapid erosion or melting of the divertor surface, with the consequent risk of water leaks, increased plasma impurity content and disruptivity. Exploitable 'natural' small or no ELM regimes might yet be found which extrapolate to ITER but this cannot be depended upon. Resonant Magnetic Perturbation has been added to pellet pacing as a tool for ITER to mitigate ELMs. Both are required, since neither method is fully developed and much work remains to be done. In addition, in-vessel coils enable vertical stabilization and RWM control. For these reasons, in-vessel coils (IVCs) are being designed for ITER to provide control of Edge Localized Modes (ELMs) in addition to providing control of moderately unstable resistive wall modes (RWMs) and the vertical stability (VS) of the plasma.

Fisher's method of scoring in statistical image reconstruction: comparison of Jacobi and Gauss-Seidel iterative schemes.

Science.gov (United States)

Hudson, H M; Ma, J; Green, P

1994-01-01

Many algorithms for medical image reconstruction adopt versions of the expectation-maximization (EM) algorithm. In this approach, parameter estimates are obtained which maximize a complete data likelihood or penalized likelihood, in each iteration. Implicitly (and sometimes explicitly) penalized algorithms require smoothing of the current reconstruction in the image domain as part of their iteration scheme. In this paper, we discuss alternatives to EM which adapt Fisher's method of scoring (FS) and other methods for direct maximization of the incomplete data likelihood. Jacobi and Gauss-Seidel methods for non-linear optimization provide efficient algorithms applying FS in tomography. One approach uses smoothed projection data in its iterations. We investigate the convergence of Jacobi and Gauss-Seidel algorithms with clinical tomographic projection data.

Two New Iterative Methods for a Countable Family of Nonexpansive Mappings in Hilbert Spaces

Directory of Open Access Journals (Sweden)

Hu Changsong

2010-01-01

Full Text Available We consider two new iterative methods for a countable family of nonexpansive mappings in Hilbert spaces. We proved that the proposed algorithms strongly converge to a common fixed point of a countable family of nonexpansive mappings which solves the corresponding variational inequality. Our results improve and extend the corresponding ones announced by many others.

Automatic Control of ITER-like Structures

International Nuclear Information System (INIS)

Bosia, G.; Bremond, S.

2005-01-01

In ITER Ion Cyclotron System requires a power transfer efficiency in excess of 90% from power source to plasma in quasi continuous operation. This implies the availability of a control system capable of optimizing the array radiation spectrum, automatically acquiring impedance match between the power source and the plasma loaded array at the beginning of the power pulse and maintaining it against load variations due to plasma position and plasma edge parameters fluctuations, rapidly detecting voltage breakdowns in the array and/or in the transmission system and reliably discriminating them from fast load variations. In this paper a proposal for a practical ITER control system, including power, phase, frequency and impedance matching is described. (authors)

A PROOF OF CONVERGENCE OF THE HORN AND SCHUNCK OPTICAL FLOW ALGORITHM IN ARBITRARY DIMENSION

Science.gov (United States)

LE TARNEC, LOUIS; DESTREMPES, FRANÇOIS; CLOUTIER, GUY; GARCIA, DAMIEN

2013-01-01

The Horn and Schunck (HS) method, which amounts to the Jacobi iterative scheme in the interior of the image, was one of the first optical flow algorithms. In this article, we prove the convergence of the HS method, whenever the problem is well-posed. Our result is shown in the framework of a generalization of the HS method in dimension n ≥ 1, with a broad definition of the discrete Laplacian. In this context, the condition for the convergence is that the intensity gradients are not all contained in a same hyperplane. Two other articles ([17] and [13]) claimed to solve this problem in the case n = 2, but it appears that both of these proofs are erroneous. Moreover, we explain why some standard results on the convergence of the Jacobi method do not apply for the HS problem, unless n = 1. It is also shown that the convergence of the HS scheme implies the convergence of the Gauss-Seidel and SOR schemes for the HS problem. PMID:26097625

An open-closed-loop iterative learning control approach for nonlinear switched systems with application to freeway traffic control

Science.gov (United States)

Sun, Shu-Ting; Li, Xiao-Dong; Zhong, Ren-Xin

2017-10-01

For nonlinear switched discrete-time systems with input constraints, this paper presents an open-closed-loop iterative learning control (ILC) approach, which includes a feedforward ILC part and a feedback control part. Under a given switching rule, the mathematical induction is used to prove the convergence of ILC tracking error in each subsystem. It is demonstrated that the convergence of ILC tracking error is dependent on the feedforward control gain, but the feedback control can speed up the convergence process of ILC by a suitable selection of feedback control gain. A switched freeway traffic system is used to illustrate the effectiveness of the proposed ILC law.

Optimal cooperation-trap strategies for the iterated rock-paper-scissors game.

Directory of Open Access Journals (Sweden)

Zedong Bi

Full Text Available In an iterated non-cooperative game, if all the players act to maximize their individual accumulated payoff, the system as a whole usually converges to a Nash equilibrium that poorly benefits any player. Here we show that such an undesirable destiny is avoidable in an iterated Rock-Paper-Scissors (RPS game involving two rational players, X and Y. Player X has the option of proactively adopting a cooperation-trap strategy, which enforces complete cooperation from the rational player Y and leads to a highly beneficial and maximally fair situation to both players. That maximal degree of cooperation is achievable in such a competitive system with cyclic dominance of actions may stimulate further theoretical and empirical studies on how to resolve conflicts and enhance cooperation in human societies.

A fast iterative model for discrete velocity calculations on triangular grids

International Nuclear Information System (INIS)

Szalmas, Lajos; Valougeorgis, Dimitris

2010-01-01

A fast synthetic type iterative model is proposed to speed up the slow convergence of discrete velocity algorithms for solving linear kinetic equations on triangular lattices. The efficiency of the scheme is verified both theoretically by a discrete Fourier stability analysis and computationally by solving a rarefied gas flow problem. The stability analysis of the discrete kinetic equations yields the spectral radius of the typical and the proposed iterative algorithms and reveal the drastically improved performance of the latter one for any grid resolution. This is the first time that stability analysis of the full discrete kinetic equations related to rarefied gas theory is formulated, providing the detailed dependency of the iteration scheme on the discretization parameters in the phase space. The corresponding characteristics of the model deduced by solving numerically the rarefied gas flow through a duct with triangular cross section are in complete agreement with the theoretical findings. The proposed approach may open a way for fast computation of rarefied gas flows on complex geometries in the whole range of gas rarefaction including the hydrodynamic regime.

Iterative algorithms for the input and state recovery from the approximate inverse of strictly proper multivariable systems

Science.gov (United States)

Chen, Liwen; Xu, Qiang

2018-02-01

This paper proposes new iterative algorithms for the unknown input and state recovery from the system outputs using an approximate inverse of the strictly proper linear time-invariant (LTI) multivariable system. One of the unique advantages from previous system inverse algorithms is that the output differentiation is not required. The approximate system inverse is stable due to the systematic optimal design of a dummy feedthrough D matrix in the state-space model via the feedback stabilization. The optimal design procedure avoids trial and error to identify such a D matrix which saves tremendous amount of efforts. From the derived and proved convergence criteria, such an optimal D matrix also guarantees the convergence of algorithms. Illustrative examples show significant improvement of the reference input signal tracking by the algorithms and optimal D design over non-iterative counterparts on controllable or stabilizable LTI systems, respectively. Case studies of two Boeing-767 aircraft aerodynamic models further demonstrate the capability of the proposed methods.

Computation of saddle-type slow manifolds using iterative methods

DEFF Research Database (Denmark)

Kristiansen, Kristian Uldall

2015-01-01

with respect to , appropriate estimates are directly attainable using the method of this paper. The method is applied to several examples, including a model for a pair of neurons coupled by reciprocal inhibition with two slow and two fast variables, and the computation of homoclinic connections in the Fitz......This paper presents an alternative approach for the computation of trajectory segments on slow manifolds of saddle type. This approach is based on iterative methods rather than collocation-type methods. Compared to collocation methods, which require mesh refinements to ensure uniform convergence...

Convergence of Batch Split-Complex Backpropagation Algorithm for Complex-Valued Neural Networks

Directory of Open Access Journals (Sweden)

Huisheng Zhang

2009-01-01

Full Text Available The batch split-complex backpropagation (BSCBP algorithm for training complex-valued neural networks is considered. For constant learning rate, it is proved that the error function of BSCBP algorithm is monotone during the training iteration process, and the gradient of the error function tends to zero. By adding a moderate condition, the weights sequence itself is also proved to be convergent. A numerical example is given to support the theoretical analysis.

Field convergence between technical writers and technical translators

DEFF Research Database (Denmark)

Gnecchi, M.; Maylath, B.; Mousten, Birthe

2011-01-01

As translation of technical documents continues to grow rapidly and translation becomes more automated, the roles of professional communicators and translators appear to be converging. This paper updates preliminary findings first presented at the 2008 International Professional Communication...

A General Iterative Method for a Nonexpansive Semigroup in Banach Spaces with Gauge Functions

Directory of Open Access Journals (Sweden)

Kamonrat Nammanee

2012-01-01

Full Text Available We study strong convergence of the sequence generated by implicit and explicit general iterative methods for a one-parameter nonexpansive semigroup in a reflexive Banach space which admits the duality mapping Jφ, where φ is a gauge function on [0,∞. Our results improve and extend those announced by G. Marino and H.-K. Xu (2006 and many authors.

Enhancing the Usability of an Optical Reader System to Support Point-of-Care Rapid Diagnostic Testing: An Iterative Design Approach.

Science.gov (United States)

Hohenstein, Jess; O'Dell, Dakota; Murnane, Elizabeth L; Lu, Zhengda; Erickson, David; Gay, Geri

2017-11-21

In today's health care environment, increasing costs and inadequate medical resources have created a worldwide need for more affordable diagnostic tools that are also portable, fast, and easy to use. To address this issue, numerous research and commercial efforts have focused on developing rapid diagnostic technologies; however, the efficacy of existing systems has been hindered by usability problems or high production costs, making them infeasible for deployment in at-home, point-of-care (POC), or resource-limited settings. The aim of this study was to create a low-cost optical reader system that integrates with any smart device and accepts any type of rapid diagnostic test strip to provide fast and accurate data collection, sample analysis, and diagnostic result reporting. An iterative design methodology was employed by a multidisciplinary research team to engineer three versions of a portable diagnostic testing device that were evaluated for usability and overall user receptivity. Repeated design critiques and usability studies identified a number of system requirements and considerations (eg, software compatibility, biomatter contamination, and physical footprint) that we worked to incrementally incorporate into successive system variants. Our final design phase culminated in the development of Tidbit, a reader that is compatible with any Wi-Fi-enabled device and test strip format. The Tidbit includes various features that support intuitive operation, including a straightforward test strip insertion point, external indicator lights, concealed electronic components, and an asymmetric shape, which inherently signals correct device orientation. Usability testing of the Tidbit indicates high usability for potential user communities. This study presents the design process, specification, and user reception of the Tidbit, an inexpensive, easy-to-use, portable optical reader for fast, accurate quantification of rapid diagnostic test results. Usability testing suggests

ITER-FEAT - The future international burning plasma experiment - Overview

International Nuclear Information System (INIS)

Aymar, R.; Chuyanov, V.; Huguet, M.; Shimomura, Y.

2001-01-01

The focus of effort in the ITER Engineering Design Activities (EDA) since 1998 has been the development of a new design to meet revised technical objectives and a cost reduction target of about 50% of the previously accepted cost estimate. Drawing on the design solutions already developed and using the latest physics results and outputs from technology R and D projects, the Joint Central Team and Home Teams, working jointly, have been able to converge towards a new design which will allow the exploration of a range of burning plasma conditions, with a capacity to progress towards possible modes of steady state operation. As such the new ITER design, whilst having reduced technical objectives from its predecessor, will nonetheless meet the programmatic objective of providing an integrated demonstration of the scientific and technological feasibility of fusion energy. The main features of the current design and of its projected performance are introduced and the outlook for construction and operation is summarised. (author)

Iterative methods for photoacoustic tomography in attenuating acoustic media

Science.gov (United States)

Haltmeier, Markus; Kowar, Richard; Nguyen, Linh V.

2017-11-01

The development of efficient and accurate reconstruction methods is an important aspect of tomographic imaging. In this article, we address this issue for photoacoustic tomography. To this aim, we use models for acoustic wave propagation accounting for frequency dependent attenuation according to a wide class of attenuation laws that may include memory. We formulate the inverse problem of photoacoustic tomography in attenuating medium as an ill-posed operator equation in a Hilbert space framework that is tackled by iterative regularization methods. Our approach comes with a clear convergence analysis. For that purpose we derive explicit expressions for the adjoint problem that can efficiently be implemented. In contrast to time reversal, the employed adjoint wave equation is again damping and, thus has a stable solution. This stability property can be clearly seen in our numerical results. Moreover, the presented numerical results clearly demonstrate the efficiency and accuracy of the derived iterative reconstruction algorithms in various situations including the limited view case.

Improved event positioning in a gamma ray detector using an iterative position-weighted centre-of-gravity algorithm.

Science.gov (United States)

Liu, Chen-Yi; Goertzen, Andrew L

2013-07-21

An iterative position-weighted centre-of-gravity algorithm was developed and tested for positioning events in a silicon photomultiplier (SiPM)-based scintillation detector for positron emission tomography. The algorithm used a Gaussian-based weighting function centred at the current estimate of the event location. The algorithm was applied to the signals from a 4 × 4 array of SiPM detectors that used individual channel readout and a LYSO:Ce scintillator array. Three scintillator array configurations were tested: single layer with 3.17 mm crystal pitch, matched to the SiPM size; single layer with 1.5 mm crystal pitch; and dual layer with 1.67 mm crystal pitch and a ½ crystal offset in the X and Y directions between the two layers. The flood histograms generated by this algorithm were shown to be superior to those generated by the standard centre of gravity. The width of the Gaussian weighting function of the algorithm was optimized for different scintillator array setups. The optimal width of the Gaussian curve was found to depend on the amount of light spread. The algorithm required less than 20 iterations to calculate the position of an event. The rapid convergence of this algorithm will readily allow for implementation on a front-end detector processing field programmable gate array for use in improved real-time event positioning and identification.

Iterative Nonlinear Tikhonov Algorithm with Constraints for Electromagnetic Tomography

Science.gov (United States)

Xu, Feng; Deshpande, Manohar

2012-01-01

Low frequency electromagnetic tomography such as the capacitance tomography (ECT) has been proposed for monitoring and mass-gauging of gas-liquid two-phase system under microgravity condition in NASA's future long-term space missions. Due to the ill-posed inverse problem of ECT, images reconstructed using conventional linear algorithms often suffer from limitations such as low resolution and blurred edges. Hence, new efficient high resolution nonlinear imaging algorithms are needed for accurate two-phase imaging. The proposed Iterative Nonlinear Tikhonov Regularized Algorithm with Constraints (INTAC) is based on an efficient finite element method (FEM) forward model of quasi-static electromagnetic problem. It iteratively minimizes the discrepancy between FEM simulated and actual measured capacitances by adjusting the reconstructed image using the Tikhonov regularized method. More importantly, it enforces the known permittivity of two phases to the unknown pixels which exceed the reasonable range of permittivity in each iteration. This strategy does not only stabilize the converging process, but also produces sharper images. Simulations show that resolution improvement of over 2 times can be achieved by INTAC with respect to conventional approaches. Strategies to further improve spatial imaging resolution are suggested, as well as techniques to accelerate nonlinear forward model and thus increase the temporal resolution.

On the Convergence of Asynchronous Parallel Pattern Search

International Nuclear Information System (INIS)

Tamara Gilbson Kolda

2002-01-01

In this paper the authors prove global convergence for asynchronous parallel pattern search. In standard pattern search, decisions regarding the update of the iterate and the step-length control parameter are synchronized implicitly across all search directions. They lose this feature in asynchronous parallel pattern search since the search along each direction proceeds semi-autonomously. By bounding the value of the step-length control parameter after any step that produces decrease along a single search direction, they can prove that all the processes share a common accumulation point and that such a point is a stationary point of the standard nonlinear unconstrained optimization problem

Further notes on convergence of the Weiszfeld algorithm

Directory of Open Access Journals (Sweden)

Brimberg Jack

2003-01-01

Full Text Available The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995 attempts to resolve a conjecture posed by Chandrasekaran and Tamir (1989 on a convergence property of the Weiszfeld algorithm, a well-known iterative procedure used to solve this problem. More recently, Canovas, Marin and Canavate (2002 provide counterexamples that appear to reopen the question. However, they do not attempt to reconcile their counterexamples with the previous work. We now show that in the light of these counterexamples, the proof is readily modified and the conjecture of Chandrasekaran and Tamir reclosed. .

Is Carbon a Realistic Choice for ITER's Divertor?

International Nuclear Information System (INIS)

Skinner, C.H.; Federici, G.

2005-01-01

Tritium retention by co-deposition with carbon on the divertor target plate is predicted to limit ITER's DT burning plasma operations (e.g. to about 100 pulses for the worst conditions) before the in-vessel tritium inventory limit, currently set at 350 g, is reached. At this point, ITER will only be able to continue its burning plasma program if technology is available that is capable of rapidly removing large quantities of tritium from the vessel with over 90% efficiency. The removal rate required is four orders of magnitude faster than that demonstrated in current tokamaks. Eighteen years after the observation of co-deposition on JET and TFTR, such technology is nowhere in sight. The inexorable conclusion is that either a major initiative in tritium removal should be funded or that research priorities for ITER should focus on metal alternatives

Iterative regularization in intensity-modulated radiation therapy optimization

International Nuclear Information System (INIS)

Carlsson, Fredrik; Forsgren, Anders

2006-01-01

A common way to solve intensity-modulated radiation therapy (IMRT) optimization problems is to use a beamlet-based approach. The approach is usually employed in a three-step manner: first a beamlet-weight optimization problem is solved, then the fluence profiles are converted into step-and-shoot segments, and finally postoptimization of the segment weights is performed. A drawback of beamlet-based approaches is that beamlet-weight optimization problems are ill-conditioned and have to be regularized in order to produce smooth fluence profiles that are suitable for conversion. The purpose of this paper is twofold: first, to explain the suitability of solving beamlet-based IMRT problems by a BFGS quasi-Newton sequential quadratic programming method with diagonal initial Hessian estimate, and second, to empirically show that beamlet-weight optimization problems should be solved in relatively few iterations when using this optimization method. The explanation of the suitability is based on viewing the optimization method as an iterative regularization method. In iterative regularization, the optimization problem is solved approximately by iterating long enough to obtain a solution close to the optimal one, but terminating before too much noise occurs. Iterative regularization requires an optimization method that initially proceeds in smooth directions and makes rapid initial progress. Solving ten beamlet-based IMRT problems with dose-volume objectives and bounds on the beamlet-weights, we find that the considered optimization method fulfills the requirements for performing iterative regularization. After segment-weight optimization, the treatments obtained using 35 beamlet-weight iterations outperform the treatments obtained using 100 beamlet-weight iterations, both in terms of objective value and of target uniformity. We conclude that iterating too long may in fact deteriorate the quality of the deliverable plan

Containment pressure analysis methodology during a LBLOCA with iteration between RELAP5 and COCOSYS

Energy Technology Data Exchange (ETDEWEB)

Silva, Dayane Faria; Sabundjian, Gaianê; Souza, Ana Cecília Lima, E-mail: dayanefs@ipen.br, E-mail: gdjian@ipen.br, E-mail: aclima@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

2017-07-01

The pressure conditions inside the containment in the case of a Large Break Loss of Coolant Accident (LBLOCA) are more severe in the case of hot leg rupture, due to the large amount of mass and energy that is thrown from the break that lies just after the pressure vessel. This work presents a methodology of pressure analysis within the containment of a Brazilian PWR, Angra 2, with an iterative process between the code that simulates guillotine rupture - RELAP5 - and the COCOSYS code, which analyzes the containment pressure from the accident conditions. The results show that the iterative process between the codes allows the convergence of pressure data to a more realistic approach. (author)

Containment pressure analysis methodology during a LBLOCA with iteration between RELAP5 and COCOSYS

International Nuclear Information System (INIS)

Silva, Dayane Faria; Sabundjian, Gaianê; Souza, Ana Cecília Lima

2017-01-01

The pressure conditions inside the containment in the case of a Large Break Loss of Coolant Accident (LBLOCA) are more severe in the case of hot leg rupture, due to the large amount of mass and energy that is thrown from the break that lies just after the pressure vessel. This work presents a methodology of pressure analysis within the containment of a Brazilian PWR, Angra 2, with an iterative process between the code that simulates guillotine rupture - RELAP5 - and the COCOSYS code, which analyzes the containment pressure from the accident conditions. The results show that the iterative process between the codes allows the convergence of pressure data to a more realistic approach. (author)

Fast generating Greenberger-Horne-Zeilinger state via iterative interaction pictures

Science.gov (United States)

Huang, Bi-Hua; Chen, Ye-Hong; Wu, Qi-Cheng; Song, Jie; Xia, Yan

2016-10-01

We delve a little deeper into the construction of shortcuts to adiabatic passage for three-level systems by iterative interaction picture (multiple Schrödinger dynamics). As an application example, we use the deduced iterative based shortcuts to rapidly generate the Greenberger-Horne-Zeilinger (GHZ) state in a three-atom system with the help of quantum Zeno dynamics. Numerical simulation shows the dynamics designed by the iterative picture method is physically feasible and the shortcut scheme performs much better than that using the conventional adiabatic passage techniques. Also, the influences of various decoherence processes are discussed by numerical simulation and the results prove that the scheme is fast and robust against decoherence and operational imperfection.

Metrology for ITER Assembly

International Nuclear Information System (INIS)

Bogusch, E.

2006-01-01

The overall dimensions of the ITER Tokamak and the particular assembly sequence preclude the use of conventional optical metrology, mechanical jigs and traditional dimensional control equipment, as used for the assembly of smaller, previous generation, fusion devices. This paper describes the state of the art of the capabilities of available metrology systems, with reference to the previous experience in Fusion engineering and in other industries. Two complementary procedures of transferring datum from the primary datum network on the bioshield to the secondary datum s inside the VV with the desired accuracy of about 0.1 mm is described, one method using the access directly through the ports and the other using transfer techniques, developed during the co-operation with ITER/EFDA. Another important task described is the development of a method for the rapid and easy measurement of the gaps between sectors, required for the production of the customised splice plates between them. The scope of the paper includes the evaluation of the composition and cost of the systems and team of technical staff required to meet the requirements of the assembly procedure. The results from a practical, full-scale demonstration of the methodologies used, using the proposed equipment, is described. This work has demonstrated the feasibility of achieving the necessary accuracies for the successful building of ITER. (author)

Analysis of the iteratively regularized Gauss-Newton method under a heuristic rule

Science.gov (United States)

Jin, Qinian; Wang, Wei

2018-03-01

The iteratively regularized Gauss-Newton method is one of the most prominent regularization methods for solving nonlinear ill-posed inverse problems when the data is corrupted by noise. In order to produce a useful approximate solution, this iterative method should be terminated properly. The existing a priori and a posteriori stopping rules require accurate information on the noise level, which may not be available or reliable in practical applications. In this paper we propose a heuristic selection rule for this regularization method, which requires no information on the noise level. By imposing certain conditions on the noise, we derive a posteriori error estimates on the approximate solutions under various source conditions. Furthermore, we establish a convergence result without using any source condition. Numerical results are presented to illustrate the performance of our heuristic selection rule.

Understanding for convergence monitoring for probabilistic risk assessment based on Markov Chain Monte Carlo Simulation

International Nuclear Information System (INIS)

Kim, Joo Yeon; Jang, Han Ki; Jang, Sol Ah; Park, Tae Jin

2014-01-01

There is a question that the simulation actually leads to draws from its target distribution and the most basic one is whether such Markov chains can always be constructed and all chain values sampled from them. The problem to be solved is the determination of how large this iteration should be to achieve the target distribution. This problem can be answered as convergence monitoring. In this paper, two widely used methods, such as autocorrelation and potential scale reduction factor (PSRF) in MCMC are characterized. There is no general agreement on the subject of the convergence. Although it is generally agreed that running n parallel chains in practice is computationally inefficient and unnecessary, running multiple parallel chains is generally applied for the convergence monitoring due to easy implementation. The main debate is the number of parallel chains needed. If the convergence properties of the chain are well understood then clearly a single chain suffices. Therefore, autocorrelation using single chain and multiple parallel ones are tried and their results then compared with each other in this study. And, the following question is answered from the two convergence results: Have the Markov chain realizations for achieved the target distribution?

MO-DE-207A-07: Filtered Iterative Reconstruction (FIR) Via Proximal Forward-Backward Splitting: A Synergy of Analytical and Iterative Reconstruction Method for CT

International Nuclear Information System (INIS)

Gao, H

2016-01-01

Purpose: This work is to develop a general framework, namely filtered iterative reconstruction (FIR) method, to incorporate analytical reconstruction (AR) method into iterative reconstruction (IR) method, for enhanced CT image quality. Methods: FIR is formulated as a combination of filtered data fidelity and sparsity regularization, and then solved by proximal forward-backward splitting (PFBS) algorithm. As a result, the image reconstruction decouples data fidelity and image regularization with a two-step iterative scheme, during which an AR-projection step updates the filtered data fidelity term, while a denoising solver updates the sparsity regularization term. During the AR-projection step, the image is projected to the data domain to form the data residual, and then reconstructed by certain AR to a residual image which is in turn weighted together with previous image iterate to form next image iterate. Since the eigenvalues of AR-projection operator are close to the unity, PFBS based FIR has a fast convergence. Results: The proposed FIR method is validated in the setting of circular cone-beam CT with AR being FDK and total-variation sparsity regularization, and has improved image quality from both AR and IR. For example, AIR has improved visual assessment and quantitative measurement in terms of both contrast and resolution, and reduced axial and half-fan artifacts. Conclusion: FIR is proposed to incorporate AR into IR, with an efficient image reconstruction algorithm based on PFBS. The CBCT results suggest that FIR synergizes AR and IR with improved image quality and reduced axial and half-fan artifacts. The authors was partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000), and the Shanghai Pujiang Talent Program (#14PJ1404500).

Iterated elliptic and hypergeometric integrals for Feynman diagrams

Energy Technology Data Exchange (ETDEWEB)

Ablinger, J.; Radu, C.S.; Schneider, C. [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation (RISC); Bluemlein, J.; Freitas, A. de [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Van Hoeij, M.; Imamoglu, E. [Florida State Univ., Tallahassee, FL (United States). Dept. of Mathematics; Raab, C.G. [Linz Univ. (Austria). Inst. for Algebra

2017-05-15

We calculate 3-loop master integrals for heavy quark correlators and the 3-loop QCD corrections to the ρ-parameter. They obey non-factorizing differential equations of second order with more than three singularities, which cannot be factorized in Mellin-N space either. The solution of the homogeneous equations is possible in terms of convergent close integer power series as {sub 2}F{sub 1} Gauss hypergeometric functions at rational argument. In some cases, integrals of this type can be mapped to complete elliptic integrals at rational argument. This class of functions appears to be the next one arising in the calculation of more complicated Feynman integrals following the harmonic polylogarithms, generalized polylogarithms, cyclotomic harmonic polylogarithms, square-root valued iterated integrals, and combinations thereof, which appear in simpler cases. The inhomogeneous solution of the corresponding differential equations can be given in terms of iterative integrals, where the new innermost letter itself is not an iterative integral. A new class of iterative integrals is introduced containing letters in which (multiple) definite integrals appear as factors. For the elliptic case, we also derive the solution in terms of integrals over modular functions and also modular forms, using q-product and series representations implied by Jacobi's θ{sub i} functions and Dedekind's η-function. The corresponding representations can be traced back to polynomials out of Lambert-Eisenstein series, having representations also as elliptic polylogarithms, a q-factorial 1/η{sup κ}(τ), logarithms and polylogarithms of q and their q-integrals. Due to the specific form of the physical variable x(q) for different processes, different representations do usually appear. Numerical results are also presented.

Iterated elliptic and hypergeometric integrals for Feynman diagrams

International Nuclear Information System (INIS)

Ablinger, J.; Radu, C.S.; Schneider, C.; Bluemlein, J.; Freitas, A. de; Van Hoeij, M.; Imamoglu, E.; Raab, C.G.

2017-05-01

We calculate 3-loop master integrals for heavy quark correlators and the 3-loop QCD corrections to the ρ-parameter. They obey non-factorizing differential equations of second order with more than three singularities, which cannot be factorized in Mellin-N space either. The solution of the homogeneous equations is possible in terms of convergent close integer power series as _2F_1 Gauss hypergeometric functions at rational argument. In some cases, integrals of this type can be mapped to complete elliptic integrals at rational argument. This class of functions appears to be the next one arising in the calculation of more complicated Feynman integrals following the harmonic polylogarithms, generalized polylogarithms, cyclotomic harmonic polylogarithms, square-root valued iterated integrals, and combinations thereof, which appear in simpler cases. The inhomogeneous solution of the corresponding differential equations can be given in terms of iterative integrals, where the new innermost letter itself is not an iterative integral. A new class of iterative integrals is introduced containing letters in which (multiple) definite integrals appear as factors. For the elliptic case, we also derive the solution in terms of integrals over modular functions and also modular forms, using q-product and series representations implied by Jacobi's θ_i functions and Dedekind's η-function. The corresponding representations can be traced back to polynomials out of Lambert-Eisenstein series, having representations also as elliptic polylogarithms, a q-factorial 1/η"κ(τ), logarithms and polylogarithms of q and their q-integrals. Due to the specific form of the physical variable x(q) for different processes, different representations do usually appear. Numerical results are also presented.

Iterative approximation of fixed points of nonexpansive mappings

International Nuclear Information System (INIS)

Chidume, C.E.; Chidume, C.O.

2007-07-01

Let K be a nonempty closed convex subset of a real Banach space E which has a uniformly Gateaux differentiable norm and T : K → K be a nonexpansive mapping with F(T) := { x element of K : Tx = x} ≠ 0 . For a fixed δ element of (0, 1), define S : K → K by Sx := (1- δ)x+ δ Tx , for all x element of K. Assume that { z t } converges strongly to a fixed point z of T as t → 0, where z t is the unique element of K which satisfies z t = tu + (1 - t)Tz t for arbitrary u element of K. Let {α n } be a real sequence in (0, 1) which satisfies the following conditions: C1 : lim α n = 0; C2 : Σαn = ∞. For arbitrary x 0 element of K, let the sequence { x n } be defined iteratively by x n+1 = α n u + (1 - α n )Sx n . Then, {x n } converges strongly to a fixed point of T. (author)

Iterative solution of fluid flow in finned tubes

International Nuclear Information System (INIS)

Syed, S.K.; Tuphome, E.G.; Wood, S.A.

2004-01-01

A difference-based numerical algorithm is developed to efficiently solve a class of elliptic boundary value problems up to any desired order of accuracy. Through multi-level discretization the algorithm uses the multigrid concept of nested iterations to accelerate the convergence rate at higher discretization levels and exploits the advantages of extrapolation methods to achieve higher order accuracy with less computational work. The algorithm employs the SOR method to solve the discrete problem at each discretization level by using an estimated optimum value of the relaxation parameter. The advantages of the algorithm are shown through comparison with the simple discrete method for simulations of fluid flows in finned circular ducts. (author)

Construction and Iterative Decoding of LDPC Codes Over Rings for Phase-Noisy Channels

Directory of Open Access Journals (Sweden)

Karuppasami Sridhar

2008-01-01

Full Text Available Abstract This paper presents the construction and iterative decoding of low-density parity-check (LDPC codes for channels affected by phase noise. The LDPC code is based on integer rings and designed to converge under phase-noisy channels. We assume that phase variations are small over short blocks of adjacent symbols. A part of the constructed code is inherently built with this knowledge and hence able to withstand a phase rotation of radians, where " " is the number of phase symmetries in the signal set, that occur at different observation intervals. Another part of the code estimates the phase ambiguity present in every observation interval. The code makes use of simple blind or turbo phase estimators to provide phase estimates over every observation interval. We propose an iterative decoding schedule to apply the sum-product algorithm (SPA on the factor graph of the code for its convergence. To illustrate the new method, we present the performance results of an LDPC code constructed over with quadrature phase shift keying (QPSK modulated signals transmitted over a static channel, but affected by phase noise, which is modeled by the Wiener (random-walk process. The results show that the code can withstand phase noise of standard deviation per symbol with small loss.

Research on Open-Closed-Loop Iterative Learning Control with Variable Forgetting Factor of Mobile Robots

Directory of Open Access Journals (Sweden)

Hongbin Wang

2016-01-01

Full Text Available We propose an iterative learning control algorithm (ILC that is developed using a variable forgetting factor to control a mobile robot. The proposed algorithm can be categorized as an open-closed-loop iterative learning control, which produces control instructions by using both previous and current data. However, introducing a variable forgetting factor can weaken the former control output and its variance in the control law while strengthening the robustness of the iterative learning control. If it is applied to the mobile robot, this will reduce position errors in robot trajectory tracking control effectively. In this work, we show that the proposed algorithm guarantees tracking error bound convergence to a small neighborhood of the origin under the condition of state disturbances, output measurement noises, and fluctuation of system dynamics. By using simulation, we demonstrate that the controller is effective in realizing the prefect tracking.

Optical image encryption based on interference under convergent random illumination

International Nuclear Information System (INIS)

Kumar, Pramod; Joseph, Joby; Singh, Kehar

2010-01-01

In an optical image encryption system based on the interference principle, two pure phase masks are designed analytically to hide an image. These two masks are illuminated with a plane wavefront to retrieve the original image in the form of an interference pattern at the decryption plane. Replacement of the plane wavefront with convergent random illumination in the proposed scheme leads to an improvement in the security of interference based encryption. The proposed encryption scheme retains the simplicity of an interference based method, as the two pure masks are generated with an analytical method without any iterative algorithm. In addition to the free-space propagation distance and the two pure phase masks, the convergence distance and the randomized lens phase function are two new encryption parameters to enhance the system security. The robustness of this scheme against occlusion of the random phase mask of the randomized lens phase function is investigated. The feasibility of the proposed scheme is demonstrated with numerical simulation results

Iterating skeletons

DEFF Research Database (Denmark)

Dieterle, Mischa; Horstmeyer, Thomas; Berthold, Jost

2012-01-01

a particular skeleton ad-hoc for repeated execution turns out to be considerably complicated, and raises general questions about introducing state into a stateless parallel computation. In addition, one would strongly prefer an approach which leaves the original skeleton intact, and only uses it as a building...... block inside a bigger structure. In this work, we present a general framework for skeleton iteration and discuss requirements and variations of iteration control and iteration body. Skeleton iteration is expressed by synchronising a parallel iteration body skeleton with a (likewise parallel) state......Skeleton-based programming is an area of increasing relevance with upcoming highly parallel hardware, since it substantially facilitates parallel programming and separates concerns. When parallel algorithms expressed by skeletons involve iterations – applying the same algorithm repeatedly...

An iterative fast sweeping based eikonal solver for tilted orthorhombic media

KAUST Repository

Waheed, Umair bin

2014-08-01

Computing first-arrival traveltimes of quasi-P waves in the presence of anisotropy is important for high-end near-surface modeling, microseismic-source localization, and fractured-reservoir characterization, and requires solving an anisotropic eikonal equation. Anisotropy deviating from elliptical anisotropy introduces higher-order nonlinearity into the eikonal equation, which makes solving the eikonal equation a challenge. We address this challenge by iteratively solving a sequence of simpler tilted elliptically anisotropic eikonal equations. At each iteration, the source function is updated to capture the effects of the higher order nonlinear terms. We use Aitken extrapolation to speed up the convergence rate of the iterative algorithm. The result is an algorithm for first-arrival traveltime computations in tilted anisotropic media. We demonstrate our method on tilted transversely isotropic media and tilted orthorhombic media. Our numerical tests demonstrate that the proposed method can match the first arrivals obtained by wavefield extrapolation, even for strong anisotropy and complex structures. Therefore, for the cases where oneor two-point ray tracing fails, our method may be a potential substitute for computing traveltimes. Our approach can be extended to anisotropic media with lower symmetries, such as monoclinic or even triclinic media.

An iterative fast sweeping based eikonal solver for tilted orthorhombic media

KAUST Repository

Waheed, Umair bin; Yarman, Can Evren; Flagg, Garret

2014-01-01

Computing first-arrival traveltimes of quasi-P waves in the presence of anisotropy is important for high-end near-surface modeling, microseismic-source localization, and fractured-reservoir characterization, and requires solving an anisotropic eikonal equation. Anisotropy deviating from elliptical anisotropy introduces higher-order nonlinearity into the eikonal equation, which makes solving the eikonal equation a challenge. We address this challenge by iteratively solving a sequence of simpler tilted elliptically anisotropic eikonal equations. At each iteration, the source function is updated to capture the effects of the higher order nonlinear terms. We use Aitken extrapolation to speed up the convergence rate of the iterative algorithm. The result is an algorithm for first-arrival traveltime computations in tilted anisotropic media. We demonstrate our method on tilted transversely isotropic media and tilted orthorhombic media. Our numerical tests demonstrate that the proposed method can match the first arrivals obtained by wavefield extrapolation, even for strong anisotropy and complex structures. Therefore, for the cases where oneor two-point ray tracing fails, our method may be a potential substitute for computing traveltimes. Our approach can be extended to anisotropic media with lower symmetries, such as monoclinic or even triclinic media.

Phase reconstruction by a multilevel iteratively regularized Gauss–Newton method

International Nuclear Information System (INIS)

Langemann, Dirk; Tasche, Manfred

2008-01-01

In this paper we consider the numerical solution of a phase retrieval problem for a compactly supported, linear spline f : R → C with the Fourier transform f-circumflex, where values of |f| and |f-circumflex| at finitely many equispaced nodes are given. The unknown phases of complex spline coefficients fulfil a well-structured system of nonlinear equations. Thus the phase reconstruction leads to a nonlinear inverse problem, which is solved by a multilevel strategy and iterative Tikhonov regularization. The multilevel strategy concentrates the main effort of the solution of the phase retrieval problem in the coarse, less expensive levels and provides convenient initial guesses at the next finer level. On each level, the corresponding nonlinear system is solved by an iteratively regularized Gauss–Newton method. The multilevel strategy is motivated by convergence results of IRGN. This method is applicable to a wide range of examples as shown in several numerical tests for noiseless and noisy data

Three dimensional iterative beam propagation method for optical waveguide devices

Science.gov (United States)

Ma, Changbao; Van Keuren, Edward

2006-10-01

The finite difference beam propagation method (FD-BPM) is an effective model for simulating a wide range of optical waveguide structures. The classical FD-BPMs are based on the Crank-Nicholson scheme, and in tridiagonal form can be solved using the Thomas method. We present a different type of algorithm for 3-D structures. In this algorithm, the wave equation is formulated into a large sparse matrix equation which can be solved using iterative methods. The simulation window shifting scheme and threshold technique introduced in our earlier work are utilized to overcome the convergence problem of iterative methods for large sparse matrix equation and wide-angle simulations. This method enables us to develop higher-order 3-D wide-angle (WA-) BPMs based on Pade approximant operators and the multistep method, which are commonly used in WA-BPMs for 2-D structures. Simulations using the new methods will be compared to the analytical results to assure its effectiveness and applicability.

ICRF Review: From ERASMUS To ITER

Science.gov (United States)

Weynants, R. R.

2009-11-01

This is a personal account of how I saw ICRF evolve since 1974, with a presentation that is ordered according to the topics: heating, antenna coupling, impurity generation/mitigation and system technology. The nature of the main issues is each time reviewed, recent findings are incorporated, and it is shown how the ICRF community has been able to react to sometimes rapidly changing demands and is indeed resolutely preparing ITER.

Coarse mesh and one-cell block inversion based diffusion synthetic acceleration

Science.gov (United States)

Kim, Kang-Seog

DSA (Diffusion Synthetic Acceleration) has been developed to accelerate the SN transport iteration. We have developed solution techniques for the diffusion equations of FLBLD (Fully Lumped Bilinear Discontinuous), SCB (Simple Comer Balance) and UCB (Upstream Corner Balance) modified 4-step DSA in x-y geometry. Our first multi-level method includes a block Gauss-Seidel iteration for the discontinuous diffusion equation, uses the continuous diffusion equation derived from the asymptotic analysis, and avoids void cell calculation. We implemented this multi-level procedure and performed model problem calculations. The results showed that the FLBLD, SCB and UCB modified 4-step DSA schemes with this multi-level technique are unconditionally stable and rapidly convergent. We suggested a simplified multi-level technique for FLBLD, SCB and UCB modified 4-step DSA. This new procedure does not include iterations on the diffusion calculation or the residual calculation. Fourier analysis results showed that this new procedure was as rapidly convergent as conventional modified 4-step DSA. We developed new DSA procedures coupled with 1-CI (Cell Block Inversion) transport which can be easily parallelized. We showed that 1-CI based DSA schemes preceded by SI (Source Iteration) are efficient and rapidly convergent for LD (Linear Discontinuous) and LLD (Lumped Linear Discontinuous) in slab geometry and for BLD (Bilinear Discontinuous) and FLBLD in x-y geometry. For 1-CI based DSA without SI in slab geometry, the results showed that this procedure is very efficient and effective for all cases. We also showed that 1-CI based DSA in x-y geometry was not effective for thin mesh spacings, but is effective and rapidly convergent for intermediate and thick mesh spacings. We demonstrated that the diffusion equation discretized on a coarse mesh could be employed to accelerate the transport equation. Our results showed that coarse mesh DSA is unconditionally stable and is as rapidly convergent

The Extended-Window Channel Estimator for Iterative Channel-and-Symbol Estimation

Directory of Open Access Journals (Sweden)

Barry John R

2005-01-01

Full Text Available The application of the expectation-maximization (EM algorithm to channel estimation results in a well-known iterative channel-and-symbol estimator (ICSE. The EM-ICSE iterates between a symbol estimator based on the forward-backward recursion (BCJR equalizer and a channel estimator, and may provide approximate maximum-likelihood blind or semiblind channel estimates. Nevertheless, the EM-ICSE has high complexity, and it is prone to misconvergence. In this paper, we propose the extended-window (EW estimator, a novel channel estimator for ICSE that can be used with any soft-output symbol estimator. Therefore, the symbol estimator may be chosen according to performance or complexity specifications. We show that the EW-ICSE, an ICSE that uses the EW estimator and the BCJR equalizer, is less complex and less susceptible to misconvergence than the EM-ICSE. Simulation results reveal that the EW-ICSE may converge faster than the EM-ICSE.

Iterated non-linear model predictive control based on tubes and contractive constraints.

Science.gov (United States)

Murillo, M; Sánchez, G; Giovanini, L

2016-05-01

This paper presents a predictive control algorithm for non-linear systems based on successive linearizations of the non-linear dynamic around a given trajectory. A linear time varying model is obtained and the non-convex constrained optimization problem is transformed into a sequence of locally convex ones. The robustness of the proposed algorithm is addressed adding a convex contractive constraint. To account for linearization errors and to obtain more accurate results an inner iteration loop is added to the algorithm. A simple methodology to obtain an outer bounding-tube for state trajectories is also presented. The convergence of the iterative process and the stability of the closed-loop system are analyzed. The simulation results show the effectiveness of the proposed algorithm in controlling a quadcopter type unmanned aerial vehicle. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Iterative Addition of Kinetic Effects to Cold Plasma RF Wave Solvers

Science.gov (United States)

Green, David; Berry, Lee; RF-SciDAC Collaboration

2017-10-01

The hot nature of fusion plasmas requires a wave vector dependent conductivity tensor for accurate calculation of wave heating and current drive. Traditional methods for calculating the linear, kinetic full-wave plasma response rely on a spectral method such that the wave vector dependent conductivity fits naturally within the numerical method. These methods have seen much success for application to the well-confined core plasma of tokamaks. However, quantitative prediction of high power RF antenna designs for fusion applications has meant a requirement of resolving the geometric details of the antenna and other plasma facing surfaces for which the Fourier spectral method is ill-suited. An approach to enabling the addition of kinetic effects to the more versatile finite-difference and finite-element cold-plasma full-wave solvers was presented by where an operator-split iterative method was outlined. Here we expand on this approach, examine convergence and present a simplified kinetic current estimator for rapidly updating the right-hand side of the wave equation with kinetic corrections. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725.

Numerical method for partial equilibrium flow

International Nuclear Information System (INIS)

Ramshaw, J.D.; Cloutman, L.D.; Los Alamos, New Mexico 87545)

1981-01-01

A numerical method is presented for chemically reactive fluid flow in which equilibrium and nonequilibrium reactions occur simultaneously. The equilibrium constraints on the species concentrations are established by a quadratic iterative procedure. If the equilibrium reactions are uncoupled and of second or lower order, the procedure converges in a single step. In general, convergence is most rapid when the reactions are weakly coupled. This can frequently be achieved by a judicious choice of the independent reactions. In typical transient calculations, satisfactory accuracy has been achieved with about five iterations per time step

Convergence accommodation to convergence CA/C ratio: convergence versus divergence.

Science.gov (United States)

Simmons, Joshua M; Firth, Alison Y

2014-09-01

To determine whether the convergence accommodation to convergence (CA/C) ratio during divergence with base-in (BI) prisms is of a similar or different magnitude to that measured during convergence with base-out (BO) prisms. Eighteen participants with normal binocular single vision were recruited. The participants viewed a pseudo-Gaussian target, which consisted of a light emitting diode (LED) behind a diffusing screen at 40 cm. After 5 minutes of dark adaptation, the refractive status of the eye was measured without any prism using a Shin-Nippon SRW-5000 autorefractor. The participant held the selected prism (5Δ or 10Δ BO or BI, counterbalanced) in front of their right eye and obtained a single, fused image of the target while refractive measures were taken with each. A 30-second rest period was given between measurements. The mean age of the participants was 20.6±3.22 years. The mean CA/C ratios for the 5Δ BO, 10Δ BO, 5Δ BI, and 10Δ BI were 0.108 (±0.074) D/Δ, 0.110 (±0.056) D/Δ, 0.100 (±0.090) D/Δ, and 0.089 (±0.055) D/Δ, respectively. A 2-factor repeated measures ANOVA found that the CA/C ratio did not significantly change with differing levels of prism-induced convergence and divergence (p=0.649). Change in accommodation induced by manipulating vergence is similar whether convergence or divergence are induced. The CA/C ratio did not show any change with differing levels of prism-induced convergence and divergence.

ITER-FEAT - outline design report. Report by the ITER Director. ITER meeting, Tokyo, January 2000

International Nuclear Information System (INIS)

2001-01-01

It is now possible to define the key elements of ITER-FEAT. This report provides the results, to date, of the joint work of the Special Working Group in the form of an Outline Design Report on the ITER-FEAT design which, subject to the views of ITER Council and of the Parties, will be the focus of further detailed design work and analysis in order to provide to the Parties a complete and fully integrated engineering design within the framework of the ITER EDA extension

Convergent surface water distributions in U.S. cities

Science.gov (United States)

M.K. Steele; J.B. Heffernan; N. Bettez; J. Cavender-Bares; P.M. Groffman; J.M. Grove; S. Hall; S.E. Hobbie; K. Larson; J.L. Morse; C. Neill; K.C. Nelson; J. O' Neil-Dunne; L. Ogden; D.E. Pataki; C. Polsky; R. Roy Chowdhury

2014-01-01

Earth's surface is rapidly urbanizing, resulting in dramatic changes in the abundance, distribution and character of surface water features in urban landscapes. However, the scope and consequences of surface water redistribution at broad spatial scales are not well understood. We hypothesized that urbanization would lead to convergent surface water abundance and...

Rapid Prototyping of the Central Safety System for Nuclear Risk in ITER

Energy Technology Data Exchange (ETDEWEB)

Scibile, L. [ITER Organization, 13 - St. Paul lez Durance (France); Ambrosino, G.; De Tommasi, G.; Pironti, A. [Euratom-ENEA-CREATE, Universita di Napoli Federico II, Napoli (Italy)

2009-07-01

Full text of publication follows: In the current ITER Baseline design, the Central Safety System for Nuclear Risk (CSS-N) is the safety control system in charge to assure nuclear safety for the plant, personnel and environment. In particular it is envisaged that the CSS shall interface to the plant safety systems for nuclear risk and shall coordinate the individual protection provided by the intervention of these systems by the activation, where required, of additional protections. The design of such a system, together with its implementation, strongly depends on the requirements, particularly in terms of reliability. The CSS-N is a safety critical system, thus its validation and commissioning play a very important role, since the required level of reliability must be demonstrated. In such a scenario, where a new and non-conventional system has to be deployed, it is strongly recommended to use modeling and simulation tools since the early design phase. Indeed, the modeling tools will help in the definition of the system requirements, and they will be used to test and validate the control logic. Furthermore these tools can be used to rapid design the safety system and to carry out hardware-in-the-loop (HIL) simulations, which permit to assess the performance of the control hardware against a plant simulator. Both a control system prototype and a safety system oriented plant simulator have been developed to assess first the requirements and then the performance of the CSS-N. In particular the presented SW/HW framework permits to design and verify the CSS protection logics and to test and validate these logics by means of HIL simulations. This work introduces both the prototype and plant simulator architectures, together with the methodology adopted to design and implement these validation tools. (authors)

ITER council proceedings: 2001

International Nuclear Information System (INIS)

2001-01-01

Continuing the ITER EDA, two further ITER Council Meetings were held since the publication of ITER EDA documentation series no, 20, namely the ITER Council Meeting on 27-28 February 2001 in Toronto, and the ITER Council Meeting on 18-19 July in Vienna. That Meeting was the last one during the ITER EDA. This volume contains records of these Meetings, including: Records of decisions; List of attendees; ITER EDA status report; ITER EDA technical activities report; MAC report and advice; Final report of ITER EDA; and Press release

Dhage Iteration Method for Generalized Quadratic Functional Integral Equations

Directory of Open Access Journals (Sweden)

Bapurao C. Dhage

2015-01-01

Full Text Available In this paper we prove the existence as well as approximations of the solutions for a certain nonlinear generalized quadratic functional integral equation. An algorithm for the solutions is developed and it is shown that the sequence of successive approximations starting at a lower or upper solution converges monotonically to the solutions of related quadratic functional integral equation under some suitable mixed hybrid conditions. We rely our main result on Dhage iteration method embodied in a recent hybrid fixed point theorem of Dhage (2014 in partially ordered normed linear spaces. An example is also provided to illustrate the abstract theory developed in the paper.

Enhanced nonlinear iterative techniques applied to a nonequilibrium plasma flow

International Nuclear Information System (INIS)

Knoll, D.A.

1998-01-01

The authors study the application of enhanced nonlinear iterative methods to the steady-state solution of a system of two-dimensional convection-diffusion-reaction partial differential equations that describe the partially ionized plasma flow in the boundary layer of a tokamak fusion reactor. This system of equations is characterized by multiple time and spatial scales and contains highly anisotropic transport coefficients due to a strong imposed magnetic field. They use Newton's method to linearize the nonlinear system of equations resulting from an implicit, finite volume discretization of the governing partial differential equations, on a staggered Cartesian mesh. The resulting linear systems are neither symmetric nor positive definite, and are poorly conditioned. Preconditioned Krylov iterative techniques are employed to solve these linear systems. They investigate both a modified and a matrix-free Newton-Krylov implementation, with the goal of reducing CPU cost associated with the numerical formation of the Jacobian. A combination of a damped iteration, mesh sequencing, and a pseudotransient continuation technique is used to enhance global nonlinear convergence and CPU efficiency. GMRES is employed as the Krylov method with incomplete lower-upper (ILU) factorization preconditioning. The goal is to construct a combination of nonlinear and linear iterative techniques for this complex physical problem that optimizes trade-offs between robustness, CPU time, memory requirements, and code complexity. It is shown that a mesh sequencing implementation provides significant CPU savings for fine grid calculations. Performance comparisons of modified Newton-Krylov and matrix-free Newton-Krylov algorithms will be presented

ITER safety

International Nuclear Information System (INIS)

Raeder, J.; Piet, S.; Buende, R.

1991-01-01

As part of the series of publications by the IAEA that summarize the results of the Conceptual Design Activities for the ITER project, this document describes the ITER safety analyses. It contains an assessment of normal operation effluents, accident scenarios, plasma chamber safety, tritium system safety, magnet system safety, external loss of coolant and coolant flow problems, and a waste management assessment, while it describes the implementation of the safety approach for ITER. The document ends with a list of major conclusions, a set of topical remarks on technical safety issues, and recommendations for the Engineering Design Activities, safety considerations for siting ITER, and recommendations with regard to the safety issues for the R and D for ITER. Refs, figs and tabs

Convergence of Implicit and Explicit Schemes for an Asymptotically Nonexpansive Mapping in -Uniformly Smooth and Strictly Convex Banach Spaces

Directory of Open Access Journals (Sweden)

Meng Wen

2012-01-01

Full Text Available We introduce a new iterative scheme with Meir-Keeler contractions for an asymptotically nonexpansive mapping in -uniformly smooth and strictly convex Banach spaces. We also proved the strong convergence theorems of implicit and explicit schemes. The results obtained in this paper extend and improve many recent ones announced by many others.

Condition Assessment of Paper Insulation in Oil-Immersed Power Transformers Based on the Iterative Inversion of Resistivity

Directory of Open Access Journals (Sweden)

Jiangjun Ruan

2017-04-01

Full Text Available The resistivity of oil impregnated paper will decrease during its aging process. This paper takes paper resistivity as an assessment index to evaluate the insulation condition of oil impregnated paper in power transformer. The feasibility of this method are discussed in two aspects: reliability and sensitivity. Iterative inversion of paper resistivity was combined with finite element simulation. Both the bisection method and Newton’s method were used as iterative methods. After the analysis and comparison, Newton’s method was selected as the first option of paper resistivity iteration for its faster convergence. In order to consider the spatial distribution characteristic of paper aging and enhance the calculation accuracy, the resistivity calculation is expanded to a multivariate iteration based on Newton’s method, in order to consider the spatial distribution characteristic of paper aging and improve the calculation accuracy. This paper presents an exploratory research on condition assessment of oil impregnated paper insulation, and provides some reference to the security and economy operation of power transformers.

Convergence theorems for mappings which are asymptotically nonexpansive in the intermediate sense

International Nuclear Information System (INIS)

Chidume, C.E.; Shahzad, Naseer; Zegeye, Habtu

2003-08-01

Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let T : K → E be a non-self mapping which is asymptotically nonexpansive in the intermediate sense with F(T) := {x is an element of K : Tx x} ≠ 0. A demiclosed principle for T is proved. Moreover, if T is completely continuous, an iterative sequence {x n } is constructed which converges strongly to some x* is an element of F(T). If T is not assumed to be completely continuous but the dual E* of E is assumed to have the Kadec-Klee property, then {x n } converges weakly to some x* is an element of F(T). The operator P which plays a central role in our proofs is, in this case, the Banach space analogue of the proximity map in Hilbert spaces. (author)

Determination of Periodic Solution for Tapered Beams with Modified Iteration Perturbation Method

Directory of Open Access Journals (Sweden)

Mohammad Mehdi Mashinchi Joubari

2015-01-01

Full Text Available In this paper, we implemented the Modified Iteration Perturbation Method (MIPM for approximating the periodic behavior of a tapered beam. This problem is formulated as a nonlinear ordinary differential equation with linear and nonlinear terms. The solution is quickly convergent and does not need to complicated calculations. Comparing the results of the MIPM with the exact solution shows that this method is effective and convenient. Also, it is predicated that MIPM can be potentially used in the analysis of strongly nonlinear oscillation problems accurately.

A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

International Nuclear Information System (INIS)

Jian Jinbao; Li Jianling; Mo Xingde

2006-01-01

This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported

Final report of the ITER EDA. Final report of the ITER Engineering Design Activities. Prepared by the ITER Council

International Nuclear Information System (INIS)

2001-01-01

This is the Final Report by the ITER Council on work carried out by ITER participating countries on cooperation in the Engineering Design Activities (EDA) for the ITER. In this report the main ITER EDA technical objectives, the scope of ITER EDA, its organization and resources, engineering design of ITER tokamak and its main parameters are presented. This Report also includes safety and environmental assessments, site requirements and proposed schedule and estimates of manpower and cost as well as proposals on approaches to joint implementation of the project

Shrinkage-thresholding enhanced born iterative method for solving 2D inverse electromagnetic scattering problem

KAUST Repository

Desmal, Abdulla

2014-07-01

A numerical framework that incorporates recently developed iterative shrinkage thresholding (IST) algorithms within the Born iterative method (BIM) is proposed for solving the two-dimensional inverse electromagnetic scattering problem. IST algorithms minimize a cost function weighted between measurement-data misfit and a zeroth/first-norm penalty term and therefore promote "sharpness" in the solution. Consequently, when applied to domains with sharp variations, discontinuities, or sparse content, the proposed framework is more efficient and accurate than the "classical" BIM that minimizes a cost function with a second-norm penalty term. Indeed, numerical results demonstrate the superiority of the IST-BIM over the classical BIM when they are applied to sparse domains: Permittivity and conductivity profiles recovered using the IST-BIM are sharper and more accurate and converge faster. © 1963-2012 IEEE.

The new Exponential Directional Iterative (EDI) 3-D Sn scheme for parallel adaptive differencing

International Nuclear Information System (INIS)

Sjoden, G.E.

2005-01-01

The new Exponential Directional Iterative (EDI) discrete ordinates (Sn) scheme for 3-D Cartesian Coordinates is presented. The EDI scheme is a logical extension of the positive, efficient Exponential Directional Weighted (EDW) Sn scheme currently used as the third level of the adaptive spatial differencing algorithm in the PENTRAN parallel discrete ordinates solver. Here, the derivation and advantages of the EDI scheme are presented; EDI uses EDW-rendered exponential coefficients as initial starting values to begin a fixed point iteration of the exponential coefficients. One issue that required evaluation was an iterative cutoff criterion to prevent the application of an unstable fixed point iteration; although this was needed in some cases, it was readily treated with a default to EDW. Iterative refinement of the exponential coefficients in EDI typically converged in fewer than four fixed point iterations. Moreover, EDI yielded more accurate angular fluxes compared to the other schemes tested, particularly in streaming conditions. Overall, it was found that the EDI scheme was up to an order of magnitude more accurate than the EDW scheme on a given mesh interval in streaming cases, and is potentially a good candidate as a fourth-level differencing scheme in the PENTRAN adaptive differencing sequence. The 3-D Cartesian computational cost of EDI was only about 20% more than the EDW scheme, and about 40% more than Diamond Zero (DZ). More evaluation and testing are required to determine suitable upgrade metrics for EDI to be fully integrated into the current adaptive spatial differencing sequence in PENTRAN. (author)

Gauss-Seidel Iterative Method as a Real-Time Pile-Up Solver of Scintillation Pulses

Science.gov (United States)

Novak, Roman; Vencelj, Matja¿

2009-12-01

The pile-up rejection in nuclear spectroscopy has been confronted recently by several pile-up correction schemes that compensate for distortions of the signal and subsequent energy spectra artifacts as the counting rate increases. We study here a real-time capability of the event-by-event correction method, which at the core translates to solving many sets of linear equations. Tight time limits and constrained front-end electronics resources make well-known direct solvers inappropriate. We propose a novel approach based on the Gauss-Seidel iterative method, which turns out to be a stable and cost-efficient solution to improve spectroscopic resolution in the front-end electronics. We show the method convergence properties for a class of matrices that emerge in calorimetric processing of scintillation detector signals and demonstrate the ability of the method to support the relevant resolutions. The sole iteration-based error component can be brought below the sliding window induced errors in a reasonable number of iteration steps, thus allowing real-time operation. An area-efficient hardware implementation is proposed that fully utilizes the method's inherent parallelism.

Multiplier convergent series and uniform convergence of mapping ...

Indian Academy of Sciences (India)

MS received 14 April 2011; revised 17 November 2012. Abstract. In this paper, we introduce the frame property of complex sequence sets and study the uniform convergence of nonlinear mapping series in β-dual of spaces consisting of multiplier convergent series. Keywords. Multiplier convergent series; mapping series. 1.

Modeling of frequency-domain scalar wave equation with the average-derivative optimal scheme based on a multigrid-preconditioned iterative solver

Science.gov (United States)

Cao, Jian; Chen, Jing-Bo; Dai, Meng-Xue

2018-01-01

An efficient finite-difference frequency-domain modeling of seismic wave propagation relies on the discrete schemes and appropriate solving methods. The average-derivative optimal scheme for the scalar wave modeling is advantageous in terms of the storage saving for the system of linear equations and the flexibility for arbitrary directional sampling intervals. However, using a LU-decomposition-based direct solver to solve its resulting system of linear equations is very costly for both memory and computational requirements. To address this issue, we consider establishing a multigrid-preconditioned BI-CGSTAB iterative solver fit for the average-derivative optimal scheme. The choice of preconditioning matrix and its corresponding multigrid components is made with the help of Fourier spectral analysis and local mode analysis, respectively, which is important for the convergence. Furthermore, we find that for the computation with unequal directional sampling interval, the anisotropic smoothing in the multigrid precondition may affect the convergence rate of this iterative solver. Successful numerical applications of this iterative solver for the homogenous and heterogeneous models in 2D and 3D are presented where the significant reduction of computer memory and the improvement of computational efficiency are demonstrated by comparison with the direct solver. In the numerical experiments, we also show that the unequal directional sampling interval will weaken the advantage of this multigrid-preconditioned iterative solver in the computing speed or, even worse, could reduce its accuracy in some cases, which implies the need for a reasonable control of directional sampling interval in the discretization.

Effects of noise on convergent game-learning dynamics

International Nuclear Information System (INIS)

Sanders, James B T; Galla, Tobias; Shapiro, Jonathan L

2012-01-01

We study stochastic effects on the lagging anchor dynamics, a reinforcement learning algorithm used to learn successful strategies in iterated games, which is known to converge to Nash points in the absence of noise. The dynamics is stochastic when players only have limited information about their opponents’ strategic propensities. The effects of this noise are studied analytically in the case where it is small but finite, and we show that the statistics and correlation properties of fluctuations can be computed to a high accuracy. We find that the system can exhibit quasicycles, driven by intrinsic noise. If players are asymmetric and use different parameters for their learning, a net payoff advantage can be achieved due to these stochastic oscillations around the deterministic equilibrium. (paper)

iterClust: a statistical framework for iterative clustering analysis.

Science.gov (United States)

Ding, Hongxu; Wang, Wanxin; Califano, Andrea

2018-03-22

In a scenario where populations A, B1 and B2 (subpopulations of B) exist, pronounced differences between A and B may mask subtle differences between B1 and B2. Here we present iterClust, an iterative clustering framework, which can separate more pronounced differences (e.g. A and B) in starting iterations, followed by relatively subtle differences (e.g. B1 and B2), providing a comprehensive clustering trajectory. iterClust is implemented as a Bioconductor R package. andrea.califano@columbia.edu, hd2326@columbia.edu. Supplementary information is available at Bioinformatics online.

An iterative method for the solution of nonlinear systems using the Faber polynomials for annular sectors

Energy Technology Data Exchange (ETDEWEB)

Myers, N.J. [Univ. of Durham (United Kingdom)

1994-12-31

The author gives a hybrid method for the iterative solution of linear systems of equations Ax = b, where the matrix (A) is nonsingular, sparse and nonsymmetric. As in a method developed by Starke and Varga the method begins with a number of steps of the Arnoldi method to produce some information on the location of the spectrum of A. This method then switches to an iterative method based on the Faber polynomials for an annular sector placed around these eigenvalue estimates. The Faber polynomials for an annular sector are used because, firstly an annular sector can easily be placed around any eigenvalue estimates bounded away from zero, and secondly the Faber polynomials are known analytically for an annular sector. Finally the author gives three numerical examples, two of which allow comparison with Starke and Varga`s results. The third is an example of a matrix for which many iterative methods would fall, but this method converges.

Initialization bias suppression in iterative Monte Carlo calculations: benchmarks on criticality calculation

International Nuclear Information System (INIS)

Richet, Y.; Jacquet, O.; Bay, X.

2005-01-01

The accuracy of an Iterative Monte Carlo calculation requires the convergence of the simulation output process. The present paper deals with a post processing algorithm to suppress the transient due to initialization applied on criticality calculations. It should be noticed that this initial transient suppression aims only at obtaining a stationary output series, then the convergence of the calculation needs to be guaranteed independently. The transient suppression algorithm consists in a repeated truncation of the first observations of the output process. The truncation of the first observations is performed as long as a steadiness test based on Brownian bridge theory is negative. This transient suppression method was previously tuned for a simplified model of criticality calculations, although this paper focuses on the efficiency on real criticality calculations. The efficiency test is based on four benchmarks with strong source convergence problems: 1) a checkerboard storage of fuel assemblies, 2) a pin cell array with irradiated fuel, 3) 3 one-dimensional thick slabs, and 4) an array of interacting fuel spheres. It appears that the transient suppression method needs to be more widely validated on real criticality calculations before any blind using as a post processing in criticality codes

Investigating Multi-Array Antenna Signal Convergence using Wavelet Transform and Krylov Sequence

Directory of Open Access Journals (Sweden)

Muhammad Ahmed Sikander

2018-01-01

Full Text Available In the present world, wireless communication is becoming immensely popular for plethora of applications. Technology has been advancing at an accelerated rate leading to make communication reliable. Still, there are issues need to be address to minimize errors in the transmission. This research study expounds on the rapid convergence of the signal. Convergence is considered to be an important aspect in wireless communication. For rapid convergence, two ambiguities should be addressed; Eigenvalue spread and sparse identification or sparsity of the signal. Eigen value spread is defining as the ratio of minimum to maximum Eigenvalue, whereas sparsity is defining as the loosely bounded system. In this research, two of these attributes are investigated for MAA (Multi-Array Antenna signal using the cascading of Wavelet and Krylov processes. Specifically, the MAA signal is applied in the research because nowadays there are many physical hindrances in the communication path. These hurdles weaken the signal strength which in turn effects the quality of the reception. WT (Wavelet Transform is used to address the Eigenvalue problem and the Krylov sequence is used to attempt the sparse identification of the MAA signal. The results show that the convergence of the MMA signal is improved by applying Wavelet transform and Krylov Subspace.

Investigating multi-array antenna signal convergence using wavelet transform and krylov sequence

International Nuclear Information System (INIS)

Sikander, M.A.; Hussain, R.; Hussain, R.

2018-01-01

In the present world, wireless communication is becoming immensely popular for plethora of applications. Technology has been advancing at an accelerated rate leading to make communication reliable. Still, there are issues need to be address to minimize errors in the transmission. This research study expounds on the rapid convergence of the signal. Convergence is considered to be an important aspect in wireless communication. For rapid convergence, two ambiguities should be addressed; Eigenvalue spread and sparse identification or sparsity of the signal. Eigen value spread is defining as the ratio of minimum to maximum Eigenvalue, whereas sparsity is defining as the loosely bounded system. In this research, two of these attributes are investigated for MAA (Multi-Array Antenna) signal using the cascading of Wavelet and Krylov processes. Specifically, the MAA signal is applied in the research because nowadays there are many physical hindrances in the communication path. These hurdles weaken the signal strength which in turn effects the quality of the reception. WT (Wavelet Transform) is used to address the Eigenvalue problem and the Krylov sequence is used to attempt the sparse identification of the MAA signal. The results show that the convergence of the MMA signal is improved by applying Wavelet transform and Krylov Subspace. (author)

Designing Instructor-Led Schools with Rapid Prototyping.

Science.gov (United States)

Lange, Steven R.; And Others

1996-01-01

Rapid prototyping involves abandoning many of the linear steps of traditional prototyping; it is instead a series of design iterations representing each major stage. This article describes the development of an instructor-led course for midlevel auditors using the principles and procedures of rapid prototyping, focusing on the savings in time and…

Disruption Mitigation System Developments and Design for ITER

Energy Technology Data Exchange (ETDEWEB)

Baylor, Larry R. [ORNL; Barbier, Charlotte N. [ORNL; Bull, Nora D. [ORNL; Combs, Stephen Kirk [ORNL; Fisher, Paul W. [ORNL; Kiss, Gabor [ITER Organization, Cadarache, France; Ericson, Milton Nance [ORNL; Wilgen, John B. [ORNL; Maruyama, So [ITER Organization, Cadarache, France; Meitner, Steven J. [ORNL; Lyttle, Mark S. [ORNL; Rasmussen, David A. [ORNL; Carmichael, Justin R. [ORNL; Smith, Stephen Fulton [ORNL

2015-09-01

A disruption mitigation system (DMS) is under design for ITER to inject sufficient material deeply into the plasma for rapid plasma thermal shutdown and collisional suppression of any resulting runaway electrons. Progress on the development and design of both a shattered pellet injector (SPI) that produces large solid cryogenic pellets to provide reliable deep penetration of material and a fast opening high flow rate gas valve for massive gas injection (MGI) is presented. Cryogenic pellets of deuterium and neon up to 25 mm in size have been formed and accelerated with a prototype injector and a full scale prototype MGI valve is now in testing. Implications of the design with respect to response time and reliability at the proposed injector locations on ITER are discussed.

Iterative approximation of a solution of a general variational-like inclusion in Banach spaces

International Nuclear Information System (INIS)

Chidume, C.E.; Kazmi, K.R.; Zegeye, H.

2002-07-01

In this paper, we introduce a class of η-accretive mappings in a real Banach space, and show that the η-proximal point mapping for η-m-accretive mapping is Lipschitz continuous. Further we develop an iterative algorithm for a class of general variational-like inclusions involving η-accretive mappings in real Banach space, and discuss its convergence criteria. The class of η-accretive mappings includes several important classes of operators that have been studied by various authors. (author)

Iterative Methods for the Non-LTE Transfer of Polarized Radiation: Resonance Line Polarization in One-dimensional Atmospheres

Science.gov (United States)

Trujillo Bueno, Javier; Manso Sainz, Rafael

1999-05-01

This paper shows how to generalize to non-LTE polarization transfer some operator splitting methods that were originally developed for solving unpolarized transfer problems. These are the Jacobi-based accelerated Λ-iteration (ALI) method of Olson, Auer, & Buchler and the iterative schemes based on Gauss-Seidel and successive overrelaxation (SOR) iteration of Trujillo Bueno and Fabiani Bendicho. The theoretical framework chosen for the formulation of polarization transfer problems is the quantum electrodynamics (QED) theory of Landi Degl'Innocenti, which specifies the excitation state of the atoms in terms of the irreducible tensor components of the atomic density matrix. This first paper establishes the grounds of our numerical approach to non-LTE polarization transfer by concentrating on the standard case of scattering line polarization in a gas of two-level atoms, including the Hanle effect due to a weak microturbulent and isotropic magnetic field. We begin demonstrating that the well-known Λ-iteration method leads to the self-consistent solution of this type of problem if one initializes using the ``exact'' solution corresponding to the unpolarized case. We show then how the above-mentioned splitting methods can be easily derived from this simple Λ-iteration scheme. We show that our SOR method is 10 times faster than the Jacobi-based ALI method, while our implementation of the Gauss-Seidel method is 4 times faster. These iterative schemes lead to the self-consistent solution independently of the chosen initialization. The convergence rate of these iterative methods is very high; they do not require either the construction or the inversion of any matrix, and the computing time per iteration is similar to that of the Λ-iteration method.

Procedural generation of aesthetic patterns from dynamics and iteration processes

Directory of Open Access Journals (Sweden)

Gdawiec Krzysztof

2017-12-01

Full Text Available Aesthetic patterns are widely used nowadays, e.g., in jewellery design, carpet design, as textures and patterns on wallpapers, etc. Most of the work during the design stage is carried out by a designer manually. Therefore, it is highly useful to develop methods for aesthetic pattern generation. In this paper, we present methods for generating aesthetic patterns using the dynamics of a discrete dynamical system. The presented methods are based on the use of various iteration processes from fixed point theory (Mann, S, Noor, etc. and the application of an affine combination of these iterations. Moreover, we propose new convergence tests that enrich the obtained patterns. The proposed methods generate patterns in a procedural way and can be easily implemented on the GPU. The presented examples show that using the proposed methods we are able to obtain a variety of interesting patterns. Moreover, the numerical examples show that the use of the GPU implementation with shaders allows the generation of patterns in real time and the speed-up (compared with a CPU implementation ranges from about 1000 to 2500 times.

Iterative algorithms for computing the feedback Nash equilibrium point for positive systems

Science.gov (United States)

Ivanov, I.; Imsland, Lars; Bogdanova, B.

2017-03-01

The paper studies N-player linear quadratic differential games on an infinite time horizon with deterministic feedback information structure. It introduces two iterative methods (the Newton method as well as its accelerated modification) in order to compute the stabilising solution of a set of generalised algebraic Riccati equations. The latter is related to the Nash equilibrium point of the considered game model. Moreover, we derive the sufficient conditions for convergence of the proposed methods. Finally, we discuss two numerical examples so as to illustrate the performance of both of the algorithms.

Generalized Mann Iterations for Approximating Fixed Points of a Family of Hemicontractions

Directory of Open Access Journals (Sweden)

Jin Liang

2008-06-01

Full Text Available This paper concerns common fixed points for a finite family of hemicontractions or a finite family of strict pseudocontractions on uniformly convex Banach spaces. By introducing a new iteration process with error term, we obtain sufficient and necessary conditions, as well as sufficient conditions, for the existence of a fixed point. As one will see, we derive these strong convergence theorems in uniformly convex Banach spaces and without any requirement of the compactness on the domain of the mapping. The results given in this paper extend some previous theorems.

Variational Iteration Method for Volterra Functional Integrodifferential Equations with Vanishing Linear Delays

Directory of Open Access Journals (Sweden)

Ali Konuralp

2014-01-01

Full Text Available Application process of variational iteration method is presented in order to solve the Volterra functional integrodifferential equations which have multi terms and vanishing delays where the delay function θ(t vanishes inside the integral limits such that θ(t=qt for 0converging to the exact solutions or the exact solutions of three test problems are obtained by using this presented process. The numerical solutions and the absolute errors are shown in figures and tables.

The multi-reference retaining the excitation degree perturbation theory: A size-consistent, unitary invariant, and rapidly convergent wavefunction based ab initio approach

International Nuclear Information System (INIS)

Fink, Reinhold F.

2009-01-01

The retaining the excitation degree (RE) partitioning [R.F. Fink, Chem. Phys. Lett. 428 (2006) 461(20 September)] is reformulated and applied to multi-reference cases with complete active space (CAS) reference wave functions. The generalised van Vleck perturbation theory is employed to set up the perturbation equations. It is demonstrated that this leads to a consistent and well defined theory which fulfils all important criteria of a generally applicable ab initio method: The theory is proven numerically and analytically to be size-consistent and invariant with respect to unitary orbital transformations within the inactive, active and virtual orbital spaces. In contrast to most previously proposed multi-reference perturbation theories the necessary condition for a proper perturbation theory to fulfil the zeroth order perturbation equation is exactly satisfied with the RE partitioning itself without additional projectors on configurational spaces. The theory is applied to several excited states of the benchmark systems CH 2 , SiH 2 , and NH 2 , as well as to the lowest states of the carbon, nitrogen and oxygen atoms. In all cases comparisons are made with full configuration interaction results. The multi-reference (MR)-RE method is shown to provide very rapidly converging perturbation series. Energy differences between states of similar configurations converge even faster

Variable aperture-based ptychographical iterative engine method

Science.gov (United States)

Sun, Aihui; Kong, Yan; Meng, Xin; He, Xiaoliang; Du, Ruijun; Jiang, Zhilong; Liu, Fei; Xue, Liang; Wang, Shouyu; Liu, Cheng

2018-02-01

A variable aperture-based ptychographical iterative engine (vaPIE) is demonstrated both numerically and experimentally to reconstruct the sample phase and amplitude rapidly. By adjusting the size of a tiny aperture under the illumination of a parallel light beam to change the illumination on the sample step by step and recording the corresponding diffraction patterns sequentially, both the sample phase and amplitude can be faithfully reconstructed with a modified ptychographical iterative engine (PIE) algorithm. Since many fewer diffraction patterns are required than in common PIE and the shape, the size, and the position of the aperture need not to be known exactly, this proposed vaPIE method remarkably reduces the data acquisition time and makes PIE less dependent on the mechanical accuracy of the translation stage; therefore, the proposed technique can be potentially applied for various scientific researches.

Iterative method for solving a problem with mixed boundary conditions for biharmonic equation arising in fracture mechanics

Directory of Open Access Journals (Sweden)

Dang Quang A

2013-02-01

Full Text Available In this paper we consider a mixed boundary value problem for biharmonic equation of the Airy stress function which models a crack problem of a solid elastic plate. An iterative method for reducing the problem to a sequence of mixed problems for Poisson equations is proposed and investigated. The convergence of the method is established theoretically and illustrated on many numerical experiments.

Numerical computation of generalized importance functions

International Nuclear Information System (INIS)

Gomit, J.M.; Nasr, M.; Ngyuen van Chi, G.; Pasquet, J.P.; Planchard, J.

1981-01-01

Thus far, an important effort has been devoted to developing and applying generalized perturbation theory in reactor physics analysis. In this work we are interested in the calculation of the importance functions by the method of A. Gandini. We have noted that in this method the convergence of the iterative procedure adopted is not rapid. Hence to accelerate this convergence we have used the semi-iterative technique. Two computer codes have been developed for one and two dimensional calculations (SPHINX-1D and SPHINX-2D). The advantage of our calculation was confirmed by some comparative tests in which the iteration number and the computing time were highly reduced with respect to classical calculation (CIAP-1D and CIAP-2D). (orig.) [de

Enhanced nonlinear iterative techniques applied to a non-equilibrium plasma flow

Energy Technology Data Exchange (ETDEWEB)

Knoll, D.A.; McHugh, P.R. [Idaho National Engineering Lab., Idaho Falls, ID (United States)

1996-12-31

We study the application of enhanced nonlinear iterative methods to the steady-state solution of a system of two-dimensional convection-diffusion-reaction partial differential equations that describe the partially-ionized plasma flow in the boundary layer of a tokamak fusion reactor. This system of equations is characterized by multiple time and spatial scales, and contains highly anisotropic transport coefficients due to a strong imposed magnetic field. We use Newton`s method to linearize the nonlinear system of equations resulting from an implicit, finite volume discretization of the governing partial differential equations, on a staggered Cartesian mesh. The resulting linear systems are neither symmetric nor positive definite, and are poorly conditioned. Preconditioned Krylov iterative techniques are employed to solve these linear systems. We investigate both a modified and a matrix-free Newton-Krylov implementation, with the goal of reducing CPU cost associated with the numerical formation of the Jacobian. A combination of a damped iteration, one-way multigrid and a pseudo-transient continuation technique are used to enhance global nonlinear convergence and CPU efficiency. GMRES is employed as the Krylov method with Incomplete Lower-Upper(ILU) factorization preconditioning. The goal is to construct a combination of nonlinear and linear iterative techniques for this complex physical problem that optimizes trade-offs between robustness, CPU time, memory requirements, and code complexity. It is shown that a one-way multigrid implementation provides significant CPU savings for fine grid calculations. Performance comparisons of the modified Newton-Krylov and matrix-free Newton-Krylov algorithms will be presented.

Molecular mechanisms involved in convergent crop domestication.

Science.gov (United States)

Lenser, Teresa; Theißen, Günter

2013-12-01

Domestication has helped to understand evolution. We argue that, vice versa, novel insights into evolutionary principles could provide deeper insights into domestication. Molecular analyses have demonstrated that convergent phenotypic evolution is often based on molecular changes in orthologous genes or pathways. Recent studies have revealed that during plant domestication the causal mutations for convergent changes in key traits are likely to be located in particular genes. These insights may contribute to defining candidate genes for genetic improvement during the domestication of new plant species. Such efforts may help to increase the range of arable crops available, thus increasing crop biodiversity and food security to help meet the predicted demands of the continually growing global population under rapidly changing environmental conditions. Copyright © 2013 Elsevier Ltd. All rights reserved.

ITER council proceedings: 2000

International Nuclear Information System (INIS)

2001-01-01

No ITER Council Meetings were held during 2000. However, two ITER EDA Meetings were held, one in Tokyo, January 19-20, and one in Moscow, June 29-30. The parties participating in these meetings were those that partake in the extended ITER EDA, namely the EU, the Russian Federation, and Japan. This document contains, a/o, the records of these meetings, the list of attendees, the agenda, the ITER EDA Status Reports issued during these meetings, the TAC (Technical Advisory Committee) reports and recommendations, the MAC Reports and Advice (also for the July 1999 Meeting), the ITER-FEAT Outline Design Report, the TAC Reports and Recommendations both meetings), Site requirements and Site Design Assumptions, the Tentative Sequence of technical Activities 2000-2001, Report of the ITER SWG-P2 on Joint Implementation of ITER, EU/ITER Canada Proposal for New ITER Identification

A new iterative algorithm to reconstruct the refractive index.

Science.gov (United States)

Liu, Y J; Zhu, P P; Chen, B; Wang, J Y; Yuan, Q X; Huang, W X; Shu, H; Li, E R; Liu, X S; Zhang, K; Ming, H; Wu, Z Y

2007-06-21

The latest developments in x-ray imaging are associated with techniques based on the phase contrast. However, the image reconstruction procedures demand significant improvements of the traditional methods, and/or new algorithms have to be introduced to take advantage of the high contrast and sensitivity of the new experimental techniques. In this letter, an improved iterative reconstruction algorithm based on the maximum likelihood expectation maximization technique is presented and discussed in order to reconstruct the distribution of the refractive index from data collected by an analyzer-based imaging setup. The technique considered probes the partial derivative of the refractive index with respect to an axis lying in the meridional plane and perpendicular to the propagation direction. Computer simulations confirm the reliability of the proposed algorithm. In addition, the comparison between an analytical reconstruction algorithm and the iterative method has been also discussed together with the convergent characteristic of this latter algorithm. Finally, we will show how the proposed algorithm may be applied to reconstruct the distribution of the refractive index of an epoxy cylinder containing small air bubbles of about 300 micro of diameter.

Perl Modules for Constructing Iterators

Science.gov (United States)

Tilmes, Curt

2009-01-01

The Iterator Perl Module provides a general-purpose framework for constructing iterator objects within Perl, and a standard API for interacting with those objects. Iterators are an object-oriented design pattern where a description of a series of values is used in a constructor. Subsequent queries can request values in that series. These Perl modules build on the standard Iterator framework and provide iterators for some other types of values. Iterator::DateTime constructs iterators from DateTime objects or Date::Parse descriptions and ICal/RFC 2445 style re-currence descriptions. It supports a variety of input parameters, including a start to the sequence, an end to the sequence, an Ical/RFC 2445 recurrence describing the frequency of the values in the series, and a format description that can refine the presentation manner of the DateTime. Iterator::String constructs iterators from string representations. This module is useful in contexts where the API consists of supplying a string and getting back an iterator where the specific iteration desired is opaque to the caller. It is of particular value to the Iterator::Hash module which provides nested iterations. Iterator::Hash constructs iterators from Perl hashes that can include multiple iterators. The constructed iterators will return all the permutations of the iterations of the hash by nested iteration of embedded iterators. A hash simply includes a set of keys mapped to values. It is a very common data structure used throughout Perl programming. The Iterator:: Hash module allows a hash to include strings defining iterators (parsed and dispatched with Iterator::String) that are used to construct an overall series of hash values.

A second-order iterative implicit-explicit hybrid scheme for hyperbolic systems of conservation laws

International Nuclear Information System (INIS)

Dai, Wenlong; Woodward, P.R.

1996-01-01

An iterative implicit-explicit hybrid scheme is proposed for hyperbolic systems of conservation laws. Each wave in a system may be implicitly, or explicitly, or partially implicitly and partially explicitly treated depending on its associated Courant number in each numerical cell, and the scheme is able to smoothly switch between implicit and explicit calculations. The scheme is of Godunov-type in both explicit and implicit regimes, is in a strict conservation form, and is accurate to second-order in both space and time for all Courant numbers. The computer code for the scheme is easy to vectorize. Multicolors proposed in this paper may reduce the number of iterations required to reach a converged solution by several orders for a large time step. The feature of the scheme is shown through numerical examples. 38 refs., 12 figs

ITER overview

International Nuclear Information System (INIS)

Shimomura, Y.; Aymar, R.; Chuyanov, V.; Huguet, M.; Parker, R.R.

2001-01-01

This report summarizes technical works of six years done by the ITER Joint Central Team and Home Teams under terms of Agreement of the ITER Engineering Design Activities. The major products are as follows: complete and detailed engineering design with supporting assessments, industrial-based cost estimates and schedule, non-site specific comprehensive safety and environmental assessment, and technology R and D to validate and qualify design including proof of technologies and industrial manufacture and testing of full size or scalable models of key components. The ITER design is at an advanced stage of maturity and contains sufficient technical information for a construction decision. The operation of ITER will demonstrate the availability of a new energy source, fusion. (author)

ITER Overview

International Nuclear Information System (INIS)

Shimomura, Y.; Aymar, R.; Chuyanov, V.; Huguet, M.; Parker, R.

1999-01-01

This report summarizes technical works of six years done by the ITER Joint Central Team and Home Teams under terms of Agreement of the ITER Engineering Design Activities. The major products are as follows: complete and detailed engineering design with supporting assessments, industrial-based cost estimates and schedule, non-site specific comprehensive safety and environmental assessment, and technology R and D to validate and qualify design including proof of technologies and industrial manufacture and testing of full size or scalable models of key components. The ITER design is at an advanced stage of maturity and contains sufficient technical information for a construction decision. The operation of ITER will demonstrate the availability of a new energy source, fusion. (author)

ITER Council proceedings: 1993

International Nuclear Information System (INIS)

1994-01-01

Records of the third ITER Council Meeting (IC-3), held on 21-22 April 1993, in Tokyo, Japan, and the fourth ITER Council Meeting (IC-4) held on 29 September - 1 October 1993 in San Diego, USA, are presented, giving essential information on the evolution of the ITER Engineering Design Activities (EDA), such as the text of the draft of Protocol 2 further elaborated in ''ITER EDA Agreement and Protocol 2'' (ITER EDA Documentation Series No. 5), recommendations on future work programmes: a description of technology R and D tasks; the establishment of a trust fund for the ITER EDA activities; arrangements for Visiting Home Team Personnel; the general framework for the involvement of other countries in the ITER EDA; conditions for the involvement of Canada in the Euratom Contribution to the ITER EDA; and other attachments as parts of the Records of Decision of the aforementioned ITER Council Meetings

ITER council proceedings: 1993

Energy Technology Data Exchange (ETDEWEB)

NONE

1994-12-31

Records of the third ITER Council Meeting (IC-3), held on 21-22 April 1993, in Tokyo, Japan, and the fourth ITER Council Meeting (IC-4) held on 29 September - 1 October 1993 in San Diego, USA, are presented, giving essential information on the evolution of the ITER Engineering Design Activities (EDA), such as the text of the draft of Protocol 2 further elaborated in ``ITER EDA Agreement and Protocol 2`` (ITER EDA Documentation Series No. 5), recommendations on future work programmes: a description of technology R and D tastes; the establishment of a trust fund for the ITER EDA activities; arrangements for Visiting Home Team Personnel; the general framework for the involvement of other countries in the ITER EDA; conditions for the involvement of Canada in the Euratom Contribution to the ITER EDA; and other attachments as parts of the Records of Decision of the aforementioned ITER Council Meetings.

ITER-FEAT safety

International Nuclear Information System (INIS)

Gordon, C.W.; Bartels, H.-W.; Honda, T.; Raeder, J.; Topilski, L.; Iseli, M.; Moshonas, K.; Taylor, N.; Gulden, W.; Kolbasov, B.; Inabe, T.; Tada, E.

2001-01-01

Safety has been an integral part of the design process for ITER since the Conceptual Design Activities of the project. The safety approach adopted in the ITER-FEAT design and the complementary assessments underway, to be documented in the Generic Site Safety Report (GSSR), are expected to help demonstrate the attractiveness of fusion and thereby set a good precedent for future fusion power reactors. The assessments address ITER's radiological hazards taking into account fusion's favourable safety characteristics. The expectation that ITER will need regulatory approval has influenced the entire safety design and assessment approach. This paper summarises the ITER-FEAT safety approach and assessments underway. (author)

P-SPARSLIB: A parallel sparse iterative solution package

Energy Technology Data Exchange (ETDEWEB)

Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)

1994-12-31

Iterative methods are gaining popularity in engineering and sciences at a time where the computational environment is changing rapidly. P-SPARSLIB is a project to build a software library for sparse matrix computations on parallel computers. The emphasis is on iterative methods and the use of distributed sparse matrices, an extension of the domain decomposition approach to general sparse matrices. One of the goals of this project is to develop a software package geared towards specific applications. For example, the author will test the performance and usefulness of P-SPARSLIB modules on linear systems arising from CFD applications. Equally important is the goal of portability. In the long run, the author wishes to ensure that this package is portable on a variety of platforms, including SIMD environments and shared memory environments.

Construction and Iterative Decoding of LDPC Codes Over Rings for Phase-Noisy Channels

Directory of Open Access Journals (Sweden)

William G. Cowley

2008-04-01

Full Text Available This paper presents the construction and iterative decoding of low-density parity-check (LDPC codes for channels affected by phase noise. The LDPC code is based on integer rings and designed to converge under phase-noisy channels. We assume that phase variations are small over short blocks of adjacent symbols. A part of the constructed code is inherently built with this knowledge and hence able to withstand a phase rotation of 2π/M radians, where “M” is the number of phase symmetries in the signal set, that occur at different observation intervals. Another part of the code estimates the phase ambiguity present in every observation interval. The code makes use of simple blind or turbo phase estimators to provide phase estimates over every observation interval. We propose an iterative decoding schedule to apply the sum-product algorithm (SPA on the factor graph of the code for its convergence. To illustrate the new method, we present the performance results of an LDPC code constructed over ℤ4 with quadrature phase shift keying (QPSK modulated signals transmitted over a static channel, but affected by phase noise, which is modeled by the Wiener (random-walk process. The results show that the code can withstand phase noise of 2∘ standard deviation per symbol with small loss.

Single photon emission computed tomography using a regularizing iterative method for attenuation correction

International Nuclear Information System (INIS)

Soussaline, Francoise; Cao, A.; Lecoq, G.

1981-06-01

An analytically exact solution to the attenuated tomographic operator is proposed. Such a technique called Regularizing Iterative Method (RIM) belongs to the iterative class of procedures where a priori knowledge can be introduced on the evaluation of the size and shape of the activity domain to be reconstructed, and on the exact attenuation distribution. The relaxation factor used is so named because it leads to fast convergence and provides noise filtering for a small number of iteractions. The effectiveness of such a method was tested in the Single Photon Emission Computed Tomography (SPECT) reconstruction problem, with the goal of precise correction for attenuation before quantitative study. Its implementation involves the use of a rotating scintillation camera based SPECT detector connected to a mini computer system. Mathematical simulations of cylindical uniformly attenuated phantoms indicate that in the range of a priori calculated relaxation factor a fast converging solution can always be found with a (contrast) accuracy of the order of 0.2 to 4% given that numerical errors and noise are or not, taken into account. The sensitivity of the (RIM) algorithm to errors in the size of the reconstructed object and in the value of the attenuation coefficient μ was studied, using the same simulation data. Extreme variations of +- 15% in these parameters will lead to errors of the order of +- 20% in the quantitative results. Physical phantoms representing a variety of geometrical situations were also studied

Strong Convergence Theorems for Variational Inequalities and Split Equality Problem

Directory of Open Access Journals (Sweden)

Yu Jing Wu

2013-01-01

Full Text Available Let H1, H2, and H3 be real Hilbert spaces, let C⊆H1, Q⊆H2 be two nonempty closed convex sets, and let A:H1→H3, B:H2→H3 be two bounded linear operators. The split equality problem (SEP is to find x∈C, y∈Q such that Ax=By. Let H=H1×H2; consider f:H→H a contraction with coefficient 00, and M:H→H is a β-inverse strongly monotone mapping. Let 0<γ<γ̅/α, S=C×Q and G:H→H3 be defined by restricting to H1 is A and restricting to H2 is -B, that is, G has the matrix form G=[A,-B]. It is proved that the sequence {wn}={(xn,yn}⊆H generated by the iterative method wn+1=PS[αnγf(wn+(I-αnTPS(I-γnG*GPS(wn-λnMwn] converges strongly to w̃ which solves the SEP and the following variational inequality: 〈(T-λfw̃,w-w̃〉≥0 and 〈Mw̃,w-w̃〉≥0 for all w∈S. Moreover, if we take M=G*G:H→H,  γn=0, then M is a β-inverse strongly monotone mapping, and the sequence {wn} generated by the iterative method wn+1=αnγf(wn+(I-αnTPS(wn-λnG*Gwn converges strongly to w̃ which solves the SEP and the following variational inequality: 〈(T-λfw̃,w-w̃〉≥0 for all w∈S.

Parallel iterative procedures for approximate solutions of wave propagation by finite element and finite difference methods

Energy Technology Data Exchange (ETDEWEB)

Kim, S. [Purdue Univ., West Lafayette, IN (United States)

1994-12-31

Parallel iterative procedures based on domain decomposition techniques are defined and analyzed for the numerical solution of wave propagation by finite element and finite difference methods. For finite element methods, in a Lagrangian framework, an efficient way for choosing the algorithm parameter as well as the algorithm convergence are indicated. Some heuristic arguments for finding the algorithm parameter for finite difference schemes are addressed. Numerical results are presented to indicate the effectiveness of the methods.

Variable aperture-based ptychographical iterative engine method.

Science.gov (United States)

Sun, Aihui; Kong, Yan; Meng, Xin; He, Xiaoliang; Du, Ruijun; Jiang, Zhilong; Liu, Fei; Xue, Liang; Wang, Shouyu; Liu, Cheng

2018-02-01

A variable aperture-based ptychographical iterative engine (vaPIE) is demonstrated both numerically and experimentally to reconstruct the sample phase and amplitude rapidly. By adjusting the size of a tiny aperture under the illumination of a parallel light beam to change the illumination on the sample step by step and recording the corresponding diffraction patterns sequentially, both the sample phase and amplitude can be faithfully reconstructed with a modified ptychographical iterative engine (PIE) algorithm. Since many fewer diffraction patterns are required than in common PIE and the shape, the size, and the position of the aperture need not to be known exactly, this proposed vaPIE method remarkably reduces the data acquisition time and makes PIE less dependent on the mechanical accuracy of the translation stage; therefore, the proposed technique can be potentially applied for various scientific researches. (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE).

Iteratively-coupled propagating exterior complex scaling method for electron-hydrogen collisions

International Nuclear Information System (INIS)

Bartlett, Philip L; Stelbovics, Andris T; Bray, Igor

2004-01-01

A newly-derived iterative coupling procedure for the propagating exterior complex scaling (PECS) method is used to efficiently calculate the electron-impact wavefunctions for atomic hydrogen. An overview of this method is given along with methods for extracting scattering cross sections. Differential scattering cross sections at 30 eV are presented for the electron-impact excitation to the n = 1, 2, 3 and 4 final states, for both PECS and convergent close coupling (CCC), which are in excellent agreement with each other and with experiment. PECS results are presented at 27.2 eV and 30 eV for symmetric and asymmetric energy-sharing triple differential cross sections, which are in excellent agreement with CCC and exterior complex scaling calculations, and with experimental data. At these intermediate energies, the efficiency of the PECS method with iterative coupling has allowed highly accurate partial-wave solutions of the full Schroedinger equation, for L ≤ 50 and a large number of coupled angular momentum states, to be obtained with minimal computing resources. (letter to the editor)

A New Multi-Step Iterative Algorithm for Approximating Common Fixed Points of a Finite Family of Multi-Valued Bregman Relatively Nonexpansive Mappings

Directory of Open Access Journals (Sweden)

Wiyada Kumam

2016-05-01

Full Text Available In this article, we introduce a new multi-step iteration for approximating a common fixed point of a finite class of multi-valued Bregman relatively nonexpansive mappings in the setting of reflexive Banach spaces. We prove a strong convergence theorem for the proposed iterative algorithm under certain hypotheses. Additionally, we also use our results for the solution of variational inequality problems and to find the zero points of maximal monotone operators. The theorems furnished in this work are new and well-established and generalize many well-known recent research works in this field.

Japanese perspective of fusion nuclear technology from ITER to DEMO

International Nuclear Information System (INIS)

Tanaka, Satoru; Takatsu, Hideyuki

2007-01-01

The world fusion community is now launching construction of ITER, the first nuclear-grade fusion machine in the world. In parallel to the ITER program, Broader Approach (BA) activities are to be initiated in this year by EU and Japan, mainly at Rokkasho BA site in Japan, as complementary activities to ITER toward DEMO. The BA activities include IFMIFEVEDA (International Fusion Materials Irradiation Facility-Engineering Validation and Engineering Design Activities) and DEMO design activities with generic technology R and Ds, both of which are critical to the rapid development of DEMO and commercial fusion power plants. The Atomic Energy Commission of Japan reviewed on-going third phase fusion program and issued the results of the review, 'On the policy of Nuclear Fusion Research and Development' in November 2005. In this report, it is anticipated that the ITER will be made operational in a decade and the programmatic objective can be met in the succeeding seven or eight years. Under this condition, the report presents a roadmap toward the DEMO and beyond and R and D items on fusion nuclear technology, indispensable for fusion energy utilization, are re-aligned. In the present paper, Japanese view and policy on ITER and beyond is summarized mainly from the viewpoints of nuclear fusion technology, and a minimum set of R and D elements on fusion nuclear technology, essential for fusion energy utilization, is presented. (orig.)

Sparse Adaptive Iteratively-Weighted Thresholding Algorithm (SAITA) for Lp-Regularization Using the Multiple Sub-Dictionary Representation.

Science.gov (United States)

Li, Yunyi; Zhang, Jie; Fan, Shangang; Yang, Jie; Xiong, Jian; Cheng, Xiefeng; Sari, Hikmet; Adachi, Fumiyuki; Gui, Guan

2017-12-15

Both L 1/2 and L 2/3 are two typical non-convex regularizations of L p (0dictionary sparse transform strategies for the two typical cases p∈{1/2, 2/3} based on an iterative Lp thresholding algorithm and then proposes a sparse adaptive iterative-weighted L p thresholding algorithm (SAITA). Moreover, a simple yet effective regularization parameter is proposed to weight each sub-dictionary-based L p regularizer. Simulation results have shown that the proposed SAITA not only performs better than the corresponding L₁ algorithms but can also obtain a better recovery performance and achieve faster convergence than the conventional single-dictionary sparse transform-based L p case. Moreover, we conduct some applications about sparse image recovery and obtain good results by comparison with relative work.

Searching for convergence and its causes – an industry perspective

NARCIS (Netherlands)

Inklaar, Robert; Jorgenson, Dale W.; Fukao, Kyoji; Timmer, Marcel P.

2016-01-01

The past 20 years has been a period of rapid growth in emerging economies, leading to convergence in income and productivity levels. Less is known about the industry origins of this development, a gap this chapter aims to fill. For 30 industries in 40 economies, I estimate industry relative

Disruption, vertical displacement event and halo current characterization for ITER

International Nuclear Information System (INIS)

Wesley, J.; Fujisawa, N.; Ortolani, S.; Putvinski, S.; Rosenbluth, M.N.

1997-01-01

Characteristics, in ITER, of plasma disruptions, vertical displacement events (VDEs) and the conversion of plasma current to runaway electron current in a disruption are presented. In addition to the well known potential of disruptions to produce rapid thermal energy and plasma current quenches and theoretical predictions that show the likelihood of ∼ 50% runaway conversion, an assessment of VDE and halo current characteristics in vertically elongated tokamaks shows that disruptions in ITER will result in VDEs with peak in-vessel halo currents of up to 50% of the predisruption plasma current and with toroidal peaking factors (peak/average current density) of up to 4:1. However, the assessment also shows an inverse correlation between the halo current magnitude and the toroidal peaking factor; hence, ITER VDEs can be expected to have a product of normalized halo current magnitude times toroidal peaking factor of ≤ 75%. (author). 3 refs, 2 figs, 3 tabs

Semi-implicit iterative methods for low Mach number turbulent reacting flows: Operator splitting versus approximate factorization

Science.gov (United States)

MacArt, Jonathan F.; Mueller, Michael E.

2016-12-01

Two formally second-order accurate, semi-implicit, iterative methods for the solution of scalar transport-reaction equations are developed for Direct Numerical Simulation (DNS) of low Mach number turbulent reacting flows. The first is a monolithic scheme based on a linearly implicit midpoint method utilizing an approximately factorized exact Jacobian of the transport and reaction operators. The second is an operator splitting scheme based on the Strang splitting approach. The accuracy properties of these schemes, as well as their stability, cost, and the effect of chemical mechanism size on relative performance, are assessed in two one-dimensional test configurations comprising an unsteady premixed flame and an unsteady nonpremixed ignition, which have substantially different Damköhler numbers and relative stiffness of transport to chemistry. All schemes demonstrate their formal order of accuracy in the fully-coupled convergence tests. Compared to a (non-)factorized scheme with a diagonal approximation to the chemical Jacobian, the monolithic, factorized scheme using the exact chemical Jacobian is shown to be both more stable and more economical. This is due to an improved convergence rate of the iterative procedure, and the difference between the two schemes in convergence rate grows as the time step increases. The stability properties of the Strang splitting scheme are demonstrated to outpace those of Lie splitting and monolithic schemes in simulations at high Damköhler number; however, in this regime, the monolithic scheme using the approximately factorized exact Jacobian is found to be the most economical at practical CFL numbers. The performance of the schemes is further evaluated in a simulation of a three-dimensional, spatially evolving, turbulent nonpremixed planar jet flame.

ITER council proceedings: 1998

International Nuclear Information System (INIS)

1999-01-01

This volume contains documents of the 13th and the 14th ITER council meeting as well as of the 1st extraordinary ITER council meeting. Documents of the ITER meetings held in Vienna and Yokohama during 1998 are also included. The contents include an outline of the ITER objectives, the ITER parameters and design overview as well as operating scenarios and plasma performance. Furthermore, design features, safety and environmental characteristics are given

Convergence

Science.gov (United States)

Darcie, Thomas E.; Doverspike, Robert; Zirngibl, Martin; Korotky, Steven K.

2005-01-01

.p {padding-bottom:6px} Call for Papers: Convergence Guest Editors: Thomas E. Darcie, University of Victoria Robert Doverspike, AT&T Martin Zirngibl, Lucent Technologies Coordinating Associate Editor: Steven K. Korotky, Lucent Technologies The Journal of Optical Networking (JON) invites submissions to a special issue on Convergence. Convergence has become a popular theme in telecommunications, one that has broad implications across all segments of the industry. Continual evolution of technology and applications continues to erase lines between traditionally separate lines of business, with dramatic consequences for vendors, service providers, and consumers. Spectacular advances in all layers of optical networking-leading to abundant, dynamic, cost-effective, and reliable wide-area and local-area connections-have been essential drivers of this evolution. As services and networks continue to evolve towards some notion of convergence, the continued role of optical networks must be explored. One vision of convergence renders all information in a common packet (especially IP) format. This vision is driven by the proliferation of data services. For example, time-division multiplexed (TDM) voice becomes VoIP. Analog cable-television signals become MPEG bits streamed to digital set-top boxes. T1 or OC-N private lines migrate to Ethernet virtual private networks (VPNs). All these packets coexist peacefully within a single packet-routing methodology built on an optical transport layer that combines the flexibility and cost of data networks with telecom-grade reliability. While this vision is appealing in its simplicity and shared widely, specifics of implementation raise many challenges and differences of opinion. For example, many seek to expand the role of Ethernet in these transport networks, while massive efforts are underway to make traditional TDM networks more data friendly within an evolved but backward-compatible SDH/SONET (synchronous digital hierarchy and

Convergence

Science.gov (United States)

Darcie, Thomas E.; Doverspike, Robert; Zirngibl, Martin; Korotky, Steven K.

2005-09-01

Call for Papers: Convergence The Journal of Optical Networking (JON) invites submissions to a special issue on Convergence. Convergence has become a popular theme in telecommunications, one that has broad implications across all segments of the industry. Continual evolution of technology and applications continues to erase lines between traditionally separate lines of business, with dramatic consequences for vendors, service providers, and consumers. Spectacular advances in all layers of optical networking-leading to abundant, dynamic, cost-effective, and reliable wide-area and local-area connections-have been essential drivers of this evolution. As services and networks continue to evolve towards some notion of convergence, the continued role of optical networks must be explored. One vision of convergence renders all information in a common packet (especially IP) format. This vision is driven by the proliferation of data services. For example, time-division multiplexed (TDM) voice becomes VoIP. Analog cable-television signals become MPEG bits streamed to digital set-top boxes. T1 or OC-N private lines migrate to Ethernet virtual private networks (VPNs). All these packets coexist peacefully within a single packet-routing methodology built on an optical transport layer that combines the flexibility and cost of data networks with telecom-grade reliability. While this vision is appealing in its simplicity and shared widely, specifics of implementation raise many challenges and differences of opinion. For example, many seek to expand the role of Ethernet in these transport networks, while massive efforts are underway to make traditional TDM networks more data friendly within an evolved but backward-compatible SDH/SONET (synchronous digital hierarchy and synchronous optical network) multiplexing hierarchy. From this common underlying theme follow many specific instantiations. Examples include the convergence at the physical, logical, and operational levels of voice and

New nonlinear methods for linear transport calculations

International Nuclear Information System (INIS)

Adams, M.L.

1993-01-01

We present a new family of methods for the numerical solution of the linear transport equation. With these methods an iteration consists of an 'S N sweep' followed by an 'S 2 -like' calculation. We show, by analysis as well as numerical results, that iterative convergence is always rapid. We show that this rapid convergence does not depend on a consistent discretization of the S 2 -like equations - they can be discretized independently from the S N equations. We show further that independent discretizations can offer significant advantages over consistent ones. In particular, we find that in a wide range of problems, an accurate discretization of the S 2 -like equation can be combined with a crude discretization of the S N equations to produce an accurate S N answer. We demonstrate this by analysis as well as numerical results. (orig.)

Iter

Science.gov (United States)

Iotti, Robert

2015-04-01

ITER is an international experimental facility being built by seven Parties to demonstrate the long term potential of fusion energy. The ITER Joint Implementation Agreement (JIA) defines the structure and governance model of such cooperation. There are a number of necessary conditions for such international projects to be successful: a complete design, strong systems engineering working with an agreed set of requirements, an experienced organization with systems and plans in place to manage the project, a cost estimate backed by industry, and someone in charge. Unfortunately for ITER many of these conditions were not present. The paper discusses the priorities in the JIA which led to setting up the project with a Central Integrating Organization (IO) in Cadarache, France as the ITER HQ, and seven Domestic Agencies (DAs) located in the countries of the Parties, responsible for delivering 90%+ of the project hardware as Contributions-in-Kind and also financial contributions to the IO, as ``Contributions-in-Cash.'' Theoretically the Director General (DG) is responsible for everything. In practice the DG does not have the power to control the work of the DAs, and there is not an effective management structure enabling the IO and the DAs to arbitrate disputes, so the project is not really managed, but is a loose collaboration of competing interests. Any DA can effectively block a decision reached by the DG. Inefficiencies in completing design while setting up a competent organization from scratch contributed to the delays and cost increases during the initial few years. So did the fact that the original estimate was not developed from industry input. Unforeseen inflation and market demand on certain commodities/materials further exacerbated the cost increases. Since then, improvements are debatable. Does this mean that the governance model of ITER is a wrong model for international scientific cooperation? I do not believe so. Had the necessary conditions for success

Diagonalization of complex symmetric matrices: Generalized Householder reflections, iterative deflation and implicit shifts

Science.gov (United States)

Noble, J. H.; Lubasch, M.; Stevens, J.; Jentschura, U. D.

2017-12-01

We describe a matrix diagonalization algorithm for complex symmetric (not Hermitian) matrices, A ̲ =A̲T, which is based on a two-step algorithm involving generalized Householder reflections based on the indefinite inner product 〈 u ̲ , v ̲ 〉 ∗ =∑iuivi. This inner product is linear in both arguments and avoids complex conjugation. The complex symmetric input matrix is transformed to tridiagonal form using generalized Householder transformations (first step). An iterative, generalized QL decomposition of the tridiagonal matrix employing an implicit shift converges toward diagonal form (second step). The QL algorithm employs iterative deflation techniques when a machine-precision zero is encountered "prematurely" on the super-/sub-diagonal. The algorithm allows for a reliable and computationally efficient computation of resonance and antiresonance energies which emerge from complex-scaled Hamiltonians, and for the numerical determination of the real energy eigenvalues of pseudo-Hermitian and PT-symmetric Hamilton matrices. Numerical reference values are provided.

ANALYSIS OF CONVERGENCE WITHIN THE EUROPEAN UNION SIGMA AND BETA CONVERGENCE

Directory of Open Access Journals (Sweden)

Begu Liviu-Stelian

2010-12-01

Full Text Available Real convergence study began with the development of neoclassical models of growth and especially with the passage of econometric applications of these models. In this paper we present applications of indicators and patterns of convergence on the example of European Union member countries and some current economic impact assessments on European convergence process. This analysis is based on the estimated a- and b convergence and on Markov chains. The study deals with the economic convergence of the European countries and especially the convergence of the EU countries, including Romania. In the end of the study presents several economic scenarios for a faster and easier exit from the current crisis in Romania.

Towards converged 5G mobile networks-challenges and current trends

DEFF Research Database (Denmark)

Zakrzewska, Anna; Ruepp, Sarah Renée; Berger, Michael Stübert

2014-01-01

With the rapid development of wireless technologies, the concept of the Fifth Generation (5G) wireless communication system started to emerge and it is foreseen that it will be a result of standards convergence. The expectations towards 5G are set much higher in terms of capacity and maximum thro...

The Hilbert-Schmidt method for nucleon-deuteron scattering

International Nuclear Information System (INIS)

Moeller, K.; Narodetskii, I.M.

1984-01-01

The Hilbert-Schmidt technique is used for computing the divergent multiple-scattering series for scattering of nucleons by deuterons at energies above the deuteron breakup. We have found that for each partial amplitude a series of s-channel resonances diverges because of the logarithmic singularities which reflect the t-channel singularities of the total amplitude. However, the convergence of the Hilbert-Schmidt series may be improved by iterating the Faddeev equations thereby extracting the most strong logarithmic singularities. We show that the series for the amplitudes with the first two iteration subtracted converges rapidly. Our final results are in excellent agreement with exact results obtained by a direct matrix technique. (orig.)

Hilbert-Schmidt method for nucleon-deuteron scattering

International Nuclear Information System (INIS)

Moeller, K.; Narodetskij, I.M.

1983-01-01

The Hilbert-Schmidt technique is used for computing the divergent multiple-scattering series for scattering of nucleons by deuterons at energies above the deuteron breakup. It is found that for each partial amplitude a series of s-channel resonances diverges because of the logarithmic singularities which reflect the t-channel singularities of the total amplitude. However, the convergence of the Hilbert-Schmidt series may be improved by iterating the Faddeev equations thereby extracting the most strong logarithmic singularities. It is shown that the series for the amplitudes with first two iterations subtracted converges rapidly. Final results are in excellent agreement with exact results obtained by a direct matrix technique

Fourier analysis of cell-wise Block-Jacobi splitting in two-dimensional geometry

International Nuclear Information System (INIS)

Rosa, M.; Warsa, J. S.; Kelley, T. M.

2009-01-01

A Fourier analysis is conducted in two-dimensional (2D) geometry for the discrete ordinates (S N ) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) using the cell-wise Block-Jacobi (BJ) algorithm. The results of the Fourier analysis show that convergence of cell-wise BJ can degrade, leading to a spectral radius equal to 1, in problems containing optically thin cells. For problems containing cells that are optically thick, instead, the spectral radius tends to 0. Hence, in the optically thick-cell regime, cell-wise BJ is rapidly convergent even for problems that are scattering dominated, with a scattering ratio c close to 1. (authors)

An iterative, fast-sweeping-based eikonal solver for 3D tilted anisotropic media

KAUST Repository

Waheed, Umair bin; Yarman, Can Evren; Flagg, Garret

2015-01-01

Computation of first-arrival traveltimes for quasi-P waves in the presence of anisotropy is important for high-end near-surface modeling, microseismic-source localization, and fractured-reservoir characterization - and it requires solving an anisotropic eikonal equation. Anisotropy deviating from elliptical anisotropy introduces higher order nonlinearity into the eikonal equation, which makes solving the eikonal equation a challenge. We addressed this challenge by iteratively solving a sequence of simpler tilted elliptically anisotropic eikonal equations. At each iteration, the source function was updated to capture the effects of the higher order nonlinear terms. We used Aitken's extrapolation to speed up convergence rate of the iterative algorithm. The result is an algorithm for computing first-arrival traveltimes in tilted anisotropic media. We evaluated the applicability and usefulness of our method on tilted transversely isotropic media and tilted orthorhombic media. Our numerical tests determined that the proposed method matches the first arrivals obtained by wavefield extrapolation, even for strongly anisotropic and highly complex subsurface structures. Thus, for the cases where two-point ray tracing fails, our method can be a potential substitute for computing traveltimes. The approach presented here can be easily extended to compute first-arrival traveltimes for anisotropic media with lower symmetries, such as monoclinic or even the triclinic media.

An iterative, fast-sweeping-based eikonal solver for 3D tilted anisotropic media

KAUST Repository

Waheed, Umair bin

2015-03-30

Computation of first-arrival traveltimes for quasi-P waves in the presence of anisotropy is important for high-end near-surface modeling, microseismic-source localization, and fractured-reservoir characterization - and it requires solving an anisotropic eikonal equation. Anisotropy deviating from elliptical anisotropy introduces higher order nonlinearity into the eikonal equation, which makes solving the eikonal equation a challenge. We addressed this challenge by iteratively solving a sequence of simpler tilted elliptically anisotropic eikonal equations. At each iteration, the source function was updated to capture the effects of the higher order nonlinear terms. We used Aitken\\'s extrapolation to speed up convergence rate of the iterative algorithm. The result is an algorithm for computing first-arrival traveltimes in tilted anisotropic media. We evaluated the applicability and usefulness of our method on tilted transversely isotropic media and tilted orthorhombic media. Our numerical tests determined that the proposed method matches the first arrivals obtained by wavefield extrapolation, even for strongly anisotropic and highly complex subsurface structures. Thus, for the cases where two-point ray tracing fails, our method can be a potential substitute for computing traveltimes. The approach presented here can be easily extended to compute first-arrival traveltimes for anisotropic media with lower symmetries, such as monoclinic or even the triclinic media.

Adaptive optimal control of unknown constrained-input systems using policy iteration and neural networks.

Science.gov (United States)

Modares, Hamidreza; Lewis, Frank L; Naghibi-Sistani, Mohammad-Bagher

2013-10-01

This paper presents an online policy iteration (PI) algorithm to learn the continuous-time optimal control solution for unknown constrained-input systems. The proposed PI algorithm is implemented on an actor-critic structure where two neural networks (NNs) are tuned online and simultaneously to generate the optimal bounded control policy. The requirement of complete knowledge of the system dynamics is obviated by employing a novel NN identifier in conjunction with the actor and critic NNs. It is shown how the identifier weights estimation error affects the convergence of the critic NN. A novel learning rule is developed to guarantee that the identifier weights converge to small neighborhoods of their ideal values exponentially fast. To provide an easy-to-check persistence of excitation condition, the experience replay technique is used. That is, recorded past experiences are used simultaneously with current data for the adaptation of the identifier weights. Stability of the whole system consisting of the actor, critic, system state, and system identifier is guaranteed while all three networks undergo adaptation. Convergence to a near-optimal control law is also shown. The effectiveness of the proposed method is illustrated with a simulation example.

Structural analysis of the ITER Vacuum Vessel regarding 2012 ITER Project-Level Loads

Energy Technology Data Exchange (ETDEWEB)

Martinez, J.-M., E-mail: jean-marc.martinez@live.fr [ITER Organization, Route de Vinon sur Verdon, 13115 St Paul lez Durance (France); Jun, C.H.; Portafaix, C.; Choi, C.-H.; Ioki, K.; Sannazzaro, G.; Sborchia, C. [ITER Organization, Route de Vinon sur Verdon, 13115 St Paul lez Durance (France); Cambazar, M.; Corti, Ph.; Pinori, K.; Sfarni, S.; Tailhardat, O. [Assystem EOS, 117 rue Jacquard, L' Atrium, 84120 Pertuis (France); Borrelly, S. [Sogeti High Tech, RE2, 180 rue René Descartes, Le Millenium – Bat C, 13857 Aix en Provence (France); Albin, V.; Pelletier, N. [SOM Calcul – Groupe ORTEC, 121 ancien Chemin de Cassis – Immeuble Grand Pré, 13009 Marseille (France)

2014-10-15

Highlights: • ITER Vacuum Vessel is a part of the first barrier to confine the plasma. • ITER Vacuum Vessel as Nuclear Pressure Equipment (NPE) necessitates a third party organization authorized by the French nuclear regulator to assure design, fabrication, conformance testing and quality assurance, i.e. Agreed Notified Body (ANB). • A revision of the ITER Project-Level Load Specification was implemented in April 2012. • ITER Vacuum Vessel Loads (seismic, pressure, thermal and electromagnetic loads) were summarized. • ITER Vacuum Vessel Structural Margins with regards to RCC-MR code were summarized. - Abstract: A revision of the ITER Project-Level Load Specification (to be used for all systems of the ITER machine) was implemented in April 2012. This revision supports ITER's licensing by accommodating requests from the French regulator to maintain consistency with the plasma physics database and our present understanding of plasma transients and electro-magnetic (EM) loads, to investigate the possibility of removing unnecessary conservatism in the load requirements and to review the list and definition of incidental cases. The purpose of this paper is to present the impact of this 2012 revision of the ITER Project-Level Load Specification (LS) on the ITER Vacuum Vessel (VV) loads and the main structural margins required by the applicable French code, RCC-MR.

Science and technology convergence: with emphasis for nanotechnology-inspired convergence

Energy Technology Data Exchange (ETDEWEB)

Bainbridge, William S.; Roco, Mihail C., E-mail: mroco@nsf.gov [National Science Foundation (United States)

2016-07-15

Convergence offers a new universe of discovery, innovation, and application opportunities through specific theories, principles, and methods to be implemented in research, education, production, and other societal activities. Using a holistic approach with shared goals, convergence seeks to transcend existing human limitations to achieve improved conditions for work, learning, aging, physical, and cognitive wellness. This paper outlines ten key theories that offer complementary perspectives on this complex dynamic. Principles and methods are proposed to facilitate and enhance science and technology convergence. Several convergence success stories in the first part of the 21st century—including nanotechnology and other emerging technologies—are discussed in parallel with case studies focused on the future. The formulation of relevant theories, principles, and methods aims at establishing the convergence science.

Science and technology convergence: with emphasis for nanotechnology-inspired convergence

International Nuclear Information System (INIS)

Bainbridge, William S.; Roco, Mihail C.

2016-01-01

Convergence offers a new universe of discovery, innovation, and application opportunities through specific theories, principles, and methods to be implemented in research, education, production, and other societal activities. Using a holistic approach with shared goals, convergence seeks to transcend existing human limitations to achieve improved conditions for work, learning, aging, physical, and cognitive wellness. This paper outlines ten key theories that offer complementary perspectives on this complex dynamic. Principles and methods are proposed to facilitate and enhance science and technology convergence. Several convergence success stories in the first part of the 21st century—including nanotechnology and other emerging technologies—are discussed in parallel with case studies focused on the future. The formulation of relevant theories, principles, and methods aims at establishing the convergence science.

ITER test programme

International Nuclear Information System (INIS)

Abdou, M.; Baker, C.; Casini, G.

1991-01-01

ITER has been designed to operate in two phases. The first phase which lasts for 6 years, is devoted to machine checkout and physics testing. The second phase lasts for 8 years and is devoted primarily to technology testing. This report describes the technology test program development for ITER, the ancillary equipment outside the torus necessary to support the test modules, the international collaboration aspects of conducting the test program on ITER, the requirements on the machine major parameters and the R and D program required to develop the test modules for testing in ITER. 15 refs, figs and tabs

PRIM: An Efficient Preconditioning Iterative Reweighted Least Squares Method for Parallel Brain MRI Reconstruction.

Science.gov (United States)

Xu, Zheng; Wang, Sheng; Li, Yeqing; Zhu, Feiyun; Huang, Junzhou

2018-02-08

The most recent history of parallel Magnetic Resonance Imaging (pMRI) has in large part been devoted to finding ways to reduce acquisition time. While joint total variation (JTV) regularized model has been demonstrated as a powerful tool in increasing sampling speed for pMRI, however, the major bottleneck is the inefficiency of the optimization method. While all present state-of-the-art optimizations for the JTV model could only reach a sublinear convergence rate, in this paper, we squeeze the performance by proposing a linear-convergent optimization method for the JTV model. The proposed method is based on the Iterative Reweighted Least Squares algorithm. Due to the complexity of the tangled JTV objective, we design a novel preconditioner to further accelerate the proposed method. Extensive experiments demonstrate the superior performance of the proposed algorithm for pMRI regarding both accuracy and efficiency compared with state-of-the-art methods.

ITER-FEAT outline design report

International Nuclear Information System (INIS)

2001-01-01

In July 1998 the ITER Parties were unable, for financial reasons, to proceed with construction of the ITER design proposed at that time, to meet the detailed technical objectives and target cost set in 1992. It was therefore decided to investigate options for the design of ITER with reduced technical objectives and with possibly decreased technical margins, whose target construction cost was one half that of the 1998 ITER design, while maintaining the overall programmatic objective. To identify designs that might meet the revised objectives, task forces involving the JCT and Home Teams met during 1998 and 1999 to analyse and compare a range of options for the design of such a device. This led at the end of 1999 to a single configuration for the ITER design with parameters considered to be the most credible consistent with technical limitations and the financial target, yet meeting fully the objectives with appropriate margins. This new design of ITER, called ''ITER-FEAT'', was submitted to the ITER Director to the ITER Parties as the ''ITER-FEAT Outline Design Report'' (ODR) in January 2000, at their meeting in Tokyo. The Parties subsequently conducted their domestic assessments of this report and fed the resulting comments back into the progressing design. The progress on the developing design was reported to the ITER Technical Advisory Committee (TAC) in June 2000 in the report ''Progress in Resolving Open Design Issues from the ODR'' alongside a report on Progress in Technology R and D for ITER. In addition, the progress in the ITER-FEAT Design and Validating R and D was reported to the ITER Parties. The ITER-FEAT design was subsequently approved by the governing body of ITER in Moscow in June 2000 as the basis for the preparation of the Final Design Report, recognising it as a single mature design for ITER consistent with its revised objectives. This volume contains the documents pertinent to the process described above. More detailed technical information

IT-BT convergence technology

International Nuclear Information System (INIS)

2012-12-01

This book explains IT-BT convergence technology as the future technology, which includes a prolog, easy IT-BT convergence technology that has infinite potentials for new value, policy of IT-BT convergence technology showing the potential of smart Korea, IT-BT convergence opening happy future, for the new future of IT powerful nation Korea with IT-BT convergence technology and an epilogue. This book reveals the conception, policy, performance and future of IT-BT convergence technology.

SU-D-206-03: Segmentation Assisted Fast Iterative Reconstruction Method for Cone-Beam CT

International Nuclear Information System (INIS)

Wu, P; Mao, T; Gong, S; Wang, J; Niu, T; Sheng, K; Xie, Y

2016-01-01

Purpose: Total Variation (TV) based iterative reconstruction (IR) methods enable accurate CT image reconstruction from low-dose measurements with sparse projection acquisition, due to the sparsifiable feature of most CT images using gradient operator. However, conventional solutions require large amount of iterations to generate a decent reconstructed image. One major reason is that the expected piecewise constant property is not taken into consideration at the optimization starting point. In this work, we propose an iterative reconstruction method for cone-beam CT (CBCT) using image segmentation to guide the optimization path more efficiently on the regularization term at the beginning of the optimization trajectory. Methods: Our method applies general knowledge that one tissue component in the CT image contains relatively uniform distribution of CT number. This general knowledge is incorporated into the proposed reconstruction using image segmentation technique to generate the piecewise constant template on the first-pass low-quality CT image reconstructed using analytical algorithm. The template image is applied as an initial value into the optimization process. Results: The proposed method is evaluated on the Shepp-Logan phantom of low and high noise levels, and a head patient. The number of iterations is reduced by overall 40%. Moreover, our proposed method tends to generate a smoother reconstructed image with the same TV value. Conclusion: We propose a computationally efficient iterative reconstruction method for CBCT imaging. Our method achieves a better optimization trajectory and a faster convergence behavior. It does not rely on prior information and can be readily incorporated into existing iterative reconstruction framework. Our method is thus practical and attractive as a general solution to CBCT iterative reconstruction. This work is supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. LR16F010001), National High-tech R

SU-D-206-03: Segmentation Assisted Fast Iterative Reconstruction Method for Cone-Beam CT

Energy Technology Data Exchange (ETDEWEB)

Wu, P; Mao, T; Gong, S; Wang, J; Niu, T [Sir Run Run Shaw Hospital, Zhejiang University School of Medicine, Institute of Translational Medicine, Zhejiang University, Hangzhou, Zhejiang (China); Sheng, K [Department of Radiation Oncology, University of California, Los Angeles, Los Angeles, CA (United States); Xie, Y [Institute of Biomedical and Health Engineering, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, Guangdong (China)

2016-06-15

Purpose: Total Variation (TV) based iterative reconstruction (IR) methods enable accurate CT image reconstruction from low-dose measurements with sparse projection acquisition, due to the sparsifiable feature of most CT images using gradient operator. However, conventional solutions require large amount of iterations to generate a decent reconstructed image. One major reason is that the expected piecewise constant property is not taken into consideration at the optimization starting point. In this work, we propose an iterative reconstruction method for cone-beam CT (CBCT) using image segmentation to guide the optimization path more efficiently on the regularization term at the beginning of the optimization trajectory. Methods: Our method applies general knowledge that one tissue component in the CT image contains relatively uniform distribution of CT number. This general knowledge is incorporated into the proposed reconstruction using image segmentation technique to generate the piecewise constant template on the first-pass low-quality CT image reconstructed using analytical algorithm. The template image is applied as an initial value into the optimization process. Results: The proposed method is evaluated on the Shepp-Logan phantom of low and high noise levels, and a head patient. The number of iterations is reduced by overall 40%. Moreover, our proposed method tends to generate a smoother reconstructed image with the same TV value. Conclusion: We propose a computationally efficient iterative reconstruction method for CBCT imaging. Our method achieves a better optimization trajectory and a faster convergence behavior. It does not rely on prior information and can be readily incorporated into existing iterative reconstruction framework. Our method is thus practical and attractive as a general solution to CBCT iterative reconstruction. This work is supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. LR16F010001), National High-tech R

ITER council proceedings: 1995

International Nuclear Information System (INIS)

1996-01-01

Records of the 8. ITER Council Meeting (IC-8), held on 26-27 July 1995, in San Diego, USA, and the 9. ITER Council Meeting (IC-9) held on 12-13 December 1995, in Garching, Germany, are presented, giving essential information on the evolution of the ITER Engineering Design Activities (EDA) and the ITER Interim Design Report Package and Relevant Documents. Figs, tabs

Comparisons of NIF convergent ablation simulations with radiograph data.

Science.gov (United States)

Olson, R E; Hicks, D G; Meezan, N B; Koch, J A; Landen, O L

2012-10-01

A technique for comparing simulation results directly with radiograph data from backlit capsule implosion experiments will be discussed. Forward Abel transforms are applied to the kappa*rho profiles of the simulation. These provide the transmission ratio (optical depth) profiles of the simulation. Gaussian and top hat blurs are applied to the simulated transmission ratio profiles in order to account for the motion blurring and imaging slit resolution of the experimental measurement. Comparisons between the simulated transmission ratios and the radiograph data lineouts are iterated until a reasonable backlighter profile is obtained. This backlighter profile is combined with the blurred, simulated transmission ratios to obtain simulated intensity profiles that can be directly compared with the radiograph data. Examples will be shown from recent convergent ablation (backlit implosion) experiments at the NIF.

Optimization of PET image quality by means of 3D data acquisition and iterative image reconstruction

International Nuclear Information System (INIS)

Doll, J.; Zaers, J.; Trojan, H.; Bellemann, M.E.; Adam, L.E.; Haberkorn, U.; Brix, G.

1998-01-01

The experiments were performed at the latest-generation whole-body PET system ECAT EXACT HR + . For 2D data acquisition, a collimator of thin tungsten septa was positioned in the field-of-view. Prior to image reconstruction, the measured 3D data were sorted into 2D sinograms by using the Fourier rebinning (FORE) algorithm developed by M. Defrise. The standard filtered backprojection (FBP) method and an optimized ML/EM algorithm with overrelaxation for accelerated convergence were employed for image reconstruction. The spatial resolution of both methods as well as the convergence and noise properties of the ML/EM algorithm were studied in phantom measurements. Furthermore, patient data were acquired in the 2D mode as well as in the 3D mode and reconstructed with both techniques. At the same spatial resolution, the ML/EM-reconstructed images showed fewer and less prominent artefacts than the FBP-reconstructed images. The resulting improved detail conspicuously was achieved for the data acquired in the 2D mode as well as in the 3D mode. The best image quality was obtained by iterative 2D reconstruction of 3D data sets which were previously rebinned into 2D sinograms with help of the FORE algorithm. The phantom measurements revealed that 50 iteration steps with the otpimized ML/EM algorithm were sufficient to keep the relative quantitation error below 5%. (orig./MG) [de

Recycling source terms for edge plasma fluid models and impact on convergence behaviour of the BRAAMS 'B2' code

International Nuclear Information System (INIS)

Maddison, G.P.; Reiter, D.

1994-02-01

Predictive simulations of tokamak edge plasmas require the most authentic description of neutral particle recycling sources, not merely the most expedient numerically. Employing a prototypical ITER divertor arrangement under conditions of high recycling, trial calculations with the 'B2' steady-state edge plasma transport code, plus varying approximations or recycling, reveal marked sensitivity of both results and its convergence behaviour to details of sources incorporated. Comprehensive EIRENE Monte Carlo resolution of recycling is implemented by full and so-called 'shot' intermediate cycles between the plasma fluid and statistical neutral particle models. As generally for coupled differencing and stochastic procedures, though, overall convergence properties become more difficult to assess. A pragmatic criterion for the 'B2'/EIRENE code system is proposed to determine its success, proceeding from a stricter condition previously identified for one particular analytic approximation of recycling in 'B2'. Certain procedures are also inferred potentially to improve their convergence further. (orig.)

An iterative stochastic ensemble method for parameter estimation of subsurface flow models

International Nuclear Information System (INIS)

Elsheikh, Ahmed H.; Wheeler, Mary F.; Hoteit, Ibrahim

2013-01-01

Parameter estimation for subsurface flow models is an essential step for maximizing the value of numerical simulations for future prediction and the development of effective control strategies. We propose the iterative stochastic ensemble method (ISEM) as a general method for parameter estimation based on stochastic estimation of gradients using an ensemble of directional derivatives. ISEM eliminates the need for adjoint coding and deals with the numerical simulator as a blackbox. The proposed method employs directional derivatives within a Gauss–Newton iteration. The update equation in ISEM resembles the update step in ensemble Kalman filter, however the inverse of the output covariance matrix in ISEM is regularized using standard truncated singular value decomposition or Tikhonov regularization. We also investigate the performance of a set of shrinkage based covariance estimators within ISEM. The proposed method is successfully applied on several nonlinear parameter estimation problems for subsurface flow models. The efficiency of the proposed algorithm is demonstrated by the small size of utilized ensembles and in terms of error convergence rates

An iterative stochastic ensemble method for parameter estimation of subsurface flow models

KAUST Repository

Elsheikh, Ahmed H.

2013-06-01

Parameter estimation for subsurface flow models is an essential step for maximizing the value of numerical simulations for future prediction and the development of effective control strategies. We propose the iterative stochastic ensemble method (ISEM) as a general method for parameter estimation based on stochastic estimation of gradients using an ensemble of directional derivatives. ISEM eliminates the need for adjoint coding and deals with the numerical simulator as a blackbox. The proposed method employs directional derivatives within a Gauss-Newton iteration. The update equation in ISEM resembles the update step in ensemble Kalman filter, however the inverse of the output covariance matrix in ISEM is regularized using standard truncated singular value decomposition or Tikhonov regularization. We also investigate the performance of a set of shrinkage based covariance estimators within ISEM. The proposed method is successfully applied on several nonlinear parameter estimation problems for subsurface flow models. The efficiency of the proposed algorithm is demonstrated by the small size of utilized ensembles and in terms of error convergence rates. © 2013 Elsevier Inc.

Reducing dose calculation time for accurate iterative IMRT planning

International Nuclear Information System (INIS)

Siebers, Jeffrey V.; Lauterbach, Marc; Tong, Shidong; Wu Qiuwen; Mohan, Radhe

2002-01-01

A time-consuming component of IMRT optimization is the dose computation required in each iteration for the evaluation of the objective function. Accurate superposition/convolution (SC) and Monte Carlo (MC) dose calculations are currently considered too time-consuming for iterative IMRT dose calculation. Thus, fast, but less accurate algorithms such as pencil beam (PB) algorithms are typically used in most current IMRT systems. This paper describes two hybrid methods that utilize the speed of fast PB algorithms yet achieve the accuracy of optimizing based upon SC algorithms via the application of dose correction matrices. In one method, the ratio method, an infrequently computed voxel-by-voxel dose ratio matrix (R=D SC /D PB ) is applied for each beam to the dose distributions calculated with the PB method during the optimization. That is, D PB xR is used for the dose calculation during the optimization. The optimization proceeds until both the IMRT beam intensities and the dose correction ratio matrix converge. In the second method, the correction method, a periodically computed voxel-by-voxel correction matrix for each beam, defined to be the difference between the SC and PB dose computations, is used to correct PB dose distributions. To validate the methods, IMRT treatment plans developed with the hybrid methods are compared with those obtained when the SC algorithm is used for all optimization iterations and with those obtained when PB-based optimization is followed by SC-based optimization. In the 12 patient cases studied, no clinically significant differences exist in the final treatment plans developed with each of the dose computation methodologies. However, the number of time-consuming SC iterations is reduced from 6-32 for pure SC optimization to four or less for the ratio matrix method and five or less for the correction method. Because the PB algorithm is faster at computing dose, this reduces the inverse planning optimization time for our implementation

Convergence in Multispecies Interactions

OpenAIRE

Bittleston, Leonora Sophia; Pierce, Naomi E.; Ellison, Aaron M.; Pringle, Anne

2016-01-01

The concepts of convergent evolution and community convergence highlight how selective pressures can shape unrelated organisms or communities in similar ways. We propose a related concept, convergent interactions, to describe the independent evolution of multispecies interactions with similar physiological or ecological functions. A focus on convergent interactions clarifies how natural selection repeatedly favors particular kinds of associations among species. Characterizing convergent inter...

Robust Huber-based iterated divided difference filtering with application to cooperative localization of autonomous underwater vehicles.

Science.gov (United States)

Gao, Wei; Liu, Yalong; Xu, Bo

2014-12-19

A new algorithm called Huber-based iterated divided difference filtering (HIDDF) is derived and applied to cooperative localization of autonomous underwater vehicles (AUVs) supported by a single surface leader. The position states are estimated using acoustic range measurements relative to the leader, in which some disadvantages such as weak observability, large initial error and contaminated measurements with outliers are inherent. By integrating both merits of iterated divided difference filtering (IDDF) and Huber's M-estimation methodology, the new filtering method could not only achieve more accurate estimation and faster convergence contrast to standard divided difference filtering (DDF) in conditions of weak observability and large initial error, but also exhibit robustness with respect to outlier measurements, for which the standard IDDF would exhibit severe degradation in estimation accuracy. The correctness as well as validity of the algorithm is demonstrated through experiment results.

Policy Iteration for $H_\\infty $ Optimal Control of Polynomial Nonlinear Systems via Sum of Squares Programming.

Science.gov (United States)

Zhu, Yuanheng; Zhao, Dongbin; Yang, Xiong; Zhang, Qichao

2018-02-01

Sum of squares (SOS) polynomials have provided a computationally tractable way to deal with inequality constraints appearing in many control problems. It can also act as an approximator in the framework of adaptive dynamic programming. In this paper, an approximate solution to the optimal control of polynomial nonlinear systems is proposed. Under a given attenuation coefficient, the Hamilton-Jacobi-Isaacs equation is relaxed to an optimization problem with a set of inequalities. After applying the policy iteration technique and constraining inequalities to SOS, the optimization problem is divided into a sequence of feasible semidefinite programming problems. With the converged solution, the attenuation coefficient is further minimized to a lower value. After iterations, approximate solutions to the smallest -gain and the associated optimal controller are obtained. Four examples are employed to verify the effectiveness of the proposed algorithm.

ITER CTA newsletter. No. 3

International Nuclear Information System (INIS)

2001-11-01

This ITER CTA newsletter comprises reports of Dr. P. Barnard, Iter Canada Chairman and CEO, about the progress of the first formal ITER negotiations and about the demonstration of details of Canada's bid on ITER workshops, and Dr. V. Vlasenkov, Project Board Secretary, about the meeting of the ITER CTA project board

ITER council proceedings: 1997

International Nuclear Information System (INIS)

1997-01-01

This volume of the ITER EDA Documentation Series presents records of the 12th ITER Council Meeting, IC-12, which took place on 23-24 July, 1997 in Tampere, Finland. The Council received from the Parties (EU, Japan, Russia, US) positive responses on the Detailed Design Report. The Parties stated their willingness to contribute to fulfil their obligations in contributing to the ITER EDA. The summary discussions among the Parties led to the consensus that in July 1998 the ITER activities should proceed for additional three years with a general intent to enable an efficient start of possible, future ITER construction

Stability analysis of a deterministic dose calculation for MRI-guided radiotherapy

Science.gov (United States)

Zelyak, O.; Fallone, B. G.; St-Aubin, J.

2018-01-01

Modern effort in radiotherapy to address the challenges of tumor localization and motion has led to the development of MRI guided radiotherapy technologies. Accurate dose calculations must properly account for the effects of the MRI magnetic fields. Previous work has investigated the accuracy of a deterministic linear Boltzmann transport equation (LBTE) solver that includes magnetic field, but not the stability of the iterative solution method. In this work, we perform a stability analysis of this deterministic algorithm including an investigation of the convergence rate dependencies on the magnetic field, material density, energy, and anisotropy expansion. The iterative convergence rate of the continuous and discretized LBTE including magnetic fields is determined by analyzing the spectral radius using Fourier analysis for the stationary source iteration (SI) scheme. The spectral radius is calculated when the magnetic field is included (1) as a part of the iteration source, and (2) inside the streaming-collision operator. The non-stationary Krylov subspace solver GMRES is also investigated as a potential method to accelerate the iterative convergence, and an angular parallel computing methodology is investigated as a method to enhance the efficiency of the calculation. SI is found to be unstable when the magnetic field is part of the iteration source, but unconditionally stable when the magnetic field is included in the streaming-collision operator. The discretized LBTE with magnetic fields using a space-angle upwind stabilized discontinuous finite element method (DFEM) was also found to be unconditionally stable, but the spectral radius rapidly reaches unity for very low-density media and increasing magnetic field strengths indicating arbitrarily slow convergence rates. However, GMRES is shown to significantly accelerate the DFEM convergence rate showing only a weak dependence on the magnetic field. In addition, the use of an angular parallel computing strategy

Stability analysis of a deterministic dose calculation for MRI-guided radiotherapy.

Science.gov (United States)

Zelyak, O; Fallone, B G; St-Aubin, J

2017-12-14

Modern effort in radiotherapy to address the challenges of tumor localization and motion has led to the development of MRI guided radiotherapy technologies. Accurate dose calculations must properly account for the effects of the MRI magnetic fields. Previous work has investigated the accuracy of a deterministic linear Boltzmann transport equation (LBTE) solver that includes magnetic field, but not the stability of the iterative solution method. In this work, we perform a stability analysis of this deterministic algorithm including an investigation of the convergence rate dependencies on the magnetic field, material density, energy, and anisotropy expansion. The iterative convergence rate of the continuous and discretized LBTE including magnetic fields is determined by analyzing the spectral radius using Fourier analysis for the stationary source iteration (SI) scheme. The spectral radius is calculated when the magnetic field is included (1) as a part of the iteration source, and (2) inside the streaming-collision operator. The non-stationary Krylov subspace solver GMRES is also investigated as a potential method to accelerate the iterative convergence, and an angular parallel computing methodology is investigated as a method to enhance the efficiency of the calculation. SI is found to be unstable when the magnetic field is part of the iteration source, but unconditionally stable when the magnetic field is included in the streaming-collision operator. The discretized LBTE with magnetic fields using a space-angle upwind stabilized discontinuous finite element method (DFEM) was also found to be unconditionally stable, but the spectral radius rapidly reaches unity for very low-density media and increasing magnetic field strengths indicating arbitrarily slow convergence rates. However, GMRES is shown to significantly accelerate the DFEM convergence rate showing only a weak dependence on the magnetic field. In addition, the use of an angular parallel computing strategy

Hybrid iterative phase retrieval algorithm based on fusion of intensity information in three defocused planes.

Science.gov (United States)

Zeng, Fa; Tan, Qiaofeng; Yan, Yingbai; Jin, Guofan

2007-10-01

Study of phase retrieval technology is quite meaningful, for its wide applications related to many domains, such as adaptive optics, detection of laser quality, precise measurement of optical surface, and so on. Here a hybrid iterative phase retrieval algorithm is proposed, based on fusion of the intensity information in three defocused planes. First the conjugate gradient algorithm is adapted to achieve a coarse solution of phase distribution in the input plane; then the iterative angular spectrum method is applied in succession for better retrieval result. This algorithm is still applicable even when the exact shape and size of the aperture in the input plane are unknown. Moreover, this algorithm always exhibits good convergence, i.e., the retrieved results are insensitive to the chosen positions of the three defocused planes and the initial guess of complex amplitude in the input plane, which has been proved by both simulations and further experiments.

Iterative algorithm for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution

Science.gov (United States)

Quan, Haiyang; Wu, Fan; Hou, Xi

2015-10-01

New method for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution is proposed. It is based on basic iterative scheme and accelerates the Gauss-Seidel method by introducing an acceleration parameter. This modified Successive Over-relaxation (SOR) is effective for solving the rotationally asymmetric components with pixel-level spatial resolution, without the usage of a fitting procedure. Compared to the Jacobi and Gauss-Seidel method, the modified SOR method with an optimal relaxation factor converges much faster and saves more computational costs and memory space without reducing accuracy. It has been proved by real experimental results.

Iterative and iterative-noniterative integral solutions in 3-loop massive QCD calculations

International Nuclear Information System (INIS)

Ablinger, J.; Radu, C.S.; Schneider, C.; Behring, A.; Imamoglu, E.; Van Hoeij, M.; Von Manteuffel, A.; Raab, C.G.

2017-11-01

Various of the single scale quantities in massless and massive QCD up to 3-loop order can be expressed by iterative integrals over certain classes of alphabets, from the harmonic polylogarithms to root-valued alphabets. Examples are the anomalous dimensions to 3-loop order, the massless Wilson coefficients and also different massive operator matrix elements. Starting at 3-loop order, however, also other letters appear in the case of massive operator matrix elements, the so called iterative non-iterative integrals, which are related to solutions based on complete elliptic integrals or any other special function with an integral representation that is definite but not a Volterra-type integral. After outlining the formalism leading to iterative non-iterative integrals,we present examples for both of these cases with the 3-loop anomalous dimension γ (2) qg and the structure of the principle solution in the iterative non-interative case of the 3-loop QCD corrections to the ρ-parameter.

Iterative and iterative-noniterative integral solutions in 3-loop massive QCD calculations

Energy Technology Data Exchange (ETDEWEB)

Ablinger, J.; Radu, C.S.; Schneider, C. [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation (RISC); Behring, A. [RWTH Aachen Univ. (Germany). Inst. fuer Theoretische Teilchenphysik und Kosmologie; Bluemlein, J.; Freitas, A. de [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Imamoglu, E.; Van Hoeij, M. [Florida State Univ., Tallahassee, FL (United States). Dept. of Mathematics; Von Manteuffel, A. [Michigan State Univ., East Lansing, MI (United States). Dept. of Physics and Astronomy; Raab, C.G. [Johannes Kepler Univ., Linz (Austria). Inst. for Algebra

2017-11-15

Various of the single scale quantities in massless and massive QCD up to 3-loop order can be expressed by iterative integrals over certain classes of alphabets, from the harmonic polylogarithms to root-valued alphabets. Examples are the anomalous dimensions to 3-loop order, the massless Wilson coefficients and also different massive operator matrix elements. Starting at 3-loop order, however, also other letters appear in the case of massive operator matrix elements, the so called iterative non-iterative integrals, which are related to solutions based on complete elliptic integrals or any other special function with an integral representation that is definite but not a Volterra-type integral. After outlining the formalism leading to iterative non-iterative integrals,we present examples for both of these cases with the 3-loop anomalous dimension γ{sup (2)}{sub qg} and the structure of the principle solution in the iterative non-interative case of the 3-loop QCD corrections to the ρ-parameter.

An iterative algorithm for calculating stylus radius unambiguously

International Nuclear Information System (INIS)

Vorburger, T V; Zheng, A; Renegar, T B; Song, J-F; Ma, L

2011-01-01

The stylus radius is an important specification for stylus instruments and is commonly provided by instrument manufacturers. However, it is difficult to measure the stylus radius unambiguously. Accurate profiles of the stylus tip may be obtained by profiling over an object sharper than itself, such as a razor blade. However, the stylus profile thus obtained is a partial arc, and unless the shape of the stylus tip is a perfect sphere or circle, the effective value of the radius depends on the length of the tip profile over which the radius is determined. We have developed an iterative, least squares algorithm aimed to determine the effective least squares stylus radius unambiguously. So far, the algorithm converges to reasonable results for the least squares stylus radius. We suggest that the algorithm be considered for adoption in documentary standards describing the properties of stylus instruments.

On the convergence of finite state mean-field games through Γ-convergence

KAUST Repository

Ferreira, Rita C.; Gomes, Diogo A.

2014-01-01

In this study, we consider the long-term convergence (trend toward an equilibrium) of finite state mean-field games using Γ-convergence. Our techniques are based on the observation that an important class of mean-field games can be viewed as the Euler-Lagrange equation of a suitable functional. Therefore, using a scaling argument, one can convert a long-term convergence problem into a Γ-convergence problem. Our results generalize previous results related to long-term convergence for finite state problems. © 2014 Elsevier Inc.

On the convergence of finite state mean-field games through Γ-convergence

KAUST Repository

Ferreira, Rita C.

2014-10-01

In this study, we consider the long-term convergence (trend toward an equilibrium) of finite state mean-field games using Γ-convergence. Our techniques are based on the observation that an important class of mean-field games can be viewed as the Euler-Lagrange equation of a suitable functional. Therefore, using a scaling argument, one can convert a long-term convergence problem into a Γ-convergence problem. Our results generalize previous results related to long-term convergence for finite state problems. © 2014 Elsevier Inc.

Physics research needs for ITER

International Nuclear Information System (INIS)

Sauthoff, N.R.

1995-01-01

Design of ITER entails the application of physics design tools that have been validated against the world-wide data base of fusion research. In many cases, these tools do not yet exist and must be developed as part of the ITER physics program. ITER's considerable increases in power and size demand significant extrapolations from the current data base; in several cases, new physical effects are projected to dominate the behavior of the ITER plasma. This paper focuses on those design tools and data that have been identified by the ITER team and are not yet available; these needs serve as the basis for the ITER Physics Research Needs, which have been developed jointly by the ITER Physics Expert Groups and the ITER design team. Development of the tools and the supporting data base is an on-going activity that constitutes a significant opportunity for contributions to the ITER program by fusion research programs world-wide

Network Convergence

Indian Academy of Sciences (India)

First page Back Continue Last page Overview Graphics. Network Convergence. User is interested in application and content - not technical means of distribution. Boundaries between distribution channels fade out. Network convergence leads to seamless application and content solutions.

A iterative algorithm in computarized tomography applied to non-destructive testing

International Nuclear Information System (INIS)

Santos, C.A.C.

1982-10-01

In the present work, a mathematical model has been developed for two dimensional image reconstruction in computarized tomography applied to non-destructive testing. The method used is the Algebraic Reconstruction Technique (ART) with additive corrections. This model consists of a discontinuous system formed by an NxN array of cells (pixels). The attenuation in the object of a collimated beam of gamma rays has been determined for various positions and angles of incidence (projections) in terms of the interaction of the beam with the intercepted pixels. The contribution of each pixel to beam attenuation was determined using the weight function wij. Simulated tests using standard objects carried out with attenuation coefficients in the range 0,2 to 0,7 cm -1 , were made using cell arrays of up to 25x25. Experiments were made using a gamma radiation source ( 241 Am), a table with translational and rotational movements and a gamma radiation detection system. Results indicate that convergence obtained in the iterative calculations is a function of the distribution of attenuation coefficient in the pixels, of the number of angular projection and of the number of iterations. (author) [pt

ITER radio frequency systems

International Nuclear Information System (INIS)

Bosia, G.

1998-01-01

Neutral Beam Injection and RF heating are two of the methods for heating and current drive in ITER. The three ITER RF systems, which have been developed during the EDA, offer several complementary services and are able to fulfil ITER operational requirements

ITER Construction--Plant System Integration

International Nuclear Information System (INIS)

Tada, E.; Matsuda, S.

2009-01-01

This brief paper introduces how the ITER will be built in the international collaboration. The ITER Organization plays a central role in constructing ITER and leading it into operation. Since most of the ITER components are to be provided in-kind from the member countries, integral project management should be scoped in advance of real work. Those include design, procurement, system assembly, testing, licensing and commissioning of ITER.

ITER definition phase

International Nuclear Information System (INIS)

1989-01-01

The International Thermonuclear Experimental Reactor (ITER) is envisioned as a fusion device which would demonstrate the scientific and technological feasibility of fusion power. As a first step towards achieving this goal, the European Community, Japan, the Soviet Union, and the United States of America have entered into joint conceptual design activities under the auspices of the International Atomic Energy Agency. A brief summary of the Definition Phase of ITER activities is contained in this report. Included in this report are the background, objectives, organization, definition phase activities, and research and development plan of this endeavor in international scientific collaboration. A more extended technical summary is contained in the two-volume report, ''ITER Concept Definition,'' IAEA/ITER/DS/3. 2 figs, 2 tabs

United States rejoin ITER

International Nuclear Information System (INIS)

Roberts, M.

2003-01-01

Upon pressure from the United States Congress, the US Department of Energy had to withdraw from further American participation in the ITER Engineering Design Activities after the end of its commitment to the EDA in July 1998. In the years since that time, changes have taken place in both the ITER activity and the US fusion community's position on burning plasma physics. Reflecting the interest in the United States in pursuing burning plasma physics, the DOE's Office of Science commissioned three studies as part of its examination of the option of entering the Negotiations on the Agreement on the Establishment of the International Fusion Energy Organization for the Joint Implementation of the ITER Project. These were a National Academy Review Panel Report supporting the burning plasma mission; a Fusion Energy Sciences Advisory Committee (FESAC) report confirming the role of ITER in achieving fusion power production, and The Lehman Review of the ITER project costing and project management processes (for the latter one, see ITER CTA Newsletter, no. 15, December 2002). All three studies have endorsed the US return to the ITER activities. This historical decision was announced by DOE Secretary Abraham during his remarks to employees of the Department's Princeton Plasma Physics Laboratory. The United States will be working with the other Participants in the ITER Negotiations on the Agreement and is preparing to participate in the ITA

Convergence Improvement of Response Matrix Method with Large Discontinuity Factors

International Nuclear Information System (INIS)

Yamamoto, Akio

2003-01-01

In the response matrix method, a numerical divergence problem has been reported when extremely small or large discontinuity factors are utilized in the calculations. In this paper, an alternative response matrix formulation to solve the divergence problem is discussed, and properties of iteration matrixes are investigated through eigenvalue analyses. In the conventional response matrix formulation, partial currents between adjacent nodes are assumed to be discontinuous, and outgoing partial currents are converted into incoming partial currents by the discontinuity factor matrix. Namely, the partial currents of the homogeneous system (i.e., homogeneous partial currents) are treated in the conventional response matrix formulation. In this approach, the spectral radius of an iteration matrix for the partial currents may exceed unity when an extremely small or large discontinuity factor is used. Contrary to this, an alternative response matrix formulation using heterogeneous partial currents is discussed in this paper. In the latter approach, partial currents are assumed to be continuous between adjacent nodes, and discontinuity factors are directly considered in the coefficients of a response matrix. From the eigenvalue analysis of the iteration matrix for the one-group, one-dimensional problem, the spectral radius for the heterogeneous partial current formulation does not exceed unity even if an extremely small or large discontinuity factor is used in the calculation; numerical stability of the alternative formulation is superior to the conventional one. The numerical stability of the heterogeneous partial current formulation is also confirmed by the two-dimensional light water reactor core analysis. Since the heterogeneous partial current formulation does not require any approximation, the converged solution exactly reproduces the reference solution when the discontinuity factors are directly derived from the reference calculation

ITER-FEAT operation

International Nuclear Information System (INIS)

Shimomura, Y.; Huguet, M.; Mizoguchi, T.; Murakami, Y.; Polevoi, A.R.; Shimada, M.; Aymar, R.; Chuyanov, V.A.; Matsumoto, H.

2001-01-01

ITER is planned to be the first fusion experimental reactor in the world operating for research in physics and engineering. The first ten years of operation will be devoted primarily to physics issues at low neutron fluence and the following ten years of operation to engineering testing at higher fluence. ITER can accommodate various plasma configurations and plasma operation modes, such as inductive high Q modes, long pulse hybrid modes and non-inductive steady state modes, with large ranges of plasma current, density, beta and fusion power, and with various heating and current drive methods. This flexibility will provide an advantage for coping with uncertainties in the physics database, in studying burning plasmas, in introducing advanced features and in optimizing the plasma performance for the different programme objectives. Remote sites will be able to participate in the ITER experiment. This concept will provide an advantage not only in operating ITER for 24 hours a day but also in involving the worldwide fusion community and in promoting scientific competition among the ITER Parties. (author)

Plasma scram in ITER L-mode ignited plasmas

International Nuclear Information System (INIS)

Villar Colome, J.; Johner, J.; Ane, J.M.

1995-01-01

The security of ITER will depend on the capability of the system in rapidly extinguishing the 1.5 GW of nominal fusion power without disruption. The local RLW transport model is used to simulate such a Plasma Scram. The conditions for a passively secure operation point in steady-state are discussed in terms of particle exhaust. The time scales of the process should determine the power supplies of both equilibrium coils and central solenoid. (authors). 6 refs., 4 figs., 2 tabs

ITER CTA newsletter. No. 2

International Nuclear Information System (INIS)

2001-10-01

This ITER CTA newsletter contains results of the ITER toroidal field model coil project presented by ITER EU Home Team (Garching) and an article in commemoration of the late Dr. Charles Maisonnier, one of the former leaders of ITER who made significant contributions to its development

Vertical displacement events: a serious concern in future ITER operation

International Nuclear Information System (INIS)

Hassanein, A.; Sizyuk, T.; Ulrickson, M.

2007-01-01

The strongly elongated plasma configuration in ITER-like devices is vertically unstable unless an active control feedback at the vertical position is applied. A malfunction of this feedback system for variety of reasons can lead to a rapid plasma vertical displacement at full plasma current. As the plasma contacts the top or bottom of the vacuum vessel, the current is rapidly forced to zero, similar to the behavior of the plasma after the thermal quench of a disruption. This phenomenon constitutes the vertical displacement events (VDE). This can result in melting and vaporization of the plasma-facing component (PFC) as well as melting of the copper substrate and burnout of the coolant channels. The upgraded HEIGHTS simulation package is used to simulate in full 3D the response of an entire ITER module response to a VDE. The initial temperature distribution of the PFC and the bulk substrate prior to the VDE is calculated according to steady state heat flux, module design, and initial coolant temperature. The models used in the upgraded HEIGHTS were recently benchmarked against VDE simulation experiments using powerful electron beam and show an excellent agreement with the data.The surface temperature can then be very high and could result in significant melting of substrate copper and damage the coolant channels. In the case of Be surface, surface vaporization is quite high and will remove most incoming plasma power at typical ITER VDE condition. Therefore, the transmitted heat flux to the substrate and the coolant channels are low enough to cause any significant damage. However, if tungsten is exposed to the VDE the situation is quite different. No significant surface vaporization will occur at the tungsten surface thus, leaving the majority of the incident plasma power to be conducted to the copper substrate causing melting at the interface and burnout of coolant channel with serious implications on the integrity and subsequent performance of this module. The

Emerging interdisciplinary fields in the coming intelligence/convergence era

Science.gov (United States)

Noor, Ahmed K.

2012-09-01

Dramatic advances are in the horizon resulting from rapid pace of development of several technologies, including, computing, communication, mobile, robotic, and interactive technologies. These advances, along with the trend towards convergence of traditional engineering disciplines with physical, life and other science disciplines will result in the development of new interdisciplinary fields, as well as in new paradigms for engineering practice in the coming intelligence/convergence era (post-information age). The interdisciplinary fields include Cyber Engineering, Living Systems Engineering, Biomechatronics/Robotics Engineering, Knowledge Engineering, Emergent/Complexity Engineering, and Multiscale Systems engineering. The paper identifies some of the characteristics of the intelligence/convergence era, gives broad definition of convergence, describes some of the emerging interdisciplinary fields, and lists some of the academic and other organizations working in these disciplines. The need is described for establishing a Hierarchical Cyber-Physical Ecosystem for facilitating interdisciplinary collaborations, and accelerating development of skilled workforce in the new fields. The major components of the ecosystem are listed. The new interdisciplinary fields will yield critical advances in engineering practice, and help in addressing future challenges in broad array of sectors, from manufacturing to energy, transportation, climate, and healthcare. They will also enable building large future complex adaptive systems-of-systems, such as intelligent multimodal transportation systems, optimized multi-energy systems, intelligent disaster prevention systems, and smart cities.

A fast iterative recursive least squares algorithm for Wiener model identification of highly nonlinear systems.

Science.gov (United States)

Kazemi, Mahdi; Arefi, Mohammad Mehdi

2017-03-01

In this paper, an online identification algorithm is presented for nonlinear systems in the presence of output colored noise. The proposed method is based on extended recursive least squares (ERLS) algorithm, where the identified system is in polynomial Wiener form. To this end, an unknown intermediate signal is estimated by using an inner iterative algorithm. The iterative recursive algorithm adaptively modifies the vector of parameters of the presented Wiener model when the system parameters vary. In addition, to increase the robustness of the proposed method against variations, a robust RLS algorithm is applied to the model. Simulation results are provided to show the effectiveness of the proposed approach. Results confirm that the proposed method has fast convergence rate with robust characteristics, which increases the efficiency of the proposed model and identification approach. For instance, the FIT criterion will be achieved 92% in CSTR process where about 400 data is used. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Novel Fourier-based iterative reconstruction for sparse fan projection using alternating direction total variation minimization

International Nuclear Information System (INIS)

Jin Zhao; Zhang Han-Ming; Yan Bin; Li Lei; Wang Lin-Yuan; Cai Ai-Long

2016-01-01

Sparse-view x-ray computed tomography (CT) imaging is an interesting topic in CT field and can efficiently decrease radiation dose. Compared with spatial reconstruction, a Fourier-based algorithm has advantages in reconstruction speed and memory usage. A novel Fourier-based iterative reconstruction technique that utilizes non-uniform fast Fourier transform (NUFFT) is presented in this work along with advanced total variation (TV) regularization for a fan sparse-view CT. The proposition of a selective matrix contributes to improve reconstruction quality. The new method employs the NUFFT and its adjoin to iterate back and forth between the Fourier and image space. The performance of the proposed algorithm is demonstrated through a series of digital simulations and experimental phantom studies. Results of the proposed algorithm are compared with those of existing TV-regularized techniques based on compressed sensing method, as well as basic algebraic reconstruction technique. Compared with the existing TV-regularized techniques, the proposed Fourier-based technique significantly improves convergence rate and reduces memory allocation, respectively. (paper)

Critical heat flux analysis and R and D for the design of the ITER divertor

International Nuclear Information System (INIS)

Raffray, A.R.; Chiocchio, S.; Merola, M.; Tivey, R.; Vieider, G.; Schlosser, J.; Driemeyer, D.; Escourbiac, F.; Grigoriev, S.; Youchison, D.

1999-01-01

The vertical target and dump target of the ITER divertor have to be designed for high heat fluxes (up to 20 MW/m 2 over ∼10 s). Accommodation of such high heat fluxes gives rise to several issues, including the critical heat flux (CHF) margin which is a key requirement influencing the choice of cooling channel geometry and coolant conditions. An R and D programme was evolved to address the overall CHF issue and to help focus the design. It involved participation of the four ITER home teams and has been very successful in substantially expanding the CHF data base for one-sided heating and in providing more accurate experimental measurements of pressure drop (and derived correlations) for these geometries. This paper describes the major R and D results and the design analysis performed in converging on a choice of reference configuration and parameters which resulted in a CHF margin of ∼1.4 or more for all divertor components. (orig.)

Research at ITER towards DEMO: Specific reactor diagnostic studies to be carried out on ITER

Energy Technology Data Exchange (ETDEWEB)

Krasilnikov, A. V.; Kaschuck, Y. A.; Vershkov, V. A.; Petrov, A. A.; Petrov, V. G.; Tugarinov, S. N. [Institution Project center ITER, Moscow (Russian Federation)

2014-08-21

In ITER diagnostics will operate in the very hard radiation environment of fusion reactor. Extensive technology studies are carried out during development of the ITER diagnostics and procedures of their calibration and remote handling. Results of these studies and practical application of the developed diagnostics on ITER will provide the direct input to DEMO diagnostic development. The list of DEMO measurement requirements and diagnostics will be determined during ITER experiments on the bases of ITER plasma physics results and success of particular diagnostic application in reactor-like ITER plasma. Majority of ITER diagnostic already passed the conceptual design phase and represent the state of the art in fusion plasma diagnostic development. The number of related to DEMO results of ITER diagnostic studies such as design and prototype manufacture of: neutron and γ–ray diagnostics, neutral particle analyzers, optical spectroscopy including first mirror protection and cleaning technics, reflectometry, refractometry, tritium retention measurements etc. are discussed.

Research at ITER towards DEMO: Specific reactor diagnostic studies to be carried out on ITER

Science.gov (United States)

Krasilnikov, A. V.; Kaschuck, Y. A.; Vershkov, V. A.; Petrov, A. A.; Petrov, V. G.; Tugarinov, S. N.

2014-08-01

In ITER diagnostics will operate in the very hard radiation environment of fusion reactor. Extensive technology studies are carried out during development of the ITER diagnostics and procedures of their calibration and remote handling. Results of these studies and practical application of the developed diagnostics on ITER will provide the direct input to DEMO diagnostic development. The list of DEMO measurement requirements and diagnostics will be determined during ITER experiments on the bases of ITER plasma physics results and success of particular diagnostic application in reactor-like ITER plasma. Majority of ITER diagnostic already passed the conceptual design phase and represent the state of the art in fusion plasma diagnostic development. The number of related to DEMO results of ITER diagnostic studies such as design and prototype manufacture of: neutron and γ-ray diagnostics, neutral particle analyzers, optical spectroscopy including first mirror protection and cleaning technics, reflectometry, refractometry, tritium retention measurements etc. are discussed.

Research at ITER towards DEMO: Specific reactor diagnostic studies to be carried out on ITER

International Nuclear Information System (INIS)

Krasilnikov, A. V.; Kaschuck, Y. A.; Vershkov, V. A.; Petrov, A. A.; Petrov, V. G.; Tugarinov, S. N.

2014-01-01

In ITER diagnostics will operate in the very hard radiation environment of fusion reactor. Extensive technology studies are carried out during development of the ITER diagnostics and procedures of their calibration and remote handling. Results of these studies and practical application of the developed diagnostics on ITER will provide the direct input to DEMO diagnostic development. The list of DEMO measurement requirements and diagnostics will be determined during ITER experiments on the bases of ITER plasma physics results and success of particular diagnostic application in reactor-like ITER plasma. Majority of ITER diagnostic already passed the conceptual design phase and represent the state of the art in fusion plasma diagnostic development. The number of related to DEMO results of ITER diagnostic studies such as design and prototype manufacture of: neutron and γ–ray diagnostics, neutral particle analyzers, optical spectroscopy including first mirror protection and cleaning technics, reflectometry, refractometry, tritium retention measurements etc. are discussed

Spirit and prospects of ITER

Energy Technology Data Exchange (ETDEWEB)

Velikhov, E.P. [Kurchatov Institute of Atomic Energy, Moscow (Russian Federation)

2002-10-01

ITER is the unique and the most straightforward way to study the burning plasma science in the nearest future. ITER has a firm physics ground based on the results from the world tokamaks in terms of confinement, stability, heating, current drive, divertor, energetic particle confinement to an extend required in ITER. The flexibility of ITER will allow the exploration of broad operation space of fusion power, beta, pulse length and Q values in various operational scenarios. Success of the engineering R and D programs has demonstrated that all party has an enough capability to produce all the necessary equipment in agreement with the specifications of ITER. The acquired knowledge and technologies in ITER project allow us to demonstrate the scientific and technical feasibility of a fusion reactor. It can be concluded that ITER must be constructed in the nearest future. (author)

Spirit and prospects of ITER

International Nuclear Information System (INIS)

Velikhov, E.P.

2002-01-01

ITER is the unique and the most straightforward way to study the burning plasma science in the nearest future. ITER has a firm physics ground based on the results from the world tokamaks in terms of confinement, stability, heating, current drive, divertor, energetic particle confinement to an extend required in ITER. The flexibility of ITER will allow the exploration of broad operation space of fusion power, beta, pulse length and Q values in various operational scenarios. Success of the engineering R and D programs has demonstrated that all party has an enough capability to produce all the necessary equipment in agreement with the specifications of ITER. The acquired knowledge and technologies in ITER project allow us to demonstrate the scientific and technical feasibility of a fusion reactor. It can be concluded that ITER must be constructed in the nearest future. (author)

ITER interim design report package documents

International Nuclear Information System (INIS)

1996-01-01

This publication contains the Excerpt from the ITER Council (IC-8), the ITER Interim Design Report, Cost Review and Safety Analysis, ITER Site Requirements and ITER Site Design Assumptions and the Excerpt from the ITER Council (IC-9). 8 figs, 2 tabs

ITER CTA newsletter. No. 6

International Nuclear Information System (INIS)

2002-01-01

This ITER CTA Newsletter issue comprises information about the following ITER Meetings: The second negotiation meeting on the joint implementation of ITER, held in Tokyo(Japan) on 22-23 January 2002, and an international ITER symposium on burning plasma science and technology, held the day later after the second negotiation meeting at the same place

Trophic convergence drives morphological convergence in marine tetrapods.

Science.gov (United States)

Kelley, Neil P; Motani, Ryosuke

2015-01-01

Marine tetrapod clades (e.g. seals, whales) independently adapted to marine life through the Mesozoic and Caenozoic, and provide iconic examples of convergent evolution. Apparent morphological convergence is often explained as the result of adaptation to similar ecological niches. However, quantitative tests of this hypothesis are uncommon. We use dietary data to classify the feeding ecology of extant marine tetrapods and identify patterns in skull and tooth morphology that discriminate trophic groups across clades. Mapping these patterns onto phylogeny reveals coordinated evolutionary shifts in diet and morphology in different marine tetrapod lineages. Similarities in morphology between species with similar diets-even across large phylogenetic distances-are consistent with previous hypotheses that shared functional constraints drive convergent evolution in marine tetrapods.

Convergence in Multispecies Interactions.

Science.gov (United States)

Bittleston, Leonora S; Pierce, Naomi E; Ellison, Aaron M; Pringle, Anne

2016-04-01

The concepts of convergent evolution and community convergence highlight how selective pressures can shape unrelated organisms or communities in similar ways. We propose a related concept, convergent interactions, to describe the independent evolution of multispecies interactions with similar physiological or ecological functions. A focus on convergent interactions clarifies how natural selection repeatedly favors particular kinds of associations among species. Characterizing convergent interactions in a comparative context is likely to facilitate prediction of the ecological roles of organisms (including microbes) in multispecies interactions and selective pressures acting in poorly understood or newly discovered multispecies systems. We illustrate the concept of convergent interactions with examples: vertebrates and their gut bacteria; ectomycorrhizae; insect-fungal-bacterial interactions; pitcher-plant food webs; and ants and ant-plants. Copyright © 2016 Elsevier Ltd. All rights reserved.

ITER council proceedings: 1999

International Nuclear Information System (INIS)

1999-01-01

In 1999 the ITER meeting in Cadarache (10-11 March 1999) and the Programme Directors Meeting in Grenoble (28-29 July 1999) took place. Both meetings were exclusively devoted to ITER engineering design activities and their agendas covered all issues important for the development of ITER. This volume presents the documents of these two important meetings

ITER EDA technical activities

International Nuclear Information System (INIS)

Aymar, R.

1998-01-01

Six years of technical work under the ITER EDA Agreement have resulted in a design which constitutes a complete description of the ITER device and of its auxiliary systems and facilities. The ITER Council commented that the Final Design Report provides the first comprehensive design of a fusion reactor based on well established physics and technology

Sparse Adaptive Iteratively-Weighted Thresholding Algorithm (SAITA for L p -Regularization Using the Multiple Sub-Dictionary Representation

Directory of Open Access Journals (Sweden)

Yunyi Li

2017-12-01

Full Text Available Both L 1 / 2 and L 2 / 3 are two typical non-convex regularizations of L p ( 0 < p < 1 , which can be employed to obtain a sparser solution than the L 1 regularization. Recently, the multiple-state sparse transformation strategy has been developed to exploit the sparsity in L 1 regularization for sparse signal recovery, which combines the iterative reweighted algorithms. To further exploit the sparse structure of signal and image, this paper adopts multiple dictionary sparse transform strategies for the two typical cases p ∈ { 1 / 2 ,   2 / 3 } based on an iterative L p thresholding algorithm and then proposes a sparse adaptive iterative-weighted L p thresholding algorithm (SAITA. Moreover, a simple yet effective regularization parameter is proposed to weight each sub-dictionary-based L p regularizer. Simulation results have shown that the proposed SAITA not only performs better than the corresponding L 1 algorithms but can also obtain a better recovery performance and achieve faster convergence than the conventional single-dictionary sparse transform-based L p case. Moreover, we conduct some applications about sparse image recovery and obtain good results by comparison with relative work.

Multiple Revolution Solutions for the Perturbed Lambert Problem using the Method of Particular Solutions and Picard Iteration

Science.gov (United States)

Woollands, Robyn M.; Read, Julie L.; Probe, Austin B.; Junkins, John L.

2017-12-01

We present a new method for solving the multiple revolution perturbed Lambert problem using the method of particular solutions and modified Chebyshev-Picard iteration. The method of particular solutions differs from the well-known Newton-shooting method in that integration of the state transition matrix (36 additional differential equations) is not required, and instead it makes use of a reference trajectory and a set of n particular solutions. Any numerical integrator can be used for solving two-point boundary problems with the method of particular solutions, however we show that using modified Chebyshev-Picard iteration affords an avenue for increased efficiency that is not available with other step-by-step integrators. We take advantage of the path approximation nature of modified Chebyshev-Picard iteration (nodes iteratively converge to fixed points in space) and utilize a variable fidelity force model for propagating the reference trajectory. Remarkably, we demonstrate that computing the particular solutions with only low fidelity function evaluations greatly increases the efficiency of the algorithm while maintaining machine precision accuracy. Our study reveals that solving the perturbed Lambert's problem using the method of particular solutions with modified Chebyshev-Picard iteration is about an order of magnitude faster compared with the classical shooting method and a tenth-twelfth order Runge-Kutta integrator. It is well known that the solution to Lambert's problem over multiple revolutions is not unique and to ensure that all possible solutions are considered we make use of a reliable preexisting Keplerian Lambert solver to warm start our perturbed algorithm.

Response matrix properties and convergence implications for an interface-current nodal formulation

International Nuclear Information System (INIS)

Yang, W.S.

1995-01-01

An analytic study was performed of the properties and the associated convergence implications of the response matrix equations derived via the widely used nodal expansion method. By using the DIF3D nodal formulation in hexagonal-z geometry as a concrete example, an analytic expression for the response matrix is first derived by using the hexagonal prism symmetry transformations. The spectral radius of the local response matrix is shown to be always 2 -norm of the response matrix is shown to be ∞ -norm is not always 2 - and l ∞ -norms of the response matrix are found to increase as the removal cross section decreases. On the other hand, for a given removal cross section, each of these matrix norms takes its minimum at a certain diffusion coefficient and increases as the diffusion coefficient deviates from this value. Based on these matrix norms, sufficient conditions for the convergence of the iteration schemes for solving the response matrix equations are discussed. The range of node-height-to-hexagon-pitch ratios that guarantees a positive solution is derived as a function of the diffusion coefficient and the removal cross section

Iterative solution for nonlinear integral equations of Hammerstein type