WorldWideScience

Sample records for asymptotic iteration method

  1. A connection between the asymptotic iteration method and the continued fractions formalism

    International Nuclear Information System (INIS)

    Matamala, A.R.; Gutierrez, F.A.; Diaz-Valdes, J.

    2007-01-01

    In this work, we show that there is a connection between the asymptotic iteration method (a method to solve second order linear ordinary differential equations) and the older method of continued fractions to solve differential equations

  2. 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.

  3. Bender-Dunne Orthogonal Polynomials, Quasi-Exact Solvability and Asymptotic Iteration Method for Rabi Hamiltonian

    International Nuclear Information System (INIS)

    Yahiaoui, S.-A.; Bentaiba, M.

    2011-01-01

    We present a method for obtaining the quasi-exact solutions of the Rabi Hamiltonian in the framework of the asymptotic iteration method (AIM). The energy eigenvalues, the eigenfunctions and the associated Bender-Dunne orthogonal polynomials are deduced. We show (i) that orthogonal polynomials are generated from the upper limit (i.e., truncation limit) of polynomial solutions deduced from AIM, and (ii) prove to have nonpositive norm. (authors)

  4. Asymptotic iteration method solutions to the d-dimensional Schroedinger equation with position-dependent mass

    International Nuclear Information System (INIS)

    Yasuk, F.; Tekin, S.; Boztosun, I.

    2010-01-01

    In this study, the exact solutions of the d-dimensional Schroedinger equation with a position-dependent mass m(r)=1/(1+ζ 2 r 2 ) is presented for a free particle, V(r)=0, by using the method of point canonical transformations. The energy eigenvalues and corresponding wavefunctions for the effective potential which is to be a generalized Poeschl-Teller potential are obtained within the framework of the asymptotic iteration method.

  5. Solution of Dirac equation for Eckart potential and trigonometric Manning Rosen potential using asymptotic iteration method

    International Nuclear Information System (INIS)

    Arum Sari, Resita; Suparmi, A; Cari, C

    2016-01-01

    The Dirac equation for Eckart potential and trigonometric Manning Rosen potential with exact spin symmetry is obtained using an asymptotic iteration method. The combination of the two potentials is substituted into the Dirac equation, then the variables are separated into radial and angular parts. The Dirac equation is solved by using an asymptotic iteration method that can reduce the second order differential equation into a differential equation with substitution variables of hypergeometry type. The relativistic energy is calculated using Matlab 2011. This study is limited to the case of spin symmetry. With the asymptotic iteration method, the energy spectra of the relativistic equations and equations of orbital quantum number l can be obtained, where both are interrelated between quantum numbers. The energy spectrum is also numerically solved using the Matlab software, where the increase in the radial quantum number n r causes the energy to decrease. The radial part and the angular part of the wave function are defined as hypergeometry functions and visualized with Matlab 2011. The results show that the disturbance of a combination of the Eckart potential and trigonometric Manning Rosen potential can change the radial part and the angular part of the wave function. (paper)

  6. On iterative procedures of asymptotic inference

    NARCIS (Netherlands)

    K.O. Dzhaparidze (Kacha)

    1983-01-01

    textabstractAbstract  An informal discussion is given on performing an unconstrained maximization or solving non‐linear equations of statistics by iterative methods with the quadratic termination property. It is shown that if a miximized function, e.g. likelihood, is asymptotically quadratic, then

  7. Analytical Investigation of Beam Deformation Equation using Perturbation, Homotopy Perturbation, Variational Iteration and Optimal Homotopy Asymptotic Methods

    DEFF Research Database (Denmark)

    Farrokhzad, F.; Mowlaee, P.; Barari, Amin

    2011-01-01

    The beam deformation equation has very wide applications in structural engineering. As a differential equation, it has its own problem concerning existence, uniqueness and methods of solutions. Often, original forms of governing differential equations used in engineering problems are simplified...... Method (OHAM). The comparisons of the results reveal that these methods are very effective, convenient and quite accurate to systems of non-linear differential equation......., and this process produces noise in the obtained answers. This paper deals with solution of second order of differential equation governing beam deformation using four analytical approximate methods, namely the Homotopy Perturbation Method (HPM), Variational Iteration Method (VIM) and Optimal Homotopy Asymptotic...

  8. Introducing a new family of short-range potentials and their numerical solutions using the asymptotic iteration method

    Science.gov (United States)

    Assi, I. A.; Sous, A. J.

    2018-05-01

    The goal of this work is to derive a new class of short-range potentials that could have a wide range of physical applications, specially in molecular physics. The tridiagonal representation approach has been developed beyond its limitations to produce new potentials by requiring the representation of the Schrödinger wave operator to be multidiagonal and symmetric. This produces a family of Hulthén potentials that has a specific structure, as mentioned in the introduction. As an example, we have solved the nonrelativistic wave equation for the new four-parameter short-range screening potential numerically using the asymptotic iteration method, where we tabulated the eigenvalues for both s -wave and arbitrary l -wave cases in tables.

  9. Relativistic Energy Analysis of Five-Dimensional q-Deformed Radial Rosen-Morse Potential Combined with q-Deformed Trigonometric Scarf Noncentral Potential Using Asymptotic Iteration Method

    International Nuclear Information System (INIS)

    Pramono, Subur; Suparmi, A.; Cari, Cari

    2016-01-01

    We study the exact solution of Dirac equation in the hyperspherical coordinate under influence of separable q-deformed quantum potentials. The q-deformed hyperbolic Rosen-Morse potential is perturbed by q-deformed noncentral trigonometric Scarf potentials, where all of them can be solved by using Asymptotic Iteration Method (AIM). This work is limited to spin symmetry case. The relativistic energy equation and orbital quantum number equation l_D_-_1 have been obtained using Asymptotic Iteration Method. The upper radial wave function equations and angular wave function equations are also obtained by using this method. The relativistic energy levels are numerically calculated using Matlab, and the increase of radial quantum number n causes the increase of bound state relativistic energy level in both dimensions D=5 and D=3. The bound state relativistic energy level decreases with increasing of both deformation parameter q and orbital quantum number n_l.

  10. Asymptotic convergence for iterative optimization in electronic structure

    International Nuclear Information System (INIS)

    Lippert, Ross A.; Sears, Mark P.

    2000-01-01

    There have recently been a number of proposals for solving large electronic structure problems (local-density approximation, Hartree-Fock, and tight-binding methods) iteratively with a computational effort proportional to the size of the system. The effort needed to perform a single iteration in these schemes is well understood but the convergence rate has been an empirical matter. This paper will show that many of the proposed methods have a single underlying geometrical structure, which has a specific asymptotic convergence behavior, and that behavior can be understood in terms of some simple condition numbers based on the spectrum of the Hamiltonian. (c) 2000 The American Physical Society

  11. Analysis of D Dimensional Dirac equation for q -deformed Posch-Teller combined with q -deformed trigonometric Manning Rosen Non-Central potential using Asymptotic Iteration Method (AIM)

    International Nuclear Information System (INIS)

    Alam, Y.; Suparmi; Cari; Anwar, F.

    2016-01-01

    In this study, we used asymptotic iteration method (AIM) to obtain the relativistic energy spectra and wavefunctions for D Dimensional Dirac equation. Solution of the D Dimensional Dirac equation using asymptotic iteration method was done by four steps. The first step, we substitutied q deformed Poschl-Teller potential plus q-deformed Manning Rosen Non-Central potential into D dimensional Dirac equation. And then, general term of D dimensioanl Dirac equation for q deformed Poschl-Teller potential plus q-deformed Manning Rosen Non-Central potential was reduced into one dimensioanal Dirac equation, consist of radial part and angular part. The second step, both of one dimensional part must be reduced to hypergeometric type differential equation by suitable parameter change. And then, hypergeometric type differential equation was transformed into AIM type differential equation. For the last step, AIM type differential equation can be solved to obtain the relativistic energy and wavefunctions of Dirac equation. Relativistic energy and wavefunctions were visualized by using Matlab software. (paper)

  12. 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

  13. High frequency asymptotic methods

    International Nuclear Information System (INIS)

    Bouche, D.; Dessarce, R.; Gay, J.; Vermersch, S.

    1991-01-01

    The asymptotic methods allow us to compute the interaction of high frequency electromagnetic waves with structures. After an outline of their foundations with emphasis on the geometrical theory of diffraction, it is shown how to use these methods to evaluate the radar cross section (RCS) of complex tri-dimensional objects of great size compared to the wave-length. The different stages in simulating phenomena which contribute to the RCS are reviewed: physical theory of diffraction, multiple interactions computed by shooting rays, research for creeping rays. (author). 7 refs., 6 figs., 3 insets

  14. Approximate analytical solution of the Dirac equation for pseudospin symmetry with modified Po schl-Teller potential and trigonometric Scarf II non-central potential using asymptotic iteration method

    International Nuclear Information System (INIS)

    Pratiwi, B N; Suparmi, A; Cari, C; Yunianto, M; Husein, A S

    2016-01-01

    We apllied asymptotic iteration method (AIM) to obtain the analytical solution of the Dirac equation in case exact pseudospin symmetry in the presence of modified Pcischl- Teller potential and trigonometric Scarf II non-central potential. The Dirac equation was solved by variables separation into one dimensional Dirac equation, the radial part and angular part equation. The radial and angular part equation can be reduced into hypergeometric type equation by variable substitution and wavefunction substitution and then transform it into AIM type equation to obtain relativistic energy eigenvalue and wavefunctions. Relativistic energy was calculated numerically by Matlab software. And then relativistic energy spectrum and wavefunctions were visualized by Matlab software. The results show that the increase in the radial quantum number n_r causes decrease in the relativistic energy spectrum. The negative value of energy is taken due to the pseudospin symmetry limit. Several quantum wavefunctions were presented in terms of the hypergeometric functions. (paper)

  15. 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.

  16. A method for summing nonalternating asymptotic series

    International Nuclear Information System (INIS)

    Kazakov, D.I.

    1980-01-01

    A method for reconstructing a function from its nonalternating asymptotic series is proposed. It can also be applied when only a limited number of coefficients and their high order asymptotic behaviour are known. The method is illustrated by examples of the ordinary simple integral simulating a functional integral in a theory with degenerate minimum and of the double-well unharmonic oscillator

  17. Conformable variational iteration method

    Directory of Open Access Journals (Sweden)

    Omer Acan

    2017-02-01

    Full Text Available In this study, we introduce the conformable variational iteration method based on new defined fractional derivative called conformable fractional derivative. This new method is applied two fractional order ordinary differential equations. To see how the solutions of this method, linear homogeneous and non-linear non-homogeneous fractional ordinary differential equations are selected. Obtained results are compared the exact solutions and their graphics are plotted to demonstrate efficiency and accuracy of the method.

  18. Asymptotic Expansions - Methods and Applications

    International Nuclear Information System (INIS)

    Harlander, R.

    1999-01-01

    Different viewpoints on the asymptotic expansion of Feynman diagrams are reviewed. The relations between the field theoretic and diagrammatic approaches are sketched. The focus is on problems with large masses or large external momenta. Several recent applications also for other limiting cases are touched upon. Finally, the pros and cons of the different approaches are briefly discussed. (author)

  19. Large Deviations and Asymptotic Methods in Finance

    CERN Document Server

    Gatheral, Jim; Gulisashvili, Archil; Jacquier, Antoine; Teichmann, Josef

    2015-01-01

    Topics covered in this volume (large deviations, differential geometry, asymptotic expansions, central limit theorems) give a full picture of the current advances in the application of asymptotic methods in mathematical finance, and thereby provide rigorous solutions to important mathematical and financial issues, such as implied volatility asymptotics, local volatility extrapolation, systemic risk and volatility estimation. This volume gathers together ground-breaking results in this field by some of its leading experts. Over the past decade, asymptotic methods have played an increasingly important role in the study of the behaviour of (financial) models. These methods provide a useful alternative to numerical methods in settings where the latter may lose accuracy (in extremes such as small and large strikes, and small maturities), and lead to a clearer understanding of the behaviour of models, and of the influence of parameters on this behaviour. Graduate students, researchers and practitioners will find th...

  20. The asymptotic expansion method via symbolic computation

    OpenAIRE

    Navarro, Juan F.

    2012-01-01

    This paper describes an algorithm for implementing a perturbation method based on an asymptotic expansion of the solution to a second-order differential equation. We also introduce a new symbolic computation system which works with the so-called modified quasipolynomials, as well as an implementation of the algorithm on it.

  1. The Asymptotic Expansion Method via Symbolic Computation

    Directory of Open Access Journals (Sweden)

    Juan F. Navarro

    2012-01-01

    Full Text Available This paper describes an algorithm for implementing a perturbation method based on an asymptotic expansion of the solution to a second-order differential equation. We also introduce a new symbolic computation system which works with the so-called modified quasipolynomials, as well as an implementation of the algorithm on it.

  2. 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

  3. Iterative method for Amado's model

    International Nuclear Information System (INIS)

    Tomio, L.

    1980-01-01

    A recently proposed iterative method for solving scattering integral equations is applied to the spin doublet and spin quartet neutron-deuteron scattering in the Amado model. The method is tested numerically in the calculation of scattering lengths and phase-shifts and results are found better than those obtained by using the conventional Pade technique. (Author) [pt

  4. Quantum defect theory and asymptotic methods

    International Nuclear Information System (INIS)

    Seaton, M.J.

    1982-01-01

    It is shown that quantum defect theory provides a basis for the development of various analytical methods for the examination of electron-ion collision phenomena, including di-electronic recombination. Its use in conjuction with ab initio calculations is shown to be restricted by problems which arise from the presence of long-range non-Coulomb potentials. Empirical fitting to some formulae can be efficient in the use of computer time but extravagant in the use of person time. Calculations at a large number of energy points which make no use of analytical formulae for resonance structures may be made less extravagant in computer time by the development of more efficient asymptotic methods. (U.K.)

  5. Asymptotic methods in mechanics of solids

    CERN Document Server

    Bauer, Svetlana M; Smirnov, Andrei L; Tovstik, Petr E; Vaillancourt, Rémi

    2015-01-01

    The construction of solutions of singularly perturbed systems of equations and boundary value problems that are characteristic for the mechanics of thin-walled structures are the main focus of the book. The theoretical results are supplemented by the analysis of problems and exercises. Some of the topics are rarely discussed in the textbooks, for example, the Newton polyhedron, which is a generalization of the Newton polygon for equations with two or more parameters. After introducing the important concept of the index of variation for functions special attention is devoted to eigenvalue problems containing a small parameter. The main part of the book deals with methods of asymptotic solutions of linear singularly perturbed boundary and boundary value problems without or with turning points, respectively. As examples, one-dimensional equilibrium, dynamics and stability problems for rigid bodies and solids are presented in detail. Numerous exercises and examples as well as vast references to the relevant Russi...

  6. The danger of iteration methods

    International Nuclear Information System (INIS)

    Villain, J.; Semeria, B.

    1983-01-01

    When a Hamiltonian H depends on variables phisub(i), the values of these variables which minimize H satisfy the equations deltaH/deltaphisub(i) = O. If this set of equations is solved by iteration, there is no guarantee that the solution is the one which minimizes H. In the case of a harmonic system with a random potential periodic with respect to the phisub(i)'s, the fluctuations have been calculated by Efetov and Larkin by means of the iteration method. The result is wrong in the case of a strong disorder. Even in the weak disorder case, it is wrong for a one-dimensional system and for a finite system of 2 particles. It is argued that the results obtained by iteration are always wrong, and that between 2 and 4 dimensions, spin-pair correlation functions decay like powers of the distance, as found by Aharony and Pytte for another model

  7. 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

  8. New methods of testing nonlinear hypothesis using iterative NLLS estimator

    Science.gov (United States)

    Mahaboob, B.; Venkateswarlu, B.; Mokeshrayalu, G.; Balasiddamuni, P.

    2017-11-01

    This research paper discusses the method of testing nonlinear hypothesis using iterative Nonlinear Least Squares (NLLS) estimator. Takeshi Amemiya [1] explained this method. However in the present research paper, a modified Wald test statistic due to Engle, Robert [6] is proposed to test the nonlinear hypothesis using iterative NLLS estimator. An alternative method for testing nonlinear hypothesis using iterative NLLS estimator based on nonlinear hypothesis using iterative NLLS estimator based on nonlinear studentized residuals has been proposed. In this research article an innovative method of testing nonlinear hypothesis using iterative restricted NLLS estimator is derived. Pesaran and Deaton [10] explained the methods of testing nonlinear hypothesis. This paper uses asymptotic properties of nonlinear least squares estimator proposed by Jenrich [8]. The main purpose of this paper is to provide very innovative methods of testing nonlinear hypothesis using iterative NLLS estimator, iterative NLLS estimator based on nonlinear studentized residuals and iterative restricted NLLS estimator. Eakambaram et al. [12] discussed least absolute deviation estimations versus nonlinear regression model with heteroscedastic errors and also they studied the problem of heteroscedasticity with reference to nonlinear regression models with suitable illustration. William Grene [13] examined the interaction effect in nonlinear models disused by Ai and Norton [14] and suggested ways to examine the effects that do not involve statistical testing. Peter [15] provided guidelines for identifying composite hypothesis and addressing the probability of false rejection for multiple hypotheses.

  9. Colorado Conference on iterative methods. Volume 1

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1994-12-31

    The conference provided a forum on many aspects of iterative methods. Volume I topics were:Session: domain decomposition, nonlinear problems, integral equations and inverse problems, eigenvalue problems, iterative software kernels. Volume II presents nonsymmetric solvers, parallel computation, theory of iterative methods, software and programming environment, ODE solvers, multigrid and multilevel methods, applications, robust iterative methods, preconditioners, Toeplitz and circulation solvers, and saddle point problems. Individual papers are indexed separately on the EDB.

  10. Electromagnetic simulations of JET ICRF ITER-like antenna with TOPICA and SSWICH asymptotic codes

    Directory of Open Access Journals (Sweden)

    Křivská Alena

    2017-01-01

    Full Text Available Multi-megawatt Ion Cyclotron Range of Frequencies (ICRF heating is routinely used in the JET tokamak. To increase the ICRF heating power available from the A2 antennas, the ICRF ITER-Like Antenna (ILA was reinstalled for the 2015 JET ITER-like wall experimental campaign. The application of high levels of ICRF power typically results in increased plasma wall interaction which leads to the observation of enhanced influx of metallic impurities in the plasma edge. It is assumed that the impurity production is mainly driven by the parallel component of the Radio-Frequency (RF antenna electric near-field, E// (parallel to the confinement magnetic field of the tokamak, that is rectified in a thin boundary layer (RF sheath. Torino Polytechnic Ion Cyclotron Antenna (TOPICA code was used to compute E// field maps in front of the ILA and between its poloidal limiters in the presence of plasma using measured density profiles and various antenna feedings. E// field maps calculated between the poloidal limiters were used to estimate the poloidal distribution of RF-sheath Direct Current (DC potential in this private region of the ILA and make relative comparison of various antenna electrical settings. For this purpose we used the asymptotic version of the Self-consistent Sheaths and Waves for Ion Cyclotron Heating Slow-Wave (SSWICH-SW code. These estimations can help to study the formation of RF sheaths around the antenna and even at distant locations (∼3m away.

  11. 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.

  12. Robust methods and asymptotic theory in nonlinear econometrics

    CERN Document Server

    Bierens, Herman J

    1981-01-01

    This Lecture Note deals with asymptotic properties, i.e. weak and strong consistency and asymptotic normality, of parameter estimators of nonlinear regression models and nonlinear structural equations under various assumptions on the distribution of the data. The estimation methods involved are nonlinear least squares estimation (NLLSE), nonlinear robust M-estimation (NLRME) and non­ linear weighted robust M-estimation (NLWRME) for the regression case and nonlinear two-stage least squares estimation (NL2SLSE) and a new method called minimum information estimation (MIE) for the case of structural equations. The asymptotic properties of the NLLSE and the two robust M-estimation methods are derived from further elaborations of results of Jennrich. Special attention is payed to the comparison of the asymptotic efficiency of NLLSE and NLRME. It is shown that if the tails of the error distribution are fatter than those of the normal distribution NLRME is more efficient than NLLSE. The NLWRME method is appropriate ...

  13. Methods in half-linear asymptotic theory

    Directory of Open Access Journals (Sweden)

    Pavel Rehak

    2016-10-01

    Full Text Available We study the asymptotic behavior of eventually positive solutions of the second-order half-linear differential equation $$ (r(t|y'|^{\\alpha-1}\\hbox{sgn} y''=p(t|y|^{\\alpha-1}\\hbox{sgn} y, $$ where r(t and p(t are positive continuous functions on $[a,\\infty$, $\\alpha\\in(1,\\infty$. The aim of this article is twofold. On the one hand, we show applications of a wide variety of tools, like the Karamata theory of regular variation, the de Haan theory, the Riccati technique, comparison theorems, the reciprocity principle, a certain transformation of dependent variable, and principal solutions. On the other hand, we solve open problems posed in the literature and generalize existing results. Most of our observations are new also in the linear case.

  14. Iterative Splitting Methods for Differential Equations

    CERN Document Server

    Geiser, Juergen

    2011-01-01

    Iterative Splitting Methods for Differential Equations explains how to solve evolution equations via novel iterative-based splitting methods that efficiently use computational and memory resources. It focuses on systems of parabolic and hyperbolic equations, including convection-diffusion-reaction equations, heat equations, and wave equations. In the theoretical part of the book, the author discusses the main theorems and results of the stability and consistency analysis for ordinary differential equations. He then presents extensions of the iterative splitting methods to partial differential

  15. New concurrent iterative methods with monotonic convergence

    Energy Technology Data Exchange (ETDEWEB)

    Yao, Qingchuan [Michigan State Univ., East Lansing, MI (United States)

    1996-12-31

    This paper proposes the new concurrent iterative methods without using any derivatives for finding all zeros of polynomials simultaneously. The new methods are of monotonic convergence for both simple and multiple real-zeros of polynomials and are quadratically convergent. The corresponding accelerated concurrent iterative methods are obtained too. The new methods are good candidates for the application in solving symmetric eigenproblems.

  16. Iterative Brinkman penalization for remeshed vortex methods

    DEFF Research Database (Denmark)

    Hejlesen, Mads Mølholm; Koumoutsakos, Petros; Leonard, Anthony

    2015-01-01

    We introduce an iterative Brinkman penalization method for the enforcement of the no-slip boundary condition in remeshed vortex methods. In the proposed method, the Brinkman penalization is applied iteratively only in the neighborhood of the body. This allows for using significantly larger time...

  17. 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

  18. 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.

  19. Selected asymptotic methods with applications to electromagnetics and antennas

    CERN Document Server

    Fikioris, George; Bakas, Odysseas N

    2013-01-01

    This book describes and illustrates the application of several asymptotic methods that have proved useful in the authors' research in electromagnetics and antennas. We first define asymptotic approximations and expansions and explain these concepts in detail. We then develop certain prerequisites from complex analysis such as power series, multivalued functions (including the concepts of branch points and branch cuts), and the all-important gamma function. Of particular importance is the idea of analytic continuation (of functions of a single complex variable); our discussions here include som

  20. Application of the optimal homotopy asymptotic method to nonlinear Bingham fluid dampers

    Directory of Open Access Journals (Sweden)

    Marinca Vasile

    2017-10-01

    Full Text Available Dynamic response time is an important feature for determining the performance of magnetorheological (MR dampers in practical civil engineering applications. The objective of this paper is to show how to use the Optimal Homotopy Asymptotic Method (OHAM to give approximate analytical solutions of the nonlinear differential equation of a modified Bingham model with non-viscous exponential damping. Our procedure does not depend upon small parameters and provides us with a convenient way to optimally control the convergence of the approximate solutions. OHAM is very efficient in practice for ensuring very rapid convergence of the solution after only one iteration and with a small number of steps.

  1. Application of the optimal homotopy asymptotic method to nonlinear Bingham fluid dampers

    Science.gov (United States)

    Marinca, Vasile; Ene, Remus-Daniel; Bereteu, Liviu

    2017-10-01

    Dynamic response time is an important feature for determining the performance of magnetorheological (MR) dampers in practical civil engineering applications. The objective of this paper is to show how to use the Optimal Homotopy Asymptotic Method (OHAM) to give approximate analytical solutions of the nonlinear differential equation of a modified Bingham model with non-viscous exponential damping. Our procedure does not depend upon small parameters and provides us with a convenient way to optimally control the convergence of the approximate solutions. OHAM is very efficient in practice for ensuring very rapid convergence of the solution after only one iteration and with a small number of steps.

  2. An Extension of the Optimal Homotopy Asymptotic Method to Coupled Schrödinger-KdV Equation

    Directory of Open Access Journals (Sweden)

    Hakeem Ullah

    2014-01-01

    Full Text Available We consider the approximate solution of the coupled Schrödinger-KdV equation by using the extended optimal homotopy asymptotic method (OHAM. We obtained the extended OHAM solution of the problem and compared with the exact, variational iteration method (VIM and homotopy perturbation method (HPM solutions. The obtained solution shows that extended OHAM is effective, simpler, easier, and explicit and gives a suitable way to control the convergence of the approximate solution.

  3. 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...

  4. On Strong Convergence by the Hybrid Method for Equilibrium and Fixed Point Problems for an Inifnite Family of Asymptotically Nonexpansive Mappings

    Directory of Open Access Journals (Sweden)

    Cai Gang

    2009-01-01

    Full Text Available We introduce two modifications of the Mann iteration, by using the hybrid methods, for equilibrium and fixed point problems for an infinite family of asymptotically nonexpansive mappings in a Hilbert space. Then, we prove that such two sequences converge strongly to a common element of the set of solutions of an equilibrium problem and the set of common fixed points of an infinite family of asymptotically nonexpansive mappings. Our results improve and extend the results announced by many others.

  5. On varitional iteration method for fractional calculus

    Directory of Open Access Journals (Sweden)

    Wu Hai-Gen

    2017-01-01

    Full Text Available Modification of the Das’ variational iteration method for fractional differential equations is discussed, and its main shortcoming involved in the solution process is pointed out and overcome by using fractional power series. The suggested computational procedure is simple and reliable for fractional calculus.

  6. 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.

  7. Preconditioning of iterative methods - theory and applications

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Blaheta, Radim; Neytcheva, M.; Pultarová, I.

    2015-01-01

    Roč. 22, č. 6 (2015), s. 901-902 ISSN 1070-5325 Institutional support: RVO:68145535 Keywords : preconditioning * iterative methods * applications Subject RIV: BA - General Mathematics Impact factor: 1.431, year: 2015 http://onlinelibrary.wiley.com/doi/10.1002/nla.2016/epdf

  8. Application of the Asymptotic Taylor Expansion Method to Bistable Potentials

    Directory of Open Access Journals (Sweden)

    Okan Ozer

    2013-01-01

    Full Text Available A recent method called asymptotic Taylor expansion (ATEM is applied to determine the analytical expression for eigenfunctions and numerical results for eigenvalues of the Schrödinger equation for the bistable potentials. Optimal truncation of the Taylor series gives a best possible analytical expression for eigenfunctions and numerical results for eigenvalues. It is shown that the results are obtained by a simple algorithm constructed for a computer system using symbolic or numerical calculation. It is observed that ATEM produces excellent results consistent with the existing literature.

  9. 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.

  10. Iterative Regularization with Minimum-Residual Methods

    DEFF Research Database (Denmark)

    Jensen, Toke Koldborg; Hansen, Per Christian

    2007-01-01

    subspaces. We provide a combination of theory and numerical examples, and our analysis confirms the experience that MINRES and MR-II can work as general regularization methods. We also demonstrate theoretically and experimentally that the same is not true, in general, for GMRES and RRGMRES their success......We study the regularization properties of iterative minimum-residual methods applied to discrete ill-posed problems. In these methods, the projection onto the underlying Krylov subspace acts as a regularizer, and the emphasis of this work is on the role played by the basis vectors of these Krylov...... as regularization methods is highly problem dependent....

  11. Iterative regularization with minimum-residual methods

    DEFF Research Database (Denmark)

    Jensen, Toke Koldborg; Hansen, Per Christian

    2006-01-01

    subspaces. We provide a combination of theory and numerical examples, and our analysis confirms the experience that MINRES and MR-II can work as general regularization methods. We also demonstrate theoretically and experimentally that the same is not true, in general, for GMRES and RRGMRES - their success......We study the regularization properties of iterative minimum-residual methods applied to discrete ill-posed problems. In these methods, the projection onto the underlying Krylov subspace acts as a regularizer, and the emphasis of this work is on the role played by the basis vectors of these Krylov...... as regularization methods is highly problem dependent....

  12. Fields Institute International Symposium on Asymptotic Methods in Stochastics

    CERN Document Server

    Kulik, Rafal; Haye, Mohamedou; Szyszkowicz, Barbara; Zhao, Yiqiang

    2015-01-01

    This book contains articles arising from a conference in honour of mathematician-statistician Miklόs Csörgő on the occasion of his 80th birthday, held in Ottawa in July 2012. It comprises research papers and overview articles, which provide a substantial glimpse of the history and state-of-the-art of the field of asymptotic methods in probability and statistics, written by leading experts. The volume consists of twenty articles on topics on limit theorems for self-normalized processes, planar processes, the central limit theorem and laws of large numbers, change-point problems, short and long range dependent time series, applied probability and stochastic processes, and the theory and methods of statistics. It also includes Csörgő’s list of publications during more than 50 years, since 1962.

  13. Conference on Boundary and Interior Layers : Computational and Asymptotic Methods

    CERN Document Server

    Stynes, Martin; Zhang, Zhimin

    2017-01-01

    This volume collects papers associated with lectures that were presented at the BAIL 2016 conference, which was held from 14 to 19 August 2016 at Beijing Computational Science Research Center and Tsinghua University in Beijing, China. It showcases the variety and quality of current research into numerical and asymptotic methods for theoretical and practical problems whose solutions involve layer phenomena. The BAIL (Boundary And Interior Layers) conferences, held usually in even-numbered years, bring together mathematicians and engineers/physicists whose research involves layer phenomena, with the aim of promoting interaction between these often-separate disciplines. These layers appear as solutions of singularly perturbed differential equations of various types, and are common in physical problems, most notably in fluid dynamics. This book is of interest for current researchers from mathematics, engineering and physics whose work involves the accurate app roximation of solutions of singularly perturbed diffe...

  14. 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

  15. Optimal Homotopy Asymptotic Method for Solving System of Fredholm Integral Equations

    Directory of Open Access Journals (Sweden)

    Bahman Ghazanfari

    2013-08-01

    Full Text Available In this paper, optimal homotopy asymptotic method (OHAM is applied to solve system of Fredholm integral equations. The effectiveness of optimal homotopy asymptotic method is presented. This method provides easy tools to control the convergence region of approximating solution series wherever necessary. The results of OHAM are compared with homotopy perturbation method (HPM and Taylor series expansion method (TSEM.

  16. Asymptotic Method for Cladding Stress Evaluation in PCMI

    International Nuclear Information System (INIS)

    Kim, Hyungkyu; Kim, Jaeyong; Yoon, Kyungho; Lee, Kanghee; Kang, Heungseok

    2014-01-01

    A PCMI (Pellet Cladding Mechanical Interaction) failure was first reported in the GETR (General Electric Test Reactor) at Vacellitos in 1963, and such failures are still occurring. Since the high stress values in the cladding tube has been of a crucial concern in PCMI studies, there have been many researches on the stress analysis of a cladding tube pressed by a pellet. Typical works can be found in some references. It has often been assumed, however, that the cracks in the pellet were equally spaced and the pellet was a rigid body. In addition, the friction coefficient was arbitrarily chosen so that a slipping between the pellets and cladding tube could not be logically defined. Moreover, the stress intensification due to the sharp edge of a pellet fragment has never been realistically considered. These problems above drove us to launch a framework of a PCMI study particularly on stress analysis technology to improve the present analysis method incorporating the actual PCMI conditions such as the stress intensification, arbitrary distribution of the pellet cracks, material properties (esp. pellet) and slipping behavior of the pellet/cladding interface. As a first step of this work, this paper introduces an asymptotic method that was originally developed for a stress analysis in the vicinity of a sharp notch of a homogeneous body. The intrinsic reason for applying this method is to simulate the stress singularity that is expected to take place at the sharp edge of a pellet fragment due to cracking during irradiation. As a first attempt of this work, an eigenvalue problem is formulated in the case of adhered contact, and the generalized stress intensity factors are defined and evaluated. Although some works obviously remain to be accomplished, for the present framework on the PCMI analysis (e. g., slipping behaviour, contact force etc.), it was addressed that the asymptotic method can produce the stress values that cause the cladding tube failure in PCMI more

  17. Recent developments of some asymptotic methods and their applications for nonlinear vibration equations in engineering problems: a review

    Directory of Open Access Journals (Sweden)

    Mahmoud Bayat

    Full Text Available This review features a survey of some recent developments in asymptotic techniques and new developments, which are valid not only for weakly nonlinear equations, but also for strongly ones. Further, the achieved approximate analytical solutions are valid for the whole solution domain. The limitations of traditional perturbation methods are illustrated, various modified perturbation techniques are proposed, and some mathematical tools such as variational theory, homotopy technology, and iteration technique are introduced to over-come the shortcomings.In this review we have applied different powerful analytical methods to solve high nonlinear problems in engineering vibrations. Some patterns are given to illustrate the effectiveness and convenience of the methodologies.

  18. 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.

  19. Asymptotic solving method for sea-air coupled oscillator ENSO model

    International Nuclear Information System (INIS)

    Zhou Xian-Chun; Yao Jing-Sun; Mo Jia-Qi

    2012-01-01

    The ENSO is an interannual phenomenon involved in the tropical Pacific ocean-atmosphere interaction. In this article, we create an asymptotic solving method for the nonlinear system of the ENSO model. The asymptotic solution is obtained. And then we can furnish weather forecasts theoretically and other behaviors and rules for the atmosphere-ocean oscillator of the ENSO. (general)

  20. 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...

  1. Multicore Performance of Block Algebraic Iterative Reconstruction Methods

    DEFF Research Database (Denmark)

    Sørensen, Hans Henrik B.; Hansen, Per Christian

    2014-01-01

    Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely on semiconv......Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely...... on semiconvergence. Block versions of these methods, based on a partitioning of the linear system, are able to combine the fast semiconvergence of ART with the better multicore properties of SIRT. These block methods separate into two classes: those that, in each iteration, access the blocks in a sequential manner...... a fixed relaxation parameter in each method, namely, the one that leads to the fastest semiconvergence. Computational results show that for multicore computers, the sequential approach is preferable....

  2. Variational iteration method for one dimensional nonlinear thermoelasticity

    International Nuclear Information System (INIS)

    Sweilam, N.H.; Khader, M.M.

    2007-01-01

    This paper applies the variational iteration method to solve the Cauchy problem arising in one dimensional nonlinear thermoelasticity. The advantage of this method is to overcome the difficulty of calculation of Adomian's polynomials in the Adomian's decomposition method. The numerical results of this method are compared with the exact solution of an artificial model to show the efficiency of the method. The approximate solutions show that the variational iteration method is a powerful mathematical tool for solving nonlinear problems

  3. Leapfrog variants of iterative methods for linear algebra equations

    Science.gov (United States)

    Saylor, Paul E.

    1988-01-01

    Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterates are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

  4. 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.

  5. 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 ...

  6. Iterative Refinement Methods for Time-Domain Equalizer Design

    Directory of Open Access Journals (Sweden)

    Evans Brian L

    2006-01-01

    Full Text Available Commonly used time domain equalizer (TEQ design methods have been recently unified as an optimization problem involving an objective function in the form of a Rayleigh quotient. The direct generalized eigenvalue solution relies on matrix decompositions. To reduce implementation complexity, we propose an iterative refinement approach in which the TEQ length starts at two taps and increases by one tap at each iteration. Each iteration involves matrix-vector multiplications and vector additions with matrices and two-element vectors. At each iteration, the optimization of the objective function either improves or the approach terminates. The iterative refinement approach provides a range of communication performance versus implementation complexity tradeoffs for any TEQ method that fits the Rayleigh quotient framework. We apply the proposed approach to three such TEQ design methods: maximum shortening signal-to-noise ratio, minimum intersymbol interference, and minimum delay spread.

  7. Multi-Level iterative methods in computational plasma physics

    International Nuclear Information System (INIS)

    Knoll, D.A.; Barnes, D.C.; Brackbill, J.U.; Chacon, L.; Lapenta, G.

    1999-01-01

    Plasma physics phenomena occur on a wide range of spatial scales and on a wide range of time scales. When attempting to model plasma physics problems numerically the authors are inevitably faced with the need for both fine spatial resolution (fine grids) and implicit time integration methods. Fine grids can tax the efficiency of iterative methods and large time steps can challenge the robustness of iterative methods. To meet these challenges they are developing a hybrid approach where multigrid methods are used as preconditioners to Krylov subspace based iterative methods such as conjugate gradients or GMRES. For nonlinear problems they apply multigrid preconditioning to a matrix-few Newton-GMRES method. Results are presented for application of these multilevel iterative methods to the field solves in implicit moment method PIC, multidimensional nonlinear Fokker-Planck problems, and their initial efforts in particle MHD

  8. Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Benzi, M. [Universita di Bologna (Italy); Tuma, M. [Inst. of Computer Sciences, Prague (Czech Republic)

    1996-12-31

    A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods.

  9. Iterative algorithm for the volume integral method for magnetostatics problems

    International Nuclear Information System (INIS)

    Pasciak, J.E.

    1980-11-01

    Volume integral methods for solving nonlinear magnetostatics problems are considered in this paper. The integral method is discretized by a Galerkin technique. Estimates are given which show that the linearized problems are well conditioned and hence easily solved using iterative techniques. Comparisons of iterative algorithms with the elimination method of GFUN3D shows that the iterative method gives an order of magnitude improvement in computational time as well as memory requirements for large problems. Computational experiments for a test problem as well as a double layer dipole magnet are given. Error estimates for the linearized problem are also derived

  10. 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...

  11. An Iterative Brinkman penalization for particle vortex methods

    DEFF Research Database (Denmark)

    Walther, Jens Honore; Hejlesen, Mads Mølholm; Leonard, A.

    2013-01-01

    We present an iterative Brinkman penalization method for the enforcement of the no-slip boundary condition in vortex particle methods. This is achieved by implementing a penalization of the velocity field using iteration of the penalized vorticity. We show that using the conventional Brinkman...... condition. These are: the impulsively started flow past a cylinder, the impulsively started flow normal to a flat plate, and the uniformly accelerated flow normal to a flat plate. The iterative penalization algorithm is shown to give significantly improved results compared to the conventional penalization...

  12. Numerov iteration method for second order integral-differential equation

    International Nuclear Information System (INIS)

    Zeng Fanan; Zhang Jiaju; Zhao Xuan

    1987-01-01

    In this paper, Numerov iterative method for second order integral-differential equation and system of equations are constructed. Numerical examples show that this method is better than direct method (Gauss elimination method) in CPU time and memoy requireing. Therefore, this method is an efficient method for solving integral-differential equation in nuclear physics

  13. 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.

  14. Stopping test of iterative methods for solving PDE

    International Nuclear Information System (INIS)

    Wang Bangrong

    1991-01-01

    In order to assure the accuracy of the numerical solution of the iterative method for solving PDE (partial differential equation), the stopping test is very important. If the coefficient matrix of the system of linear algebraic equations is strictly diagonal dominant or irreducible weakly diagonal dominant, the stopping test formulas of the iterative method for solving PDE is proposed. Several numerical examples are given to illustrate the applications of the stopping test formulas

  15. 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

  16. Non-asymptotic fractional order differentiators via an algebraic parametric method

    KAUST Repository

    Liu, Dayan

    2012-08-01

    Recently, Mboup, Join and Fliess [27], [28] introduced non-asymptotic integer order differentiators by using an algebraic parametric estimation method [7], [8]. In this paper, in order to obtain non-asymptotic fractional order differentiators we apply this algebraic parametric method to truncated expansions of fractional Taylor series based on the Jumarie\\'s modified Riemann-Liouville derivative [14]. Exact and simple formulae for these differentiators are given where a sliding integration window of a noisy signal involving Jacobi polynomials is used without complex mathematical deduction. The efficiency and the stability with respect to corrupting noises of the proposed fractional order differentiators are shown in numerical simulations. © 2012 IEEE.

  17. Non-asymptotic fractional order differentiators via an algebraic parametric method

    KAUST Repository

    Liu, Dayan; Gibaru, O.; Perruquetti, Wilfrid

    2012-01-01

    Recently, Mboup, Join and Fliess [27], [28] introduced non-asymptotic integer order differentiators by using an algebraic parametric estimation method [7], [8]. In this paper, in order to obtain non-asymptotic fractional order differentiators we apply this algebraic parametric method to truncated expansions of fractional Taylor series based on the Jumarie's modified Riemann-Liouville derivative [14]. Exact and simple formulae for these differentiators are given where a sliding integration window of a noisy signal involving Jacobi polynomials is used without complex mathematical deduction. The efficiency and the stability with respect to corrupting noises of the proposed fractional order differentiators are shown in numerical simulations. © 2012 IEEE.

  18. Integral method for the calculation of Hawking radiation in dispersive media. II. Asymmetric asymptotics.

    Science.gov (United States)

    Robertson, Scott

    2014-11-01

    Analog gravity experiments make feasible the realization of black hole space-times in a laboratory setting and the observational verification of Hawking radiation. Since such analog systems are typically dominated by dispersion, efficient techniques for calculating the predicted Hawking spectrum in the presence of strong dispersion are required. In the preceding paper, an integral method in Fourier space is proposed for stationary 1+1-dimensional backgrounds which are asymptotically symmetric. Here, this method is generalized to backgrounds which are different in the asymptotic regions to the left and right of the scattering region.

  19. Probabilistic finite element stiffness of a laterally loaded monopile based on an improved asymptotic sampling method

    DEFF Research Database (Denmark)

    Vahdatirad, Mohammadjavad; Bayat, Mehdi; Andersen, Lars Vabbersgaard

    2015-01-01

    shear strength of clay. Normal and Sobol sampling are employed to provide the asymptotic sampling method to generate the probability distribution of the foundation stiffnesses. Monte Carlo simulation is used as a benchmark. Asymptotic sampling accompanied with Sobol quasi random sampling demonstrates......The mechanical responses of an offshore monopile foundation mounted in over-consolidated clay are calculated by employing a stochastic approach where a nonlinear p–y curve is incorporated with a finite element scheme. The random field theory is applied to represent a spatial variation for undrained...... an efficient method for estimating the probability distribution of stiffnesses for the offshore monopile foundation....

  20. Copper Mountain conference on iterative methods: Proceedings: Volume 2

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1996-10-01

    This volume (the second of two) contains information presented during the last two days of the Copper Mountain Conference on Iterative Methods held April 9-13, 1996 at Copper Mountain, Colorado. Topics of the sessions held these two days include domain decomposition, Krylov methods, computational fluid dynamics, Markov chains, sparse and parallel basic linear algebra subprograms, multigrid methods, applications of iterative methods, equation systems with multiple right-hand sides, projection methods, and the Helmholtz equation. Selected papers indexed separately for the Energy Science and Technology Database.

  1. 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...

  2. 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...

  3. 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

  4. An asymptotic preserving multidimensional ALE method for a system of two compressible flows coupled with friction

    Science.gov (United States)

    Del Pino, S.; Labourasse, E.; Morel, G.

    2018-06-01

    We present a multidimensional asymptotic preserving scheme for the approximation of a mixture of compressible flows. Fluids are modelled by two Euler systems of equations coupled with a friction term. The asymptotic preserving property is mandatory for this kind of model, to derive a scheme that behaves well in all regimes (i.e. whatever the friction parameter value is). The method we propose is defined in ALE coordinates, using a Lagrange plus remap approach. This imposes a multidimensional definition and analysis of the scheme.

  5. An iterative method for the canard explosion in general planar systems

    DEFF Research Database (Denmark)

    Brøns, Morten

    2013-01-01

    The canard explosion is the change of amplitude and period of a limit cycle born in a Hopf bifurcation in a very narrow parameter interval. The phenomenon is well understood in singular perturbation problems where a small parameter controls the slow/fast dynamics. However, canard explosions are a...... on the van der Pol equation, showing that the asymptotics of the method is correct, and on a templator model for a self-replicating system....... are also observed in systems where no such parameter can obviously be identied. Here we show how the iterative method of Roussel and Fraser, devised to construct regular slow manifolds, can be used to determine a canard point in a general planar system of nonlinear ODEs. We demonstrate the method...

  6. A asymptotic numerical method for the steady-state convection diffusion equation

    International Nuclear Information System (INIS)

    Wu Qiguang

    1988-01-01

    In this paper, A asymptotic numerical method for the steady-state Convection diffusion equation is proposed, which need not take very fine mesh size in the neighbourhood of the boundary layer. Numerical computation for model problem show that we can obtain the numerical solution in the boundary layer with moderate step size

  7. An asymptotic expression for the eigenvalues of the normalization kernel of the resonating group method

    International Nuclear Information System (INIS)

    Lomnitz-Adler, J.; Brink, D.M.

    1976-01-01

    A generating function for the eigenvalues of the RGM Normalization Kernel is expressed in terms of the diagonal matrix elements of thw GCM Overlap Kernel. An asymptotic expression for the eigenvalues is obtained by using the Method of Steepest Descent. (Auth.)

  8. 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.

  9. Optimal Homotopy Asymptotic Method for Solving the Linear Fredholm Integral Equations of the First Kind

    Directory of Open Access Journals (Sweden)

    Mohammad Almousa

    2013-01-01

    Full Text Available The aim of this study is to present the use of a semi analytical method called the optimal homotopy asymptotic method (OHAM for solving the linear Fredholm integral equations of the first kind. Three examples are discussed to show the ability of the method to solve the linear Fredholm integral equations of the first kind. The results indicated that the method is very effective and simple.

  10. 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 ...

  11. A novel iterative energy calibration method for composite germanium detectors

    International Nuclear Information System (INIS)

    Pattabiraman, N.S.; Chintalapudi, S.N.; Ghugre, S.S.

    2004-01-01

    An automatic method for energy calibration of the observed experimental spectrum has been developed. The method presented is based on an iterative algorithm and presents an efficient way to perform energy calibrations after establishing the weights of the calibration data. An application of this novel technique for data acquired using composite detectors in an in-beam γ-ray spectroscopy experiment is presented

  12. A novel iterative energy calibration method for composite germanium detectors

    Energy Technology Data Exchange (ETDEWEB)

    Pattabiraman, N.S.; Chintalapudi, S.N.; Ghugre, S.S. E-mail: ssg@alpha.iuc.res.in

    2004-07-01

    An automatic method for energy calibration of the observed experimental spectrum has been developed. The method presented is based on an iterative algorithm and presents an efficient way to perform energy calibrations after establishing the weights of the calibration data. An application of this novel technique for data acquired using composite detectors in an in-beam {gamma}-ray spectroscopy experiment is presented.

  13. 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

  14. COMPARISON OF HOLOGRAPHIC AND ITERATIVE METHODS FOR AMPLITUDE OBJECT RECONSTRUCTION

    Directory of Open Access Journals (Sweden)

    I. A. Shevkunov

    2015-01-01

    Full Text Available Experimental comparison of four methods for the wavefront reconstruction is presented. We considered two iterative and two holographic methods with different mathematical models and algorithms for recovery. The first two of these methods do not use a reference wave recording scheme that reduces requirements for stability of the installation. A major role in phase information reconstruction by such methods is played by a set of spatial intensity distributions, which are recorded as the recording matrix is being moved along the optical axis. The obtained data are used consistently for wavefront reconstruction using an iterative procedure. In the course of this procedure numerical distribution of the wavefront between the planes is performed. Thus, phase information of the wavefront is stored in every plane and calculated amplitude distributions are replaced for the measured ones in these planes. In the first of the compared methods, a two-dimensional Fresnel transform and iterative calculation in the object plane are used as a mathematical model. In the second approach, an angular spectrum method is used for numerical wavefront propagation, and the iterative calculation is carried out only between closely located planes of data registration. Two digital holography methods, based on the usage of the reference wave in the recording scheme and differing from each other by numerical reconstruction algorithm of digital holograms, are compared with the first two methods. The comparison proved that the iterative method based on 2D Fresnel transform gives results comparable with the result of common holographic method with the Fourier-filtering. It is shown that holographic method for reconstructing of the object complex amplitude in the process of the object amplitude reduction is the best among considered ones.

  15. Conference on Boundary and Interior Layers : Computational and Asymptotic Methods

    CERN Document Server

    2015-01-01

    This volume offers contributions reflecting a selection of the lectures presented at the international conference BAIL 2014, which was held from 15th to 19th September 2014 at the Charles University in Prague, Czech Republic. These are devoted to the theoretical and/or numerical analysis of problems involving boundary and interior layers and methods for solving these problems numerically. The authors are both mathematicians (pure and applied) and engineers, and bring together a large number of interesting ideas. The wide variety of topics treated in the contributions provides an excellent overview of current research into the theory and numerical solution of problems involving boundary and interior layers.  .

  16. Formulation and Application of Optimal Homotopty Asymptotic Method to Coupled Differential - Difference Equations

    Science.gov (United States)

    Ullah, Hakeem; Islam, Saeed; Khan, Ilyas; Shafie, Sharidan; Fiza, Mehreen

    2015-01-01

    In this paper we applied a new analytic approximate technique Optimal Homotopy Asymptotic Method (OHAM) for treatment of coupled differential- difference equations (DDEs). To see the efficiency and reliability of the method, we consider Relativistic Toda coupled nonlinear differential-difference equation. It provides us a convenient way to control the convergence of approximate solutions when it is compared with other methods of solution found in the literature. The obtained solutions show that OHAM is effective, simpler, easier and explicit. PMID:25874457

  17. Formulation and application of optimal homotopty asymptotic method to coupled differential-difference equations.

    Science.gov (United States)

    Ullah, Hakeem; Islam, Saeed; Khan, Ilyas; Shafie, Sharidan; Fiza, Mehreen

    2015-01-01

    In this paper we applied a new analytic approximate technique Optimal Homotopy Asymptotic Method (OHAM) for treatment of coupled differential-difference equations (DDEs). To see the efficiency and reliability of the method, we consider Relativistic Toda coupled nonlinear differential-difference equation. It provides us a convenient way to control the convergence of approximate solutions when it is compared with other methods of solution found in the literature. The obtained solutions show that OHAM is effective, simpler, easier and explicit.

  18. Asymptotic description of plasma turbulence: Krylov-Bogoliubov methods and quasi-particles

    International Nuclear Information System (INIS)

    Sosenko, P.P.; Bertrand, P.; Decyk, V.K.

    2001-01-01

    The asymptotic theory of charged particle motion in electromagnetic fields is developed for the general case of finite Larmor-radius effects by means of Krylov-Bogoliubov averaging method. The correspondence between the general asymptotic methods, elaborated by M. Krylov and M.Bogoliubov, the quasi-particle description and gyrokinetics is established. Such a comparison is used to shed more light on the physical sense of the reduced Poisson equation, introduced in gyrokinetics, and the particle polarization drift. It is shown that the modification of the Poisson equation in the asymptotic theory is due to the non-conservation of the magnetic moment and gyrophase trembling. it is shown that the second-order modification of the adiabatic invariant can determine the conditions of global plasma stability and introduces new nonlinear terms into the reduced Poisson equation. Such a modification is important for several plasma orderings, e.g. NHD type ordering. The feasibility of numerical simulation schemes in which the polarization drift is included into the quasi-particle equations of motion, and the Poisson equation remains unchanged is analyzed. A consistent asymptotic model is proposed in which the polarization drift is included into the quasi-particle equations of motion and the particle and quasi-particle velocities are equal. It is shown that in such models there are additional modifications of the reduced Poisson equation. The latter becomes even more complicated in contrast to earlier suggestions

  19. 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

  20. Iterative Two- and One-Dimensional Methods for Three-Dimensional Neutron Diffusion Calculations

    International Nuclear Information System (INIS)

    Lee, Hyun Chul; Lee, Deokjung; Downar, Thomas J.

    2005-01-01

    Two methods are proposed for solving the three-dimensional neutron diffusion equation by iterating between solutions of the two-dimensional (2-D) radial and one-dimensional (1-D) axial solutions. In the first method, the 2-D/1-D equations are coupled using a current correction factor (CCF) with the average fluxes of the lower and upper planes and the axial net currents at the plane interfaces. In the second method, an analytic expression for the axial net currents at the interface of the planes is used for planar coupling. A comparison of the new methods is made with two previously proposed methods, which use interface net currents and partial currents for planar coupling. A Fourier convergence analysis of the four methods was performed, and results indicate that the two new methods have at least three advantages over the previous methods. First, the new methods are unconditionally stable, whereas the net current method diverges for small axial mesh size. Second, the new methods provide better convergence performance than the other methods in the range of practical mesh sizes. Third, the spectral radii of the new methods asymptotically approach zero as the mesh size increases, while the spectral radius of the partial current method approaches a nonzero value as the mesh size increases. Of the two new methods proposed here, the analytic method provides a smaller spectral radius than the CCF method, but the CCF method has several advantages over the analytic method in practical applications

  1. 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.

  2. 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.

  3. 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

  4. Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems

    Czech Academy of Sciences Publication Activity Database

    Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav

    2014-01-01

    Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014

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

    Indian Academy of Sciences (India)

    Shwetabh Srivastava

    [6, 7]. A number of direct and iterative methods for com- putation of the Drazin inverse were developed in [8–12]. Its extension to Banach algebras is known as the generalized Drazin inverse and was established in [13]. Let J denote the complex. Banach algebra with the unit 1. The generalized Drazin inverse of an element ...

  6. Asymptotic equilibrium diffusion analysis of time-dependent Monte Carlo methods for grey radiative transfer

    International Nuclear Information System (INIS)

    Densmore, Jeffery D.; Larsen, Edward W.

    2004-01-01

    The equations of nonlinear, time-dependent radiative transfer are known to yield the equilibrium diffusion equation as the leading-order solution of an asymptotic analysis when the mean-free path and mean-free time of a photon become small. We apply this same analysis to the Fleck-Cummings, Carter-Forest, and N'kaoua Monte Carlo approximations for grey (frequency-independent) radiative transfer. Although Monte Carlo simulation usually does not require the discretizations found in deterministic transport techniques, Monte Carlo methods for radiative transfer require a time discretization due to the nonlinearities of the problem. If an asymptotic analysis of the equations used by a particular Monte Carlo method yields an accurate time-discretized version of the equilibrium diffusion equation, the method should generate accurate solutions if a time discretization is chosen that resolves temperature changes, even if the time steps are much larger than the mean-free time of a photon. This analysis is of interest because in many radiative transfer problems, it is a practical necessity to use time steps that are large compared to a mean-free time. Our asymptotic analysis shows that: (i) the N'kaoua method has the equilibrium diffusion limit, (ii) the Carter-Forest method has the equilibrium diffusion limit if the material temperature change during a time step is small, and (iii) the Fleck-Cummings method does not have the equilibrium diffusion limit. We include numerical results that verify our theoretical predictions

  7. 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

  8. On the asymptotic form of the recursion method basis vectors for periodic Hamiltonians

    International Nuclear Information System (INIS)

    O'Reilly, E.P.; Weaire, D.

    1984-01-01

    The authors present the first detailed study of the recursion method basis vectors for the case of a periodic Hamiltonian. In the examples chosen, the probability density scales linearly with n as n → infinity, whenever the local density of states is bounded. Whenever it is unbounded and the recursion coefficients diverge, different scaling behaviour is found. These findings are explained and a scaling relationship between the asymptotic forms of the recursion coefficients and basis vectors is proposed. (author)

  9. 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...

  10. A new non-iterative method for fitting Lorentzian to Moessbauer spectra

    International Nuclear Information System (INIS)

    Mukoyama, T.; Vegh, J.

    1980-01-01

    A new method for fitting a Lorentzian function without an iterative procedure is presented. The method is quicker and simpler than the previously proposed method of non-iterative fitting. Comparison with the previous method and with the conventional iterative method has been made. It is shown that the present method gives satisfactory results. (orig.)

  11. An iterative method for selecting degenerate multiplex PCR primers.

    Science.gov (United States)

    Souvenir, Richard; Buhler, Jeremy; Stormo, Gary; Zhang, Weixiong

    2007-01-01

    Single-nucleotide polymorphism (SNP) genotyping is an important molecular genetics process, which can produce results that will be useful in the medical field. Because of inherent complexities in DNA manipulation and analysis, many different methods have been proposed for a standard assay. One of the proposed techniques for performing SNP genotyping requires amplifying regions of DNA surrounding a large number of SNP loci. To automate a portion of this particular method, it is necessary to select a set of primers for the experiment. Selecting these primers can be formulated as the Multiple Degenerate Primer Design (MDPD) problem. The Multiple, Iterative Primer Selector (MIPS) is an iterative beam-search algorithm for MDPD. Theoretical and experimental analyses show that this algorithm performs well compared with the limits of degenerate primer design. Furthermore, MIPS outperforms an existing algorithm that was designed for a related degenerate primer selection problem.

  12. 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.

  13. Study of a Biparametric Family of Iterative Methods

    Directory of Open Access Journals (Sweden)

    B. Campos

    2014-01-01

    Full Text Available The dynamics of a biparametric family for solving nonlinear equations is studied on quadratic polynomials. This biparametric family includes the c-iterative methods and the well-known Chebyshev-Halley family. We find the analytical expressions for the fixed and critical points by solving 6-degree polynomials. We use the free critical points to get the parameter planes and, by observing them, we specify some values of (α, c with clear stable and unstable behaviors.

  14. Maxwell iteration for the lattice Boltzmann method with diffusive scaling

    Science.gov (United States)

    Zhao, Weifeng; Yong, Wen-An

    2017-03-01

    In this work, we present an alternative derivation of the Navier-Stokes equations from Bhatnagar-Gross-Krook models of the lattice Boltzmann method with diffusive scaling. This derivation is based on the Maxwell iteration and can expose certain important features of the lattice Boltzmann solutions. Moreover, it will be seen to be much more straightforward and logically clearer than the existing approaches including the Chapman-Enskog expansion.

  15. Diffeomorphic Iterative Centroid Methods for Template Estimation on Large Datasets

    OpenAIRE

    Cury , Claire; Glaunès , Joan Alexis; Colliot , Olivier

    2014-01-01

    International audience; A common approach for analysis of anatomical variability relies on the stimation of a template representative of the population. The Large Deformation Diffeomorphic Metric Mapping is an attractive framework for that purpose. However, template estimation using LDDMM is computationally expensive, which is a limitation for the study of large datasets. This paper presents an iterative method which quickly provides a centroid of the population in the shape space. This centr...

  16. Copper Mountain conference on iterative methods: Proceedings: Volume 1

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1996-10-01

    This volume (one of two) contains information presented during the first three days of the Copper Mountain Conference on Iterative Methods held April 9-13, 1996 at Copper Mountain, Colorado. Topics of the sessions held these three days included nonlinear systems, parallel processing, preconditioning, sparse matrix test collections, first-order system least squares, Arnoldi`s method, integral equations, software, Navier-Stokes equations, Euler equations, Krylov methods, and eigenvalues. The top three papers from a student competition are also included. Selected papers indexed separately for the Energy Science and Technology Database.

  17. 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).

  18. 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.

  19. Note: interpreting iterative methods convergence with diffusion point of view

    OpenAIRE

    Hong, Dohy

    2013-01-01

    In this paper, we explain the convergence speed of different iteration schemes with the fluid diffusion view when solving a linear fixed point problem. This interpretation allows one to better understand why power iteration or Jacobi iteration may converge faster or slower than Gauss-Seidel iteration.

  20. Optimal homotopy asymptotic method for solving fractional relaxation-oscillation equation

    Directory of Open Access Journals (Sweden)

    Mohammad Hamarsheh

    2015-11-01

    Full Text Available In this paper, an approximate analytical solution of linear fractional relaxation-oscillation equations in which the fractional derivatives are given in the Caputo sense, is obtained by the optimal homotopy asymptotic method (OHAM. The studied OHAM is based on minimizing the residual error. The results given by OHAM are compared with the exact solutions and the solutions obtained by generalized Taylor matrix method. The reliability and efficiency of the proposed approach are demonstrated in three examples with the aid of the symbolic algebra program Maple.

  1. Comment on “Variational Iteration Method for Fractional Calculus Using He’s Polynomials”

    Directory of Open Access Journals (Sweden)

    Ji-Huan He

    2012-01-01

    boundary value problems. This note concludes that the method is a modified variational iteration method using He’s polynomials. A standard variational iteration algorithm for fractional differential equations is suggested.

  2. An Automated Baseline Correction Method Based on Iterative Morphological Operations.

    Science.gov (United States)

    Chen, Yunliang; Dai, Liankui

    2018-05-01

    Raman spectra usually suffer from baseline drift caused by fluorescence or other reasons. Therefore, baseline correction is a necessary and crucial step that must be performed before subsequent processing and analysis of Raman spectra. An automated baseline correction method based on iterative morphological operations is proposed in this work. The method can adaptively determine the structuring element first and then gradually remove the spectral peaks during iteration to get an estimated baseline. Experiments on simulated data and real-world Raman data show that the proposed method is accurate, fast, and flexible for handling different kinds of baselines in various practical situations. The comparison of the proposed method with some state-of-the-art baseline correction methods demonstrates its advantages over the existing methods in terms of accuracy, adaptability, and flexibility. Although only Raman spectra are investigated in this paper, the proposed method is hopefully to be used for the baseline correction of other analytical instrumental signals, such as IR spectra and chromatograms.

  3. 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.

  4. 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...

  5. Local Fractional Laplace Variational Iteration Method for Solving Linear Partial Differential Equations with Local Fractional Derivative

    Directory of Open Access Journals (Sweden)

    Ai-Min Yang

    2014-01-01

    Full Text Available The local fractional Laplace variational iteration method was applied to solve the linear local fractional partial differential equations. The local fractional Laplace variational iteration method is coupled by the local fractional variational iteration method and Laplace transform. The nondifferentiable approximate solutions are obtained and their graphs are also shown.

  6. 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

  7. Parallel computation of multigroup reactivity coefficient using iterative method

    Science.gov (United States)

    Susmikanti, Mike; Dewayatna, Winter

    2013-09-01

    One of the research activities to support the commercial radioisotope production program is a safety research target irradiation FPM (Fission Product Molybdenum). FPM targets form a tube made of stainless steel in which the nuclear degrees of superimposed high-enriched uranium. FPM irradiation tube is intended to obtain fission. The fission material widely used in the form of kits in the world of nuclear medicine. Irradiation FPM tube reactor core would interfere with performance. One of the disorders comes from changes in flux or reactivity. It is necessary to study a method for calculating safety terrace ongoing configuration changes during the life of the reactor, making the code faster became an absolute necessity. Neutron safety margin for the research reactor can be reused without modification to the calculation of the reactivity of the reactor, so that is an advantage of using perturbation method. The criticality and flux in multigroup diffusion model was calculate at various irradiation positions in some uranium content. This model has a complex computation. Several parallel algorithms with iterative method have been developed for the sparse and big matrix solution. The Black-Red Gauss Seidel Iteration and the power iteration parallel method can be used to solve multigroup diffusion equation system and calculated the criticality and reactivity coeficient. This research was developed code for reactivity calculation which used one of safety analysis with parallel processing. It can be done more quickly and efficiently by utilizing the parallel processing in the multicore computer. This code was applied for the safety limits calculation of irradiated targets FPM with increment Uranium.

  8. Iterative methods for dose reduction and image enhancement in tomography

    Science.gov (United States)

    Miao, Jianwei; Fahimian, Benjamin Pooya

    2012-09-18

    A system and method for creating a three dimensional cross sectional image of an object by the reconstruction of its projections that have been iteratively refined through modification in object space and Fourier space is disclosed. The invention provides systems and methods for use with any tomographic imaging system that reconstructs an object from its projections. In one embodiment, the invention presents a method to eliminate interpolations present in conventional tomography. The method has been experimentally shown to provide higher resolution and improved image quality parameters over existing approaches. A primary benefit of the method is radiation dose reduction since the invention can produce an image of a desired quality with a fewer number projections than seen with conventional methods.

  9. Asymptotic iteration method for the modified Pöschl–Teller potential ...

    Indian Academy of Sciences (India)

    2017-01-04

    Jan 4, 2017 ... Relativistic energy equation is calculated numerically by the Matlab soft- ware. The increase in the radial quantum number nr causes a decrease in the energy value, and the wave functions of the radial and the angular parts are expressed in terms of hypergeometric functions. Some thermodynamical.

  10. Asymptotic iteration method for the modified Pöschl–Teller potential ...

    Indian Academy of Sciences (India)

    Relativistic energy equation is calculated numerically by the Matlab software. The increase in the radial quantum number nr causes a decrease in the energy value, and the wave functions of the radial and the angular parts are expressed in terms of hypergeometric functions. Some thermodynamical properties of the system ...

  11. 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.

  12. Statistics of electron multiplication in multiplier phototube: iterative method

    International Nuclear Information System (INIS)

    Grau Malonda, A.; Ortiz Sanchez, J.F.

    1985-01-01

    An iterative method is applied to study the variation of dynode response in the multiplier phototube. Three different situations are considered that correspond to the following ways of electronic incidence on the first dynode: incidence of exactly one electron, incidence of exactly r electrons and incidence of an average anti-r electrons. The responses are given for a number of steps between 1 and 5, and for values of the multiplication factor of 2.1, 2.5, 3 and 5. We study also the variance, the skewness and the excess of jurtosis for different multiplication factors. (author)

  13. Statistics of electron multiplication in a multiplier phototube; Iterative method

    International Nuclear Information System (INIS)

    Ortiz, J. F.; Grau, A.

    1985-01-01

    In the present paper an iterative method is applied to study the variation of dynode response in the multiplier phototube. Three different situation are considered that correspond to the following ways of electronic incidence on the first dynode: incidence of exactly one electron, incidence of exactly r electrons and incidence of an average r electrons. The responses are given for a number of steps between 1 and 5, and for values of the multiplication factor of 2.1, 2.5, 3 and 5. We study also the variance, the skewness and the excess of jurtosis for different multiplication factors. (Author) 11 refs

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

    KAUST Repository

    Desmal, Abdulla; Bagci, Hakan

    2014-01-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

  15. AN ITERATIVE SEGMENTATION METHOD FOR REGION OF INTEREST EXTRACTION

    Directory of Open Access Journals (Sweden)

    Volkan CETIN

    2013-01-01

    Full Text Available In this paper, a method is presented for applications which include mammographic image segmentation and region of interest extraction. Segmentation is a very critical and difficult stage to accomplish in computer aided detection systems. Although the presented segmentation method is developed for mammographic images, it can be used for any medical image which resembles the same statistical characteristics with mammograms. Fundamentally, the method contains iterative automatic thresholding and masking operations which is applied to the original or enhanced mammograms. Also the effect of image enhancement to the segmentation process was observed. A version of histogram equalization was applied to the images for enhancement. Finally, the results show that enhanced version of the proposed segmentation method is preferable because of its better success rate.

  16. 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.

  17. Modification of 2-D Time-Domain Shallow Water Wave Equation using Asymptotic Expansion Method

    Science.gov (United States)

    Khairuman, Teuku; Nasruddin, MN; Tulus; Ramli, Marwan

    2018-01-01

    Generally, research on the tsunami wave propagation model can be conducted by using a linear model of shallow water theory, where a non-linear side on high order is ignored. In line with research on the investigation of the tsunami waves, the Boussinesq equation model underwent a change aimed to obtain an improved quality of the dispersion relation and non-linearity by increasing the order to be higher. To solve non-linear sides at high order is used a asymptotic expansion method. This method can be used to solve non linear partial differential equations. In the present work, we found that this method needs much computational time and memory with the increase of the number of elements.

  18. 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.

  19. An efficient iterative method for the generalized Stokes problem

    Energy Technology Data Exchange (ETDEWEB)

    Sameh, A. [Univ. of Minnesota, Twin Cities, MN (United States); Sarin, V. [Univ. of Illinois, Urbana, IL (United States)

    1996-12-31

    This paper presents an efficient iterative scheme for the generalized Stokes problem, which arises frequently in the simulation of time-dependent Navier-Stokes equations for incompressible fluid flow. The general form of the linear system is where A = {alpha}M + vT is an n x n symmetric positive definite matrix, in which M is the mass matrix, T is the discrete Laplace operator, {alpha} and {nu} are positive constants proportional to the inverses of the time-step {Delta}t and the Reynolds number Re respectively, and B is the discrete gradient operator of size n x k (k < n). Even though the matrix A is symmetric and positive definite, the system is indefinite due to the incompressibility constraint (B{sup T}u = 0). This causes difficulties both for iterative methods and commonly used preconditioners. Moreover, depending on the ratio {alpha}/{nu}, A behaves like the mass matrix M at one extreme and the Laplace operator T at the other, thus complicating the issue of preconditioning.

  20. Efficient nonparametric and asymptotic Bayesian model selection methods for attributed graph clustering

    KAUST Repository

    Xu, Zhiqiang

    2017-02-16

    Attributed graph clustering, also known as community detection on attributed graphs, attracts much interests recently due to the ubiquity of attributed graphs in real life. Many existing algorithms have been proposed for this problem, which are either distance based or model based. However, model selection in attributed graph clustering has not been well addressed, that is, most existing algorithms assume the cluster number to be known a priori. In this paper, we propose two efficient approaches for attributed graph clustering with automatic model selection. The first approach is a popular Bayesian nonparametric method, while the second approach is an asymptotic method based on a recently proposed model selection criterion, factorized information criterion. Experimental results on both synthetic and real datasets demonstrate that our approaches for attributed graph clustering with automatic model selection significantly outperform the state-of-the-art algorithm.

  1. Efficient nonparametric and asymptotic Bayesian model selection methods for attributed graph clustering

    KAUST Repository

    Xu, Zhiqiang; Cheng, James; Xiao, Xiaokui; Fujimaki, Ryohei; Muraoka, Yusuke

    2017-01-01

    Attributed graph clustering, also known as community detection on attributed graphs, attracts much interests recently due to the ubiquity of attributed graphs in real life. Many existing algorithms have been proposed for this problem, which are either distance based or model based. However, model selection in attributed graph clustering has not been well addressed, that is, most existing algorithms assume the cluster number to be known a priori. In this paper, we propose two efficient approaches for attributed graph clustering with automatic model selection. The first approach is a popular Bayesian nonparametric method, while the second approach is an asymptotic method based on a recently proposed model selection criterion, factorized information criterion. Experimental results on both synthetic and real datasets demonstrate that our approaches for attributed graph clustering with automatic model selection significantly outperform the state-of-the-art algorithm.

  2. Parallel framework for topology optimization using the method of moving asymptotes

    DEFF Research Database (Denmark)

    Aage, Niels; Lazarov, Boyan Stefanov

    2013-01-01

    and simple to implement linear solvers and optimization algorithms. However, to ensure generality, the code is developed to be easily extendable in terms of physical models as well as in terms of solution methods, without compromising the parallel scalability. The widely used Method of Moving Asymptotes......The complexity of problems attacked in topology optimization has increased dramatically during the past decade. Examples include fully coupled multiphysics problems in thermo-elasticity, fluid-structure interaction, Micro-Electro Mechanical System (MEMS) design and large-scale three dimensional...... optimization algorithm is parallelized and included as a fundamental part of the code. The capabilities of the presented approaches are demonstrated on topology optimization of a Stokes flow problem with target outflow constraints as well as the minimum compliance problem with a volume constraint from linear...

  3. 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

  4. The Semianalytical Solutions for Stiff Systems of Ordinary Differential Equations by Using Variational Iteration Method and Modified Variational Iteration Method with Comparison to Exact Solutions

    Directory of Open Access Journals (Sweden)

    Mehmet Tarik Atay

    2013-01-01

    Full Text Available The Variational Iteration Method (VIM and Modified Variational Iteration Method (MVIM are used to find solutions of systems of stiff ordinary differential equations for both linear and nonlinear problems. Some examples are given to illustrate the accuracy and effectiveness of these methods. We compare our results with exact results. In some studies related to stiff ordinary differential equations, problems were solved by Adomian Decomposition Method and VIM and Homotopy Perturbation Method. Comparisons with exact solutions reveal that the Variational Iteration Method (VIM and the Modified Variational Iteration Method (MVIM are easier to implement. In fact, these methods are promising methods for various systems of linear and nonlinear stiff ordinary differential equations. Furthermore, VIM, or in some cases MVIM, is giving exact solutions in linear cases and very satisfactory solutions when compared to exact solutions for nonlinear cases depending on the stiffness ratio of the stiff system to be solved.

  5. Obtaining macroscopic quantities for the contact line problem from Density Functional Theory using asymptotic methods

    Science.gov (United States)

    Sibley, David; Nold, Andreas; Kalliadasis, Serafim

    2015-11-01

    Density Functional Theory (DFT), a statistical mechanics of fluids approach, captures microscopic details of the fluid density structure in the vicinity of contact lines, as seen in computations in our recent study. Contact lines describe the location where interfaces between two fluids meet solid substrates, and have stimulated a wealth of research due to both their ubiquity in nature and technological applications and also due to their rich multiscale behaviour. Whilst progress can be made computationally to capture the microscopic to mesoscopic structure from DFT, complete analytical results to fully bridge to the macroscale are lacking. In this work, we describe our efforts to bring asymptotic methods to DFT to obtain results for contact angles and other macroscopic quantities in various parameter regimes. We acknowledge financial support from European Research Council via Advanced Grant No. 247031.

  6. International Conference on Boundary and Interior Layers : Computational and Asymptotic Methods

    CERN Document Server

    Kopteva, Natalia; O'Riordan, Eugene; Stynes, Martin

    2009-01-01

    These Proceedings contain a selection of the lectures given at the conference BAIL 2008: Boundary and Interior Layers – Computational and Asymptotic Methods, which was held from 28th July to 1st August 2008 at the University of Limerick, Ireland. The ?rst three BAIL conferences (1980, 1982, 1984) were organised by Professor John Miller in Trinity College Dublin, Ireland. The next seven were held in Novosibirsk (1986), Shanghai (1988), Colorado (1992), Beijing (1994), Perth (2002),Toulouse(2004),and Got ¨ tingen(2006).With BAIL 2008the series returned to Ireland. BAIL 2010 is planned for Zaragoza. The BAIL conferences strive to bring together mathematicians and engineers whose research involves layer phenomena,as these two groups often pursue largely independent paths. BAIL 2008, at which both communities were well represented, succeeded in this regard. The lectures given were evenly divided between app- cations and theory, exposing all conference participants to a broad spectrum of research into problems e...

  7. Asymptotics and Borel summability

    CERN Document Server

    Costin, Ovidiu

    2008-01-01

    Incorporating substantial developments from the last thirty years into one resource, Asymptotics and Borel Summability provides a self-contained introduction to asymptotic analysis with special emphasis on topics not covered in traditional asymptotics books. The author explains basic ideas, concepts, and methods of generalized Borel summability, transseries, and exponential asymptotics. He provides complete mathematical rigor while supplementing it with heuristic material and examples, so that some proofs may be omitted by applications-oriented readers.To give a sense of how new methods are us

  8. Dynamic RCS Simulation of a Missile Target Group Based on the High-frequency Asymptotic Method

    Directory of Open Access Journals (Sweden)

    Zhao Tao

    2014-04-01

    Full Text Available To simulate dynamic Radar Cross Section (RCS of missile target group, an efficient RCS prediction approach is proposed based on the high-frequency asymptotic theory. The minimal energy trajectory and coordinate transformation is used to get trajectories of the missile, decoys and roll booster, and establish the dynamic scene for the separate procedure of the target group, and the dynamic RCS including specular reflection, edge diffraction and multi-reflection from the target group are obtained by Physical Optics (PO, Equivalent Edge Currents (EEC and Shooting-and-Bouncing Ray (SBR methods. Compared with the dynamic RCS result with the common interpolation method, the proposed method is consistent with the common method when the targets in the scene are far away from each other and each target is not sheltered by others in the incident direction. When the target group is densely distributed and the shelter effect can not be neglected, the interpolation method is extremely difficult to realize, whereas the proposed method is successful.

  9. 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.

  10. 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

  11. 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.

  12. 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.

  13. 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.

  14. Iterative Reconstruction Methods for Hybrid Inverse Problems in Impedance Tomography

    DEFF Research Database (Denmark)

    Hoffmann, Kristoffer; Knudsen, Kim

    2014-01-01

    For a general formulation of hybrid inverse problems in impedance tomography the Picard and Newton iterative schemes are adapted and four iterative reconstruction algorithms are developed. The general problem formulation includes several existing hybrid imaging modalities such as current density...... impedance imaging, magnetic resonance electrical impedance tomography, and ultrasound modulated electrical impedance tomography, and the unified approach to the reconstruction problem encompasses several algorithms suggested in the literature. The four proposed algorithms are implemented numerically in two...

  15. Method of asymptotic expansions and qualitative analysis of finite-dimensional models in the nonlinear field theory

    International Nuclear Information System (INIS)

    Eleonskij, V.M.; Kulagin, N.E.; Novozhilova, N.S.; Silin, V.P.

    1984-01-01

    The reasons which prevent the existence of periodic in time and self-localised in space solutions of the nonlinear wave equation u=F (u) are determined by the methods of qualitative theory of dynamical systems. The correspondence between the qualitative behaviour of special (separatrix) trajectories in the phase space and asymptotic solutions of the nonlinear wave equation is analysed

  16. Exact asymptotics of probabilities of large deviations for Markov chains: the Laplace method

    Energy Technology Data Exchange (ETDEWEB)

    Fatalov, Vadim R [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

    2011-08-31

    We prove results on exact asymptotics as n{yields}{infinity} for the expectations E{sub a} exp{l_brace}-{theta}{Sigma}{sub k=0}{sup n-1}g(X{sub k}){r_brace} and probabilities P{sub a}{l_brace}(1/n {Sigma}{sub k=0}{sup n-1}g(X{sub k})=}1, is the corresponding random walk on R, g(x) is a positive continuous function satisfying certain conditions, and d>0, {theta}>0, a element of R are fixed numbers. Our results are obtained using a new method which is developed in this paper: the Laplace method for the occupation time of discrete-time Markov chains. For g(x) one can take |x|{sup p}, log (|x|{sup p}+1), p>0, |x| log (|x|+1), or e{sup {alpha}|x|}-1, 0<{alpha}<1/2, x element of R, for example. We give a detailed treatment of the case when g(x)=|x| using Bessel functions to make explicit calculations.

  17. Iterative methods for symmetric ill-conditioned Toeplitz matrices

    Energy Technology Data Exchange (ETDEWEB)

    Huckle, T. [Institut fuer Informatik, Muenchen (Germany)

    1996-12-31

    We consider ill-conditioned symmetric positive definite, Toeplitz systems T{sub n}x = b. If we want to solve such a system iteratively with the conjugate gradient method, we can use band-Toeplitz-preconditioners or Sine-Transform-peconditioners M = S{sub n}{Lambda}S{sub n}, S{sub n} the Sine-Transform-matrix and {Lambda} a diagonal matrix. A Toeplitz matrix T{sub n} = (t{sub i-j)}{sub i}{sup n},{sub j=1} is often related to an underlying function f defined by the coefficients t{sub j}, j = -{infinity},..,-1,0, 1,.., {infinity}. There are four cases, for which we want to determine a preconditioner M: - T{sub n} is related to an underlying function which is given explicitly; - T{sub n} is related to an underlying function that is given by its Fourier coefficients; - T{sub n} is related to an underlying function that is unknown; - T{sub n} is not related to an underlying function. Especially for the first three cases we show how positive definite and effective preconditioners based on the Sine-Transform can be defined for general nonnegative underlying function f. To define M, we evaluate or estimate the values of f at certain positions, and build a Sine-transform matrix with these values as eigenvalues. Then, the spectrum of the preconditioned system is bounded from above and away from zero.

  18. 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.

  19. More on Generalizations and Modifications of Iterative Methods for Solving Large Sparse Indefinite Linear Systems

    Directory of Open Access Journals (Sweden)

    Jen-Yuan Chen

    2014-01-01

    Full Text Available Continuing from the works of Li et al. (2014, Li (2007, and Kincaid et al. (2000, we present more generalizations and modifications of iterative methods for solving large sparse symmetric and nonsymmetric indefinite systems of linear equations. We discuss a variety of iterative methods such as GMRES, MGMRES, MINRES, LQ-MINRES, QR MINRES, MMINRES, MGRES, and others.

  20. Evaluation of Continuation Desire as an Iterative Game Development Method

    DEFF Research Database (Denmark)

    Schoenau-Fog, Henrik; Birke, Alexander; Reng, Lars

    2012-01-01

    When developing a game it is always valuable to use feedback from players in each iteration, in order to plan the design of the next iteration. However, it can be challenging to devise a simple approach to acquiring information about a player's engagement while playing. In this paper we will thus...... concerning a crowd game which is controlled by smartphones and is intended to be played by audiences in cinemas and at venues with large screens. The case study demonstrates how the approach can be used to help improve the desire to continue when developing a game....

  1. 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

  2. Topology Optimization of Constrained Layer Damping on Plates Using Method of Moving Asymptote (MMA Approach

    Directory of Open Access Journals (Sweden)

    Zheng Ling

    2011-01-01

    Full Text Available Damping treatments have been extensively used as a powerful means to damp out structural resonant vibrations. Usually, damping materials are fully covered on the surface of plates. The drawbacks of this conventional treatment are also obvious due to an added mass and excess material consumption. Therefore, it is not always economical and effective from an optimization design view. In this paper, a topology optimization approach is presented to maximize the modal damping ratio of the plate with constrained layer damping treatment. The governing equation of motion of the plate is derived on the basis of energy approach. A finite element model to describe dynamic performances of the plate is developed and used along with an optimization algorithm in order to determine the optimal topologies of constrained layer damping layout on the plate. The damping of visco-elastic layer is modeled by the complex modulus formula. Considering the vibration and energy dissipation mode of the plate with constrained layer damping treatment, damping material density and volume factor are considered as design variable and constraint respectively. Meantime, the modal damping ratio of the plate is assigned as the objective function in the topology optimization approach. The sensitivity of modal damping ratio to design variable is further derived and Method of Moving Asymptote (MMA is adopted to search the optimized topologies of constrained layer damping layout on the plate. Numerical examples are used to demonstrate the effectiveness of the proposed topology optimization approach. The results show that vibration energy dissipation of the plates can be enhanced by the optimal constrained layer damping layout. This optimal technology can be further extended to vibration attenuation of sandwich cylindrical shells which constitute the major building block of many critical structures such as cabins of aircrafts, hulls of submarines and bodies of rockets and missiles as an

  3. Annual Copper Mountain Conferences on Multigrid and Iterative Methods, Copper Mountain, Colorado

    International Nuclear Information System (INIS)

    McCormick, Stephen F.

    2016-01-01

    This project supported the Copper Mountain Conference on Multigrid and Iterative Methods, held from 2007 to 2015, at Copper Mountain, Colorado. The subject of the Copper Mountain Conference Series alternated between Multigrid Methods in odd-numbered years and Iterative Methods in even-numbered years. Begun in 1983, the Series represents an important forum for the exchange of ideas in these two closely related fields. This report describes the Copper Mountain Conference on Multigrid and Iterative Methods, 2007-2015. Information on the conference series is available at http://grandmaster.colorado.edu/~copper/

  4. Annual Copper Mountain Conferences on Multigrid and Iterative Methods, Copper Mountain, Colorado

    Energy Technology Data Exchange (ETDEWEB)

    McCormick, Stephen F. [Front Range Scientific, Inc., Lake City, CO (United States)

    2016-03-25

    This project supported the Copper Mountain Conference on Multigrid and Iterative Methods, held from 2007 to 2015, at Copper Mountain, Colorado. The subject of the Copper Mountain Conference Series alternated between Multigrid Methods in odd-numbered years and Iterative Methods in even-numbered years. Begun in 1983, the Series represents an important forum for the exchange of ideas in these two closely related fields. This report describes the Copper Mountain Conference on Multigrid and Iterative Methods, 2007-2015. Information on the conference series is available at http://grandmaster.colorado.edu/~copper/.

  5. 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.

  6. 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

  7. Asymptotic Eigenstructures

    Science.gov (United States)

    Thompson, P. M.; Stein, G.

    1980-01-01

    The behavior of the closed loop eigenstructure of a linear system with output feedback is analyzed as a single parameter multiplying the feedback gain is varied. An algorithm is presented that computes the asymptotically infinite eigenstructure, and it is shown how a system with high gain, feedback decouples into single input, single output systems. Then a synthesis algorithm is presented which uses full state feedback to achieve a desired asymptotic eigenstructure.

  8. Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems

    Directory of Open Access Journals (Sweden)

    Oskar Cahueñas

    2013-05-01

    Full Text Available We address the issue of approximating the pseudoinverse of the coefficient matrix for dynamically building preconditioning strategies for the numerical solution of large dense linear least-squares problems. The new preconditioning strategies are embedded into simple and well-known iterative schemes that avoid the use of the, usually ill-conditioned, normal equations. We analyze a scheme to approximate the pseudoinverse, based on Schulz iterative method, and also different iterative schemes, based on extensions of Richardson's method, and the conjugate gradient method, that are suitable for preconditioning strategies. We present preliminary numerical results to illustrate the advantages of the proposed schemes.

  9. 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.

  10. Non-iterative method to calculate the periodical distribution of temperature in reactors with thermal regeneration

    International Nuclear Information System (INIS)

    Sanchez de Alsina, O.L.; Scaricabarozzi, R.A.

    1982-01-01

    A matrix non-iterative method to calculate the periodical distribution in reactors with thermal regeneration is presented. In case of exothermic reaction, a source term will be included. A computer code was developed to calculate the final temperature distribution in solids and in the outlet temperatures of the gases. The results obtained from ethane oxidation calculation in air, using the Dietrich kinetic data are presented. This method is more advantageous than iterative methods. (E.G.) [pt

  11. An iterative method for near-field Fresnel region polychromatic phase contrast imaging

    Science.gov (United States)

    Carroll, Aidan J.; van Riessen, Grant A.; Balaur, Eugeniu; Dolbnya, Igor P.; Tran, Giang N.; Peele, Andrew G.

    2017-07-01

    We present an iterative method for polychromatic phase contrast imaging that is suitable for broadband illumination and which allows for the quantitative determination of the thickness of an object given the refractive index of the sample material. Experimental and simulation results suggest the iterative method provides comparable image quality and quantitative object thickness determination when compared to the analytical polychromatic transport of intensity and contrast transfer function methods. The ability of the iterative method to work over a wider range of experimental conditions means the iterative method is a suitable candidate for use with polychromatic illumination and may deliver more utility for laboratory-based x-ray sources, which typically have a broad spectrum.

  12. Asymptotics of Wigner 3nj-symbols with small and large angular momenta: an elementary method

    International Nuclear Information System (INIS)

    Bonzom, Valentin; Fleury, Pierre

    2012-01-01

    Yu and Littlejohn recently studied in (2011 Phys. Rev. A 83 052114 (arXiv:1104.1499)) some asymptotics of Wigner symbols with some small and large angular momenta. They found that in this regime the essential information is captured by the geometry of a tetrahedron, and gave new formulae for 9j-, 12j- and 15j-symbols. We present here an alternative derivation which leads to a simpler formula, based on the use of the Ponzano–Regge formula for the relevant tetrahedron. The approach is generalized to Wigner 3nj-symbols with some large and small angular momenta, where more than one tetrahedron are needed, leading to new asymptotics for Wigner 3nj-symbols. As an illustration, we present 15j-symbols with one, two and four small angular momenta, and give an alternative formula to Yu’s recent 15j-symbol with three small spins. (paper)

  13. An iterative method for nonlinear demiclosed monotone-type operators

    International Nuclear Information System (INIS)

    Chidume, C.E.

    1991-01-01

    It is proved that a well known fixed point iteration scheme which has been used for approximating solutions of certain nonlinear demiclosed monotone-type operator equations in Hilbert spaces remains applicable in real Banach spaces with property (U, α, m+1, m). These Banach spaces include the L p -spaces, p is an element of [2,∞]. An application of our results to the approximation of a solution of a certain linear operator equation in this general setting is also given. (author). 19 refs

  14. Iterative and range test methods for an inverse source problem for acoustic waves

    International Nuclear Information System (INIS)

    Alves, Carlos; Kress, Rainer; Serranho, Pedro

    2009-01-01

    We propose two methods for solving an inverse source problem for time-harmonic acoustic waves. Based on the reciprocity gap principle a nonlinear equation is presented for the locations and intensities of the point sources that can be solved via Newton iterations. To provide an initial guess for this iteration we suggest a range test algorithm for approximating the source locations. We give a mathematical foundation for the range test and exhibit its feasibility in connection with the iteration method by some numerical examples

  15. Double folding model of nucleus-nucleus potential: formulae, iteration method and computer code

    International Nuclear Information System (INIS)

    Luk'yanov, K.V.

    2008-01-01

    Method of construction of the nucleus-nucleus double folding potential is described. Iteration procedure for the corresponding integral equation is presented. Computer code and numerical results are presented

  16. The Asymptotic Behavior of Particle Size Distribution Undergoing Brownian Coagulation Based on the Spline-Based Method and TEMOM Model

    Directory of Open Access Journals (Sweden)

    Qing He

    2018-01-01

    Full Text Available In this paper, the particle size distribution is reconstructed using finite moments based on a converted spline-based method, in which the number of linear system of equations to be solved reduced from 4m × 4m to (m + 3 × (m + 3 for (m + 1 nodes by using cubic spline compared to the original method. The results are verified by comparing with the reference firstly. Then coupling with the Taylor-series expansion moment method, the evolution of particle size distribution undergoing Brownian coagulation and its asymptotic behavior are investigated.

  17. Extended asymptotic functions - some examples

    International Nuclear Information System (INIS)

    Todorov, T.D.

    1981-01-01

    Several examples of extended asymptotic functions of two variables are given. This type of asymptotic functions has been introduced as an extension of continuous ordinary functions. The presented examples are realizations of some Schwartz distributions delta(x), THETA(x), P(1/xsup(n)) and can be multiplied in the class of the asymptotic functions as opposed to the theory of Schwartz distributions. The examples illustrate the method of construction of extended asymptotic functions similar to the distributions. The set formed by the extended asymptotic functions is also considered. It is shown, that this set is not closed with respect to addition and multiplication

  18. 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.

  19. Iterative methods for overlap and twisted mass fermions

    International Nuclear Information System (INIS)

    Chiarappa, T.; Jansen, K.; Shindler, A.; Wetzorke, I.; Scorzato, L.; Urbach, C.; Wenger, U.

    2006-09-01

    We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally) twisted mass fermions. The comparison of both formulations of lattice QCD is performed at four fixed values of the pion mass between 230 MeV and 720 MeV. For overlap fermions we address adaptive precision and low mode preconditioning while for twisted mass fermions we discuss even/odd preconditioning. Taking the best available algorithms in each case we find that calculations with the overlap operator are by a factor of 30-120 more expensive than with the twisted mass operator. (orig.)

  20. Iterative methods for overlap and twisted mass fermions

    Energy Technology Data Exchange (ETDEWEB)

    Chiarappa, T. [Univ. di Milano Bicocca (Italy); Jansen, K.; Shindler, A.; Wetzorke, I. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Nagai, K.I. [Wuppertal Univ. (Gesamthochschule) (Germany). Fachbereich Physik; Papinutto, M. [INFN Sezione di Roma Tre, Rome (Italy); Scorzato, L. [European Centre for Theoretical Studies in Nuclear Physics and Related Areas (ECT), Villazzano (Italy); Urbach, C. [Liverpool Univ. (United Kingdom). Dept. of Mathematical Sciences; Wenger, U. [ETH Zuerich (Switzerland). Inst. fuer Theoretische Physik

    2006-09-15

    We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally) twisted mass fermions. The comparison of both formulations of lattice QCD is performed at four fixed values of the pion mass between 230 MeV and 720 MeV. For overlap fermions we address adaptive precision and low mode preconditioning while for twisted mass fermions we discuss even/odd preconditioning. Taking the best available algorithms in each case we find that calculations with the overlap operator are by a factor of 30-120 more expensive than with the twisted mass operator. (orig.)

  1. Iterative methods for distributed parameter estimation in parabolic PDE

    Energy Technology Data Exchange (ETDEWEB)

    Vogel, C.R. [Montana State Univ., Bozeman, MT (United States); Wade, J.G. [Bowling Green State Univ., OH (United States)

    1994-12-31

    The goal of the work presented is the development of effective iterative techniques for large-scale inverse or parameter estimation problems. In this extended abstract, a detailed description of the mathematical framework in which the authors view these problem is presented, followed by an outline of the ideas and algorithms developed. Distributed parameter estimation problems often arise in mathematical modeling with partial differential equations. They can be viewed as inverse problems; the `forward problem` is that of using the fully specified model to predict the behavior of the system. The inverse or parameter estimation problem is: given the form of the model and some observed data from the system being modeled, determine the unknown parameters of the model. These problems are of great practical and mathematical interest, and the development of efficient computational algorithms is an active area of study.

  2. Design and fabrication methods of FW/blanket and vessel for ITER-FEAT

    Energy Technology Data Exchange (ETDEWEB)

    Ioki, K. E-mail: iokik@itereu.de; Barabash, V.; Cardella, A.; Elio, F.; Kalinin, G.; Miki, N.; Onozuka, M.; Osaki, T.; Rozov, V.; Sannazzaro, G.; Utin, Y.; Yamada, M.; Yoshimura, H

    2001-11-01

    Design has progressed on the vacuum vessel and FW/blanket for ITER-FEAT. The basic functions and structures are the same as for the 1998 ITER design. Detailed blanket module designs of the radially cooled shield block with flat separable FW panels have been developed. The ITER blanket R and D program covers different materials and fabrication methods in order make a final selection based on the results. Separate manifolds have been designed and analysed for the blanket cooling. The vessel design with flexible support housings has been improved to minimise the number of continuous poloidal ribs. Most of the R and D performed so far during EDA are still applicable.

  3. Design and fabrication methods of FW/blanket and vessel for ITER-FEAT

    International Nuclear Information System (INIS)

    Ioki, K.; Barabash, V.; Cardella, A.; Elio, F.; Kalinin, G.; Miki, N.; Onozuka, M.; Osaki, T.; Rozov, V.; Sannazzaro, G.; Utin, Y.; Yamada, M.; Yoshimura, H.

    2001-01-01

    Design has progressed on the vacuum vessel and FW/blanket for ITER-FEAT. The basic functions and structures are the same as for the 1998 ITER design. Detailed blanket module designs of the radially cooled shield block with flat separable FW panels have been developed. The ITER blanket R and D program covers different materials and fabrication methods in order make a final selection based on the results. Separate manifolds have been designed and analysed for the blanket cooling. The vessel design with flexible support housings has been improved to minimise the number of continuous poloidal ribs. Most of the R and D performed so far during EDA are still applicable

  4. Application of the perturbation iteration method to boundary layer type problems.

    Science.gov (United States)

    Pakdemirli, Mehmet

    2016-01-01

    The recently developed perturbation iteration method is applied to boundary layer type singular problems for the first time. As a preliminary work on the topic, the simplest algorithm of PIA(1,1) is employed in the calculations. Linear and nonlinear problems are solved to outline the basic ideas of the new solution technique. The inner and outer solutions are determined with the iteration algorithm and matched to construct a composite expansion valid within all parts of the domain. The solutions are contrasted with the available exact or numerical solutions. It is shown that the perturbation-iteration algorithm can be effectively used for solving boundary layer type problems.

  5. Iterative resonance self-shielding methods using resonance integral table in heterogeneous transport lattice calculations

    International Nuclear Information System (INIS)

    Hong, Ser Gi; Kim, Kang-Seog

    2011-01-01

    This paper describes the iteration methods using resonance integral tables to estimate the effective resonance cross sections in heterogeneous transport lattice calculations. Basically, these methods have been devised to reduce an effort to convert resonance integral table into subgroup data to be used in the physical subgroup method. Since these methods do not use subgroup data but only use resonance integral tables directly, these methods do not include an error in converting resonance integral into subgroup data. The effective resonance cross sections are estimated iteratively for each resonance nuclide through the heterogeneous fixed source calculations for the whole problem domain to obtain the background cross sections. These methods have been implemented in the transport lattice code KARMA which uses the method of characteristics (MOC) to solve the transport equation. The computational results show that these iteration methods are quite promising in the practical transport lattice calculations.

  6. 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.

  7. Multiscale optical simulation settings: challenging applications handled with an iterative ray-tracing FDTD interface method.

    Science.gov (United States)

    Leiner, Claude; Nemitz, Wolfgang; Schweitzer, Susanne; Kuna, Ladislav; Wenzl, Franz P; Hartmann, Paul; Satzinger, Valentin; Sommer, Christian

    2016-03-20

    We show that with an appropriate combination of two optical simulation techniques-classical ray-tracing and the finite difference time domain method-an optical device containing multiple diffractive and refractive optical elements can be accurately simulated in an iterative simulation approach. We compare the simulation results with experimental measurements of the device to discuss the applicability and accuracy of our iterative simulation procedure.

  8. 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.

  9. Analyzing the Impacts of Alternated Number of Iterations in Multiple Imputation Method on Explanatory Factor Analysis

    Directory of Open Access Journals (Sweden)

    Duygu KOÇAK

    2017-11-01

    Full Text Available The study aims to identify the effects of iteration numbers used in multiple iteration method, one of the methods used to cope with missing values, on the results of factor analysis. With this aim, artificial datasets of different sample sizes were created. Missing values at random and missing values at complete random were created in various ratios by deleting data. For the data in random missing values, a second variable was iterated at ordinal scale level and datasets with different ratios of missing values were obtained based on the levels of this variable. The data were generated using “psych” program in R software, while “dplyr” program was used to create codes that would delete values according to predetermined conditions of missing value mechanism. Different datasets were generated by applying different iteration numbers. Explanatory factor analysis was conducted on the datasets completed and the factors and total explained variances are presented. These values were first evaluated based on the number of factors and total variance explained of the complete datasets. The results indicate that multiple iteration method yields a better performance in cases of missing values at random compared to datasets with missing values at complete random. Also, it was found that increasing the number of iterations in both missing value datasets decreases the difference in the results obtained from complete datasets.

  10. Contribution to regularizing iterative method development for attenuation correction in gamma emission tomography

    International Nuclear Information System (INIS)

    Cao, A.

    1981-07-01

    This study is concerned with the transverse axial gamma emission tomography. The problem of self-attenuation of radiations in biologic tissues is raised. The regularizing iterative method is developed, as a reconstruction method of 3 dimensional images. The different steps from acquisition to results, necessary to its application, are described. Organigrams relative to each step are explained. Comparison notion between two reconstruction methods is introduced. Some methods used for the comparison or to bring about the characteristics of a reconstruction technique are defined. The studies realized to test the regularizing iterative method are presented and results are analyzed [fr

  11. Frequency sweep of the field scattered by an inhomogeneous structure using method of moments and asymptotic waveform evaluation

    DEFF Research Database (Denmark)

    Troelsen, Jens; Meincke, Peter; Breinbjerg, Olav

    2000-01-01

    into account. To the knowledge of the authors the AWE technique has not previously been applied to a MoM solution based on this kind of integral equation. It is the purpose of this paper to investigate the use of the AWE technique as a tool to obtain a fast frequency sweep of the field scattered......In many radar applications it is necessary to determine the scattering from an object over a wide frequency band. The asymptotic waveform evaluation (AWE), which is a moment matching (MM) technique, constitutes a method to this end. In general, MM techniques provide a reduced-order model...

  12. Direct deterministic method for neutronics analysis and computation of asymptotic burnup distribution in a recirculating pebble-bed reactor

    International Nuclear Information System (INIS)

    Terry, W.K.; Gougar, H.D.; Ougouag, A.M.

    2002-01-01

    A new deterministic method has been developed for the neutronics analysis of a pebble-bed reactor (PBR). The method accounts for the flow of pebbles explicitly and couples the flow to the neutronics. The method allows modeling of once-through cycles as well as cycles in which pebbles are recirculated through the core an arbitrary number of times. This new work is distinguished from older methods by the systematically semi-analytical approach it takes. In particular, whereas older methods use the finite-difference approach (or an equivalent one) for the discretization and the solution of the burnup equation, the present work integrates the relevant differential equation analytically in discrete and complementary sub-domains of the reactor. Like some of the finite-difference codes, the new method obtains the asymptotic fuel-loading pattern directly, without modeling any intermediate loading pattern. This is a significant advantage for the design and optimization of the asymptotic fuel-loading pattern. The new method is capable of modeling directly both the once-through-then-out fuel cycle and the pebble recirculating fuel cycle. Although it currently includes a finite-difference neutronics solver, the new method has been implemented into a modular code that incorporates the framework for the future coupling to an efficient solver such as a nodal method and to modern cross section preparation capabilities. In its current state, the deterministic method presented here is capable of quick and efficient design and optimization calculations for the in-core PBR fuel cycle. The method can also be used as a practical 'scoping' tool. It could, for example, be applied to determine the potential of the PBR for resisting nuclear-weapons proliferation and to optimize proliferation-resistant features. However, the purpose of this paper is to show that the method itself is viable. Refinements to the code are under way, with the objective of producing a powerful reactor physics

  13. Variational Iteration Method for Fifth-Order Boundary Value Problems Using He's Polynomials

    Directory of Open Access Journals (Sweden)

    Muhammad Aslam Noor

    2008-01-01

    Full Text Available We apply the variational iteration method using He's polynomials (VIMHP for solving the fifth-order boundary value problems. The proposed method is an elegant combination of variational iteration and the homotopy perturbation methods and is mainly due to Ghorbani (2007. The suggested algorithm is quite efficient and is practically well suited for use in these problems. The proposed iterative scheme finds the solution without any discritization, linearization, or restrictive assumptions. Several examples are given to verify the reliability and efficiency of the method. The fact that the proposed technique solves nonlinear problems without using Adomian's polynomials can be considered as a clear advantage of this algorithm over the decomposition method.

  14. Adaptive Mesh Iteration Method for Trajectory Optimization Based on Hermite-Pseudospectral Direct Transcription

    Directory of Open Access Journals (Sweden)

    Humin Lei

    2017-01-01

    Full Text Available An adaptive mesh iteration method based on Hermite-Pseudospectral is described for trajectory optimization. The method uses the Legendre-Gauss-Lobatto points as interpolation points; then the state equations are approximated by Hermite interpolating polynomials. The method allows for changes in both number of mesh points and the number of mesh intervals and produces significantly smaller mesh sizes with a higher accuracy tolerance solution. The derived relative error estimate is then used to trade the number of mesh points with the number of mesh intervals. The adaptive mesh iteration method is applied successfully to the examples of trajectory optimization of Maneuverable Reentry Research Vehicle, and the simulation experiment results show that the adaptive mesh iteration method has many advantages.

  15. Solution of Nonlinear Partial Differential Equations by New Laplace Variational Iteration Method

    Directory of Open Access Journals (Sweden)

    Eman M. A. Hilal

    2014-01-01

    Full Text Available The aim of this study is to give a good strategy for solving some linear and nonlinear partial differential equations in engineering and physics fields, by combining Laplace transform and the modified variational iteration method. This method is based on the variational iteration method, Laplace transforms, and convolution integral, introducing an alternative Laplace correction functional and expressing the integral as a convolution. Some examples in physical engineering are provided to illustrate the simplicity and reliability of this method. The solutions of these examples are contingent only on the initial conditions.

  16. Methods and Algorithms for Approximating the Gamma Function and Related Functions. A survey. Part I: Asymptotic Series

    Directory of Open Access Journals (Sweden)

    Cristinel Mortici

    2015-01-01

    Full Text Available In this survey we present our recent results on analysis of gamma function and related functions. The results obtained are in the theory of asymptotic analysis, approximation of gamma and polygamma functions, or in the theory of completely monotonic functions. The motivation of this first part is the work of C. Mortici [Product Approximations via Asymptotic Integration Amer. Math. Monthly 117 (2010 434-441] where a simple strategy for constructing asymptotic series is presented. The classical asymptotic series associated to Stirling, Wallis, Glaisher-Kinkelin are rediscovered. In the second section we discuss some new inequalities related to Landau constants and we establish some asymptotic formulas.

  17. Analysis of Diffusion Problems using Homotopy Perturbation and Variational Iteration Methods

    DEFF Research Database (Denmark)

    Barari, Amin; Poor, A. Tahmasebi; Jorjani, A.

    2010-01-01

    In this paper, variational iteration method and homotopy perturbation method are applied to different forms of diffusion equation. The diffusion equations have found wide applications in heat transfer problems, theory of consolidation and many other problems in engineering. The methods proposed...

  18. 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

  19. Application of He's variational iteration method to the fifth-order boundary value problems

    International Nuclear Information System (INIS)

    Shen, S

    2008-01-01

    Variational iteration method is introduced to solve the fifth-order boundary value problems. This method provides an efficient approach to solve this type of problems without discretization and the computation of the Adomian polynomials. Numerical results demonstrate that this method is a promising and powerful tool for solving the fifth-order boundary value problems

  20. A Comparison of Iterative 2D-3D Pose Estimation Methods for Real-Time Applications

    DEFF Research Database (Denmark)

    Grest, Daniel; Krüger, Volker; Petersen, Thomas

    2009-01-01

    This work compares iterative 2D-3D Pose Estimation methods for use in real-time applications. The compared methods are available for public as C++ code. One method is part of the openCV library, namely POSIT. Because POSIT is not applicable for planar 3Dpoint congurations, we include the planar P...

  1. Asymptotic freedom

    International Nuclear Information System (INIS)

    Meyer, P.

    1978-01-01

    After having established the renormalization group equations and the possibilities of fixed points for the effective coupling constants the non abelian gauge theories are shown to have the property of asymptotic freedom. These results are applied to the colour gauge group of the strong interactions of quarks and gluons. The behavior of the moments of the structure functions of the deep inelastic scattering of leptons on nucleons (scaling and its logarithmic violations) is then deduced with using the Wilson's operator product expansion [fr

  2. Iterative and variational homogenization methods for filled elastomers

    Science.gov (United States)

    Goudarzi, Taha

    Elastomeric composites have increasingly proved invaluable in commercial technological applications due to their unique mechanical properties, especially their ability to undergo large reversible deformation in response to a variety of stimuli (e.g., mechanical forces, electric and magnetic fields, changes in temperature). Modern advances in organic materials science have revealed that elastomeric composites hold also tremendous potential to enable new high-end technologies, especially as the next generation of sensors and actuators featured by their low cost together with their biocompatibility, and processability into arbitrary shapes. This potential calls for an in-depth investigation of the macroscopic mechanical/physical behavior of elastomeric composites directly in terms of their microscopic behavior with the objective of creating the knowledge base needed to guide their bottom-up design. The purpose of this thesis is to generate a mathematical framework to describe, explain, and predict the macroscopic nonlinear elastic behavior of filled elastomers, arguably the most prominent class of elastomeric composites, directly in terms of the behavior of their constituents --- i.e., the elastomeric matrix and the filler particles --- and their microstructure --- i.e., the content, size, shape, and spatial distribution of the filler particles. This will be accomplished via a combination of novel iterative and variational homogenization techniques capable of accounting for interphasial phenomena and finite deformations. Exact and approximate analytical solutions for the fundamental nonlinear elastic response of dilute suspensions of rigid spherical particles (either firmly bonded or bonded through finite size interphases) in Gaussian rubber are first generated. These results are in turn utilized to construct approximate solutions for the nonlinear elastic response of non-Gaussian elastomers filled with a random distribution of rigid particles (again, either firmly

  3. 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.

  4. Iterative solution of the inverse Cauchy problem for an elliptic equation by the conjugate gradient method

    Science.gov (United States)

    Vasil'ev, V. I.; Kardashevsky, A. M.; Popov, V. V.; Prokopev, G. A.

    2017-10-01

    This article presents results of computational experiment carried out using a finite-difference method for solving the inverse Cauchy problem for a two-dimensional elliptic equation. The computational algorithm involves an iterative determination of the missing boundary condition from the override condition using the conjugate gradient method. The results of calculations are carried out on the examples with exact solutions as well as at specifying an additional condition with random errors are presented. Results showed a high efficiency of the iterative method of conjugate gradients for numerical solution

  5. 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.

  6. Iterative acceleration methods for Monte Carlo and deterministic criticality calculations

    International Nuclear Information System (INIS)

    Urbatsch, T.J.

    1995-11-01

    If you have ever given up on a nuclear criticality calculation and terminated it because it took so long to converge, you might find this thesis of interest. The author develops three methods for improving the fission source convergence in nuclear criticality calculations for physical systems with high dominance ratios for which convergence is slow. The Fission Matrix Acceleration Method and the Fission Diffusion Synthetic Acceleration (FDSA) Method are acceleration methods that speed fission source convergence for both Monte Carlo and deterministic methods. The third method is a hybrid Monte Carlo method that also converges for difficult problems where the unaccelerated Monte Carlo method fails. The author tested the feasibility of all three methods in a test bed consisting of idealized problems. He has successfully accelerated fission source convergence in both deterministic and Monte Carlo criticality calculations. By filtering statistical noise, he has incorporated deterministic attributes into the Monte Carlo calculations in order to speed their source convergence. He has used both the fission matrix and a diffusion approximation to perform unbiased accelerations. The Fission Matrix Acceleration method has been implemented in the production code MCNP and successfully applied to a real problem. When the unaccelerated calculations are unable to converge to the correct solution, they cannot be accelerated in an unbiased fashion. A Hybrid Monte Carlo method weds Monte Carlo and a modified diffusion calculation to overcome these deficiencies. The Hybrid method additionally possesses reduced statistical errors

  7. Iterative acceleration methods for Monte Carlo and deterministic criticality calculations

    Energy Technology Data Exchange (ETDEWEB)

    Urbatsch, T.J.

    1995-11-01

    If you have ever given up on a nuclear criticality calculation and terminated it because it took so long to converge, you might find this thesis of interest. The author develops three methods for improving the fission source convergence in nuclear criticality calculations for physical systems with high dominance ratios for which convergence is slow. The Fission Matrix Acceleration Method and the Fission Diffusion Synthetic Acceleration (FDSA) Method are acceleration methods that speed fission source convergence for both Monte Carlo and deterministic methods. The third method is a hybrid Monte Carlo method that also converges for difficult problems where the unaccelerated Monte Carlo method fails. The author tested the feasibility of all three methods in a test bed consisting of idealized problems. He has successfully accelerated fission source convergence in both deterministic and Monte Carlo criticality calculations. By filtering statistical noise, he has incorporated deterministic attributes into the Monte Carlo calculations in order to speed their source convergence. He has used both the fission matrix and a diffusion approximation to perform unbiased accelerations. The Fission Matrix Acceleration method has been implemented in the production code MCNP and successfully applied to a real problem. When the unaccelerated calculations are unable to converge to the correct solution, they cannot be accelerated in an unbiased fashion. A Hybrid Monte Carlo method weds Monte Carlo and a modified diffusion calculation to overcome these deficiencies. The Hybrid method additionally possesses reduced statistical errors.

  8. An iterative method for the canard explosion in general planar systems

    DEFF Research Database (Denmark)

    Brøns, Morten

    2012-01-01

    The canard explosion is the change of amplitude and period of a limit cycle born in a Hopf bifurcation in a very narrow parameter interval. The phenomenon is well understood in singular perturbation problems where a small parameter controls the slow/fast dynamics. However, canard explosions are a...... equation, showing that the asymptotics of the method is correct, and on a templator model for a self-replicating system....

  9. Iterative approach as alternative to S-matrix in modal methods

    Science.gov (United States)

    Semenikhin, Igor; Zanuccoli, Mauro

    2014-12-01

    The continuously increasing complexity of opto-electronic devices and the rising demands of simulation accuracy lead to the need of solving very large systems of linear equations making iterative methods promising and attractive from the computational point of view with respect to direct methods. In particular, iterative approach potentially enables the reduction of required computational time to solve Maxwell's equations by Eigenmode Expansion algorithms. Regardless of the particular eigenmodes finding method used, the expansion coefficients are computed as a rule by scattering matrix (S-matrix) approach or similar techniques requiring order of M3 operations. In this work we consider alternatives to the S-matrix technique which are based on pure iterative or mixed direct-iterative approaches. The possibility to diminish the impact of M3 -order calculations to overall time and in some cases even to reduce the number of arithmetic operations to M2 by applying iterative techniques are discussed. Numerical results are illustrated to discuss validity and potentiality of the proposed approaches.

  10. A non-iterative method for fitting decay curves with background

    International Nuclear Information System (INIS)

    Mukoyama, T.

    1982-01-01

    A non-iterative method for fitting a decay curve with background is presented. The sum of an exponential function and a constant term is linearized by the use of the difference equation and parameters are determined by the standard linear least-squares fitting. The validity of the present method has been tested against pseudo-experimental data. (orig.)

  11. An iterative method for the analysis of Cherenkov rings in the HERA-B RICH

    International Nuclear Information System (INIS)

    Staric, M.; Krizan, P.

    1999-01-01

    A new method is presented for the analysis of data recorded with a Ring Imaging Cherenkov (RICH) counter. The method, an iterative sorting of hits on the photon detector, is particularly useful for events where rings overlap considerably. The algorithm was tested on simulated data for the HERA-B experiment

  12. Iterative Method of Regularization with Application of Advanced Technique for Detection of Contours

    International Nuclear Information System (INIS)

    Niedziela, T.; Stankiewicz, A.

    2000-01-01

    This paper proposes a novel iterative method of regularization with application of an advanced technique for detection of contours. To eliminate noises, the properties of convolution of functions are utilized. The method can be accomplished in a simple neural cellular network, which creates the possibility of extraction of contours by automatic image recognition equipment. (author)

  13. A study on linear and nonlinear Schrodinger equations by the variational iteration method

    International Nuclear Information System (INIS)

    Wazwaz, Abdul-Majid

    2008-01-01

    In this work, we introduce a framework to obtain exact solutions to linear and nonlinear Schrodinger equations. The He's variational iteration method (VIM) is used for analytic treatment of these equations. Numerical examples are tested to show the pertinent features of this method

  14. Modified variational iteration method for an El Niño Southern Oscillation delayed oscillator

    International Nuclear Information System (INIS)

    Cao Xiao-Qun; Song Jun-Qiang; Zhu Xiao-Qian; Zhang Li-Lun; Zhang Wei-Min; Zhao Jun

    2012-01-01

    This paper studies a delayed air—sea coupled oscillator describing the physical mechanism of El Niño Southern Oscillation. The approximate expansions of the delayed differential equation's solution are obtained successfully by the modified variational iteration method. The numerical results illustrate the effectiveness and correctness of the method by comparing with the exact solution of the reduced model. (general)

  15. An iterated Radau method for time-dependent PDE's

    NARCIS (Netherlands)

    S. Pérez-Rodríguez; S. González-Pinto; B.P. Sommeijer (Ben)

    2008-01-01

    htmlabstractThis paper is concerned with the time integration of semi-discretized, multi-dimensional PDEs of advection-diffusion-reaction type. To cope with the stiffness of these ODEs, an implicit method has been selected, viz., the two-stage, third-order Radau IIA method. The main topic of this

  16. Comparison between the Variational Iteration Method and the Homotopy Perturbation Method for the Sturm-Liouville Differential Equation

    Directory of Open Access Journals (Sweden)

    R. Darzi

    2010-01-01

    Full Text Available We applied the variational iteration method and the homotopy perturbation method to solve Sturm-Liouville eigenvalue and boundary value problems. The main advantage of these methods is the flexibility to give approximate and exact solutions to both linear and nonlinear problems without linearization or discretization. The results show that both methods are simple and effective.

  17. Comparison between the Variational Iteration Method and the Homotopy Perturbation Method for the Sturm-Liouville Differential Equation

    OpenAIRE

    Darzi R; Neamaty A

    2010-01-01

    We applied the variational iteration method and the homotopy perturbation method to solve Sturm-Liouville eigenvalue and boundary value problems. The main advantage of these methods is the flexibility to give approximate and exact solutions to both linear and nonlinear problems without linearization or discretization. The results show that both methods are simple and effective.

  18. 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)

  19. Equation level matching: An extension of the method of matched asymptotic expansion for problems of wave propagation

    Science.gov (United States)

    Faria, Luiz; Rosales, Rodolfo

    2017-11-01

    We introduce an alternative to the method of matched asymptotic expansions. In the ``traditional'' implementation, approximate solutions, valid in different (but overlapping) regions are matched by using ``intermediate'' variables. Here we propose to match at the level of the equations involved, via a ``uniform expansion'' whose equations enfold those of the approximations to be matched. This has the advantage that one does not need to explicitly solve the asymptotic equations to do the matching, which can be quite impossible for some problems. In addition, it allows matching to proceed in certain wave situations where the traditional approach fails because the time behaviors differ (e.g., one of the expansions does not include dissipation). On the other hand, this approach does not provide the fairly explicit approximations resulting from standard matching. In fact, this is not even its aim, which to produce the ``simplest'' set of equations that capture the behavior. Ruben Rosales work was partially supported by NSF Grants DMS-1614043 and DMS-1719637.

  20. The methods for generating tomographic images using transmition, emission and nuclear magnetic resonance techniques. II. Fourier method and iterative methods

    International Nuclear Information System (INIS)

    Ursu, I.; Demco, D.E.; Gligor, T.D.; Pop, G.; Dollinger, R.

    1987-01-01

    In a wide variety of applications it is necessary to infer the structure of a multidimensional object from a set of its projections. Computed tomography is at present largely extended in the medical field, but the industrial application may ultimately far exceed its medical applications. Two techniques for reconstructing objects from their projections are presented: Fourier methods and iterative techniques. The paper also contains a brief comparative study of the reconstruction algorithms. (authors)

  1. 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.

  2. Plasma flow to a surface using the iterative Monte Carlo method

    International Nuclear Information System (INIS)

    Pitcher, C.S.

    1994-01-01

    The iterative Monte Carlo (IMC) method is applied to a number of one-dimensional plasma flow problems, which encompass a wide range of conditions typical of those present in the boundary of magnetic fusion devices. The kinetic IMC method of solving plasma flow to a surface consists of launching and following particles within a grid of 'bins' into which weights are left according to the time a particle spends within a bin. The density and potential distributions within the plasma are iterated until the final solution is arrived at. The IMC results are compared with analytical treatments of these problems and, in general, good agreement is obtained. (author)

  3. A novel EMD selecting thresholding method based on multiple iteration for denoising LIDAR signal

    Science.gov (United States)

    Li, Meng; Jiang, Li-hui; Xiong, Xing-long

    2015-06-01

    Empirical mode decomposition (EMD) approach has been believed to be potentially useful for processing the nonlinear and non-stationary LIDAR signals. To shed further light on its performance, we proposed the EMD selecting thresholding method based on multiple iteration, which essentially acts as a development of EMD interval thresholding (EMD-IT), and randomly alters the samples of noisy parts of all the corrupted intrinsic mode functions to generate a better effect of iteration. Simulations on both synthetic signals and LIDAR signals from real world support this method.

  4. Domain decomposition methods and deflated Krylov subspace iterations

    NARCIS (Netherlands)

    Nabben, R.; Vuik, C.

    2006-01-01

    The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are fast and successful preconditioners within domain decomposition methods for solving partial differential equations. For certain elliptic problems these preconditioners lead to condition numbers which

  5. Chatter suppression methods of a robot machine for ITER vacuum vessel assembly and maintenance

    International Nuclear Information System (INIS)

    Wu, Huapeng; Wang, Yongbo; Li, Ming; Al-Saedi, Mazin; Handroos, Heikki

    2014-01-01

    Highlights: •A redundant 10-DOF serial-parallel hybrid robot for ITER assembly and maintains is presented. •A dynamic model of the robot is developed. •A feedback and feedforward controller is presented to suppress machining vibration of the robot. -- Abstract: In the process of assembly and maintenance of ITER vacuum vessel (ITER VV), various machining tasks including threading, milling, welding-defects cutting and flexible hose boring are required to be performed from inside of ITER VV by on-site machining tools. Robot machine is a promising option for these tasks, but great chatter (machine vibration) would happen in the machining process. The chatter vibration will deteriorate the robot accuracy and surface quality, and even cause some damages on the end-effector tools and the robot structure itself. This paper introduces two vibration control methods, one is passive and another is active vibration control. For the passive vibration control, a parallel mechanism is presented to increase the stiffness of robot machine; for the active vibration control, a hybrid control method combining feedforward controller and nonlinear feedback controller is introduced for chatter suppression. A dynamic model and its chatter vibration phenomena of a hybrid robot is demonstrated. Simulation results are given based on the proposed hybrid robot machine which is developed for the ITER VV assembly and maintenance

  6. Chatter suppression methods of a robot machine for ITER vacuum vessel assembly and maintenance

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Huapeng; Wang, Yongbo, E-mail: yongbo.wang@lut.fi; Li, Ming; Al-Saedi, Mazin; Handroos, Heikki

    2014-10-15

    Highlights: •A redundant 10-DOF serial-parallel hybrid robot for ITER assembly and maintains is presented. •A dynamic model of the robot is developed. •A feedback and feedforward controller is presented to suppress machining vibration of the robot. -- Abstract: In the process of assembly and maintenance of ITER vacuum vessel (ITER VV), various machining tasks including threading, milling, welding-defects cutting and flexible hose boring are required to be performed from inside of ITER VV by on-site machining tools. Robot machine is a promising option for these tasks, but great chatter (machine vibration) would happen in the machining process. The chatter vibration will deteriorate the robot accuracy and surface quality, and even cause some damages on the end-effector tools and the robot structure itself. This paper introduces two vibration control methods, one is passive and another is active vibration control. For the passive vibration control, a parallel mechanism is presented to increase the stiffness of robot machine; for the active vibration control, a hybrid control method combining feedforward controller and nonlinear feedback controller is introduced for chatter suppression. A dynamic model and its chatter vibration phenomena of a hybrid robot is demonstrated. Simulation results are given based on the proposed hybrid robot machine which is developed for the ITER VV assembly and maintenance.

  7. 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.

  8. An asymptotic-preserving stochastic Galerkin method for the radiative heat transfer equations with random inputs and diffusive scalings

    Energy Technology Data Exchange (ETDEWEB)

    Jin, Shi, E-mail: sjin@wisc.edu [Department of Mathematics, University of Wisconsin-Madison, Madison, WI 53706 (United States); Institute of Natural Sciences, Department of Mathematics, MOE-LSEC and SHL-MAC, Shanghai Jiao Tong University, Shanghai 200240 (China); Lu, Hanqing, E-mail: hanqing@math.wisc.edu [Department of Mathematics, University of Wisconsin-Madison, Madison, WI 53706 (United States)

    2017-04-01

    In this paper, we develop an Asymptotic-Preserving (AP) stochastic Galerkin scheme for the radiative heat transfer equations with random inputs and diffusive scalings. In this problem the random inputs arise due to uncertainties in cross section, initial data or boundary data. We use the generalized polynomial chaos based stochastic Galerkin (gPC-SG) method, which is combined with the micro–macro decomposition based deterministic AP framework in order to handle efficiently the diffusive regime. For linearized problem we prove the regularity of the solution in the random space and consequently the spectral accuracy of the gPC-SG method. We also prove the uniform (in the mean free path) linear stability for the space-time discretizations. Several numerical tests are presented to show the efficiency and accuracy of proposed scheme, especially in the diffusive regime.

  9. Iterative methods for compressible Navier-Stokes and Euler equations

    Energy Technology Data Exchange (ETDEWEB)

    Tang, W.P.; Forsyth, P.A.

    1996-12-31

    This workshop will focus on methods for solution of compressible Navier-Stokes and Euler equations. In particular, attention will be focused on the interaction between the methods used to solve the non-linear algebraic equations (e.g. full Newton or first order Jacobian) and the resulting large sparse systems. Various types of block and incomplete LU factorization will be discussed, as well as stability issues, and the use of Newton-Krylov methods. These techniques will be demonstrated on a variety of model transonic and supersonic airfoil problems. Applications to industrial CFD problems will also be presented. Experience with the use of C++ for solution of large scale problems will also be discussed. The format for this workshop will be four fifteen minute talks, followed by a roundtable discussion.

  10. Deflation of eigenvalues for iterative methods in lattice QCD

    International Nuclear Information System (INIS)

    Darnell, Dean; Morgan, Ronald B.; Wilcox, Walter

    2004-01-01

    Work on generalizing the deflated, restarted GMRES algorithm, useful in lattice studies using stochastic noise methods, is reported. We first show how the multi-mass extension of deflated GMRES can be implemented. We then give a deflated GMRES method that can be used on multiple right-hand sides of Aχ = b in an efficient manner. We also discuss and give numerical results on the possibilty of combining deflated GMRES for the first right hand side with a deflated BiCGStab algorithm for the subsequent right hand sides

  11. An iterative method to invert the LTSn matrix

    Energy Technology Data Exchange (ETDEWEB)

    Cardona, A.V.; Vilhena, M.T. de [UFRGS, Porto Alegre (Brazil)

    1996-12-31

    Recently Vilhena and Barichello proposed the LTSn method to solve, analytically, the Discrete Ordinates Problem (Sn problem) in transport theory. The main feature of this method consist in the application of the Laplace transform to the set of Sn equations and solve the resulting algebraic system for the transport flux. Barichello solve the linear system containing the parameter s applying the definition of matrix invertion exploiting the structure of the LTSn matrix. In this work, it is proposed a new scheme to invert the LTSn matrix, decomposing it in blocks and recursively inverting this blocks.

  12. The iterative shrinkage method for impulsive noise reduction from images

    International Nuclear Information System (INIS)

    Beygi, Sajjad; Kafashan, Mohammadmehdi; Bahrami, Hamid Reza; Mugler, Dale H

    2012-01-01

    In this paper, we present a novel scheme to compensate impulsive noise from images using the sparse shrinkage method. In this scheme, we assume the remaining noise after using a simple median filtering in place of corrupted pixels, found by boundary discriminative noise detection method, to be Gaussian additive noise. This assumption will later be verified by the means of simulation. Knowing that the pure image in the discrete wavelet transform (DWT) domain is a sparse vector, we define an optimization problem to minimize the l 0 -norm of the estimated image vector from the noisy one in the DWT domain. l 0 -norm makes the optimization problem a combinatorial optimization problem which is NP-hard to solve. To come up with a solution for our optimization problem, we convert the l 0 -norm problem to a continuous optimization problem which is then solved to find the estimated image with reduced noise. In the simulation and discussion part, the performance of our proposed method in reducing impulsive noise is compared to that of existing methods in the literature. We show that our proposed algorithm generally performs better in terms of both subjective and objective evaluations and is less complex. (paper)

  13. Parallel iterative solvers and preconditioners using approximate hierarchical methods

    Energy Technology Data Exchange (ETDEWEB)

    Grama, A.; Kumar, V.; Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)

    1996-12-31

    In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.

  14. Perils of Asymptotics

    International Nuclear Information System (INIS)

    Dewar, R. L.

    1995-01-01

    A large part of physics consists of learning which asymptotic methods to apply where, yet physicists are not always taught asymptotics in a systematic way. Asymptotology is given using an example from aerodynamics, and a rent Phys. Rev. Letter Comment is used as a case study of one subtle way things can go wrong. It is shown that the application of local analysis leads to erroneous conclusions regarding the existence of a continuous spectrum in a simple test problem, showing that a global analysis must be used. The final section presents results on a more sophisticated example, namely the WKBJ solution of Mathieu equation. 13 refs., 2 figs

  15. Method and apparatus for iterative lysis and extraction of algae

    Science.gov (United States)

    Chew, Geoffrey; Boggs, Tabitha; Dykes, Jr., H. Waite H.; Doherty, Stephen J.

    2015-12-01

    A method and system for processing algae involves the use of an ionic liquid-containing clarified cell lysate to lyse algae cells. The resulting crude cell lysate may be clarified and subsequently used to lyse algae cells. The process may be repeated a number of times before a clarified lysate is separated into lipid and aqueous phases for further processing and/or purification of desired products.

  16. The Davidson Method as an alternative to power iterations for criticality calculations

    International Nuclear Information System (INIS)

    Subramanian, C.; Van Criekingen, S.; Heuveline, V.; Nataf, F.; Have, P.

    2011-01-01

    The Davidson method is implemented within the neutron transport core solver parafish to solve k-eigenvalue criticality transport problems. The parafish solver is based on domain decomposition, uses spherical harmonics (P_N method) for angular discretization, and nonconforming finite elements for spatial discretization. The Davidson method is compared to the traditional power iteration method in that context. Encouraging numerical results are obtained with both sequential and parallel calculations. (author)

  17. Dose rate evaluation of body phantom behind ITER bio-shield wall using Monte Carlo method

    International Nuclear Information System (INIS)

    Beheshti, A.; Jabbari, I.; Karimian, A.; Abdi, M.

    2012-01-01

    One of the most critical risks to humans in reactors environment is radiation exposure. Around the tokamak hall personnel are exposed to a wide range of particles, including neutrons and photons. International Thermonuclear Experimental Reactor (ITER) is a nuclear fusion research and engineering project, which is the most advanced experimental tokamak nuclear fusion reactor. Dose rates assessment and photon radiation due to the neutron activation of the solid structures in ITER is important from the radiological point of view. Therefore, the dosimetry considered in this case is based on the Deuterium-Tritium (DT) plasma burning with neutrons production rate at 14.1 MeV. The aim of this study is assessment the amount of radiation behind bio-shield wall that a human received during normal operation of ITER by considering neutron activation and delay gammas. To achieve the aim, the ITER system and its components were simulated by Monte Carlo method. Also to increase the accuracy and precision of the absorbed dose assessment a body phantom were considered in the simulation. The results of this research showed that total dose rates level near the outside of bio-shield wall of the tokamak hall is less than ten percent of the annual occupational dose limits during normal operation of ITER and It is possible to learn how long human beings can remain in that environment before the body absorbs dangerous levels of radiation. (authors)

  18. A fast method to emulate an iterative POCS image reconstruction algorithm.

    Science.gov (United States)

    Zeng, Gengsheng L

    2017-10-01

    Iterative image reconstruction algorithms are commonly used to optimize an objective function, especially when the objective function is nonquadratic. Generally speaking, the iterative algorithms are computationally inefficient. This paper presents a fast algorithm that has one backprojection and no forward projection. This paper derives a new method to solve an optimization problem. The nonquadratic constraint, for example, an edge-preserving denoising constraint is implemented as a nonlinear filter. The algorithm is derived based on the POCS (projections onto projections onto convex sets) approach. A windowed FBP (filtered backprojection) algorithm enforces the data fidelity. An iterative procedure, divided into segments, enforces edge-enhancement denoising. Each segment performs nonlinear filtering. The derived iterative algorithm is computationally efficient. It contains only one backprojection and no forward projection. Low-dose CT data are used for algorithm feasibility studies. The nonlinearity is implemented as an edge-enhancing noise-smoothing filter. The patient studies results demonstrate its effectiveness in processing low-dose x ray CT data. This fast algorithm can be used to replace many iterative algorithms. © 2017 American Association of Physicists in Medicine.

  19. Exponential asymptotics of homoclinic snaking

    International Nuclear Information System (INIS)

    Dean, A D; Matthews, P C; Cox, S M; King, J R

    2011-01-01

    We study homoclinic snaking in the cubic-quintic Swift–Hohenberg equation (SHE) close to the onset of a subcritical pattern-forming instability. Application of the usual multiple-scales method produces a leading-order stationary front solution, connecting the trivial solution to the patterned state. A localized pattern may therefore be constructed by matching between two distant fronts placed back-to-back. However, the asymptotic expansion of the front is divergent, and hence should be truncated. By truncating optimally, such that the resultant remainder is exponentially small, an exponentially small parameter range is derived within which stationary fronts exist. This is shown to be a direct result of the 'locking' between the phase of the underlying pattern and its slowly varying envelope. The locking mechanism remains unobservable at any algebraic order, and can only be derived by explicitly considering beyond-all-orders effects in the tail of the asymptotic expansion, following the method of Kozyreff and Chapman as applied to the quadratic-cubic SHE (Chapman and Kozyreff 2009 Physica D 238 319–54, Kozyreff and Chapman 2006 Phys. Rev. Lett. 97 44502). Exponentially small, but exponentially growing, contributions appear in the tail of the expansion, which must be included when constructing localized patterns in order to reproduce the full snaking diagram. Implicit within the bifurcation equations is an analytical formula for the width of the snaking region. Due to the linear nature of the beyond-all-orders calculation, the bifurcation equations contain an analytically indeterminable constant, estimated in the previous work by Chapman and Kozyreff using a best fit approximation. A more accurate estimate of the equivalent constant in the cubic-quintic case is calculated from the iteration of a recurrence relation, and the subsequent analytical bifurcation diagram compared with numerical simulations, with good agreement

  20. Identifying an unknown function in a parabolic equation with overspecified data via He's variational iteration method

    International Nuclear Information System (INIS)

    Dehghan, Mehdi; Tatari, Mehdi

    2008-01-01

    In this research, the He's variational iteration technique is used for computing an unknown time-dependent parameter in an inverse quasilinear parabolic partial differential equation. Parabolic partial differential equations with overspecified data play a crucial role in applied mathematics and physics, as they appear in various engineering models. The He's variational iteration method is an analytical procedure for finding solutions of differential equations, is based on the use of Lagrange multipliers for identification of an optimal value of a parameter in a functional. To show the efficiency of the new approach, several test problems are presented for one-, two- and three-dimensional cases

  1. Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Farouq, S.; Neytcheva, M.

    2017-01-01

    Roč. 74, č. 1 (2017), s. 19-37 ISSN 1017-1398 Institutional support: RVO:68145535 Keywords : PDE-constrained optimization problems * finite elements * iterative solution method s * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.241, year: 2016 https://link.springer.com/article/10.1007%2Fs11075-016-0136-5

  2. 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.

  3. Newton-sor iterative method for solving the two-dimensional porous ...

    African Journals Online (AJOL)

    In this paper, we consider the application of the Newton-SOR iterative method in obtaining the approximate solution of the two-dimensional porous medium equation (2D PME). The nonlinear finite difference approximation equation to the 2D PME is derived by using the implicit finite difference scheme. The developed ...

  4. Monte Carlo methods in PageRank computation: When one iteration is sufficient

    NARCIS (Netherlands)

    Avrachenkov, K.; Litvak, Nelli; Nemirovsky, D.; Osipova, N.

    2005-01-01

    PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of visiting a Web page by a random surfer and thus it reflects the popularity of a Web page. Google computes the PageRank using the power iteration method which requires

  5. Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Farouq, S.; Neytcheva, M.

    2017-01-01

    Roč. 74, č. 1 (2017), s. 19-37 ISSN 1017-1398 Institutional support: RVO:68145535 Keywords : PDE-constrained optimization problems * finite elements * iterative solution methods * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.241, year: 2016 https://link.springer.com/article/10.1007%2Fs11075-016-0136-5

  6. An iterative method for Tikhonov regularization with a general linear regularization operator

    NARCIS (Netherlands)

    Hochstenbach, M.E.; Reichel, L.

    2010-01-01

    Tikhonov regularization is one of the most popular approaches to solve discrete ill-posed problems with error-contaminated data. A regularization operator and a suitable value of a regularization parameter have to be chosen. This paper describes an iterative method, based on Golub-Kahan

  7. Polynomial factor models : non-iterative estimation via method-of-moments

    NARCIS (Netherlands)

    Schuberth, Florian; Büchner, Rebecca; Schermelleh-Engel, Karin; Dijkstra, Theo K.

    2017-01-01

    We introduce a non-iterative method-of-moments estimator for non-linear latent variable (LV) models. Under the assumption of joint normality of all exogenous variables, we use the corrected moments of linear combinations of the observed indicators (proxies) to obtain consistent path coefficient and

  8. 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.

  9. A non-iterative twin image elimination method with two in-line digital holograms

    Science.gov (United States)

    Kim, Jongwu; Lee, Heejung; Jeon, Philjun; Kim, Dug Young

    2018-02-01

    We propose a simple non-iterative in-line holographic measurement method which can effectively eliminate a twin image in digital holographic 3D imaging. It is shown that a twin image can be effectively eliminated with only two measured holograms by using a simple numerical propagation algorithm and arithmetic calculations.

  10. On the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems

    Czech Academy of Sciences Publication Activity Database

    Bai, Z.-Z.; Rozložník, Miroslav

    2015-01-01

    Roč. 53, č. 4 (2015), s. 1716-1737 ISSN 0036-1429 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : matrix splitting * stationary iteration method * backward error * rounding error analysis Subject RIV: BA - General Mathematics Impact factor: 1.899, year: 2015

  11. Monte Carlo methods in PageRank computation: When one iteration is sufficient

    NARCIS (Netherlands)

    Avrachenkov, K.; Litvak, Nelli; Nemirovsky, D.; Osipova, N.

    PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of visiting a Web page by a random surfer, and thus it reflects the popularity of a Web page. Google computes the PageRank using the power iteration method, which requires

  12. Solving Ratio-Dependent Predatorprey System with Constant Effort Harvesting Using Variational Iteration Method

    DEFF Research Database (Denmark)

    Ghotbi, Abdoul R; Barari, Amin

    2009-01-01

    Due to wide range of interest in use of bio-economic models to gain insight in to the scientific management of renewable resources like fisheries and forestry, variational iteration method (VIM) is employed to approximate the solution of the ratio-dependent predator-prey system with constant effort...

  13. Asymptotically exact calculation of the exchange energies of one-active-electron diatomic ions with the surface integral method

    International Nuclear Information System (INIS)

    Scott, Tony C; Aubert-Frecon, Monique; Hadinger, Gisele; Andrae, Dirk; Grotendorst, Johannes; III, John D Morgan

    2004-01-01

    We present a general procedure, based on the Holstein-Herring method, for calculating exactly the leading term in the exponentially small exchange energy splitting between two asymptotically degenerate states of a diatomic molecule or molecular ion. The general formulae we have derived are shown to reduce correctly to the previously known exact results for the specific cases of the lowest Σ and Π states of H + 2 . We then apply our general formulae to calculate the exchange energy splittings between the lowest states of the diatomic alkali cations K + 2 , Rb + 2 and Cs + 2 , which are isovalent to H + 2 . Our results are found to be in very good agreement with the best available experimental data and ab initio calculations

  14. An iterative method for obtaining the optimum lightning location on a spherical surface

    Science.gov (United States)

    Chao, Gao; Qiming, MA

    1991-01-01

    A brief introduction to the basic principles of an eigen method used to obtain the optimum source location of lightning is presented. The location of the optimum source is obtained by using multiple direction finders (DF's) on a spherical surface. An improvement of this method, which takes the distance of source-DF's as a constant, is presented. It is pointed out that using a weight factor of signal strength is not the most ideal method because of the inexact inverse signal strength-distance relation and the inaccurate signal amplitude. An iterative calculation method is presented using the distance from the source to the DF as a weight factor. This improved method has higher accuracy and needs only a little more calculation time. Some computer simulations for a 4DF system are presented to show the improvement of location through use of the iterative method.

  15. Globally asymptotically stable analysis in a discrete time eco-epidemiological system

    International Nuclear Information System (INIS)

    Hu, Zengyun; Teng, Zhidong; Zhang, Tailei; Zhou, Qiming; Chen, Xi

    2017-01-01

    Highlights: • Dynamical behaviors of a discrete time eco-epidemiological system are discussed. • Global asymptotical stability of this system is obtained by an iteration scheme which can be expended to general dimensional discrete system. • More complex dynamical behaviors are obtained by numerical simulations. - Abstract: In this study, the dynamical behaviors of a discrete time eco-epidemiological system are discussed. The local stability, bifurcation and chaos are obtained. Moreover, the global asymptotical stability of this system is explored by an iteration scheme. The numerical simulations illustrate the theoretical results and exhibit the complex dynamical behaviors such as flip bifurcation, Hopf bifurcation and chaotic dynamical behaviors. Our main results provide an efficient method to analyze the global asymptotical stability for general three dimensional discrete systems.

  16. Discrete fourier transform (DFT) analysis for applications using iterative transform methods

    Science.gov (United States)

    Dean, Bruce H. (Inventor)

    2012-01-01

    According to various embodiments, a method is provided for determining aberration data for an optical system. The method comprises collecting a data signal, and generating a pre-transformation algorithm. The data is pre-transformed by multiplying the data with the pre-transformation algorithm. A discrete Fourier transform of the pre-transformed data is performed in an iterative loop. The method further comprises back-transforming the data to generate aberration data.

  17. Iterative Methods for Solving Nonlinear Parabolic Problem in Pension Saving Management

    Science.gov (United States)

    Koleva, M. N.

    2011-11-01

    In this work we consider a nonlinear parabolic equation, obtained from Riccati like transformation of the Hamilton-Jacobi-Bellman equation, arising in pension saving management. We discuss two numerical iterative methods for solving the model problem—fully implicit Picard method and mixed Picard-Newton method, which preserves the parabolic characteristics of the differential problem. Numerical experiments for comparison the accuracy and effectiveness of the algorithms are discussed. Finally, observations are given.

  18. 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.

  19. A block-iterative nodal integral method for forced convection problems

    International Nuclear Information System (INIS)

    Decker, W.J.; Dorning, J.J.

    1992-01-01

    A new efficient iterative nodal integral method for the time-dependent two- and three-dimensional incompressible Navier-Stokes equations has been developed. Using the approach introduced by Azmy and Droning to develop nodal mehtods with high accuracy on coarse spatial grids for two-dimensional steady-state problems and extended to coarse two-dimensional space-time grids by Wilson et al. for thermal convection problems, we have developed a new iterative nodal integral method for the time-dependent Navier-Stokes equations for mechanically forced convection. A new, extremely efficient block iterative scheme is employed to invert the Jacobian within each of the Newton-Raphson iterations used to solve the final nonlinear discrete-variable equations. By taking advantage of the special structure of the Jacobian, this scheme greatly reduces memory requirements. The accuracy of the overall method is illustrated by appliying it to the time-dependent version of the classic two-dimensional driven cavity problem of computational fluid dynamics

  20. A superlinear iteration method for calculation of finite length journal bearing's static equilibrium position

    Science.gov (United States)

    Zhou, Wenjie; Wei, Xuesong; Wang, Leqin; Wu, Guangkuan

    2017-05-01

    Solving the static equilibrium position is one of the most important parts of dynamic coefficients calculation and further coupled calculation of rotor system. The main contribution of this study is testing the superlinear iteration convergence method-twofold secant method, for the determination of the static equilibrium position of journal bearing with finite length. Essentially, the Reynolds equation for stable motion is solved by the finite difference method and the inner pressure is obtained by the successive over-relaxation iterative method reinforced by the compound Simpson quadrature formula. The accuracy and efficiency of the twofold secant method are higher in comparison with the secant method and dichotomy. The total number of iterative steps required for the twofold secant method are about one-third of the secant method and less than one-eighth of dichotomy for the same equilibrium position. The calculations for equilibrium position and pressure distribution for different bearing length, clearance and rotating speed were done. In the results, the eccentricity presents linear inverse proportional relationship to the attitude angle. The influence of the bearing length, clearance and bearing radius on the load-carrying capacity was also investigated. The results illustrate that larger bearing length, larger radius and smaller clearance are good for the load-carrying capacity of journal bearing. The application of the twofold secant method can greatly reduce the computational time for calculation of the dynamic coefficients and dynamic characteristics of rotor-bearing system with a journal bearing of finite length.

  1. Iterative and multigrid methods in the finite element solution of incompressible and turbulent fluid flow

    Science.gov (United States)

    Lavery, N.; Taylor, C.

    1999-07-01

    Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time-independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi-Babuska condition. The k-l model is used to complete the turbulence closure problem. The non-symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a V-cycling schedule. These methods are all compared to the non-symmetric frontal solver. Copyright

  2. Solution of problems in calculus of variations via He's variational iteration method

    International Nuclear Information System (INIS)

    Tatari, Mehdi; Dehghan, Mehdi

    2007-01-01

    In the modeling of a large class of problems in science and engineering, the minimization of a functional is appeared. Finding the solution of these problems needs to solve the corresponding ordinary differential equations which are generally nonlinear. In recent years He's variational iteration method has been attracted a lot of attention of the researchers for solving nonlinear problems. This method finds the solution of the problem without any discretization of the equation. Since this method gives a closed form solution of the problem and avoids the round off errors, it can be considered as an efficient method for solving various kinds of problems. In this research He's variational iteration method will be employed for solving some problems in calculus of variations. Some examples are presented to show the efficiency of the proposed technique

  3. A comparison between progressive extension method (PEM) and iterative method (IM) for magnetic field extrapolations in the solar atmosphere

    Science.gov (United States)

    Wu, S. T.; Sun, M. T.; Sakurai, Takashi

    1990-01-01

    This paper presents a comparison between two numerical methods for the extrapolation of nonlinear force-free magnetic fields, viz the Iterative Method (IM) and the Progressive Extension Method (PEM). The advantages and disadvantages of these two methods are summarized, and the accuracy and numerical instability are discussed. On the basis of this investigation, it is claimed that the two methods do resemble each other qualitatively.

  4. 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.

  5. Backtracking-Based Iterative Regularization Method for Image Compressive Sensing Recovery

    Directory of Open Access Journals (Sweden)

    Lingjun Liu

    2017-01-01

    Full Text Available This paper presents a variant of the iterative shrinkage-thresholding (IST algorithm, called backtracking-based adaptive IST (BAIST, for image compressive sensing (CS reconstruction. For increasing iterations, IST usually yields a smoothing of the solution and runs into prematurity. To add back more details, the BAIST method backtracks to the previous noisy image using L2 norm minimization, i.e., minimizing the Euclidean distance between the current solution and the previous ones. Through this modification, the BAIST method achieves superior performance while maintaining the low complexity of IST-type methods. Also, BAIST takes a nonlocal regularization with an adaptive regularizor to automatically detect the sparsity level of an image. Experimental results show that our algorithm outperforms the original IST method and several excellent CS techniques.

  6. Asymptotic numerical method for multi-degree-of-freedom nonlinear dynamic systems

    International Nuclear Information System (INIS)

    Mei Shuli; Du Chengjin; Zhang Senwen

    2008-01-01

    Homotopy perturbation method (HPM) proposed by Ji-Huan He is very effective and convenient for single-degree-of-freedom systems. In this paper a coupling technique of He's method and precise integration method (PIM) is suggested to solve multi-degree-of-freedom nonlinear dynamic systems. The new technique keeps the merits of the two methods. Some examples are given to illustrate its effectiveness and convenience. Furthermore the obtained solution is of high accuracy

  7. The Regularized Iteratively Reweighted MAD Method for Change Detection in Multi- and Hyperspectral Data

    DEFF Research Database (Denmark)

    Nielsen, Allan Aasbjerg

    2007-01-01

    This paper describes new extensions to the previously published multivariate alteration detection (MAD) method for change detection in bi-temporal, multi- and hypervariate data such as remote sensing imagery. Much like boosting methods often applied in data mining work, the iteratively reweighted...... to observations that show little change, i.e., for which the sum of squared, standardized MAD variates is small, and small weights are assigned to observations for which the sum is large. Like the original MAD method, the iterative extension is invariant to linear (affine) transformations of the original...... an agricultural region in Kenya, and hyperspectral airborne HyMap data from a small rural area in southeastern Germany are given. The latter case demonstrates the need for regularization....

  8. He's variational iteration method applied to the solution of the prey and predator problem with variable coefficients

    International Nuclear Information System (INIS)

    Yusufoglu, Elcin; Erbas, Baris

    2008-01-01

    In this Letter, a mathematical model of the problem of prey and predator is presented and He's variational iteration method is employed to compute an approximation to the solution of the system of nonlinear differential equations governing the problem. The results are compared with the results obtained by Adomian decomposition method and homotopy perturbation method. Comparison of the methods show that He's variational iteration method is a powerful method for obtaining approximate solutions to nonlinear equations and their systems

  9. A Posteriori Error Estimation for Finite Element Methods and Iterative Linear Solvers

    Energy Technology Data Exchange (ETDEWEB)

    Melboe, Hallgeir

    2001-10-01

    This thesis addresses a posteriori error estimation for finite element methods and iterative linear solvers. Adaptive finite element methods have gained a lot of popularity over the last decades due to their ability to produce accurate results with limited computer power. In these methods a posteriori error estimates play an essential role. Not only do they give information about how large the total error is, they also indicate which parts of the computational domain should be given a more sophisticated treatment in order to reduce the error. A posteriori error estimates are traditionally aimed at estimating the global error, but more recently so called goal oriented error estimators have been shown a lot of interest. The name reflects the fact that they estimate the error in user-defined local quantities. In this thesis the main focus is on global error estimators for highly stretched grids and goal oriented error estimators for flow problems on regular grids. Numerical methods for partial differential equations, such as finite element methods and other similar techniques, typically result in a linear system of equations that needs to be solved. Usually such systems are solved using some iterative procedure which due to a finite number of iterations introduces an additional error. Most such algorithms apply the residual in the stopping criterion, whereas the control of the actual error may be rather poor. A secondary focus in this thesis is on estimating the errors that are introduced during this last part of the solution procedure. The thesis contains new theoretical results regarding the behaviour of some well known, and a few new, a posteriori error estimators for finite element methods on anisotropic grids. Further, a goal oriented strategy for the computation of forces in flow problems is devised and investigated. Finally, an approach for estimating the actual errors associated with the iterative solution of linear systems of equations is suggested. (author)

  10. 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

  11. Iterative raw measurements restoration method with penalized weighted least squares approach for low-dose CT

    Science.gov (United States)

    Takahashi, Hisashi; Goto, Taiga; Hirokawa, Koichi; Miyazaki, Osamu

    2014-03-01

    Statistical iterative reconstruction and post-log data restoration algorithms for CT noise reduction have been widely studied and these techniques have enabled us to reduce irradiation doses while maintaining image qualities. In low dose scanning, electronic noise becomes obvious and it results in some non-positive signals in raw measurements. The nonpositive signal should be converted to positive signal so that it can be log-transformed. Since conventional conversion methods do not consider local variance on the sinogram, they have difficulty of controlling the strength of the filtering. Thus, in this work, we propose a method to convert the non-positive signal to the positive signal by mainly controlling the local variance. The method is implemented in two separate steps. First, an iterative restoration algorithm based on penalized weighted least squares is used to mitigate the effect of electronic noise. The algorithm preserves the local mean and reduces the local variance induced by the electronic noise. Second, smoothed raw measurements by the iterative algorithm are converted to the positive signal according to a function which replaces the non-positive signal with its local mean. In phantom studies, we confirm that the proposed method properly preserves the local mean and reduce the variance induced by the electronic noise. Our technique results in dramatically reduced shading artifacts and can also successfully cooperate with the post-log data filter to reduce streak artifacts.

  12. Environmental dose rate assessment of ITER using the Monte Carlo method

    Directory of Open Access Journals (Sweden)

    Karimian Alireza

    2014-01-01

    Full Text Available Exposure to radiation is one of the main sources of risk to staff employed in reactor facilities. The staff of a tokamak is exposed to a wide range of neutrons and photons around the tokamak hall. The International Thermonuclear Experimental Reactor (ITER is a nuclear fusion engineering project and the most advanced experimental tokamak in the world. From the radiobiological point of view, ITER dose rates assessment is particularly important. The aim of this study is the assessment of the amount of radiation in ITER during its normal operation in a radial direction from the plasma chamber to the tokamak hall. To achieve this goal, the ITER system and its components were simulated by the Monte Carlo method using the MCNPX 2.6.0 code. Furthermore, the equivalent dose rates of some radiosensitive organs of the human body were calculated by using the medical internal radiation dose phantom. Our study is based on the deuterium-tritium plasma burning by 14.1 MeV neutron production and also photon radiation due to neutron activation. As our results show, the total equivalent dose rate on the outside of the bioshield wall of the tokamak hall is about 1 mSv per year, which is less than the annual occupational dose rate limit during the normal operation of ITER. Also, equivalent dose rates of radiosensitive organs have shown that the maximum dose rate belongs to the kidney. The data may help calculate how long the staff can stay in such an environment, before the equivalent dose rates reach the whole-body dose limits.

  13. 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).

  14. Design and fabrication methods of FW/blanket, divertor and vacuum vessel for ITER

    International Nuclear Information System (INIS)

    Ioki, K.; Barabash, V.; Cardella, A.; Elio, F.; Ibbott, C.; Janeschitz, G.; Johnson, G.; Kalinin, G.; Miki, N.; Onozuka, M.; Sannazzaro, G.; Tivey, R.; Utin, Y.; Yamada, M.

    2000-01-01

    Design has progressed on the vacuum vessel, FW/blanket and Divertor for the Reduced Technical Objective/Reduced Cost (RTO/RC) ITER. The basic functions and structures are the same as for the 1998 ITER design [K. Ioki et al., J. Nucl. Mater. 258-263 (1998) 74]. Design and fabrication methods of the components have been improved to achieve ∼50% reduction of the construction cost. Detailed blanket module designs with flat separable FW panels have been developed to reduce the fabrication cost and the future radioactive waste. Most of the R and D performed so far during the Engineering Design Activities (EDAs) are still applicable. Further cost reduction methods are also being investigated and additional R and D is being performed

  15. Nonlinear Projective-Iteration Methods for Solving Transport Problems on Regular and Unstructured Grids

    International Nuclear Information System (INIS)

    Dmitriy Y. Anistratov; Adrian Constantinescu; Loren Roberts; William Wieselquist

    2007-01-01

    This is a project in the field of fundamental research on numerical methods for solving the particle transport equation. Numerous practical problems require to use unstructured meshes, for example, detailed nuclear reactor assembly-level calculations, large-scale reactor core calculations, radiative hydrodynamics problems, where the mesh is determined by hydrodynamic processes, and well-logging problems in which the media structure has very complicated geometry. Currently this is an area of very active research in numerical transport theory. main issues in developing numerical methods for solving the transport equation are the accuracy of the numerical solution and effectiveness of iteration procedure. The problem in case of unstructured grids is that it is very difficult to derive an iteration algorithm that will be unconditionally stable

  16. Design and fabrication methods of FW/blanket, divertor and vacuum vessel for ITER

    Energy Technology Data Exchange (ETDEWEB)

    Ioki, K. E-mail: iokik@itereu.deiokik@ipp.mpg.de; Barabash, V.; Cardella, A.; Elio, F.; Ibbott, C.; Janeschitz, G.; Johnson, G.; Kalinin, G.; Miki, N.; Onozuka, M.; Sannazzaro, G.; Tivey, R.; Utin, Y.; Yamada, M

    2000-12-01

    Design has progressed on the vacuum vessel, FW/blanket and Divertor for the Reduced Technical Objective/Reduced Cost (RTO/RC) ITER. The basic functions and structures are the same as for the 1998 ITER design [K. Ioki et al., J. Nucl. Mater. 258-263 (1998) 74]. Design and fabrication methods of the components have been improved to achieve {approx}50% reduction of the construction cost. Detailed blanket module designs with flat separable FW panels have been developed to reduce the fabrication cost and the future radioactive waste. Most of the R and D performed so far during the Engineering Design Activities (EDAs) are still applicable. Further cost reduction methods are also being investigated and additional R and D is being performed.

  17. Design and fabrication methods of FW/blanket, divertor and vacuum vessel for ITER

    Science.gov (United States)

    Ioki, K.; Barabash, V.; Cardella, A.; Elio, F.; Ibbott, C.; Janeschitz, G.; Johnson, G.; Kalinin, G.; Miki, N.; Onozuka, M.; Sannazzaro, G.; Tivey, R.; Utin, Y.; Yamada, M.

    2000-12-01

    Design has progressed on the vacuum vessel, FW/blanket and Divertor for the Reduced Technical Objective/Reduced Cost (RTO/RC) ITER. The basic functions and structures are the same as for the 1998 ITER design [K. Ioki et al., J. Nucl. Mater. 258-263 (1998) 74]. Design and fabrication methods of the components have been improved to achieve ˜50% reduction of the construction cost. Detailed blanket module designs with flat separable FW panels have been developed to reduce the fabrication cost and the future radioactive waste. Most of the R&D performed so far during the Engineering Design Activities (EDAs) are still applicable. Further cost reduction methods are also being investigated and additional R&D is being performed.

  18. 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

  19. Asymptotic Method of Solution for a Problem of Construction of Optimal Gas-Lift Process Modes

    Directory of Open Access Journals (Sweden)

    Fikrat A. Aliev

    2010-01-01

    Full Text Available Mathematical model in oil extraction by gas-lift method for the case when the reciprocal value of well's depth represents a small parameter is considered. Problem of optimal mode construction (i.e., construction of optimal program trajectories and controls is reduced to the linear-quadratic optimal control problem with a small parameter. Analytic formulae for determining the solutions at the first-order approximation with respect to the small parameter are obtained. Comparison of the obtained results with known ones on a specific example is provided, which makes it, in particular, possible to use obtained results in realizations of oil extraction problems by gas-lift method.

  20. Reducing the effects of acoustic heterogeneity with an iterative reconstruction method from experimental data in microwave induced thermoacoustic tomography

    International Nuclear Information System (INIS)

    Wang, Jinguo; Zhao, Zhiqin; Song, Jian; Chen, Guoping; Nie, Zaiping; Liu, Qing-Huo

    2015-01-01

    Purpose: An iterative reconstruction method has been previously reported by the authors of this paper. However, the iterative reconstruction method was demonstrated by solely using the numerical simulations. It is essential to apply the iterative reconstruction method to practice conditions. The objective of this work is to validate the capability of the iterative reconstruction method for reducing the effects of acoustic heterogeneity with the experimental data in microwave induced thermoacoustic tomography. Methods: Most existing reconstruction methods need to combine the ultrasonic measurement technology to quantitatively measure the velocity distribution of heterogeneity, which increases the system complexity. Different to existing reconstruction methods, the iterative reconstruction method combines time reversal mirror technique, fast marching method, and simultaneous algebraic reconstruction technique to iteratively estimate the velocity distribution of heterogeneous tissue by solely using the measured data. Then, the estimated velocity distribution is used subsequently to reconstruct the highly accurate image of microwave absorption distribution. Experiments that a target placed in an acoustic heterogeneous environment are performed to validate the iterative reconstruction method. Results: By using the estimated velocity distribution, the target in an acoustic heterogeneous environment can be reconstructed with better shape and higher image contrast than targets that are reconstructed with a homogeneous velocity distribution. Conclusions: The distortions caused by the acoustic heterogeneity can be efficiently corrected by utilizing the velocity distribution estimated by the iterative reconstruction method. The advantage of the iterative reconstruction method over the existing correction methods is that it is successful in improving the quality of the image of microwave absorption distribution without increasing the system complexity

  1. Asymptotic method for non-linear magnetosonic waves in an isothermal plasma with a finite conductivity

    Energy Technology Data Exchange (ETDEWEB)

    Fusco, D [Messina Univ. (Italy). Instituto de Matematica

    1979-01-01

    The paper is concerned with a three-dimensional theory of non-linear magnetosonic waves in a turbulent plasma. A perturbation method is used that allows a transport equation, like Burgers equation but with a variable coefficient to be obtained.

  2. Direct Determination of Asymptotic Structural Postbuckling Behaviour by the finite element method

    DEFF Research Database (Denmark)

    Poulsen, Peter Noe; Damkilde, Lars

    1998-01-01

    problems and eliminates these problems. The reason for the numerical problems is that the postbuckling stresses are inaccurately determined. By including a local stress contribution, the postbuckling stresses are calculated correctly. The present method gives smooth postbuckling stresses and shows a quick...... convergence of the postbuckling coefficients. (C) 1998 John Wiley & Sons, Ltd....

  3. Direct determination of asymptotic structural postbuckling behaviour by the finite element method

    DEFF Research Database (Denmark)

    Poulsen, Peter Noe; Damkilde, Lars

    1997-01-01

    problems and eliminates these problems. The reason for the numerical problems is that the postbuckling stresses are inaccurately determined. By including a local stress contribution the postbuckling stresses are calculated correctly. The present method gives smooth postbuckling stresses and shows a quick...... convergence of the postbuckling coefficients....

  4. High Frequency Asymptotic Methods for Traveltimes and Anisotropy Parameter Estimation in Azimuthally Varying Media

    KAUST Repository

    Masmoudi, Nabil

    2014-01-01

    of characteristics which yields the ray tracing equations and the finite difference approaches. In the first part of the Master Thesis, we use the ray tracing method to solve the eikonal equation to get P-waves traveltimes for orthorhombic models with arbitrary

  5. Iterative methods used in overlap astrometric reduction techniques do not always converge

    Science.gov (United States)

    Rapaport, M.; Ducourant, C.; Colin, J.; Le Campion, J. F.

    1993-04-01

    In this paper we prove that the classical Gauss-Seidel type iterative methods used for the solution of the reduced normal equations occurring in overlapping reduction methods of astrometry do not always converge. We exhibit examples of divergence. We then analyze an alternative algorithm proposed by Wang (1985). We prove the consistency of this algorithm and verify that it can be convergent while the Gauss-Seidel method is divergent. We conjecture the convergence of Wang method for the solution of astrometric problems using overlap techniques.

  6. An iterative method for accelerated degradation testing data of smart electricity meter

    Science.gov (United States)

    Wang, Xiaoming; Xie, Jinzhe

    2017-01-01

    In order to evaluate the performance of smart electricity meter (SEM), we must spend a lot of time censoring its status. For example, if we assess to the meter stability of the SEM which needs several years at least according to the standards. So accelerated degradation testing (ADT) is a useful method to assess the performance of the SEM. As we known, the Wiener process is a prevalent method to interpret the performance degradation. This paper proposes an iterative method for ADT data of SEM. The simulation study verifies the application and superiority of the proposed model than other ADT methods.

  7. 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.

  8. New Iterative Method for Fractional Gas Dynamics and Coupled Burger’s Equations

    Directory of Open Access Journals (Sweden)

    Mohamed S. Al-luhaibi

    2015-01-01

    Full Text Available This paper presents the approximate analytical solutions to solve the nonlinear gas dynamics and coupled Burger’s equations with fractional time derivative. By using initial values, the explicit solutions of the equations are solved by using a reliable algorithm. Numerical results show that the new iterative method is easy to implement and accurate when applied to time-fractional partial differential equations.

  9. Application of the variational iteration method for system of initial value problems delay differential equations

    Science.gov (United States)

    Yousef, Hamood. M.; Ismail, A. I. B. MD.

    2017-08-01

    Many attempts have been presented to solve the system of Delay Differential Equations (DDE) with Initial Value Problem. As a result, it has shown difficulties when getting the solution or cannot be solved. In this paper, a Variational Iteration Method is employed to find out an approximate solution for the system of DDE with initial value problems. The example illustrates convenient and an efficiency comparison with the exact solution.

  10. Detailed Design and Fabrication Method of the ITER Vacuum Vessel Ports

    International Nuclear Information System (INIS)

    Hee-Jae Ahn; Kwon, T.H.; Hong, Y.S.

    2006-01-01

    The engineering design of the ITER vacuum vessel (VV) has been progressed by the ITER International Team (IT) with the cooperation of several participant teams (PT). The VV and ports are the components allocated to Korea for the construction of the ITER. Hyundai Heavy Industries has been involved in the structural analysis, detailed design and development of the fabrication method of the upper and lower ports within the framework of the ITER transitional arrangements (ITA). The design of the port structures has been investigated to validate and to improve the conceptual designs of the ITER IT and other PT. The special emphasis was laid on the flange joint between the port extension and the in-port plug to develop the design of the upper port. The modified design with a pure friction type flange with forty-eight pieces of bolts instead of the tangential key is recommended. Furthermore, the alternative flange designs developed by the ITER IT have been analyzed in detail to simplify the lip seal maintenance into the port flange. The structural analyses of the lower RH port have been also performed to verify the capacity for supporting the VV. The maximum stress exceeds the allowable value at the reinforcing block and basement. More elaborate local models have been developed to mitigate the stress concentration and to modify the component design. The fabrication method and the sequence of the detailed fabrication for the ports are developed focusing on the cost reduction as well as the simplification. A typical port structure includes a port stub, a stub extension and a port extension with a connecting duct. The fabrication sequence consists of surface treatment, cutting, forming, cleaning, welding, machining, and non-destructive inspection and test. Tolerance study has been performed to avoid the mismatch of each fabricated component and to obtain the suitable tolerances in the assembly at the shop and site. This study is based on the experience in the fabrication of

  11. Experimental results and validation of a method to reconstruct forces on the ITER test blanket modules

    International Nuclear Information System (INIS)

    Zeile, Christian; Maione, Ivan A.

    2015-01-01

    Highlights: • An in operation force measurement system for the ITER EU HCPB TBM has been developed. • The force reconstruction methods are based on strain measurements on the attachment system. • An experimental setup and a corresponding mock-up have been built. • A set of test cases representing ITER relevant excitations has been used for validation. • The influence of modeling errors on the force reconstruction has been investigated. - Abstract: In order to reconstruct forces on the test blanket modules in ITER, two force reconstruction methods, the augmented Kalman filter and a model predictive controller, have been selected and developed to estimate the forces based on strain measurements on the attachment system. A dedicated experimental setup with a corresponding mock-up has been designed and built to validate these methods. A set of test cases has been defined to represent possible excitation of the system. It has been shown that the errors in the estimated forces mainly depend on the accuracy of the identified model used by the algorithms. Furthermore, it has been found that a minimum of 10 strain gauges is necessary to allow for a low error in the reconstructed forces.

  12. AN AUTOMATIC OPTICAL AND SAR IMAGE REGISTRATION METHOD USING ITERATIVE MULTI-LEVEL AND REFINEMENT MODEL

    Directory of Open Access Journals (Sweden)

    C. Xu

    2016-06-01

    Full Text Available Automatic image registration is a vital yet challenging task, particularly for multi-sensor remote sensing images. Given the diversity of the data, it is unlikely that a single registration algorithm or a single image feature will work satisfactorily for all applications. Focusing on this issue, the mainly contribution of this paper is to propose an automatic optical-to-SAR image registration method using –level and refinement model: Firstly, a multi-level strategy of coarse-to-fine registration is presented, the visual saliency features is used to acquire coarse registration, and then specific area and line features are used to refine the registration result, after that, sub-pixel matching is applied using KNN Graph. Secondly, an iterative strategy that involves adaptive parameter adjustment for re-extracting and re-matching features is presented. Considering the fact that almost all feature-based registration methods rely on feature extraction results, the iterative strategy improve the robustness of feature matching. And all parameters can be automatically and adaptively adjusted in the iterative procedure. Thirdly, a uniform level set segmentation model for optical and SAR images is presented to segment conjugate features, and Voronoi diagram is introduced into Spectral Point Matching (VSPM to further enhance the matching accuracy between two sets of matching points. Experimental results show that the proposed method can effectively and robustly generate sufficient, reliable point pairs and provide accurate registration.

  13. High Frequency Asymptotic Methods for Traveltimes and Anisotropy Parameter Estimation in Azimuthally Varying Media

    KAUST Repository

    Masmoudi, Nabil

    2014-05-01

    Traveltimes are conventionally evaluated by solving the zero-order approximation of the Wentzel, Kramers and Brillouin (WKB) expansion of the wave equation. This high frequency approximation is good enough for most imaging applications and provides us with a traveltime equation called the eikonal equation. The eikonal equation is a non-linear partial differential equation which can be solved by any of the familiar numerical methods. Among the most popular of these methods is the method of characteristics which yields the ray tracing equations and the finite difference approaches. In the first part of the Master Thesis, we use the ray tracing method to solve the eikonal equation to get P-waves traveltimes for orthorhombic models with arbitrary orientation of symmetry planes. We start with a ray tracing procedure specified in curvilinear coordinate system valid for anisotropy of arbitrary symmetry. The coordinate system is constructed so that the coordinate lines are perpendicular to the symmetry planes of an orthorohombic medium. Advantages of this approach are the conservation of orthorhombic symmetry throughout the model and reduction of the number of parameters specifying the model. We combine this procedure with first-order ray tracing and dynamic ray tracing equations for P waves propagating in smooth, inhomogeneous, weakly anisotropic media. The first-order ray tracing and dynamic ray tracing equations are derived from the exact ones by replacing the exact P-wave eigenvalue of the Christoffel matrix by its first-order approximation. In the second part of the Master Thesis, we compute traveltimes using the fast marching method and we develop an approach to estimate the anisotropy parameters. The idea is to relate them analytically to traveltimes which is challenging in inhomogeneous media. Using perturbation theory, we develop traveltime approximations for transversely isotropic media with horizontal symmetry axis (HTI) as explicit functions of the

  14. Integral method for the calculation of Hawking radiation in dispersive media. I. Symmetric asymptotics

    Science.gov (United States)

    Robertson, Scott; Leonhardt, Ulf

    2014-11-01

    Hawking radiation has become experimentally testable thanks to the many analog systems which mimic the effects of the event horizon on wave propagation. These systems are typically dominated by dispersion and give rise to a numerically soluble and stable ordinary differential equation only if the rest-frame dispersion relation Ω2(k ) is a polynomial of relatively low degree. Here we present a new method for the calculation of wave scattering in a one-dimensional medium of arbitrary dispersion. It views the wave equation as an integral equation in Fourier space, which can be solved using standard and efficient numerical techniques.

  15. An Iterative Regularization Method for Identifying the Source Term in a Second Order Differential Equation

    Directory of Open Access Journals (Sweden)

    Fairouz Zouyed

    2015-01-01

    Full Text Available This paper discusses the inverse problem of determining an unknown source in a second order differential equation from measured final data. This problem is ill-posed; that is, the solution (if it exists does not depend continuously on the data. In order to solve the considered problem, an iterative method is proposed. Using this method a regularized solution is constructed and an a priori error estimate between the exact solution and its regularized approximation is obtained. Moreover, numerical results are presented to illustrate the accuracy and efficiency of this method.

  16. The structure analysis of ITER cryostat based on the finite element method

    International Nuclear Information System (INIS)

    Liang Chao; Ye, M.Y.; Yao, D.M.; Cao, Lei; Zhou, Z.B.; Xu, Teijun; Wang Jian

    2013-01-01

    In the ITER project the cryostat is one of the most important components. Cryostat shall transfer all the loads that derive from the TOKAMAK inner basic machine, and from the cryostat itself, to the floor of the TOKAMAK pit (during the normal and off-normal operational regimes, and at specified accidental conditions). This paper researches the dynamic structure strength of the ITER cryostat during the operation of TOKAMAK. Firstly the paper introduces the types of loads and the importance of every type load to the research. Then it gives out the method of building model and principle of simplified model, boundary conditions and the way of applying loads on the cryostat. Finally the author discussed the analysis result and the strength questions of cryostat, also, the author pointed out the opinions according to the analysis results.

  17. Worst-case Analysis of Strategy Iteration and the Simplex Method

    DEFF Research Database (Denmark)

    Hansen, Thomas Dueholm

    In this dissertation we study strategy iteration (also known as policy iteration) algorithms for solving Markov decision processes (MDPs) and two-player turn-based stochastic games (2TBSGs). MDPs provide a mathematical model for sequential decision making under uncertainty. They are widely used...... to model stochastic optimization problems in various areas ranging from operations research, machine learning, artificial intelligence, economics and game theory. The class of two-player turn-based stochastic games is a natural generalization of Markov decision processes that is obtained by introducing...... in the size of the problem (the bounds have subexponential form). Utilizing a tight connection between MDPs and linear programming, it is shown that the same bounds apply to the corresponding pivoting rules for the simplex method for solving linear programs. Prior to this result no super-polynomial lower...

  18. Clustered iterative stochastic ensemble method for multi-modal calibration of subsurface flow models

    KAUST Repository

    Elsheikh, Ahmed H.

    2013-05-01

    A novel multi-modal parameter estimation algorithm is introduced. Parameter estimation is an ill-posed inverse problem that might admit many different solutions. This is attributed to the limited amount of measured data used to constrain the inverse problem. The proposed multi-modal model calibration algorithm uses an iterative stochastic ensemble method (ISEM) for parameter estimation. ISEM employs an ensemble of directional derivatives within a Gauss-Newton iteration for nonlinear parameter estimation. ISEM is augmented with a clustering step based on k-means algorithm to form sub-ensembles. These sub-ensembles are used to explore different parts of the search space. Clusters are updated at regular intervals of the algorithm to allow merging of close clusters approaching the same local minima. Numerical testing demonstrates the potential of the proposed algorithm in dealing with multi-modal nonlinear parameter estimation for subsurface flow models. © 2013 Elsevier B.V.

  19. 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.

  20. Numerical Asymptotic Solutions Of Differential Equations

    Science.gov (United States)

    Thurston, Gaylen A.

    1992-01-01

    Numerical algorithms derived and compared with classical analytical methods. In method, expansions replaced with integrals evaluated numerically. Resulting numerical solutions retain linear independence, main advantage of asymptotic solutions.

  1. 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.

  2. An iterative kernel based method for fourth order nonlinear equation with nonlinear boundary condition

    Science.gov (United States)

    Azarnavid, Babak; Parand, Kourosh; Abbasbandy, Saeid

    2018-06-01

    This article discusses an iterative reproducing kernel method with respect to its effectiveness and capability of solving a fourth-order boundary value problem with nonlinear boundary conditions modeling beams on elastic foundations. Since there is no method of obtaining reproducing kernel which satisfies nonlinear boundary conditions, the standard reproducing kernel methods cannot be used directly to solve boundary value problems with nonlinear boundary conditions as there is no knowledge about the existence and uniqueness of the solution. The aim of this paper is, therefore, to construct an iterative method by the use of a combination of reproducing kernel Hilbert space method and a shooting-like technique to solve the mentioned problems. Error estimation for reproducing kernel Hilbert space methods for nonlinear boundary value problems have yet to be discussed in the literature. In this paper, we present error estimation for the reproducing kernel method to solve nonlinear boundary value problems probably for the first time. Some numerical results are given out to demonstrate the applicability of the method.

  3. 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.

  4. 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.

  5. 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

  6. Asymptotic methods in analysis

    CERN Document Server

    Bruijn, N G de

    2010-01-01

    An original, effective approach teaches by explaining worked examples in detail. ""Every step in the mathematical process is explained, its purpose and necessity made clear . . . the reader not only has no difficulty in following the rigorous proofs, but even turns to them with eager expectation."" - Nuclear Physics. 1981 edition.

  7. Asymptotic numbers, asymptotic functions and distributions

    International Nuclear Information System (INIS)

    Todorov, T.D.

    1979-07-01

    The asymptotic functions are a new type of generalized functions. But they are not functionals on some space of test-functions as the distributions of Schwartz. They are mappings of the set denoted by A into A, where A is the set of the asymptotic numbers introduced by Christov. On its part A is a totally-ordered set of generalized numbers including the system of real numbers R as well as infinitesimals and infinitely large numbers. Every two asymptotic functions can be multiplied. On the other hand, the distributions have realizations as asymptotic functions in a certain sense. (author)

  8. Acceleration of the AFEN method by two-node nonlinear iteration

    Energy Technology Data Exchange (ETDEWEB)

    Moon, Kap Suk; Cho, Nam Zin; Noh, Jae Man; Hong, Ser Gi [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

    1998-12-31

    A nonlinear iterative scheme developed to reduce the computing time of the AFEN method was tested and applied to two benchmark problems. The new nonlinear method for the AFEN method is based on solving two-node problems and use of two nonlinear correction factors at every interface instead of one factor in the conventional scheme. The use of two correction factors provides higher-order accurate interface fluxes as well as currents which are used as the boundary conditions of the two-node problem. The numerical results show that this new method gives exactly the same solution as that of the original AFEN method and the computing time is significantly reduced in comparison with the original AFEN method. 7 refs., 1 fig., 1 tab. (Author)

  9. Acceleration of the AFEN method by two-node nonlinear iteration

    Energy Technology Data Exchange (ETDEWEB)

    Moon, Kap Suk; Cho, Nam Zin; Noh, Jae Man; Hong, Ser Gi [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

    1999-12-31

    A nonlinear iterative scheme developed to reduce the computing time of the AFEN method was tested and applied to two benchmark problems. The new nonlinear method for the AFEN method is based on solving two-node problems and use of two nonlinear correction factors at every interface instead of one factor in the conventional scheme. The use of two correction factors provides higher-order accurate interface fluxes as well as currents which are used as the boundary conditions of the two-node problem. The numerical results show that this new method gives exactly the same solution as that of the original AFEN method and the computing time is significantly reduced in comparison with the original AFEN method. 7 refs., 1 fig., 1 tab. (Author)

  10. Information operator approach and iterative regularization methods for atmospheric remote sensing

    International Nuclear Information System (INIS)

    Doicu, A.; Hilgers, S.; Bargen, A. von; Rozanov, A.; Eichmann, K.-U.; Savigny, C. von; Burrows, J.P.

    2007-01-01

    In this study, we present the main features of the information operator approach for solving linear inverse problems arising in atmospheric remote sensing. This method is superior to the stochastic version of the Tikhonov regularization (or the optimal estimation method) due to its capability to filter out the noise-dominated components of the solution generated by an inappropriate choice of the regularization parameter. We extend this approach to iterative methods for nonlinear ill-posed problems and derive the truncated versions of the Gauss-Newton and Levenberg-Marquardt methods. Although the paper mostly focuses on discussing the mathematical details of the inverse method, retrieval results have been provided, which exemplify the performances of the methods. These results correspond to the NO 2 retrieval from SCIAMACHY limb scatter measurements and have been obtained by using the retrieval processors developed at the German Aerospace Center Oberpfaffenhofen and Institute of Environmental Physics of the University of Bremen

  11. Calorimetric method for current sharing temperature measurements in ITER conductor samples in SULTAN

    International Nuclear Information System (INIS)

    Bagnasco, M.

    2009-01-01

    Several Toroidal Field Conductor short samples with slight layout variations have been assembled and tested in the SULTAN facility at CRPP. The measurement campaigns started in 2007 and are still ongoing. The performance of every conductor is expressed in terms of current sharing temperature (T cs ), i.e. the temperature at which a defined electric field, 10 μV/m, is detected in the cable due to the incipient superconducting-to-normal state transition. The T cs at specific operating conditions is the key design parameter for the ITER conductors and is the main object of the qualification tests. Typically, the average electric field is measured with voltage tap pairs attached on the jacket along the conductor. The inability however to explain observed premature voltage developments opened the discussion about possible alternative measuring methods. The He flow calorimetric method is based on the measurement of the resistive power generation in the conductor. It relies on the detection of very small temperature increases along the conductor in steady state operation. The accuracy and the reliability of the calorimetric method in SULTAN are critically discussed, with particular emphasis on the instrumentation requirements and test procedures. The application of the calorimetric method to the recent SULTAN test campaigns is described with its merits and limits. For future tests of ITER conductors in SULTAN, the calorimetric method for T cs test is proposed as a routine procedure.

  12. The steady performance prediction of propeller-rudder-bulb system based on potential iterative method

    International Nuclear Information System (INIS)

    Liu, Y B; Su, Y M; Ju, L; Huang, S L

    2012-01-01

    A new numerical method was developed for predicting the steady hydrodynamic performance of propeller-rudder-bulb system. In the calculation, the rudder and bulb was taken into account as a whole, the potential based surface panel method was applied both to propeller and rudder-bulb system. The interaction between propeller and rudder-bulb was taken into account by velocity potential iteration in which the influence of propeller rotation was considered by the average influence coefficient. In the influence coefficient computation, the singular value should be found and deleted. Numerical results showed that the method presented is effective for predicting the steady hydrodynamic performance of propeller-rudder system and propeller-rudder-bulb system. Comparing with the induced velocity iterative method, the method presented can save programming and calculation time. Changing dimensions, the principal parameter—bulb size that affect energy-saving effect was studied, the results show that the bulb on rudder have a optimal size at the design advance coefficient.

  13. Asymptotic analysis of the Forward Search

    DEFF Research Database (Denmark)

    Johansen, Søren; Nielsen, Bent

    The Forward Search is an iterative algorithm concerned with detection of outliers and other unsuspected structures in data. This approach has been suggested, analysed and applied for regression models in the monograph Atkinson and Riani (2000). An asymptotic analysis of the Forward Search is made...

  14. Asymptotic structure of isolated systems

    International Nuclear Information System (INIS)

    Schmidt, B.G.

    1979-01-01

    The main methods to formulate asymptotic flatness conditions are introduced and motivation and basic ideas are emphasized. Any asymptotic flatness condition proposed up to now describes space-times which behave somehow like Minkowski space, and a very explicit exposition of the structure at infinity of Minkowski space is given. This structure is used to describe the asymptotic behaviour of fields on Minkowski space in a frame-dependent way. The definition of null infinity for curved space-time according to Penrose is given and attempts to define spacelike infinity are outlined. The conformal bundle approach to the formulation of asymptotic behaviour is described and its relation to null and spacelike infinity is given, as far as known. (Auth.)

  15. 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

  16. An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm

    Science.gov (United States)

    Zhang, B.; Sang, Jun; Alam, Mohammad S.

    2013-03-01

    An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm was proposed. Firstly, the original secret image was encrypted into two phase-only masks M1 and M2 via cascaded iterative Fourier transform (CIFT) algorithm. Then, the public-key encryption algorithm RSA was adopted to encrypt M2 into M2' . Finally, a host image was enlarged by extending one pixel into 2×2 pixels and each element in M1 and M2' was multiplied with a superimposition coefficient and added to or subtracted from two different elements in the 2×2 pixels of the enlarged host image. To recover the secret image from the stego-image, the two masks were extracted from the stego-image without the original host image. By applying public-key encryption algorithm, the key distribution was facilitated, and also compared with the image hiding method based on optical interference, the proposed method may reach higher robustness by employing the characteristics of the CIFT algorithm. Computer simulations show that this method has good robustness against image processing.

  17. Solution of Fractional Partial Differential Equations in Fluid Mechanics by Extension of Some Iterative Method

    Directory of Open Access Journals (Sweden)

    A. A. Hemeda

    2013-01-01

    Full Text Available An extension of the so-called new iterative method (NIM has been used to handle linear and nonlinear fractional partial differential equations. The main property of the method lies in its flexibility and ability to solve nonlinear equations accurately and conveniently. Therefore, a general framework of the NIM is presented for analytical treatment of fractional partial differential equations in fluid mechanics. The fractional derivatives are described in the Caputo sense. Numerical illustrations that include the fractional wave equation, fractional Burgers equation, fractional KdV equation, fractional Klein-Gordon equation, and fractional Boussinesq-like equation are investigated to show the pertinent features of the technique. Comparison of the results obtained by the NIM with those obtained by both Adomian decomposition method (ADM and the variational iteration method (VIM reveals that the NIM is very effective and convenient. The basic idea described in this paper is expected to be further employed to solve other similar linear and nonlinear problems in fractional calculus.

  18. On the Application of Iterative Methods of Nondifferentiable Optimization to Some Problems of Approximation Theory

    Directory of Open Access Journals (Sweden)

    Stefan M. Stefanov

    2014-01-01

    Full Text Available We consider the data fitting problem, that is, the problem of approximating a function of several variables, given by tabulated data, and the corresponding problem for inconsistent (overdetermined systems of linear algebraic equations. Such problems, connected with measurement of physical quantities, arise, for example, in physics, engineering, and so forth. A traditional approach for solving these two problems is the discrete least squares data fitting method, which is based on discrete l2-norm. In this paper, an alternative approach is proposed: with each of these problems, we associate a nondifferentiable (nonsmooth unconstrained minimization problem with an objective function, based on discrete l1- and/or l∞-norm, respectively; that is, these two norms are used as proximity criteria. In other words, the problems under consideration are solved by minimizing the residual using these two norms. Respective subgradients are calculated, and a subgradient method is used for solving these two problems. The emphasis is on implementation of the proposed approach. Some computational results, obtained by an appropriate iterative method, are given at the end of the paper. These results are compared with the results, obtained by the iterative gradient method for the corresponding “differentiable” discrete least squares problems, that is, approximation problems based on discrete l2-norm.

  19. 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.

  20. 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)

  1. 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.

  2. A holistic calibration method with iterative distortion compensation for stereo deflectometry

    Science.gov (United States)

    Xu, Yongjia; Gao, Feng; Zhang, Zonghua; Jiang, Xiangqian

    2018-07-01

    This paper presents a novel holistic calibration method for stereo deflectometry system to improve the system measurement accuracy. The reconstruction result of stereo deflectometry is integrated with the calculated normal data of the measured surface. The calculation accuracy of the normal data is seriously influenced by the calibration accuracy of the geometrical relationship of the stereo deflectometry system. Conventional calibration approaches introduce form error to the system due to inaccurate imaging model and distortion elimination. The proposed calibration method compensates system distortion based on an iterative algorithm instead of the conventional distortion mathematical model. The initial value of the system parameters are calculated from the fringe patterns displayed on the systemic LCD screen through a reflection of a markless flat mirror. An iterative algorithm is proposed to compensate system distortion and optimize camera imaging parameters and system geometrical relation parameters based on a cost function. Both simulation work and experimental results show the proposed calibration method can significantly improve the calibration and measurement accuracy of a stereo deflectometry. The PV (peak value) of measurement error of a flat mirror can be reduced to 69.7 nm by applying the proposed method from 282 nm obtained with the conventional calibration approach.

  3. 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.

  4. Asymptotic integration of differential and difference equations

    CERN Document Server

    Bodine, Sigrun

    2015-01-01

    This book presents the theory of asymptotic integration for both linear differential and difference equations. This type of asymptotic analysis is based on some fundamental principles by Norman Levinson. While he applied them to a special class of differential equations, subsequent work has shown that the same principles lead to asymptotic results for much wider classes of differential and also difference equations. After discussing asymptotic integration in a unified approach, this book studies how the application of these methods provides several new insights and frequent improvements to results found in earlier literature. It then continues with a brief introduction to the relatively new field of asymptotic integration for dynamic equations on time scales. Asymptotic Integration of Differential and Difference Equations is a self-contained and clearly structured presentation of some of the most important results in asymptotic integration and the techniques used in this field. It will appeal to researchers i...

  5. 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.

  6. Application of iterative method with dynamic weight based on observation equation's constant in NPP's surveying

    International Nuclear Information System (INIS)

    Chen Benfu; Guo Xianchun; Zou Zili

    2009-01-01

    It' s useful to identify the data with errors from the large number of observations during the process of adjustment to decrease the influence of the errors and to improve the quality of the final surveying result. Based on practical conditions of the nuclear power plant's plain control network, it has been given on how to simply calculate the threshold value which used to pre-weight each datum before adjustment calculation; it shows some superiorities in efficiency on data snooping and in quality of the final calculation compared with some traditional methods such as robust estimation, which process data with dynamic weight based the observation' s correction after each iteration. (authors)

  7. 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 0

  8. Construction of a path of MHD equilibrium solutions by an iterative method

    International Nuclear Information System (INIS)

    Kikuchi, Fumio.

    1979-09-01

    This paper shows a constructive proof of the existence of a path of solutions to a nonlinear eigenvalue problem expressed by -Δu = lambda u + in Ω, and u = -1 on deltaΩ where Ω is a two-dimensional domain with a boundary deltaΩ. This problem arises from the ideal MHD equilibria in tori. The existence proof is based on the principle of contraction mappings, which is widely employed in nonlinear problems such as those associated with bifurcation phenomena. Some comments are also given on the application of the present iteration techniques to numerical method. (author)

  9. 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

  10. 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...

  11. 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

  12. 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

  13. Iterative correction method for shift-variant blurring caused by collimator aperture in SPECT

    International Nuclear Information System (INIS)

    Ogawa, Koichi; Katsu, Haruto

    1996-01-01

    A collimation system in single photon computed tomography (SPECT) induces blurring on reconstructed images. The blurring varies with the collimator aperture which is determined by the shape of the hole (its diameter and length), and with the distance between the collimator surface and the object. The blurring has shift-variant properties. This paper presents a new iterative method for correcting the shift-variant blurring. The method estimates the ratio of 'ideal projection value' to 'measured projection value' at each sample point. The term 'ideal projection value' means the number of photons which enter the hole perpendicular to the collimator surface, and the term 'measured projection value' means the number of photons which enter the hole at acute angles to the collimator aperture axis. If the estimation is accurate, ideal projection value can be obtained as the product of the measured projection value and the estimated ratio. The accuracy of the estimation is improved iteratively by comparing the measured projection value with a weighted summation of several estimated projection value. The simulation results showed that spatial resolution was improved without amplification of artifacts due to statistical noise. (author)

  14. 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.

  15. 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

  16. Radiation pattern synthesis of planar antennas using the iterative sampling method

    Science.gov (United States)

    Stutzman, W. L.; Coffey, E. L.

    1975-01-01

    A synthesis method is presented for determining an excitation of an arbitrary (but fixed) planar source configuration. The desired radiation pattern is specified over all or part of the visible region. It may have multiple and/or shaped main beams with low sidelobes. The iterative sampling method is used to find an excitation of the source which yields a radiation pattern that approximates the desired pattern to within a specified tolerance. In this paper the method is used to calculate excitations for line sources, linear arrays (equally and unequally spaced), rectangular apertures, rectangular arrays (arbitrary spacing grid), and circular apertures. Examples using these sources to form patterns with shaped main beams, multiple main beams, shaped sidelobe levels, and combinations thereof are given.

  17. Use of the iterative solution method for coupled finite element and boundary element modeling

    International Nuclear Information System (INIS)

    Koteras, J.R.

    1993-07-01

    Tunnels buried deep within the earth constitute an important class geomechanics problems. Two numerical techniques used for the analysis of geomechanics problems, the finite element method and the boundary element method, have complementary characteristics for applications to problems of this type. The usefulness of combining these two methods for use as a geomechanics analysis tool has been recognized for some time, and a number of coupling techniques have been proposed. However, not all of them lend themselves to efficient computational implementations for large-scale problems. This report examines a coupling technique that can form the basis for an efficient analysis tool for large scale geomechanics problems through the use of an iterative equation solver

  18. Comparing performance of standard and iterative linear unmixing methods for hyperspectral signatures

    Science.gov (United States)

    Gault, Travis R.; Jansen, Melissa E.; DeCoster, Mallory E.; Jansing, E. David; Rodriguez, Benjamin M.

    2016-05-01

    Linear unmixing is a method of decomposing a mixed signature to determine the component materials that are present in sensor's field of view, along with the abundances at which they occur. Linear unmixing assumes that energy from the materials in the field of view is mixed in a linear fashion across the spectrum of interest. Traditional unmixing methods can take advantage of adjacent pixels in the decomposition algorithm, but is not the case for point sensors. This paper explores several iterative and non-iterative methods for linear unmixing, and examines their effectiveness at identifying the individual signatures that make up simulated single pixel mixed signatures, along with their corresponding abundances. The major hurdle addressed in the proposed method is that no neighboring pixel information is available for the spectral signature of interest. Testing is performed using two collections of spectral signatures from the Johns Hopkins University Applied Physics Laboratory's Signatures Database software (SigDB): a hand-selected small dataset of 25 distinct signatures from a larger dataset of approximately 1600 pure visible/near-infrared/short-wave-infrared (VIS/NIR/SWIR) spectra. Simulated spectra are created with three and four material mixtures randomly drawn from a dataset originating from SigDB, where the abundance of one material is swept in 10% increments from 10% to 90%with the abundances of the other materials equally divided amongst the remainder. For the smaller dataset of 25 signatures, all combinations of three or four materials are used to create simulated spectra, from which the accuracy of materials returned, as well as the correctness of the abundances, is compared to the inputs. The experiment is expanded to include the signatures from the larger dataset of almost 1600 signatures evaluated using a Monte Carlo scheme with 5000 draws of three or four materials to create the simulated mixed signatures. The spectral similarity of the inputs to the

  19. Asymptotically Safe Dark Matter

    DEFF Research Database (Denmark)

    Sannino, Francesco; Shoemaker, Ian M.

    2015-01-01

    We introduce a new paradigm for dark matter (DM) interactions in which the interaction strength is asymptotically safe. In models of this type, the coupling strength is small at low energies but increases at higher energies, and asymptotically approaches a finite constant value. The resulting...... searches are the primary ways to constrain or discover asymptotically safe dark matter....

  20. Asymptotic analysis and boundary layers

    CERN Document Server

    Cousteix, Jean

    2007-01-01

    This book presents a new method of asymptotic analysis of boundary-layer problems, the Successive Complementary Expansion Method (SCEM). The first part is devoted to a general comprehensive presentation of the tools of asymptotic analysis. It gives the keys to understand a boundary-layer problem and explains the methods to construct an approximation. The second part is devoted to SCEM and its applications in fluid mechanics, including external and internal flows. The advantages of SCEM are discussed in comparison with the standard Method of Matched Asymptotic Expansions. In particular, for the first time, the theory of Interactive Boundary Layer is fully justified. With its chapter summaries, detailed derivations of results, discussed examples and fully worked out problems and solutions, the book is self-contained. It is written on a mathematical level accessible to graduate and post-graduate students of engineering and physics with a good knowledge in fluid mechanics. Researchers and practitioners will estee...

  1. A Comparison of Sequential and GPU Implementations of Iterative Methods to Compute Reachability Probabilities

    Directory of Open Access Journals (Sweden)

    Elise Cormie-Bowins

    2012-10-01

    Full Text Available We consider the problem of computing reachability probabilities: given a Markov chain, an initial state of the Markov chain, and a set of goal states of the Markov chain, what is the probability of reaching any of the goal states from the initial state? This problem can be reduced to solving a linear equation Ax = b for x, where A is a matrix and b is a vector. We consider two iterative methods to solve the linear equation: the Jacobi method and the biconjugate gradient stabilized (BiCGStab method. For both methods, a sequential and a parallel version have been implemented. The parallel versions have been implemented on the compute unified device architecture (CUDA so that they can be run on a NVIDIA graphics processing unit (GPU. From our experiments we conclude that as the size of the matrix increases, the CUDA implementations outperform the sequential implementations. Furthermore, the BiCGStab method performs better than the Jacobi method for dense matrices, whereas the Jacobi method does better for sparse ones. Since the reachability probabilities problem plays a key role in probabilistic model checking, we also compared the implementations for matrices obtained from a probabilistic model checker. Our experiments support the conjecture by Bosnacki et al. that the Jacobi method is superior to Krylov subspace methods, a class to which the BiCGStab method belongs, for probabilistic model checking.

  2. 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.

  3. An iterative method for hydrodynamic interactions in Brownian dynamics simulations of polymer dynamics

    Science.gov (United States)

    Miao, Linling; Young, Charles D.; Sing, Charles E.

    2017-07-01

    Brownian Dynamics (BD) simulations are a standard tool for understanding the dynamics of polymers in and out of equilibrium. Quantitative comparison can be made to rheological measurements of dilute polymer solutions, as well as direct visual observations of fluorescently labeled DNA. The primary computational challenge with BD is the expensive calculation of hydrodynamic interactions (HI), which are necessary to capture physically realistic dynamics. The full HI calculation, performed via a Cholesky decomposition every time step, scales with the length of the polymer as O(N3). This limits the calculation to a few hundred simulated particles. A number of approximations in the literature can lower this scaling to O(N2 - N2.25), and explicit solvent methods scale as O(N); however both incur a significant constant per-time step computational cost. Despite this progress, there remains a need for new or alternative methods of calculating hydrodynamic interactions; large polymer chains or semidilute polymer solutions remain computationally expensive. In this paper, we introduce an alternative method for calculating approximate hydrodynamic interactions. Our method relies on an iterative scheme to establish self-consistency between a hydrodynamic matrix that is averaged over simulation and the hydrodynamic matrix used to run the simulation. Comparison to standard BD simulation and polymer theory results demonstrates that this method quantitatively captures both equilibrium and steady-state dynamics after only a few iterations. The use of an averaged hydrodynamic matrix allows the computationally expensive Brownian noise calculation to be performed infrequently, so that it is no longer the bottleneck of the simulation calculations. We also investigate limitations of this conformational averaging approach in ring polymers.

  4. A guidance law for UAV autonomous aerial refueling based on the iterative computation method

    Directory of Open Access Journals (Sweden)

    Luo Delin

    2014-08-01

    Full Text Available The rendezvous and formation problem is a significant part for the unmanned aerial vehicle (UAV autonomous aerial refueling (AAR technique. It can be divided into two major phases: the long-range guidance phase and the formation phase. In this paper, an iterative computation guidance law (ICGL is proposed to compute a series of state variables to get the solution of a control variable for a UAV conducting rendezvous with a tanker in AAR. The proposed method can make the control variable converge to zero when the tanker and the UAV receiver come to a formation flight eventually. For the long-range guidance phase, the ICGL divides it into two sub-phases: the correction sub-phase and the guidance sub-phase. The two sub-phases share the same iterative process. As for the formation phase, a velocity coordinate system is created by which control accelerations are designed to make the speed of the UAV consistent with that of the tanker. The simulation results demonstrate that the proposed ICGL is effective and robust against wind disturbance.

  5. User input in iterative design for prevention product development: leveraging interdisciplinary methods to optimize effectiveness.

    Science.gov (United States)

    Guthrie, Kate M; Rosen, Rochelle K; Vargas, Sara E; Guillen, Melissa; Steger, Arielle L; Getz, Melissa L; Smith, Kelley A; Ramirez, Jaime J; Kojic, Erna M

    2017-10-01

    The development of HIV-preventive topical vaginal microbicides has been challenged by a lack of sufficient adherence in later stage clinical trials to confidently evaluate effectiveness. This dilemma has highlighted the need to integrate translational research earlier in the drug development process, essentially applying behavioral science to facilitate the advances of basic science with respect to the uptake and use of biomedical prevention technologies. In the last several years, there has been an increasing recognition that the user experience, specifically the sensory experience, as well as the role of meaning-making elicited by those sensations, may play a more substantive role than previously thought. Importantly, the role of the user-their sensory perceptions, their judgements of those experiences, and their willingness to use a product-is critical in product uptake and consistent use post-marketing, ultimately realizing gains in global public health. Specifically, a successful prevention product requires an efficacious drug, an efficient drug delivery system, and an effective user. We present an integrated iterative drug development and user experience evaluation method to illustrate how user-centered formulation design can be iterated from the early stages of preclinical development to leverage the user experience. Integrating the user and their product experiences into the formulation design process may help optimize both the efficiency of drug delivery and the effectiveness of the user.

  6. An iterative algorithm for solving the multidimensional neutron diffusion nodal method equations on parallel computers

    International Nuclear Information System (INIS)

    Kirk, B.L.; Azmy, Y.Y.

    1992-01-01

    In this paper the one-group, steady-state neutron diffusion equation in two-dimensional Cartesian geometry is solved using the nodal integral method. The discrete variable equations comprise loosely coupled sets of equations representing the nodal balance of neutrons, as well as neutron current continuity along rows or columns of computational cells. An iterative algorithm that is more suitable for solving large problems concurrently is derived based on the decomposition of the spatial domain and is accelerated using successive overrelaxation. This algorithm is very well suited for parallel computers, especially since the spatial domain decomposition occurs naturally, so that the number of iterations required for convergence does not depend on the number of processors participating in the calculation. Implementation of the authors' algorithm on the Intel iPSC/2 hypercube and Sequent Balance 8000 parallel computer is presented, and measured speedup and efficiency for test problems are reported. The results suggest that the efficiency of the hypercube quickly deteriorates when many processors are used, while the Sequent Balance retains very high efficiency for a comparable number of participating processors. This leads to the conjecture that message-passing parallel computers are not as well suited for this algorithm as shared-memory machines

  7. Iterative observer based method for source localization problem for Poisson equation in 3D

    KAUST Repository

    Majeed, Muhammad Usman

    2017-07-10

    A state-observer based method is developed to solve point source localization problem for Poisson equation in a 3D rectangular prism with available boundary data. The technique requires a weighted sum of solutions of multiple boundary data estimation problems for Laplace equation over the 3D domain. The solution of each of these boundary estimation problems involves writing down the mathematical problem in state-space-like representation using one of the space variables as time-like. First, system observability result for 3D boundary estimation problem is recalled in an infinite dimensional setting. Then, based on the observability result, the boundary estimation problem is decomposed into a set of independent 2D sub-problems. These 2D problems are then solved using an iterative observer to obtain the solution. Theoretical results are provided. The method is implemented numerically using finite difference discretization schemes. Numerical illustrations along with simulation results are provided.

  8. A practical iterative PID tuning method for mechanical systems using parameter chart

    Science.gov (United States)

    Kang, M.; Cheong, J.; Do, H. M.; Son, Y.; Niculescu, S.-I.

    2017-10-01

    In this paper, we propose a method of iterative proportional-integral-derivative parameter tuning for mechanical systems that possibly possess hidden mechanical resonances, using a parameter chart which visualises the closed-loop characteristics in a 2D parameter space. We employ a hypothetical assumption that the considered mechanical systems have their upper limit of the derivative feedback gain, from which the feasible region in the parameter chart becomes fairly reduced and thus the gain selection can be extremely simplified. Then, a two-directional parameter search is carried out within the feasible region in order to find the best set of parameters. Experimental results show the validity of the assumption used and the proposed parameter tuning method.

  9. SPET reconstruction with a non-uniform attenuation coefficient using an analytical regularizing iterative method

    International Nuclear Information System (INIS)

    Soussaline, F.; LeCoq, C.; Raynaud, C.; Kellershohn, C.

    1982-09-01

    The aim of this study is to evaluate the potential of the RIM technique when used in brain studies. The analytical Regulatorizing Iterative Method (RIM) is designed to provide fast and accurate reconstruction of tomographic images when non-uniform attenuation is to be accounted for. As indicated by phantom studies, this method improves the contrast and the signal-to-noise ratio as compared to those obtained with FBP (Filtered Back Projection) technique. Preliminary results obtained in brain studies using AMPI-123 (isopropil-amphetamine I-123) are very encouraging in terms of quantitative regional cellular activity. However, the clinical usefulness of this mathematically accurate reconstruction procedure is going to be demonstrated in our Institution, in comparing quantitative data in heart or liver studies where control values can be obtained

  10. SPET reconstruction with a non-uniform attenuation coefficient using an analytical regularizing iterative method

    International Nuclear Information System (INIS)

    Soussaline, F.; LeCoq, C.; Raynaud, C.; Kellershohn

    1982-01-01

    The potential of the Regularizing Iterative Method (RIM), when used in brain studies, is evaluated. RIM is designed to provide fast and accurate reconstruction of tomographic images when non-uniform attenuation is to be accounted for. As indicated by phantom studies, this method improves the contrast and the signal-to-noise ratio as compared to those obtained with Filtered Back Projection (FBP) technique. Preliminary results obtained in brain studies using isopropil-amphetamine I-123 (AMPI-123) are very encouraging in terms of quantitative regional cellular activity. However, the clinical usefulness of this mathematically accurate reconstruction procedure is going to be demonstrated, in comparing quantitative data in heart or liver studies where control values can be obtained

  11. Iterative Dipole Moment Method for the Dielectrophoretic Particle-Particle Interaction in a DC Electric Field

    Directory of Open Access Journals (Sweden)

    Qing Zhang

    2018-01-01

    Full Text Available Electric force is the most popular technique for bioparticle transportation and manipulation in microfluidic systems. In this paper, the iterative dipole moment (IDM method was used to calculate the dielectrophoretic (DEP forces of particle-particle interactions in a two-dimensional DC electric field, and the Lagrangian method was used to solve the transportation of particles. It was found that the DEP properties and whether the connection line between initial positions of particles perpendicular or parallel to the electric field greatly affect the chain patterns. In addition, the dependence of the DEP particle interaction upon the particle diameters, initial particle positions, and the DEP properties have been studied in detail. The conclusions are advantageous in elelctrokinetic microfluidic systems where it may be desirable to control, manipulate, and assemble bioparticles.

  12. Accuracy improvement of a hybrid robot for ITER application using POE modeling method

    International Nuclear Information System (INIS)

    Wang, Yongbo; Wu, Huapeng; Handroos, Heikki

    2013-01-01

    Highlights: ► The product of exponential (POE) formula for error modeling of hybrid robot. ► Differential Evolution (DE) algorithm for parameter identification. ► Simulation results are given to verify the effectiveness of the method. -- Abstract: This paper focuses on the kinematic calibration of a 10 degree-of-freedom (DOF) redundant serial–parallel hybrid robot to improve its accuracy. The robot was designed to perform the assembling and repairing tasks of the vacuum vessel (VV) of the international thermonuclear experimental reactor (ITER). By employing the product of exponentials (POEs) formula, we extended the POE-based calibration method from serial robot to redundant serial–parallel hybrid robot. The proposed method combines the forward and inverse kinematics together to formulate a hybrid calibration method for serial–parallel hybrid robot. Because of the high nonlinear characteristics of the error model and too many error parameters need to be identified, the traditional iterative linear least-square algorithms cannot be used to identify the parameter errors. This paper employs a global optimization algorithm, Differential Evolution (DE), to identify parameter errors by solving the inverse kinematics of the hybrid robot. Furthermore, after the parameter errors were identified, the DE algorithm was adopted to numerically solve the forward kinematics of the hybrid robot to demonstrate the accuracy improvement of the end-effector. Numerical simulations were carried out by generating random parameter errors at the allowed tolerance limit and generating a number of configuration poses in the robot workspace. Simulation of the real experimental conditions shows that the accuracy of the end-effector can be improved to the same precision level of the given external measurement device

  13. Accuracy improvement of a hybrid robot for ITER application using POE modeling method

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Yongbo, E-mail: yongbo.wang@hotmail.com [Laboratory of Intelligent Machines, Lappeenranta University of Technology, FIN-53851 Lappeenranta (Finland); Wu, Huapeng; Handroos, Heikki [Laboratory of Intelligent Machines, Lappeenranta University of Technology, FIN-53851 Lappeenranta (Finland)

    2013-10-15

    Highlights: ► The product of exponential (POE) formula for error modeling of hybrid robot. ► Differential Evolution (DE) algorithm for parameter identification. ► Simulation results are given to verify the effectiveness of the method. -- Abstract: This paper focuses on the kinematic calibration of a 10 degree-of-freedom (DOF) redundant serial–parallel hybrid robot to improve its accuracy. The robot was designed to perform the assembling and repairing tasks of the vacuum vessel (VV) of the international thermonuclear experimental reactor (ITER). By employing the product of exponentials (POEs) formula, we extended the POE-based calibration method from serial robot to redundant serial–parallel hybrid robot. The proposed method combines the forward and inverse kinematics together to formulate a hybrid calibration method for serial–parallel hybrid robot. Because of the high nonlinear characteristics of the error model and too many error parameters need to be identified, the traditional iterative linear least-square algorithms cannot be used to identify the parameter errors. This paper employs a global optimization algorithm, Differential Evolution (DE), to identify parameter errors by solving the inverse kinematics of the hybrid robot. Furthermore, after the parameter errors were identified, the DE algorithm was adopted to numerically solve the forward kinematics of the hybrid robot to demonstrate the accuracy improvement of the end-effector. Numerical simulations were carried out by generating random parameter errors at the allowed tolerance limit and generating a number of configuration poses in the robot workspace. Simulation of the real experimental conditions shows that the accuracy of the end-effector can be improved to the same precision level of the given external measurement device.

  14. Clinical correlative evaluation of an iterative method for reconstruction of brain SPECT images

    International Nuclear Information System (INIS)

    Nobili, Flavio; Vitali, Paolo; Calvini, Piero; Bollati, Francesca; Girtler, Nicola; Delmonte, Marta; Mariani, Giuliano; Rodriguez, Guido

    2001-01-01

    Background: Brain SPECT and PET investigations have showed discrepancies in Alzheimer's disease (AD) when considering data deriving from deeply located structures, such as the mesial temporal lobe. These discrepancies could be due to a variety of factors, including substantial differences in gamma-cameras and underlying technology. Mesial temporal structures are deeply located within the brain and the commonly used Filtered Back-Projection (FBP) technique does not fully take into account either the physical parameters of gamma-cameras or geometry of collimators. In order to overcome these limitations, alternative reconstruction methods have been proposed, such as the iterative method of the Conjugate Gradients with modified matrix (CG). However, the clinical applications of these methods have so far been only anecdotal. The present study was planned to compare perfusional SPECT data as derived from the conventional FBP method and from the iterative CG method, which takes into account the geometrical and physical characteristics of the gamma-camera, by a correlative approach with neuropsychology. Methods: Correlations were compared between perfusion of the hippocampal region, as achieved by both the FBP and the CG reconstruction methods, and a short-memory test (Selective Reminding Test, SRT), specifically addressing one of its function. A brain-dedicated camera (CERASPECT) was used for SPECT studies with 99m Tc-hexamethylpropylene-amine-oxime in 23 consecutive patients (mean age: 74.2±6.5) with mild (Mini-Mental Status Examination score ≥15, mean 20.3±3), probable AD. Counts from a hippocampal region in each hemisphere were referred to the average thalamic counts. Results: Hippocampal perfusion significantly correlated with the MMSE score with similar statistical significance (p<0.01) between the two reconstruction methods. Correlation between hippocampal perfusion and the SRT score was better with the CG method (r=0.50 for both hemispheres, p<0.01) than with

  15. Clinical correlative evaluation of an iterative method for reconstruction of brain SPECT images

    Energy Technology Data Exchange (ETDEWEB)

    Nobili, Flavio E-mail: fnobili@smartino.ge.it; Vitali, Paolo; Calvini, Piero; Bollati, Francesca; Girtler, Nicola; Delmonte, Marta; Mariani, Giuliano; Rodriguez, Guido

    2001-08-01

    Background: Brain SPECT and PET investigations have showed discrepancies in Alzheimer's disease (AD) when considering data deriving from deeply located structures, such as the mesial temporal lobe. These discrepancies could be due to a variety of factors, including substantial differences in gamma-cameras and underlying technology. Mesial temporal structures are deeply located within the brain and the commonly used Filtered Back-Projection (FBP) technique does not fully take into account either the physical parameters of gamma-cameras or geometry of collimators. In order to overcome these limitations, alternative reconstruction methods have been proposed, such as the iterative method of the Conjugate Gradients with modified matrix (CG). However, the clinical applications of these methods have so far been only anecdotal. The present study was planned to compare perfusional SPECT data as derived from the conventional FBP method and from the iterative CG method, which takes into account the geometrical and physical characteristics of the gamma-camera, by a correlative approach with neuropsychology. Methods: Correlations were compared between perfusion of the hippocampal region, as achieved by both the FBP and the CG reconstruction methods, and a short-memory test (Selective Reminding Test, SRT), specifically addressing one of its function. A brain-dedicated camera (CERASPECT) was used for SPECT studies with {sup 99m}Tc-hexamethylpropylene-amine-oxime in 23 consecutive patients (mean age: 74.2{+-}6.5) with mild (Mini-Mental Status Examination score {>=}15, mean 20.3{+-}3), probable AD. Counts from a hippocampal region in each hemisphere were referred to the average thalamic counts. Results: Hippocampal perfusion significantly correlated with the MMSE score with similar statistical significance (p<0.01) between the two reconstruction methods. Correlation between hippocampal perfusion and the SRT score was better with the CG method (r=0.50 for both hemispheres, p<0

  16. Study on monostable and bistable reaction-diffusion equations by iteration of travelling wave maps

    Science.gov (United States)

    Yi, Taishan; Chen, Yuming

    2017-12-01

    In this paper, based on the iterative properties of travelling wave maps, we develop a new method to obtain spreading speeds and asymptotic propagation for monostable and bistable reaction-diffusion equations. Precisely, for Dirichlet problems of monostable reaction-diffusion equations on the half line, by making links between travelling wave maps and integral operators associated with the Dirichlet diffusion kernel (the latter is NOT invariant under translation), we obtain some iteration properties of the Dirichlet diffusion and some a priori estimates on nontrivial solutions of Dirichlet problems under travelling wave transformation. We then provide the asymptotic behavior of nontrivial solutions in the space-time region for Dirichlet problems. These enable us to develop a unified method to obtain results on heterogeneous steady states, travelling waves, spreading speeds, and asymptotic spreading behavior for Dirichlet problem of monostable reaction-diffusion equations on R+ as well as of monostable/bistable reaction-diffusion equations on R.

  17. 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.)

  18. Iterative methods for the solution of very large complex symmetric linear systems of equations in electrodynamics

    Energy Technology Data Exchange (ETDEWEB)

    Clemens, M.; Weiland, T. [Technische Hochschule Darmstadt (Germany)

    1996-12-31

    In the field of computational electrodynamics the discretization of Maxwell`s equations using the Finite Integration Theory (FIT) yields very large, sparse, complex symmetric linear systems of equations. For this class of complex non-Hermitian systems a number of conjugate gradient-type algorithms is considered. The complex version of the biconjugate gradient (BiCG) method by Jacobs can be extended to a whole class of methods for complex-symmetric algorithms SCBiCG(T, n), which only require one matrix vector multiplication per iteration step. In this class the well-known conjugate orthogonal conjugate gradient (COCG) method for complex-symmetric systems corresponds to the case n = 0. The case n = 1 yields the BiCGCR method which corresponds to the conjugate residual algorithm for the real-valued case. These methods in combination with a minimal residual smoothing process are applied separately to practical 3D electro-quasistatical and eddy-current problems in electrodynamics. The practical performance of the SCBiCG methods is compared with other methods such as QMR and TFQMR.

  19. Joint 2D-DOA and Frequency Estimation for L-Shaped Array Using Iterative Least Squares Method

    Directory of Open Access Journals (Sweden)

    Ling-yun Xu

    2012-01-01

    Full Text Available We introduce an iterative least squares method (ILS for estimating the 2D-DOA and frequency based on L-shaped array. The ILS iteratively finds direction matrix and delay matrix, then 2D-DOA and frequency can be obtained by the least squares method. Without spectral peak searching and pairing, this algorithm works well and pairs the parameters automatically. Moreover, our algorithm has better performance than conventional ESPRIT algorithm and propagator method. The useful behavior of the proposed algorithm is verified by simulations.

  20. Iterative methods for the detection of Hopf bifurcations in finite element discretisation of incompressible flow problems

    International Nuclear Information System (INIS)

    Cliffe, K.A.; Garratt, T.J.; Spence, A.

    1992-03-01

    This paper is concerned with the problem of computing a small number of eigenvalues of large sparse generalised eigenvalue problems arising from mixed finite element discretisations of time dependent equations modelling viscous incompressible flow. The eigenvalues of importance are those with smallest real part and can be used in a scheme to determine the stability of steady state solutions and to detect Hopf bifurcations. We introduce a modified Cayley transform of the generalised eigenvalue problem which overcomes a drawback of the usual Cayley transform applied to such problems. Standard iterative methods are then applied to the transformed eigenvalue problem to compute approximations to the eigenvalue of smallest real part. Numerical experiments are performed using a model of double diffusive convection. (author)

  1. Iterative Reconstruction Methods for Inverse Problems in Tomography with Hybrid Data

    DEFF Research Database (Denmark)

    Sherina, Ekaterina

    . The goal of these modalities is to quantify physical parameters of materials or tissues inside an object from given interior data, which is measured everywhere inside the object. The advantage of these modalities is that large variations in physical parameters can be resolved and therefore, they have...... data is precisely the reason why reconstructions with a high contrast and a high resolution can be expected. The main contributions of this thesis consist in formulating the underlying mathematical problems with interior data as nonlinear operator equations, theoretically analysing them within...... iteration and the Levenberg-Marquardt method are employed for solving the problems. The first problem considered in this thesis is a problem of conductivity estimation from interior measurements of the power density, known as Acousto-Electrical Tomography. A special case of limited angle tomography...

  2. The Neutron-Gamma Pulse Shape Discrimination Method for Neutron Flux Detection in the ITER

    International Nuclear Information System (INIS)

    Xu Xiufeng; Li Shiping; Cao Hongrui; Yin Zejie; Yuan Guoliang; Yang Qingwei

    2013-01-01

    The neutron flux monitor (NFM), as a significant diagnostic system in the International Thermonuclear Experimental Reactor (ITER), will play an important role in the readings of a series of key parameters in the fusion reaction process. As the core of the main electronic system of the NFM, the neutron-gamma pulse shape discrimination (n-γ PSD) can distinguish the neutron pulse from the gamma pulse and other disturbing pulses according to the thresholds of the rising time and the amplitude pre-installed on the board, the double timing point CFD method is used to get the rising time of the pulse. The n-γ PSD can provide an accurate neutron count. (magnetically confined plasma)

  3. High-order noise analysis for low dose iterative image reconstruction methods: ASIR, IRIS, and MBAI

    Science.gov (United States)

    Do, Synho; Singh, Sarabjeet; Kalra, Mannudeep K.; Karl, W. Clem; Brady, Thomas J.; Pien, Homer

    2011-03-01

    Iterative reconstruction techniques (IRTs) has been shown to suppress noise significantly in low dose CT imaging. However, medical doctors hesitate to accept this new technology because visual impression of IRT images are different from full-dose filtered back-projection (FBP) images. Most common noise measurements such as the mean and standard deviation of homogeneous region in the image that do not provide sufficient characterization of noise statistics when probability density function becomes non-Gaussian. In this study, we measure L-moments of intensity values of images acquired at 10% of normal dose and reconstructed by IRT methods of two state-of-art clinical scanners (i.e., GE HDCT and Siemens DSCT flash) by keeping dosage level identical to each other. The high- and low-dose scans (i.e., 10% of high dose) were acquired from each scanner and L-moments of noise patches were calculated for the comparison.

  4. Method for simultaneous measurement of borehole and formation neutron decay-times employing iterative fitting

    International Nuclear Information System (INIS)

    Schultz, W.E.

    1982-01-01

    A method is described of making in situ measurements of the thermal neutron decay time of earth formations in the vicinity of a wellbore. The borehole and earth formations in its vicinity are repetitively irradiated with pulsed fast neutrons and, during the intervals between pulses, capture gamma radiation is measured in at least four, non-overlapping, contiguous time intervals. A background radiation measurement is made between successive pulses and used to correct count-rates representative of thermal neutron populations in the borehole and the formations, the count-rates being generated during each of the time intervals. The background-corrected count-rate measurements are iteratively fitted to exponential curves using a least squares technique to simultaneously derive signals representing borehole component and formation component of the thermal neutron decay time. The signals are recorded as a function of borehole depth. (author)

  5. Iterative method to compute the Fermat points and Fermat distances of multiquarks

    International Nuclear Information System (INIS)

    Bicudo, P.; Cardoso, M.

    2009-01-01

    The multiquark confining potential is proportional to the total distance of the fundamental strings linking the quarks and antiquarks. We address the computation of the total string distance and of the Fermat points where the different strings meet. For a meson the distance is trivially the quark-antiquark distance. For a baryon the problem was solved geometrically from the onset by Fermat and by Torricelli, it can be determined just with a rule and a compass, and we briefly review it. However we also show that for tetraquarks, pentaquarks, hexaquarks, etc., the geometrical solution is much more complicated. Here we provide an iterative method, converging fast to the correct Fermat points and the total distances, relevant for the multiquark potentials.

  6. Iterative method to compute the Fermat points and Fermat distances of multiquarks

    Energy Technology Data Exchange (ETDEWEB)

    Bicudo, P. [CFTP, Departamento de Fisica, Instituto Superior Tecnico, Av. Rovisco Pais, 1049-001 Lisboa (Portugal)], E-mail: bicudo@ist.utl.pt; Cardoso, M. [CFTP, Departamento de Fisica, Instituto Superior Tecnico, Av. Rovisco Pais, 1049-001 Lisboa (Portugal)

    2009-04-13

    The multiquark confining potential is proportional to the total distance of the fundamental strings linking the quarks and antiquarks. We address the computation of the total string distance and of the Fermat points where the different strings meet. For a meson the distance is trivially the quark-antiquark distance. For a baryon the problem was solved geometrically from the onset by Fermat and by Torricelli, it can be determined just with a rule and a compass, and we briefly review it. However we also show that for tetraquarks, pentaquarks, hexaquarks, etc., the geometrical solution is much more complicated. Here we provide an iterative method, converging fast to the correct Fermat points and the total distances, relevant for the multiquark potentials.

  7. Green`s function of Maxwell`s equations and corresponding implications for iterative methods

    Energy Technology Data Exchange (ETDEWEB)

    Singer, B.S. [Macquarie Univ., Sydney (Australia); Fainberg, E.B. [Inst. of Physics of the Earth, Moscow (Russian Federation)

    1996-12-31

    Energy conservation law imposes constraints on the norm and direction of the Hilbert space vector representing a solution of Maxwell`s equations. In this paper, we derive these constrains and discuss the corresponding implications for the Green`s function of Maxwell`s equations in a dissipative medium. It is shown that Maxwell`s equations can be reduced to an integral equation with a contracting kernel. The equation can be solved using simple iterations. Software based on this algorithm have successfully been applied to a wide range of problems dealing with high contrast models. The matrix corresponding to the integral equation has a well defined spectrum. The equation can be symmetrized and solved using different approaches, for instance one of the conjugate gradient methods.

  8. Intelligent tuning method of PID parameters based on iterative learning control for atomic force microscopy.

    Science.gov (United States)

    Liu, Hui; Li, Yingzi; Zhang, Yingxu; Chen, Yifu; Song, Zihang; Wang, Zhenyu; Zhang, Suoxin; Qian, Jianqiang

    2018-01-01

    Proportional-integral-derivative (PID) parameters play a vital role in the imaging process of an atomic force microscope (AFM). Traditional parameter tuning methods require a lot of manpower and it is difficult to set PID parameters in unattended working environments. In this manuscript, an intelligent tuning method of PID parameters based on iterative learning control is proposed to self-adjust PID parameters of the AFM according to the sample topography. This method gets enough information about the output signals of PID controller and tracking error, which will be used to calculate the proper PID parameters, by repeated line scanning until convergence before normal scanning to learn the topography. Subsequently, the appropriate PID parameters are obtained by fitting method and then applied to the normal scanning process. The feasibility of the method is demonstrated by the convergence analysis. Simulations and experimental results indicate that the proposed method can intelligently tune PID parameters of the AFM for imaging different topographies and thus achieve good tracking performance. Copyright © 2017 Elsevier Ltd. All rights reserved.

  9. Management Optimization of Saguling Reservoir with Bellman Dynamic Programming and “Du Couloir” Iterative Method

    Directory of Open Access Journals (Sweden)

    Mariana Marselina

    2016-08-01

    Full Text Available The increasingly growth of population and industry sector have lead to an enhanced demand for electrical energy. One of the electricity providers in the area of Java-Madura Bali (Jamali is Saguling Reservoir. Saguling Reservoir is one of the three reservoirs that stem the flow of Citarum River in advance of to Jatiluhur and Cirata Reservoir. The average electricity production of Saguling Reservoir was 2,334,318.138 MWh/year in the period of 1986-2014. The water intake of Saguling Reservoir is the upstream Citarum Watershed with an area of 2340.88 km2 which also serves as the irrigation, inland fisheries, recreation, and other activities. An effort to improve the function of Saguling Reservoir in producing electrical energy is by optimizing the reservoir management. The optimization of Saguling Reservoir management in this study refers to Government Regulation No. 37/2010 on Dam/Reservoir Article 44 which states that the system of reservoir management consisting of the operation system in dry years, normal years, and wet years. In this research, the determination of the trajectory guideline in Saguling operation was divided in dry, normal and wet years. Trajectory guideline was conducted based on the electricity price of turbine inflow that various in every month. The determination of the trajectory guideline in various electricity price was done by using Program Dynamic Bellman (PD Bellman and “Du Couloir” iterative method which the objective to optimize the gain from electricity production. and “Du Couloir” iterative method was development of PD Bellman that can calculate the value of gain with a smaller discretization until 0,1 juta m3 effectively where PD Bellman just calculate until 10 million m3.  Smaller discretization can give maximum benefit from electricity production and the trajectory guideline will be closer to trajectory actual so optimization of Saguling operation will be achieved.

  10. 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.

  11. Novel manufacturing method by using stainless steel pipes expanded into aluminium profiles for the ITER Neutral Beam cryopumps

    Energy Technology Data Exchange (ETDEWEB)

    Dremel, Matthias, E-mail: matthias.dremel@iter.org; Boissin, Jean-Claude; Déléage, Vincent; Quinn, Eamonn; Pearce, Robert

    2015-10-15

    This paper describes the novel engineering and manufacturing solution of stainless steel pipe expansion into aluminium extrusion profiles for use at cryogenic temperatures up to 400 K. This fabrication method will be used for the thermal radiation shields and the cryopanels of the ITER Neutral Beam cryopumps. The use of stainless steel pipes expanded into aluminium extrusion profiles is a solution that combines standard stainless steel welding procedures for the manifolds of the cooling circuits with extended aluminium structures taking advantage of the high thermal conductivity of aluminium. The cryogenic cooling circuits of the pump are a first confinement barrier in the ITER vacuum vessel and the risk of a leakage needs to be minimized as far as possible. The expansion method avoids the need of joints of dissimilar materials in the primary confinement barrier. The fabrication method and results of the prototyping of full scaled components for the ITER Neutral Beam cryopumps are outlined in this paper.

  12. Hand-Eye LRF-Based Iterative Plane Detection Method for Autonomous Robotic Welding

    Directory of Open Access Journals (Sweden)

    Sungmin Lee

    2015-12-01

    Full Text Available This paper proposes a hand-eye LRF-based (laser range finder welding plane-detection method for autonomous robotic welding in the field of shipbuilding. The hand-eye LRF system consists of a 6 DOF manipulator and an LRF attached to the wrist of the manipulator. The welding plane is detected by the LRF with only the wrist's rotation to minimize a mechanical error caused by the manipulator's motion. A position on the plane is determined as an average position of the detected points on the plane, and a normal vector to the plane is determined by applying PCA (principal component analysis to the detected points. In this case, the accuracy of the detected plane is analysed by simulations with respect to the wrist's angle interval and the plane angle. As a result of the analysis, an iterative plane-detection method with the manipulator's alignment motion is proposed to improve the performance of plane detection. For verifying the feasibility and effectiveness of the proposed plane-detection method, experiments are carried out with a prototype of the hand-eye LRF-based system, which consists of a 1 DOF wrist's joint, an LRF system and a rotatable plane. In addition, the experimental results of the PCA-based plane detection method are compared with those of the two representative plane-detection methods, based on RANSAC (RANdom SAmple Consensus and the 3D Hough transform in both accuracy and computation time's points of view.

  13. Fuzzy based method for project planning of the infrastructure design for the diagnostic in ITER

    International Nuclear Information System (INIS)

    Piros, Attila; Veres, Gábor

    2013-01-01

    The long-term design projects need special preparation before the start of the execution. This preparation usually includes the drawing of the network diagram for the whole procedure. This diagram includes the time estimation of the individual subtasks and gives us information about the predicted dates of the milestones. The calculated critical path in this network characterizes a specific design project concerning to its duration very well. Several methods are available to support this step of preparation. This paper describes a new method to map the structure of the design process and clarify the milestones and predict the dates of these milestones. The method is based on the PERT (Project Evaluation and Review Technique) network but as a novelty it applies fuzzy logic to find out the concerning times in this graph. With the application of the fuzzy logic the handling of the different kinds of design uncertainties becomes feasible. Many kinds of design uncertainties exist from the possible electric blackout up to the illness of an engineer. In many cases these uncertainties are related with human errors and described with linguistic expressions. The fuzzy logic enables to transform these ambiguous expressions into numeric values for further mathematical evaluation. The method is introduced in the planning of the design project of the infrastructure for the diagnostic systems of ITER. The method not only helps the project in the planning phase, but it will be a powerful tool in mathematical modeling and monitoring of the project execution

  14. Fuzzy based method for project planning of the infrastructure design for the diagnostic in ITER

    Energy Technology Data Exchange (ETDEWEB)

    Piros, Attila, E-mail: attila.piros@gt3.bme.hu [Department of Machine and Product Design, Budapest University of Technology and Economics, Budapest (Hungary); Veres, Gábor [Department of Plasma Physics, Wigner Research Centre for Physics, Hungarian Academy of Sciences, Budapest (Hungary)

    2013-10-15

    The long-term design projects need special preparation before the start of the execution. This preparation usually includes the drawing of the network diagram for the whole procedure. This diagram includes the time estimation of the individual subtasks and gives us information about the predicted dates of the milestones. The calculated critical path in this network characterizes a specific design project concerning to its duration very well. Several methods are available to support this step of preparation. This paper describes a new method to map the structure of the design process and clarify the milestones and predict the dates of these milestones. The method is based on the PERT (Project Evaluation and Review Technique) network but as a novelty it applies fuzzy logic to find out the concerning times in this graph. With the application of the fuzzy logic the handling of the different kinds of design uncertainties becomes feasible. Many kinds of design uncertainties exist from the possible electric blackout up to the illness of an engineer. In many cases these uncertainties are related with human errors and described with linguistic expressions. The fuzzy logic enables to transform these ambiguous expressions into numeric values for further mathematical evaluation. The method is introduced in the planning of the design project of the infrastructure for the diagnostic systems of ITER. The method not only helps the project in the planning phase, but it will be a powerful tool in mathematical modeling and monitoring of the project execution.

  15. Topographic mapping on large-scale tidal flats with an iterative approach on the waterline method

    Science.gov (United States)

    Kang, Yanyan; Ding, Xianrong; Xu, Fan; Zhang, Changkuan; Ge, Xiaoping

    2017-05-01

    Tidal flats, which are both a natural ecosystem and a type of landscape, are of significant importance to ecosystem function and land resource potential. Morphologic monitoring of tidal flats has become increasingly important with respect to achieving sustainable development targets. Remote sensing is an established technique for the measurement of topography over tidal flats; of the available methods, the waterline method is particularly effective for constructing a digital elevation model (DEM) of intertidal areas. However, application of the waterline method is more limited in large-scale, shifting tidal flats areas, where the tides are not synchronized and the waterline is not a quasi-contour line. For this study, a topographical map of the intertidal regions within the Radial Sand Ridges (RSR) along the Jiangsu Coast, China, was generated using an iterative approach on the waterline method. A series of 21 multi-temporal satellite images (18 HJ-1A/B CCD and three Landsat TM/OLI) of the RSR area collected at different water levels within a five month period (31 December 2013-28 May 2014) was used to extract waterlines based on feature extraction techniques and artificial further modification. These 'remotely-sensed waterlines' were combined with the corresponding water levels from the 'model waterlines' simulated by a hydrodynamic model with an initial generalized DEM of exposed tidal flats. Based on the 21 heighted 'remotely-sensed waterlines', a DEM was constructed using the ANUDEM interpolation method. Using this new DEM as the input data, it was re-entered into the hydrodynamic model, and a new round of water level assignment of waterlines was performed. A third and final output DEM was generated covering an area of approximately 1900 km2 of tidal flats in the RSR. The water level simulation accuracy of the hydrodynamic model was within 0.15 m based on five real-time tide stations, and the height accuracy (root mean square error) of the final DEM was 0.182 m

  16. Local Fractional Variational Iteration and Decomposition Methods for Wave Equation on Cantor Sets within Local Fractional Operators

    Directory of Open Access Journals (Sweden)

    Dumitru Baleanu

    2014-01-01

    Full Text Available We perform a comparison between the fractional iteration and decomposition methods applied to the wave equation on Cantor set. The operators are taken in the local sense. The results illustrate the significant features of the two methods which are both very effective and straightforward for solving the differential equations with local fractional derivative.

  17. Application of the Variational Iteration Method to the Initial Value Problems of Q-difference Equations-Some Examples

    Directory of Open Access Journals (Sweden)

    Yu Xiang Zeng

    2013-12-01

    Full Text Available The q-difference equations are a class of important models both in q-calculus and applied sciences. The variational iteration method is extended to approximately solve the initial value problems of q-difference equations. A q-analogue of the Lagrange multiplier is presented and three examples are illustrated to show the method's efficiency.

  18. On the solution of large-scale SDP problems by the modified barrier method using iterative solvers

    Czech Academy of Sciences Publication Activity Database

    Kočvara, Michal; Stingl, M.

    2007-01-01

    Roč. 109, 2-3 (2007), s. 413-444 ISSN 0025-5610 R&D Projects: GA AV ČR IAA1075402 Institutional research plan: CEZ:AV0Z10750506 Keywords : semidefinite programming * iterative methods * preconditioned conjugate gradient s * augmented lagrangian methods Subject RIV: BA - General Mathematics Impact factor: 1.475, year: 2007

  19. Monotone Hybrid Projection Algorithms for an Infinitely Countable Family of Lipschitz Generalized Asymptotically Quasi-Nonexpansive Mappings

    Directory of Open Access Journals (Sweden)

    Watcharaporn Cholamjiak

    2009-01-01

    Full Text Available We prove a weak convergence theorem of the modified Mann iteration process for a uniformly Lipschitzian and generalized asymptotically quasi-nonexpansive mapping in a uniformly convex Banach space. We also introduce two kinds of new monotone hybrid methods and obtain strong convergence theorems for an infinitely countable family of uniformly Lipschitzian and generalized asymptotically quasi-nonexpansive mappings in a Hilbert space. The results improve and extend the corresponding ones announced by Kim and Xu (2006 and Nakajo and Takahashi (2003.

  20. Iterative Outlier Removal: A Method for Identifying Outliers in Laboratory Recalibration Studies.

    Science.gov (United States)

    Parrinello, Christina M; Grams, Morgan E; Sang, Yingying; Couper, David; Wruck, Lisa M; Li, Danni; Eckfeldt, John H; Selvin, Elizabeth; Coresh, Josef

    2016-07-01

    Extreme values that arise for any reason, including those through nonlaboratory measurement procedure-related processes (inadequate mixing, evaporation, mislabeling), lead to outliers and inflate errors in recalibration studies. We present an approach termed iterative outlier removal (IOR) for identifying such outliers. We previously identified substantial laboratory drift in uric acid measurements in the Atherosclerosis Risk in Communities (ARIC) Study over time. Serum uric acid was originally measured in 1990-1992 on a Coulter DACOS instrument using an uricase-based measurement procedure. To recalibrate previous measured concentrations to a newer enzymatic colorimetric measurement procedure, uric acid was remeasured in 200 participants from stored plasma in 2011-2013 on a Beckman Olympus 480 autoanalyzer. To conduct IOR, we excluded data points >3 SDs from the mean difference. We continued this process using the resulting data until no outliers remained. IOR detected more outliers and yielded greater precision in simulation. The original mean difference (SD) in uric acid was 1.25 (0.62) mg/dL. After 4 iterations, 9 outliers were excluded, and the mean difference (SD) was 1.23 (0.45) mg/dL. Conducting only one round of outlier removal (standard approach) would have excluded 4 outliers [mean difference (SD) = 1.22 (0.51) mg/dL]. Applying the recalibration (derived from Deming regression) from each approach to the original measurements, the prevalence of hyperuricemia (>7 mg/dL) was 28.5% before IOR and 8.5% after IOR. IOR is a useful method for removal of extreme outliers irrelevant to recalibrating laboratory measurements, and identifies more extraneous outliers than the standard approach. © 2016 American Association for Clinical Chemistry.

  1. Iterative linear solvers in a 2D radiation-hydrodynamics code: Methods and performance

    International Nuclear Information System (INIS)

    Baldwin, C.; Brown, P.N.; Falgout, R.; Graziani, F.; Jones, J.

    1999-01-01

    Computer codes containing both hydrodynamics and radiation play a central role in simulating both astrophysical and inertial confinement fusion (ICF) phenomena. A crucial aspect of these codes is that they require an implicit solution of the radiation diffusion equations. The authors present in this paper the results of a comparison of five different linear solvers on a range of complex radiation and radiation-hydrodynamics problems. The linear solvers used are diagonally scaled conjugate gradient, GMRES with incomplete LU preconditioning, conjugate gradient with incomplete Cholesky preconditioning, multigrid, and multigrid-preconditioned conjugate gradient. These problems involve shock propagation, opacities varying over 5--6 orders of magnitude, tabular equations of state, and dynamic ALE (Arbitrary Lagrangian Eulerian) meshes. They perform a problem size scalability study by comparing linear solver performance over a wide range of problem sizes from 1,000 to 100,000 zones. The fundamental question they address in this paper is: Is it more efficient to invert the matrix in many inexpensive steps (like diagonally scaled conjugate gradient) or in fewer expensive steps (like multigrid)? In addition, what is the answer to this question as a function of problem size and is the answer problem dependent? They find that the diagonally scaled conjugate gradient method performs poorly with the growth of problem size, increasing in both iteration count and overall CPU time with the size of the problem and also increasing for larger time steps. For all problems considered, the multigrid algorithms scale almost perfectly (i.e., the iteration count is approximately independent of problem size and problem time step). For pure radiation flow problems (i.e., no hydrodynamics), they see speedups in CPU time of factors of ∼15--30 for the largest problems, when comparing the multigrid solvers relative to diagonal scaled conjugate gradient

  2. Iterative Boltzmann plot method for temperature and pressure determination in a xenon high pressure discharge lamp

    Energy Technology Data Exchange (ETDEWEB)

    Zalach, J.; Franke, St. [INP Greifswald, Felix-Hausdorff-Str. 2, 17489 Greifswald (Germany)

    2013-01-28

    The Boltzmann plot method allows to calculate plasma temperatures and pressures if absolutely calibrated emission coefficients of spectral lines are available. However, xenon arcs are not very well suited to be analyzed this way, as there are only a limited number of lines with atomic data available. These lines have high excitation energies in a small interval between 9.8 and 11.5 eV. Uncertainties in the experimental method and in the atomic data further limit the accuracy of the evaluation procedure. This may result in implausible values of temperature and pressure with inadmissible uncertainty. To omit these shortcomings, an iterative scheme is proposed that is making use of additional information about the xenon fill pressure. This method is proved to be robust against noisy data and significantly reduces the uncertainties. Intentionally distorted synthetic data are used to illustrate the performance of the method, and measurements performed on a laboratory xenon high pressure discharge lamp are analyzed resulting in reasonable temperatures and pressures with significantly reduced uncertainties.

  3. Efficacy of variational iteration method for chaotic Genesio system - Classical and multistage approach

    International Nuclear Information System (INIS)

    Goh, S.M.; Noorani, M.S.M.; Hashim, I.

    2009-01-01

    This is a case study of solving the Genesio system by using the classical variational iteration method (VIM) and a newly modified version called the multistage VIM (MVIM). VIM is an analytical technique that grants us a continuous representation of the approximate solution, which allows better information of the solution over the time interval. Unlike its counterpart, numerical techniques, such as the Runge-Kutta method, provide solutions only at two ends of the time interval (with condition that the selected time interval is adequately small for convergence). Furthermore, it offers approximate solutions in a discretized form, making it complicated in achieving a continuous representation. The explicit solutions through VIM and MVIM are compared with the numerical analysis of the fourth-order Runge-Kutta method (RK4). VIM had been successfully applied to linear and nonlinear systems of non-chaotic in nature and this had been testified by numerous scientists lately. Our intention is to determine whether VIM is also a feasible method in solving a chaotic system like Genesio. At the same time, MVIM will be applied to gauge its accuracy compared to VIM and RK4. Since, for most situations, the validity domain of the solutions is often an issue, we will consider a reasonably large time frame in our work.

  4. Rupture process of the 2013 Okhotsk deep mega earthquake from iterative backprojection and compress sensing methods

    Science.gov (United States)

    Qin, W.; Yin, J.; Yao, H.

    2013-12-01

    On May 24th 2013 a Mw 8.3 normal faulting earthquake occurred at a depth of approximately 600 km beneath the sea of Okhotsk, Russia. It is a rare mega earthquake that ever occurred at such a great depth. We use the time-domain iterative backprojection (IBP) method [1] and also the frequency-domain compressive sensing (CS) technique[2] to investigate the rupture process and energy radiation of this mega earthquake. We currently use the teleseismic P-wave data from about 350 stations of USArray. IBP is an improved method of the traditional backprojection method, which more accurately locates subevents (energy burst) during earthquake rupture and determines the rupture speeds. The total rupture duration of this earthquake is about 35 s with a nearly N-S rupture direction. We find that the rupture is bilateral in the beginning 15 seconds with slow rupture speeds: about 2.5km/s for the northward rupture and about 2 km/s for the southward rupture. After that, the northward rupture stopped while the rupture towards south continued. The average southward rupture speed between 20-35 s is approximately 5 km/s, lower than the shear wave speed (about 5.5 km/s) at the hypocenter depth. The total rupture length is about 140km, in a nearly N-S direction, with a southward rupture length about 100 km and a northward rupture length about 40 km. We also use the CS method, a sparse source inversion technique, to study the frequency-dependent seismic radiation of this mega earthquake. We observe clear along-strike frequency dependence of the spatial and temporal distribution of seismic radiation and rupture process. The results from both methods are generally similar. In the next step, we'll use data from dense arrays in southwest China and also global stations for further analysis in order to more comprehensively study the rupture process of this deep mega earthquake. Reference [1] Yao H, Shearer P M, Gerstoft P. Subevent location and rupture imaging using iterative backprojection for

  5. A sparsity-regularized Born iterative method for reconstruction of two-dimensional piecewise continuous inhomogeneous domains

    KAUST Repository

    Sandhu, Ali Imran; Desmal, Abdulla; Bagci, Hakan

    2016-01-01

    A sparsity-regularized Born iterative method (BIM) is proposed for efficiently reconstructing two-dimensional piecewise-continuous inhomogeneous dielectric profiles. Such profiles are typically not spatially sparse, which reduces the efficiency of the sparsity-promoting regularization. To overcome this problem, scattered fields are represented in terms of the spatial derivative of the dielectric profile and reconstruction is carried out over samples of the dielectric profile's derivative. Then, like the conventional BIM, the nonlinear problem is iteratively converted into a sequence of linear problems (in derivative samples) and sparsity constraint is enforced on each linear problem using the thresholded Landweber iterations. Numerical results, which demonstrate the efficiency and accuracy of the proposed method in reconstructing piecewise-continuous dielectric profiles, are presented.

  6. A sparsity-regularized Born iterative method for reconstruction of two-dimensional piecewise continuous inhomogeneous domains

    KAUST Repository

    Sandhu, Ali Imran

    2016-04-10

    A sparsity-regularized Born iterative method (BIM) is proposed for efficiently reconstructing two-dimensional piecewise-continuous inhomogeneous dielectric profiles. Such profiles are typically not spatially sparse, which reduces the efficiency of the sparsity-promoting regularization. To overcome this problem, scattered fields are represented in terms of the spatial derivative of the dielectric profile and reconstruction is carried out over samples of the dielectric profile\\'s derivative. Then, like the conventional BIM, the nonlinear problem is iteratively converted into a sequence of linear problems (in derivative samples) and sparsity constraint is enforced on each linear problem using the thresholded Landweber iterations. Numerical results, which demonstrate the efficiency and accuracy of the proposed method in reconstructing piecewise-continuous dielectric profiles, are presented.

  7. Asymptotic and geometrical quantization

    International Nuclear Information System (INIS)

    Karasev, M.V.; Maslov, V.P.

    1984-01-01

    The main ideas of geometric-, deformation- and asymptotic quantizations are compared. It is shown that, on the one hand, the asymptotic approach is a direct generalization of exact geometric quantization, on the other hand, it generates deformation in multiplication of symbols and Poisson brackets. Besides investigating the general quantization diagram, its applications to the calculation of asymptotics of a series of eigenvalues of operators possessing symmetry groups are considered

  8. An Improved Iterative Fitting Method to Estimate Nocturnal Residual Layer Height

    Directory of Open Access Journals (Sweden)

    Wei Wang

    2016-08-01

    Full Text Available The planetary boundary layer (PBL is an atmospheric region near the Earth’s surface. It is significant for weather forecasting and for the study of air quality and climate. In this study, the top of nocturnal residual layers—which are what remain of the daytime mixing layer—are estimated by an elastic backscatter Lidar in Wuhan (30.5°N, 114.4°E, a city in Central China. The ideal profile fitting method is widely applied to determine the nocturnal residual layer height (RLH from Lidar data. However, the method is seriously affected by an optical thick layer. Thus, we propose an improved iterative fitting method to eliminate the optical thick layer effect on RLH detection using Lidar. Two typical case studies observed by elastic Lidar are presented to demonstrate the theory and advantage of the proposed method. Results of case analysis indicate that the improved method is more practical and precise than profile-fitting, gradient, and wavelet covariance transform method in terms of nocturnal RLH evaluation under low cloud conditions. Long-term observations of RLH performed with ideal profile fitting and improved methods were carried out in Wuhan from 28 May 2011 to 17 June 2016. Comparisons of Lidar-derived RLHs with the two types of methods verify that the improved solution is practical. Statistical analysis of a six-year Lidar signal was conducted to reveal the monthly average values of nocturnal RLH in Wuhan. A clear RLH monthly cycle with a maximum mean height of about 1.8 km above ground level was observed in August, and a minimum height of about 0.7 km was observed in January. The variation in monthly mean RLH displays an obvious quarterly dependence, which coincides with the annual variation in local surface temperature.

  9. Iterative ensemble variational methods for nonlinear data assimilation: Application to transport and atmospheric chemistry

    International Nuclear Information System (INIS)

    Haussaire, Jean-Matthieu

    2017-01-01

    Data assimilation methods are constantly evolving to adapt to the various application domains. In atmospheric sciences, each new algorithm has first been implemented on numerical weather prediction models before being ported to atmospheric chemistry models. It has been the case for 4D variational methods and ensemble Kalman filters for instance. The new 4D ensemble variational methods (4D EnVar) are no exception. They were developed to take advantage of both variational and ensemble approaches and they are starting to be used in operational weather prediction centers, but have yet to be tested on operational atmospheric chemistry models. The validation of new data assimilation methods on these models is indeed difficult because of the complexity of such models. It is hence necessary to have at our disposal low-order models capable of synthetically reproducing key physical phenomena from operational models while limiting some of their hardships. Such a model, called L95-GRS, has therefore been developed. Il combines the simple meteorology from the Lorenz-95 model to a tropospheric ozone chemistry module with 7 chemical species. Even though it is of low dimension, it reproduces some of the physical and chemical phenomena observable in real situations. A data assimilation method, the iterative ensemble Kalman smoother (IEnKS), has been applied to this model. It is an iterative 4D EnVar method which solves the full non-linear variational problem. This application validates 4D EnVar methods in the context of non-linear atmospheric chemistry, but also raises the first limits of such methods, most noticeably when they are applied to weakly coupled stable models. After this experiment, results have been extended to a realistic atmospheric pollution prediction model. 4D EnVar methods, via the IEnKS, have once again shown their potential to take into account the non-linearity of the chemistry model in a controlled environment, with synthetic observations. However, the

  10. 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

  11. Space-Varying Iterative Restoration of Diffuse Optical Tomograms Reconstructed by the Photon Average Trajectories Method

    Directory of Open Access Journals (Sweden)

    Kravtsenyuk Olga V

    2007-01-01

    Full Text Available The possibility of improving the spatial resolution of diffuse optical tomograms reconstructed by the photon average trajectories (PAT method is substantiated. The PAT method recently presented by us is based on a concept of an average statistical trajectory for transfer of light energy, the photon average trajectory (PAT. The inverse problem of diffuse optical tomography is reduced to a solution of an integral equation with integration along a conditional PAT. As a result, the conventional algorithms of projection computed tomography can be used for fast reconstruction of diffuse optical images. The shortcoming of the PAT method is that it reconstructs the images blurred due to averaging over spatial distributions of photons which form the signal measured by the receiver. To improve the resolution, we apply a spatially variant blur model based on an interpolation of the spatially invariant point spread functions simulated for the different small subregions of the image domain. Two iterative algorithms for solving a system of linear algebraic equations, the conjugate gradient algorithm for least squares problem and the modified residual norm steepest descent algorithm, are used for deblurring. It is shown that a gain in spatial resolution can be obtained.

  12. Space-Varying Iterative Restoration of Diffuse Optical Tomograms Reconstructed by the Photon Average Trajectories Method

    Directory of Open Access Journals (Sweden)

    Vladimir V. Lyubimov

    2007-01-01

    Full Text Available The possibility of improving the spatial resolution of diffuse optical tomograms reconstructed by the photon average trajectories (PAT method is substantiated. The PAT method recently presented by us is based on a concept of an average statistical trajectory for transfer of light energy, the photon average trajectory (PAT. The inverse problem of diffuse optical tomography is reduced to a solution of an integral equation with integration along a conditional PAT. As a result, the conventional algorithms of projection computed tomography can be used for fast reconstruction of diffuse optical images. The shortcoming of the PAT method is that it reconstructs the images blurred due to averaging over spatial distributions of photons which form the signal measured by the receiver. To improve the resolution, we apply a spatially variant blur model based on an interpolation of the spatially invariant point spread functions simulated for the different small subregions of the image domain. Two iterative algorithms for solving a system of linear algebraic equations, the conjugate gradient algorithm for least squares problem and the modified residual norm steepest descent algorithm, are used for deblurring. It is shown that a 27% gain in spatial resolution can be obtained.

  13. Simulation of neoclassical tearing mode stabilization via minimum seeking method on ITER

    Energy Technology Data Exchange (ETDEWEB)

    Park, M. H.; Kim, K.; Na, D. H.; Byun, C. S.; Na, Y. S. [Seoul National Univ., Seoul (Korea, Republic of); Kim, M. [FNC Technology Co. Ltd, Yongin (Korea, Republic of)

    2016-10-15

    Neoclassical tearing modes (NTMs) are well known resistive magnetohydrodynamic (MHD) instabilities. These instabilities are sustained by a helically perturbed bootstrap current. NTMs produce magnetic islands in tokamak plasmas that can degrade confinement and lead to plasma disruption. Because of this, the stabilization of NTMs is one of the key issues for tokamaks that achieve high fusion performance such as ITER. Compensating for the lack of bootstrap current by an Electron Cyclotron Current Drive (ECCD) has been proved experimentally as an effective method to stabilize NTMs. In order to stabilize NTMs, it is important to reduce misalignment. So that even ECCD can destabilize the NTMs when misalignment is large. Feedback control method that does not fully require delicate and accurate real-time measurements and calculations, such as equilibrium reconstruction and EC ray-tracing, has also been proposed. One of the feedback control methods is minimum seeking method. This control method minimizes the island width by tuning the misalignment, assuming that the magnetic island width is a function of the misalignment. As a robust and simple method of controlling NTM, minimum 'island width growth rate' seeking control is purposed and compared with performance of minimum ' island width' seeking control. At the integrated numerical system, simulations of the NTM suppression are performed with two types of minimum seeking controllers; one is a FDM based minimum seeking controller and the other is a sinusoidal perturbation based minimum seeking method. The full suppression is achieved both types of controller. The controllers adjust poloidal angle of EC beam and reduce misalignment to zero. The sinusoidal perturbation based minimum seeking control need to modify the adaptive gain.

  14. Probabilistic methods for physics

    International Nuclear Information System (INIS)

    Cirier, G

    2013-01-01

    We present an asymptotic method giving a probability of presence of the iterated spots of R d by a polynomial function f. We use the well-known Perron Frobenius operator (PF) that lets certain sets and measure invariant by f. Probabilistic solutions can exist for the deterministic iteration. If the theoretical result is already known, here we quantify these probabilities. This approach seems interesting to use for computing situations when the deterministic methods don't run. Among the examined applications, are asymptotic solutions of Lorenz, Navier-Stokes or Hamilton's equations. In this approach, linearity induces many difficult problems, all of whom we have not yet resolved.

  15. An automatic iterative decision-making method for intuitionistic fuzzy linguistic preference relations

    Science.gov (United States)

    Pei, Lidan; Jin, Feifei; Ni, Zhiwei; Chen, Huayou; Tao, Zhifu

    2017-10-01

    As a new preference structure, the intuitionistic fuzzy linguistic preference relation (IFLPR) was recently introduced to efficiently deal with situations in which the membership and non-membership are represented as linguistic terms. In this paper, we study the issues of additive consistency and the derivation of the intuitionistic fuzzy weight vector of an IFLPR. First, the new concepts of order consistency, additive consistency and weak transitivity for IFLPRs are introduced, and followed by a discussion of the characterisation about additive consistent IFLPRs. Then, a parameterised transformation approach is investigated to convert the normalised intuitionistic fuzzy weight vector into additive consistent IFLPRs. After that, a linear optimisation model is established to derive the normalised intuitionistic fuzzy weights for IFLPRs, and a consistency index is defined to measure the deviation degree between an IFLPR and its additive consistent IFLPR. Furthermore, we develop an automatic iterative decision-making method to improve the IFLPRs with unacceptable additive consistency until the adjusted IFLPRs are acceptable additive consistent, and it helps the decision-maker to obtain the reasonable and reliable decision-making results. Finally, an illustrative example is provided to demonstrate the validity and applicability of the proposed method.

  16. Mixed price and load forecasting of electricity markets by a new iterative prediction method

    International Nuclear Information System (INIS)

    Amjady, Nima; Daraeepour, Ali

    2009-01-01

    Load and price forecasting are the two key issues for the participants of current electricity markets. However, load and price of electricity markets have complex characteristics such as nonlinearity, non-stationarity and multiple seasonality, to name a few (usually, more volatility is seen in the behavior of electricity price signal). For these reasons, much research has been devoted to load and price forecast, especially in the recent years. However, previous research works in the area separately predict load and price signals. In this paper, a mixed model for load and price forecasting is presented, which can consider interactions of these two forecast processes. The mixed model is based on an iterative neural network based prediction technique. It is shown that the proposed model can present lower forecast errors for both load and price compared with the previous separate frameworks. Another advantage of the mixed model is that all required forecast features (from load or price) are predicted within the model without assuming known values for these features. So, the proposed model can better be adapted to real conditions of an electricity market. The forecast accuracy of the proposed mixed method is evaluated by means of real data from the New York and Spanish electricity markets. The method is also compared with some of the most recent load and price forecast techniques. (author)

  17. Probabilistic homogenization of random composite with ellipsoidal particle reinforcement by the iterative stochastic finite element method

    Science.gov (United States)

    Sokołowski, Damian; Kamiński, Marcin

    2018-01-01

    This study proposes a framework for determination of basic probabilistic characteristics of the orthotropic homogenized elastic properties of the periodic composite reinforced with ellipsoidal particles and a high stiffness contrast between the reinforcement and the matrix. Homogenization problem, solved by the Iterative Stochastic Finite Element Method (ISFEM) is implemented according to the stochastic perturbation, Monte Carlo simulation and semi-analytical techniques with the use of cubic Representative Volume Element (RVE) of this composite containing single particle. The given input Gaussian random variable is Young modulus of the matrix, while 3D homogenization scheme is based on numerical determination of the strain energy of the RVE under uniform unit stretches carried out in the FEM system ABAQUS. The entire series of several deterministic solutions with varying Young modulus of the matrix serves for the Weighted Least Squares Method (WLSM) recovery of polynomial response functions finally used in stochastic Taylor expansions inherent for the ISFEM. A numerical example consists of the High Density Polyurethane (HDPU) reinforced with the Carbon Black particle. It is numerically investigated (1) if the resulting homogenized characteristics are also Gaussian and (2) how the uncertainty in matrix Young modulus affects the effective stiffness tensor components and their PDF (Probability Density Function).

  18. An efficient iterative model reduction method for aeroviscoelastic panel flutter analysis in the supersonic regime

    Science.gov (United States)

    Cunha-Filho, A. G.; Briend, Y. P. J.; de Lima, A. M. G.; Donadon, M. V.

    2018-05-01

    The flutter boundary prediction of complex aeroelastic systems is not an easy task. In some cases, these analyses may become prohibitive due to the high computational cost and time associated with the large number of degrees of freedom of the aeroelastic models, particularly when the aeroelastic model incorporates a control strategy with the aim of suppressing the flutter phenomenon, such as the use of viscoelastic treatments. In this situation, the use of a model reduction method is essential. However, the construction of a modal reduction basis for aeroviscoelastic systems is still a challenge, owing to the inherent frequency- and temperature-dependent behavior of the viscoelastic materials. Thus, the main contribution intended for the present study is to propose an efficient and accurate iterative enriched Ritz basis to deal with aeroviscoelastic systems. The main features and capabilities of the proposed model reduction method are illustrated in the prediction of flutter boundary for a thin three-layer sandwich flat panel and a typical aeronautical stiffened panel, both under supersonic flow.

  19. Comparison of methods for suppressing edge and aliasing artefacts in iterative x-ray CT reconstruction

    International Nuclear Information System (INIS)

    Zbijewski, Wojciech; Beekman, Freek J

    2006-01-01

    X-ray CT images obtained with iterative reconstruction (IR) can be hampered by the so-called edge and aliasing artefacts, which appear as interference patterns and severe overshoots in the areas of sharp intensity transitions. Previously, we have demonstrated that these artefacts are caused by discretization errors during the projection simulation step in IR. Although these errors are inherent to IR, they can be adequately suppressed by reconstruction on an image grid that is finer than that typically used for analytical methods such as filtered back-projection. Two other methods that may prevent edge artefacts are: (i) smoothing the projections prior to reconstruction or (ii) using an image representation different from voxels; spherically symmetric Kaiser-Bessel functions are a frequently employed example of such a representation. In this paper, we compare reconstruction on a fine grid with the two above-mentioned alternative strategies for edge artefact reduction. We show that the use of a fine grid results in a more adequate suppression of artefacts than the smoothing of projections or using the Kaiser-Bessel image representation

  20. 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.

  1. Asymptotic evolution of quantum Markov chains

    Energy Technology Data Exchange (ETDEWEB)

    Novotny, Jaroslav [FNSPE, CTU in Prague, 115 19 Praha 1 - Stare Mesto (Czech Republic); Alber, Gernot [Institut fuer Angewandte Physik, Technische Universitaet Darmstadt, D-64289 Darmstadt (Germany)

    2012-07-01

    The iterated quantum operations, so called quantum Markov chains, play an important role in various branches of physics. They constitute basis for many discrete models capable to explore fundamental physical problems, such as the approach to thermal equilibrium, or the asymptotic dynamics of macroscopic physical systems far from thermal equilibrium. On the other hand, in the more applied area of quantum technology they also describe general characteristic properties of quantum networks or they can describe different quantum protocols in the presence of decoherence. A particularly, an interesting aspect of these quantum Markov chains is their asymptotic dynamics and its characteristic features. We demonstrate there is always a vector subspace (typically low-dimensional) of so-called attractors on which the resulting superoperator governing the iterative time evolution of quantum states can be diagonalized and in which the asymptotic quantum dynamics takes place. As the main result interesting algebraic relations are presented for this set of attractors which allow to specify their dual basis and to determine them in a convenient way. Based on this general theory we show some generalizations concerning the theory of fixed points or asymptotic evolution of random quantum operations.

  2. Sparse calibration of subsurface flow models using nonlinear orthogonal matching pursuit and an iterative stochastic ensemble method

    KAUST Repository

    Elsheikh, Ahmed H.

    2013-06-01

    We introduce a nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of subsurface flow models. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated basis function with the residual from a large pool of basis functions. The discovered basis (aka support) is augmented across the nonlinear iterations. Once a set of basis functions are selected, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on stochastically approximated gradient using an iterative stochastic ensemble method (ISEM). In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm. The proposed algorithm is the first ensemble based algorithm that tackels the sparse nonlinear parameter estimation problem. © 2013 Elsevier Ltd.

  3. Optimal homotopy asymptotic method for flow and heat transfer of a viscoelastic fluid in an axisymmetric channel with a porous wall.

    Science.gov (United States)

    Mabood, Fazle; Khan, Waqar A; Ismail, Ahmad Izani Md

    2013-01-01

    In this article, an approximate analytical solution of flow and heat transfer for a viscoelastic fluid in an axisymmetric channel with porous wall is presented. The solution is obtained through the use of a powerful method known as Optimal Homotopy Asymptotic Method (OHAM). We obtained the approximate analytical solution for dimensionless velocity and temperature for various parameters. The influence and effect of different parameters on dimensionless velocity, temperature, friction factor, and rate of heat transfer are presented graphically. We also compared our solution with those obtained by other methods and it is found that OHAM solution is better than the other methods considered. This shows that OHAM is reliable for use to solve strongly nonlinear problems in heat transfer phenomena.

  4. A HIGH ORDER SOLUTION OF THREE DIMENSIONAL TIME DEPENDENT NONLINEAR CONVECTIVE-DIFFUSIVE PROBLEM USING MODIFIED VARIATIONAL ITERATION METHOD

    Directory of Open Access Journals (Sweden)

    Pratibha Joshi

    2014-12-01

    Full Text Available In this paper, we have achieved high order solution of a three dimensional nonlinear diffusive-convective problem using modified variational iteration method. The efficiency of this approach has been shown by solving two examples. All computational work has been performed in MATHEMATICA.

  5. Application of He’s Variational Iteration Method to Nonlinear Helmholtz Equation and Fifth-Order KDV Equation

    DEFF Research Database (Denmark)

    Miansari, Mo; Miansari, Me; Barari, Amin

    2009-01-01

    In this article, He’s variational iteration method (VIM), is implemented to solve the linear Helmholtz partial differential equation and some nonlinear fifth-order Korteweg-de Vries (FKdV) partial differential equations with specified initial conditions. The initial approximations can be freely c...

  6. Using an Iterative Mixed-Methods Research Design to Investigate Schools Facing Exceptionally Challenging Circumstances within Trinidad and Tobago

    Science.gov (United States)

    De Lisle, Jerome; Seunarinesingh, Krishna; Mohammed, Rhoda; Lee-Piggott, Rinnelle

    2017-01-01

    In this study, methodology and theory were linked to explicate the nature of education practice within schools facing exceptionally challenging circumstances (SFECC) in Trinidad and Tobago. The research design was an iterative quan>QUAL-quan>qual multi-method research programme, consisting of 3 independent projects linked together by overall…

  7. Asymptotically Optimal Agents

    OpenAIRE

    Lattimore, Tor; Hutter, Marcus

    2011-01-01

    Artificial general intelligence aims to create agents capable of learning to solve arbitrary interesting problems. We define two versions of asymptotic optimality and prove that no agent can satisfy the strong version while in some cases, depending on discounting, there does exist a non-computable weak asymptotically optimal agent.

  8. 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

  9. Paediatric cardiac CT examinations: impact of the iterative reconstruction method ASIR on image quality - preliminary findings

    International Nuclear Information System (INIS)

    Mieville, Frederic A.; Gudinchet, Francois; Rizzo, Elena; Ou, Phalla; Brunelle, Francis; Bochud, Francois O.; Verdun, Francis R.

    2011-01-01

    Radiation dose exposure is of particular concern in children due to the possible harmful effects of ionizing radiation. The adaptive statistical iterative reconstruction (ASIR) method is a promising new technique that reduces image noise and produces better overall image quality compared with routine-dose contrast-enhanced methods. To assess the benefits of ASIR on the diagnostic image quality in paediatric cardiac CT examinations. Four paediatric radiologists based at two major hospitals evaluated ten low-dose paediatric cardiac examinations (80 kVp, CTDI vol 4.8-7.9 mGy, DLP 37.1-178.9 mGy.cm). The average age of the cohort studied was 2.6 years (range 1 day to 7 years). Acquisitions were performed on a 64-MDCT scanner. All images were reconstructed at various ASIR percentages (0-100%). For each examination, radiologists scored 19 anatomical structures using the relative visual grading analysis method. To estimate the potential for dose reduction, acquisitions were also performed on a Catphan phantom and a paediatric phantom. The best image quality for all clinical images was obtained with 20% and 40% ASIR (p < 0.001) whereas with ASIR above 50%, image quality significantly decreased (p < 0.001). With 100% ASIR, a strong noise-free appearance of the structures reduced image conspicuity. A potential for dose reduction of about 36% is predicted for a 2- to 3-year-old child when using 40% ASIR rather than the standard filtered back-projection method. Reconstruction including 20% to 40% ASIR slightly improved the conspicuity of various paediatric cardiac structures in newborns and children with respect to conventional reconstruction (filtered back-projection) alone. (orig.)

  10. Paediatric cardiac CT examinations: impact of the iterative reconstruction method ASIR on image quality - preliminary findings

    Energy Technology Data Exchange (ETDEWEB)

    Mieville, Frederic A. [University Hospital Center and University of Lausanne, Institute of Radiation Physics, Lausanne (Switzerland); University Hospital Center and University of Lausanne, Institute of Radiation Physics - Medical Radiology, Lausanne (Switzerland); Gudinchet, Francois; Rizzo, Elena [University Hospital Center and University of Lausanne, Department of Radiology, Lausanne (Switzerland); Ou, Phalla; Brunelle, Francis [Necker Children' s Hospital, Department of Radiology, Paris (France); Bochud, Francois O.; Verdun, Francis R. [University Hospital Center and University of Lausanne, Institute of Radiation Physics, Lausanne (Switzerland)

    2011-09-15

    Radiation dose exposure is of particular concern in children due to the possible harmful effects of ionizing radiation. The adaptive statistical iterative reconstruction (ASIR) method is a promising new technique that reduces image noise and produces better overall image quality compared with routine-dose contrast-enhanced methods. To assess the benefits of ASIR on the diagnostic image quality in paediatric cardiac CT examinations. Four paediatric radiologists based at two major hospitals evaluated ten low-dose paediatric cardiac examinations (80 kVp, CTDI{sub vol} 4.8-7.9 mGy, DLP 37.1-178.9 mGy.cm). The average age of the cohort studied was 2.6 years (range 1 day to 7 years). Acquisitions were performed on a 64-MDCT scanner. All images were reconstructed at various ASIR percentages (0-100%). For each examination, radiologists scored 19 anatomical structures using the relative visual grading analysis method. To estimate the potential for dose reduction, acquisitions were also performed on a Catphan phantom and a paediatric phantom. The best image quality for all clinical images was obtained with 20% and 40% ASIR (p < 0.001) whereas with ASIR above 50%, image quality significantly decreased (p < 0.001). With 100% ASIR, a strong noise-free appearance of the structures reduced image conspicuity. A potential for dose reduction of about 36% is predicted for a 2- to 3-year-old child when using 40% ASIR rather than the standard filtered back-projection method. Reconstruction including 20% to 40% ASIR slightly improved the conspicuity of various paediatric cardiac structures in newborns and children with respect to conventional reconstruction (filtered back-projection) alone. (orig.)

  11. Development of an original active thermography method adapted to ITER plasma facing components control

    Energy Technology Data Exchange (ETDEWEB)

    Durocher, A.; Vignal, N.; Escourbiac, F.; Farjon, J.L.; Schlosser, J. [CEA Cadarache, Dept. de Recherches sur la Fusion Controlee, 13 - Saint-Paul-lez-Durance (France); Cismondi, F. [Toulon Univ., 83 - La Garde (France)

    2004-07-01

    Among all Non-Destructive Examinations (NDE), active infrared thermography is becoming recognised as a technique available today for improving quality control of many materials and structures involved in heat transfer. The infrared thermography allows to characterise the bond between two materials having different thermal physical properties. In order to increase the defect detection limit of the SATIR test bed, several possibilities have been evaluated to improve the infrared thermography inspection. The implementation in 2003 of a micro-bolometer camera and the improving of the thermo-signal process allowed to increase considerably the detection sensitivity of the SATIR facility. The quality, the spatial stability of infrared image and the detection of edge defect have been also improved. The coupling on the same test bed of SATIR method with a lock-in thermography will be evaluated in this paper. An improvement of the global reliability is expected by data merging produced by the two thermal excitation sources. A new enhanced facility named SATIRPACA has been designed for the full Non Destructive Examination of the High Heat Flux ITER components taking into account these main improvements. These systematic acceptance tests obviously need tools for quality control of critical parts. (authors)

  12. Development of an original active thermography method adapted to ITER plasma facing components control

    International Nuclear Information System (INIS)

    Durocher, A.; Vignal, N.; Escourbiac, F.; Farjon, J.L.; Schlosser, J.; Cismondi, F.

    2004-01-01

    Among all Non-Destructive Examinations (NDE), active infrared thermography is becoming recognised as a technique available today for improving quality control of many materials and structures involved in heat transfer. The infrared thermography allows to characterise the bond between two materials having different thermal physical properties. In order to increase the defect detection limit of the SATIR test bed, several possibilities have been evaluated to improve the infrared thermography inspection. The implementation in 2003 of a micro-bolometer camera and the improving of the thermo-signal process allowed to increase considerably the detection sensitivity of the SATIR facility. The quality, the spatial stability of infrared image and the detection of edge defect have been also improved. The coupling on the same test bed of SATIR method with a lock-in thermography will be evaluated in this paper. An improvement of the global reliability is expected by data merging produced by the two thermal excitation sources. A new enhanced facility named SATIRPACA has been designed for the full Non Destructive Examination of the High Heat Flux ITER components taking into account these main improvements. These systematic acceptance tests obviously need tools for quality control of critical parts. (authors)

  13. An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

    Science.gov (United States)

    Kassa, Semu Mitiku; Tsegay, Teklay Hailay

    2017-08-01

    Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of problems. In this paper, we investigate a tri-level programming problem with quadratic fractional objective functions at each of the three levels. A solution algorithm has been proposed by applying fuzzy goal programming approach and by reformulating the fractional constraints to equivalent but non-fractional non-linear constraints. Based on the transformed formulation, an iterative procedure is developed that can yield a satisfactory solution to the tri-level problem. The numerical results on various illustrative examples demonstrated that the proposed algorithm is very much promising and it can also be used to solve larger-sized as well as n-level problems of similar structure.

  14. e-Learning Application for Machine Maintenance Process using Iterative Method in XYZ Company

    Science.gov (United States)

    Nurunisa, Suaidah; Kurniawati, Amelia; Pramuditya Soesanto, Rayinda; Yunan Kurnia Septo Hediyanto, Umar

    2016-02-01

    XYZ Company is a company based on manufacturing part for airplane, one of the machine that is categorized as key facility in the company is Millac 5H6P. As a key facility, the machines should be assured to work well and in peak condition, therefore, maintenance process is needed periodically. From the data gathering, it is known that there are lack of competency from the maintenance staff to maintain different type of machine which is not assigned by the supervisor, this indicate that knowledge which possessed by maintenance staff are uneven. The purpose of this research is to create knowledge-based e-learning application as a realization from externalization process in knowledge transfer process to maintain the machine. The application feature are adjusted for maintenance purpose using e-learning framework for maintenance process, the content of the application support multimedia for learning purpose. QFD is used in this research to understand the needs from user. The application is built using moodle with iterative method for software development cycle and UML Diagram. The result from this research is e-learning application as sharing knowledge media for maintenance staff in the company. From the test, it is known that the application make maintenance staff easy to understand the competencies.

  15. Demonstration of a forward iterative method to reconstruct brachytherapy seed configurations from x-ray projections

    Energy Technology Data Exchange (ETDEWEB)

    Murphy, Martin J; Todor, Dorin A [Department of Radiation Oncology, Virginia Commonwealth University, Richmond VA 23298 (United States)

    2005-06-07

    By monitoring brachytherapy seed placement and determining the actual configuration of the seeds in vivo, one can optimize the treatment plan during the process of implantation. Two or more radiographic images from different viewpoints can in principle allow one to reconstruct the configuration of implanted seeds uniquely. However, the reconstruction problem is complicated by several factors: (1) the seeds can overlap and cluster in the images; (2) the images can have distortion that varies with viewpoint when a C-arm fluoroscope is used; (3) there can be uncertainty in the imaging viewpoints; (4) the angular separation of the imaging viewpoints can be small owing to physical space constraints; (5) there can be inconsistency in the number of seeds detected in the images; and (6) the patient can move while being imaged. We propose and conceptually demonstrate a novel reconstruction method that handles all of these complications and uncertainties in a unified process. The method represents the three-dimensional seed and camera configurations as parametrized models that are adjusted iteratively to conform to the observed radiographic images. The morphed model seed configuration that best reproduces the appearance of the seeds in the radiographs is the best estimate of the actual seed configuration. All of the information needed to establish both the seed configuration and the camera model is derived from the seed images without resort to external calibration fixtures. Furthermore, by comparing overall image content rather than individual seed coordinates, the process avoids the need to establish correspondence between seed identities in the several images. The method has been shown to work robustly in simulation tests that simultaneously allow for unknown individual seed positions, uncertainties in the imaging viewpoints and variable image distortion.

  16. Potential benefit of the CT adaptive statistical iterative reconstruction method for pediatric cardiac diagnosis

    Science.gov (United States)

    Miéville, Frédéric A.; Ayestaran, Paul; Argaud, Christophe; Rizzo, Elena; Ou, Phalla; Brunelle, Francis; Gudinchet, François; Bochud, François; Verdun, Francis R.

    2010-04-01

    Adaptive Statistical Iterative Reconstruction (ASIR) is a new imaging reconstruction technique recently introduced by General Electric (GE). This technique, when combined with a conventional filtered back-projection (FBP) approach, is able to improve the image noise reduction. To quantify the benefits provided on the image quality and the dose reduction by the ASIR method with respect to the pure FBP one, the standard deviation (SD), the modulation transfer function (MTF), the noise power spectrum (NPS), the image uniformity and the noise homogeneity were examined. Measurements were performed on a control quality phantom when varying the CT dose index (CTDIvol) and the reconstruction kernels. A 64-MDCT was employed and raw data were reconstructed with different percentages of ASIR on a CT console dedicated for ASIR reconstruction. Three radiologists also assessed a cardiac pediatric exam reconstructed with different ASIR percentages using the visual grading analysis (VGA) method. For the standard, soft and bone reconstruction kernels, the SD is reduced when the ASIR percentage increases up to 100% with a higher benefit for low CTDIvol. MTF medium frequencies were slightly enhanced and modifications of the NPS shape curve were observed. However for the pediatric cardiac CT exam, VGA scores indicate an upper limit of the ASIR benefit. 40% of ASIR was observed as the best trade-off between noise reduction and clinical realism of organ images. Using phantom results, 40% of ASIR corresponded to an estimated dose reduction of 30% under pediatric cardiac protocol conditions. In spite of this discrepancy between phantom and clinical results, the ASIR method is as an important option when considering the reduction of radiation dose, especially for pediatric patients.

  17. Krylov Iterative Methods and the Degraded Effectiveness of Diffusion Synthetic Acceleration for Multidimensional SN Calculations in Problems with Material Discontinuities

    International Nuclear Information System (INIS)

    Warsa, James S.; Wareing, Todd A.; Morel, Jim E.

    2004-01-01

    A loss in the effectiveness of diffusion synthetic acceleration (DSA) schemes has been observed with certain S N discretizations on two-dimensional Cartesian grids in the presence of material discontinuities. We will present more evidence supporting the conjecture that DSA effectiveness will degrade for multidimensional problems with discontinuous total cross sections, regardless of the particular physical configuration or spatial discretization. Fourier analysis and numerical experiments help us identify a set of representative problems for which established DSA schemes are ineffective, focusing on diffusive problems for which DSA is most needed. We consider a lumped, linear discontinuous spatial discretization of the S N transport equation on three-dimensional, unstructured tetrahedral meshes and look at a fully consistent and a 'partially consistent' DSA method for this discretization. The effectiveness of both methods is shown to degrade significantly. A Fourier analysis of the fully consistent DSA scheme in the limit of decreasing cell optical thickness supports the view that the DSA itself is failing when material discontinuities are present in a problem. We show that a Krylov iterative method, preconditioned with DSA, is an effective remedy that can be used to efficiently compute solutions for this class of problems. We show that as a preconditioner to the Krylov method, a partially consistent DSA method is more than adequate. In fact, it is preferable to a fully consistent method because the partially consistent method is based on a continuous finite element discretization of the diffusion equation that can be solved relatively easily. The Krylov method can be implemented in terms of the original S N source iteration coding with only slight modification. Results from numerical experiments show that replacing source iteration with a preconditioned Krylov method can efficiently solve problems that are virtually intractable with accelerated source iteration

  18. Estimation of graphite dust production in ITER TBM using finite element method

    Energy Technology Data Exchange (ETDEWEB)

    Kang, Ji-Ho, E-mail: jhkang@kaeri.re.kr [Korea Atomic Energy Research Institute, 989-111, Daekeok-Daero, Yuseong-Gu, Daejeon 305-353 (Korea, Republic of); Kim, Eung Seon [Korea Atomic Energy Research Institute, 989-111, Daekeok-Daero, Yuseong-Gu, Daejeon 305-353 (Korea, Republic of); Ahn, Mu-Young; Lee, Youngmin; Park, Yi-Hyun; Cho, Seungyon [National Fusion Research Institute, 169-148, Gwahak-ro, Yuseong-gu, Daejeon (Korea, Republic of)

    2015-12-15

    Highlights: • Graphite dust production was estimated for the Korean Helium Cooled Ceramic Reflector. • Wear amount was calculated by Archard model using finite element analysis results. • Life time estimation of graphite dust production was done. - Abstract: In this study, an estimation method of graphite dust production in the pebble-bed type reflector region of the Korean Helium Cooled Ceramic Reflector (HCCR) Test Blanket Module (TBM) of the International Thermonuclear Experimental Reactor (ITER) project using Finite Element Method (FEM) was proposed and the total amount of dust production was calculated. A unit-cell model of uniformly arranged pebbles was defined with thermal and mechanical loadings. A commercial FEM program, Abaqus V6.10, was used to model and solve the stress field under multiple contact constraints between pebbles in the unit-cell. Resultant normal contact forces and slip distances on the contact points were applied into the Archard adhesive wear model to calculate the amount of graphite dust. The Finite Element (FE) analysis was repeated at 27 unit-cell locations chosen to form an interpolated dust density function for the entire region of the reflector. The dust production calculation was extended to the life time of the HCCR and the total graphite dust production was estimated to 0.279 g at the end of the life time with the maximum graphite dust density of 0.149 μg/mm{sup 3}. The dust explosion could be a safety issue with the calculated dust density level and it requires that an appropriate maintenance to remove sufficient amount of graphite dust regularly to prevent the possibility of dust explosion.

  19. Estimation of graphite dust production in ITER TBM using finite element method

    International Nuclear Information System (INIS)

    Kang, Ji-Ho; Kim, Eung Seon; Ahn, Mu-Young; Lee, Youngmin; Park, Yi-Hyun; Cho, Seungyon

    2015-01-01

    Highlights: • Graphite dust production was estimated for the Korean Helium Cooled Ceramic Reflector. • Wear amount was calculated by Archard model using finite element analysis results. • Life time estimation of graphite dust production was done. - Abstract: In this study, an estimation method of graphite dust production in the pebble-bed type reflector region of the Korean Helium Cooled Ceramic Reflector (HCCR) Test Blanket Module (TBM) of the International Thermonuclear Experimental Reactor (ITER) project using Finite Element Method (FEM) was proposed and the total amount of dust production was calculated. A unit-cell model of uniformly arranged pebbles was defined with thermal and mechanical loadings. A commercial FEM program, Abaqus V6.10, was used to model and solve the stress field under multiple contact constraints between pebbles in the unit-cell. Resultant normal contact forces and slip distances on the contact points were applied into the Archard adhesive wear model to calculate the amount of graphite dust. The Finite Element (FE) analysis was repeated at 27 unit-cell locations chosen to form an interpolated dust density function for the entire region of the reflector. The dust production calculation was extended to the life time of the HCCR and the total graphite dust production was estimated to 0.279 g at the end of the life time with the maximum graphite dust density of 0.149 μg/mm"3. The dust explosion could be a safety issue with the calculated dust density level and it requires that an appropriate maintenance to remove sufficient amount of graphite dust regularly to prevent the possibility of dust explosion.

  20. GSHSite: exploiting an iteratively statistical method to identify s-glutathionylation sites with substrate specificity.

    Directory of Open Access Journals (Sweden)

    Yi-Ju Chen

    Full Text Available S-glutathionylation, the covalent attachment of a glutathione (GSH to the sulfur atom of cysteine, is a selective and reversible protein post-translational modification (PTM that regulates protein activity, localization, and stability. Despite its implication in the regulation of protein functions and cell signaling, the substrate specificity of cysteine S-glutathionylation remains unknown. Based on a total of 1783 experimentally identified S-glutathionylation sites from mouse macrophages, this work presents an informatics investigation on S-glutathionylation sites including structural factors such as the flanking amino acids composition and the accessible surface area (ASA. TwoSampleLogo presents that positively charged amino acids flanking the S-glutathionylated cysteine may influence the formation of S-glutathionylation in closed three-dimensional environment. A statistical method is further applied to iteratively detect the conserved substrate motifs with statistical significance. Support vector machine (SVM is then applied to generate predictive model considering the substrate motifs. According to five-fold cross-validation, the SVMs trained with substrate motifs could achieve an enhanced sensitivity, specificity, and accuracy, and provides a promising performance in an independent test set. The effectiveness of the proposed method is demonstrated by the correct identification of previously reported S-glutathionylation sites of mouse thioredoxin (TXN and human protein tyrosine phosphatase 1b (PTP1B. Finally, the constructed models are adopted to implement an effective web-based tool, named GSHSite (http://csb.cse.yzu.edu.tw/GSHSite/, for identifying uncharacterized GSH substrate sites on the protein sequences.

  1. Development of an iterative reconstruction method to overcome 2D detector low resolution limitations in MLC leaf position error detection for 3D dose verification in IMRT

    NARCIS (Netherlands)

    Visser, Ruurd; J., Godart; Wauben, D.J.L.; Langendijk, J.; van 't Veld, A.A.; Korevaar, E.W.

    2016-01-01

    The objective of this study was to introduce a new iterative method to reconstruct multi leaf collimator (MLC) positions based on low resolution ionization detector array measurements and to evaluate its error detection performance. The iterative reconstruction method consists of a fluence model, a

  2. 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.

  3. Reconstructive schemes for variational iteration method within Yang-Laplace transform with application to fractal heat conduction problem

    Directory of Open Access Journals (Sweden)

    Liu Chun-Feng

    2013-01-01

    Full Text Available A reconstructive scheme for variational iteration method using the Yang-Laplace transform is proposed and developed with the Yang-Laplace transform. The identification of fractal Lagrange multiplier is investigated by the Yang-Laplace transform. The method is exemplified by a fractal heat conduction equation with local fractional derivative. The results developed are valid for a compact solution domain with high accuracy.

  4. Low dose dynamic CT myocardial perfusion imaging using a statistical iterative reconstruction method

    Energy Technology Data Exchange (ETDEWEB)

    Tao, Yinghua [Department of Medical Physics, University of Wisconsin-Madison, Madison, Wisconsin 53705 (United States); Chen, Guang-Hong [Department of Medical Physics and Department of Radiology, University of Wisconsin-Madison, Madison, Wisconsin 53705 (United States); Hacker, Timothy A.; Raval, Amish N. [Department of Medicine, University of Wisconsin-Madison, Madison, Wisconsin 53792 (United States); Van Lysel, Michael S.; Speidel, Michael A., E-mail: speidel@wisc.edu [Department of Medical Physics and Department of Medicine, University of Wisconsin-Madison, Madison, Wisconsin 53705 (United States)

    2014-07-15

    Purpose: Dynamic CT myocardial perfusion imaging has the potential to provide both functional and anatomical information regarding coronary artery stenosis. However, radiation dose can be potentially high due to repeated scanning of the same region. The purpose of this study is to investigate the use of statistical iterative reconstruction to improve parametric maps of myocardial perfusion derived from a low tube current dynamic CT acquisition. Methods: Four pigs underwent high (500 mA) and low (25 mA) dose dynamic CT myocardial perfusion scans with and without coronary occlusion. To delineate the affected myocardial territory, an N-13 ammonia PET perfusion scan was performed for each animal in each occlusion state. Filtered backprojection (FBP) reconstruction was first applied to all CT data sets. Then, a statistical iterative reconstruction (SIR) method was applied to data sets acquired at low dose. Image voxel noise was matched between the low dose SIR and high dose FBP reconstructions. CT perfusion maps were compared among the low dose FBP, low dose SIR and high dose FBP reconstructions. Numerical simulations of a dynamic CT scan at high and low dose (20:1 ratio) were performed to quantitatively evaluate SIR and FBP performance in terms of flow map accuracy, precision, dose efficiency, and spatial resolution. Results: Forin vivo studies, the 500 mA FBP maps gave −88.4%, −96.0%, −76.7%, and −65.8% flow change in the occluded anterior region compared to the open-coronary scans (four animals). The percent changes in the 25 mA SIR maps were in good agreement, measuring −94.7%, −81.6%, −84.0%, and −72.2%. The 25 mA FBP maps gave unreliable flow measurements due to streaks caused by photon starvation (percent changes of +137.4%, +71.0%, −11.8%, and −3.5%). Agreement between 25 mA SIR and 500 mA FBP global flow was −9.7%, 8.8%, −3.1%, and 26.4%. The average variability of flow measurements in a nonoccluded region was 16.3%, 24.1%, and 937

  5. Low dose dynamic CT myocardial perfusion imaging using a statistical iterative reconstruction method

    International Nuclear Information System (INIS)

    Tao, Yinghua; Chen, Guang-Hong; Hacker, Timothy A.; Raval, Amish N.; Van Lysel, Michael S.; Speidel, Michael A.

    2014-01-01

    Purpose: Dynamic CT myocardial perfusion imaging has the potential to provide both functional and anatomical information regarding coronary artery stenosis. However, radiation dose can be potentially high due to repeated scanning of the same region. The purpose of this study is to investigate the use of statistical iterative reconstruction to improve parametric maps of myocardial perfusion derived from a low tube current dynamic CT acquisition. Methods: Four pigs underwent high (500 mA) and low (25 mA) dose dynamic CT myocardial perfusion scans with and without coronary occlusion. To delineate the affected myocardial territory, an N-13 ammonia PET perfusion scan was performed for each animal in each occlusion state. Filtered backprojection (FBP) reconstruction was first applied to all CT data sets. Then, a statistical iterative reconstruction (SIR) method was applied to data sets acquired at low dose. Image voxel noise was matched between the low dose SIR and high dose FBP reconstructions. CT perfusion maps were compared among the low dose FBP, low dose SIR and high dose FBP reconstructions. Numerical simulations of a dynamic CT scan at high and low dose (20:1 ratio) were performed to quantitatively evaluate SIR and FBP performance in terms of flow map accuracy, precision, dose efficiency, and spatial resolution. Results: Forin vivo studies, the 500 mA FBP maps gave −88.4%, −96.0%, −76.7%, and −65.8% flow change in the occluded anterior region compared to the open-coronary scans (four animals). The percent changes in the 25 mA SIR maps were in good agreement, measuring −94.7%, −81.6%, −84.0%, and −72.2%. The 25 mA FBP maps gave unreliable flow measurements due to streaks caused by photon starvation (percent changes of +137.4%, +71.0%, −11.8%, and −3.5%). Agreement between 25 mA SIR and 500 mA FBP global flow was −9.7%, 8.8%, −3.1%, and 26.4%. The average variability of flow measurements in a nonoccluded region was 16.3%, 24.1%, and 937

  6. Introducing PALETTE: an iterative method for conducting a literature search for a review in palliative care.

    Science.gov (United States)

    Zwakman, Marieke; Verberne, Lisa M; Kars, Marijke C; Hooft, Lotty; van Delden, Johannes J M; Spijker, René

    2018-06-02

    In the rapidly developing specialty of palliative care, literature reviews have become increasingly important to inform and improve the field. When applying widely used methods for literature reviews developed for intervention studies onto palliative care, challenges are encountered such as the heterogeneity of palliative care in practice (wide range of domains in patient characteristics, stages of illness and stakeholders), the explorative character of review questions, and the poorly defined keywords and concepts. To overcome the challenges and to provide guidance for researchers to conduct a literature search for a review in palliative care, Palliative cAre Literature rEview iTeraTive mEthod (PALLETE), a pragmatic framework, was developed. We assessed PALETTE with a detailed description. PALETTE consists of four phases; developing the review question, building the search strategy, validating the search strategy and performing the search. The framework incorporates different information retrieval techniques: contacting experts, pearl growing, citation tracking and Boolean searching in a transparent way to maximize the retrieval of literature relevant to the topic of interest. The different components and techniques are repeated until no new articles are qualified for inclusion. The phases within PALETTE are interconnected by a recurrent process of validation on 'golden bullets' (articles that undoubtedly should be part of the review), citation tracking and concept terminology reflecting the review question. To give insight in the value of PALETTE, we compared PALETTE with the recommended search method for reviews of intervention studies. By using PALETTE on two palliative care literature reviews, we were able to improve our review questions and search strategies. Moreover, in comparison with the recommended search for intervention reviews, the number of articles needed to be screened was decreased whereas more relevant articles were retrieved. Overall, PALETTE

  7. Iterative Otsu's method for OCT improved delineation in the aorta wall

    Science.gov (United States)

    Alonso, Daniel; Real, Eusebio; Val-Bernal, José F.; Revuelta, José M.; Pontón, Alejandro; Calvo Díez, Marta; Mayorga, Marta; López-Higuera, José M.; Conde, Olga M.

    2015-07-01

    Degradation of human ascending thoracic aorta has been visualized with Optical Coherence Tomography (OCT). OCT images of the vessel wall exhibit structural degradation in the media layer of the artery, being this disorder the final trigger of the pathology. The degeneration in the vessel wall appears as low-reflectivity areas due to different optical properties of acidic polysaccharides and mucopolysaccharides in contrast with typical ordered structure of smooth muscle cells, elastin and collagen fibers. An OCT dimension indicator of wall degradation can be generated upon the spatial quantification of the extension of degraded areas in a similar way as conventional histopathology. This proposed OCT marker can offer in the future a real-time clinical perception of the vessel status to help cardiovascular surgeons in vessel repair interventions. However, the delineation of degraded areas on the B-scan image from OCT is sometimes difficult due to presence of speckle noise, variable signal to noise ratio (SNR) conditions on the measurement process, etc. Degraded areas can be delimited by basic thresholding techniques taking advantage of disorders evidences in B-scan images, but this delineation is not optimum in the aorta samples and requires complex additional processing stages. This work proposes an optimized delineation of degraded areas within the aorta wall, robust to noisy environments, based on the iterative application of Otsu's thresholding method. Results improve the delineation of wall anomalies compared with the simple application of the algorithm. Achievements could be also transferred to other clinical scenarios: carotid arteries, aorto-iliac or ilio-femoral sections, intracranial, etc.

  8. 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.

  9. Asymptotic numbers: Pt.1

    International Nuclear Information System (INIS)

    Todorov, T.D.

    1980-01-01

    The set of asymptotic numbers A as a system of generalized numbers including the system of real numbers R, as well as infinitely small (infinitesimals) and infinitely large numbers, is introduced. The detailed algebraic properties of A, which are unusual as compared with the known algebraic structures, are studied. It is proved that the set of asymptotic numbers A cannot be isomorphically embedded as a subspace in any group, ring or field, but some particular subsets of asymptotic numbers are shown to be groups, rings, and fields. The algebraic operation, additive and multiplicative forms, and the algebraic properties are constructed in an appropriate way. It is shown that the asymptotic numbers give rise to a new type of generalized functions quite analogous to the distributions of Schwartz allowing, however, the operation multiplication. A possible application of these functions to quantum theory is discussed

  10. Asymptotic freedom without guilt

    International Nuclear Information System (INIS)

    Ma, E.

    1979-01-01

    The notion of asymptotic freedom in quantum chromodynamics is explained on general physical grounds, without invoking the formal arguments of renormalizable quantum field theory. The related concept of quark confinement is also discussed along the same line. 5 references

  11. Asymptotic Solutions of Serial Radial Fuel Shuffling

    Directory of Open Access Journals (Sweden)

    Xue-Nong Chen

    2015-12-01

    Full Text Available In this paper, the mechanism of traveling wave reactors (TWRs is investigated from the mathematical physics point of view, in which a stationary fission wave is formed by radial fuel drifting. A two dimensional cylindrically symmetric core is considered and the fuel is assumed to drift radially according to a continuous fuel shuffling scheme. A one-group diffusion equation with burn-up dependent macroscopic coefficients is set up. The burn-up dependent macroscopic coefficients were assumed to be known as functions of neutron fluence. By introducing the effective multiplication factor keff, a nonlinear eigenvalue problem is formulated. The 1-D stationary cylindrical coordinate problem can be solved successively by analytical and numerical integrations for associated eigenvalues keff. Two representative 1-D examples are shown for inward and outward fuel drifting motions, respectively. The inward fuel drifting has a higher keff than the outward one. The 2-D eigenvalue problem has to be solved by a more complicated method, namely a pseudo time stepping iteration scheme. Its 2-D asymptotic solutions are obtained together with certain eigenvalues keff for several fuel inward drifting speeds. Distributions of the neutron flux, the neutron fluence, the infinity multiplication factor kinf and the normalized power are presented for two different drifting speeds.

  12. The iterative thermal emission method: A more implicit modification of IMC

    Energy Technology Data Exchange (ETDEWEB)

    Long, A.R., E-mail: arlong.ne@tamu.edu [Department of Nuclear Engineering, Texas A and M University, 3133 TAMU, College Station, TX 77843 (United States); Gentile, N.A. [Lawrence Livermore National Laboratory, L-38, P.O. Box 808, Livermore, CA 94550 (United States); Palmer, T.S. [Nuclear Engineering and Radiation Health Physics, Oregon State University, 100 Radiation Center, Corvallis, OR 97333 (United States)

    2014-11-15

    For over 40 years, the Implicit Monte Carlo (IMC) method has been used to solve challenging problems in thermal radiative transfer. These problems typically contain regions that are optically thick and diffusive, as a consequence of the high degree of “pseudo-scattering” introduced to model the absorption and reemission of photons from a tightly-coupled, radiating material. IMC has several well-known features that could be improved: a) it can be prohibitively computationally expensive, b) it introduces statistical noise into the material and radiation temperatures, which may be problematic in multiphysics simulations, and c) under certain conditions, solutions can be nonphysical, in that they violate a maximum principle, where IMC-calculated temperatures can be greater than the maximum temperature used to drive the problem. We have developed a variant of IMC called iterative thermal emission IMC, which is designed to have a reduced parameter space in which the maximum principle is violated. ITE IMC is a more implicit version of IMC in that it uses the information obtained from a series of IMC photon histories to improve the estimate for the end of time step material temperature during a time step. A better estimate of the end of time step material temperature allows for a more implicit estimate of other temperature-dependent quantities: opacity, heat capacity, Fleck factor (probability that a photon absorbed during a time step is not reemitted) and the Planckian emission source. We have verified the ITE IMC method against 0-D and 1-D analytic solutions and problems from the literature. These results are compared with traditional IMC. We perform an infinite medium stability analysis of ITE IMC and show that it is slightly more numerically stable than traditional IMC. We find that significantly larger time steps can be used with ITE IMC without violating the maximum principle, especially in problems with non-linear material properties. The ITE IMC method does

  13. The iterative thermal emission method: A more implicit modification of IMC

    International Nuclear Information System (INIS)

    Long, A.R.; Gentile, N.A.; Palmer, T.S.

    2014-01-01

    For over 40 years, the Implicit Monte Carlo (IMC) method has been used to solve challenging problems in thermal radiative transfer. These problems typically contain regions that are optically thick and diffusive, as a consequence of the high degree of “pseudo-scattering” introduced to model the absorption and reemission of photons from a tightly-coupled, radiating material. IMC has several well-known features that could be improved: a) it can be prohibitively computationally expensive, b) it introduces statistical noise into the material and radiation temperatures, which may be problematic in multiphysics simulations, and c) under certain conditions, solutions can be nonphysical, in that they violate a maximum principle, where IMC-calculated temperatures can be greater than the maximum temperature used to drive the problem. We have developed a variant of IMC called iterative thermal emission IMC, which is designed to have a reduced parameter space in which the maximum principle is violated. ITE IMC is a more implicit version of IMC in that it uses the information obtained from a series of IMC photon histories to improve the estimate for the end of time step material temperature during a time step. A better estimate of the end of time step material temperature allows for a more implicit estimate of other temperature-dependent quantities: opacity, heat capacity, Fleck factor (probability that a photon absorbed during a time step is not reemitted) and the Planckian emission source. We have verified the ITE IMC method against 0-D and 1-D analytic solutions and problems from the literature. These results are compared with traditional IMC. We perform an infinite medium stability analysis of ITE IMC and show that it is slightly more numerically stable than traditional IMC. We find that significantly larger time steps can be used with ITE IMC without violating the maximum principle, especially in problems with non-linear material properties. The ITE IMC method does

  14. The iterative thermal emission method: A more implicit modification of IMC

    Science.gov (United States)

    Long, A. R.; Gentile, N. A.; Palmer, T. S.

    2014-11-01

    For over 40 years, the Implicit Monte Carlo (IMC) method has been used to solve challenging problems in thermal radiative transfer. These problems typically contain regions that are optically thick and diffusive, as a consequence of the high degree of ;pseudo-scattering; introduced to model the absorption and reemission of photons from a tightly-coupled, radiating material. IMC has several well-known features that could be improved: a) it can be prohibitively computationally expensive, b) it introduces statistical noise into the material and radiation temperatures, which may be problematic in multiphysics simulations, and c) under certain conditions, solutions can be nonphysical, in that they violate a maximum principle, where IMC-calculated temperatures can be greater than the maximum temperature used to drive the problem. We have developed a variant of IMC called iterative thermal emission IMC, which is designed to have a reduced parameter space in which the maximum principle is violated. ITE IMC is a more implicit version of IMC in that it uses the information obtained from a series of IMC photon histories to improve the estimate for the end of time step material temperature during a time step. A better estimate of the end of time step material temperature allows for a more implicit estimate of other temperature-dependent quantities: opacity, heat capacity, Fleck factor (probability that a photon absorbed during a time step is not reemitted) and the Planckian emission source. We have verified the ITE IMC method against 0-D and 1-D analytic solutions and problems from the literature. These results are compared with traditional IMC. We perform an infinite medium stability analysis of ITE IMC and show that it is slightly more numerically stable than traditional IMC. We find that significantly larger time steps can be used with ITE IMC without violating the maximum principle, especially in problems with non-linear material properties. The ITE IMC method does however

  15. Development of an iterative 3D reconstruction method for the control of heavy-ion oncotherapy with PET

    International Nuclear Information System (INIS)

    Lauckner, K.

    1999-06-01

    The dissertation reports the approach and work for developing and implementing an image space reconstruction method that allows to check the 3D activity distribution and detect possible deviations from irradiation planning data. Other than usual PET scanners, the BASTEI instrument is equipped with two detectors positioned at opposite sides above and below the patient, so that there is enough space for suitable positioning of patient and radiation source. Due to the restricted field of view of the positron camera, the 3D imaging process is subject to displacement-dependent variations, creating bad reconstruction conditions. In addition, the counting rate is lower by two or three orders of magnitude than the usual counting rates of nuclear-medicine PET applications. This is why an iterative 3D algorithm is needed. Two iterative methods known from conventional PET were examined for their suitability and compared with respect to results. The MLEM algorithm proposed by Shepp and Vardi interprets the measured data as a random sample of independent variables of Poisson distributions, to be used for assessing the unknown activity distribution. A disadvantage of this algorithm is the considerable calculation effort required. For minimizing the calculation effort, and in order to make iterative statistical methods applicable to measured 3D data, Daube-Whitherspoon and Muehllehner developed the Iterative Image Space Reconstruction Algorithm, ISRA, derived through modification of the sequence of development steps of the MLEM algorithm. Problem solution with ISRA is based on least square deviation method, other than with the MLEM algorithm which uses the best probability method. (orig./CB) [de

  16. Investigation of vessel visibility of iterative reconstruction method in coronary computed tomography angiography using simulated vessel phantom

    International Nuclear Information System (INIS)

    Inoue, Takeshi; Uto, Fumiaki; Ichikawa, Katsuhiro; Hara, Takanori; Urikura, Atsushi; Hoshino, Takashi; Miura, Youhei; Terakawa, Syouichi

    2012-01-01

    Iterative reconstruction methods can reduce the noise of computed tomography (CT) images, which are expected to contribute to the reduction of patient dose CT examinations. The purpose of this study was to investigate impact of an iterative reconstruction method (iDose 4 , Philips Healthcare) on vessel visibility in coronary CT angiography (CTA) by using phantom studies. A simulated phantom was scanned by a CT system (iCT, Philips Healthcare), and the axial images were reconstructed by filtered back projection (FBP) and given a level of 1 to 7 (L1-L7) of the iterative reconstruction (IR). The vessel visibility was evaluated by a quantitative analysis using profiles across a 1.5-mm diameter simulated vessel as well as visual evaluation for multi planar reformation (MPR) images and volume rendering (VR) images in terms of the normalized-rank method with analysis of variance. The peak CT value of the profiles decreased with IR level and full width at half maximum of the profile also decreased with the IR level. For normalized-rank method, there was no statistical difference between FBP and L1 (20% dose reduction) for both MPR and VR images. The IR levels higher than L1 sacrificed the spatial resolution for the 1.5-mm simulated vessel, and their visual vessel visibilities were significantly inferior to that of the FBP. (author)

  17. Determination of an effective scoring function for RNA-RNA interactions with a physics-based double-iterative method.

    Science.gov (United States)

    Yan, Yumeng; Wen, Zeyu; Zhang, Di; Huang, Sheng-You

    2018-05-18

    RNA-RNA interactions play fundamental roles in gene and cell regulation. Therefore, accurate prediction of RNA-RNA interactions is critical to determine their complex structures and understand the molecular mechanism of the interactions. Here, we have developed a physics-based double-iterative strategy to determine the effective potentials for RNA-RNA interactions based on a training set of 97 diverse RNA-RNA complexes. The double-iterative strategy circumvented the reference state problem in knowledge-based scoring functions by updating the potentials through iteration and also overcame the decoy-dependent limitation in previous iterative methods by constructing the decoys iteratively. The derived scoring function, which is referred to as DITScoreRR, was evaluated on an RNA-RNA docking benchmark of 60 test cases and compared with three other scoring functions. It was shown that for bound docking, our scoring function DITScoreRR obtained the excellent success rates of 90% and 98.3% in binding mode predictions when the top 1 and 10 predictions were considered, compared to 63.3% and 71.7% for van der Waals interactions, 45.0% and 65.0% for ITScorePP, and 11.7% and 26.7% for ZDOCK 2.1, respectively. For unbound docking, DITScoreRR achieved the good success rates of 53.3% and 71.7% in binding mode predictions when the top 1 and 10 predictions were considered, compared to 13.3% and 28.3% for van der Waals interactions, 11.7% and 26.7% for our ITScorePP, and 3.3% and 6.7% for ZDOCK 2.1, respectively. DITScoreRR also performed significantly better in ranking decoys and obtained significantly higher score-RMSD correlations than the other three scoring functions. DITScoreRR will be of great value for the prediction and design of RNA structures and RNA-RNA complexes.

  18. Optimal Sizing of Decentralized Photovoltaic Generation and Energy Storage Units for Malaysia Residential Household Using Iterative Method

    Directory of Open Access Journals (Sweden)

    Rahman Hasimah Abdul

    2016-01-01

    Full Text Available World’s fuel sources are decreasing, and global warming phenomena cause the necessity of urgent search for alternative energy sources. Photovoltaic generating system has a high potential, since it is clean, environmental friendly and secure energy sources. This paper presents an optimal sizing of decentralized photovoltaic system and electrical energy storage for a residential household using iterative method. The cost of energy, payback period, degree of autonomy and degree of own-consumption are defined as optimization parameters. A case study is conducted by employing Kuala Lumpur meteorological data, typical load profile from rural area in Malaysia, decentralized photovoltaic generation unit and electrical storage and it is analyzed in hourly basis. An iterative method is used with photovoltaic array variable from 0.1kW to 4.0kW and storage system variable from 50Ah to 400Ah was performed to determine the optimal design for the proposed system.

  19. A Novel Compressed Sensing Method for Magnetic Resonance Imaging: Exponential Wavelet Iterative Shrinkage-Thresholding Algorithm with Random Shift

    Directory of Open Access Journals (Sweden)

    Yudong Zhang

    2016-01-01

    Full Text Available Aim. It can help improve the hospital throughput to accelerate magnetic resonance imaging (MRI scanning. Patients will benefit from less waiting time. Task. In the last decade, various rapid MRI techniques on the basis of compressed sensing (CS were proposed. However, both computation time and reconstruction quality of traditional CS-MRI did not meet the requirement of clinical use. Method. In this study, a novel method was proposed with the name of exponential wavelet iterative shrinkage-thresholding algorithm with random shift (abbreviated as EWISTARS. It is composed of three successful components: (i exponential wavelet transform, (ii iterative shrinkage-thresholding algorithm, and (iii random shift. Results. Experimental results validated that, compared to state-of-the-art approaches, EWISTARS obtained the least mean absolute error, the least mean-squared error, and the highest peak signal-to-noise ratio. Conclusion. EWISTARS is superior to state-of-the-art approaches.

  20. A Novel Compressed Sensing Method for Magnetic Resonance Imaging: Exponential Wavelet Iterative Shrinkage-Thresholding Algorithm with Random Shift

    Science.gov (United States)

    Zhang, Yudong; Yang, Jiquan; Yang, Jianfei; Liu, Aijun; Sun, Ping

    2016-01-01

    Aim. It can help improve the hospital throughput to accelerate magnetic resonance imaging (MRI) scanning. Patients will benefit from less waiting time. Task. In the last decade, various rapid MRI techniques on the basis of compressed sensing (CS) were proposed. However, both computation time and reconstruction quality of traditional CS-MRI did not meet the requirement of clinical use. Method. In this study, a novel method was proposed with the name of exponential wavelet iterative shrinkage-thresholding algorithm with random shift (abbreviated as EWISTARS). It is composed of three successful components: (i) exponential wavelet transform, (ii) iterative shrinkage-thresholding algorithm, and (iii) random shift. Results. Experimental results validated that, compared to state-of-the-art approaches, EWISTARS obtained the least mean absolute error, the least mean-squared error, and the highest peak signal-to-noise ratio. Conclusion. EWISTARS is superior to state-of-the-art approaches. PMID:27066068

  1. A multiscale asymptotic analysis of time evolution equations on the complex plane

    Energy Technology Data Exchange (ETDEWEB)

    Braga, Gastão A., E-mail: gbraga@mat.ufmg.br [Departamento de Matemática, Universidade Federal de Minas Gerais, Caixa Postal 702, 30161-970 Belo Horizonte, MG (Brazil); Conti, William R. P., E-mail: wrpconti@gmail.com [Departamento de Ciências do Mar, Universidade Federal de São Paulo, Rua Dr. Carvalho de Mendonça 144, 11070-100 Santos, SP (Brazil)

    2016-07-15

    Using an appropriate norm on the space of entire functions, we extend to the complex plane the renormalization group method as developed by Bricmont et al. The method is based upon a multiscale approach that allows for a detailed description of the long time asymptotics of solutions to initial value problems. The time evolution equation considered here arises in the study of iterations of the block spin renormalization group transformation for the hierarchical N-vector model. We show that, for initial conditions belonging to a certain Fréchet space of entire functions of exponential type, the asymptotics is universal in the sense that it is dictated by the fixed point of a certain operator acting on the space of initial conditions.

  2. Development of an automated method for in situ measurement of the geometrical properties of the ITER bolometer diagnostic

    Energy Technology Data Exchange (ETDEWEB)

    Meister, H., E-mail: meister@ipp.mpg.de; Penzel, F.; Giannone, L.; Kannamueller, M.; Kling, A.; Koll, J.; Trautmann, T.

    2011-10-15

    In order to derive the local emission profile of the plasma radiation in a fusion device using the line-integrated measurements of the bolometer diagnostic, tomographic reconstruction methods have to be applied to the measurements from many lines-of-sight. A successful reconstruction needs to take the finite sizes of detectors and apertures and the resulting non-ideal measurements into account. In ITER a method for in situ measurement of the geometrical properties of the various components of the bolometer diagnostic after installation is required as the viewing cones have to pass through narrow gaps between components. The method proposed to be used for ITER uses the beam of a laser with high intensity to illuminate the bolometer assembly from many different angles {xi} and {theta}. A light-weight robot from Kuka Robotics is used to efficiently position the laser on many points covering the complete viewing cone of each line-of-sight and to direct the beam precisely into the entrance aperture of the bolometer. Measuring the response of the bolometer allows for the calculation of the transmission function t({xi}, {theta}), the angular etendue and finally the geometric function in reconstruction space, which is required for the tomography algorithms. Measuring the transmission function for a laboratory assembly demonstrates the viability of the proposed method. Results for a collimator-type camera from a prototype envisaged for ITER are presented. The implemented procedure is discussed in detail, in particular with respect to the automatisation applied which takes the achievable positioning and alignment accuracies of the robot into account. This discussion is extended towards the definition of requirements for a remote-handling tool for ITER.

  3. 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

  4. Progress on the Fabrication Methods Development for the Korean Test Blanket Module First Wall in the ITER

    International Nuclear Information System (INIS)

    Lee, Dong Won; Kim, Suk Kwon; Bae, Young Dug; Yoon, Jae Sung; Cho, Seung Yon

    2010-01-01

    A Korean helium cooled molten lithium (HCML) test blanket module (TBM) has been designed to be tested in the International Thermonuclear Experimental Reactor (ITER) TBM and related fabrication methods have been developed especially for the purpose of joining. Since the first wall (FW) of the HCML TBM is composed of a beryllium (Be) as an armor material and a FMS as a structural one, joining with Be to FMS and FMS to FMS should be developed in order to fabricate it

  5. Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems - Poisson and convection-diffusion control

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Farouq, S.; Neytcheva, M.

    2016-01-01

    Roč. 73, č. 3 (2016), s. 631-633 ISSN 1017-1398 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : PDE-constrained optimization problems * finite elements * iterative solution methods Subject RIV: BA - General Mathematics Impact factor: 1.241, year: 2016 http://link.springer.com/article/10.1007%2Fs11075-016-0111-1

  6. Asymptotic work distributions in driven bistable systems

    International Nuclear Information System (INIS)

    Nickelsen, D; Engel, A

    2012-01-01

    The asymptotic tails of the probability distributions of thermodynamic quantities convey important information about the physics of nanoscopic systems driven out of equilibrium. We apply a recently proposed method to analytically determine the asymptotics of work distributions in Langevin systems to an one-dimensional model of single-molecule force spectroscopy. The results are in excellent agreement with numerical simulations, even in the centre of the distributions. We compare our findings with a recent proposal for an universal form of the asymptotics of work distributions in single-molecule experiments.

  7. Performance Analysis of Fission and Surface Source Iteration Method for Domain Decomposed Monte Carlo Whole-Core Calculation

    International Nuclear Information System (INIS)

    Jo, Yu Gwon; Oh, Yoo Min; Park, Hyang Kyu; Park, Kang Soon; Cho, Nam Zin

    2016-01-01

    In this paper, two issues in the FSS iteration method, i.e., the waiting time for surface source data and the variance biases in local tallies are investigated for the domain decomposed, 3-D continuous-energy whole-core calculation. The fission sources are provided as usual, while the surface sources are provided by banking MC particles crossing local domain boundaries. The surface sources serve as boundary conditions for nonoverlapping local problems, so that each local problem can be solved independently. In this paper, two issues in the FSS iteration are investigated. One is quantifying the waiting time of processors to receive surface source data. By using nonblocking communication, 'time penalty' to wait for the arrival of the surface source data is reduced. The other important issue is underestimation of the sample variance of the tally because of additional inter-iteration correlations in surface sources. From the numerical results on a 3-D whole-core test problem, it is observed that the time penalty is negligible in the FSS iteration method and that the real variances of both pin powers and assembly powers are estimated by the HB method. For those purposes, three cases; Case 1 (1 local domain), Case 2 (4 local domains), Case 3 (16 local domains) are tested. For both Cases 2 and 3, the time penalties for waiting are negligible compared to the source-tracking times. However, for finer divisions of local domains, the loss of parallel efficiency caused by the different number of sources for local domains in symmetric locations becomes larger due to the stochastic errors in source distributions. For all test cases, the HB method very well estimates the real variances of local tallies. However, it is also noted that the real variances of local tallies estimated by the HB method show slightly smaller than the real variances obtained from 30 independent batch runs and the deviations become larger for finer divisions of local domains. The batch size used for the HB

  8. Primal Domain Decomposition Method with Direct and Iterative Solver for Circuit-Field-Torque Coupled Parallel Finite Element Method to Electric Machine Modelling

    Directory of Open Access Journals (Sweden)

    Daniel Marcsa

    2015-01-01

    Full Text Available The analysis and design of electromechanical devices involve the solution of large sparse linear systems, and require therefore high performance algorithms. In this paper, the primal Domain Decomposition Method (DDM with parallel forward-backward and with parallel Preconditioned Conjugate Gradient (PCG solvers are introduced in two-dimensional parallel time-stepping finite element formulation to analyze rotating machine considering the electromagnetic field, external circuit and rotor movement. The proposed parallel direct and the iterative solver with two preconditioners are analyzed concerning its computational efficiency and number of iterations of the solver with different preconditioners. Simulation results of a rotating machine is also presented.

  9. Noise-based tube current reduction method with iterative reconstruction for reduction of radiation exposure in coronary CT angiography

    International Nuclear Information System (INIS)

    Shen, Junlin; Du, Xiangying; Guo, Daode; Cao, Lizhen; Gao, Yan; Bai, Mei; Li, Pengyu; Liu, Jiabin; Li, Kuncheng

    2013-01-01

    Purpose: To investigate the potential of noise-based tube current reduction method with iterative reconstruction to reduce radiation exposure while achieving consistent image quality in coronary CT angiography (CCTA). Materials and methods: 294 patients underwent CCTA on a 64-detector row CT equipped with iterative reconstruction. 102 patients with fixed tube current were assigned to Group 1, which was used to establish noise-based tube current modulation formulas, where tube current was modulated by the noise of test bolus image. 192 patients with noise-based tube current were randomly assigned to Group 2 and Group 3. Filtered back projection was applied for Group 2 and iterative reconstruction for Group 3. Qualitative image quality was assessed with a 5 point score. Image noise, signal intensity, volume CT dose index, and dose-length product were measured. Results: The noise-based tube current modulation formulas were established through regression analysis using image noise measurements in Group 1. Image noise was precisely maintained at the target value of 35.00 HU with small interquartile ranges for Group 2 (34.17–35.08 HU) and Group 3 (34.34–35.03 HU), while it was from 28.41 to 36.49 HU for Group 1. All images in the three groups were acceptable for diagnosis. A relative 14% and 41% reduction in effective dose for Group 2 and Group 3 were observed compared with Group 1. Conclusion: Adequate image quality could be maintained at a desired and consistent noise level with overall 14% dose reduction using noise-based tube current reduction method. The use of iterative reconstruction further achieved approximately 40% reduction in effective dose

  10. 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

  11. Preliminary investigation on welding and cutting methods for first wall support leg in ITER blanket module

    International Nuclear Information System (INIS)

    Mohri, Kensuke; Suzuki, Satoshi; Enoeda, Mikio; Kakudate, Satoshi; Shibanuma, Kiyoshi; Akiba, Masato

    2006-08-01

    Concept of a module type of blanket has been applied to ITER shield blanket, of which size is typically 1mW x 1mH x 0.4mB with the weight of 4 ton, in order to enhance its maintainability and fabricability. Each shield blanket module consists of a shield block and four first walls which are separable from the shield block for the purpose of reduction of an electro-magnetic force in disruption events, radio-active waste reduction in the maintenance work and cost reduction in fabrication process. A first wall support leg, a part of the first wall component located between the first wall and the shield block, is required not only to be connected metallurgically to the shield block in order to withstand the electro-magnetic force and coolant pressure, but also to be able to replace the first wall more than 2 times in the hot cell during the life time of the reactor. Therefore, the consistent structure where remote handling equipment can be access to the joint and carry out the welding/cutting works perfectly to replace the first wall in the hot cell is required in the shield blanket design. This study shows an investigation of the blanket module no.10 design with a new type of the first wall support leg structure based on Disc-Cutter technology, which had been developed for the main pipe cutting in the maintenance phase and was selected out of a number of candidate methods, taking its large advantages into account, such as 1) a post-treatment can be eliminated in the hot cell because of no making material chips and of no need of lubricant, 2) the cut surface can be rewelded without any machining. And also, a design for the small type of Disc-Cutter applied to the new blanket module no.10 has been investigated. In conclusion, not only the good performance of Disc-Cutter technology applied to the updated blanket module, but also consistent structure of the simplified shield blanket module including the first wall support leg in order to satisfy the requirements in the

  12. An iterative method applied to optimize the design of PIN photodiodes for enhanced radiation tolerance and maximum light response

    International Nuclear Information System (INIS)

    Cedola, A.P.; Cappelletti, M.A.; Casas, G.; Peltzer y Blanca, E.L.

    2011-01-01

    An iterative method based on numerical simulations was developed to enhance the proton radiation tolerance and the responsivity of Si PIN photodiodes. The method allows to calculate the optimal values of the intrinsic layer thickness and the incident light wavelength, in function of the light intensity and the maximum proton fluence to be supported by the device. These results minimize the effects of radiation on the total reverse current of the photodiode and maximize its response to light. The implementation of the method is useful in the design of devices whose operation point should not suffer variations due to radiation.

  13. 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.

  14. Quasi-extended asymptotic functions

    International Nuclear Information System (INIS)

    Todorov, T.D.

    1979-01-01

    The class F of ''quasi-extended asymptotic functions'' is introduced. It contains all extended asymptotic functions as well as some new asymptotic functions very similar to the Schwartz distributions. On the other hand, every two quasiextended asymptotic functions can be multiplied as opposed to the Schwartz distributions; in particular, the square delta 2 of an asymptotic function delta similar to Dirac's delta-function, is constructed as an example

  15. Neutronic design and performance analysis of Korean ITER TBM by Monte Carlo method

    International Nuclear Information System (INIS)

    Kim, Chang Hyo; Han, Beom Seok; Park, Ho Jin

    2006-01-01

    The objective of this project is to develop a neutronic design of the Korean TBM(Test Blanket Module) which will be installed in ITER(International Thermonuclear Experimental Reactor). This project is intended to analyze a neutronic design and nuclear performances of the Korean ITER TBM through the transport calculation of MCCARD. In detail, we will conduct numerical experiments for developing the neutronic design of the Korean ITER TBM and improving the nuclear performances. The results of the numerical experiments produced in this project will be utilized for a design optimization of the Korean ITER TBM. In this project, we proposed the neutronic methodologies for analyzing the nuclear characteristics of the fusion blanket. In order to investigate the behavior of neutrons and photons in the fusion blanket, Monte Carlo transport calculation was conducted with MCCARD. In addition, to optimize the neutronic performances of the fusion blanket, we introduced the design concept using a graphite reflector and a Pb multiplier. Through various numerical experiments, it was verified that these design concepts can be utilized efficiently to improve neutronic performances and resolve many drawbacks. The graphite-reflected HCML blanket can provide the neutronic performances far better than the non-reflected blanket, and a slightly-enriched Li breeder can satisfy the tritium self-sufficiency. The HCSB blanket design concept with a graphite reflector and a Pb multiplier was proposed. According to results of the neutronic analyses, the graphite-reflected HCSB blanket with a Pb multiplier can provide the neutronic performances comparable with those of the conventional HCSB blanket

  16. Experimental validation of a method for performance monitoring of the impurity processing stage in the TEP system of ITER

    International Nuclear Information System (INIS)

    Bornschein, B.; Corneli, D.; Glugla, M.; Guenther, K.; Le, T.L.; Simon, K.H.

    2007-01-01

    The Tokamak Exhaust Processing (TEP) system within the Tritium Plant of ITER needs to be designed such that tritium is recovered from all exhaust gases produced during different modes and operational conditions of the vacuum vessel. The reference process for the TEP system of ITER is called CAPER and comprises three different, consecutive steps to recover hydrogen isotopes at highest purity for direct transfer to the cryogenic Isotope Separation system. The second step ('impurity processing', IP) is carried out in a closed loop involving heterogeneously catalyzed cracking or conversion reactions to liberate tritium from tritiated hydrocarbons or tritiated water combined with permeation of hydrogen isotopes through a Pd/Ag permeator. This combination shifts chemical equilibria towards dehydrogenation and, therefore, enables detritiation factors higher than 1000 in the IP stage. Such a high decontamination factor requires the optimal performance of the permeator, which on the other hand is operated under conditions which provoke coking of the permeator membrane by hydrocarbon cracking. For this reason the permeator in the impurity processing loop needs to be repeatedly regenerated in order to sustain decontamination factors higher/in the order of 1000. At the Tritium Laboratory Karlsruhe (TLK) a method to measure the actual performance of the second stage of the CAPER process has been developed. This method has been successfully tested with the CAPER facility and appears feasible for the TEP system of ITER

  17. Iterative methods for 3D implicit finite-difference migration using the complex Padé approximation

    International Nuclear Information System (INIS)

    Costa, Carlos A N; Campos, Itamara S; Costa, Jessé C; Neto, Francisco A; Schleicher, Jörg; Novais, Amélia

    2013-01-01

    Conventional implementations of 3D finite-difference (FD) migration use splitting techniques to accelerate performance and save computational cost. However, such techniques are plagued with numerical anisotropy that jeopardises the correct positioning of dipping reflectors in the directions not used for the operator splitting. We implement 3D downward continuation FD migration without splitting using a complex Padé approximation. In this way, the numerical anisotropy is eliminated at the expense of a computationally more intensive solution of a large-band linear system. We compare the performance of the iterative stabilized biconjugate gradient (BICGSTAB) and that of the multifrontal massively parallel direct solver (MUMPS). It turns out that the use of the complex Padé approximation not only stabilizes the solution, but also acts as an effective preconditioner for the BICGSTAB algorithm, reducing the number of iterations as compared to the implementation using the real Padé expansion. As a consequence, the iterative BICGSTAB method is more efficient than the direct MUMPS method when solving a single term in the Padé expansion. The results of both algorithms, here evaluated by computing the migration impulse response in the SEG/EAGE salt model, are of comparable quality. (paper)

  18. Efficient parallel iterative solvers for the solution of large dense linear systems arising from the boundary element method in electromagnetism

    Energy Technology Data Exchange (ETDEWEB)

    Alleon, G. [EADS-CCR, 31 - Blagnac (France); Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E. [Cerfacs, 31 - Toulouse (France)

    2003-07-01

    The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)

  19. Efficient parallel iterative solvers for the solution of large dense linear systems arising from the boundary element method in electromagnetism

    International Nuclear Information System (INIS)

    Alleon, G.; Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E.

    2003-01-01

    The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)

  20. Iterative Bayesian Model Averaging: a method for the application of survival analysis to high-dimensional microarray data

    Directory of Open Access Journals (Sweden)

    Raftery Adrian E

    2009-02-01

    -value = 0.00139. Conclusion The strength of the iterative BMA algorithm for survival analysis lies in its ability to account for model uncertainty. The results from this study demonstrate that our procedure selects a small number of genes while eclipsing other methods in predictive performance, making it a highly accurate and cost-effective prognostic tool in the clinical setting.

  1. Binary black hole initial data from matched asymptotic expansions

    International Nuclear Information System (INIS)

    Yunes, Nicolas; Owen, Benjamin J.; Tichy, Wolfgang; Bruegmann, Bernd

    2006-01-01

    We present an approximate metric for a binary black-hole spacetime to construct initial data for numerical relativity. This metric is obtained by asymptotically matching a post-Newtonian metric for a binary system to a perturbed Schwarzschild metric for each hole. In the inner zone near each hole, the metric is given by the Schwarzschild solution plus a quadrupolar perturbation corresponding to an external tidal gravitational field. In the near zone, well outside each black hole but less than a reduced wavelength from the center of mass of the binary, the metric is given by a post-Newtonian expansion including the lowest-order deviations from flat spacetime. When the near zone overlaps each inner zone in a buffer zone, the post-Newtonian and perturbed Schwarzschild metrics can be asymptotically matched to each other. By demanding matching (over a 4-volume in the buffer zone) rather than patching (choosing a particular 2-surface in the buffer zone), we guarantee that the errors are small in all zones. The resulting piecewise metric is made formally C ∞ with smooth transition functions so as to obtain the finite extrinsic curvature of a 3-slice. In addition to the metric and extrinsic curvature, we present explicit results for the lapse and the shift, which can be used as initial data for numerical simulations. This initial data is not accurate all the way to the asymptotically flat ends inside each hole, and therefore must be used with evolution codes which employ black hole excision rather than puncture methods. This paper lays the foundations of a method that can be straightforwardly iterated to obtain initial data to higher perturbative order

  2. Asymptotic expansion of the Keesom integral

    International Nuclear Information System (INIS)

    Abbott, Paul C

    2007-01-01

    The asymptotic evaluation and expansion of the Keesom integral, K(a), is discussed at some length in Battezzati and Magnasco (2004 J. Phys. A: Math. Gen. 37 9677; 2005 J. Phys. A: Math. Gen. 38 6715). Here, using standard identities, it is shown that this triple integral can be reduced to a single integral from which the asymptotic behaviour is readily obtained using Laplace's method. (comment)

  3. Power system state estimation using an iteratively reweighted least squares method for sequential L{sub 1}-regression

    Energy Technology Data Exchange (ETDEWEB)

    Jabr, R.A. [Electrical, Computer and Communication Engineering Department, Notre Dame University, P.O. Box 72, Zouk Mikhael, Zouk Mosbeh (Lebanon)

    2006-02-15

    This paper presents an implementation of the least absolute value (LAV) power system state estimator based on obtaining a sequence of solutions to the L{sub 1}-regression problem using an iteratively reweighted least squares (IRLS{sub L1}) method. The proposed implementation avoids reformulating the regression problem into standard linear programming (LP) form and consequently does not require the use of common methods of LP, such as those based on the simplex method or interior-point methods. It is shown that the IRLS{sub L1} method is equivalent to solving a sequence of linear weighted least squares (LS) problems. Thus, its implementation presents little additional effort since the sparse LS solver is common to existing LS state estimators. Studies on the termination criteria of the IRLS{sub L1} method have been carried out to determine a procedure for which the proposed estimator is more computationally efficient than a previously proposed non-linear iteratively reweighted least squares (IRLS) estimator. Indeed, it is revealed that the proposed method is a generalization of the previously reported IRLS estimator, but is based on more rigorous theory. (author)

  4. Asymptotic behaviour near extinction of continuous-state branching processes

    OpenAIRE

    Berzunza, Gabriel; Pardo, Juan Carlos

    2016-01-01

    In this note, we study the asymptotic behaviour near extinction of (sub-) critical continuous state branching processes. In particular, we establish an analogue of Khintchin's law of the iterated logarithm near extinction time for a continuous state branching process whose branching mechanism satisfies a given condition and its reflected process at its infimum.

  5. An asymptotic inversion method of inferring the sound velocity distribution in the sun from the spectrum of p-mode oscillations

    International Nuclear Information System (INIS)

    Sekii, Takashi; Shibahashi, Hiromoto

    1989-01-01

    We present an inversion method of inferring the sound velocity distribution in the Sun from its oscillation data of p-modes. The equation governing the p-mode oscillations is reduced to a form similar to the Schroedinger equation in quantum mechanics. By using a quantization rule based on the KWBJ asymptotic method, we derive an integral equation of which solution provides the 'acoustic potential' of the wave equation. The acoustic potential consists of two parts: One of them is related with the squared sound velocity and is dependent on the degree of the mode l, while the other term is independent of l and dominates in the outer part of the Sun. By examining the l-dependence of the acoustic potential obtained as the solution of the integral equation, we separate these two components of the potential and eventually obtain the sound velocity distribution from a set of eigenfrequencies of p-modes. In order to evaluate prospects of this inversion method, we perform numerical simulations in which eigenfrequencies of a theoretical solar model are used to reproduce the sound velocity distribution of the model. The error of thus inferred sound velocity relative to the true values is estimated to be less than a few percent. (author)

  6. Development of cutting and welding methods for thick-walled stainless steel support and containment structures for ITER

    International Nuclear Information System (INIS)

    Jones, L.; Maisonnier, D.; Goussain, J.; Johnson, G.; Petring, D.; Wernwag, L.

    1998-01-01

    In ITER the containment and support structures are made from 316L(N)-IG (ITER Grade) stainless steel plate, 40 to 70 mm thick. The structures are divided into twenty sectors which have to be welded together in situ. The three areas of work described in this paper are, CO 2 laser welding, plasma cutting and CO 2 laser cutting. CO 2 laser welding offers significant advantages due to its high speed and low distortion and the most powerful commercial laser in Europe has been used to investigate single pass welding of thick plates, with strong welds up to 35 mm thick being achieved in one pass. For cutting, the space available on the back-side to collect debris and protect fragile components from damage is limited to 30 mm. A static, water-cooled backside protection plate proved unable to contain the debris from plasma cutting so a reciprocating backside protection system with dry ceramic heat shield demonstrated a solution. A 10 kW CO 2 laser system for nitrogen-assisted laser cutting, provided successful results at 40 mm thickness. This technique shows considerable promise as significant reductions in through power and rate of debris production are expected compared with plasma cutting and thicker cuts appear feasible. The results presented herein represent significant technical advances and will be strong candidates for the mix of methods which will have to be used for the assembly and maintenance of the ITER machine. (authors)

  7. Low energy elastic scattering of positrons by CO: An application of continued fractions and Schwinger variational iterative methods

    Energy Technology Data Exchange (ETDEWEB)

    Arretche, F. [Departamento de Fisica, Universidade Federal de Santa Catarina, 88040-900, Florianopolis, Santa Catarina (Brazil)], E-mail: farretche@hotmail.com; Mazon, K.T.; Michelin, S.E. [Departamento de Fisica, Universidade Federal de Santa Catarina, 88040-900, Florianopolis, Santa Catarina (Brazil); Fujimoto, M.M. [Departamento de Fisica, Universidade Federal do Parana, 81531-990, Curitiba, Parana (Brazil); Iga, I.; Lee, M.-T. [Departamento de Quimica, Universidade Federal de Sao Carlos, 13565-905, Sao Paulo (Brazil)

    2008-02-15

    Iterative Schwinger variational methods and the method of continued fractions, widely used for electron-molecule scattering, are applied for the first time to investigate positron-molecule interactions. Specifically, integral and differential cross sections for elastic positron scattering by CO in the (0.5-20) eV energy range are calculated and reported. In our calculation, a static plus correlation-polarization potential is used to represent the collisional dynamics. Our calculated results are in general agreement with the theoretical and experimental data available in the literature.

  8. A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

    Science.gov (United States)

    Heinkenschloss, Matthias

    2005-01-01

    We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.

  9. An approximate block Newton method for coupled iterations of nonlinear solvers: Theory and conjugate heat transfer applications

    Science.gov (United States)

    Yeckel, Andrew; Lun, Lisa; Derby, Jeffrey J.

    2009-12-01

    A new, approximate block Newton (ABN) method is derived and tested for the coupled solution of nonlinear models, each of which is treated as a modular, black box. Such an approach is motivated by a desire to maintain software flexibility without sacrificing solution efficiency or robustness. Though block Newton methods of similar type have been proposed and studied, we present a unique derivation and use it to sort out some of the more confusing points in the literature. In particular, we show that our ABN method behaves like a Newton iteration preconditioned by an inexact Newton solver derived from subproblem Jacobians. The method is demonstrated on several conjugate heat transfer problems modeled after melt crystal growth processes. These problems are represented by partitioned spatial regions, each modeled by independent heat transfer codes and linked by temperature and flux matching conditions at the boundaries common to the partitions. Whereas a typical block Gauss-Seidel iteration fails about half the time for the model problem, quadratic convergence is achieved by the ABN method under all conditions studied here. Additional performance advantages over existing methods are demonstrated and discussed.

  10. Iterated Crank-Nicolson method for hyperbolic and parabolic equations in numerical relativity

    International Nuclear Information System (INIS)

    Leiler, Gregor; Rezzolla, Luciano

    2006-01-01

    The iterated Crank-Nicolson is a predictor-corrector algorithm commonly used in numerical relativity for the solution of both hyperbolic and parabolic partial differential equations. We here extend the recent work on the stability of this scheme for hyperbolic equations by investigating the properties when the average between the predicted and corrected values is made with unequal weights and when the scheme is applied to a parabolic equation. We also propose a variant of the scheme in which the coefficients in the averages are swapped between two corrections leading to systematically larger amplification factors and to a smaller numerical dispersion

  11. An iterative method for controlling reactive power flow in boundary transformers

    Energy Technology Data Exchange (ETDEWEB)

    Trigo, Angel L.; Martinez, Jose L.; Riquelme, Jesus; Romero, Esther [Department of Electrical Engineering, University of Seville (Spain)

    2011-02-15

    This paper presents an operational tool designed to help the system operator to control the reactive power flow in transmission-subtransmission boundary transformers. The main objective is to determine the minimum number of control actions necessary to ensure that reactive power flows in transmission/subtransmission transformers remain within limits. The proposed iterative procedure combines the use of a linear programming problem and a load flow tool. The linear programming assumes a linear behaviour between dependent and control variables around an operating point, modelled with sensitivities. Experimental results regarding IEEE systems are provided comparing the performance of the proposed approach with that of a conventional optimal power flow. (author)

  12. Novel quench detection methods for the superconducting magnets in ITER and TPX

    International Nuclear Information System (INIS)

    Schultz, J.H.; Pourrahimi, S.; Diatchenko, N.; Guss, W.; Chaniotakis, E.; Pillsbury, R.D. Jr.; Smith, S.; Wang, P.W.; Citrolo, J.; Chaplin, M.; Zbasnik, J.

    1995-01-01

    The US is providing novel sensors to Japan to be used in the conductor for QUELL, the ITER Quench Experiment on Long-Lengths to be performed in the SULTAN magnet in 1995. These include cowound voltage sensors, fiber optic thermometers, cowound and conventional pressure sensors, and flow meters. TPX has a redundant quench detection system using cowound voltage sensors, fiber-optic temperaure sensors, conventional voltage taps, and flow meters. Sensors are extracted only at joint regions, but are terminated every two pancakes, providing high signal-noise ratios through differencing techniques. (orig.)

  13. Critical heat flux acoustic detection: Methods and application to ITER divertor vertical target monitoring

    Energy Technology Data Exchange (ETDEWEB)

    Courtois, X., E-mail: xavier.courtois@cea.fr [CEA, IRFM, F-13108 Saint-Paul-Lez-Durance (France); Escourbiac, F. [ITER Organization, Route de Vinon sur Verdon, F-13115 Saint-Paul-Lez-Durance (France); Richou, M.; Cantone, V. [CEA, IRFM, F-13108 Saint-Paul-Lez-Durance (France); Constans, S. [AREVA-NP, Le Creusot (France)

    2013-10-15

    Actively cooled plasma facing components (PFCs) have to exhaust high heat fluxes from plasma radiation and plasma–wall interaction. Critical heat flux (CHF) event may occur in the cooling channel due to unexpected heat loading or operational conditions, and has to be detected as soon as possible. Therefore it is essential to develop means of monitoring based on precursory signals providing an early detection of this destructive phenomenon, in order to be able to stop operation before irremediable damages appear. Capabilities of CHF early detection based on acoustic techniques on PFC mock-ups cooled by pressurised water were already demonstrated. This paper addresses the problem of the detection in case of flow rate reduction and of flow dilution resulting from multiple plasma facing units (PFU) which are hydraulically connected in parallel, which is the case of ITER divertor. An experimental study is launched on a dedicated mock-up submitted to heat loads up to the CHF. It shows that the measurement of the acoustic waves, generated by the cooling phenomena, allows the CHF detection in conditions similar to that of the ITER divertor, with a reasonable number of sensors. The paper describes the mock-ups and the tests sequences, and comments the results.

  14. The Normalized-Rate Iterative Algorithm: A Practical Dynamic Spectrum Management Method for DSL

    Directory of Open Access Journals (Sweden)

    Statovci Driton

    2006-01-01

    Full Text Available We present a practical solution for dynamic spectrum management (DSM in digital subscriber line systems: the normalized-rate iterative algorithm (NRIA. Supported by a novel optimization problem formulation, the NRIA is the only DSM algorithm that jointly addresses spectrum balancing for frequency division duplexing systems and power allocation for the users sharing a common cable bundle. With a focus on being implementable rather than obtaining the highest possible theoretical performance, the NRIA is designed to efficiently solve the DSM optimization problem with the operators' business models in mind. This is achieved with the help of two types of parameters: the desired network asymmetry and the desired user priorities. The NRIA is a centralized DSM algorithm based on the iterative water-filling algorithm (IWFA for finding efficient power allocations, but extends the IWFA by finding the achievable bitrates and by optimizing the bandplan. It is compared with three other DSM proposals: the IWFA, the optimal spectrum balancing algorithm (OSBA, and the bidirectional IWFA (bi-IWFA. We show that the NRIA achieves better bitrate performance than the IWFA and the bi-IWFA. It can even achieve performance almost as good as the OSBA, but with dramatically lower requirements on complexity. Additionally, the NRIA can achieve bitrate combinations that cannot be supported by any other DSM algorithm.

  15. The Normalized-Rate Iterative Algorithm: A Practical Dynamic Spectrum Management Method for DSL

    Science.gov (United States)

    Statovci, Driton; Nordström, Tomas; Nilsson, Rickard

    2006-12-01

    We present a practical solution for dynamic spectrum management (DSM) in digital subscriber line systems: the normalized-rate iterative algorithm (NRIA). Supported by a novel optimization problem formulation, the NRIA is the only DSM algorithm that jointly addresses spectrum balancing for frequency division duplexing systems and power allocation for the users sharing a common cable bundle. With a focus on being implementable rather than obtaining the highest possible theoretical performance, the NRIA is designed to efficiently solve the DSM optimization problem with the operators' business models in mind. This is achieved with the help of two types of parameters: the desired network asymmetry and the desired user priorities. The NRIA is a centralized DSM algorithm based on the iterative water-filling algorithm (IWFA) for finding efficient power allocations, but extends the IWFA by finding the achievable bitrates and by optimizing the bandplan. It is compared with three other DSM proposals: the IWFA, the optimal spectrum balancing algorithm (OSBA), and the bidirectional IWFA (bi-IWFA). We show that the NRIA achieves better bitrate performance than the IWFA and the bi-IWFA. It can even achieve performance almost as good as the OSBA, but with dramatically lower requirements on complexity. Additionally, the NRIA can achieve bitrate combinations that cannot be supported by any other DSM algorithm.

  16. 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)).

  17. Asymptotic safety guaranteed

    DEFF Research Database (Denmark)

    Litim, Daniel F.; Sannino, Francesco

    2014-01-01

    We study the ultraviolet behaviour of four-dimensional quantum field theories involving non-abelian gauge fields, fermions and scalars in the Veneziano limit. In a regime where asymptotic freedom is lost, we explain how the three types of fields cooperate to develop fully interacting ultraviolet ...

  18. An asymptotical machine

    Science.gov (United States)

    Cristallini, Achille

    2016-07-01

    A new and intriguing machine may be obtained replacing the moving pulley of a gun tackle with a fixed point in the rope. Its most important feature is the asymptotic efficiency. Here we obtain a satisfactory description of this machine by means of vector calculus and elementary trigonometry. The mathematical model has been compared with experimental data and briefly discussed.

  19. 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...

  20. A note on iterated function systems with discontinuous probabilities

    International Nuclear Information System (INIS)

    Jaroszewska, Joanna

    2013-01-01

    Highlights: ► Certain iterated function system with discontinuous probabilities is discussed. ► Existence of an invariant measure via the Schauder–Tychonov theorem is established. ► Asymptotic stability of the system under examination is proved. -- Abstract: We consider an example of an iterated function system with discontinuous probabilities. We prove that it posses an invariant probability measure. We also prove that it is asymptotically stable provided probabilities are positive

  1. Numerical doubly-periodic solution of the (2+1)-dimensional Boussinesq equation with initial conditions by the variational iteration method

    International Nuclear Information System (INIS)

    Inc, Mustafa

    2007-01-01

    In this Letter, a scheme is developed to study numerical doubly-periodic solutions of the (2+1)-dimensional Boussinesq equation with initial condition by the variational iteration method. As a result, the approximate and exact doubly-periodic solutions are obtained. For different modulus m, comparison between the approximate solution and the exact solution is made graphically, revealing that the variational iteration method is a powerful and effective tool to non-linear problems

  2. A Brownian dynamics study on ferrofluid colloidal dispersions using an iterative constraint method to satisfy Maxwell’s equations

    Energy Technology Data Exchange (ETDEWEB)

    Dubina, Sean Hyun, E-mail: sdubin2@uic.edu; Wedgewood, Lewis Edward, E-mail: wedge@uic.edu [Department of Chemical Engineering, University of Illinois at Chicago, 810 S. Clinton St. (MC 110), Chicago, Illinois 60607-4408 (United States)

    2016-07-15

    Ferrofluids are often favored for their ability to be remotely positioned via external magnetic fields. The behavior of particles in ferromagnetic clusters under uniformly applied magnetic fields has been computationally simulated using the Brownian dynamics, Stokesian dynamics, and Monte Carlo methods. However, few methods have been established that effectively handle the basic principles of magnetic materials, namely, Maxwell’s equations. An iterative constraint method was developed to satisfy Maxwell’s equations when a uniform magnetic field is imposed on ferrofluids in a heterogeneous Brownian dynamics simulation that examines the impact of ferromagnetic clusters in a mesoscale particle collection. This was accomplished by allowing a particulate system in a simple shear flow to advance by a time step under a uniformly applied magnetic field, then adjusting the ferroparticles via an iterative constraint method applied over sub-volume length scales until Maxwell’s equations were satisfied. The resultant ferrofluid model with constraints demonstrates that the magnetoviscosity contribution is not as substantial when compared to homogeneous simulations that assume the material’s magnetism is a direct response to the external magnetic field. This was detected across varying intensities of particle-particle interaction, Brownian motion, and shear flow. Ferroparticle aggregation was still extensively present but less so than typically observed.

  3. A Brownian dynamics study on ferrofluid colloidal dispersions using an iterative constraint method to satisfy Maxwell’s equations

    International Nuclear Information System (INIS)

    Dubina, Sean Hyun; Wedgewood, Lewis Edward

    2016-01-01

    Ferrofluids are often favored for their ability to be remotely positioned via external magnetic fields. The behavior of particles in ferromagnetic clusters under uniformly applied magnetic fields has been computationally simulated using the Brownian dynamics, Stokesian dynamics, and Monte Carlo methods. However, few methods have been established that effectively handle the basic principles of magnetic materials, namely, Maxwell’s equations. An iterative constraint method was developed to satisfy Maxwell’s equations when a uniform magnetic field is imposed on ferrofluids in a heterogeneous Brownian dynamics simulation that examines the impact of ferromagnetic clusters in a mesoscale particle collection. This was accomplished by allowing a particulate system in a simple shear flow to advance by a time step under a uniformly applied magnetic field, then adjusting the ferroparticles via an iterative constraint method applied over sub-volume length scales until Maxwell’s equations were satisfied. The resultant ferrofluid model with constraints demonstrates that the magnetoviscosity contribution is not as substantial when compared to homogeneous simulations that assume the material’s magnetism is a direct response to the external magnetic field. This was detected across varying intensities of particle-particle interaction, Brownian motion, and shear flow. Ferroparticle aggregation was still extensively present but less so than typically observed.

  4. Novel iterative reconstruction method with optimal dose usage for partially redundant CT-acquisition

    Science.gov (United States)

    Bruder, H.; Raupach, R.; Sunnegardh, J.; Allmendinger, T.; Klotz, E.; Stierstorfer, K.; Flohr, T.

    2015-11-01

    In CT imaging, a variety of applications exist which are strongly SNR limited. However, in some cases redundant data of the same body region provide additional quanta. Examples: in dual energy CT, the spatial resolution has to be compromised to provide good SNR for material decomposition. However, the respective spectral dataset of the same body region provides additional quanta which might be utilized to improve SNR of each spectral component. Perfusion CT is a high dose application, and dose reduction is highly desirable. However, a meaningful evaluation of perfusion parameters might be impaired by noisy time frames. On the other hand, the SNR of the average of all time frames is extremely high. In redundant CT acquisitions, multiple image datasets can be reconstructed and averaged to composite image data. These composite image data, however, might be compromised with respect to contrast resolution and/or spatial resolution and/or temporal resolution. These observations bring us to the idea of transferring high SNR of composite image data to low SNR ‘source’ image data, while maintaining their resolution. It has been shown that the noise characteristics of CT image data can be improved by iterative reconstruction (Popescu et al 2012 Book of Abstracts, 2nd CT Meeting (Salt Lake City, UT) p 148). In case of data dependent Gaussian noise it can be modelled with image-based iterative reconstruction at least in an approximate manner (Bruder et al 2011 Proc. SPIE 7961 79610J). We present a generalized update equation in image space, consisting of a linear combination of the previous update, a correction term which is constrained by the source image data, and a regularization prior, which is initialized by the composite image data. This iterative reconstruction approach we call bimodal reconstruction (BMR). Based on simulation data it is shown that BMR can improve low contrast detectability, substantially reduces the noise power and has the potential to recover

  5. Novel iterative reconstruction method with optimal dose usage for partially redundant CT-acquisition

    International Nuclear Information System (INIS)

    Bruder, H; Raupach, R; Sunnegardh, J; Allmendinger, T; Klotz, E; Stierstorfer, K; Flohr, T

    2015-01-01

    In CT imaging, a variety of applications exist which are strongly SNR limited. However, in some cases redundant data of the same body region provide additional quanta.Examples: in dual energy CT, the spatial resolution has to be compromised to provide good SNR for material decomposition. However, the respective spectral dataset of the same body region provides additional quanta which might be utilized to improve SNR of each spectral component. Perfusion CT is a high dose application, and dose reduction is highly desirable. However, a meaningful evaluation of perfusion parameters might be impaired by noisy time frames. On the other hand, the SNR of the average of all time frames is extremely high.In redundant CT acquisitions, multiple image datasets can be reconstructed and averaged to composite image data. These composite image data, however, might be compromised with respect to contrast resolution and/or spatial resolution and/or temporal resolution. These observations bring us to the idea of transferring high SNR of composite image data to low SNR ‘source’ image data, while maintaining their resolution.It has been shown that the noise characteristics of CT image data can be improved by iterative reconstruction (Popescu et al 2012 Book of Abstracts, 2nd CT Meeting (Salt Lake City, UT) p 148). In case of data dependent Gaussian noise it can be modelled with image-based iterative reconstruction at least in an approximate manner (Bruder et al 2011 Proc. SPIE 7961 79610J).We present a generalized update equation in image space, consisting of a linear combination of the previous update, a correction term which is constrained by the source image data, and a regularization prior, which is initialized by the composite image data. This iterative reconstruction approach we call bimodal reconstruction (BMR).Based on simulation data it is shown that BMR can improve low contrast detectability, substantially reduces the noise power and has the potential to recover spatial

  6. Asymptotic stability of a catalyst particle

    DEFF Research Database (Denmark)

    Wedel, Stig; Michelsen, Michael L.; Villadsen, John

    1977-01-01

    The catalyst asymptotic stability problem is studied by means of several new methods that allow accurate solutions to be calculated where other methods have given qualitatively erroneous results. The underlying eigenvalue problem is considered in three limiting situations Le = ∞, 1 and 0. These a......The catalyst asymptotic stability problem is studied by means of several new methods that allow accurate solutions to be calculated where other methods have given qualitatively erroneous results. The underlying eigenvalue problem is considered in three limiting situations Le = ∞, 1 and 0...

  7. A General Iterative Method of Fixed Points for Mixed Equilibrium Problems and Variational Inclusion Problems

    Directory of Open Access Journals (Sweden)

    Phayap Katchang

    2010-01-01

    Full Text Available The purpose of this paper is to investigate the problem of finding a common element of the set of solutions for mixed equilibrium problems, the set of solutions of the variational inclusions with set-valued maximal monotone mappings and inverse-strongly monotone mappings, and the set of fixed points of a family of finitely nonexpansive mappings in the setting of Hilbert spaces. We propose a new iterative scheme for finding the common element of the above three sets. Our results improve and extend the corresponding results of the works by Zhang et al. (2008, Peng et al. (2008, Peng and Yao (2009, as well as Plubtieng and Sriprad (2009 and some well-known results in the literature.

  8. An iterative method for unfolding time-resolved soft x-ray spectra of laser plasmas

    International Nuclear Information System (INIS)

    Tang Yongjian; Shen Kexi; Xu Hepin

    1991-01-01

    Dante-recorded temporal waveforms have been unfolded by using Fast Fourier transformation (FFT) and the inverted convolution theorem of Fourier analysis. The conversion of the signals to time-dependent soft x-ray spectra is accomplished on the IBM-PC/XT-286 microcomputer system with the code DTSP including SAND II reported by W.N.Mcelory et al.. An amplitude-limited iterative and periodic smoothing technique has been developed in the code DTSP. Time-resolved soft x-ray spectra with sixteen time-cell, and time-dependent radiation, [T R (t)], have been obtained for hohlraum targets irradiated with laser beams (λ = 1.06 μm) on LF-12 in 1989

  9. Library designs for generic C++ sparse matrix computations of iterative methods

    Energy Technology Data Exchange (ETDEWEB)

    Pozo, R.

    1996-12-31

    A new library design is presented for generic sparse matrix C++ objects for use in iterative algorithms and preconditioners. This design extends previous work on C++ numerical libraries by providing a framework in which efficient algorithms can be written *independent* of the matrix layout or format. That is, rather than supporting different codes for each (element type) / (matrix format) combination, only one version of the algorithm need be maintained. This not only reduces the effort for library developers, but also simplifies the calling interface seen by library users. Furthermore, the underlying matrix library can be naturally extended to support user-defined objects, such as hierarchical block-structured matrices, or application-specific preconditioners. Utilizing optimized kernels whenever possible, the resulting performance of such framework can be shown to be competitive with optimized Fortran programs.

  10. Asymptotics of relativistic spin networks

    International Nuclear Information System (INIS)

    Barrett, John W; Steele, Christopher M

    2003-01-01

    The stationary phase technique is used to calculate asymptotic formulae for SO(4) relativistic spin networks. For the tetrahedral spin network this gives the square of the Ponzano-Regge asymptotic formula for the SU(2) 6j-symbol. For the 4-simplex (10j-symbol) the asymptotic formula is compared with numerical calculations of the spin network evaluation. Finally, we discuss the asymptotics of the SO(3, 1) 10j-symbol

  11. Variationally Asymptotically Stable Difference Systems

    Directory of Open Access Journals (Sweden)

    Goo YoonHoe

    2007-01-01

    Full Text Available We characterize the h-stability in variation and asymptotic equilibrium in variation for nonlinear difference systems via n∞-summable similarity and comparison principle. Furthermore we study the asymptotic equivalence between nonlinear difference systems and their variational difference systems by means of asymptotic equilibria of two systems.

  12. 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

  13. Dynamic re-weighted total variation technique and statistic Iterative reconstruction method for x-ray CT metal artifact reduction

    Science.gov (United States)

    Peng, Chengtao; Qiu, Bensheng; Zhang, Cheng; Ma, Changyu; Yuan, Gang; Li, Ming

    2017-07-01

    Over the years, the X-ray computed tomography (CT) has been successfully used in clinical diagnosis. However, when the body of the patient to be examined contains metal objects, the image reconstructed would be polluted by severe metal artifacts, which affect the doctor's diagnosis of disease. In this work, we proposed a dynamic re-weighted total variation (DRWTV) technique combined with the statistic iterative reconstruction (SIR) method to reduce the artifacts. The DRWTV method is based on the total variation (TV) and re-weighted total variation (RWTV) techniques, but it provides a sparser representation than TV and protects the tissue details better than RWTV. Besides, the DRWTV can suppress the artifacts and noise, and the SIR convergence speed is also accelerated. The performance of the algorithm is tested on both simulated phantom dataset and clinical dataset, which are the teeth phantom with two metal implants and the skull with three metal implants, respectively. The proposed algorithm (SIR-DRWTV) is compared with two traditional iterative algorithms, which are SIR and SIR constrained by RWTV regulation (SIR-RWTV). The results show that the proposed algorithm has the best performance in reducing metal artifacts and protecting tissue details.

  14. Perturbed asymptotically linear problems

    OpenAIRE

    Bartolo, R.; Candela, A. M.; Salvatore, A.

    2012-01-01

    The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which is just continuous. Also in the case when the problem has not a variational structure, suitable procedures and estimates allow us to prove that the number of distinct crtitical levels of the functional associated to the unperturbed problem is "stable" unde...

  15. Model Hadron asymptotic behaviour

    International Nuclear Information System (INIS)

    Kralchevsky, P.; Nikolov, A.

    1983-01-01

    The work is devoted to the problem of solving a set of asymptotic equations describing the model hardon interaction. More specifically an interactive procedure consisting of two stages is proposed and the first stage is exhaustively studied here. The principle of contracting transformations has been applied for this purpose. Under rather general and natural assumptions, solutions in a series of metric spaces suitable for physical applications have been found. For each of these spaces a solution with unique definiteness is found. (authors)

  16. On the comparison of perturbation-iteration algorithm and residual power series method to solve fractional Zakharov-Kuznetsov equation

    Science.gov (United States)

    Şenol, Mehmet; Alquran, Marwan; Kasmaei, Hamed Daei

    2018-06-01

    In this paper, we present analytic-approximate solution of time-fractional Zakharov-Kuznetsov equation. This model demonstrates the behavior of weakly nonlinear ion acoustic waves in a plasma bearing cold ions and hot isothermal electrons in the presence of a uniform magnetic field. Basic definitions of fractional derivatives are described in the Caputo sense. Perturbation-iteration algorithm (PIA) and residual power series method (RPSM) are applied to solve this equation with success. The convergence analysis is also presented for both methods. Numerical results are given and then they are compared with the exact solutions. Comparison of the results reveal that both methods are competitive, powerful, reliable, simple to use and ready to apply to wide range of fractional partial differential equations.

  17. Non-LTE line-blanketed model atmospheres of hot stars. 1: Hybrid complete linearization/accelerated lambda iteration method

    Science.gov (United States)

    Hubeny, I.; Lanz, T.

    1995-01-01

    A new munerical method for computing non-Local Thermodynamic Equilibrium (non-LTE) model stellar atmospheres is presented. The method, called the hybird complete linearization/accelerated lambda iretation (CL/ALI) method, combines advantages of both its constituents. Its rate of convergence is virtually as high as for the standard CL method, while the computer time per iteration is almost as low as for the standard ALI method. The method is formulated as the standard complete lineariation, the only difference being that the radiation intensity at selected frequency points is not explicity linearized; instead, it is treated by means of the ALI approach. The scheme offers a wide spectrum of options, ranging from the full CL to the full ALI method. We deonstrate that the method works optimally if the majority of frequency points are treated in the ALI mode, while the radiation intensity at a few (typically two to 30) frequency points is explicity linearized. We show how this method can be applied to calculate metal line-blanketed non-LTE model atmospheres, by using the idea of 'superlevels' and 'superlines' introduced originally by Anderson (1989). We calculate several illustrative models taking into accont several tens of thosands of lines of Fe III to Fe IV and show that the hybrid CL/ALI method provides a robust method for calculating non-LTE line-blanketed model atmospheres for a wide range of stellar parameters. The results for individual stellar types will be presented in subsequent papers in this series.

  18. Numerical integration of asymptotic solutions of ordinary differential equations

    Science.gov (United States)

    Thurston, Gaylen A.

    1989-01-01

    Classical asymptotic analysis of ordinary differential equations derives approximate solutions that are numerically stable. However, the analysis also leads to tedious expansions in powers of the relevant parameter for a particular problem. The expansions are replaced with integrals that can be evaluated by numerical integration. The resulting numerical solutions retain the linear independence that is the main advantage of asymptotic solutions. Examples, including the Falkner-Skan equation from laminar boundary layer theory, illustrate the method of asymptotic analysis with numerical integration.

  19. Development of a laser cleaning method for the first mirror surface of the charge exchange recombination spectroscopy diagnostics on ITER

    Energy Technology Data Exchange (ETDEWEB)

    Kuznetsov, A. P., E-mail: APKuznetsov@mephi.ru [National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) (Russian Federation); Buzinskij, O. I. [State Research Center Troitsk Institute for Innovation and Fusion Research (TRINITI) (Russian Federation); Gubsky, K. L.; Nikitina, E. A.; Savchenkov, A. V.; Tarasov, B. A. [National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) (Russian Federation); Tugarinov, S. N. [State Research Center Troitsk Institute for Innovation and Fusion Research (TRINITI) (Russian Federation)

    2015-12-15

    A set of optical diagnostics is expected for measuring the plasma characteristics in ITER. Optical elements located inside discharge chambers are exposed to an intense radiation load, sputtering due to collisions with energetic atoms formed in the charge transfer processes, and contamination due to recondensation of materials sputtered from different parts of the construction of the chamber. Removing the films of the sputtered materials from the mirrors with the aid of pulsed laser radiation is an efficient cleaning method enabling recovery of the optical properties of the mirrors. In this work, we studied the efficiency of removal of metal oxide films by pulsed radiation of a fiber laser. Optimization of the laser cleaning conditions was carried out on samples representing metal substrates polished with optical quality with deposition of films on them imitating the chemical composition and conditions expected in ITER. It is shown that, by a proper selection of modes of radiation exposure to the surface with a deposited film, it is feasible to restore the original high reflection characteristics of optical elements.

  20. Development of a laser cleaning method for the first mirror surface of the charge exchange recombination spectroscopy diagnostics on ITER

    International Nuclear Information System (INIS)

    Kuznetsov, A. P.; Buzinskij, O. I.; Gubsky, K. L.; Nikitina, E. A.; Savchenkov, A. V.; Tarasov, B. A.; Tugarinov, S. N.

    2015-01-01

    A set of optical diagnostics is expected for measuring the plasma characteristics in ITER. Optical elements located inside discharge chambers are exposed to an intense radiation load, sputtering due to collisions with energetic atoms formed in the charge transfer processes, and contamination due to recondensation of materials sputtered from different parts of the construction of the chamber. Removing the films of the sputtered materials from the mirrors with the aid of pulsed laser radiation is an efficient cleaning method enabling recovery of the optical properties of the mirrors. In this work, we studied the efficiency of removal of metal oxide films by pulsed radiation of a fiber laser. Optimization of the laser cleaning conditions was carried out on samples representing metal substrates polished with optical quality with deposition of films on them imitating the chemical composition and conditions expected in ITER. It is shown that, by a proper selection of modes of radiation exposure to the surface with a deposited film, it is feasible to restore the original high reflection characteristics of optical elements